std::inserter - cppreference.com (original) (raw)

| Defined in header | | | | ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | | ------------- | | template< class Container > std::insert_iterator<Container> inserter( Container& c, typename Container::iterator i ); | | (until C++20) | | template< class Container > constexpr std::insert_iterator<Container> inserter( Container& c, ranges::iterator_t<Container> i ); | | (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.

Contents

• 1 Parameters
• 2 Return value
• 3 Possible implementation
• 4 Example
• 5 Defect reports
• 6 See also

[edit] Parameters

[edit] Return value

A std::insert_iterator which can be used to insert elements into the container c at the position indicated by i.

[edit] Possible implementation

[edit] Example

#include #include #include #include #include   int main() { std::multiset 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 d{100, 200, 300}; std::vector 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

[edit] Defect reports

The following behavior-changing defect reports were applied retroactively to previously published C++ standards.

[edit] See also