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

383 :1459
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — reserve 7/10000 · 7
383 :1356
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void reserve(size_type n); ``` 37/10000 · 37
383 :1461
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The table's hash function. 37/10000 · 37
383 :1457
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array. If the provided Allocator uses fancy pointers, a default allocation is subsequently performed. 172/10000 · 172
383 :1357
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Return `true` if `x.size() == y.size()` and for every element in `x`, there is an element in `y` with the same key, with an equal value (using `operator==` to compare the value types). 184/10000 · 184
383 :1456
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Return `true` if `x.size() == y.size()` and for every element in `x`, there is an element in `y` with the same key, with an equal value (using `operator==` to compare the value types). 184/10000 · 184
384 :1491
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; A reference to `x.second` where `x` is the (unique) element whose key is equivalent to `k`. Throws:;; An exception object of type `std::out_of_range` if no such element is present. Notes:;; The `template<class K>` overloads only participate in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type. 558/10000 · 558
384 :1396
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Equivalent to `a.rehash(ceil(n / a.max_load_factor()))`, or `a.rehash(1)` if `n > 0` and `a.max_load_factor() == std::numeric_limits<float>::infinity()`. 153/10000 · 153
384 :1351
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class K, class T, class H, class P, class A, class Predicate> typename unordered_node_set<K, T, H, P, A>::size_type erase_if(unordered_node_set<K, T, H, P, A>& c, Predicate pred); ``` 199/10000 · 199
384 :1587
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; A `node_type` object holding the extracted element, or empty if no element was extracted. Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. Notes:;; The `template<class K>` overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type. 546/10000 · 546
384 :1585
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type bucket_count() const noexcept; ``` 51/10000 · 51
384 :1460
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void reserve(size_type n); ``` 37/10000 · 37
384 :1360
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Equivalent to `a.rehash(ceil(n / a.max_load_factor()))`, or `a.rehash(1)` if `n > 0` and `a.max_load_factor() == std::numeric_limits<float>::infinity()`. 153/10000 · 153
:1463 :1463
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:1459 :1459
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Invalidates iterators and changes the order of elements. 56/10000 · 56
:1360 :1360
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates. 95/10000 · 95
:1459 :1459
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates. 95/10000 · 95
:1495 :1495
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
385 :1398
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Similar to `rehash`, this function can be used to grow or shrink the number of buckets in the container. 104/10000 · 104
385 :1357
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Traverses the container `c` and removes all elements for which the supplied predicate returns `true`. 101/10000 · 101