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

200 :799
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ iterator insert(const_iterator hint, const value_type& obj); ``` Inserts `obj` in the container. 103/10000 · 103
:804 :804
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `hint` is a suggestion to where the element should be inserted. 63/10000 · 63
202 :807
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]. Returns:;; An iterator pointing to the 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. 669/10000 · 669
:816 :816
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
204 :818
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move Insert with Hint 21/10000 · 21
205 :819
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ iterator insert(const_iterator hint, value_type&& obj); ``` 66/10000 · 66
:823 :823
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts `obj` in the container. 31/10000 · 31
:825 :825
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `hint` is a suggestion to where the element should be inserted. 63/10000 · 63
208 :828
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. Returns:;; An iterator pointing to the 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. 669/10000 · 669
:837 :837
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
210 :839
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Emplace Insert with Hint 24/10000 · 24
211 :840
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class P> iterator insert(const_iterator hint, P&& obj); ``` 75/10000 · 75
212 :844
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an element into the container by performing `emplace_hint(hint, std::forward<P>(value))`. 97/10000 · 97
:846 :846
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Only participates in overload resolution if `std::is_constructible<value_type, P&&>::value` is `true`. 102/10000 · 102
:848 :848
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `hint` is a suggestion to where the element should be inserted. 63/10000 · 63
215 :851
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; An iterator pointing to the inserted element. 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. 454/10000 · 454
:858 :858
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
217 :860
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert Iterator Range 21/10000 · 21
218 :861
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class InputIterator> void insert(InputIterator first, InputIterator last); ``` 94/10000 · 94
:865 :865
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts a range of elements into the container. 47/10000 · 47