| std::pair<iterator, bool> insert( const value_type& value ); |
(1) | (since C++23) |
| std::pair<iterator, bool> insert( value_type&& value ); |
(2) | (since C++23) |
| iterator insert( const_iterator pos, const value_type& value ); |
(3) | (since C++23) |
| iterator insert( const_iterator pos, value_type&& value ); |
(4) | (since C++23) |
| template< class K > iterator insert( const_iterator pos, K&& x ); |
(5) | (since C++23) |
| template< class InputIt > void insert( InputIt first, InputIt last ); |
(6) | (since C++23) |
| template< class K > std::pair<iterator, bool> insert( K&& x ); |
(7) | (since C++23) |
| template< class InputIt > void insert( std::sorted_unique_t, InputIt first, InputIt last ); |
(8) | (since C++23) |
| void insert( std::initializer_list<key_type> ilist ); |
(9) | (since C++23) |
| void insert( std::sorted_unique_t s, std::initializer_list<key_type> ilist ); |
(10) | (since C++23) |
Inserts element(s) into the container, if the container does not already contain an element with an equivalent key.
value. Equivalent to return emplace(value);.value. Equivalent to return emplace(std::move(value));.value in the position as close as possible to the position just prior to pos. Equivalent to return emplace_hint(pos, value);.value in the position as close as possible to the position just prior to pos. Equivalent to return emplace_hint(pos, std::move(value));.*this already contains an element which transparently compares equivalent to x, does nothing. Otherwise, inserts a new element as if by:
- (5)
emplace(pos, std::forward<K>(x))(in the position as close as possible to the position just prior topos); - (7)
emplace(std::forward<K>(x)).
x into key_type must construct an object u, for which find(k) == find(u) is true. Otherwise, the behavior is undefined.- The qualified-id
Compare::is_transparentis valid and denotes a type, and -
std::is_constructible_v<value_type, K>istrue,
Key.- Inserts elements from range
[first,last)as if byc.insert(c.end(), first, last);. - Sorts the range of newly inserted elements with respect to
compare. - Merges the resulting sorted range and the sorted range of pre-existing elements into a single sorted range. (Note: the merge operation may allocate memory).
- Erases all but the first element from each group of consecutive equivalent elements.
[first, last). Equivalent to insert(first, last);.ilist. Equivalent to insert(ilist.begin(), ilist.end());.ilist. Equivalent to insert(s, ilist.begin(), ilist.end());.Parameters
| pos | - | iterator to the position before which the new element will be inserted |
| value | - | element value to insert |
| first, last | - | range of elements to insert |
| ilist | - | initializer list to insert the values from |
| x | - | a value of any type that can be transparently compared with a key |
| s | - | a disambiguation tag indicating that the input sequence is sorted (with respect to compare) and contains only unique elements
|
| Type requirements | ||
InputIt must meet the requirements of LegacyInputIterator.
| ||
Return value
true if and only if the insertion took place.true if and only if the insertion took place.Exceptions
Reason: cases 6,8-10
Complexity
size().size().Reason: recheck the complexity: 1-5, 7, 9, 10. The lookup is log(N), but insertion in underlying container is N/2 on average => Linear.
Notes
The hinted insert (3-5) does not return a boolean in order to be signature-compatible with positional insert on sequential containers, such as std::vector::insert. This makes it possible to create generic inserters such as std::inserter. One way to check success of a hinted insert is to compare size() before and after.
Example
#include <cassert>
#include <flat_set>
#include <iostream>
int main()
{
std::flat_set<int> set;
auto result_1 = set.insert(3);
assert(result_1.first != set.end()); // it is a valid iterator
assert(*result_1.first == 3);
if (result_1.second)
std::cout << "insert done\n";
auto result_2 = set.insert(3);
assert(result_2.first == result_1.first); // the same iterator
assert(*result_2.first == 3);
if (!result_2.second)
std::cout << "no insertion\n";
}insert done
no insertionSee also
| constructs element in-place (public member function) | |
| constructs elements in-place using a hint (public member function) | |
| creates a std::insert_iterator of type inferred from the argument (function template) |
Content from this page on cppreference.com, licensed under CC-BY-SA 3.0 and GFDL. Modified: restyled, site navigation removed, code windows added. Offline snapshot of 9 February 2025.