2. Boost Unordered Translation (zh_Hans)
3. Doc / Modules / Root / Pages / Reference / Unordered Set (adoc)
4. English
5. Zen

233 :936
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ node_type extract(const key_type& k); template<class K> node_type extract(K&& k); ``` 92/10000 · 92
234 :941
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Removes an element with key equivalent to `k`. 46/10000 · 46
235 :944
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; A `node_type` owning the element if found, otherwise an empty `node_type`. Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. Notes:;; In C++17 a node extracted using this method can be inserted into a compatible `unordered_multiset`, but that is not supported yet. + + The `template<class K>` overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs and neither `iterator` nor `const_iterator` are implicitly convertible from `K`. 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. 746/10000 · 746
:950 :950
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
237 :952
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert with `node_handle` 25/10000 · 25
238 :953
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ insert_return_type insert(node_type&& nh); ``` 53/10000 · 53
:957 :957
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `nh` is empty, has no effect. 32/10000 · 32
:959 :959
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key. 119/10000 · 119
241 :962
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the container's allocator. Returns:;; If `nh` was empty, returns an `insert_return_type` with: `inserted` equal to `false`, `position` equal to `end()` and `node` empty. + + Otherwise if there was already an element with an equivalent key, returns an `insert_return_type` with: `inserted` equal to `false`, `position` pointing to a matching element and `node` contains the node from `nh`. + + Otherwise if the insertion succeeded, returns an `insert_return_type` with: `inserted` equal to `true`, `position` pointing to the newly inserted element and `node` empty. Throws:;; 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. + + In C++17 this can be used to insert a node extracted from a compatible `unordered_multiset`, but that is not supported yet. 1062/10000 · 1062
:975 :975
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
243 :977
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert with Hint and `node_handle` 34/10000 · 34
244 :978
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ iterator insert(const_iterator hint, node_type&& nh); ``` 64/10000 · 64
:982 :982
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `nh` is empty, has no effect. 32/10000 · 32
:984 :984
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key. 119/10000 · 119
247 :986
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If there is already an element in the container with an equivalent key has no effect on `nh` (i.e. `nh` still contains the node.) 129/10000 · 129
:988 :988
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `hint` is a suggestion to where the element should be inserted. 63/10000 · 63
249 :991
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the container's allocator. Returns:;; If `nh` was empty returns `end()`. + + If there was already an element in the container with an equivalent key returns an iterator pointing to that. + + Otherwise returns an iterator pointing to the newly inserted element. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same key. + + 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. + + This can be used to insert a node extracted from a compatible `unordered_multiset`. 918/10000 · 918
:1006 :1006
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
251 :1008
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erase by Position 17/10000 · 17
252 :1010
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ iterator erase(iterator position); iterator erase(const_iterator position); ``` 86/10000 · 86