std::front_inserter
From cppreference.com
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Iterator library
(C++20)
(C++20)
(C++20)
(C++20)
(C++20)(C++20)
(C++20)
(C++20)
(C++20)
(C++20)
(C++20)
(C++20)
(C++20)
(C++20)
(C++20)
(C++20)(C++20)(C++20)(C++23)(C++20)(C++20)
(deprecated in C++17)
(C++20)
(C++20)
(C++20)(C++20)
(C++20)
(C++20)
(C++20)
(C++20)
(C++14)
(C++11)
(C++11)
(C++20)(C++20)
(C++20)(C++20)
front_inserter
(C++20)
(C++20)
(C++20)
(C++23)
(C++23)
(C++23)
(C++23)
(C++23)
(C++11)(C++14)
(C++14)(C++14)
Defined in header
<iterator>
template< class Container >
std::front_insert_iterator <Container> front_inserter( Container& c );
(constexpr since C++20)
std::front_insert_iterator <Container> front_inserter( Container& c );
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.
[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 ) { return std::front_insert_iterator <Container>(c); }
[edit] Example
Run this code
#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