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

243 :1075
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class F> bool insert_or_visit(value_type&& obj, F f); template<class F> bool insert_or_cvisit(value_type&& obj, F f); template<class F> bool insert_or_visit(init_type&& obj, F f); template<class F> bool insert_or_cvisit(init_type&& obj, F f); ``` 262/10000 · 262
243 :1003
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class F> bool insert_or_visit(const value_type& obj, F f); template<class F> bool insert_or_cvisit(const value_type& obj, F f); ``` 147/10000 · 147
243 :945
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert with Hint and `node_handle` 34/10000 · 34
243 :1028
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert Node 11/10000 · 11
243 :1015
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — try_emplace with Hint 21/10000 · 21
243 :937
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ init_type pull(const_iterator position); ``` 51/10000 · 51
243 :946
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type erase(const key_type& k); template<class K> size_type erase(K&& x); ``` 88/10000 · 88
243 :1018
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The `bool` component of the return type is `true` if an insert took place. + + If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent key. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Can invalidate iterators pointers and references, but only if the insert causes the load to be greater than the maximum load. + + The `template<class K, class M>` 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. 835/10000 · 835
244 :383
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The container object is now smaller thanks to using `boost::compressed_pair` 76/10000 · 76
:1017 :1017
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts a new element into the container if there is no existing element with key `k` contained within it. 106/10000 · 106
244 :978
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ iterator insert(const_iterator hint, node_type&& nh); ``` 64/10000 · 64
244 :958
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; An opaque object implicitly convertible to the `iterator` or `const_iterator` immediately following `position` prior to the erasure. Throws:;; Nothing. Notes:;; The opaque object returned must only be discarded or immediately converted to `iterator` or `const_iterator`. 281/10000 · 281
:1090 :1090
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Otherwise if the insertion took place, `inserted` is true and `node` is empty. 78/10000 · 78
:1082 :1082
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts `obj` in the table if and only if there is no element in the table with an equivalent key. Otherwise, invokes `f` with a reference to the equivalent element; such reference is const iff a `*_cvisit` overload is used. 224/10000 · 224
:1008 :1008
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts `obj` in the table if and only if there is no element in the table with an equivalent key. Otherwise, invokes `f` with a const reference to the equivalent element. 171/10000 · 171
244 :946
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ iterator insert(const_iterator hint, node_type&& nh); ``` 64/10000 · 64
244 :1029
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ insert_return_type insert(node_type&& nh); ``` 53/10000 · 53
244 :1016
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class... Args> iterator try_emplace(const_iterator hint, const key_type& k, Args&&... args); template<class... Args> iterator try_emplace(const_iterator hint, key_type&& k, Args&&... args); template<class K, class... Args> iterator try_emplace(const_iterator hint, K&& k, Args&&... args); ``` 308/10000 · 308
244 :941
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move-constructs an `init_value` `x` from the element pointed to by `position`, erases the element and returns `x`. 114/10000 · 114
244 :951
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erase all elements with key equivalent to `k`. 46/10000 · 46