STLdoc
STLdocumentation
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
Public Types | Public Member Functions | List of all members
stdext::hash_map< _Kty, _Ty, _Tr, _Alloc > Class Template Reference
Inheritance diagram for stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >:
_Hash< _Traits >

Public Types

typedef hash_map< _Kty, _Ty, _Tr, _Alloc > _Myt
 
typedef _Hash< _Hmap_traits< _Kty, _Ty, _Tr, _Alloc, false > > _Mybase
 
typedef _Kty key_type
 
typedef _Ty mapped_type
 
typedef _Ty referent_type
 
typedef _Tr key_compare
 
typedef _Mybase::value_compare value_compare
 
typedef _Mybase::allocator_type allocator_type
 
typedef _Mybase::size_type size_type
 
typedef _Mybase::difference_type difference_type
 
typedef _Mybase::pointer pointer
 
typedef _Mybase::const_pointer const_pointer
 
typedef _Mybase::reference reference
 
typedef _Mybase::const_reference const_reference
 
typedef _Mybase::iterator iterator
 
typedef _Mybase::const_iterator const_iterator
 
typedef _Mybase::reverse_iterator reverse_iterator
 
typedef _Mybase::const_reverse_iterator const_reverse_iterator
 
typedef _Mybase::value_type value_type
 
- Public Types inherited from _Hash< _Traits >
enum  { _Bucket_size = key_compare::bucket_size, _Min_buckets = 8, _Multi = _Traits::_Multi }
 
typedef _Hash< _Traits > _Myt
 
typedef _Traits::key_type key_type
 
typedef _Traits::key_compare key_compare
 
typedef _Traits::value_compare value_compare
 
typedef list< typename _Traits::value_type, typename _Traits::allocator_type > _Mylist
 
typedef _Mylist::_Alty _Alty
 
typedef _Mylist::value_type value_type
 
typedef _Mylist::allocator_type allocator_type
 
typedef _Mylist::size_type size_type
 
typedef _Mylist::difference_type difference_type
 
typedef _Mylist::pointer pointer
 
typedef _Mylist::const_pointer const_pointer
 
typedef _Mylist::reference reference
 
typedef _Mylist::const_reference const_reference
 
typedef _If< is_same< key_type, value_type >::value, typename _Mylist::const_iterator, typename _Mylist::iterator >::type iterator
 
typedef _Mylist::const_iterator const_iterator
 
typedef _If< is_same< key_type, value_type >::value, typename _Mylist::_Unchecked_const_iterator, typename _Mylist::_Unchecked_iterator >::type _Unchecked_iterator
 
typedef _Mylist::_Unchecked_const_iterator _Unchecked_const_iterator
 
typedef _STD reverse_iterator< iteratorreverse_iterator
 
typedef _STD reverse_iterator< const_iteratorconst_reverse_iterator
 
typedef vector< _Unchecked_iterator, typename _Alty::template rebind< _Unchecked_iterator >::other > _Myvec
 
typedef pair< iterator, bool_Pairib
 
typedef pair< iterator, iterator_Pairii
 
typedef pair< const_iterator, const_iterator_Paircc
 
typedef iterator local_iterator
 
typedef const_iterator const_local_iterator
 

Public Member Functions

 hash_map ()
 
 hash_map (const allocator_type &_Al)
 
 hash_map (const _Myt &_Right)
 
 hash_map (const _Myt &_Right, const allocator_type &_Al)
 
 hash_map (const key_compare &_Traits)
 
 hash_map (const key_compare &_Traits, const allocator_type &_Al)
 
template<class _Iter >
 hash_map (_Iter _First, _Iter _Last)
 
template<class _Iter >
 hash_map (_Iter _First, _Iter _Last, const key_compare &_Traits)
 
template<class _Iter >
 hash_map (_Iter _First, _Iter _Last, const key_compare &_Traits, const allocator_type &_Al)
 
_Mytoperator= (const _Myt &_Right)
 
 hash_map (_Myt &&_Right)
 
 hash_map (_Myt &&_Right, const allocator_type &_Al)
 
_Mytoperator= (_Myt &&_Right)
 
mapped_typeoperator[] (key_type &&_Keyval)
 
void swap (_Myt &_Right)
 
 hash_map (_XSTD initializer_list< value_type > _Ilist)
 
 hash_map (_XSTD initializer_list< value_type > _Ilist, const key_compare &_Pred)
 
 hash_map (_XSTD initializer_list< value_type > _Ilist, const key_compare &_Pred, const allocator_type &_Al)
 
