Definition at line 75 of file debug/list.
std::__debug::list< _Tp, _Allocator >::list | ( | const _Allocator & | __a = _Allocator() |
) | [inline, explicit] |
Default constructor creates no elements.
Reimplemented from std::list< _Tp, _Allocator >.
Definition at line 102 of file debug/list.
std::__debug::list< _Tp, _Allocator >::list | ( | size_type | __n, | |
const _Tp & | __value = _Tp() , |
|||
const _Allocator & | __a = _Allocator() | |||
) | [inline, explicit] |
Create a list with copies of an exemplar element.
n | The number of elements to initially create. | |
value | An element to copy. |
Reimplemented from std::list< _Tp, _Allocator >.
Definition at line 105 of file debug/list.
std::__debug::list< _Tp, _Allocator >::list | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
const _Allocator & | __a = _Allocator() | |||
) | [inline] |
Builds a list from a range.
first | An input iterator. | |
last | An input iterator. |
Reimplemented from std::list< _Tp, _Allocator >.
Definition at line 110 of file debug/list.
void __gnu_debug::_Safe_sequence_base::_M_detach_all | ( | ) | [protected, inherited] |
Detach all iterators, leaving them singular.
Referenced by __gnu_debug::_Safe_sequence_base::~_Safe_sequence_base().
void __gnu_debug::_Safe_sequence_base::_M_detach_singular | ( | ) | [protected, inherited] |
Detach all singular iterators.
Referenced by std::__debug::deque< _Tp, _Allocator >::erase(), and std::__debug::list< _Tp, _Allocator >::resize().
__gnu_cxx::__mutex& __gnu_debug::_Safe_sequence_base::_M_get_mutex | ( | ) | [protected, inherited] |
For use in _Safe_sequence.
void __gnu_debug::_Safe_sequence_base::_M_invalidate_all | ( | ) | const [inline, inherited] |
Invalidates all iterators.
Definition at line 220 of file safe_base.h.
References __gnu_debug::_Safe_sequence_base::_M_version.
Referenced by __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::append(), std::__debug::vector< _Tp, _Allocator >::assign(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::assign(), std::__debug::deque< _Tp, _Allocator >::assign(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::c_str(), std::__debug::vector< _Tp, _Allocator >::clear(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::clear(), std::__debug::deque< _Tp, _Allocator >::clear(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::data(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::erase(), std::__debug::deque< _Tp, _Allocator >::erase(), __gnu_debug::getline(), std::__debug::vector< _Tp, _Allocator >::insert(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::insert(), std::__debug::deque< _Tp, _Allocator >::insert(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::operator+=(), std::__debug::vector< _Tp, _Allocator >::operator=(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::operator=(), std::__debug::deque< _Tp, _Allocator >::operator=(), __gnu_debug::operator>>(), std::__debug::vector< _Tp, _Allocator >::push_back(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::push_back(), std::__debug::deque< _Tp, _Allocator >::push_back(), std::__debug::deque< _Tp, _Allocator >::push_front(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::replace(), std::__debug::vector< _Tp, _Allocator >::reserve(), std::__debug::vector< _Tp, _Allocator >::resize(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::resize(), std::__debug::deque< _Tp, _Allocator >::resize(), and __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::swap().
void __gnu_debug::_Safe_sequence< _Sequence >::_M_invalidate_if | ( | _Predicate | __pred | ) | [inherited] |
Invalidates all iterators x
that reference this sequence, are not singular, and for which pred(x)
returns true
. The user of this routine should be careful not to make copies of the iterators passed to pred
, as the copies may interfere with the invalidation.
Definition at line 126 of file safe_sequence.h.
References __gnu_debug::_Safe_sequence_base::_M_const_iterators, and __gnu_debug::_Safe_sequence_base::_M_iterators.
Referenced by std::__debug::vector< _Tp, _Allocator >::erase(), std::__debug::vector< _Tp, _Allocator >::insert(), std::__debug::vector< _Tp, _Allocator >::resize(), and std::__debug::deque< _Tp, _Allocator >::resize().
void __gnu_debug::_Safe_sequence_base::_M_revalidate_singular | ( | ) | [protected, inherited] |
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(), and std::__debug::list< _Tp, _Allocator >::resize().
void __gnu_debug::_Safe_sequence_base::_M_swap | ( | _Safe_sequence_base & | __x | ) | [protected, inherited] |
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(), std::__debug::list< _Tp, _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(), __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::swap(), and std::__debug::deque< _Tp, _Allocator >::swap().
void __gnu_debug::_Safe_sequence< _Sequence >::_M_transfer_iter | ( | const _Safe_iterator< _Iterator, _Sequence > & | __x | ) | [inherited] |
Transfers all iterators that reference this memory location to this sequence from whatever sequence they are attached to.
Definition at line 159 of file safe_sequence.h.
References __gnu_debug::_Safe_sequence_base::_M_const_iterators, __gnu_debug::_Safe_sequence_base::_M_iterators, __gnu_debug::_Safe_iterator_base::_M_sequence, and __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::base().
Referenced by std::__debug::list< _Tp, _Allocator >::splice().
void std::__debug::list< _Tp, _Allocator >::assign | ( | size_type | __n, | |
const _Tp & | __t | |||
) | [inline] |
Assigns a given value to a list.
n | Number of elements to be assigned. | |
val | Value to be assigned. |
Reimplemented from std::list< _Tp, _Allocator >.
Definition at line 140 of file debug/list.
References std::list< _Tp, _Allocator >::assign().
void std::__debug::list< _Tp, _Allocator >::assign | ( | _InputIterator | __first, | |
_InputIterator | __last | |||
) | [inline] |
Assigns a range to a list.
first | An input iterator. | |
last | An input iterator. |
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().
const_reference std::__debug::list< _Tp, _Allocator >::back | ( | ) | const [inline] |
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, and std::list< _Tp, _Allocator >::back().
reference std::__debug::list< _Tp, _Allocator >::back | ( | ) | [inline] |
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, and std::list< _Tp, _Allocator >::back().
const_iterator std::__debug::list< _Tp, _Allocator >::begin | ( | ) | const [inline] |
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().
iterator std::__debug::list< _Tp, _Allocator >::begin | ( | ) | [inline] |
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 >::pop_front(), std::__debug::list< _Tp, _Allocator >::remove(), std::__debug::list< _Tp, _Allocator >::remove_if(), std::__debug::list< _Tp, _Allocator >::rend(), std::__debug::list< _Tp, _Allocator >::resize(), std::__debug::list< _Tp, _Allocator >::splice(), and std::__debug::list< _Tp, _Allocator >::unique().
void std::__debug::list< _Tp, _Allocator >::clear | ( | ) | [inline] |
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.
References std::list< _Tp, _Allocator >::clear().
bool std::list< _Tp , _Allocator >::empty | ( | ) | const [inline, inherited] |
Returns true if the list is empty. (Thus begin() would equal end().)
Definition at line 654 of file stl_list.h.
const_iterator std::__debug::list< _Tp, _Allocator >::end | ( | ) | const [inline] |
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().
iterator std::__debug::list< _Tp, _Allocator >::end | ( | ) | [inline] |
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 >::pop_back(), std::__debug::list< _Tp, _Allocator >::rbegin(), std::__debug::list< _Tp, _Allocator >::resize(), std::__debug::list< _Tp, _Allocator >::splice(), and std::__debug::list< _Tp, _Allocator >::unique().
iterator std::list< _Tp , _Allocator >::erase | ( | iterator | __first, | |
iterator | __last | |||
) | [inline, inherited] |
Remove a range of elements.
first | Iterator pointing to the first element to be erased. | |
last | Iterator pointing to one past the last element to be erased. |
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.
position | Iterator pointing to element to be erased. |
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.
Referenced by std::__debug::list< _Tp, _Allocator >::erase().
const_reference std::__debug::list< _Tp, _Allocator >::front | ( | ) | const [inline] |
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, and std::list< _Tp, _Allocator >::front().
reference std::__debug::list< _Tp, _Allocator >::front | ( | ) | [inline] |
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, and std::list< _Tp, _Allocator >::front().
allocator_type std::list< _Tp , _Allocator >::get_allocator | ( | ) | const [inline, inherited] |
Get a copy of the memory allocation object.
Reimplemented from std::_List_base< _Tp, _Allocator >.
Definition at line 573 of file stl_list.h.
void std::list< _Tp , _Allocator >::insert | ( | iterator | __position, | |
_InputIterator | __first, | |||
_InputIterator | __last | |||
) | [inline, inherited] |
Inserts a range into the list.
position | An iterator into the list. | |
first | An input iterator. | |
last | An input iterator. |
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.
void std::list< _Tp , _Allocator >::insert | ( | iterator | __position, | |
size_type | __n, | |||
const value_type & | __x | |||
) | [inline, inherited] |
Inserts a number of copies of given data into the list.
position | An iterator into the list. | |
n | Number of elements to be inserted. | |
x | Data to be inserted. |
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.
iterator std::list< _Tp , _Allocator >::insert | ( | iterator | __position, | |
const value_type & | __x | |||
) | [inherited] |
Inserts given value into list before specified iterator.
position | An iterator into the list. | |
x | Data to be inserted. |
Referenced by std::__debug::list< _Tp, _Allocator >::insert().
Returns the size() of the largest possible list.
Definition at line 664 of file stl_list.h.
void std::list< _Tp , _Allocator >::merge | ( | list< _Tp, _Allocator > & | , | |
_StrictWeakOrdering | ||||
) | [inherited] |
Merge sorted lists according to comparison function.
x | Sorted list to merge. | |
StrictWeakOrdering | Comparison function definining sort order. |
Merge sorted lists.
x | Sorted list to merge. |
void std::__debug::list< _Tp, _Allocator >::pop_back | ( | ) | [inline] |
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, __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::_M_invalidate(), std::__debug::list< _Tp, _Allocator >::end(), and std::list< _Tp, _Allocator >::pop_back().
void std::__debug::list< _Tp, _Allocator >::pop_front | ( | ) | [inline] |
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, __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::_M_invalidate(), std::__debug::list< _Tp, _Allocator >::begin(), and std::list< _Tp, _Allocator >::pop_front().
void std::list< _Tp , _Allocator >::push_back | ( | const value_type & | __x | ) | [inline, inherited] |
Add data to the end of the list.
x | Data to be added. |
Definition at line 763 of file stl_list.h.
void std::list< _Tp , _Allocator >::push_front | ( | const value_type & | __x | ) | [inline, inherited] |
Add data to the front of the list.
x | Data to be added. |
Definition at line 733 of file stl_list.h.
const_reverse_iterator std::__debug::list< _Tp, _Allocator >::rbegin | ( | ) | const [inline] |
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().
reverse_iterator std::__debug::list< _Tp, _Allocator >::rbegin | ( | ) | [inline] |
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().
void std::__debug::list< _Tp, _Allocator >::remove | ( | const _Tp & | __value | ) | [inline] |
Remove all elements equal to value.
value | The value to remove. |
Reimplemented from std::list< _Tp, _Allocator >.
Definition at line 389 of file debug/list.
References __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::base(), std::__debug::list< _Tp, _Allocator >::begin(), std::list< _Tp, _Allocator >::end(), and std::__debug::list< _Tp, _Allocator >::erase().
void std::__debug::list< _Tp, _Allocator >::remove_if | ( | _Predicate | __pred | ) | [inline] |
Remove all elements satisfying a predicate.
Predicate | Unary predicate function or object. |
Reimplemented from std::list< _Tp, _Allocator >.
Definition at line 402 of file debug/list.
References __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::base(), std::__debug::list< _Tp, _Allocator >::begin(), std::list< _Tp, _Allocator >::end(), and std::__debug::list< _Tp, _Allocator >::erase().
const_reverse_iterator std::__debug::list< _Tp, _Allocator >::rend | ( | ) | const [inline] |
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().
reverse_iterator std::__debug::list< _Tp, _Allocator >::rend | ( | ) | [inline] |
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().
void std::__debug::list< _Tp, _Allocator >::resize | ( | size_type | __sz, | |
_Tp | __c = _Tp() | |||
) | [inline] |
Resizes the list to the specified number of elements.
new_size | Number of elements the list should contain. | |
x | Data with which new elements should be populated. |
Reimplemented from std::list< _Tp, _Allocator >.
Definition at line 187 of file debug/list.
References __gnu_debug::_Safe_sequence_base::_M_detach_singular(), __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::_M_invalidate(), __gnu_debug::_Safe_sequence_base::_M_revalidate_singular(), std::__debug::list< _Tp, _Allocator >::begin(), std::__debug::list< _Tp, _Allocator >::end(), and std::list< _Tp, _Allocator >::resize().
void std::list< _Tp , _Allocator >::reverse | ( | ) | [inline, inherited] |
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().
void std::__debug::list< _Tp, _Allocator >::sort | ( | _StrictWeakOrdering | __pred | ) | [inline] |
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().
void std::__debug::list< _Tp, _Allocator >::sort | ( | ) | [inline] |
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().
void std::list< _Tp , _Allocator >::splice | ( | iterator | __position, | |
list< _Tp, _Allocator > & | __x, | |||
iterator | __first, | |||
iterator | __last | |||
) | [inline, inherited] |
Insert range from another list.
position | Iterator referencing the element to insert before. | |
x | Source list. | |
first | Iterator referencing the start of range in x. | |
last | Iterator referencing the end of range in x. |
Undefined if position is in [first,last).
Definition at line 972 of file stl_list.h.
void std::list< _Tp , _Allocator >::splice | ( | iterator | __position, | |
list< _Tp, _Allocator > & | __x, | |||
iterator | __i | |||
) | [inline, inherited] |
Insert element from another list.
position | Iterator referencing the element to insert before. | |
x | Source list. | |
i | Iterator referencing the element to move. |
Definition at line 946 of file stl_list.h.
void std::list< _Tp , _Allocator >::splice | ( | iterator | __position, | |
list< _Tp, _Allocator > & | __x | |||
) | [inline, inherited] |
Insert contents of another list.
position | Iterator referencing the element to insert before. | |
x | Source 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().
Referenced by std::__debug::list< _Tp, _Allocator >::splice().
Swaps data with another list.
x | A list of the same element and allocator types. |
Definition at line 890 of file stl_list.h.
References std::_List_base< _Tp, _Alloc >::_M_get_Node_allocator(), std::_List_base< _Tp, _Alloc >::_M_impl, std::__alloc_swap< _Alloc, >::_S_do_it(), and std::tr1::swap().
void std::__debug::list< _Tp, _Allocator >::unique | ( | _BinaryPredicate | __binary_pred | ) | [inline] |
Remove consecutive elements satisfying a predicate.
BinaryPredicate | Binary predicate function or object. |
Reimplemented from std::list< _Tp, _Allocator >.
Definition at line 433 of file debug/list.
References std::__debug::list< _Tp, _Allocator >::begin(), std::__debug::list< _Tp, _Allocator >::end(), and std::__debug::list< _Tp, _Allocator >::erase().
void std::__debug::list< _Tp, _Allocator >::unique | ( | ) | [inline] |
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.
References std::__debug::list< _Tp, _Allocator >::begin(), std::__debug::list< _Tp, _Allocator >::end(), and std::__debug::list< _Tp, _Allocator >::erase().
_Safe_iterator_base* __gnu_debug::_Safe_sequence_base::_M_const_iterators [inherited] |
The list of constant iterators that reference this container.
Definition at line 171 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().
_Safe_iterator_base* __gnu_debug::_Safe_sequence_base::_M_iterators [inherited] |
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().
unsigned int __gnu_debug::_Safe_sequence_base::_M_version [mutable, inherited] |
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().