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

100 :526
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ concurrent_flat_set(unordered_flat_set<Key, Hash, Pred, Allocator>&& other); ``` 87/10000 · 87
:518 :518
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 133/10000 · 133
100 :557
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move Constructor with Allocator 31/10000 · 31
100 :568
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container with at least `n` buckets, using `hf` as the hash function, the default key equality predicate and `a` as the allocator. 150/10000 · 150
:501 :501
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 133/10000 · 133
100 :511
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Iterator Range Constructor with Bucket Count and Hasher 55/10000 · 55
:552 :552
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 133/10000 · 133
101 :321
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The erasure benchmarks erase traverse the `n` elements and erase those with odd key (50% on average). 101/10000 · 101
101 :153
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Miscellaneous internal changes. 31/10000 · 31
101 :565
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Iterator Range Constructor with Bucket Count and Allocator 58/10000 · 58
:531 :531
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 133/10000 · 133
101 :524
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Postconditions:;; `size() == 0` Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 156/10000 · 156
101 :612
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move Constructor with Allocator 31/10000 · 31
101 :583
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move construction from a xref:#unordered_flat_map[`unordered_flat_map`]. The internal bucket array of `other` is transferred directly to the new container. The hash function, predicate and allocator are moved-constructed from `other`. If statistics are xref:concurrent_flat_map_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` and calls `other.reset_stats()`. 409/10000 · 409
101 :530
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move construction from a xref:#unordered_flat_set[`unordered_flat_set`]. The internal bucket array of `other` is transferred directly to the new container. The hash function, predicate and allocator are moved-constructed from `other`. If statistics are xref:concurrent_flat_set_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` and calls `other.reset_stats()`. 409/10000 · 409
:520 :520
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
101 :558
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ concurrent_node_set(concurrent_node_set&& other, Allocator const& a); ``` 80/10000 · 80
101 :571
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Postconditions:;; `size() == 0` Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 156/10000 · 156
:503 :503
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
101 :519
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator, with the default key equality predicate and a maximum load factor of `1.0` and inserts the elements from `[f, l)` into it. 234/10000 · 234