2. Boost Unordered Translation (zh_Hans)
3. Chinese (Simplified Han script)
4. Zen

11 :59
	English __stats-type__
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — _stats-type_ 12/140 · 14 Needs editing
12 :12
	English xref:ref.adoc[]
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — xref:ref.adoc[参考文档] 19/150 · 15 Needs editing
12 :57
	English return seed; } }; ```
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — return seed; } }; ``` 21/210 · 21 Needs editing
12 :56
	English **Open-addressing containers** rely on much faster data structures and algorithms
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — **开放寻址容器**采用了更高效的数据结构与算法 24/810 · 81 Needs editing
12 :52
	English Swap
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 交换 2/100 · 4 Needs editing
12 :108
	English Statistics for three internal operations are maintained: insertions (without considering the previous lookup to determine that the key is not present yet), successful lookups, and unsuccessful lookups (including those issued internally when inserting elements). _Probe length_ is the number of xref:structures.adoc#structures_open_addressing_containers[bucket groups] accessed per operation. If the hash function behaves properly:
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 系统维护三类内部操作的统计信息：插入操作（不考虑先前查找键是否存在的操作）、成功查找及未命中查找（包括插入元素时触发的内部查询）。__探测长度__是指每次操作所访问的 xref:structures.adoc#structures_open_addressing_containers[桶组] 数量。若哈希函数表现正常： 160/4310 · 431 Needs editing
12 :76
	English ``` x.reserve(n); ```
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — ``` x.reserve(n); ``` 21/210 · 21 Needs editing
12 :25
	English Added `insert_and_visit(x, f1, f2)` and similar operations to concurrent containers, which
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 为并发容器新增 `insert_and_visit(x, f1, f2)` 及类似操作，这些操作 48/900 · 90 Needs editing
:24 :24
	English Fancy pointers
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 花式指针 4/140 · 14 Needs editing
12 :116
	English Visitation is prominent in the API provided by concurrent containers, and many classical operations have visitation-enabled variations:
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 访问机制在并发容器 API 中占据核心地位，许多经典操作都提供了支持访问机制的变体： 42/1350 · 135 Needs editing
12 :286
	English `Key` must be https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^] into the container
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — Key 必须满足 8/1080 · 108 Needs editing
12 :24
	English image::benchmarks-set/gcc/running insertion.xlsx.practice non-unique.png[width=250,link=_images/benchmarks-set/gcc/running insertion.xlsx.practice non-unique.png,window=_blank]
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — image::benchmarks-set/gcc/running insertion.xlsx.practice non-unique.png[width=250,link=_images/benchmarks-set/gcc/running insertion.xlsx.practice non-unique.png,window=_blank] 176/1760 · 176 Needs editing
12 :32
	English meet the complexity requirements.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 满足复杂度要求。 8/330 · 33 Needs editing
12 :246
	English _Pred_
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — _Pred_ 6/100 · 6 Needs editing
:48 :48
	English 2+^h| *All containers* h|*Method* h|*Description*
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 2+^h| *所有容器* h|*方法* h|*描述* 26/490 · 49 Needs editing
12 :254
	English _Hash_
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — _Hash_ 6/100 · 6 Needs editing
12 :358
	English into the table from any `std::pair` object convertible to it, and it also must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the table.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — `std::pair` 对象 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[原地构造] 到容器中，并且必须支持从容器中 https://en.cppreference.com/w/cpp/named_req/Erasable[擦除] 。 160/1610 · 161 Needs editing
12 :44
	English With a simple bucket group layout, this is all that must be done: ```c++ auto const idx = get_bucket_idx(hash_function(key)); node* n = buckets[idx]; // first load if (n) { value_type const& v = *n; // second load // ... } ```
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 使用简单的桶组布局，只需执行以下操作：```c++auto const idx = get_bucket_idx(hash_function(key));node* n = buckets[idx]; // 第一次加载if (n) { value_type const& v = *n; // 第二次加载 // ...}``` 173/2260 · 226 Needs editing
12 :14
	English xref:reference/hash_traits.adoc[Hash Traits]
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — xref:reference/hash_traits.adoc[哈希特征] 37/440 · 44 Needs editing
12 :247
	English _Key_
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — _键_ 3/100 · 5 Needs editing