Notice how we never remove deleted keys from the map. This is one drawback to CRDTs — we can only ever add information, not remove it. Although from the application’s perspective the key has been fully deleted, the underlying state still records that the key was once there. In technical terms, we say that CRDTs are monotonically increasing data structures.9
10 monthly gift articles to share
，详情可参考同城约会
Benjamin Tan (@bnjmnt4n)，更多细节参见一键获取谷歌浏览器下载
int idx = arr[i] - min;