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

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
218 :860
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void insert(std::initializer_list<value_type>); ``` 58/10000 · 58
:860 :860
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
218 :935
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — unlike xref:#unordered_flat_map_emplace[emplace], which simply forwards all arguments to ``value_type``'s constructor. 118/10000 · 118
219 :333
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Allocator's `construct` and `destroy` functions are called with raw 67/10000 · 67
:928 :928
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:895 :895
	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
:888 :888
	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
219 :1015
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Copy Insert 11/10000 · 11
:989 :989
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts `obj` in the table if and only if there is no element in the table with an equivalent key. 98/10000 · 98
:924 :924
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts `obj` in the table if and only if there is no element in the table with an equivalent key. 98/10000 · 98
:865 :865
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts a range of elements into the container. 47/10000 · 47
219 :954
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ bool insert(const value_type& obj); ``` 46/10000 · 46
219 :943
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; An `insert_return_type` object constructed from `position`, `inserted` and `node`: + 95/10000 · 95
:864 :864
	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
219 :862
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Extract by Value 16/10000 · 16
:937 :937
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Can invalidate iterators pointers and references, but only if the insert causes the load to be greater than the maximum load. 125/10000 · 125
220 :334
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — pointers, rather than the allocator's `pointer` type. 53/10000 · 53
220 :930
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert Iterator Range 21/10000 · 21
220 :898
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into `X` from `*first`. 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. 480/10000 · 480