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

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
228 :954
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] into the container. Throws:;; When inserting a single element, if an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated. 464/10000 · 464
228 :923
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ node_type extract(const_iterator position); ``` 54/10000 · 54
228 :912
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ insert_return_type insert(node_type&& nh); ``` 53/10000 · 53
:1045 :1045
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
228 :1018
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type insert(std::initializer_list<value_type> il); ``` 66/10000 · 66
228 :952
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class InputIterator> size_type insert(InputIterator first, InputIterator last); ``` 99/10000 · 99
228 :893
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ node_type extract(const_iterator position); ``` 54/10000 · 54
228 :981
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Transparent Insert 18/10000 · 18
:960 :960
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `hint` is a suggestion to where the element should be inserted. This implementation ignores it. 95/10000 · 95
228 :897
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erase all elements with key equivalent to `k`. 46/10000 · 46