Definition at line 75 of file debug/list.
|
Default constructor creates no elements.
Reimplemented from std::list< _Tp, _Allocator >. Definition at line 102 of file debug/list. |
|
Builds a list from a range.
Reimplemented from std::list< _Tp, _Allocator >. Definition at line 110 of file debug/list. |
|
List copy constructor.
Reimplemented from std::list< _Tp, _Allocator >. Definition at line 116 of file debug/list. |
|
Detach all iterators, leaving them singular. Referenced by __gnu_debug::_Safe_sequence_base::~_Safe_sequence_base(). |
|
Detach all singular iterators.
Referenced by std::__debug::deque< _Tp, _Allocator >::erase(), and std::__debug::list< _Tp, _Allocator >::resize(). |
|
For use in _Safe_sequence. |
|
|
Invalidates all iterators |
|
Revalidates all attached singular iterators. This method may be used to validate iterators that were invalidated before (but for some reasion, such as an exception, need to become valid again). Referenced by std::__debug::deque< _Tp, _Allocator >::erase(). |
|
Swap this sequence with the given sequence. This operation also swaps ownership of the iterators, so that when the operation is complete all iterators that originally referenced one container now reference the other container. Referenced by std::__debug::vector< _Tp, _Allocator >::swap(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::swap(), std::__debug::set< _Key, _Compare, _Allocator >::swap(), std::__debug::multiset< _Key, _Compare, _Allocator >::swap(), std::__debug::multimap< _Key, _Tp, _Compare, _Allocator >::swap(), std::__debug::map< _Key, _Tp, _Compare, _Allocator >::swap(), __gnu_cxx::__debug::hash_set< _Value, _HashFcn, _EqualKey, _Alloc >::swap(), __gnu_cxx::__debug::hash_multiset< _Value, _HashFcn, _EqualKey, _Alloc >::swap(), __gnu_cxx::__debug::hash_multimap< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::swap(), and __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::swap(). |
|
Transfers all iterators that reference this memory location to this sequence from whatever sequence they are attached to. |
|
Assigns a given value to a list.
Definition at line 547 of file stl_list.h. Referenced by std::__debug::list< _Tp, _Allocator >::assign(). |
|
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. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 132 of file debug/list. References __glibcxx_check_valid_range, and std::list< _Tp, _Allocator >::assign(). |
|
Returns a read-only (constant) reference to the data at the last element of the list. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 237 of file debug/list. References __glibcxx_check_nonempty. |
|
Returns a read/write reference to the data at the last element of the list. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 230 of file debug/list. References __glibcxx_check_nonempty. |
|
Returns a read-only (constant) iterator that points to the first element in the list. Iteration is done in ordinary element order. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 154 of file debug/list. References std::list< _Tp, _Allocator >::begin(). |
|
Returns a read/write iterator that points to the first element in the list. Iteration is done in ordinary element order. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 150 of file debug/list. References std::list< _Tp, _Allocator >::begin(). Referenced by std::__debug::list< _Tp, _Allocator >::merge(), std::__debug::list< _Tp, _Allocator >::rend(), std::__debug::list< _Tp, _Allocator >::resize(), and std::__debug::list< _Tp, _Allocator >::splice(). |
|
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. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 321 of file debug/list. |
|
Returns true if the list is empty. (Thus begin() would equal end().) Definition at line 654 of file stl_list.h. |
|
Returns a read-only (constant) iterator that points one past the last element in the list. Iteration is done in ordinary element order. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 162 of file debug/list. References std::list< _Tp, _Allocator >::end(). |
|
Returns a read/write iterator that points one past the last element in the list. Iteration is done in ordinary element order. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 158 of file debug/list. References std::list< _Tp, _Allocator >::end(). Referenced by std::__debug::list< _Tp, _Allocator >::merge(), std::__debug::list< _Tp, _Allocator >::rbegin(), std::__debug::list< _Tp, _Allocator >::resize(), and std::__debug::list< _Tp, _Allocator >::splice(). |
|
Remove a range of elements.
This operation is linear time in the size of the range 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 873 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. |
|
Returns a read-only (constant) reference to the data at the first element of the list. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 223 of file debug/list. References __glibcxx_check_nonempty. |
|
Returns a read/write reference to the data at the first element of the list. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 216 of file debug/list. References __glibcxx_check_nonempty. |
|
Get a copy of the memory allocation object.
Reimplemented from std::_List_base< _Tp, _Allocator >. Definition at line 573 of file stl_list.h. |
|
Inserts a range into the list.
This operation is linear in the number of elements inserted and does not invalidate iterators and references. Definition at line 829 of file stl_list.h. |
|
Inserts a number of copies of given data into the list.
This operation is linear in the number of elements inserted and does not invalidate iterators and references. Definition at line 808 of file stl_list.h. |
|
Inserts given value into list before specified iterator.
|
|
Returns the size() of the largest possible list. Definition at line 664 of file stl_list.h. |
|
Merge sorted lists according to comparison function.
|
|
Merge sorted lists.
Reimplemented from std::list< _Tp, _Allocator >. Definition at line 451 of file debug/list. References __glibcxx_check_sorted, __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::base(), std::__debug::list< _Tp, _Allocator >::begin(), and std::__debug::list< _Tp, _Allocator >::end(). |
|
List assignment operator.
Reimplemented from std::list< _Tp, _Allocator >. Definition at line 123 of file debug/list. |
|
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. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 258 of file debug/list. References __glibcxx_check_nonempty, and __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::_M_invalidate(). |
|
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. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 247 of file debug/list. References __glibcxx_check_nonempty, and __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::_M_invalidate(). |
|
Add data to the end of the list.
Definition at line 763 of file stl_list.h. |
|
Add data to the front of the list.
Definition at line 733 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. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 170 of file debug/list. References std::__debug::list< _Tp, _Allocator >::end(). |
|
Returns a read/write reverse iterator that points to the last element in the list. Iteration is done in reverse element order. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 166 of file debug/list. References std::__debug::list< _Tp, _Allocator >::end(). |
|
Remove all elements equal to value.
Reimplemented from std::list< _Tp, _Allocator >. Definition at line 389 of file debug/list. |
|
Remove all elements satisfying a predicate.
Reimplemented from std::list< _Tp, _Allocator >. Definition at line 402 of file debug/list. |
|
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. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 178 of file debug/list. References std::__debug::list< _Tp, _Allocator >::begin(). |
|
Returns a read/write reverse iterator that points to one before the first element in the list. Iteration is done in reverse element order. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 174 of file debug/list. References std::__debug::list< _Tp, _Allocator >::begin(). |
|
Resizes the list to the specified number of elements.
|
|
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. |
|
Returns the number of elements in the list. Definition at line 659 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. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 483 of file debug/list. References std::sort(). |
|
Sort the elements. Sorts the elements of this list in NlogN time. Equivalent elements remain in list order. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 479 of file debug/list. References std::sort(). |
|
Insert range from another list.
Undefined if position is in [first,last). Definition at line 972 of file stl_list.h. |
|
Insert element from another list.
Definition at line 946 of file stl_list.h. |
|
Insert contents of another list.
Requires this != x. Definition at line 926 of file stl_list.h. References std::list< _Tp, _Alloc >::begin(), std::list< _Tp, _Alloc >::empty(), and std::list< _Tp, _Alloc >::end(). |
|
Swaps data with another list.
Reimplemented from std::list< _Tp, _Allocator >. Definition at line 314 of file debug/list. References std::swap(). Referenced by std::__debug::swap(). |
|
Remove consecutive elements satisfying a predicate.
Reimplemented from std::list< _Tp, _Allocator >. Definition at line 433 of file debug/list. |
|
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. Reimplemented from std::list< _Tp, _Allocator >. Definition at line 414 of file debug/list. |
|
The list of constant iterators that reference this container.
Definition at line 171 of file safe_base.h. Referenced by __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::_M_invalidate_single(), and __gnu_debug::_Safe_sequence< _Sequence >::_M_transfer_iter(). |
|
The list of mutable iterators that reference this container.
Definition at line 168 of file safe_base.h. Referenced by __gnu_debug::_Safe_sequence< _Sequence >::_M_invalidate_if(), __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::_M_invalidate_single(), and __gnu_debug::_Safe_sequence< _Sequence >::_M_transfer_iter(). |
|
The container version number. This number may never be 0.
Definition at line 174 of file safe_base.h. Referenced by __gnu_debug::_Safe_sequence_base::_M_invalidate_all(). |