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

45 :140
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Concurrent containers make the same decisions and provide the same guarantees as Boost.Unordered open-addressing containers with regards to xref:#rationale_hash_function[hash function defaults] and xref:#rationale_platform_interoperability[platform interoperability]. 267/10000 · 267
45 :135
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-set/clang_libcpp/running insertion.xlsx.practice norehash non-unique 5.png[width=250,window=_blank,link=_images/benchmarks-set/clang_libcpp/running insertion.xlsx.practice norehash non-unique 5.png] 216/10000 · 216
45 :114
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `float max_load_factor(float z)` 32/10000 · 32
45 :166
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — reduced hash value is set) and the insertion counter is atomically incremented: if no other thread has incremented the counter during the whole operation (which is checked by comparing with `c0`), then we're good to go and complete the insertion, otherwise we roll back and start over. 285/10000 · 285
45 :68
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Starting with this release, `boost::unordered_[multi]set` and `boost::unordered_[multi]map` 91/10000 · 91
45 :401
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ unordered_map(); ``` 27/10000 · 27
:366 :366
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Postconditions:;; `size() == 0` Requires:;; If the defaults are used, `hasher`, `key_equal` and `allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 212/10000 · 212
45 :353
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container using `hasher()` as the hash function, `key_equal()` as the key equality predicate and `allocator_type()` as the allocator. 153/10000 · 153
45 :436
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `BOOST_UNORDERED_DISABLE_REENTRANCY_CHECK` 42/10000 · 42
45 :419
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `BOOST_UNORDERED_DISABLE_REENTRANCY_CHECK` 42/10000 · 42
45 :366
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `BOOST_UNORDERED_DISABLE_REENTRANCY_CHECK` 42/10000 · 42
:357 :357
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
45 :383
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `BOOST_UNORDERED_DISABLE_REENTRANCY_CHECK` 42/10000 · 42
45 :399
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ unordered_node_map(); ``` 32/10000 · 32
45 :332
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `eql` as the key equality predicate, and `a` as the allocator. 152/10000 · 152
45 :348
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ explicit unordered_multiset(size_type n, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); ``` 161/10000 · 161
45 :383
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `eql` as the key equality predicate, and `a` as the allocator. 152/10000 · 152
46 :46
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/header_concurrent_node_set_fwd.adoc[`<boost/unordered/concurrent_node_set_fwd.hpp>`] 99/10000 · 99
:148 :148
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Associative Containers 22/10000 · 22
:141 :141
	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