2. Boost Unordered Translation (zh_Hans)
3. Doc / Modules / Root / Pages / Reference / Concurrent Flat Set (adoc)
4. English
5. Zen

105 :551
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty table with at least `n` buckets, using `hf` as the hash function, `eql` as the key equality predicate and `a`, and inserts the elements from `il` into it. 174/10000 · 174
:554 :554
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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^]. 180/10000 · 180
:556 :556
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
108 :558
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Bucket Count Constructor with Allocator 39/10000 · 39
109 :559
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ concurrent_flat_set(size_type n, allocator_type const& a); ``` 69/10000 · 69
110 :563
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty table with at least `n` buckets, using `hf` as the hash function, the default hash function and key equality predicate and `a` as the allocator. 164/10000 · 164
111 :566
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Postconditions:;; `size() == 0` Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 168/10000 · 168
:569 :569
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
113 :571
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Bucket Count Constructor with Hasher and Allocator 50/10000 · 50
114 :572
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ concurrent_flat_set(size_type n, hasher const& hf, allocator_type const& a); ``` 87/10000 · 87
115 :576
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty table with at least `n` buckets, using `hf` as the hash function, the default key equality predicate and `a` as the allocator. 146/10000 · 146
116 :579
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Postconditions:;; `size() == 0` Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 156/10000 · 156
:582 :582
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
118 :584
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Iterator Range Constructor with Bucket Count and Allocator 58/10000 · 58
119 :591
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty table with at least `n` buckets, using `a` as the allocator and default hash function and key equality predicate, and inserts the elements from `[f, l)` into it. 181/10000 · 181
:594 :594
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 133/10000 · 133
:596 :596
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
122 :598
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Iterator Range Constructor with Bucket Count and Hasher 55/10000 · 55
123 :606
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty table with at least `n` buckets, using `hf` as the hash function, `a` as the allocator, with the default key equality predicate, and inserts the elements from `[f, l)` into it. 196/10000 · 196
:609 :609
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 124/10000 · 124