libstdc++
|
Public Types | |
typedef _Alloc | allocator_type |
typedef _Rep_type::const_iterator | const_iterator |
typedef _Alloc_traits::const_pointer | const_pointer |
typedef _Alloc_traits::const_reference | const_reference |
typedef _Rep_type::const_reverse_iterator | const_reverse_iterator |
typedef _Rep_type::difference_type | difference_type |
typedef _Rep_type::const_iterator | iterator |
typedef _Compare | key_compare |
typedef _Key | key_type |
typedef _Alloc_traits::pointer | pointer |
typedef _Alloc_traits::reference | reference |
typedef _Rep_type::const_reverse_iterator | reverse_iterator |
typedef _Rep_type::size_type | size_type |
typedef _Compare | value_compare |
typedef _Key | value_type |
Public Member Functions | |
multiset ()=default | |
multiset (const _Compare &__comp, const allocator_type &__a=allocator_type()) | |
template<typename _InputIterator > | |
multiset (_InputIterator __first, _InputIterator __last) | |
template<typename _InputIterator > | |
multiset (_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type()) | |
multiset (const multiset &)=default | |
multiset (multiset &&)=default | |
multiset (initializer_list< value_type > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type()) | |
multiset (const allocator_type &__a) | |
multiset (const multiset &__m, const allocator_type &__a) | |
multiset (multiset &&__m, const allocator_type &__a) noexcept(is_nothrow_copy_constructible< _Compare >::value &&_Alloc_traits::_S_always_equal()) | |
multiset (initializer_list< value_type > __l, const allocator_type &__a) | |
template<typename _InputIterator > | |
multiset (_InputIterator __first, _InputIterator __last, const allocator_type &__a) | |
~multiset ()=default | |
iterator | begin () const noexcept |
iterator | cbegin () const noexcept |
iterator | cend () const noexcept |
void | clear () noexcept |
reverse_iterator | crbegin () const noexcept |
reverse_iterator | crend () const noexcept |
template<typename... _Args> | |
iterator | emplace (_Args &&... __args) |
template<typename... _Args> | |
iterator | emplace_hint (const_iterator __pos, _Args &&... __args) |
bool | empty () const noexcept |
iterator | end () const noexcept |
_GLIBCXX_ABI_TAG_CXX11 iterator | erase (const_iterator __position) |
size_type | erase (const key_type &__x) |
_GLIBCXX_ABI_TAG_CXX11 iterator | erase (const_iterator __first, const_iterator __last) |
allocator_type | get_allocator () const noexcept |
iterator | insert (const value_type &__x) |
iterator | insert (value_type &&__x) |
iterator | insert (const_iterator __position, const value_type &__x) |
iterator | insert (const_iterator __position, value_type &&__x) |
template<typename _InputIterator > | |
void | insert (_InputIterator __first, _InputIterator __last) |
void | insert (initializer_list< value_type > __l) |
key_compare | key_comp () const |
size_type | max_size () const noexcept |
multiset & | operator= (const multiset &)=default |
multiset & | operator= (multiset &&)=default |
multiset & | operator= (initializer_list< value_type > __l) |
reverse_iterator | rbegin () const noexcept |
reverse_iterator | rend () const noexcept |
size_type | size () const noexcept |
void | swap (multiset &__x) noexcept(/*conditional */) |
value_compare | value_comp () const |
size_type | count (const key_type &__x) const |
template<typename _Kt > | |
auto | count (const _Kt &__x) const -> decltype(_M_t._M_count_tr(__x)) |
iterator | find (const key_type &__x) |
const_iterator | find (const key_type &__x) const |
template<typename _Kt > | |
auto | find (const _Kt &__x) -> decltype(iterator |
template<typename _Kt > | |
auto | find (const _Kt &__x) const -> decltype(const_iterator |
iterator | lower_bound (const key_type &__x) |
const_iterator | lower_bound (const key_type &__x) const |
template<typename _Kt > | |
auto | lower_bound (const _Kt &__x) -> decltype(iterator(_M_t._M_lower_bound_tr(__x))) |
template<typename _Kt > | |
auto | lower_bound (const _Kt &__x) const -> decltype(iterator(_M_t._M_lower_bound_tr(__x))) |
iterator | upper_bound (const key_type &__x) |
const_iterator | upper_bound (const key_type &__x) const |
template<typename _Kt > | |
auto | upper_bound (const _Kt &__x) -> decltype(iterator(_M_t._M_upper_bound_tr(__x))) |
template<typename _Kt > | |
auto | upper_bound (const _Kt &__x) const -> decltype(iterator(_M_t._M_upper_bound_tr(__x))) |
std::pair< iterator, iterator > | equal_range (const key_type &__x) |
std::pair< const_iterator, const_iterator > | equal_range (const key_type &__x) const |
template<typename _Kt > | |
auto | equal_range (const _Kt &__x) -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x))) |
template<typename _Kt > | |
auto | equal_range (const _Kt &__x) const -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x))) |
Friends | |
template<typename _K1 , typename _C1 , typename _A1 > | |
bool | operator< (const multiset< _K1, _C1, _A1 > &, const multiset< _K1, _C1, _A1 > &) |
template<typename _K1 , typename _C1 , typename _A1 > | |
bool | operator== (const multiset< _K1, _C1, _A1 > &, const multiset< _K1, _C1, _A1 > &) |
A standard container made up of elements, which can be retrieved in logarithmic time.
_Key | Type of key objects. |
_Compare | Comparison function object type, defaults to less<_Key>. |
_Alloc | Allocator type, defaults to allocator<_Key>. |
Meets the requirements of a container, a reversible container, and an associative container (using equivalent keys). For a multiset<Key>
the key_type and value_type are Key.
Multisets support bidirectional iterators.
The private tree data is declared exactly the same way for set and multiset; the distinction is made entirely in how the tree functions are called (*_unique versus *_equal, same as the standard).
Definition at line 95 of file stl_multiset.h.
|
default |
Default constructor creates no elements.
Referenced by std::multiset< _Key, _Compare, _Alloc >::multiset().
|
inlineexplicit |
Creates a multiset with no elements.
__comp | Comparator to use. |
__a | An allocator object. |
Definition at line 159 of file stl_multiset.h.
|
inline |
Builds a multiset from a range.
__first | An input iterator. |
__last | An input iterator. |
Create a multiset consisting of copies of the elements from [first,last). This is linear in N if the range is already sorted, and NlogN otherwise (where N is distance(__first,__last)).
Definition at line 173 of file stl_multiset.h.
|
inline |
Builds a multiset from a range.
__first | An input iterator. |
__last | An input iterator. |
__comp | A comparison functor. |
__a | An allocator object. |
Create a multiset consisting of copies of the elements from [__first,__last). This is linear in N if the range is already sorted, and NlogN otherwise (where N is distance(__first,__last)).
Definition at line 189 of file stl_multiset.h.
References std::multiset< _Key, _Compare, _Alloc >::multiset().
|
default |
Multiset copy constructor.
Whether the allocator is copied depends on the allocator traits.
|
default |
Multiset move constructor.
The newly-created multiset contains the exact contents of the moved instance. The moved instance is a valid, but unspecified multiset.
|
inline |
Builds a multiset from an initializer_list.
__l | An initializer_list. |
__comp | A comparison functor. |
__a | An allocator object. |
Create a multiset consisting of copies of the elements from the list. This is linear in N if the list is already sorted, and NlogN otherwise (where N is __l.size()).
Definition at line 225 of file stl_multiset.h.
|
inlineexplicit |
Allocator-extended default constructor.
Definition at line 233 of file stl_multiset.h.
|
inline |
Allocator-extended copy constructor.
Definition at line 237 of file stl_multiset.h.
|
inlinenoexcept |
Allocator-extended move constructor.
Definition at line 241 of file stl_multiset.h.
|
inline |
Allocator-extended initialier-list constructor.
Definition at line 247 of file stl_multiset.h.
|
inline |
Allocator-extended range constructor.
Definition at line 253 of file stl_multiset.h.
References std::multiset< _Key, _Compare, _Alloc >::operator=(), and std::multiset< _Key, _Compare, _Alloc >::~multiset().
|
default |
The dtor only erases the elements, and note that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.
Referenced by std::multiset< _Key, _Compare, _Alloc >::multiset().
|
inlinenoexcept |
Returns a read-only (constant) iterator that points to the first element in the multiset. Iteration is done in ascending order according to the keys.
Definition at line 326 of file stl_multiset.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points to the first element in the multiset. Iteration is done in ascending order according to the keys.
Definition at line 363 of file stl_multiset.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points one past the last element in the multiset. Iteration is done in ascending order according to the keys.
Definition at line 372 of file stl_multiset.h.
|
inlinenoexcept |
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 responsibility.
Definition at line 704 of file stl_multiset.h.
|
inline |
Finds the number of elements with given key.
__x | Key of elements to be located. |
Definition at line 716 of file stl_multiset.h.
|
inline |
Finds the number of elements with given key.
__x | Key of elements to be located. |
Definition at line 722 of file stl_multiset.h.
|
inlinenoexcept |
Returns a read-only (constant) reverse iterator that points to the last element in the multiset. Iteration is done in descending order according to the keys.
Definition at line 381 of file stl_multiset.h.
|
inlinenoexcept |
Returns a read-only (constant) reverse iterator that points to the last element in the multiset. Iteration is done in descending order according to the keys.
Definition at line 390 of file stl_multiset.h.
|
inline |
Builds and inserts an element into the multiset.
__args | Arguments used to generate the element instance to be inserted. |
This function inserts an element into the multiset. Contrary to a std::set the multiset does not rely on unique keys and thus multiple copies of the same element can be inserted.
Insertion requires logarithmic time.
Definition at line 443 of file stl_multiset.h.
|
inline |
Builds and inserts an element into the multiset.
__pos | An iterator that serves as a hint as to where the element should be inserted. |
__args | Arguments used to generate the element instance to be inserted. |
This function inserts an element into the multiset. Contrary to a std::set the multiset does not rely on unique keys and thus multiple copies of the same element can 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 https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints for more on hinting.
Insertion requires logarithmic time (if the hint is not taken).
Definition at line 469 of file stl_multiset.h.
|
inlinenoexcept |
Returns true if the set is empty.
Definition at line 396 of file stl_multiset.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points one past the last element in the multiset. Iteration is done in ascending order according to the keys.
Definition at line 335 of file stl_multiset.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
This function is equivalent to
(but is faster than making the calls separately).
This function probably only makes sense for multisets.
Definition at line 846 of file stl_multiset.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
This function is equivalent to
(but is faster than making the calls separately).
This function probably only makes sense for multisets.
Definition at line 850 of file stl_multiset.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
This function is equivalent to
(but is faster than making the calls separately).
This function probably only makes sense for multisets.
Definition at line 856 of file stl_multiset.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
This function is equivalent to
(but is faster than making the calls separately).
This function probably only makes sense for multisets.
Definition at line 862 of file stl_multiset.h.
References std::operator==().
|
inline |
Erases an element from a multiset.
__position | An iterator pointing to the element to be erased. |
This function erases an element, pointed to by the given iterator, from a multiset. Note 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 responsibility.
Definition at line 625 of file stl_multiset.h.
Referenced by std::multiset< _Key, _Compare, _Alloc >::erase().
|
inline |
Erases elements according to the provided key.
__x | Key of element to be erased. |
This function erases all elements located by the given key from a multiset. Note 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 responsibility.
Definition at line 655 of file stl_multiset.h.
|
inline |
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. |
This function erases a sequence of elements from 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 responsibility.
Definition at line 677 of file stl_multiset.h.
References std::multiset< _Key, _Compare, _Alloc >::erase().
|
inline |
Tries to locate an element in a set.
__x | Element to be located. |
This function takes a key and tries to locate the element with which the key matches. If successful the function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-the-end ( end()
) iterator.
Definition at line 742 of file stl_multiset.h.
|
inline |
Tries to locate an element in a set.
__x | Element to be located. |
This function takes a key and tries to locate the element with which the key matches. If successful the function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-the-end ( end()
) iterator.
Definition at line 746 of file stl_multiset.h.
|
inline |
Tries to locate an element in a set.
__x | Element to be located. |
This function takes a key and tries to locate the element with which the key matches. If successful the function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-the-end ( end()
) iterator.
Definition at line 752 of file stl_multiset.h.
|
inline |
Tries to locate an element in a set.
__x | Element to be located. |
This function takes a key and tries to locate the element with which the key matches. If successful the function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-the-end ( end()
) iterator.
Definition at line 758 of file stl_multiset.h.
|
inlinenoexcept |
Returns the memory allocation object.
Definition at line 317 of file stl_multiset.h.
|
inline |
Inserts an element into the multiset.
__x | Element to be inserted. |
This function inserts an element into the multiset. Contrary to a std::set the multiset does not rely on unique keys and thus multiple copies of the same element can be inserted.
Insertion requires logarithmic time.
Definition at line 488 of file stl_multiset.h.
Referenced by std::multiset< _Key, _Compare, _Alloc >::insert().
|
inline |
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. |
This function inserts an element into the multiset. Contrary to a std::set the multiset does not rely on unique keys and thus multiple copies of the same element can 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 https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints for more on hinting.
Insertion requires logarithmic time (if the hint is not taken).
Definition at line 518 of file stl_multiset.h.
References std::multiset< _Key, _Compare, _Alloc >::insert().
|
inline |
A template function that tries 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. |
Complexity similar to that of the range constructor.
Definition at line 537 of file stl_multiset.h.
|
inline |
Attempts to insert a list of elements into the multiset.
__l | A std::initializer_list<value_type> of elements to be inserted. |
Complexity similar to that of the range constructor.
Definition at line 549 of file stl_multiset.h.
References std::multiset< _Key, _Compare, _Alloc >::insert().
|
inline |
Returns the comparison object.
Definition at line 309 of file stl_multiset.h.
|
inline |
Finds the beginning of a subsequence matching given key.
__x | Key to be located. |
This function returns the first element of a subsequence of elements that matches the given key. If unsuccessful it returns an iterator pointing to the first element that has a greater value than given key or end() if no such element exists.
Definition at line 777 of file stl_multiset.h.
|
inline |
Finds the beginning of a subsequence matching given key.
__x | Key to be located. |
This function returns the first element of a subsequence of elements that matches the given key. If unsuccessful it returns an iterator pointing to the first element that has a greater value than given key or end() if no such element exists.
Definition at line 781 of file stl_multiset.h.
|
inline |
Finds the beginning of a subsequence matching given key.
__x | Key to be located. |
This function returns the first element of a subsequence of elements that matches the given key. If unsuccessful it returns an iterator pointing to the first element that has a greater value than given key or end() if no such element exists.
Definition at line 787 of file stl_multiset.h.
|
inline |
Finds the beginning of a subsequence matching given key.
__x | Key to be located. |
This function returns the first element of a subsequence of elements that matches the given key. If unsuccessful it returns an iterator pointing to the first element that has a greater value than given key or end() if no such element exists.
Definition at line 793 of file stl_multiset.h.
|
inlinenoexcept |
Returns the maximum size of the set.
Definition at line 406 of file stl_multiset.h.
|
default |
Multiset assignment operator.
Whether the allocator is copied depends on the allocator traits.
Referenced by std::multiset< _Key, _Compare, _Alloc >::multiset().
|
default |
Move assignment operator.
|
inline |
Multiset list assignment operator.
__l | An initializer_list. |
This function fills a multiset with copies of the elements in the initializer list __l.
Note that the assignment completely changes the multiset and that the resulting multiset's size is the same as the number of elements assigned.
Definition at line 298 of file stl_multiset.h.
|
inlinenoexcept |
Returns a read-only (constant) reverse iterator that points to the last element in the multiset. Iteration is done in descending order according to the keys.
Definition at line 344 of file stl_multiset.h.
|
inlinenoexcept |
Returns a read-only (constant) reverse iterator that points to the last element in the multiset. Iteration is done in descending order according to the keys.
Definition at line 353 of file stl_multiset.h.
|
inlinenoexcept |
Returns the size of the set.
Definition at line 401 of file stl_multiset.h.
|
inlinenoexcept |
Swaps data with another multiset.
__x | A multiset of the same element and allocator types. |
This exchanges the elements between two multisets in constant time. (It is only swapping a pointer, an integer, and an instance of the 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.
Whether the allocators are swapped depends on the allocator traits.
Definition at line 423 of file stl_multiset.h.
|
inline |
Finds the end of a subsequence matching given key.
__x | Key to be located. |
Definition at line 807 of file stl_multiset.h.
|
inline |
Finds the end of a subsequence matching given key.
__x | Key to be located. |
Definition at line 811 of file stl_multiset.h.
|
inline |
Finds the end of a subsequence matching given key.
__x | Key to be located. |
Definition at line 817 of file stl_multiset.h.
|
inline |
Finds the end of a subsequence matching given key.
__x | Key to be located. |
Definition at line 823 of file stl_multiset.h.
|
inline |
Returns the comparison object.
Definition at line 313 of file stl_multiset.h.