Backpressure is strict by default. When a buffer is full, writes reject rather than silently accumulating. You can configure alternative policies — block until space is available, drop oldest, drop newest — but you have to choose explicitly. No more silent memory growth.
* 时间复杂度: O(n+k) 平均 空间复杂度: O(n+k) 稳定: 取决于桶内排序
，这一点在搜狗输入法下载中也有详细论述
Before there was Twitter, there was Mudkip.
const hookedSet = function (v) {