ReactOS  0.4.14-dev-614-gbfd8a84
set< _Key,, > Class Template Reference

#include <_set.h>

Collaboration diagram for set< _Key,, >:

Public Types

typedef _Key key_type
 
typedef _Key value_type
 
typedef _Compare key_compare
 
typedef _Compare value_compare
 
typedef _STLP_PRIV _Rb_tree< key_type, key_compare, value_type, _STLP_PRIV _Identity< value_type >, _SetTraits, _Alloc_Rep_type
 
typedef _Rep_type::pointer pointer
 
typedef _Rep_type::const_pointer const_pointer
 
typedef _Rep_type::reference reference
 
typedef _Rep_type::const_reference const_reference
 
typedef _Rep_type::iterator iterator
 
typedef _Rep_type::const_iterator const_iterator
 
typedef _Rep_type::reverse_iterator reverse_iterator
 
typedef _Rep_type::const_reverse_iterator const_reverse_iterator
 
typedef _Rep_type::size_type size_type
 
typedef _Rep_type::difference_type difference_type
 
typedef _Rep_type::allocator_type allocator_type
 
typedef _Key key_type
 
typedef _Key value_type
 
typedef _Compare key_compare
 
typedef _Compare value_compare
 
typedef _STLP_PRIV _Rb_tree< _KeyStorageType, _CompareStorageType, _KeyStorageType, _STLP_PRIV _Identity< _KeyStorageType >, _SetStorageTraits, _StorageTypeAlloc_Rep_type
 
typedef _Priv_Rep_type::pointer pointer
 
typedef _Priv_Rep_type::const_pointer const_pointer
 
typedef _Priv_Rep_type::reference reference
 
typedef _Priv_Rep_type::const_reference const_reference
 
typedef _Priv_Rep_type::iterator iterator
 
typedef _Priv_Rep_type::const_iterator const_iterator
 
typedef _Priv_Rep_type::reverse_iterator reverse_iterator
 
typedef _Priv_Rep_type::const_reverse_iterator const_reverse_iterator
 
typedef _Priv_Rep_type::size_type size_type
 
typedef _Priv_Rep_type::difference_type difference_type
 
typedef _Priv_Rep_type::allocator_type allocator_type
 

Public Member Functions

 set (const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type())
 
 set (const value_type *__first, const value_type *__last)
 
 set (const value_type *__first, const value_type *__last, const _Compare &__comp, const allocator_type &__a=allocator_type())
 
 set (const_iterator __first, const_iterator __last)
 
 set (const_iterator __first, const_iterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type())
 
 set (const _Self &__x)
 
 set (__move_source< _Self > src)
 
_Selfoperator= (const _Self &__x)
 
key_compare key_comp () const
 
value_compare value_comp () const
 
allocator_type get_allocator () const
 
iterator begin ()
 
iterator end ()
 
const_iterator begin () const
 
const_iterator end () const
 
reverse_iterator rbegin ()
 
reverse_iterator rend ()
 
const_reverse_iterator rbegin () const
 
const_reverse_iterator rend () const
 
bool empty () const
 
size_type size () const
 
size_type max_size () const
 
void swap (_Self &__x)
 
pair< iterator, boolinsert (const value_type &__x)
 
iterator insert (iterator __pos, const value_type &__x)
 
void insert (const_iterator __first, const_iterator __last)
 
void insert (const value_type *__first, const value_type *__last)
 
void erase (iterator __pos)
 
size_type erase (const key_type &__x)
 
void erase (iterator __first, iterator __last)
 
void clear ()
 
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator find (const _KT &__x) const
 
_STLP_TEMPLATE_FOR_CONT_EXT iterator find (const _KT &__x)
 
_STLP_TEMPLATE_FOR_CONT_EXT size_type count (const _KT &__x) const
 
_STLP_TEMPLATE_FOR_CONT_EXT iterator lower_bound (const _KT &__x)
 
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator lower_bound (const _KT &__x) const
 
_STLP_TEMPLATE_FOR_CONT_EXT iterator upper_bound (const _KT &__x)
 
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator upper_bound (const _KT &__x) const
 
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iteratorequal_range (const _KT &__x)
 
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iteratorequal_range (const _KT &__x) const
 
 set ()
 
 set (const _Compare &__comp, const allocator_type &__a=allocator_type())
 
 set (const value_type *__first, const value_type *__last)
 
 set (const value_type *__first, const value_type *__last, const _Compare &__comp, const allocator_type &__a=allocator_type())
 
 set (const_iterator __first, const_iterator __last)
 
 set (const_iterator __first, const_iterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type())
 
 set (const _Self &__x)
 
 set (__move_source< _Self > src)
 
_Selfoperator= (const _Self &__x)
 
key_compare key_comp () const
 
value_compare value_comp () const
 
allocator_type get_allocator () const
 
iterator begin ()
 
iterator end ()
 
const_iterator begin () const
 
const_iterator end () const
 
reverse_iterator rbegin ()
 
reverse_iterator rend ()
 
const_reverse_iterator rbegin () const
 
const_reverse_iterator rend () const
 
bool empty () const
 
size_type size () const
 
size_type max_size () const
 
void swap (_Self &__x)
 
pair< iterator, boolinsert (const value_type &__x)
 
iterator insert (iterator __pos, const value_type &__x)
 
void insert (const_iterator __first, const_iterator __last)
 
void insert (const value_type *__first, const value_type *__last)
 
