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

C++
1. Bitset
2. Class
3. Console
4. Data Structure
5. Data Type
6. Deque
7. Development
8. File
9. Function
10. Generic
11. Language
12. List
13. Map Multimap
14. Overload
15. Pointer
16. Queue Stack
17. Set Multiset
18. STL Algorithms Binary search
19. STL Algorithms Heap
20. STL Algorithms Helper
21. STL Algorithms Iterator
22. STL Algorithms Merge
23. STL Algorithms Min Max
24. STL Algorithms Modifying sequence operations
25. STL Algorithms Non modifying sequence operations
26. STL Algorithms Sorting
27. STL Basics
28. String
29. Valarray
30. Vector
Java
Java Tutorial
Java Source Code / Java Documentation
Java Open Source
Jar File Download
Java Articles
Java Products
Java by API
C# / C Sharp
C# / CSharp Tutorial
ASP.Net
JavaScript DHTML
JavaScript Tutorial
JavaScript Reference
HTML / CSS
HTML CSS Reference
C / ANSI-C
C Tutorial
C++ Tutorial
PHP
Python
SQL Server / T-SQL
SQL Server / T-SQL Tutorial
Oracle PL / SQL
Oracle PL/SQL Tutorial
PostgreSQL
SQL / MySQL
MySQL Tutorial
VB.Net
VB.Net Tutorial
Flash / Flex / ActionScript
VBA / Excel / Access / Word
Microsoft Office PowerPoint 2007 Tutorial
Microsoft Office Excel 2007 Tutorial
Microsoft Office Word 2007 Tutorial
C++ » Data Structure » ListScreenshots 
List basics: push, begin, end pop
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.Elements can be put on the front or end of a list.
2. Define class and store in a listDefine class and store in a list
3. An example of the transform algorithm.An example of the transform algorithm.
4. Demonstrate merge() in listDemonstrate merge() in list
5. Merging won't work if the lists aren't ordered.Merging won't work if the lists aren't ordered.
6. Merge into descending order.Merge into descending order.
7. A list splicing example.A list splicing example.
8. Demonstrate remove() in listDemonstrate remove() in list
9. Demonstrate unique() in listDemonstrate unique() in list
10. Using reverse() to create a palindrome tester.Using reverse() to create a palindrome tester.
11. Using a list to store mailing addresses.Using a list to store mailing addresses.
12. Use ostream_iterator for stringUse ostream_iterator for string
13. Demonstrate advance() and distance() in listDemonstrate advance() and distance() in list
14. Using an arrays as a containerUsing an arrays as a container
15. Using a list: push_back, begin, end, sizeUsing a list: push_back, begin, end, size
16. Merge and splice lists.Merge and splice lists.
17. Copy a list to a vector.Copy a list to a vector.
18. Push value in the listPush value in the list
19. Use a binary function object in list 'transform'Use a binary function object in list 'transform'
20. end() in list.end() in list.
21. The difference between push_back() and push_front().The difference between push_back() and push_front().
22. Sort a list.
23. Merge two lists.Merge two lists.
24. Store class objects in a list.Store class objects in a list.
25. Transform algorithm based on list.Transform algorithm based on list.
26. Demonstrate bind2nd().Demonstrate bind2nd().
27. Create a reciprocal function object.Create a reciprocal function object.
28. Understanding end() in ListUnderstanding end() in List
29. Difference between push_back() and push_front()Difference between push_back() and push_front()
30. Sort a ListSort a List
31. Merging One List with AnotherMerging One List with Another
32. Storing Class Objects in a ListStoring Class Objects in a List
33. Traverse a List Using an IteratorTraverse a List Using an Iterator
34. Demonstrate virtual functons: list interfaceDemonstrate virtual functons: list interface
w___w___w___.ja_v___a_2__s___.__co___m__ | Contact Us
Copyright 2003 - 08 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.