ReactOS 0.4.16-dev-2613-g9533ad7
Classes | Public Types | Public Member Functions | Protected Types | Private Types | Private Attributes | List of all members
map< _Key, _Tp,, > Class Template Reference

#include <_map.h>

Collaboration diagram for map< _Key, _Tp,, >:
Collaboration graph
[legend]

Classes

class  value_compare
 

Public Types

typedef _Key key_type
 
typedef _Tp data_type
 
typedef _Tp mapped_type
 
typedef pair< _STLP_CONST _Key, _Tp > value_type
 
typedef _Compare key_compare
 
typedef _STLP_PRIV _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, _Key), _MapTraits, _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
 

Public Member Functions

 map ()
 
 map (const _Compare &__comp, const allocator_type &__a=allocator_type())
 
 map (const value_type *__first, const value_type *__last)
 
 map (const value_type *__first, const value_type *__last, const _Compare &__comp, const allocator_type &__a=allocator_type())
 
 map (const_iterator __first, const_iterator __last)
 
 map (const_iterator __first, const_iterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type())
 
 map (const _Self &__x)
 
 map (__move_source< _Self > src)
 
_Self & operator= (const _Self &__x)
 
key_compare key_comp () const
 
value_compare value_comp () const
 
allocator_type get_allocator () const
 
iterator begin ()
 
const_iterator begin () const
 
iterator end ()
 
const_iterator end () const
 
reverse_iterator rbegin ()
 
const_reverse_iterator rbegin () const
 
reverse_iterator rend ()
 
const_reverse_iterator rend () const
 
bool empty () const
 
size_type size () const
 
size_type max_size () const
 
_STLP_TEMPLATE_FOR_CONT_EXT _Tp & operator[] (const _KT &__k)
 
void swap (_Self &__x)
 
pair< iterator, bool > insert (const value_type &__x)
 
iterator insert (iterator __pos, const value_type &__x)
 
void insert (const value_type *__first, const value_type *__last)
 
void insert (const_iterator __first, const_iterator __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 iterator find (const _KT &__x)
 
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator find (const _KT &__x) const
 
_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, iterator > equal_range (const _KT &__x)
 
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iterator > equal_range (const _KT &__x) const
 

Protected Types

typedef _STLP_PRIV _MapTraitsT< value_type > _MapTraits
 

Private Types

typedef map< _Key, _Tp, _Compare, _Alloc > _Self
 

Private Attributes

_Rep_type _M_t
 

Detailed Description

template<class _Key, class _Tp, _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >), _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp)>
class map< _Key, _Tp,, >

Definition at line 44 of file _map.h.

Member Typedef Documentation

◆ _MapTraits

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _STLP_PRIV _MapTraitsT<value_type> map< _Key, _Tp,, >::_MapTraits
protected

Definition at line 73 of file _map.h.

◆ _Rep_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _STLP_PRIV _Rb_tree<key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, _Key), _MapTraits, _Alloc> map< _Key, _Tp,, >::_Rep_type

Definition at line 79 of file _map.h.

◆ _Self

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef map<_Key, _Tp, _Compare, _Alloc> map< _Key, _Tp,, >::_Self
private

Definition at line 49 of file _map.h.

◆ allocator_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Rep_type::allocator_type map< _Key, _Tp,, >::allocator_type

Definition at line 91 of file _map.h.

◆ const_iterator

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Rep_type::const_iterator map< _Key, _Tp,, >::const_iterator

Definition at line 86 of file _map.h.

◆ const_pointer

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Rep_type::const_pointer map< _Key, _Tp,, >::const_pointer

Definition at line 82 of file _map.h.

◆ const_reference

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Rep_type::const_reference map< _Key, _Tp,, >::const_reference

Definition at line 84 of file _map.h.

◆ const_reverse_iterator

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Rep_type::const_reverse_iterator map< _Key, _Tp,, >::const_reverse_iterator

Definition at line 88 of file _map.h.

◆ data_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Tp map< _Key, _Tp,, >::data_type

Definition at line 55 of file _map.h.

◆ difference_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Rep_type::difference_type map< _Key, _Tp,, >::difference_type

Definition at line 90 of file _map.h.

◆ iterator

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Rep_type::iterator map< _Key, _Tp,, >::iterator

Definition at line 85 of file _map.h.

