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

15 :29
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `boost::concurrent_flat_set` operations to allow for safe mutable modification of elements ({github-pr-url}/265[PR#265^]). 122/10000 · 122
15 :287
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A binary function object that implements an equivalence relation on values of type `Key`. 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. 247/10000 · 247
15 :246
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An allocator whose value type is the same as the container's value type. 72/10000 · 72
15 :247
	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
15 :361
	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
15 :344
	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
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
15 :254
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A binary function object that implements an equivalence relation on values of type `Key`. 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. 247/10000 · 247
15 :66
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — For unsuccessful lookups, the average number of element comparisons should be close to 0.0. 91/10000 · 91
15 :309
	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
15 :300
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Hash_ 6/10000 · 6
15 :248
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Hash_ 6/10000 · 6
15 :245
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An allocator whose value type is the same as the container's value type. 72/10000 · 72
15 :297
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Hash_ 6/10000 · 6
16 :16
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/unordered_map.adoc[`unordered_map`] 50/10000 · 50
16 :96
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Comparison with Associative Containers 38/10000 · 38
16 :65
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — All sets and maps in Boost.Unordered are instantiatied similarly as `std::unordered_set` and `std::unordered_map`, respectively: 128/10000 · 128
16 :39
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — addressing, users will be surprised if the performance doesn't reflect that. 76/10000 · 76
16 :72
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — predicates, especially if you're using a function pointer. If you compare two containers with different equality predicates then the result is undefined. For most stateless function objects this is impossible - since you can only compare objects with the same equality predicate you know the equality predicates must be equal. But if you're using function pointers or a stateful equality predicate (e.g. `boost::function`) then you can get into trouble. 453/10000 · 453
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