front_insert_iterator, front_inserter

An iterator that always inserts an item at the front of its associated container.

Library

Standards<ToolKit>

Declaration


#include <iterator>

template< Container >
class front_insert_iterator : public output_iterator

Adaptor

front_insert_iterator< Container >
front_inserter( Container& container );

Interface

Constructor
front_insert_iterator( Container& container )
Constructs an iterator associated with container .
=
front_insert_iterator< Container >& operator=( const value_type value )
Inserts a copy of value at the front of the iterator's associated container.
*
front_insert_iterator< Container >& operator *()
Returns a reference to the iterator.
++
front_insert_iterator< Container >& operator++()
Advances and returns a reference to the iterator.
++
front_insert_iterator< Container > operator++( int )
Advances and returns a copy of the iterator.
Example <ospace/osstd/examples/finsert1.cpp>
#include <iostream>
#include <algorithm>
#include <deque>
#include <iterator>

char* array[] = { "laurie", "jennifer", "leisa" };

void
main()
  {
  deque< char* > names;

  copy( array, array + 3, front_insert_iterator< char_s_deque >( names ) );

  char_s_deque::iterator i;
  for ( i = names.begin(); i != names.end(); ++i )
    cout << *i << "\n";
  }

leisa
jennifer
laurie
Example <ospace/osstd/examples/finsert2.cpp>
#include <iostream>
#include <algorithm>
#include <deque>
#include <iterator>

char* array[] = { "laurie", "jennifer", "leisa" };

void
main()
  {
  deque< char* > names;

  copy( array, array + 3, front_inserter( names ) );

  deque< char* >::iterator i;
  for ( i = names.begin(); i != names.end(); i++ )
    cout << *i << endl;
  }

leisa
jennifer
laurie

Copyright©1994-2026 Recursion Software LLC
All Rights Reserved - For use by licensed users only.