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

212 :921
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void insert(std::initializer_list<value_type>); ``` 58/10000 · 58
:925 :925
	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
214 :928
	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 to be greater than the maximum load. 377/10000 · 377
:932 :932
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
216 :934
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert Node 11/10000 · 11
217 :935
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ insert_return_type insert(node_type&& nh); ``` 53/10000 · 53
218 :939
	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` is empty when the function returns. 199/10000 · 199
219 :943
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; An `insert_return_type` object constructed from `position`, `inserted` and `node`: + 95/10000 · 95
220 :944
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `nh` is empty, `inserted` is `false`, `position` is `end()`, and `node` is empty. 84/10000 · 84
221 :945
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Otherwise if the insertion took place, `inserted` is true, `position` points to the inserted element, and `node` is empty. 122/10000 · 122
222 :946
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If the insertion failed, `inserted` is false, `node` has the previous value of `nh`, and `position` points to an element with a key equivalent to `nh.key()`. 157/10000 · 157
223 :947
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Behavior is undefined if `nh` is not empty and the allocators of `nh` and the container are not equal. 221/10000 · 221
:950 :950
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
225 :952
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert Node with Hint 21/10000 · 21
226 :953
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ iterator insert(const_iterator hint, node_type&& nh); ``` 64/10000 · 64
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
:960 :960
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `hint` is a suggestion to where the element should be inserted. This implementation ignores it. 95/10000 · 95
229 :963
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The iterator returned is `end()` if `nh` is empty. If insertion 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:;; Behavior is undefined if `nh` is not empty and the allocators of `nh` and the container are not equal. 421/10000 · 421
:968 :968
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
231 :970
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — try_emplace 11/10000 · 11