Ubuntu Manpages

std::__debug::multiset< _Key, _Compare, _Allocator >

Class std::multiset with safety/checking/debug instrumentation.

Inherits __gnu_debug::_Safe_container< multiset< _Key, std::less< _Key >, std::allocator< _Key > >, std::allocator< _Key >, __gnu_debug::_Safe_node_sequence >, and multiset< _Key, std::less< _Key >, std::allocator< _Key > >.


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
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


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 _Base &__x)
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)
const _Base & _M_base () const noexcept
_Base & _M_base () noexcept
void _M_invalidate_if (_Predicate __pred)
void _M_swap (_Safe_container &__x) noexcept
void _M_transfer_from_if (_Safe_sequence &__from, _Predicate __pred)
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)
iterator erase (const_iterator __first, const_iterator __last)
iterator erase (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 __position, const value_type &__x)
iterator insert (const_iterator __position, value_type &&__x)
void insert (initializer_list< value_type > __l)
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


void _M_invalidate_all ()
_Safe_container & _M_safe () noexcept

class std::__debug::multiset< _Key, _Compare, _Allocator >" Class std::multiset with safety/checking/debug instrumentation.

Definition at line 44 of file debug/multiset.h.

void __gnu_debug::_Safe_sequence< multiset< _Key, std::less< _Key >, std::allocator< _Key > > >::_M_invalidate_if (_Predicate __pred) [inherited]

Invalidates all iterators x that reference this sequence, are not singular, and for which __pred(x) returns true. __pred will be invoked with the normal iterators nested in the safe ones.

Definition at line 38 of file safe_sequence.tcc.

void __gnu_debug::_Safe_sequence< multiset< _Key, std::less< _Key >, std::allocator< _Key > > >::_M_transfer_from_if (_Safe_sequence< multiset< _Key, std::less< _Key >, std::allocator< _Key > > > & __from, _Predicate __pred) [inherited]

Transfers all iterators x that reference from sequence, are not singular, and for which __pred(x) returns true. __pred will be invoked with the normal iterators nested in the safe ones.

Definition at line 69 of file safe_sequence.tcc.

Generated automatically by Doxygen for libstdc++ from the source code.