std::front_inserter
| 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 ) { return std::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) | |
| creates a std::back_insert_iterator of type inferred from the argument (function template) | |
| creates a std::insert_iterator of type inferred from the argument (function template) |

Formed in 2009, the Archive Team (not to be confused with the archive.org Archive-It Team) is a rogue archivist collective dedicated to saving copies of rapidly dying or deleted websites for the sake of history and digital heritage. The group is 100% composed of volunteers and interested parties, and has expanded into a large amount of related projects for saving online and digital history.