_Mytoperator= (_XSTD initializer_list< value_type > _Ilist)
 
mapped_typeoperator[] (const key_type &_Keyval)
 
mapped_typeat (const key_type &_Keyval)
 
const mapped_typeat (const key_type &_Keyval) const
 
- Public Member Functions inherited from _Hash< _Traits >
 _Hash (const key_compare &_Parg, const allocator_type &_Al)
 
 _Hash (const value_type *_First, const value_type *_Last, const key_compare &_Parg, const allocator_type &_Al)
 
 _Hash (const _Myt &_Right, const allocator_type &_Al)
 
 _Hash (_Myt &&_Right, const allocator_type &_Al)
 
_Mytoperator= (_Myt &&_Right)
 
void _Assign_rv (_Myt &&_Right)
 
_Pairib insert (value_type &&_Val)
 
iterator insert (const_iterator, value_type &&_Val)
 
template<class _Valty >
enable_if< is_convertible< _Valty, value_type >::value, _Pairib >::type insert (_Valty &&_Val)
 
template<class _Valty >
enable_if< is_convertible< _Valty, value_type >::value, iterator >::type insert (const_iterator, _Valty &&_Val)
 
template<class... _Valty>
_Pairib emplace (_Valty &&..._Val)
 
template<class... _Valty>
iterator emplace_hint (const_iterator, _Valty &&..._Val)
 
 ~_Hash () _NOEXCEPT
 
_Mytoperator= (const _Myt &_Right)
 
iterator begin () _NOEXCEPT
 
const_iterator begin () const _NOEXCEPT
 
iterator end () _NOEXCEPT
 
const_iterator end () const _NOEXCEPT
 
_Unchecked_iterator _Unchecked_begin ()
 
_Unchecked_const_iterator _Unchecked_begin () const
 
_Unchecked_iterator _Unchecked_end ()
 
_Unchecked_const_iterator _Unchecked_end () const
 
iterator _Make_iter (_Unchecked_const_iterator _Where) const
 
iterator _Make_iter (const_iterator _Where) const
 
reverse_iterator rbegin () _NOEXCEPT
 
const_reverse_iterator rbegin () const _NOEXCEPT
 
reverse_iterator rend () _NOEXCEPT
 
const_reverse_iterator rend () const _NOEXCEPT
 
const_iterator cbegin () const _NOEXCEPT
 
const_iterator cend () const _NOEXCEPT
 
const_reverse_iterator crbegin () const _NOEXCEPT
 
const_reverse_iterator crend () const _NOEXCEPT
 
size_type size () const _NOEXCEPT
 
size_type max_size () const _NOEXCEPT
 
bool empty () const _NOEXCEPT
 
allocator_type get_allocator () const _NOEXCEPT
 
key_compare key_comp () const
 
value_compare value_comp () const
 
size_type bucket_count () const _NOEXCEPT
 
size_type max_bucket_count () const _NOEXCEPT
 
size_type bucket (const key_type &_Keyval) const
 
size_type bucket_size (size_type _Bucket) const
 
local_iterator begin (size_type _Bucket)
 
const_local_iterator begin (size_type _Bucket) const
 
local_iterator end (size_type _Bucket)
 
const_local_iterator end (size_type _Bucket) const
 
const_local_iterator cbegin (size_type _Bucket) const _NOEXCEPT
 
const_local_iterator cend (size_type _Bucket) const _NOEXCEPT
 
float load_factor () const _NOEXCEPT
 
float max_load_factor () const _NOEXCEPT
 
void max_load_factor (float _Newmax)
 
void rehash (size_type _Buckets)
 
void reserve (size_type _Maxcount)
 
_Pairib insert (const value_type &_Val)
 
iterator insert (const_iterator, const value_type &_Val)
 
template<class _Iter >
void insert (_Iter _First, _Iter _Last)
 
void insert (_XSTD initializer_list< value_type > _Ilist)
 
iterator erase (const_iterator _Plist)
 
iterator erase (const_iterator _First, const_iterator _Last)
 
size_type erase (const key_type &_Keyval)
 
void clear () _NOEXCEPT
 
iterator find (const key_type &_Keyval)
 
const_iterator find (const key_type &_Keyval) const
 
size_type count (const key_type &_Keyval) const
 
iterator lower_bound (const key_type &_Keyval)
 
const_iterator lower_bound (const key_type &_Keyval) const
 
iterator upper_bound (const key_type &_Keyval)
 
const_iterator upper_bound (const key_type &_Keyval) const
 
_Pairii equal_range (const key_type &_Keyval)
 