◆ key_compare

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Compare map< _Key, _Tp,, >::key_compare

Definition at line 58 of file _map.h.

◆ key_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Key map< _Key, _Tp,, >::key_type

Definition at line 54 of file _map.h.

◆ mapped_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Tp map< _Key, _Tp,, >::mapped_type

Definition at line 56 of file _map.h.

◆ pointer

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Rep_type::pointer map< _Key, _Tp,, >::pointer

Definition at line 81 of file _map.h.

◆ reference

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Rep_type::reference map< _Key, _Tp,, >::reference

Definition at line 83 of file _map.h.

◆ reverse_iterator

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Rep_type::reverse_iterator map< _Key, _Tp,, >::reverse_iterator

Definition at line 87 of file _map.h.

◆ size_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Rep_type::size_type map< _Key, _Tp,, >::size_type

Definition at line 89 of file _map.h.

◆ value_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef pair<_STLP_CONST _Key, _Tp> map< _Key, _Tp,, >::value_type

Definition at line 57 of file _map.h.

Constructor & Destructor Documentation

◆ map() [1/8]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
map< _Key, _Tp,, >::map ( )
inline

Definition at line 99 of file _map.h.

99: _M_t(_Compare(), allocator_type()) {}
map::allocator_type
_Rep_type::allocator_type allocator_type
Definition: _map.h:91
map::_M_t
_Rep_type _M_t
Definition: _map.h:94

Referenced by KeyMap::operator=().

◆ map() [2/8]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
map< _Key, _Tp,, >::map ( const _Compare &  __comp,
const allocator_type &  __a = allocator_type() 
)
inlineexplicit

Definition at line 101 of file _map.h.

105 : _M_t(__comp, allocator_type()) {}
106 explicit map(const _Compare& __comp, const allocator_type& __a)
107#endif
108 : _M_t(__comp, __a) {}
map::map
map()
Definition: _map.h:99

◆ map() [3/8]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
map< _Key, _Tp,, >::map ( const value_type *  __first,
const value_type *  __last 
)
inline

Definition at line 128 of file _map.h.

129 : _M_t(_Compare(), allocator_type())
130 { _M_t.insert_unique(__first, __last); }
__last
_STLP_INLINE_LOOP _InputIter __last
Definition: _algo.h:68

◆ map() [4/8]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
map< _Key, _Tp,, >::map ( const value_type *  __first,
const value_type *  __last,
const _Compare &  __comp,
const allocator_type &  __a = allocator_type() 
)
inline

Definition at line 132 of file _map.h.

135 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }

◆ map() [5/8]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
map< _Key, _Tp,, >::map ( const_iterator  __first,
const_iterator  __last 
)
inline

Definition at line 137 of file _map.h.

138 : _M_t(_Compare(), allocator_type())
139 { _M_t.insert_unique(__first, __last); }

◆ map() [6/8]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
map< _Key, _Tp,, >::map ( const_iterator  __first,
const_iterator  __last,
const _Compare &  __comp,
const allocator_type &  __a = allocator_type() 
)
inline

Definition at line 141 of file _map.h.

143 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }

◆ map() [7/8]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
map< _Key, _Tp,, >::map ( const _Self &  __x)
inline

Definition at line 146 of file _map.h.

146: _M_t(__x._M_t) {}

◆ map() [8/8]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
map< _Key, _Tp,, >::map ( __move_source< _Self >  src)
inline

Definition at line 149 of file _map.h.

150 : _M_t(__move_source<_Rep_type>(src.get()._M_t)) {}
__move_source
Definition: _move_construct_fwk.h:35
src
GLenum src
Definition: glext.h:6340

Member Function Documentation

◆ begin() [1/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
iterator map< _Key, _Tp,, >::begin ( )
inline

Definition at line 163 of file _map.h.

163{ return _M_t.begin(); }

Referenced by main().

◆ begin() [2/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
const_iterator map< _Key, _Tp,, >::begin ( ) const
inline

Definition at line 164 of file _map.h.

164{ return _M_t.begin(); }

◆ clear()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void map< _Key, _Tp,, >::clear ( )
inline

Definition at line 206 of file _map.h.

206{ _M_t.clear(); }

◆ count()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT size_type map< _Key, _Tp,, >::count ( const _KT &  __x) const
inline

Definition at line 214 of file _map.h.

214{ return _M_t.find(__x) == _M_t.end() ? 0 : 1; }

Referenced by shader_record_sample().

◆ empty()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
bool map< _Key, _Tp,, >::empty ( ) const
inline

Definition at line 171 of file _map.h.

171{ return _M_t.empty(); }

◆ end() [1/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
iterator map< _Key, _Tp,, >::end ( )
inline

Definition at line 165 of file _map.h.

165{ return _M_t.end(); }

Referenced by main(), and map< _Key, _Tp,, >::operator[]().

◆ end() [2/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
const_iterator map< _Key, _Tp,, >::end ( ) const
inline

Definition at line 166 of file _map.h.

166{ return _M_t.end(); }

◆ equal_range() [1/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iterator > map< _Key, _Tp,, >::equal_range ( const _KT &  __x)
inline

Definition at line 225 of file _map.h.

226 { return _M_t.equal_range_unique(__x); }

◆ equal_range() [2/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iterator > map< _Key, _Tp,, >::equal_range ( const _KT &  __x) const
inline

Definition at line 228 of file _map.h.

229 { return _M_t.equal_range_unique(__x); }

◆ erase() [1/3]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
size_type map< _Key, _Tp,, >::erase ( const key_type &  __x)
inline

Definition at line 204 of file _map.h.

204{ return _M_t.erase_unique(__x); }

◆ erase() [2/3]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void map< _Key, _Tp,, >::erase ( iterator  __first,
iterator  __last 
)
inline

Definition at line 205 of file _map.h.

205{ _M_t.erase(__first, __last); }

◆ erase() [3/3]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void map< _Key, _Tp,, >::erase ( iterator  __pos)
inline

Definition at line 203 of file _map.h.

203{ _M_t.erase(__pos); }

Referenced by main().

◆ find() [1/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT iterator map< _Key, _Tp,, >::find ( const _KT &  __x)
inline

Definition at line 210 of file _map.h.

210{ return _M_t.find(__x); }

◆ find() [2/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator map< _Key, _Tp,, >::find ( const _KT &  __x) const
inline

Definition at line 212 of file _map.h.

212{ return _M_t.find(__x); }

◆ get_allocator()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
allocator_type map< _Key, _Tp,, >::get_allocator ( ) const
inline

Definition at line 161 of file _map.h.

161{ return _M_t.get_allocator(); }

◆ insert() [1/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
pair< iterator, bool > map< _Key, _Tp,, >::insert ( const value_type &  __x)
inline

Definition at line 188 of file _map.h.

189 { return _M_t.insert_unique(__x); }

Referenced by main(), and map< _Key, _Tp,, >::operator[]().

◆ insert() [2/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void map< _Key, _Tp,, >::insert ( const value_type *  __first,
const value_type *  __last 
)
inline

Definition at line 197 of file _map.h.

198 { _M_t.insert_unique(__first, __last); }

◆ insert() [3/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void map< _Key, _Tp,, >::insert ( const_iterator  __first,
const_iterator  __last 
)
inline

Definition at line 199 of file _map.h.

200 { _M_t.insert_unique(__first, __last); }

◆ insert() [4/4]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
iterator map< _Key, _Tp,, >::insert ( iterator  __pos,
const value_type &  __x 
)
inline

Definition at line 190 of file _map.h.

191 { return _M_t.insert_unique(__pos, __x); }

◆ key_comp()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
key_compare map< _Key, _Tp,, >::key_comp ( ) const
inline

Definition at line 159 of file _map.h.

159{ return _M_t.key_comp(); }

Referenced by map< _Key, _Tp,, >::operator[]().

◆ lower_bound() [1/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT iterator map< _Key, _Tp,, >::lower_bound ( const _KT &  __x)
inline

Definition at line 216 of file _map.h.

216{ return _M_t.lower_bound(__x); }

Referenced by map< _Key, _Tp,, >::operator[]().

◆ lower_bound() [2/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator map< _Key, _Tp,, >::lower_bound ( const _KT &  __x) const
inline

Definition at line 218 of file _map.h.

218{ return _M_t.lower_bound(__x); }

◆ max_size()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
size_type map< _Key, _Tp,, >::max_size ( ) const
inline

Definition at line 173 of file _map.h.

173{ return _M_t.max_size(); }

◆ operator=()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_Self & map< _Key, _Tp,, >::operator= ( const _Self &  __x)
inline

Definition at line 153 of file _map.h.

153 {
154 _M_t = __x._M_t;
155 return *this;
156 }

◆ operator[]()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT _Tp & map< _Key, _Tp,, >::operator[] ( const _KT &  __k)
inline

Definition at line 175 of file _map.h.

175 {
176 iterator __i = lower_bound(__k);
177 // __i->first is greater than or equivalent to __k.
178 if (__i == end() || key_comp()(__k, (*__i).first))
179 __i = insert(__i, value_type(__k, _STLP_DEFAULT_CONSTRUCTED(_Tp)));
180 return (*__i).second;
181 }
_STLP_DEFAULT_CONSTRUCTED
#define _STLP_DEFAULT_CONSTRUCTED(_TTp)
Definition: _construct.h:265
map::value_type
pair< _STLP_CONST _Key, _Tp > value_type
Definition: _map.h:57
map::key_comp
key_compare key_comp() const
Definition: _map.h:159
map::insert
pair< iterator, bool > insert(const value_type &__x)
Definition: _map.h:188
map::lower_bound
_STLP_TEMPLATE_FOR_CONT_EXT iterator lower_bound(const _KT &__x)
Definition: _map.h:216
map::end
iterator end()
Definition: _map.h:165
__i
unsigned int __i
Definition: math.h:269

◆ rbegin() [1/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
reverse_iterator map< _Key, _Tp,, >::rbegin ( )
inline

Definition at line 167 of file _map.h.

167{ return _M_t.rbegin(); }

◆ rbegin() [2/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
const_reverse_iterator map< _Key, _Tp,, >::rbegin ( ) const
inline

Definition at line 168 of file _map.h.

168{ return _M_t.rbegin(); }

◆ rend() [1/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
reverse_iterator map< _Key, _Tp,, >::rend ( )
inline

Definition at line 169 of file _map.h.

169{ return _M_t.rend(); }

◆ rend() [2/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
const_reverse_iterator map< _Key, _Tp,, >::rend ( ) const
inline

Definition at line 170 of file _map.h.

170{ return _M_t.rend(); }

◆ size()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
size_type map< _Key, _Tp,, >::size ( ) const
inline

Definition at line 172 of file _map.h.

172{ return _M_t.size(); }

Referenced by shader_record_sample().

◆ swap()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void map< _Key, _Tp,, >::swap ( _Self &  __x)
inline

Definition at line 182 of file _map.h.

182{ _M_t.swap(__x._M_t); }

◆ upper_bound() [1/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT iterator map< _Key, _Tp,, >::upper_bound ( const _KT &  __x)
inline

Definition at line 220 of file _map.h.

220{ return _M_t.upper_bound(__x); }

◆ upper_bound() [2/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator map< _Key, _Tp,, >::upper_bound ( const _KT &  __x) const
inline

Definition at line 222 of file _map.h.

222{ return _M_t.upper_bound(__x); }

◆ value_comp()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
value_compare map< _Key, _Tp,, >::value_comp ( ) const
inline

Definition at line 160 of file _map.h.

160{ return value_compare(_M_t.key_comp()); }

Member Data Documentation

◆ _M_t

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_Compare, less< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_Rep_type map< _Key, _Tp,, >::_M_t
private

Definition at line 94 of file _map.h.

Referenced by map< _Key, _Tp,, >::begin(), map< _Key, _Tp,, >::clear(), map< _Key, _Tp,, >::count(), map< _Key, _Tp,, >::empty(), map< _Key, _Tp,, >::end(), map< _Key, _Tp,, >::equal_range(), map< _Key, _Tp,, >::erase(), map< _Key, _Tp,, >::find(), map< _Key, _Tp,, >::get_allocator(), map< _Key, _Tp,, >::insert(), map< _Key, _Tp,, >::key_comp(), map< _Key, _Tp,, >::lower_bound(), map< _Key, _Tp,, >::map(), map< _Key, _Tp,, >::max_size(), map< _Key, _Tp,, >::operator=(), map< _Key, _Tp,, >::rbegin(), map< _Key, _Tp,, >::rend(), map< _Key, _Tp,, >::size(), map< _Key, _Tp,, >::swap(), map< _Key, _Tp,, >::upper_bound(), and map< _Key, _Tp,, >::value_comp().

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