template< class Container >
class front_insert_iterator;
std::front_insert_iterator is a LegacyOutputIterator that prepends elements to a container for which it was constructed. The container's push_front() member function is called whenever the iterator (whether dereferenced or not) is assigned to. Incrementing the std::front_insert_iterator is a no-op.
iterator_category std::output_iterator_tag value_type void difference_type pointer void reference void container_type Container
Member types iterator_category, value_type, difference_type, pointer and reference are required to be obtained by inheriting from std::iterator<std::output_iterator_tag, void, void, void, void>.
container (protected) a pointer of type Container* [edit] Example
#include <algorithm>
#include <deque>
#include <iostream>
#include <iterator>
#include <vector>
namespace stb
{
void println(auto, auto const& d)
{
std::ranges::copy(d, std::ostream_iterator<int>(std::cout, " "));
std::cout << '\n';
}
}
int main()
{
std::vector<int> v{1, 2, 3, 4, 5};
std::deque<int> d;
std::copy(v.begin(), v.end(),
std::front_insert_iterator<std::deque<int>>(d));
// or std::front_inserter(d)
stb::println("{}", d);
}
Output:
[edit] See alsoRetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4