_Paircc equal_range (const key_type &_Keyval) const
 
void swap (_Myt &_Right)
 

Additional Inherited Members

- Protected Member Functions inherited from _Hash< _Traits >
template<class _Valty >
_Unchecked_iterator _Buynode_if_nil (_Valty &&, _Unchecked_iterator _Plist)
 
template<class _Valty >
_Unchecked_iterator _Buynode_if_nil (_Valty &&_Val, _Nil)
 
void _Destroy_if_not_nil (_Unchecked_iterator _Plist)
 
void _Destroy_if_not_nil (_Nil)
 
template<class _Valty , class _Nodety >
_Pairib _Insert (_Valty &&_Val, _Nodety _Pnode)
 
_Unchecked_iterator_Vec_lo (size_type _Bucket)
 
_Unchecked_const_iterator_Vec_lo (size_type _Bucket) const
 
_Unchecked_iterator_Vec_hi (size_type _Bucket)
 
_Unchecked_const_iterator_Vec_hi (size_type _Bucket) const
 
_Unchecked_iterator _Begin (size_type _Bucket)
 
_Unchecked_const_iterator _Begin (size_type _Bucket) const
 
_Unchecked_iterator _End (size_type _Bucket)
 
_Unchecked_const_iterator _End (size_type _Bucket) const
 
void _Erase_bucket (iterator _Plist_arg, size_type _Bucket)
 
void _Insert_bucket (_Unchecked_iterator _Plist, _Unchecked_iterator _Where, size_type _Bucket)
 
void _Copy (const _Myt &_Right)
 
size_type _Hashval (const key_type &_Keyval) const
 
void _Init (size_type _Buckets=_Min_buckets)
 
void _Check_size ()
 
void _Reinsert ()
 
- Protected Attributes inherited from _Hash< _Traits >
_Mylist _List
 
_Myvec _Vec
 
size_type _Mask
 
size_type _Maxidx
 
float _Max_bucket_size
 

Member Typedef Documentation

template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Hash<_Hmap_traits<_Kty, _Ty, _Tr, _Alloc, false> > stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::_Mybase
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef hash_map<_Kty, _Ty, _Tr, _Alloc> stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::_Myt
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::allocator_type stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::allocator_type
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::const_iterator stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::const_iterator
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::const_pointer stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::const_pointer
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::const_reference stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::const_reference
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::const_reverse_iterator stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::const_reverse_iterator
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::difference_type stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::difference_type
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::iterator stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::iterator
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Tr stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::key_compare
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Kty stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::key_type
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Ty stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::mapped_type
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::pointer stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::pointer
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::reference stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::reference
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Ty stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::referent_type
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::reverse_iterator stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::reverse_iterator
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::size_type stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::size_type
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::value_compare stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::value_compare
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::value_type stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::value_type

Constructor & Destructor Documentation

