std::front_insert_iterator::operator=

 

C++

Language

Headers

Freestanding and hosted implementations

Named requirements

Language support library

Concepts library (C++20)

Diagnostics library

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

Filesystem library (C++17)

Technical Specifications

 

Iterator library

Iterator primitives
iterator_traits
input_iterator_tagoutput_iterator_tagforward_iterator_tagbidirectional_iterator_tagrandom_access_iterator_tag
iterator
Iterator adaptors
reverse_iterator move_iterator (C++11) back_insert_iterator front_insert_iterator insert_iterator	make_reverse_iterator (C++14) make_move_iterator (C++11) back_inserter front_inserter inserter
Stream iterators
istream_iterator
ostream_iterator
istreambuf_iterator
ostreambuf_iterator
Iterator operations
advance
distance
prev (C++11)
next (C++11)
Range access
begincbegin (C++11)(C++14)
endcend (C++11)(C++14)
rbegincrbegin (C++14)(C++14)
rendcrend (C++14)(C++14)
Container access
size (C++17)
empty (C++17)
data (C++17)

 

std::front_insert_iterator

Member functions

front_insert_iterator::front_insert_iterator

front_insert_iterator::operator=

front_insert_iterator::operator*

front_insert_iterator::operator++front_insert_iterator::operator++(int)

 

	(1)
front_insert_iterator<Container>&     operator=( typename Container::const_reference value );			(until C++11)
front_insert_iterator<Container>&     operator=( const typename Container::value_type& value );			(since C++11)
front_insert_iterator<Container>&     operator=( typename Container::value_type&& value );		(2)	(since C++11)

Inserts the given value value to the container.

1) Results in container->push_front(value)

2) Results in container->push_front(std::move(value))

Parameters

value

-

the value to insert

Return value

*this

Example

Run this code

#include <iostream>
#include <iterator>
#include <deque>
 
int main()
{
    std::deque<int> q;
    std::front_insert_iterator< std::deque<int> > it(q);
 
    for (int i=0; i<10; ++i)
        it = i; // calls q.push_front(i)
 
    for (auto& elem : q) std::cout << elem << ' ';
}

Output:

9 8 7 6 5 4 3 2 1 0