List basics: push, begin, end pop


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

int main()
{
  list<char> listObject;
  int i;

  for(i = 0; i <10; i++) 
     listObject.push_back('A'+i);

  cout << "Size = " << listObject.size() << endl;

  list<char>::iterator p;

  cout << "Contents: ";
  while(!listObject.empty()) {
    p = listObject.begin();
    cout << *p;
    listObject.pop_front();
  }
  
  return 0;
}

Related examples in the same category

1.	Elements can be put on the front or end of a list.
2.	Define class and store in a list
3.	An example of the transform algorithm.
4.	Demonstrate merge() in list
5.	Merging won't work if the lists aren't ordered.
6.	Merge into descending order.
7.	A list splicing example.
8.	Demonstrate remove() in list
9.	Demonstrate unique() in list
10.	Using reverse() to create a palindrome tester.
11.	Using a list to store mailing addresses.
12.	Use ostream_iterator for string
13.	Demonstrate advance() and distance() in list
14.	Using an arrays as a container
15.	Using a list: push_back, begin, end, size
16.	Merge and splice lists.
17.	Copy a list to a vector.
18.	Push value in the list
19.	Use a binary function object in list 'transform'
20.	end() in list.
21.	The difference between push_back() and push_front().
22.	Sort a list.
23.	Merge two lists.
24.	Store class objects in a list.
25.	Transform algorithm based on list.
26.	Demonstrate bind2nd().
27.	Create a reciprocal function object.
28.	Understanding end() in List
29.	Difference between push_back() and push_front()
30.	Merging One List with Another
31.	Storing Class Objects in a List
32.	Traverse a List Using an Iterator
33.	Demonstrate virtual functons: list interface

List basics: push, begin, end pop : List « Data Structure « C++

Related examples in the same category