#include <stl_list.h>
at
and operator
[].
This is a doubly linked list. Traversal up and down the list requires linear time, but adding and removing elements (or nodes) is done in constant time, regardless of where the change takes place. Unlike std::vector and std::deque, random-access iterators are not provided, so subscripting ( [] ) access is not allowed. For algorithms which only need sequential access, this lack makes no difference.
Also unlike the other standard containers, std::list provides specialized algorithms unique to linked lists, such as splicing, sorting, and in-place reversal.
Definition at line 389 of file stl_list.h.
|
Default constructor creates no elements.
Definition at line 477 of file stl_list.h. |
|
Create a list with copies of an exemplar element.
Definition at line 487 of file stl_list.h. |
|
Create a list with default elements.
Definition at line 500 of file stl_list.h. |
|
List copy constructor.
Definition at line 511 of file stl_list.h. References list::begin(), and list::end(). |
|
Builds a list from a range.
Definition at line 530 of file stl_list.h. |
|
Assigns a range to a list.
Note that the assignment completely changes the list and that the resulting list's size is the same as the number of elements assigned. Old data may be lost. Definition at line 581 of file stl_list.h. |
|
Assigns a given value to a list.
Definition at line 564 of file stl_list.h. |
|
Returns a read-only (constant) reference to the data at the last element of the list. Definition at line 739 of file stl_list.h. |
|
Returns a read/write reference to the data at the last element of the list. Definition at line 731 of file stl_list.h. |
|
Returns a read-only (constant) iterator that points to the first element in the list. Iteration is done in ordinary element order. Definition at line 608 of file stl_list.h. |
|
Returns a read/write iterator that points to the first element in the list. Iteration is done in ordinary element order. Definition at line 599 of file stl_list.h. Referenced by list::list(), list::merge(), list::operator=(), std::operator==(), list::remove_if(), list::resize(), list::sort(), list::splice(), and list::unique(). |
|
Erases all the elements. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty. Definition at line 922 of file stl_list.h. |
|
Returns true if the list is empty. (Thus begin() would equal end().) Definition at line 670 of file stl_list.h. Referenced by list::sort(), and list::splice(). |
|
Returns a read-only (constant) iterator that points one past the last element in the list. Iteration is done in ordinary element order. Definition at line 625 of file stl_list.h. |
|
Returns a read/write iterator that points one past the last element in the list. Iteration is done in ordinary element order. Definition at line 617 of file stl_list.h. Referenced by list::list(), list::merge(), list::operator=(), std::operator==(), list::remove_if(), list::resize(), list::splice(), and list::unique(). |
|
Remove a range of elements.
Due to the nature of a list this operation can be done in constant time, and only invalidates iterators/references to the element being removed. The user is also cautioned that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty. Definition at line 895 of file stl_list.h. |
|
Remove element at given position.
Due to the nature of a list this operation can be done in constant time, and only invalidates iterators/references to the element being removed. The user is also cautioned that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty. Definition at line 95 of file list.tcc. Referenced by list::operator=(), and list::resize(). |
|
Returns a read-only (constant) reference to the data at the first element of the list. Definition at line 723 of file stl_list.h. |
|
Returns a read/write reference to the data at the first element of the list. Definition at line 715 of file stl_list.h. |
|
Get a copy of the memory allocation object.
Definition at line 590 of file stl_list.h. |
|
Inserts a range into the list.
Due to the nature of a list this operation can be done in constant time, and does not invalidate iterators and references. Definition at line 849 of file stl_list.h. |
|
Inserts a number of copies of given data into the list.
Due to the nature of a list this operation can be done in constant time, and does not invalidate iterators and references. Definition at line 830 of file stl_list.h. |
|
Inserts given value into list before specified iterator.
Definition at line 85 of file list.tcc. Referenced by list::operator=(), and list::resize(). |
|
Returns the size() of the largest possible list. Definition at line 680 of file stl_list.h. |
|
Merge sorted lists according to comparison function.
Definition at line 313 of file list.tcc. References list::begin(), and list::end(). |
|
Merge sorted lists.
Definition at line 210 of file list.tcc. References list::begin(), and list::end(). Referenced by list::sort(). |
|
List assignment operator.
Definition at line 120 of file list.tcc. References list::begin(), list::end(), list::erase(), and list::insert(). |
|
Removes last element. This is a typical stack operation. It shrinks the list by one. Due to the nature of a list this operation can be done in constant time, and only invalidates iterators/references to the element being removed. Note that no data is returned, and if the last element's data is needed, it should be retrieved before pop_back() is called. Definition at line 799 of file stl_list.h. |
|
Removes first element. This is a typical stack operation. It shrinks the list by one. Due to the nature of a list this operation can be done in constant time, and only invalidates iterators/references to the element being removed. Note that no data is returned, and if the first element's data is needed, it should be retrieved before pop_front() is called. Definition at line 770 of file stl_list.h. |
|
Add data to the end of the list.
Definition at line 784 of file stl_list.h. |
|
Add data to the front of the list.
Definition at line 754 of file stl_list.h. |
|
Returns a read-only (constant) reverse iterator that points to the last element in the list. Iteration is done in reverse element order. Definition at line 643 of file stl_list.h. |
|
Returns a read/write reverse iterator that points to the last element in the list. Iteration is done in reverse element order. Definition at line 634 of file stl_list.h. |
|
Remove all elements equal to value.
|
|
Remove all elements satisfying a predicate.
Definition at line 275 of file list.tcc. References list::begin(), and list::end(). |
|
Returns a read-only (constant) reverse iterator that points to one before the first element in the list. Iteration is done in reverse element order. Definition at line 661 of file stl_list.h. |
|
Returns a read/write reverse iterator that points to one before the first element in the list. Iteration is done in reverse element order. Definition at line 652 of file stl_list.h. |
|
Resizes the list to the specified number of elements.
Definition at line 706 of file stl_list.h. |
|
Resizes the list to the specified number of elements.
Definition at line 105 of file list.tcc. References list::begin(), list::end(), list::erase(), and list::insert(). |
|
Reverse the elements in list. Reverse the order of elements in the list in linear time. Definition at line 1075 of file stl_list.h. References std::reverse(). |
|
Returns the number of elements in the list. Definition at line 675 of file stl_list.h. References std::distance(). |
|
Sort the elements according to comparison function. Sorts the elements of this list in NlogN time. Equivalent elements remain in list order. Definition at line 341 of file list.tcc. References list::begin(), list::empty(), list::merge(), list::splice(), std::swap(), and list::swap(). |
|
Sort the elements. Sorts the elements of this list in NlogN time. Equivalent elements remain in list order. Definition at line 237 of file list.tcc. References list::begin(), list::empty(), list::merge(), list::splice(), std::swap(), and list::swap(). |
|
Insert range from another list.
Undefined if position is in [first,last). Definition at line 977 of file stl_list.h. |
|
Insert element from another list.
Definition at line 955 of file stl_list.h. |
|
Insert contents of another list.
Definition at line 939 of file stl_list.h. References list::begin(), list::empty(), and list::end(). Referenced by list::sort(). |
|
Swaps data with another list.
Definition at line 912 of file stl_list.h. References std::swap(). Referenced by list::sort(), and std::swap(). |
|
Remove consecutive elements satisfying a predicate.
Definition at line 293 of file list.tcc. References list::begin(), and list::end(). |
|
Remove consecutive duplicate elements. For each consecutive set of elements with the same value, remove all but the first one. Remaining elements stay in list order. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty. Definition at line 190 of file list.tcc. References list::begin(), and list::end(). |