On this page
std::inserter
Defined in header <iterator> |
||
---|---|---|
|
(until C++20) | |
|
(since C++20) |
inserter
is a convenience function template that constructs a std::insert_iterator
for the container c
and its iterator i
with the type deduced from the type of the argument.
Parameters
c | - | container that supports an insert operation |
i | - | iterator in c indicating the insertion position |
Return value
A std::insert_iterator
which can be used to insert elements into the container c
at the position indicated by i
.
Possible implementation
|
Example
#include <algorithm>
#include <iostream>
#include <iterator>
#include <set>
#include <vector>
int main()
{
std::multiset<int> s{1, 2, 3};
// std::inserter is commonly used with multi-sets
std::fill_n(std::inserter(s, s.end()), 5, 2);
for (int n : s)
std::cout << n << ' ';
std::cout << '\n';
std::vector<int> d{100, 200, 300};
std::vector<int> v{1, 2, 3, 4, 5};
// when inserting in a sequence container, insertion point advances
// because each std::insert_iterator::operator= updates the target iterator
std::copy(d.begin(), d.end(), std::inserter(v, std::next(v.begin())));
for (int n : v)
std::cout << n << ' ';
std::cout << '\n';
}
Output:
1 2 2 2 2 2 2 3
1 100 200 300 2 3 4 5
Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR | Applied to | Behavior as published | Correct behavior |
---|---|---|---|
LWG 561 | C++98 | the type of i was independent of Container |
it is the iterator type of Container |
See also
iterator adaptor for insertion into a container (class template) |
|
creates a std::back_insert_iterator of type inferred from the argument (function template) |
|
creates a std::front_insert_iterator of type inferred from the argument (function template) |
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
https://en.cppreference.com/w/cpp/iterator/inserter