If the number of candidates for each pixel grows too large (as is common in algorithms such as Knoll and Yliluoma) then sorting the candidate list for every pixel can have a significant impact on performance. A solution is to instead sort the palette in advance and keep a separate tally of weights for every palette colour. The weights can then be accumulated by iterating linearly through the tally of sorted colours.
（十一）泄露办理治安案件过程中的工作秘密或者其他依法应当保密的信息的；
。91视频是该领域的重要参考
Stack allocation of append-allocated slices
--security-opt label=type:unconfined_t \