Demonstrate front_insert_iterator in vector


#include <iostream>
#include <iterator>
#include <list>
using namespace std;

int main()
{
  list<int> vectorObject, vectorObject2;
  list<int>::iterator itr;
  int i;

  for(i = 0; i <5; i++)
    vectorObject.push_back(i);

  cout << "Original contents of vectorObject: ";
  itr = vectorObject.begin();
  while(itr != vectorObject.end())
    cout << *itr++ << " ";
  cout << endl;

  front_insert_iterator<list<int> > frnt_i_itr(vectorObject);  // create a front_insert_iterator to vectorObject


  *frnt_i_itr++ = 100;   // insert rather than overwrite at front

  *frnt_i_itr = 200;

  cout << "vectorObject after insertion: ";
  itr = vectorObject.begin();
  while(itr != vectorObject.end())
    cout << *itr++ << " ";
  cout << endl;

  cout << "Size of vectorObject2 before copy: " << vectorObject2.size() << endl;

  copy(vectorObject.begin(), vectorObject.end(), front_inserter(vectorObject2));

  cout << "Size of vectorObject2 after copy: " << vectorObject2.size() << endl;

  cout << "Contents of vectorObject2 after insertion: ";
  itr = vectorObject2.begin();
  while(itr != vectorObject2.end())
    cout << *itr++ << " ";

  return 0;
}

Related examples in the same category

1.	Demonstrate inner_product() in vector
2.	Demonstrate partial_sum() in vector
3.	set_union, set_difference, set_symmetric_difference, set_intersection
4.	Use a unary function object to determine even/odd.
5.	Demonstrate count_if and not1 in vector
6.	Another way to sort a sequence into descending order.
7.	Use a function adaptor in vector
8.	Demonstrate insert_iterator in a vector
9.	Insert one vector into another using an insert iterator
10.	Demonstrate back_insert_iterator in vector
11.	Find minimum and maximum inside a vector
12.	Use for_each() in vector
13.	Use the logical_not unary function object in vector
14.	Sorting a vector into descending order in vector
15.	Using copy() in Vector
16.	Using swap_ranges() in Vector
17.	Exchange elements from two different types of containers.
18.	Demonstrate find() and find_if() in vector
19.	Demonstrate search() in vector
20.	Demonstrate mismatch() in vector
21.	Demonstrating sort() in vector
22.	Demonstrating partial_sort() in vector
23.	Demonstrate binary_search() in vector
24.	Demonstrate lower_bound() in vector
25.	Demonstrating remove() and replace() in vector
26.	Demonstrating unique() in vector
27.	Transforming a sequence in vector
28.	Generating a sequence in vector
29.	Rotate a sequence in vector
30.	Right-rotate a sequence in vector
31.	Demonstrate random_shuffle() in vector
32.	Merge two sequences
33.	A vector may allocate more memory than it currently needs.

Demonstrate front_insert_iterator in vector : Vector Utility « Data Structure « C++

Related examples in the same category