Description
list is a container type that is optimized for insertion and deletion of elements. Unlike vector, list does not have a [] operation, and typically is implemented as a doubly-linked list. Elements may be efficiently added at the front or back of the list, and one list can be spliced into the middle of another one.
Declaration
template <class T, class A = allocator<T> > class std::list;
Concept
The sample program creates a list of integers, and adds several elements to it. One of these is then removed. Another list is created and spliced into the middle of the first list. The output of the program is:
front = 19 back = 47 19 73 59 67 37 47
Supported
Supported
Supported