Definition at line 48 of file multiset.h.
std::__debug::multiset< _Key, _Compare, _Allocator >::multiset | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
const _Compare & | __comp = _Compare() , |
|||
const _Allocator & | __a = _Allocator() | |||
) | [inline] |
Builds a multiset from a range.
first | An input iterator. | |
last | An input iterator. | |
comp | A comparison functor. | |
a | An allocator object. |
Reimplemented from std::multiset< _Key, _Compare, _Allocator >.
Definition at line 83 of file multiset.h.
std::__debug::multiset< _Key, _Compare, _Allocator >::multiset | ( | const multiset< _Key, _Compare, _Allocator > & | __x | ) | [inline] |
Multiset copy constructor.
x | A multiset of identical element and allocator types. |
Reimplemented from std::multiset< _Key, _Compare, _Allocator >.
Definition at line 89 of file multiset.h.
std::__debug::multiset< _Key, _Compare, _Allocator >::multiset | ( | const _Base & | __x | ) | [inline] |
Multiset copy constructor.
x | A multiset of identical element and allocator types. |
Reimplemented from std::multiset< _Key, _Compare, _Allocator >.
Definition at line 92 of file multiset.h.
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().
const_iterator std::__debug::multiset< _Key, _Compare, _Allocator >::begin | ( | ) | const [inline] |
Returns a read/write iterator that points to the first element in the multiset. Iteration is done in ascending order according to the keys.
Reimplemented from std::multiset< _Key, _Compare, _Allocator >.
Definition at line 112 of file multiset.h.
References std::multiset< _Key, _Compare, _Allocator >::begin().
void std::__debug::multiset< _Key, _Compare, _Allocator >::clear | ( | ) | [inline] |
Erases all elements in a multiset. 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::multiset< _Key, _Compare, _Allocator >.
Definition at line 205 of file multiset.h.
References std::__debug::multiset< _Key, _Compare, _Allocator >::begin(), std::__debug::multiset< _Key, _Compare, _Allocator >::end(), and std::__debug::multiset< _Key, _Compare, _Allocator >::erase().
size_type std::multiset< _Key , _Compare , _Allocator >::count | ( | const key_type & | __x | ) | const [inline, inherited] |
Finds the number of elements with given key.
x | Key of elements to be located. |
Definition at line 396 of file stl_multiset.h.
References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::count().
bool std::multiset< _Key , _Compare , _Allocator >::empty | ( | ) | const [inline, inherited] |
Returns true if the set is empty.
Definition at line 253 of file stl_multiset.h.
References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::empty().
const_iterator std::__debug::multiset< _Key, _Compare, _Allocator >::end | ( | ) | const [inline] |
Returns a read/write iterator that points one past the last element in the multiset. Iteration is done in ascending order according to the keys.
Reimplemented from std::multiset< _Key, _Compare, _Allocator >.
Definition at line 120 of file multiset.h.
References std::multiset< _Key, _Compare, _Allocator >::end().
std::pair<iterator,iterator> std::__debug::multiset< _Key, _Compare, _Allocator >::equal_range | ( | const key_type & | __x | ) | [inline] |
Finds a subsequence matching given key.
x | Key to be located. |
std::make_pair(c.lower_bound(val), c.upper_bound(val))
This function probably only makes sense for multisets.
Reimplemented from std::multiset< _Key, _Compare, _Allocator >.
Definition at line 246 of file multiset.h.
References std::equal_range(), std::pair< _T1, _T2 >::first, std::make_pair(), and std::pair< _T1, _T2 >::second.
Referenced by std::__debug::multiset< _Key, _Compare, _Allocator >::erase().
void std::multiset< _Key , _Compare , _Allocator >::erase | ( | iterator | __first, | |
iterator | __last | |||
) | [inline, inherited] |
Erases a [first,last) range of elements from a multiset.
first | Iterator pointing to the start of the range to be erased. | |
last | Iterator pointing to the end of the range to be erased. |
Definition at line 375 of file stl_multiset.h.
References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::erase().
void std::multiset< _Key , _Compare , _Allocator >::erase | ( | iterator | __position | ) | [inline, inherited] |
Erases an element from a multiset.
position | An iterator pointing to the element to be erased. |
Definition at line 345 of file stl_multiset.h.
References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::erase().
Referenced by std::__debug::multiset< _Key, _Compare, _Allocator >::erase().
size_type std::__debug::multiset< _Key, _Compare, _Allocator >::erase | ( | const key_type & | __x | ) | [inline] |
Erases elements according to the provided key.
x | Key of element to be erased. |
Reimplemented from std::multiset< _Key, _Compare, _Allocator >.
Definition at line 173 of file multiset.h.
References __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::_M_invalidate(), __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::base(), std::__debug::multiset< _Key, _Compare, _Allocator >::equal_range(), std::multiset< _Key, _Compare, _Allocator >::erase(), std::pair< _T1, _T2 >::first, and std::pair< _T1, _T2 >::second.
iterator std::__debug::multiset< _Key, _Compare, _Allocator >::find | ( | const key_type & | __x | ) | [inline] |
Tries to locate an element in a set.
x | Element to be located. |
end()
) iterator.
Reimplemented from std::multiset< _Key, _Compare, _Allocator >.
Definition at line 214 of file multiset.h.
References std::multiset< _Key, _Compare, _Allocator >::find().
allocator_type std::multiset< _Key , _Compare , _Allocator >::get_allocator | ( | ) | const [inline, inherited] |
Returns the memory allocation object.
Definition at line 212 of file stl_multiset.h.
References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::get_allocator().
iterator std::multiset< _Key , _Compare , _Allocator >::insert | ( | iterator | __position, | |
const value_type & | __x | |||
) | [inline, inherited] |
Inserts an element into the multiset.
position | An iterator that serves as a hint as to where the element should be inserted. | |
x | Element to be inserted. |
Note that the first parameter is only a hint and can potentially improve the performance of the insertion process. A bad hint would cause no gains in efficiency.
See http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#4 for more on "hinting".
Insertion requires logarithmic time (if the hint is not taken).
Definition at line 318 of file stl_multiset.h.
References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_insert_equal().
void std::__debug::multiset< _Key, _Compare, _Allocator >::insert | ( | _InputIterator | __first, | |
_InputIterator | __last | |||
) | [inline] |
A template function that attemps to insert a range of elements.
first | Iterator pointing to the start of the range to be inserted. | |
last | Iterator pointing to the end of the range. |
Reimplemented from std::multiset< _Key, _Compare, _Allocator >.
Definition at line 158 of file multiset.h.
References __glibcxx_check_valid_range, and std::multiset< _Key, _Compare, _Allocator >::insert().
iterator std::__debug::multiset< _Key, _Compare, _Allocator >::insert | ( | const value_type & | __x | ) | [inline] |
Inserts an element into the multiset.
x | Element to be inserted. |
Insertion requires logarithmic time.
Reimplemented from std::multiset< _Key, _Compare, _Allocator >.
Definition at line 146 of file multiset.h.
References std::multiset< _Key, _Compare, _Allocator >::insert().
key_compare std::multiset< _Key , _Compare , _Allocator >::key_comp | ( | ) | const [inline, inherited] |
Returns the comparison object.
Definition at line 204 of file stl_multiset.h.
References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::key_comp().
iterator std::__debug::multiset< _Key, _Compare, _Allocator >::lower_bound | ( | const key_type & | __x | ) | [inline] |
Finds the beginning of a subsequence matching given key.
x | Key to be located. |
Reimplemented from std::multiset< _Key, _Compare, _Allocator >.
Definition at line 226 of file multiset.h.
References std::multiset< _Key, _Compare, _Allocator >::lower_bound().
size_type std::multiset< _Key , _Compare , _Allocator >::max_size | ( | ) | const [inline, inherited] |
Returns the maximum size of the set.
Definition at line 263 of file stl_multiset.h.
References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::max_size().
multiset<_Key,_Compare,_Allocator>& std::__debug::multiset< _Key, _Compare, _Allocator >::operator= | ( | const multiset< _Key, _Compare, _Allocator > & | __x | ) | [inline] |
Multiset assignment operator.
x | A multiset of identical element and allocator types. |
Reimplemented from std::multiset< _Key, _Compare, _Allocator >.
Definition at line 97 of file multiset.h.
const_reverse_iterator std::__debug::multiset< _Key, _Compare, _Allocator >::rbegin | ( | ) | const [inline] |
Returns a read/write reverse iterator that points to the last element in the multiset. Iteration is done in descending order according to the keys.
Reimplemented from std::multiset< _Key, _Compare, _Allocator >.
Definition at line 128 of file multiset.h.
References std::__debug::multiset< _Key, _Compare, _Allocator >::end().
const_reverse_iterator std::__debug::multiset< _Key, _Compare, _Allocator >::rend | ( | ) | const [inline] |
Returns a read/write reverse iterator that points to the last element in the multiset. Iteration is done in descending order according to the keys.
Reimplemented from std::multiset< _Key, _Compare, _Allocator >.
Definition at line 136 of file multiset.h.
References std::__debug::multiset< _Key, _Compare, _Allocator >::begin().
size_type std::multiset< _Key , _Compare , _Allocator >::size | ( | ) | const [inline, inherited] |
Returns the size of the set.
Definition at line 258 of file stl_multiset.h.
References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::size().
void std::__debug::multiset< _Key, _Compare, _Allocator >::swap | ( | multiset< _Key, _Compare, _Allocator > & | __x | ) | [inline] |
Swaps data with another multiset.
x | A multiset of the same element and allocator types. |
Compare
type (which itself is often stateless and empty), so it should be quite fast.) Note that the global std::swap() function is specialized such that std::swap(s1,s2) will feed to this function.
Reimplemented from std::multiset< _Key, _Compare, _Allocator >.
Definition at line 198 of file multiset.h.
References __gnu_debug::_Safe_sequence_base::_M_swap(), and std::tr1::swap().
Referenced by std::__debug::swap().
iterator std::__debug::multiset< _Key, _Compare, _Allocator >::upper_bound | ( | const key_type & | __x | ) | [inline] |
Finds the end of a subsequence matching given key.
x | Key to be located. |
Reimplemented from std::multiset< _Key, _Compare, _Allocator >.
Definition at line 236 of file multiset.h.
References std::multiset< _Key, _Compare, _Allocator >::upper_bound().
value_compare std::multiset< _Key , _Compare , _Allocator >::value_comp | ( | ) | const [inline, inherited] |
Returns the comparison object.
Definition at line 208 of file stl_multiset.h.
References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::key_comp().
_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().