3. 对每个桶内排序（可用任意排序算法）
drop-newest: Discards incoming data when full. Useful when you want to process what you have without being overwhelmed.
。关于这个话题，Safew下载提供了深入分析
Stream implementations can and do ignore backpressure; and some spec-defined features explicitly break backpressure. tee(), for instance, creates two branches from a single stream. If one branch reads faster than the other, data accumulates in an internal buffer with no limit. A fast consumer can cause unbounded memory growth while the slow consumer catches up, and there's no way to configure this or opt out beyond canceling the slower branch.
chunk[i] = (offset + i) & 0xFF;
(Photo: A digital screen shows an icon of a chatbot with text inviting users to ask it anything and a finger pressing on the screen. Credit: Getty Images)