libstdc++
std::__debug::set< _Key, _Compare, _Allocator > Class Template Reference

#include <set.h>

Inheritance diagram for std::__debug::set< _Key, _Compare, _Allocator >:
[legend]

Public Types

typedef _Allocator allocator_type
 
typedef __gnu_debug::_Safe_iterator< _Base_const_iterator, setconst_iterator
 
typedef _Base::const_pointer const_pointer
 
typedef _Base::const_reference const_reference
 
typedef std::reverse_iterator< const_iteratorconst_reverse_iterator
 
typedef _Base::difference_type difference_type
 
typedef __gnu_debug::_Safe_iterator< _Base_iterator, setiterator
 
typedef _Compare key_compare
 
typedef _Key key_type
 
typedef _Base::pointer pointer
 
typedef _Base::reference reference
 
typedef std::reverse_iterator< iteratorreverse_iterator
 
typedef _Base::size_type size_type
 
typedef _Compare value_compare
 
typedef _Key value_type
 

Public Member Functions

template<typename _InputIterator >
 set (_InputIterator __first, _InputIterator __last, const _Compare &__comp=_Compare(), const _Allocator &__a=_Allocator())
 
template<typename _InputIterator >
 set (_InputIterator __first, _InputIterator __last, const allocator_type &__a)
 
 set (const _Base &__x)
 
 set (const _Compare &__comp, const _Allocator &__a=_Allocator())
 
 set (const allocator_type &__a)
 
 set (const set &)=default
 
 set (const set &__x, const allocator_type &__a)
 
 set (initializer_list< value_type > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type())
 
 set (initializer_list< value_type > __l, const allocator_type &__a)
 
 set (set &&)=default
 
 set (set &&__x, const allocator_type &__a) noexcept(noexcept(_Base(std::move(__x._M_base()), __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>
std::pair< iterator, bool > 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, iteratorequal_range (const _Kt &__x)
 
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
std::pair< const_iterator, const_iteratorequal_range (const _Kt &__x) const
 
std::pair< iterator, iteratorequal_range (const key_type &__x)
 
std::pair< const_iterator, const_iteratorequal_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)
 
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)
 
std::pair< iterator, bool > 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)
 
std::pair< iterator, bool > 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
 
setoperator= (const set &)=default
 
setoperator= (initializer_list< value_type > __l)
 
setoperator= (set &&)=default
 
const_reverse_iterator rbegin () const noexcept
 
reverse_iterator rbegin () noexcept
 
const_reverse_iterator rend () const noexcept
 
reverse_iterator rend () noexcept
 
