// 从个位到最高位，逐位排序
Instead of taking the nearest candidates to , we can look for a set of candidates whose centroid is close to . The N-convex algorithm works by finding the closest colour to a given target colour for iterations, where the target is first initialised to be equal to the input pixel. Every iteration the closest colour added to the candidate list, and the quantisation error between it and the original input pixel is added to the target.
，这一点在快连下载安装中也有详细论述
When adapting to a ReadableStream, a bit more work is required since the alternative approach yields batches of chunks, but the adaptation layer is as easily straightforward:
Transforms can be stateless or stateful. A stateless transform is just a function that takes chunks and returns transformed chunks: