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

14 :292
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Hash_ 6/10000 · 6
15 :292
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A unary function object type that acts a hash function for a `Key`. It takes a single argument of type `Key` and returns a value of type `std::size_t`. 151/10000 · 151
16 :292
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Pred_ 6/10000 · 6
17 :292
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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`. 159/10000 · 159
18 :292
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Allocator_ 11/10000 · 11
19 :292
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An allocator whose value type is the same as the table's value type. 68/10000 · 68
20 :300
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `std::allocator_traits<Allocator>::pointer` and `std::allocator_traits<Allocator>::const_pointer` must be convertible to/from `value_type*` and `const value_type*`, respectively. 178/10000 · 178
21 :305
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The elements of the table are held into an internal _bucket array_. An element is inserted into a bucket determined by its hash code, but if the bucket is already occupied (a _collision_), an available one in the vicinity of the original position is used. 255/10000 · 255
22 :309
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The size of the bucket array can be automatically increased by a call to `insert`/`emplace`, or as a result of calling `rehash`/`reserve`. The _load factor_ of the table (number of elements divided by number of buckets) is never greater than `max_load_factor()`, except possibly for small sizes where the implementation may decide to allow for higher loads. 357/10000 · 357
23 :314
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]<Hash>::value` is `true`, the hash function is used as-is; otherwise, a bit-mixing post-processing stage is added to increase the quality of hashing at the expense of extra computational cost. 298/10000 · 298
:318 :318
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
25 :320
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Concurrency Requirements and Guarantees 39/10000 · 39
26 :322
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Concurrent invocations of `operator()` on the same const instance of `Hash` or `Pred` are required to not introduce data races. For `Alloc` being either `Allocator` or any allocator type rebound from `Allocator`, concurrent invocations of the following operations on the same instance `al` of `Alloc` are required to not introduce data races: 342/10000 · 342
27 :327
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Copy construction from `al` of an allocator rebound from `Alloc` 64/10000 · 64
28 :328
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `std::allocator_traits<Alloc>::allocate` 40/10000 · 40
29 :329
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `std::allocator_traits<Alloc>::deallocate` 42/10000 · 42
30 :330
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `std::allocator_traits<Alloc>::construct` 41/10000 · 41
31 :331
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `std::allocator_traits<Alloc>::destroy` 39/10000 · 39
32 :333
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In general, these requirements on `Hash`, `Pred` and `Allocator` are met if these types are not stateful or if the operations only involve constant access to internal data members. 180/10000 · 180
33 :336
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — With the exception of destruction, concurrent invocations of any operation on the same instance of a `concurrent_flat_set` do not introduce data races — that is, they are thread-safe. 183/10000 · 183