Namespaces
Variants
Views
Actions

std::inserter

From cppreference.com
< cpp‎ | iterator
Revision as of 08:02, 7 July 2013 by P12 (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Defined in header <iterator>
template< class Container >
std::insert_iterator<Container> inserter( Container& c, typename Container::iterator i );

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

[edit] Parameters

c - container that supports a insert operation
i - iterator in c indicating the insertion position

[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

template< class Container >
std::insert_iterator<Container> inserter( Container& c, typename Container::iterator i )
{
    return std::insert_iterator<Container>(c, i);
}

[edit] Example

#include <iostream>
#include <list>
#include <algorithm>
#include <iterator>
#include <set>
 
int main()
{
    std::list<int> l{1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
    std::multiset<int> s;
 
    std::fill_n(std::inserter(l, std::next(l.begin())), 3, -1);
    std::fill_n(std::inserter(s, s.begin()), 3, -1);
 
    for (int n : l) {
        std::cout << n << ' ';
    }
    std::cout << '\n';
 
    for (int n : s) {
        std::cout << n << ' ';
    }
    std::cout << '\n';
}

Output:

1 -1 -1 -1 2 3 4 5 6 7 8 9 10 
-1 -1 -1

[edit] See also

iterator adaptor for insertion into a container
(class template) [edit]
creates a std::back_insert_iterator of type inferred from the argument
(function template) [edit]
creates a std::front_insert_iterator of type inferred from the argument
(function template) [edit]