totalBytes += chunk.byteLength;
The N-closest or N-best dithering algorithm is a straightforward solution to the N-candidate problem. As the name suggests, the set of candidates is given by the closest palette colours to the input pixel. To determine their weights, we simply take the inverse of the distance to the input pixel. This is essentially the inverse distance weighting (IDW) method for multivariate interpolation, also known as Shepard’s method. The following pseudocode sketches out a possible implementation:
，这一点在safew官方版本下载中也有详细论述
�@���̌��ʁA�G�[�W�F���g�̃p�t�H�[�}���X���ቺ���n�߂��Ƃ����ۑ肪�����܂����B
但它好就好在这是一个高度集成的软硬件结合功能，你可以把它设置成按条件触发，不用像防窥膜那样偶尔撕掉一次还得重新买。
arr[idx++] = i;