2. Boost Unordered Translation (zh_Hans)
3. English
4. Zen

11 :286
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — *Template Parameters* 21/10000 · 21
12 :12
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:ref.adoc[] 15/10000 · 15
12 :76
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``` x.reserve(n); ``` 21/10000 · 21
12 :56
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — **Open-addressing containers** rely on much faster data structures and algorithms 81/10000 · 81
12 :32
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — meet the complexity requirements. 33/10000 · 33
12 :57
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — return seed; } }; ``` 21/10000 · 21
12 :24
	English ↹ ↵ 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/10000 · 176
12 :116
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Visitation is prominent in the API provided by concurrent containers, and many classical operations have visitation-enabled variations: 135/10000 · 135
12 :108
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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: 431/10000 · 431
:48 :48
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 2+^h| *All containers* h|*Method* h|*Description* 49/10000 · 49
12 :52
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Swap 4/10000 · 4
12 :44
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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 // ... } ``` 226/10000 · 226
:24 :24
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Fancy pointers 14/10000 · 14
12 :14
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/hash_traits.adoc[Hash Traits] 44/10000 · 44
12 :25
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Added `insert_and_visit(x, f1, f2)` and similar operations to concurrent containers, which 90/10000 · 90
12 :287
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Hash_ 6/10000 · 6
12 :246
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Pred_ 6/10000 · 6
12 :247
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Key_ 5/10000 · 5
12 :358
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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. 161/10000 · 161
12 :340
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `std::pair<const Key, T>` must be https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] 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. 283/10000 · 283