Namespaces
Variants
Actions

std::front_inserter

From cppreference.com
< cpp‎ | iterator
 
 
Iterator library
Iterator concepts
Iterator primitives
Algorithm concepts and utilities
Indirect callable concepts
Common algorithm requirements
(C++20)
(C++20)
(C++20)
Utilities
(C++20)
Iterator adaptors
Range access
(C++11)(C++14)
(C++14)(C++14)  
(C++11)(C++14)
(C++14)(C++14)  
(C++17)(C++20)
(C++17)
(C++17)
 
Defined in header <iterator>
template<class Container >
std::front_insert_iterator<Container> front_inserter( Container& c );
(constexpr since C++20)

front_inserter is a convenience function template that constructs a std::front_insert_iterator for the container c with the type deduced from the type of the argument.

Contents

[edit]Parameters

c - container that supports a push_front operation

[edit]Return value

A std::front_insert_iterator which can be used to add elements to the beginning of the container c.

[edit]Possible implementation

template<class Container>std::front_insert_iterator<Container> front_inserter( Container& c ){returnstd::front_insert_iterator<Container>(c);}

[edit]Example

#include <algorithm>#include <deque>#include <iostream>#include <iterator>#include <vector>   int main(){std::vector<int> v{1, 2, 3, 4, 5};std::deque<int> d;std::copy(v.begin(), v.end(), std::front_inserter(d));for(int n : d)std::cout<< n <<' ';std::cout<<'\n';}

Output:

5 4 3 2 1

[edit]See also

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