Home
C++
Bitset
Class
Console
Data Structure
Data Type
Deque
Development
File
Function
Generic
Language
List
Map Multimap
Overload
Pointer
Qt
Queue Stack
Set Multiset
STL Algorithms Binary search
STL Algorithms Heap
STL Algorithms Helper
STL Algorithms Iterator
STL Algorithms Merge
STL Algorithms Min Max
STL Algorithms Modifying sequence operations
STL Algorithms Non modifying sequence operations
STL Algorithms Sorting
STL Basics
String
Valarray
Vector
Menu
List « Data Structure « C++
C++
Data Structure
List
1.
List basics: push, begin, end pop
2.
Elements can be put on the front or end of a list.
3.
Define class and store in a list
4.
An example of the transform algorithm.
5.
Demonstrate merge() in list
6.
Merging won't work if the lists aren't ordered.
7.
Merge into descending order.
8.
A list splicing example.
9.
Demonstrate remove() in list
10.
Demonstrate unique() in list
11.
Using reverse() to create a palindrome tester.
12.
Using a list to store mailing addresses.
13.
Use ostream_iterator for string
14.
Demonstrate advance() and distance() in list
15.
Using an arrays as a container
16.
Using a list: push_back, begin, end, size
17.
Merge and splice lists.
18.
Copy a list to a vector.
19.
Push value in the list
20.
Use a binary function object in list 'transform'
21.
end() in list.
22.
The difference between push_back() and push_front().
23.
Sort a list.
24.
Merge two lists.
25.
Store class objects in a list.
26.
Transform algorithm based on list.
27.
Demonstrate bind2nd().
28.
Create a reciprocal function object.
29.
Understanding end() in List
30.
Difference between push_back() and push_front()
31.
Merging One List with Another
32.
Storing Class Objects in a List
33.
Traverse a List Using an Iterator
34.
Demonstrate virtual functons: list interface