2. Boost Unordered Translation (zh_Hans)
3. Doc / Modules / Root / Pages / Benchmarks (adoc)
4. English
5. Zen

2 :4
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — = Benchmarks 12/10000 · 12
3 :6
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — boost::unordered_[multi]set 27/10000 · 27
4 :8
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — All benchmarks were created using `unordered_set<unsigned int>` (non-duplicate) and `unordered_multiset<unsigned int>` (duplicate). The source code can be https://github.com/boostorg/boost_unordered_benchmarks/tree/boost_unordered_set[found here^]. 248/10000 · 248
5 :10
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The insertion benchmarks insert `n` random values, where `n` is between 10,000 and 3 million. For the duplicated benchmarks, the same random values are repeated an average of 5 times. 183/10000 · 183
6 :12
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The erasure benchmarks erase all `n` elements randomly until the container is empty. Erasure by key uses `erase(const key_type&)` to remove entire groups of equivalent elements in each operation. 195/10000 · 195
:14 :14
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The successful lookup benchmarks are done by looking up all `n` values, in their original insertion order. 106/10000 · 106
:16 :16
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The unsuccessful lookup benchmarks use `n` randomly generated integers but using a different seed value. 104/10000 · 104
9 :18
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — GCC 12 + libstdc++-v3, x64 26/10000 · 26
:20 :20
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insertion 9/10000 · 9
11 :24
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-set/gcc/running insertion.xlsx.practice.png[width=250,link=_images/benchmarks-set/gcc/running insertion.xlsx.practice.png,window=_blank] 154/10000 · 154
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
13 :24
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-set/gcc/running insertion.xlsx.practice non-unique 5.png[width=250,link=_images/benchmarks-set/gcc/running insertion.xlsx.practice non-unique 5.png,window=_blank] 180/10000 · 180
14 :30
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — h|non-duplicate elements h|duplicate elements h|duplicate elements, + max load factor 5 |=== 92/10000 · 92
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
16 :38
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-set/gcc/running insertion.xlsx.practice norehash non-unique.png[width=250,link=_images/benchmarks-set/gcc/running insertion.xlsx.practice norehash non-unique.png,window=_blank] 194/10000 · 194
17 :38
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-set/gcc/running insertion.xlsx.practice norehash non-unique 5.png[width=250,link=_images/benchmarks-set/gcc/running insertion.xlsx.practice norehash non-unique 5.png,window=_blank] 198/10000 · 198
:44 :44
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — h|non-duplicate elements, + prior `reserve` h|duplicate elements, + prior `reserve` h|duplicate elements, + max load factor 5, + prior `reserve` 144/10000 · 144
:54 :54
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erasure 7/10000 · 7
20 :58
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-set/gcc/scattered erasure.xlsx.practice.png[width=250,link=_images/benchmarks-set/gcc/scattered erasure.xlsx.practice.png,window=_blank] 154/10000 · 154
21 :58
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-set/gcc/scattered erasure.xlsx.practice non-unique.png[width=250,link=_images/benchmarks-set/gcc/scattered erasure.xlsx.practice non-unique.png,window=_blank] 176/10000 · 176