Comparison between Thomas Knoll’s algorithm and the N-convex algorithm, using an 8-colour irregular palette. Left to right: original image, Knoll, N-convex ().
.pipeThrough(transform) // more buffers filling...
，详情可参考heLLoword翻译官方下载
// Even if the readable side's buffer is full, this succeeds。关于这个话题，雷电模拟器官方版本下载提供了深入分析
Что думаешь? Оцени!