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

289 :1086
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The container's allocator. 37/10000 · 37
:1240 :1240
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts `obj` in the table if and only if there is no element in the table with an equivalent key, and then invokes `f1` with a non-const reference to the newly created element. Otherwise, invokes `f2` with a reference to the equivalent element; such reference is const iff a `*_cvisit` overload is used. 304/10000 · 304
:1268 :1268
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Invalidates pointers and references to elements if a rehashing is issued. 73/10000 · 73
:1177 :1177
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Equivalent to [listing,subs="+macros,+quotes"] 46/10000 · 46
289 :1094
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Because `source` can have a different hash function and key equality predicate, the key of each node in `source` is rehashed using `this\->hash_function()` and then, if required, compared using `this\->key_eq()`. 212/10000 · 212
289 :1164
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Throws:;; If an exception is thrown by an operation other than a call to `hasher` or call to `f`, the function has no effect. Concurrency:;; Blocking on rehashing of `*this`. Notes:;; Behavior is undefined if `nh` is not empty and the allocators of `nh` and the container are not equal. 286/10000 · 286
289 :1184
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — swap 4/10000 · 4
289 :1069
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The size of the bucket array. 40/10000 · 40
:1078 :1078
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
289 :1166
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — get_allocator 13/10000 · 13
290 :453
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — More efficient node allocation when rvalue references and variadic template 75/10000 · 75
:1189 :1189
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
290 :1131
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Because `source` can have a different hash function and key equality predicate, the key of each node in `source` is rehashed using `this\->hash_function()` and then, if required, compared using `this\->key_eq()`. 212/10000 · 212
:1088 :1088
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
290 :1245
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]. Returns:;; `true` if an insert took place. + Concurrency:;; Blocking on rehashing of `*this`. Notes:;; In a call of the form `insert_and_[c]visit(obj, f1, f2)`, the overloads accepting a `const value_type&` argument participate in overload resolution only if `std::remove_cv<std::remove_reference<decltype(obj)>::type>::type` is `value_type`. 447/10000 · 447
290 :1270
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `template<class K, class\... Args>` 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. 373/10000 · 373
:1184 :1184
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The number of elements inserted. 43/10000 · 43
290 :1097
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The behavior of this function is undefined if `this\->get_allocator() != source.get_allocator()`. 97/10000 · 97
:1168 :1168
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
290 :1185
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void swap(unordered_node_map& other) noexcept(boost::allocator_traits<Allocator>::is_always_equal::value || boost::allocator_traits<Allocator>::propagate_on_container_swap::value); ``` 191/10000 · 191