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

14 :300
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _T_ 3/10000 · 3
14 :246
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — and https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container. 87/10000 · 87
14 :245
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Allocator_ 11/10000 · 11
14 :297
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _T_ 3/10000 · 3
15 :15
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/header_unordered_map.adoc[`<boost/unordered/unordered_map.hpp>`] 79/10000 · 79
15 :94
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — :idprefix: comparison_ 22/10000 · 22
15 :62
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — multithreaded scenarios. Their interface is radically different from that of regular C++ containers. Flat and node-based variants are provided. 143/10000 · 143
15 :38
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — And since the standard is written with a eye towards closed 59/10000 · 59
15 :71
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Be careful when using the equality (`==`) operator with custom equality 71/10000 · 71
15 :38
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-set/gcc/running insertion.xlsx.practice norehash.png[width=250,link=_images/benchmarks-set/gcc/running insertion.xlsx.practice norehash.png,window=_blank] 172/10000 · 172
15 :152
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Consult the references of `xref:reference/concurrent_node_set.adoc#concurrent_node_set[boost::concurrent_node_set]`, `xref:reference/concurrent_node_map.adoc#concurrent_node_map[boost::concurrent_node_map]`, `xref:reference/concurrent_flat_set.adoc#concurrent_flat_set[boost::concurrent_flat_set]` and `xref:reference/concurrent_flat_map.adoc#concurrent_flat_map[boost::concurrent_flat_map]` for the complete list of visitation-enabled operations. 447/10000 · 447
15 :117
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — just the element found is checked). 35/10000 · 35
15 :54
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 2+^h| *Closed-addressing containers only* h|*Method* h|*Description* 68/10000 · 68
15 :60
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The C++ standard does not currently provide any open-addressing container specification to adhere to, so `boost::unordered_flat_set`/`unordered_node_set` and `boost::unordered_flat_map`/`unordered_node_map` take inspiration from `std::unordered_set` and `std::unordered_map`, respectively, and depart from their interface where convenient or as dictated by their internal data structure, which is radically different from that imposed by the standard (closed addressing). 471/10000 · 471
15 :60
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Thus container-wide iteration is turned into traversing the non-empty bucket groups (an operation with constant time complexity) which reduces the time complexity back to `O(size())`. In total, a bucket group is only 4 words in size and it views `sizeof(std::size_t) * CHAR_BIT` buckets meaning that for all common implementations, there's only 4 bits of space overhead per bucket introduced by the bucket groups. 413/10000 · 413
15 :30
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — All containers and iterators have a custom GDB pretty-printer. 62/10000 · 62
15 :17
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/header_unordered_flat_map.adoc[+++<code style="color: inherit;">+++<boost/unordered/unordered_flat_map.hpp>+++</code>+++ Synopsis] 145/10000 · 145
15 :29
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `boost::concurrent_flat_set` operations to allow for safe mutable modification of elements ({github-pr-url}/265[PR#265^]). 122/10000 · 122
15 :287
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A binary function object that implements an equivalence relation on values of type `Key`. A binary function object that induces an equivalence relation on values of type `Key`. It takes two arguments of type `Key` and returns a value of type bool. 247/10000 · 247
15 :246
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An allocator whose value type is the same as the container's value type. 72/10000 · 72