void swap (set &__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
 

Public Attributes

_Safe_iterator_base * _M_const_iterators
 
_Safe_iterator_base * _M_iterators
 
unsigned int _M_version
 

Protected Member Functions

void _M_detach_all ()
 
void _M_detach_singular ()
 
__gnu_cxx::__mutex & _M_get_mutex () throw ()
 
void _M_invalidate_all ()
 
void _M_invalidate_all () const
 
void _M_revalidate_singular ()
 
_Safe_container & _M_safe () noexcept
 
void _M_swap (_Safe_sequence_base &__x) 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::set< _Key, _Compare, _Allocator >

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

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

Member Typedef Documentation

◆ allocator_type

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
typedef _Allocator std::__debug::set< _Key, _Compare, _Allocator >::allocator_type

Definition at line 67 of file debug/set.h.

◆ const_iterator

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
typedef __gnu_debug::_Safe_iterator<_Base_const_iterator, set> std::__debug::set< _Key, _Compare, _Allocator >::const_iterator

Definition at line 74 of file debug/set.h.

◆ const_pointer

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
typedef _Base::const_pointer std::__debug::set< _Key, _Compare, _Allocator >::const_pointer

Definition at line 79 of file debug/set.h.

◆ const_reference

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
typedef _Base::const_reference std::__debug::set< _Key, _Compare, _Allocator >::const_reference

Definition at line 69 of file debug/set.h.

◆ const_reverse_iterator

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
typedef std::reverse_iterator<const_iterator> std::__debug::set< _Key, _Compare, _Allocator >::const_reverse_iterator

Definition at line 81 of file debug/set.h.

◆ difference_type

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
typedef _Base::difference_type std::__debug::set< _Key, _Compare, _Allocator >::difference_type

Definition at line 77 of file debug/set.h.

◆ iterator

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
typedef __gnu_debug::_Safe_iterator<_Base_iterator, set> std::__debug::set< _Key, _Compare, _Allocator >::iterator

Definition at line 72 of file debug/set.h.

◆ key_compare

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
typedef _Compare std::__debug::set< _Key, _Compare, _Allocator >::key_compare

Definition at line 65 of file debug/set.h.

◆ key_type

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
typedef _Key std::__debug::set< _Key, _Compare, _Allocator >::key_type

Definition at line 63 of file debug/set.h.

◆ pointer

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
typedef _Base::pointer std::__debug::set< _Key, _Compare, _Allocator >::pointer

Definition at line 78 of file debug/set.h.

◆ reference

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
typedef _Base::reference std::__debug::set< _Key, _Compare, _Allocator >::reference

Definition at line 68 of file debug/set.h.

◆ reverse_iterator

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
typedef std::reverse_iterator<iterator> std::__debug::set< _Key, _Compare, _Allocator >::reverse_iterator

Definition at line 80 of file debug/set.h.

◆ size_type

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
typedef _Base::size_type std::__debug::set< _Key, _Compare, _Allocator >::size_type

Definition at line 76 of file debug/set.h.

◆ value_compare

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
typedef _Compare std::__debug::set< _Key, _Compare, _Allocator >::value_compare

Definition at line 66 of file debug/set.h.

◆ value_type

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
typedef _Key std::__debug::set< _Key, _Compare, _Allocator >::value_type

Definition at line 64 of file debug/set.h.

Constructor & Destructor Documentation

◆ set() [1/9]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
std::__debug::set< _Key, _Compare, _Allocator >::set ( initializer_list< value_type >  __l,
const _Compare &  __comp = _Compare(),
const allocator_type &  __a = allocator_type() 
)
inline

Definition at line 97 of file debug/set.h.

◆ set() [2/9]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
std::__debug::set< _Key, _Compare, _Allocator >::set ( const allocator_type &  __a)
inlineexplicit

Definition at line 103 of file debug/set.h.

◆ set() [3/9]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
std::__debug::set< _Key, _Compare, _Allocator >::set ( const set< _Key, _Compare, _Allocator > &  __x,
const allocator_type &  __a 
)
inline

Definition at line 106 of file debug/set.h.

◆ set() [4/9]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
std::__debug::set< _Key, _Compare, _Allocator >::set ( set< _Key, _Compare, _Allocator > &&  __x,
const allocator_type &  __a 
)
inlinenoexcept

Definition at line 109 of file debug/set.h.

◆ set() [5/9]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
std::__debug::set< _Key, _Compare, _Allocator >::set ( initializer_list< value_type >  __l,
const allocator_type &  __a 
)
inline

Definition at line 114 of file debug/set.h.

◆ set() [6/9]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
template<typename _InputIterator >
std::__debug::set< _Key, _Compare, _Allocator >::set ( _InputIterator  __first,
_InputIterator  __last,
const allocator_type &  __a 
)
inline

Definition at line 118 of file debug/set.h.

◆ set() [7/9]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
std::__debug::set< _Key, _Compare, _Allocator >::set ( const _Compare &  __comp,
const _Allocator &  __a = _Allocator() 
)
inlineexplicit

Definition at line 127 of file debug/set.h.

◆ set() [8/9]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
template<typename _InputIterator >
std::__debug::set< _Key, _Compare, _Allocator >::set ( _InputIterator  __first,
_InputIterator  __last,
const _Compare &  __comp = _Compare(),
const _Allocator &  __a = _Allocator() 
)
inline

Definition at line 132 of file debug/set.h.

◆ set() [9/9]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
std::__debug::set< _Key, _Compare, _Allocator >::set ( const _Base __x)
inline

Definition at line 140 of file debug/set.h.

Member Function Documentation

◆ _M_base() [1/2]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
const _Base & std::__debug::set< _Key, _Compare, _Allocator >::_M_base ( ) const
inlinenoexcept

Definition at line 559 of file debug/set.h.

◆ _M_base() [2/2]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
_Base & std::__debug::set< _Key, _Compare, _Allocator >::_M_base ( )
inlinenoexcept

Definition at line 556 of file debug/set.h.

◆ _M_detach_all()

void __gnu_debug::_Safe_sequence_base::_M_detach_all ( )
protectedinherited

Detach all iterators, leaving them singular.

Referenced by __gnu_debug::_Safe_sequence_base::~_Safe_sequence_base().

◆ _M_detach_singular()

void __gnu_debug::_Safe_sequence_base::_M_detach_singular ( )
protectedinherited

Detach all singular iterators.

Postcondition
for all iterators i attached to this sequence, i->_M_version == _M_version.

◆ _M_get_mutex()

__gnu_cxx::__mutex & __gnu_debug::_Safe_sequence_base::_M_get_mutex ( )
throw (
)
protectedinherited

For use in _Safe_sequence.

Referenced by __gnu_debug::_Safe_sequence< _Sequence >::_M_transfer_from_if().

◆ _M_invalidate_all() [1/2]

void __gnu_debug::_Safe_node_sequence< set< _Key, std::less< _Key >, std::allocator< _Key > > >::_M_invalidate_all ( )
inlineprotectedinherited

Definition at line 136 of file safe_sequence.h.

◆ _M_invalidate_all() [2/2]

void __gnu_debug::_Safe_sequence_base::_M_invalidate_all ( ) const
inlineprotectedinherited

Invalidates all iterators.

Definition at line 256 of file safe_base.h.

References __gnu_debug::_Safe_sequence_base::_M_version.

◆ _M_invalidate_if()

void __gnu_debug::_Safe_sequence< set< _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 117 of file safe_sequence.tcc.

◆ _M_revalidate_singular()

void __gnu_debug::_Safe_sequence_base::_M_revalidate_singular ( )
protectedinherited

Revalidates all attached singular iterators. This method may be used to validate iterators that were invalidated before (but for some reason, such as an exception, need to become valid again).

◆ _M_safe()

_Safe_container & __gnu_debug::_Safe_container< set< _Key, std::less< _Key >, std::allocator< _Key > > , std::allocator< _Key > , __gnu_debug::_Safe_node_sequence , true >::_M_safe ( )
inlineprotectednoexceptinherited

Definition at line 52 of file safe_container.h.

◆ _M_swap() [1/2]

void __gnu_debug::_Safe_container< set< _Key, std::less< _Key >, std::allocator< _Key > > , std::allocator< _Key > , __gnu_debug::_Safe_node_sequence , true >::_M_swap ( _Safe_container< set< _Key, std::less< _Key >, std::allocator< _Key > >, std::allocator< _Key >, __gnu_debug::_Safe_node_sequence > &  __x)
inlinenoexceptinherited

Definition at line 104 of file safe_container.h.

◆ _M_swap() [2/2]

void __gnu_debug::_Safe_sequence_base::_M_swap ( _Safe_sequence_base __x)
protectednoexceptinherited

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.

◆ _M_transfer_from_if()

void __gnu_debug::_Safe_sequence< set< _Key, std::less< _Key >, std::allocator< _Key > > >::_M_transfer_from_if ( _Safe_sequence< set< _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 125 of file safe_sequence.tcc.

◆ begin() [1/2]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
const_iterator std::__debug::set< _Key, _Compare, _Allocator >::begin ( ) const
inlinenoexcept

Definition at line 175 of file debug/set.h.

◆ begin() [2/2]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
iterator std::__debug::set< _Key, _Compare, _Allocator >::begin ( )
inlinenoexcept

Definition at line 171 of file debug/set.h.

◆ cbegin()

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
const_iterator std::__debug::set< _Key, _Compare, _Allocator >::cbegin ( ) const
inlinenoexcept

Definition at line 204 of file debug/set.h.

◆ cend()

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
const_iterator std::__debug::set< _Key, _Compare, _Allocator >::cend ( ) const
inlinenoexcept

Definition at line 208 of file debug/set.h.

◆ clear()

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
void std::__debug::set< _Key, _Compare, _Allocator >::clear ( )
inlinenoexcept

Definition at line 422 of file debug/set.h.

◆ crbegin()

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
const_reverse_iterator std::__debug::set< _Key, _Compare, _Allocator >::crbegin ( ) const
inlinenoexcept

Definition at line 212 of file debug/set.h.

◆ crend()

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
const_reverse_iterator std::__debug::set< _Key, _Compare, _Allocator >::crend ( ) const
inlinenoexcept

Definition at line 216 of file debug/set.h.

◆ emplace()

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
template<typename... _Args>
std::pair< iterator, bool > std::__debug::set< _Key, _Compare, _Allocator >::emplace ( _Args &&...  __args)
inline

Definition at line 229 of file debug/set.h.

◆ emplace_hint()

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
template<typename... _Args>
iterator std::__debug::set< _Key, _Compare, _Allocator >::emplace_hint ( const_iterator  __pos,
_Args &&...  __args 
)
inline

Definition at line 237 of file debug/set.h.

◆ end() [1/2]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
const_iterator std::__debug::set< _Key, _Compare, _Allocator >::end ( ) const
inlinenoexcept

Definition at line 183 of file debug/set.h.

◆ end() [2/2]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
iterator std::__debug::set< _Key, _Compare, _Allocator >::end ( )
inlinenoexcept

Definition at line 179 of file debug/set.h.

◆ equal_range() [1/4]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
std::pair< iterator, iterator > std::__debug::set< _Key, _Compare, _Allocator >::equal_range ( const _Kt &  __x)
inline

Definition at line 538 of file debug/set.h.

◆ equal_range() [2/4]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
std::pair< const_iterator, const_iterator > std::__debug::set< _Key, _Compare, _Allocator >::equal_range ( const _Kt &  __x) const
inline

Definition at line 548 of file debug/set.h.

◆ equal_range() [3/4]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
std::pair< iterator, iterator > std::__debug::set< _Key, _Compare, _Allocator >::equal_range ( const key_type &  __x)
inline

Definition at line 514 of file debug/set.h.

◆ equal_range() [4/4]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
std::pair< const_iterator, const_iterator > std::__debug::set< _Key, _Compare, _Allocator >::equal_range ( const key_type &  __x) const
inline

Definition at line 525 of file debug/set.h.

◆ erase() [1/3]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
size_type std::__debug::set< _Key, _Compare, _Allocator >::erase ( const key_type &  __x)
inline

Definition at line 360 of file debug/set.h.

◆ erase() [2/3]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
_GLIBCXX_ABI_TAG_CXX11 iterator std::__debug::set< _Key, _Compare, _Allocator >::erase ( const_iterator  __first,
const_iterator  __last 
)
inline

Definition at line 376 of file debug/set.h.

◆ erase() [3/3]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
_GLIBCXX_ABI_TAG_CXX11 iterator std::__debug::set< _Key, _Compare, _Allocator >::erase ( const_iterator  __position)
inline

Definition at line 343 of file debug/set.h.

◆ find() [1/4]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
iterator std::__debug::set< _Key, _Compare, _Allocator >::find ( const _Kt &  __x)
inline

Definition at line 448 of file debug/set.h.

◆ find() [2/4]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
const_iterator std::__debug::set< _Key, _Compare, _Allocator >::find ( const _Kt &  __x) const
inline

Definition at line 455 of file debug/set.h.

◆ find() [3/4]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
iterator std::__debug::set< _Key, _Compare, _Allocator >::find ( const key_type &  __x)
inline

Definition at line 434 of file debug/set.h.

◆ find() [4/4]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
const_iterator std::__debug::set< _Key, _Compare, _Allocator >::find ( const key_type &  __x) const
inline

Definition at line 440 of file debug/set.h.

◆ insert() [1/6]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
template<typename _InputIterator >
void std::__debug::set< _Key, _Compare, _Allocator >::insert ( _InputIterator  __first,
_InputIterator  __last 
)
inline

Definition at line 283 of file debug/set.h.

◆ insert() [2/6]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
std::pair< iterator, bool > std::__debug::set< _Key, _Compare, _Allocator >::insert ( const value_type &  __x)
inline

Definition at line 249 of file debug/set.h.

◆ insert() [3/6]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
iterator std::__debug::set< _Key, _Compare, _Allocator >::insert ( const_iterator  __position,
const value_type &  __x 
)
inline

Definition at line 266 of file debug/set.h.

◆ insert() [4/6]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
iterator std::__debug::set< _Key, _Compare, _Allocator >::insert ( const_iterator  __position,
value_type &&  __x 
)
inline

Definition at line 274 of file debug/set.h.

◆ insert() [5/6]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
void std::__debug::set< _Key, _Compare, _Allocator >::insert ( initializer_list< value_type >  __l)
inline

Definition at line 297 of file debug/set.h.

◆ insert() [6/6]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
std::pair< iterator, bool > std::__debug::set< _Key, _Compare, _Allocator >::insert ( value_type &&  __x)
inline

Definition at line 258 of file debug/set.h.

◆ lower_bound() [1/4]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
iterator std::__debug::set< _Key, _Compare, _Allocator >::lower_bound ( const _Kt &  __x)
inline

Definition at line 476 of file debug/set.h.

◆ lower_bound() [2/4]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
const_iterator std::__debug::set< _Key, _Compare, _Allocator >::lower_bound ( const _Kt &  __x) const
inline

Definition at line 483 of file debug/set.h.

◆ lower_bound() [3/4]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
iterator std::__debug::set< _Key, _Compare, _Allocator >::lower_bound ( const key_type &  __x)
inline

Definition at line 462 of file debug/set.h.

◆ lower_bound() [4/4]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
const_iterator std::__debug::set< _Key, _Compare, _Allocator >::lower_bound ( const key_type &  __x) const
inline

Definition at line 468 of file debug/set.h.

◆ operator=()

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
set & std::__debug::set< _Key, _Compare, _Allocator >::operator= ( initializer_list< value_type >  __l)
inline

Definition at line 159 of file debug/set.h.

◆ rbegin() [1/2]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
const_reverse_iterator std::__debug::set< _Key, _Compare, _Allocator >::rbegin ( ) const
inlinenoexcept

Definition at line 191 of file debug/set.h.

◆ rbegin() [2/2]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
reverse_iterator std::__debug::set< _Key, _Compare, _Allocator >::rbegin ( )
inlinenoexcept

Definition at line 187 of file debug/set.h.

◆ rend() [1/2]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
const_reverse_iterator std::__debug::set< _Key, _Compare, _Allocator >::rend ( ) const
inlinenoexcept

Definition at line 199 of file debug/set.h.

◆ rend() [2/2]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
reverse_iterator std::__debug::set< _Key, _Compare, _Allocator >::rend ( )
inlinenoexcept

Definition at line 195 of file debug/set.h.

◆ swap()

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
void std::__debug::set< _Key, _Compare, _Allocator >::swap ( set< _Key, _Compare, _Allocator > &  __x)
inlinenoexcept

Definition at line 414 of file debug/set.h.

◆ upper_bound() [1/4]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
iterator std::__debug::set< _Key, _Compare, _Allocator >::upper_bound ( const _Kt &  __x)
inline

Definition at line 502 of file debug/set.h.

◆ upper_bound() [2/4]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
const_iterator std::__debug::set< _Key, _Compare, _Allocator >::upper_bound ( const _Kt &  __x) const
inline

Definition at line 509 of file debug/set.h.

◆ upper_bound() [3/4]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
iterator std::__debug::set< _Key, _Compare, _Allocator >::upper_bound ( const key_type &  __x)
inline

Definition at line 488 of file debug/set.h.

◆ upper_bound() [4/4]

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
const_iterator std::__debug::set< _Key, _Compare, _Allocator >::upper_bound ( const key_type &  __x) const
inline

Definition at line 494 of file debug/set.h.

Friends And Related Function Documentation

◆ ::__gnu_debug::_Safe_iterator

template<typename _Key , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
template<typename _ItT , typename _SeqT , typename _CatT >
friend class ::__gnu_debug::_Safe_iterator
friend

Definition at line 59 of file debug/set.h.

Member Data Documentation

◆ _M_const_iterators

_Safe_iterator_base* __gnu_debug::_Safe_sequence_base::_M_const_iterators
inherited

The list of constant iterators that reference this container.

Definition at line 197 of file safe_base.h.

Referenced by __gnu_debug::_Safe_sequence< _Sequence >::_M_transfer_from_if().

◆ _M_iterators

_Safe_iterator_base* __gnu_debug::_Safe_sequence_base::_M_iterators
inherited

The list of mutable iterators that reference this container.

Definition at line 194 of file safe_base.h.

Referenced by __gnu_debug::_Safe_sequence< _Sequence >::_M_transfer_from_if().

◆ _M_version

unsigned int __gnu_debug::_Safe_sequence_base::_M_version
mutableinherited

The container version number. This number may never be 0.

Definition at line 200 of file safe_base.h.

Referenced by __gnu_debug::_Safe_sequence_base::_M_invalidate_all().


The documentation for this class was generated from the following file: