Exit Zen
190
:786
English
Move Insert
4/110 · 11
191
:787
English
```c++ std::pair<iterator, bool> insert(value_type&& obj); ```
85/620 · 62
:791
:791
English
Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.
32/1060 · 106
193
:794
English
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. Returns:;; The bool component of the return type is true if an insert took place. + + If an insert 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:;; 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.
246/6360 · 636
:803
:803
English
---
3/100 · 3
195
:805
English
Transparent Insert
4/180 · 18
196
:806
English
```c++ template<class K> std::pair<iterator, bool> insert(K&& k); ```
103/690 · 69
:810
:810
English
Inserts an element constructed from `std::forward<K>(k)` in the container if and only if there is no element in the container with an equivalent key.
65/1490 · 149
198
:813
English
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] from `k`. Returns:;; The bool component of the return type is true if an insert took place. + + If an insert 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:;; 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 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.
469/10800 · 1080
:824
:824
English
---
3/100 · 3
200
:826
English
Copy Insert with Hint
8/210 · 21
201
:827
English
```c++ iterator insert(const_iterator hint, const value_type& obj); ``` Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.
182/1780 · 178
:832
:832
English
`hint` is a suggestion to where the element should be inserted.
18/630 · 63
203
:835
English
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]. Returns:;; If an insert 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:;; 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.
289/7610 · 761
:844
:844
English
---
3/100 · 3
205
:846
English
Move Insert with Hint
8/210 · 21
206
:847
English
```c++ iterator insert(const_iterator hint, value_type&& obj); ```
74/660 · 66
:851
:851
English
Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.
28/1060 · 106
:853
:853
English
`hint` is a suggestion to where the element should be inserted.
23/630 · 63
209
:856
English
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. Returns:;; If an insert 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:;; 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.
289/7610 · 761