Myth

2^10 = 1024 10^3 = 1000 1个int = 4个字节 32位，去掉一位符号位，31位，2^31 = 2*(2^30) ≈ 2 * (10^9)

C++容器

1

C++中容器分为关联容器和顺序容器： - 关联容器中的元素是按关键字来保存和访问的 - 顺序容器中的元素是按它们在容器中的位置来顺序保存和访问的 关联容器支持高效的关键字查找与访问，两个主要的关联容器类型是map与set。 STL主要采用向量、链表、二叉树及他们的组合作为底层存储结构来实现容器。顺序容器主要采用向量和链表及其组合作为基本存储结构，如堆栈和各种队列，而关联式容器采用平衡二叉搜索树作为底层存储结构。

WeeklyContest128. 二分查找和序列划分

1

网址： https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/ 解读： https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/discuss/256737/C%2B%2B-Binary-Search

```C++ vector num; // 大整数 vector result; int K; // 正常整数 for (int j = 0; j < num.size(); j++) { sum = sum * 10 + num[j]; // 从第二位慢慢的增加，会出现很多前导0...

void quick_sort(int a[],int first,int last) { if(first=last) return; int povit = once_partition(a,first,last); quick_sort(a,0,povit-1); quick_sort(a,povit+1,last); }

Refactor the data migration code

6

### Search before asking - [X] I had searched in the [issues](https://github.com/apache/kvrocks/issues) and found no similar issues. ### Motivation Now that we have support for `DBIterator` and `WALIterator`, we can...

Improve slot migration speed and resource consumption using raw key values

15

### Motivation Currently, kvrocks performs slot migration by converting the data into RESP and then sending it to the destination(#430). We made a little optimizations in #904 to speed up...

Memory limits on connections

5

### Search before asking - [X] I had searched in the [issues](https://github.com/apache/kvrocks/issues) and found no similar issues. ### Motivation The lack of memory constraints in current Kvrocks can lead to...