void erase (iterator __pos)
 
size_type erase (const key_type &__x)
 
void erase (iterator __first, iterator __last)
 
void clear ()
 
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator find (const _KT &__x) const
 
_STLP_TEMPLATE_FOR_CONT_EXT iterator find (const _KT &__x)
 
_STLP_TEMPLATE_FOR_CONT_EXT size_type count (const _KT &__x) const
 
_STLP_TEMPLATE_FOR_CONT_EXT iterator lower_bound (const _KT &__x)
 
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator lower_bound (const _KT &__x) const
 
_STLP_TEMPLATE_FOR_CONT_EXT iterator upper_bound (const _KT &__x)
 
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator upper_bound (const _KT &__x) const
 
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iteratorequal_range (const _KT &__x)
 
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iteratorequal_range (const _KT &__x) const
 

Protected Types

typedef _STLP_PRIV _SetTraitsT< value_type_SetTraits
 
typedef _STLP_PRIV _Rb_tree< key_type, key_compare, value_type, _STLP_PRIV _Identity< value_type >, _SetTraits, _Alloc_Priv_Rep_type
 
typedef _STLP_PRIV _SetTraitsT< _KeyStorageType_SetStorageTraits
 

Private Types

typedef set< _Key, _Compare, _Alloc_Self
 
typedef _STLP_PRIV _SetTraitsT< value_type_SetTraits
 
typedef _STLP_PRIV _AssocStorageTypes< _Key, _Compare > _AssocStorageTypes
 
typedef _AssocStorageTypes::_KeyStorageType _KeyStorageType
 
typedef _AssocStorageTypes::_CompareStorageType _CompareStorageType
 
typedef _Alloc_traits< _KeyStorageType, _Alloc >::allocator_type _StorageTypeAlloc
 
typedef _STLP_PRIV _CastTraits< _KeyStorageType, _Key > cast_traits
 
typedef set< _Key, _Compare, _Alloc_Self
 
typedef _Rep_type::iterator base_iterator
 
typedef _Rep_type::const_iterator const_base_iterator
 

Static Private Member Functions

static iterator _S_to_value_ite (const_base_iterator __ite)
 
static base_iterator _S_to_storage_ite (const_iterator __ite)
 

Private Attributes

_Rep_type _M_t
 

Detailed Description

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >), _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >)>
class set< _Key,, >

Definition at line 46 of file _set.h.

Member Typedef Documentation

◆ _AssocStorageTypes

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _STLP_PRIV _AssocStorageTypes<_Key, _Compare> set< _Key,, >::_AssocStorageTypes
private

Definition at line 63 of file _set.h.

◆ _CompareStorageType

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _AssocStorageTypes::_CompareStorageType set< _Key,, >::_CompareStorageType
private

Definition at line 65 of file _set.h.

◆ _KeyStorageType

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _AssocStorageTypes::_KeyStorageType set< _Key,, >::_KeyStorageType
private

Definition at line 64 of file _set.h.

◆ _Priv_Rep_type

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _STLP_PRIV _Rb_tree<key_type, key_compare, value_type, _STLP_PRIV _Identity<value_type>, _SetTraits, _Alloc> set< _Key,, >::_Priv_Rep_type
protected

Definition at line 85 of file _set.h.