template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::hash_map ( )
inline
111  { // construct empty map from defaults
112  }
_Hash< _Hmap_traits< _Kty, _Ty, _Tr, _Alloc, false > > _Mybase
Definition: hash_map:89
_Tr key_compare
Definition: hash_map:93
_Mybase::allocator_type allocator_type
Definition: hash_map:95
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::hash_map ( const allocator_type _Al)
inlineexplicit
115  : _Mybase(key_compare(), _Al)
116  { // construct empty map from defaults, allocator
117  }
_Hash< _Hmap_traits< _Kty, _Ty, _Tr, _Alloc, false > > _Mybase
Definition: hash_map:89
_Tr key_compare
Definition: hash_map:93
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::hash_map ( const _Myt _Right)
inline
121  : _Mybase(_Right,
122  _Right._List._Getal().select_on_container_copy_construction())
123 
124 
125  { // construct map by copying _Right
126  }
_Hash< _Hmap_traits< _Kty, _Ty, _Tr, _Alloc, false > > _Mybase
Definition: hash_map:89
const _Ty & _Right
Definition: algorithm:4087
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::hash_map ( const _Myt _Right,
const allocator_type _Al 
)
inline
129  : _Mybase(_Right, _Al)
130  { // construct map by copying _Right, allocator
131  }
_Hash< _Hmap_traits< _Kty, _Ty, _Tr, _Alloc, false > > _Mybase
Definition: hash_map:89
const _Ty & _Right
Definition: algorithm:4087
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::hash_map ( const key_compare _Traits)
inlineexplicit
134  : _Mybase(_Traits, allocator_type())
135  { // construct empty map from comparator
136  }
_Hash< _Hmap_traits< _Kty, _Ty, _Tr, _Alloc, false > > _Mybase
Definition: hash_map:89
_Mybase::allocator_type allocator_type
Definition: hash_map:95
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::hash_map ( const key_compare _Traits,
const allocator_type _Al 
)
inline
139  : _Mybase(_Traits, _Al)
140  { // construct empty map from comparator and allocator
141  }
_Hash< _Hmap_traits< _Kty, _Ty, _Tr, _Alloc, false > > _Mybase
Definition: hash_map:89
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
template<class _Iter >
stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::hash_map ( _Iter  _First,
_Iter  _Last 
)
inline
146  { // construct map from sequence, defaults
147  _Mybase::insert(_First, _Last);
148  }
_Hash< _Hmap_traits< _Kty, _Ty, _Tr, _Alloc, false > > _Mybase
Definition: hash_map:89
_Tr key_compare
Definition: hash_map:93
_Pairib insert(value_type &&_Val)
Definition: xhash:363
_Mybase::allocator_type allocator_type
Definition: hash_map:95
_FwdIt _Last
Definition: algorithm:1936
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
template<class _Iter >
stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::hash_map ( _Iter  _First,
_Iter  _Last,
const key_compare _Traits 
)
inline
153  : _Mybase(_Traits, allocator_type())
154  { // construct map from sequence, comparator
155  _Mybase::insert(_First, _Last);
156  }
_Hash< _Hmap_traits< _Kty, _Ty, _Tr, _Alloc, false > > _Mybase
Definition: hash_map:89
_Pairib insert(value_type &&_Val)
Definition: xhash:363
_Mybase::allocator_type allocator_type
Definition: hash_map:95
_FwdIt _Last
Definition: algorithm:1936
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
template<class _Iter >
stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::hash_map ( _Iter  _First,
_Iter  _Last,
const key_compare _Traits,
const allocator_type _Al 
)
inline
162  : _Mybase(_Traits, _Al)
163  { // construct map from sequence, comparator, and allocator
164  _Mybase::insert(_First, _Last);
165  }
_Hash< _Hmap_traits< _Kty, _Ty, _Tr, _Alloc, false > > _Mybase
Definition: hash_map:89
_Pairib insert(value_type &&_Val)
Definition: xhash:363
_FwdIt _Last
Definition: algorithm:1936
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::hash_map ( _Myt &&  _Right)
inline
174  : _Mybase(_STD move(_Right), _Right._List._Getal())
175  { // construct map by moving _Right
176  }
_Hash< _Hmap_traits< _Kty, _Ty, _Tr, _Alloc, false > > _Mybase
Definition: hash_map:89
_OutIt move(_InIt _First, _InIt _Last, _OutIt _Dest)
Definition: xutility:2447
const _Ty & _Right
Definition: algorithm:4087
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::hash_map ( _Myt &&  _Right,
const allocator_type _Al 
)
inline
179  : _Mybase(_STD move(_Right), _Al)
180  { // construct map by moving _Right, allocator
181  }
_Hash< _Hmap_traits< _Kty, _Ty, _Tr, _Alloc, false > > _Mybase
Definition: hash_map:89
_OutIt move(_InIt _First, _InIt _Last, _OutIt _Dest)
Definition: xutility:2447
const _Ty & _Right
Definition: algorithm:4087
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::hash_map ( _XSTD initializer_list< value_type _Ilist)
inline
207  { // construct from initializer_list, defaults
208  this->insert(_Ilist.begin(), _Ilist.end());
209  }
_Hash< _Hmap_traits< _Kty, _Ty, _Tr, _Alloc, false > > _Mybase
Definition: hash_map:89
_Tr key_compare
Definition: hash_map:93
_Pairib insert(value_type &&_Val)
Definition: xhash:363
_Mybase::allocator_type allocator_type
Definition: hash_map:95
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::hash_map ( _XSTD initializer_list< value_type _Ilist,
const key_compare _Pred 
)
inline
214  { // construct from initializer_list, comparator
215  this->insert(_Ilist.begin(), _Ilist.end());
216  }
_FwdIt const _Ty _Pr _Pred
Definition: algorithm:1985
_Hash< _Hmap_traits< _Kty, _Ty, _Tr, _Alloc, false > > _Mybase
Definition: hash_map:89
_Pairib insert(value_type &&_Val)
Definition: xhash:363
_Mybase::allocator_type allocator_type
Definition: hash_map:95
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::hash_map ( _XSTD initializer_list< value_type _Ilist,
const key_compare _Pred,
const allocator_type _Al 
)
inline
220  : _Mybase(_Pred, _Al)
221  { // construct from initializer_list, comparator, and allocator
222  this->insert(_Ilist.begin(), _Ilist.end());
223  }
_FwdIt const _Ty _Pr _Pred
Definition: algorithm:1985
_Hash< _Hmap_traits< _Kty, _Ty, _Tr, _Alloc, false > > _Mybase
Definition: hash_map:89
_Pairib insert(value_type &&_Val)
Definition: xhash:363

