| std::__debug::multiset< _Key, _Compare, _Allocator >(3cxx) | std::__debug::multiset< _Key, _Compare, _Allocator >(3cxx) |
NAME¶
std::__debug::multiset< _Key, _Compare, _Allocator > - Class std::multiset with safety/checking/debug instrumentation.
SYNOPSIS¶
#include <multiset.h>
Inherits __gnu_debug::_Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware >, and multiset< _Key, std::less< _Key >, std::allocator< _Key > >.
Public Types¶
typedef _Allocator allocator_type
typedef __gnu_debug::_Safe_iterator<
_Base_const_iterator, multiset > const_iterator
typedef _Base::const_pointer const_pointer
typedef _Base::const_reference const_reference
typedef std::reverse_iterator< const_iterator >
const_reverse_iterator
typedef _Base::difference_type difference_type
typedef __gnu_debug::_Safe_iterator< _Base_iterator,
multiset > iterator
typedef _Compare key_compare
typedef _Key key_type
using node_type = typename _Base::node_type
typedef _Base::pointer pointer
typedef _Base::reference reference
typedef std::reverse_iterator< iterator >
reverse_iterator
typedef _Base::size_type size_type
typedef _Compare value_compare
typedef _Key value_type
Public Member Functions¶
multiset (_Base_ref __x)
template<typename _InputIterator > multiset
(_InputIterator __first, _InputIterator __last, const
_Compare &__comp=_Compare(), const _Allocator
&__a=_Allocator())
template<typename _InputIterator > multiset
(_InputIterator __first, _InputIterator __last, const
allocator_type &__a)
multiset (const _Compare &__comp, const
_Allocator &__a=_Allocator())
multiset (const allocator_type &__a)
multiset (const multiset &)=default
multiset (const multiset &__m, const
allocator_type &__a)
multiset (initializer_list< value_type > __l,
const _Compare &__comp=_Compare(), const
allocator_type &__a=allocator_type())
multiset (initializer_list< value_type > __l,
const allocator_type &__a)
multiset (multiset &&)=default
multiset (multiset &&__m, const
allocator_type &__a)
noexcept(noexcept(_Base(std::move(__m._M_base()),
__a)))
const _Base & _M_base () const noexcept
_Base & _M_base () noexcept
void _M_swap (_Safe_container &__x) noexcept
const_iterator begin () const noexcept
iterator begin () noexcept
const_iterator cbegin () const noexcept
const_iterator cend () const noexcept
void clear () noexcept
const_reverse_iterator crbegin () const noexcept
const_reverse_iterator crend () const noexcept
template<typename... _Args> iterator emplace (_Args
&&... __args)
template<typename... _Args> iterator emplace_hint
(const_iterator __pos, _Args &&...
__args)
const_iterator end () const noexcept
iterator end () noexcept
template<typename _Kt , typename _Req =
typename __has_is_transparent<_Compare, _Kt>::type>
std::pair< iterator, iterator >
equal_range (const _Kt &__x)
template<typename _Kt , typename _Req =
typename __has_is_transparent<_Compare, _Kt>::type>
std::pair< const_iterator, const_iterator >
equal_range (const _Kt &__x) const
std::pair< iterator, iterator > equal_range
(const key_type &__x)
std::pair< const_iterator, const_iterator >
equal_range (const key_type &__x) const
size_type erase (const key_type &__x)
_GLIBCXX_ABI_TAG_CXX11 iterator erase (const_iterator
__first, const_iterator __last)
_GLIBCXX_ABI_TAG_CXX11 iterator erase (const_iterator
__position)
node_type extract (const key_type &__key)
node_type extract (const_iterator __position)
template<typename _Kt , typename _Req =
typename __has_is_transparent<_Compare, _Kt>::type> iterator
find (const _Kt &__x)
template<typename _Kt , typename _Req =
typename __has_is_transparent<_Compare, _Kt>::type>
const_iterator find (const _Kt &__x)
const
iterator find (const key_type &__x)
const_iterator find (const key_type &__x)
const
template<typename _InputIterator > void
insert (_InputIterator __first, _InputIterator __last)
iterator insert (const value_type &__x)
iterator insert (const_iterator __hint, node_type
&&__nh)
iterator insert (const_iterator __position,
const value_type &__x)
iterator insert (const_iterator __position,
value_type &&__x)
void insert (initializer_list< value_type >
__l)
iterator insert (node_type &&__nh)
iterator insert (value_type &&__x)
template<typename _Kt , typename _Req =
typename __has_is_transparent<_Compare, _Kt>::type> iterator
lower_bound (const _Kt &__x)
template<typename _Kt , typename _Req =
typename __has_is_transparent<_Compare, _Kt>::type>
const_iterator lower_bound (const _Kt &__x)
const
iterator lower_bound (const key_type &__x)
const_iterator lower_bound (const key_type
&__x) const
multiset & operator= (const multiset
&)=default
multiset & operator= (initializer_list< value_type
> __l)
multiset & operator= (multiset
&&)=default
const_reverse_iterator rbegin () const noexcept
reverse_iterator rbegin () noexcept
const_reverse_iterator rend () const noexcept
reverse_iterator rend () noexcept
void swap (multiset &__x)
noexcept(/*conditional */)
template<typename _Kt , typename _Req =
typename __has_is_transparent<_Compare, _Kt>::type> iterator
upper_bound (const _Kt &__x)
template<typename _Kt , typename _Req =
typename __has_is_transparent<_Compare, _Kt>::type>
const_iterator upper_bound (const _Kt &__x)
const
iterator upper_bound (const key_type &__x)
const_iterator upper_bound (const key_type
&__x) const
Protected Member Functions¶
_Safe_container & _M_safe () noexcept
Friends¶
template<typename _ItT , typename
_SeqT , typename _CatT > class
::__gnu_debug::_Safe_iterator
Detailed Description¶
template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>¶
class std::__debug::multiset< _Key, _Compare, _Allocator >"Class std::multiset with safety/checking/debug instrumentation.
Author¶
Generated automatically by Doxygen for libstdc++ from the source code.
| libstdc++ |