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

:890 :890
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
226 :975
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. Returns:;; `true` if an insert took place. Concurrency:;; Blocking on rehashing of `*this`. 196/10000 · 196
226 :953
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ iterator insert(const_iterator hint, node_type&& nh); ``` 64/10000 · 64
226 :891
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erase by Key 12/10000 · 12
:884 :884
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `nh` is empty, has no effect. 32/10000 · 32
:957 :957
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If there is an existing element with key `k` this function does nothing. 72/10000 · 72
227 :351
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — {svn-ticket-url}/3966[Ticket 3966^]: 36/10000 · 36
:951 :951
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent key. 145/10000 · 145
227 :922
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Extract by Iterator 19/10000 · 19
227 :911
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert Node 11/10000 · 11
227 :1040
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. Returns:;; `true` if an insert took place. Concurrency:;; Blocking on rehashing of `*this`. Notes:;; A call of the form `insert(x)`, where `x` is equally convertible to both `value_type&&` and `init_type&&`, is not ambiguous and selects the `init_type` overload. 367/10000 · 367
227 :1017
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert Initializer List 23/10000 · 23
227 :951
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert Iterator Range 21/10000 · 21
227 :892
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Extract by Iterator 19/10000 · 19
:979 :979
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
227 :957
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `nh` is not empty, inserts the associated element in the container if and only if there is no element in the container with a key equivalent to `nh.key()`. `nh` becomes empty if insertion took place, otherwise it is not changed. 231/10000 · 231
227 :892
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type erase(const key_type& k); template<class K> size_type erase(K&& k); ``` 88/10000 · 88
:886 :886
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Otherwise inserts the element owned by `nh`. 44/10000 · 44
227 :959
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `hint` is a suggestion to where the element should be inserted. This implementation ignores it. 96/10000 · 96
228 :352
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `erase_return_void` is now `quick_erase`, which is the http://home.roadrunner.com/~hinnant/issue_review/lwg-active.html#579[ current forerunner for resolving the slow erase by iterator^], although there's a strong possibility that this may change in the future. The old method name remains for backwards compatibility but is considered deprecated and will be removed in a future release. 387/10000 · 387