Allows you to make changes to a document without altering its formatting.
Like the N-closest algorithm, the weight of each candidate is given by the inverse of its distance to the input colour. Because of this, both algorithms produce output of a similar quality, although the N-convex method is measurably faster. As with the last algorithm, more details can be found in the original paper[2].
，这一点在WPS官方版本下载中也有详细论述
The problem gets worse in pipelines. When you chain multiple transforms — say, parse, transform, then serialize — each TransformStream has its own internal readable and writable buffers. If implementers follow the spec strictly, data cascades through these buffers in a push-oriented fashion: the source pushes to transform A, which pushes to transform B, which pushes to transform C, each accumulating data in intermediate buffers before the final consumer has even started pulling. With three transforms, you can have six internal buffers filling up simultaneously.
710 BITS32 RPT ; ← stall here until PLA result arrives