◆ _Rep_type [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _STLP_PRIV _Rb_tree<key_type, key_compare, value_type, _STLP_PRIV _Identity<value_type>, _SetTraits, _Alloc> set< _Key,, >::_Rep_type

Definition at line 67 of file _set.h.

◆ _Rep_type [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _STLP_PRIV _Rb_tree<_KeyStorageType, _CompareStorageType, _KeyStorageType, _STLP_PRIV _Identity<_KeyStorageType>, _SetStorageTraits, _StorageTypeAlloc> set< _Key,, >::_Rep_type

Definition at line 93 of file _set.h.

◆ _Self [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef set<_Key, _Compare, _Alloc> set< _Key,, >::_Self
private

Definition at line 51 of file _set.h.

◆ _Self [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef set<_Key, _Compare, _Alloc> set< _Key,, >::_Self
private

Definition at line 73 of file _set.h.

◆ _SetStorageTraits

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _STLP_PRIV _SetTraitsT<_KeyStorageType> set< _Key,, >::_SetStorageTraits
protected

Definition at line 87 of file _set.h.

◆ _SetTraits [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _STLP_PRIV _SetTraitsT<value_type> set< _Key,, >::_SetTraits
private

Definition at line 61 of file _set.h.

◆ _SetTraits [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _STLP_PRIV _SetTraitsT<value_type> set< _Key,, >::_SetTraits
protected

Definition at line 82 of file _set.h.

◆ _StorageTypeAlloc

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Alloc_traits<_KeyStorageType, _Alloc>::allocator_type set< _Key,, >::_StorageTypeAlloc
private

Definition at line 70 of file _set.h.

◆ allocator_type [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Rep_type::allocator_type set< _Key,, >::allocator_type

Definition at line 79 of file _set.h.

◆ allocator_type [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Priv_Rep_type::allocator_type set< _Key,, >::allocator_type

Definition at line 110 of file _set.h.

◆ base_iterator

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Rep_type::iterator set< _Key,, >::base_iterator
private

Definition at line 96 of file _set.h.

◆ cast_traits

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _STLP_PRIV _CastTraits<_KeyStorageType, _Key> set< _Key,, >::cast_traits
private

Definition at line 71 of file _set.h.

◆ const_base_iterator

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Rep_type::const_iterator set< _Key,, >::const_base_iterator
private

Definition at line 97 of file _set.h.

◆ const_iterator [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Rep_type::const_iterator set< _Key,, >::const_iterator

Definition at line 74 of file _set.h.

◆ const_iterator [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Priv_Rep_type::const_iterator set< _Key,, >::const_iterator

Definition at line 105 of file _set.h.

◆ const_pointer [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Rep_type::const_pointer set< _Key,, >::const_pointer

Definition at line 70 of file _set.h.

◆ const_pointer [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Priv_Rep_type::const_pointer set< _Key,, >::const_pointer

Definition at line 101 of file _set.h.

◆ const_reference [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Rep_type::const_reference set< _Key,, >::const_reference

Definition at line 72 of file _set.h.

◆ const_reference [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Priv_Rep_type::const_reference set< _Key,, >::const_reference

Definition at line 103 of file _set.h.

◆ const_reverse_iterator [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Rep_type::const_reverse_iterator set< _Key,, >::const_reverse_iterator

Definition at line 76 of file _set.h.

◆ const_reverse_iterator [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Priv_Rep_type::const_reverse_iterator set< _Key,, >::const_reverse_iterator

Definition at line 107 of file _set.h.

◆ difference_type [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Rep_type::difference_type set< _Key,, >::difference_type

Definition at line 78 of file _set.h.

◆ difference_type [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Priv_Rep_type::difference_type set< _Key,, >::difference_type

Definition at line 109 of file _set.h.

◆ iterator [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Rep_type::iterator set< _Key,, >::iterator

Definition at line 73 of file _set.h.

◆ iterator [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Priv_Rep_type::iterator set< _Key,, >::iterator

Definition at line 104 of file _set.h.

◆ key_compare [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Compare set< _Key,, >::key_compare

Definition at line 56 of file _set.h.

◆ key_compare [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Compare set< _Key,, >::key_compare

Definition at line 77 of file _set.h.

◆ key_type [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Key set< _Key,, >::key_type

Definition at line 54 of file _set.h.

◆ key_type [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Key set< _Key,, >::key_type

Definition at line 75 of file _set.h.

◆ pointer [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Rep_type::pointer set< _Key,, >::pointer

Definition at line 69 of file _set.h.

◆ pointer [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Priv_Rep_type::pointer set< _Key,, >::pointer

Definition at line 100 of file _set.h.

◆ reference [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Rep_type::reference set< _Key,, >::reference

Definition at line 71 of file _set.h.

◆ reference [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Priv_Rep_type::reference set< _Key,, >::reference

Definition at line 102 of file _set.h.

◆ reverse_iterator [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Rep_type::reverse_iterator set< _Key,, >::reverse_iterator

Definition at line 75 of file _set.h.

◆ reverse_iterator [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Priv_Rep_type::reverse_iterator set< _Key,, >::reverse_iterator

Definition at line 106 of file _set.h.

◆ size_type [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Rep_type::size_type set< _Key,, >::size_type

Definition at line 77 of file _set.h.

◆ size_type [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Priv_Rep_type::size_type set< _Key,, >::size_type

Definition at line 108 of file _set.h.

◆ value_compare [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Compare set< _Key,, >::value_compare

Definition at line 57 of file _set.h.

◆ value_compare [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Compare set< _Key,, >::value_compare

Definition at line 78 of file _set.h.

◆ value_type [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Key set< _Key,, >::value_type

Definition at line 55 of file _set.h.

◆ value_type [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
typedef _Key set< _Key,, >::value_type

Definition at line 76 of file _set.h.

Constructor & Destructor Documentation

◆ set() [1/15]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
set< _Key,, >::set ( const _Compare &  __comp = _Compare(),
const allocator_type __a = allocator_type() 
)
inlineexplicit

Definition at line 89 of file _set.h.

93  : _M_t(_Compare(), allocator_type()) {}
94  explicit set(const _Compare& __comp)
95  : _M_t(__comp, allocator_type()) {}
96  set(const _Compare& __comp, const allocator_type& __a)
97 #endif
98  : _M_t(__comp, __a) {}
set()
Definition: _set.h:129
_Rep_type _M_t
Definition: _set.h:82
_Rep_type::allocator_type allocator_type
Definition: _set.h:79

◆ set() [2/15]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
set< _Key,, >::set ( const value_type __first,
const value_type __last 
)
inline

Definition at line 116 of file _set.h.

117  : _M_t(_Compare(), allocator_type())
118  { _M_t.insert_unique(__first, __last); }
_Rep_type _M_t
Definition: _set.h:82
_STLP_INLINE_LOOP _InputIter __last
Definition: _algo.h:68
_Rep_type::allocator_type allocator_type
Definition: _set.h:79

◆ set() [3/15]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
set< _Key,, >::set ( const value_type __first,
const value_type __last,
const _Compare &  __comp,
const allocator_type __a = allocator_type() 
)
inline

Definition at line 120 of file _set.h.

123  : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
_Rep_type _M_t
Definition: _set.h:82
_STLP_INLINE_LOOP _InputIter __last
Definition: _algo.h:68

◆ set() [4/15]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
set< _Key,, >::set ( const_iterator  __first,
const_iterator  __last 
)
inline

Definition at line 125 of file _set.h.

126  : _M_t(_Compare(), allocator_type())
127  { _M_t.insert_unique(__first, __last); }
_Rep_type _M_t
Definition: _set.h:82
_STLP_INLINE_LOOP _InputIter __last
Definition: _algo.h:68
_Rep_type::allocator_type allocator_type
Definition: _set.h:79

◆ set() [5/15]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
set< _Key,, >::set ( const_iterator  __first,
const_iterator  __last,
const _Compare &  __comp,
const allocator_type __a = allocator_type() 
)
inline

Definition at line 129 of file _set.h.

131  : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
_Rep_type _M_t
Definition: _set.h:82
_STLP_INLINE_LOOP _InputIter __last
Definition: _algo.h:68

◆ set() [6/15]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
set< _Key,, >::set ( const _Self __x)
inline

Definition at line 134 of file _set.h.

134 : _M_t(__x._M_t) {}
_Rep_type _M_t
Definition: _set.h:82

◆ set() [7/15]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
set< _Key,, >::set ( __move_source< _Self src)
inline

Definition at line 137 of file _set.h.

138  : _M_t(__move_source<_Rep_type>(src.get()._M_t)) {}
_Rep_type _M_t
Definition: _set.h:82
GLenum src
Definition: glext.h:6340

◆ set() [8/15]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
set< _Key,, >::set ( )
inline

Definition at line 129 of file _set.h.

_Rep_type _M_t
Definition: _set.h:82
_Alloc_traits< _KeyStorageType, _Alloc >::allocator_type _StorageTypeAlloc
Definition: _set.h:70
_AssocStorageTypes::_CompareStorageType _CompareStorageType
Definition: _set.h:65

◆ set() [9/15]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
set< _Key,, >::set ( const _Compare &  __comp,
const allocator_type __a = allocator_type() 
)
inlineexplicit

Definition at line 130 of file _set.h.

132  : _M_t(__comp, _STLP_CONVERT_ALLOCATOR(__a, _KeyStorageType)) {}
#define _STLP_CONVERT_ALLOCATOR(__a, _Tp)
Definition: _alloc.h:183
_Rep_type _M_t
Definition: _set.h:82
_AssocStorageTypes::_KeyStorageType _KeyStorageType
Definition: _set.h:64

◆ set() [10/15]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
set< _Key,, >::set ( const value_type __first,
const value_type __last 
)
inline

Definition at line 170 of file _set.h.

171  : _M_t(_Compare(), _StorageTypeAlloc()) {
172  _M_t.insert_unique(cast_traits::to_storage_type_cptr(__first),
173  cast_traits::to_storage_type_cptr(__last));
174  }
_Rep_type _M_t
Definition: _set.h:82
_STLP_INLINE_LOOP _InputIter __last
Definition: _algo.h:68
_Alloc_traits< _KeyStorageType, _Alloc >::allocator_type _StorageTypeAlloc
Definition: _set.h:70

◆ set() [11/15]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
set< _Key,, >::set ( const value_type __first,
const value_type __last,
const _Compare &  __comp,
const allocator_type __a = allocator_type() 
)
inline

Definition at line 176 of file _set.h.

178  : _M_t(__comp, _STLP_CONVERT_ALLOCATOR(__a, _KeyStorageType)) {
179  _M_t.insert_unique(cast_traits::to_storage_type_cptr(__first),
180  cast_traits::to_storage_type_cptr(__last));
181  }
#define _STLP_CONVERT_ALLOCATOR(__a, _Tp)
Definition: _alloc.h:183
_Rep_type _M_t
Definition: _set.h:82
_STLP_INLINE_LOOP _InputIter __last
Definition: _algo.h:68
_AssocStorageTypes::_KeyStorageType _KeyStorageType
Definition: _set.h:64

◆ set() [12/15]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
set< _Key,, >::set ( const_iterator  __first,
const_iterator  __last 
)
inline

Definition at line 183 of file _set.h.

184  : _M_t(_Compare(), _StorageTypeAlloc())
185  { _M_t.insert_unique(_S_to_storage_ite(__first), _S_to_storage_ite(__last)); }
_Rep_type _M_t
Definition: _set.h:82
_STLP_INLINE_LOOP _InputIter __last
Definition: _algo.h:68
_Alloc_traits< _KeyStorageType, _Alloc >::allocator_type _StorageTypeAlloc
Definition: _set.h:70
static base_iterator _S_to_storage_ite(const_iterator __ite)
Definition: _set.h:124

◆ set() [13/15]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
set< _Key,, >::set ( const_iterator  __first,
const_iterator  __last,
const _Compare &  __comp,
const allocator_type __a = allocator_type() 
)
inline

Definition at line 187 of file _set.h.

190  { _M_t.insert_unique(_S_to_storage_ite(__first), _S_to_storage_ite(__last)); }
#define _STLP_CONVERT_ALLOCATOR(__a, _Tp)
Definition: _alloc.h:183
_Rep_type _M_t
Definition: _set.h:82
_STLP_INLINE_LOOP _InputIter __last
Definition: _algo.h:68
_AssocStorageTypes::_KeyStorageType _KeyStorageType
Definition: _set.h:64
static base_iterator _S_to_storage_ite(const_iterator __ite)
Definition: _set.h:124

◆ set() [14/15]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
set< _Key,, >::set ( const _Self __x)
inline

Definition at line 193 of file _set.h.

193 : _M_t(__x._M_t) {}
_Rep_type _M_t
Definition: _set.h:82

◆ set() [15/15]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
set< _Key,, >::set ( __move_source< _Self src)
inline

Definition at line 196 of file _set.h.

197  : _M_t(__move_source<_Rep_type>(src.get()._M_t)) {}
_Rep_type _M_t
Definition: _set.h:82
GLenum src
Definition: glext.h:6340

Member Function Documentation

◆ _S_to_storage_ite()

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
static base_iterator set< _Key,, >::_S_to_storage_ite ( const_iterator  __ite)
inlinestaticprivate

Definition at line 124 of file _set.h.

125  { return base_iterator(__ite._M_node); }
_Rep_type::iterator base_iterator
Definition: _set.h:96

Referenced by set< IncompleteClass >::erase(), set< IncompleteClass >::insert(), and set< IncompleteClass >::set().

◆ _S_to_value_ite()

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
static iterator set< _Key,, >::_S_to_value_ite ( const_base_iterator  __ite)
inlinestaticprivate

◆ begin() [1/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
iterator set< _Key,, >::begin ( )
inline

◆ begin() [2/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
const_iterator set< _Key,, >::begin ( ) const
inline

Definition at line 153 of file _set.h.

153 { return _M_t.begin(); }
_Rep_type _M_t
Definition: _set.h:82

◆ begin() [3/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
iterator set< _Key,, >::begin ( )
inline

Definition at line 211 of file _set.h.

211 { return _S_to_value_ite(_M_t.begin()); }
_Rep_type _M_t
Definition: _set.h:82
static iterator _S_to_value_ite(const_base_iterator __ite)
Definition: _set.h:122

◆ begin() [4/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
const_iterator set< _Key,, >::begin ( ) const
inline

Definition at line 213 of file _set.h.

213 { return _S_to_value_ite(_M_t.begin()); }
_Rep_type _M_t
Definition: _set.h:82
static iterator _S_to_value_ite(const_base_iterator __ite)
Definition: _set.h:122

◆ clear() [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
void set< _Key,, >::clear ( void  )
inline

Definition at line 185 of file _set.h.

185 { _M_t.clear(); }
_Rep_type _M_t
Definition: _set.h:82

Referenced by NotifyArea::UpdateIcons().

◆ clear() [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
void set< _Key,, >::clear ( void  )
inline

Definition at line 259 of file _set.h.

259 { _M_t.clear(); }
_Rep_type _M_t
Definition: _set.h:82

◆ count() [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT size_type set< _Key,, >::count ( const _KT &  __x) const
inline

Definition at line 193 of file _set.h.

194  { return _M_t.find(__x) == _M_t.end() ? 0 : 1 ; }
_Rep_type _M_t
Definition: _set.h:82

◆ count() [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT size_type set< _Key,, >::count ( const _KT &  __x) const
inline

Definition at line 269 of file _set.h.

270  { return _M_t.find(cast_traits::to_storage_type_crefT(__x)) == _M_t.end() ? 0 : 1; }
_Rep_type _M_t
Definition: _set.h:82

◆ empty() [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
bool set< _Key,, >::empty ( ) const
inline

Definition at line 159 of file _set.h.

159 { return _M_t.empty(); }
_Rep_type _M_t
Definition: _set.h:82

Referenced by TaskBar::Refresh().

◆ empty() [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
bool set< _Key,, >::empty ( ) const
inline

Definition at line 219 of file _set.h.

219 { return _M_t.empty(); }
_Rep_type _M_t
Definition: _set.h:82

◆ end() [1/4]

◆ end() [2/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
const_iterator set< _Key,, >::end ( ) const
inline

Definition at line 154 of file _set.h.

154 { return _M_t.end(); }
_Rep_type _M_t
Definition: _set.h:82

◆ end() [3/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
iterator set< _Key,, >::end ( )
inline

Definition at line 212 of file _set.h.

212 { return _S_to_value_ite(_M_t.end()); }
_Rep_type _M_t
Definition: _set.h:82
static iterator _S_to_value_ite(const_base_iterator __ite)
Definition: _set.h:122

◆ end() [4/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
const_iterator set< _Key,, >::end ( ) const
inline

Definition at line 214 of file _set.h.

214 { return _S_to_value_ite(_M_t.end()); }
_Rep_type _M_t
Definition: _set.h:82
static iterator _S_to_value_ite(const_base_iterator __ite)
Definition: _set.h:122

◆ equal_range() [1/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT pair<iterator, iterator> set< _Key,, >::equal_range ( const _KT &  __x)
inline

Definition at line 204 of file _set.h.

205  { return _M_t.equal_range_unique(__x); }
_Rep_type _M_t
Definition: _set.h:82

◆ equal_range() [2/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT pair<const_iterator, const_iterator> set< _Key,, >::equal_range ( const _KT &  __x) const
inline

Definition at line 207 of file _set.h.

208  { return _M_t.equal_range_unique(__x); }
_Rep_type _M_t
Definition: _set.h:82

◆ equal_range() [3/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT pair<iterator, iterator> set< _Key,, >::equal_range ( const _KT &  __x)
inline

Definition at line 284 of file _set.h.

284  {
286  __ret = _M_t.equal_range(cast_traits::to_storage_type_crefT(__x));
288  _S_to_value_ite(__ret.second));
289  }
_Rep_type _M_t
Definition: _set.h:82
_T1 first
Definition: _pair.h:51
Definition: _pair.h:47
_T2 second
Definition: _pair.h:52
static iterator _S_to_value_ite(const_base_iterator __ite)
Definition: _set.h:122

◆ equal_range() [4/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT pair<const_iterator, const_iterator> set< _Key,, >::equal_range ( const _KT &  __x) const
inline

Definition at line 291 of file _set.h.

291  {
293  __ret = _M_t.equal_range_unique(cast_traits::to_storage_type_crefT(__x));
295  _S_to_value_ite(__ret.second));
296  }
_Rep_type _M_t
Definition: _set.h:82
_T1 first
Definition: _pair.h:51
Definition: _pair.h:47
_T2 second
Definition: _pair.h:52
static iterator _S_to_value_ite(const_base_iterator __ite)
Definition: _set.h:122

◆ erase() [1/6]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
void set< _Key,, >::erase ( iterator  __pos)
inline

Definition at line 182 of file _set.h.

182 { _M_t.erase( __pos ); }
_Rep_type _M_t
Definition: _set.h:82

Referenced by Window::unregister_dialog(), and Window::unregister_pretranslate().

◆ erase() [2/6]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
size_type set< _Key,, >::erase ( const key_type __x)
inline

Definition at line 183 of file _set.h.

183 { return _M_t.erase_unique(__x); }
_Rep_type _M_t
Definition: _set.h:82

◆ erase() [3/6]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
void set< _Key,, >::erase ( iterator  __first,
iterator  __last 
)
inline

Definition at line 184 of file _set.h.

184 { _M_t.erase(__first, __last ); }
_Rep_type _M_t
Definition: _set.h:82
_STLP_INLINE_LOOP _InputIter __last
Definition: _algo.h:68

◆ erase() [4/6]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
void set< _Key,, >::erase ( iterator  __pos)
inline

Definition at line 253 of file _set.h.

254  { _M_t.erase(_S_to_storage_ite(__pos)); }
_Rep_type _M_t
Definition: _set.h:82
static base_iterator _S_to_storage_ite(const_iterator __ite)
Definition: _set.h:124

◆ erase() [5/6]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
size_type set< _Key,, >::erase ( const key_type __x)
inline

Definition at line 255 of file _set.h.

256  { return _M_t.erase_unique(cast_traits::to_storage_type_cref(__x)); }
_Rep_type _M_t
Definition: _set.h:82

◆ erase() [6/6]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
void set< _Key,, >::erase ( iterator  __first,
iterator  __last 
)
inline

Definition at line 257 of file _set.h.

258  { _M_t.erase(_S_to_storage_ite(__first), _S_to_storage_ite(__last)); }
_Rep_type _M_t
Definition: _set.h:82
_STLP_INLINE_LOOP _InputIter __last
Definition: _algo.h:68
static base_iterator _S_to_storage_ite(const_iterator __ite)
Definition: _set.h:124

◆ find() [1/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator set< _Key,, >::find ( const _KT &  __x) const
inline

Definition at line 189 of file _set.h.

189 { return _M_t.find(__x); }
_Rep_type _M_t
Definition: _set.h:82

◆ find() [2/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT iterator set< _Key,, >::find ( const _KT &  __x)
inline

Definition at line 191 of file _set.h.

191 { return _M_t.find(__x); }
_Rep_type _M_t
Definition: _set.h:82

◆ find() [3/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator set< _Key,, >::find ( const _KT &  __x) const
inline

Definition at line 263 of file _set.h.

264  { return _S_to_value_ite(_M_t.find(cast_traits::to_storage_type_crefT(__x))); }
_Rep_type _M_t
Definition: _set.h:82
static iterator _S_to_value_ite(const_base_iterator __ite)
Definition: _set.h:122

◆ find() [4/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT iterator set< _Key,, >::find ( const _KT &  __x)
inline

Definition at line 266 of file _set.h.

267  { return _S_to_value_ite(_M_t.find(cast_traits::to_storage_type_crefT(__x))); }
_Rep_type _M_t
Definition: _set.h:82
static iterator _S_to_value_ite(const_base_iterator __ite)
Definition: _set.h:122

◆ get_allocator() [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
allocator_type set< _Key,, >::get_allocator ( ) const
inline

Definition at line 149 of file _set.h.

149 { return _M_t.get_allocator(); }
_Rep_type _M_t
Definition: _set.h:82

◆ get_allocator() [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
allocator_type set< _Key,, >::get_allocator ( ) const
inline

Definition at line 208 of file _set.h.

209  { return _STLP_CONVERT_ALLOCATOR(_M_t.get_allocator(), value_type); }
#define _STLP_CONVERT_ALLOCATOR(__a, _Tp)
Definition: _alloc.h:183
_Rep_type _M_t
Definition: _set.h:82
_Key value_type
Definition: _set.h:55

◆ insert() [1/8]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
pair<iterator,bool> set< _Key,, >::insert ( const value_type __x)
inline

◆ insert() [2/8]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
iterator set< _Key,, >::insert ( iterator  __pos,
const value_type __x 
)
inline

Definition at line 170 of file _set.h.

171  { return _M_t.insert_unique( __pos , __x); }
_Rep_type _M_t
Definition: _set.h:82

◆ insert() [3/8]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
void set< _Key,, >::insert ( const_iterator  __first,
const_iterator  __last 
)
inline

Definition at line 177 of file _set.h.

178  { _M_t.insert_unique(__first, __last); }
_Rep_type _M_t
Definition: _set.h:82
_STLP_INLINE_LOOP _InputIter __last
Definition: _algo.h:68

◆ insert() [4/8]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
void set< _Key,, >::insert ( const value_type __first,
const value_type __last 
)
inline

Definition at line 179 of file _set.h.

180  { _M_t.insert_unique(__first, __last); }
_Rep_type _M_t
Definition: _set.h:82
_STLP_INLINE_LOOP _InputIter __last
Definition: _algo.h:68

◆ insert() [5/8]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
pair<iterator,bool> set< _Key,, >::insert ( const value_type __x)
inline

Definition at line 228 of file _set.h.

228  {
229  pair<base_iterator, bool> ret = _M_t.insert_unique(cast_traits::to_storage_type_cref(__x));
230  return pair<iterator, bool>(_S_to_value_ite(ret.first), ret.second);
231  }
_Rep_type _M_t
Definition: _set.h:82
int ret
Definition: _pair.h:47
static iterator _S_to_value_ite(const_base_iterator __ite)
Definition: _set.h:122

◆ insert() [6/8]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
iterator set< _Key,, >::insert ( iterator  __pos,
const value_type __x 
)
inline

Definition at line 232 of file _set.h.

233  { return _S_to_value_ite(_M_t.insert_unique(_S_to_storage_ite(__pos), cast_traits::to_storage_type_cref(__x))); }
_Rep_type _M_t
Definition: _set.h:82
static iterator _S_to_value_ite(const_base_iterator __ite)
Definition: _set.h:122
static base_iterator _S_to_storage_ite(const_iterator __ite)
Definition: _set.h:124

◆ insert() [7/8]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
void set< _Key,, >::insert ( const_iterator  __first,
const_iterator  __last 
)
inline

Definition at line 246 of file _set.h.

247  { _M_t.insert_unique(_S_to_storage_ite(__first), _S_to_storage_ite(__last)); }
_Rep_type _M_t
Definition: _set.h:82
_STLP_INLINE_LOOP _InputIter __last
Definition: _algo.h:68
static base_iterator _S_to_storage_ite(const_iterator __ite)
Definition: _set.h:124

◆ insert() [8/8]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
void set< _Key,, >::insert ( const value_type __first,
const value_type __last 
)
inline

Definition at line 248 of file _set.h.

248  {
249  _M_t.insert_unique(cast_traits::to_storage_type_cptr(__first),
250  cast_traits::to_storage_type_cptr(__last));
251  }
_Rep_type _M_t
Definition: _set.h:82
_STLP_INLINE_LOOP _InputIter __last
Definition: _algo.h:68

◆ key_comp() [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
key_compare set< _Key,, >::key_comp ( ) const
inline

Definition at line 147 of file _set.h.

147 { return _M_t.key_comp(); }
_Rep_type _M_t
Definition: _set.h:82

◆ key_comp() [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
key_compare set< _Key,, >::key_comp ( ) const
inline

Definition at line 206 of file _set.h.

206 { return _M_t.key_comp(); }
_Rep_type _M_t
Definition: _set.h:82

◆ lower_bound() [1/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT iterator set< _Key,, >::lower_bound ( const _KT &  __x)
inline

Definition at line 196 of file _set.h.

196 { return _M_t.lower_bound(__x); }
_Rep_type _M_t
Definition: _set.h:82

Referenced by SetTest::bounds().

◆ lower_bound() [2/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator set< _Key,, >::lower_bound ( const _KT &  __x) const
inline

Definition at line 198 of file _set.h.

198 { return _M_t.lower_bound(__x); }
_Rep_type _M_t
Definition: _set.h:82

◆ lower_bound() [3/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT iterator set< _Key,, >::lower_bound ( const _KT &  __x)
inline

Definition at line 272 of file _set.h.

273  { return _S_to_value_ite(_M_t.lower_bound(cast_traits::to_storage_type_crefT(__x))); }
_Rep_type _M_t
Definition: _set.h:82
static iterator _S_to_value_ite(const_base_iterator __ite)
Definition: _set.h:122

◆ lower_bound() [4/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator set< _Key,, >::lower_bound ( const _KT &  __x) const
inline

Definition at line 275 of file _set.h.

276  { return _S_to_value_ite(_M_t.lower_bound(cast_traits::to_storage_type_crefT(__x))); }
_Rep_type _M_t
Definition: _set.h:82
static iterator _S_to_value_ite(const_base_iterator __ite)
Definition: _set.h:122

◆ max_size() [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
size_type set< _Key,, >::max_size ( ) const
inline

Definition at line 161 of file _set.h.

161 { return _M_t.max_size(); }
_Rep_type _M_t
Definition: _set.h:82

◆ max_size() [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
size_type set< _Key,, >::max_size ( ) const
inline

Definition at line 221 of file _set.h.

221 { return _M_t.max_size(); }
_Rep_type _M_t
Definition: _set.h:82

◆ operator=() [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_Self& set< _Key,, >::operator= ( const _Self __x)
inline

Definition at line 141 of file _set.h.

141  {
142  _M_t = __x._M_t;
143  return *this;
144  }
_Rep_type _M_t
Definition: _set.h:82

◆ operator=() [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_Self& set< _Key,, >::operator= ( const _Self __x)
inline

Definition at line 200 of file _set.h.

200  {
201  _M_t = __x._M_t;
202  return *this;
203  }
_Rep_type _M_t
Definition: _set.h:82

◆ rbegin() [1/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
reverse_iterator set< _Key,, >::rbegin ( )
inline

Definition at line 155 of file _set.h.

155 { return _M_t.rbegin(); }
_Rep_type _M_t
Definition: _set.h:82

Referenced by TaskBar::Refresh(), and SetTest::reverse_iterator_test().

◆ rbegin() [2/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
const_reverse_iterator set< _Key,, >::rbegin ( ) const
inline

Definition at line 157 of file _set.h.

157 { return _M_t.rbegin(); }
_Rep_type _M_t
Definition: _set.h:82

◆ rbegin() [3/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
reverse_iterator set< _Key,, >::rbegin ( )
inline

Definition at line 215 of file _set.h.

215 { return reverse_iterator(end()); }
_Rep_type::reverse_iterator reverse_iterator
Definition: _set.h:75
iterator end()
Definition: _set.h:152

◆ rbegin() [4/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
const_reverse_iterator set< _Key,, >::rbegin ( ) const
inline

Definition at line 217 of file _set.h.

217 { return const_reverse_iterator(end()); }
_Rep_type::const_reverse_iterator const_reverse_iterator
Definition: _set.h:76
iterator end()
Definition: _set.h:152

◆ rend() [1/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
reverse_iterator set< _Key,, >::rend ( )
inline

Definition at line 156 of file _set.h.

156 { return _M_t.rend(); }
_Rep_type _M_t
Definition: _set.h:82

Referenced by TaskBar::Refresh(), and SetTest::reverse_iterator_test().

◆ rend() [2/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
const_reverse_iterator set< _Key,, >::rend ( ) const
inline

Definition at line 158 of file _set.h.

158 { return _M_t.rend(); }
_Rep_type _M_t
Definition: _set.h:82

◆ rend() [3/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
reverse_iterator set< _Key,, >::rend ( )
inline

Definition at line 216 of file _set.h.

216 { return reverse_iterator(begin()); }
_Rep_type::reverse_iterator reverse_iterator
Definition: _set.h:75
iterator begin()
Definition: _set.h:151

◆ rend() [4/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
const_reverse_iterator set< _Key,, >::rend ( ) const
inline

Definition at line 218 of file _set.h.

218 { return const_reverse_iterator(begin()); }
_Rep_type::const_reverse_iterator const_reverse_iterator
Definition: _set.h:76
iterator begin()
Definition: _set.h:151

◆ size() [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
size_type set< _Key,, >::size ( ) const
inline

Definition at line 160 of file _set.h.

160 { return _M_t.size(); }
_Rep_type _M_t
Definition: _set.h:82

Referenced by StartMenu::ActivateEntry(), NotifyArea::UpdateIcons(), and NotifyArea::WndProc().

◆ size() [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
size_type set< _Key,, >::size ( ) const
inline

Definition at line 220 of file _set.h.

220 { return _M_t.size(); }
_Rep_type _M_t
Definition: _set.h:82

◆ swap() [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
void set< _Key,, >::swap ( _Self __x)
inline

Definition at line 162 of file _set.h.

162 { _M_t.swap(__x._M_t); }
_Rep_type _M_t
Definition: _set.h:82

◆ swap() [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
void set< _Key,, >::swap ( _Self __x)
inline

Definition at line 222 of file _set.h.

222 { _M_t.swap(__x._M_t); }
_Rep_type _M_t
Definition: _set.h:82

◆ upper_bound() [1/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT iterator set< _Key,, >::upper_bound ( const _KT &  __x)
inline

Definition at line 200 of file _set.h.

200 { return _M_t.upper_bound(__x); }
_Rep_type _M_t
Definition: _set.h:82

Referenced by SetTest::bounds().

◆ upper_bound() [2/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator set< _Key,, >::upper_bound ( const _KT &  __x) const
inline

Definition at line 202 of file _set.h.

202 { return _M_t.upper_bound(__x); }
_Rep_type _M_t
Definition: _set.h:82

◆ upper_bound() [3/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT iterator set< _Key,, >::upper_bound ( const _KT &  __x)
inline

Definition at line 278 of file _set.h.

279  { return _S_to_value_ite(_M_t.upper_bound(cast_traits::to_storage_type_crefT(__x))); }
_Rep_type _M_t
Definition: _set.h:82
static iterator _S_to_value_ite(const_base_iterator __ite)
Definition: _set.h:122

◆ upper_bound() [4/4]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator set< _Key,, >::upper_bound ( const _KT &  __x) const
inline

Definition at line 281 of file _set.h.

282  { return _S_to_value_ite(_M_t.upper_bound(cast_traits::to_storage_type_crefT(__x))); }
_Rep_type _M_t
Definition: _set.h:82
static iterator _S_to_value_ite(const_base_iterator __ite)
Definition: _set.h:122

◆ value_comp() [1/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
value_compare set< _Key,, >::value_comp ( ) const
inline

Definition at line 148 of file _set.h.

148 { return _M_t.key_comp(); }
_Rep_type _M_t
Definition: _set.h:82

◆ value_comp() [2/2]

template<class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Key >) >
value_compare set< _Key,, >::value_comp ( ) const
inline

Definition at line 207 of file _set.h.

207 { return _M_t.key_comp(); }
_Rep_type _M_t
Definition: _set.h:82

Member Data Documentation

◆ _M_t


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