Transforms don't execute until the consumer pulls. There's no eager evaluation, no hidden buffering. Data flows on-demand from source, through transforms, to the consumer. If you stop iterating, processing stops.
This algorithm attempts to minimise numerically. Because of this, the quality of the dither produced by Knoll’s algorithm is much higher than any other of the N-candidate methods we have covered so far. It is also the slowest however, as it requires a greater per-pixel to be really effective. More details are given in Knoll’s now expired patent[3]. I have put together a GPU implementation of Knoll’s algorithm on Shadertoy here.
，详情可参考服务器推荐
记住，完成是对灵感最大的尊重。那些永远停留在“构想阶段”的杰作，和从未存在过毫无区别。先完成，再完美。写完，你就已经赢了八成。然后再改。一遍，两遍，直到它配得上你最初的愿景。
"She smashed it," he noted.
N-Closest Algorithm