Member Function Documentation

template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
mapped_type& stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::at ( const key_type _Keyval)
inline
249  { // find element matching _Keyval
250  iterator _Where = this->lower_bound(_Keyval);
251  if (_Where == this->end())
252  _Xout_of_range("invalid hash_map<K, T> key");
253  return (_Where->second);
254  }
Definition: xutility:337
iterator lower_bound(const key_type &_Keyval)
Definition: xhash:739
iterator end() _NOEXCEPT
Definition: xhash:428
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
const mapped_type& stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::at ( const key_type _Keyval) const
inline
257  { // find element matching _Keyval
258  const_iterator _Where = this->lower_bound(_Keyval);
259  if (_Where == this->end())
260  _Xout_of_range("invalid hash_map<K, T> key");
261  return (_Where->second);
262  }
iterator lower_bound(const key_type &_Keyval)
Definition: xhash:739
_Mybase::const_iterator const_iterator
Definition: hash_map:103
iterator end() _NOEXCEPT
Definition: xhash:428
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
_Myt& stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::operator= ( const _Myt _Right)
inline
168  { // assign by copying _Right
170  return (*this);
171  }
_Myt & operator=(_Myt &&_Right)
Definition: xhash:350
const _Ty & _Right
Definition: algorithm:4087
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
_Myt& stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::operator= ( _Myt &&  _Right)
inline
184  { // assign by moving _Right
186  return (*this);
187  }
_Myt & operator=(_Myt &&_Right)
Definition: xhash:350
_OutIt move(_InIt _First, _InIt _Last, _OutIt _Dest)
Definition: xutility:2447
const _Ty & _Right
Definition: algorithm:4087
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
_Myt& stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::operator= ( _XSTD initializer_list< value_type _Ilist)
inline
226  { // assign initializer_list
227  this->clear();
228  this->insert(_Ilist.begin(), _Ilist.end());
229  return (*this);
230  }
void clear() _NOEXCEPT
Definition: xhash:715
_Pairib insert(value_type &&_Val)
Definition: xhash:363
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
mapped_type& stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::operator[] ( key_type &&  _Keyval)
inline
190  { // find element matching _Keyval or insert with default mapped
191  iterator _Where = this->lower_bound(_Keyval);
192  if (_Where == this->end())
193  _Where = this->insert(
195  _STD move(_Keyval),
196  mapped_type())).first;
197  return (_Where->second);
198  }
Definition: xutility:337
_OutIt move(_InIt _First, _InIt _Last, _OutIt _Dest)
Definition: xutility:2447
iterator lower_bound(const key_type &_Keyval)
Definition: xhash:739
_Ty1 first
Definition: utility:198
_Pairib insert(value_type &&_Val)
Definition: xhash:363
iterator end() _NOEXCEPT
Definition: xhash:428
Definition: utility:80
_Ty mapped_type
Definition: hash_map:91
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
mapped_type& stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::operator[] ( const key_type _Keyval)
inline
238  { // find element matching _Keyval or insert with default mapped
239  iterator _Where = this->lower_bound(_Keyval);
240  if (_Where == this->end())
241  _Where = this->insert(
243  _Keyval,
244  mapped_type())).first;
245  return (_Where->second);
246  }
Definition: xutility:337
iterator lower_bound(const key_type &_Keyval)
Definition: xhash:739
_Ty1 first
Definition: utility:198
_Pairib insert(value_type &&_Val)
Definition: xhash:363
iterator end() _NOEXCEPT
Definition: xhash:428
Definition: utility:80
_Ty mapped_type
Definition: hash_map:91
template<class _Kty, class _Ty, class _Tr = hash_compare<_Kty, less<_Kty> >, class _Alloc = allocator<pair<const _Kty, _Ty> >>
void stdext::hash_map< _Kty, _Ty, _Tr, _Alloc >::swap ( _Myt _Right)
inline
201  { // exchange contents with non-movable _Right
203  }
void swap(_Myt &_Right)
Definition: xhash:821
const _Ty & _Right
Definition: algorithm:4087

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