ReactOS 0.4.16-dev-981-g80eb313
Public Types | Public Member Functions | Private Types | Private Attributes | List of all members
hash_map< _Key, _Tp,,, > Class Template Reference

#include <_hash_map.h>

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

Public Types

typedef _Key key_type
 
typedef _Tp data_type
 
typedef _Tp mapped_type
 
typedef pair< _STLP_CONST key_type, data_type > value_type
 
typedef hashtable< value_type, key_type, _HashFcn, _HashMapTraits, _STLP_SELECT1ST(value_type, _Key), _EqualKey, _Alloc > _Ht
 
typedef _Ht::hasher hasher
 
typedef _Ht::key_equal key_equal
 
typedef _Ht::size_type size_type
 
typedef _Ht::difference_type difference_type
 
typedef _Ht::pointer pointer
 
typedef _Ht::const_pointer const_pointer
 
typedef _Ht::reference reference
 
typedef _Ht::const_reference const_reference
 
typedef _Ht::iterator iterator
 
typedef _Ht::const_iterator const_iterator
 
typedef _Ht::allocator_type allocator_type
 

Public Member Functions

hasher hash_funct () const
 
key_equal key_eq () const
 
allocator_type get_allocator () const
 
 hash_map ()
 
 hash_map (size_type __n)
 
 hash_map (size_type __n, const hasher &__hf)
 
 hash_map (size_type __n, const hasher &__hf, const key_equal &__eql, const allocator_type &__a=allocator_type())
 
 hash_map (__move_source< _Self > src)
 
 hash_map (const value_type *__f, const value_type *__l)
 
 hash_map (const value_type *__f, const value_type *__l, size_type __n)
 
 hash_map (const value_type *__f, const value_type *__l, size_type __n, const hasher &__hf)
 
 hash_map (const value_type *__f, const value_type *__l, size_type __n, const hasher &__hf, const key_equal &__eql, const allocator_type &__a=allocator_type())
 
 hash_map (const_iterator __f, const_iterator __l)
 
 hash_map (const_iterator __f, const_iterator __l, size_type __n)
 
 hash_map (const_iterator __f, const_iterator __l, size_type __n, const hasher &__hf)
 
 hash_map (const_iterator __f, const_iterator __l, size_type __n, const hasher &__hf, const key_equal &__eql, const allocator_type &__a=allocator_type())
 
size_type size () const
 
size_type max_size () const
 
bool empty () const
 
void swap (_Self &__hs)
 
iterator begin ()
 
iterator end ()
 
const_iterator begin () const
 
const_iterator end () const
 
pair< iterator, bool > insert (const value_type &__obj)
 
void insert (const value_type *__f, const value_type *__l)
 
void insert (const_iterator __f, const_iterator __l)
 
pair< iterator, bool > insert_noresize (const value_type &__obj)
 
_STLP_TEMPLATE_FOR_CONT_EXT iterator find (const _KT &__key)
 
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator find (const _KT &__key) const
 
_STLP_TEMPLATE_FOR_CONT_EXT _Tp & operator[] (const _KT &__key)
 
_STLP_TEMPLATE_FOR_CONT_EXT size_type count (const _KT &__key) const
 
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iterator > equal_range (const _KT &__key)
 
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iterator > equal_range (const _KT &__key) const
 
_STLP_TEMPLATE_FOR_CONT_EXT size_type erase (const _KT &__key)
 
void erase (iterator __it)
 
void erase (iterator __f, iterator __l)
 
void clear ()
 
void resize (size_type __hint)
 
size_type bucket_count () const
 
size_type max_bucket_count () const
 
size_type elems_in_bucket (size_type __n) const
 

Private Types

typedef hash_map< _Key, _Tp, _HashFcn, _EqualKey, _Alloc > _Self
 
typedef _STLP_PRIV _HashMapTraitsT< value_type > _HashMapTraits
 

Private Attributes

_Ht _M_ht
 

Detailed Description

template<class _Key, class _Tp, _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >), _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >), _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp)>
class hash_map< _Key, _Tp,,, >

Definition at line 45 of file _hash_map.h.

Member Typedef Documentation

◆ _HashMapTraits

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _STLP_PRIV _HashMapTraitsT<value_type> hash_map< _Key, _Tp,,, >::_HashMapTraits
private

Definition at line 59 of file _hash_map.h.

◆ _Ht

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef hashtable<value_type, key_type, _HashFcn, _HashMapTraits, _STLP_SELECT1ST(value_type, _Key), _EqualKey, _Alloc > hash_map< _Key, _Tp,,, >::_Ht

Definition at line 63 of file _hash_map.h.

◆ _Self

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef hash_map<_Key, _Tp, _HashFcn, _EqualKey, _Alloc> hash_map< _Key, _Tp,,, >::_Self
private

Definition at line 51 of file _hash_map.h.

◆ allocator_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::allocator_type hash_map< _Key, _Tp,,, >::allocator_type

Definition at line 78 of file _hash_map.h.

◆ const_iterator

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::const_iterator hash_map< _Key, _Tp,,, >::const_iterator

Definition at line 76 of file _hash_map.h.

◆ const_pointer

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::const_pointer hash_map< _Key, _Tp,,, >::const_pointer

Definition at line 71 of file _hash_map.h.

◆ const_reference

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::const_reference hash_map< _Key, _Tp,,, >::const_reference

Definition at line 73 of file _hash_map.h.

◆ data_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Tp hash_map< _Key, _Tp,,, >::data_type

Definition at line 54 of file _hash_map.h.

◆ difference_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::difference_type hash_map< _Key, _Tp,,, >::difference_type

Definition at line 69 of file _hash_map.h.

◆ hasher

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::hasher hash_map< _Key, _Tp,,, >::hasher

Definition at line 65 of file _hash_map.h.

◆ iterator

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::iterator hash_map< _Key, _Tp,,, >::iterator

Definition at line 75 of file _hash_map.h.

◆ key_equal

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::key_equal hash_map< _Key, _Tp,,, >::key_equal

Definition at line 66 of file _hash_map.h.

◆ key_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Key hash_map< _Key, _Tp,,, >::key_type

Definition at line 53 of file _hash_map.h.

◆ mapped_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Tp hash_map< _Key, _Tp,,, >::mapped_type

Definition at line 55 of file _hash_map.h.

◆ pointer

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::pointer hash_map< _Key, _Tp,,, >::pointer

Definition at line 70 of file _hash_map.h.

◆ reference

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::reference hash_map< _Key, _Tp,,, >::reference

Definition at line 72 of file _hash_map.h.

◆ size_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef _Ht::size_type hash_map< _Key, _Tp,,, >::size_type

Definition at line 68 of file _hash_map.h.

◆ value_type

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
typedef pair<_STLP_CONST key_type, data_type> hash_map< _Key, _Tp,,, >::value_type

Definition at line 56 of file _hash_map.h.

Constructor & Destructor Documentation

◆ hash_map() [1/13]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
hash_map< _Key, _Tp,,, >::hash_map ( )
inline

Definition at line 88 of file _hash_map.h.

88: _M_ht(0, hasher(), key_equal(), allocator_type()) {}
hash_map::allocator_type
_Ht::allocator_type allocator_type
Definition: _hash_map.h:78
hash_map::hasher
_Ht::hasher hasher
Definition: _hash_map.h:65
hash_map::key_equal
_Ht::key_equal key_equal
Definition: _hash_map.h:66
hash_map::_M_ht
_Ht _M_ht
Definition: _hash_map.h:85

◆ hash_map() [2/13]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
hash_map< _Key, _Tp,,, >::hash_map ( size_type  __n)
inlineexplicit

Definition at line 89 of file _hash_map.h.

90 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
__n
return __n
Definition: _algo.h:75

◆ hash_map() [3/13]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
hash_map< _Key, _Tp,,, >::hash_map ( size_type  __n,
const hasher &  __hf 
)
inline

Definition at line 91 of file _hash_map.h.

92 : _M_ht(__n, __hf, key_equal(), allocator_type()) {}

◆ hash_map() [4/13]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
hash_map< _Key, _Tp,,, >::hash_map ( size_type  __n,
const hasher &  __hf,
const key_equal &  __eql,
const allocator_type &  __a = allocator_type() 
)
inline

Definition at line 93 of file _hash_map.h.

95 : _M_ht(__n, __hf, __eql, __a) {}

◆ hash_map() [5/13]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
hash_map< _Key, _Tp,,, >::hash_map ( __move_source< _Self >  src)
inline

Definition at line 98 of file _hash_map.h.

99 : _M_ht(__move_source<_Ht>(src.get()._M_ht)) {
100 }
__move_source
Definition: _move_construct_fwk.h:35
src
GLenum src
Definition: glext.h:6340

◆ hash_map() [6/13]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
hash_map< _Key, _Tp,,, >::hash_map ( const value_type *  __f,
const value_type *  __l 
)
inline

Definition at line 132 of file _hash_map.h.

133 : _M_ht(0, hasher(), key_equal(), allocator_type())
134 { _M_ht.insert_unique(__f, __l); }
hashtable::insert_unique
pair< iterator, bool > insert_unique(const value_type &__obj)
Definition: _hashtable.h:407

◆ hash_map() [7/13]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
hash_map< _Key, _Tp,,, >::hash_map ( const value_type *  __f,
const value_type *  __l,
size_type  __n 
)
inline

Definition at line 135 of file _hash_map.h.

136 : _M_ht(__n, hasher(), key_equal(), allocator_type())
137 { _M_ht.insert_unique(__f, __l); }

◆ hash_map() [8/13]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
hash_map< _Key, _Tp,,, >::hash_map ( const value_type *  __f,
const value_type *  __l,
size_type  __n,
const hasher &  __hf 
)
inline

Definition at line 138 of file _hash_map.h.

140 : _M_ht(__n, __hf, key_equal(), allocator_type())
141 { _M_ht.insert_unique(__f, __l); }

◆ hash_map() [9/13]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
hash_map< _Key, _Tp,,, >::hash_map ( const value_type *  __f,
const value_type *  __l,
size_type  __n,
const hasher &  __hf,
const key_equal &  __eql,
const allocator_type &  __a = allocator_type() 
)
inline

Definition at line 142 of file _hash_map.h.

145 : _M_ht(__n, __hf, __eql, __a)
146 { _M_ht.insert_unique(__f, __l); }

◆ hash_map() [10/13]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
hash_map< _Key, _Tp,,, >::hash_map ( const_iterator  __f,
const_iterator  __l 
)
inline

Definition at line 148 of file _hash_map.h.

149 : _M_ht(0, hasher(), key_equal(), allocator_type())
150 { _M_ht.insert_unique(__f, __l); }

◆ hash_map() [11/13]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
hash_map< _Key, _Tp,,, >::hash_map ( const_iterator  __f,
const_iterator  __l,
size_type  __n 
)
inline

Definition at line 151 of file _hash_map.h.

152 : _M_ht(__n, hasher(), key_equal(), allocator_type())
153 { _M_ht.insert_unique(__f, __l); }

◆ hash_map() [12/13]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
hash_map< _Key, _Tp,,, >::hash_map ( const_iterator  __f,
const_iterator  __l,
size_type  __n,
const hasher &  __hf 
)
inline

Definition at line 154 of file _hash_map.h.

156 : _M_ht(__n, __hf, key_equal(), allocator_type())
157 { _M_ht.insert_unique(__f, __l); }

◆ hash_map() [13/13]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
hash_map< _Key, _Tp,,, >::hash_map ( const_iterator  __f,
const_iterator  __l,
size_type  __n,
const hasher &  __hf,
const key_equal &  __eql,
const allocator_type &  __a = allocator_type() 
)
inline

Definition at line 158 of file _hash_map.h.

161 : _M_ht(__n, __hf, __eql, __a)
162 { _M_ht.insert_unique(__f, __l); }

Member Function Documentation

◆ begin() [1/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
iterator hash_map< _Key, _Tp,,, >::begin ( )
inline

Definition at line 173 of file _hash_map.h.

173{ return _M_ht.begin(); }
hashtable::begin
iterator begin()
Definition: _hashtable.h:376

◆ begin() [2/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
const_iterator hash_map< _Key, _Tp,,, >::begin ( ) const
inline

Definition at line 175 of file _hash_map.h.

175{ return _M_ht.begin(); }

◆ bucket_count()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
size_type hash_map< _Key, _Tp,,, >::bucket_count ( ) const
inline

Definition at line 224 of file _hash_map.h.

224{ return _M_ht.bucket_count(); }
hashtable::bucket_count
size_type bucket_count() const
Definition: _hashtable.h:391

◆ clear()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void hash_map< _Key, _Tp,,, >::clear ( )
inline

Definition at line 221 of file _hash_map.h.

221{ _M_ht.clear(); }
hashtable::clear
void clear()
Definition: _hashtable.c:501

◆ count()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT size_type hash_map< _Key, _Tp,,, >::count ( const _KT &  __key) const
inline

Definition at line 208 of file _hash_map.h.

208{ return _M_ht.count(__key); }
hashtable::count
_STLP_TEMPLATE_FOR_CONT_EXT size_type count(const _KT &__key) const
Definition: _hashtable.h:516

◆ elems_in_bucket()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
size_type hash_map< _Key, _Tp,,, >::elems_in_bucket ( size_type  __n) const
inline

Definition at line 226 of file _hash_map.h.

227 { return _M_ht.elems_in_bucket(__n); }
hashtable::elems_in_bucket
size_type elems_in_bucket(size_type __bucket) const
Definition: _hashtable.h:393

◆ empty()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
bool hash_map< _Key, _Tp,,, >::empty ( ) const
inline

Definition at line 168 of file _hash_map.h.

168{ return _M_ht.empty(); }
hashtable::empty
bool empty() const
Definition: _hashtable.h:365

Referenced by __release_category().

◆ end() [1/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
iterator hash_map< _Key, _Tp,,, >::end ( )
inline

Definition at line 174 of file _hash_map.h.

174{ return _M_ht.end(); }
hashtable::end
iterator end()
Definition: _hashtable.h:377

Referenced by __release_category(), and _Catalog_locale_map::lookup().

◆ end() [2/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
const_iterator hash_map< _Key, _Tp,,, >::end ( ) const
inline

Definition at line 176 of file _hash_map.h.

176{ return _M_ht.end(); }

◆ equal_range() [1/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iterator > hash_map< _Key, _Tp,,, >::equal_range ( const _KT &  __key)
inline

Definition at line 211 of file _hash_map.h.

212 { return _M_ht.equal_range(__key); }
hashtable::equal_range
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iterator > equal_range(const _KT &__key)
Definition: _hashtable.h:534

◆ equal_range() [2/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iterator > hash_map< _Key, _Tp,,, >::equal_range ( const _KT &  __key) const
inline

Definition at line 214 of file _hash_map.h.

215 { return _M_ht.equal_range(__key); }

◆ erase() [1/3]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT size_type hash_map< _Key, _Tp,,, >::erase ( const _KT &  __key)
inline

Definition at line 218 of file _hash_map.h.

218{return _M_ht.erase(__key); }
hashtable::erase
size_type erase(const key_type &__key)
Definition: _hashtable.c:263

Referenced by __release_category(), and _Catalog_locale_map::erase().

◆ erase() [2/3]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void hash_map< _Key, _Tp,,, >::erase ( iterator  __f,
iterator  __l 
)
inline

Definition at line 220 of file _hash_map.h.

220{ _M_ht.erase(__f, __l); }

◆ erase() [3/3]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void hash_map< _Key, _Tp,,, >::erase ( iterator  __it)
inline

Definition at line 219 of file _hash_map.h.

219{ _M_ht.erase(__it); }
__it
_STLP_MOVE_TO_PRIV_NAMESPACE const _InputIterator const input_iterator_tag &_InputIterator __it(__first)

◆ find() [1/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT iterator hash_map< _Key, _Tp,,, >::find ( const _KT &  __key)
inline

Definition at line 195 of file _hash_map.h.

195{ return _M_ht.find(__key); }
hashtable::find
_STLP_TEMPLATE_FOR_CONT_EXT iterator find(const _KT &__key)
Definition: _hashtable.h:511

Referenced by __release_category(), and _Catalog_locale_map::lookup().

◆ find() [2/2]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator hash_map< _Key, _Tp,,, >::find ( const _KT &  __key) const
inline

Definition at line 197 of file _hash_map.h.

197{ return _M_ht.find(__key); }

◆ get_allocator()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
allocator_type hash_map< _Key, _Tp,,, >::get_allocator ( ) const
inline

Definition at line 82 of file _hash_map.h.

82{ return _M_ht.get_allocator(); }
hashtable::get_allocator
allocator_type get_allocator() const
Definition: _hashtable.h:300

◆ hash_funct()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
hasher hash_map< _Key, _Tp,,, >::hash_funct ( ) const
inline

Definition at line 80 of file _hash_map.h.

80{ return _M_ht.hash_funct(); }
hashtable::hash_funct
hasher hash_funct() const
Definition: _hashtable.h:246

◆ insert() [1/3]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
pair< iterator, bool > hash_map< _Key, _Tp,,, >::insert ( const value_type &  __obj)
inline

Definition at line 179 of file _hash_map.h.

180 { return _M_ht.insert_unique(__obj); }

Referenced by _Catalog_locale_map::insert().

◆ insert() [2/3]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void hash_map< _Key, _Tp,,, >::insert ( const value_type *  __f,
const value_type *  __l 
)
inline

Definition at line 186 of file _hash_map.h.

187 { _M_ht.insert_unique(__f,__l); }

◆ insert() [3/3]

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void hash_map< _Key, _Tp,,, >::insert ( const_iterator  __f,
const_iterator  __l 
)
inline

Definition at line 188 of file _hash_map.h.

189 { _M_ht.insert_unique(__f, __l); }

◆ insert_noresize()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
pair< iterator, bool > hash_map< _Key, _Tp,,, >::insert_noresize ( const value_type &  __obj)
inline

Definition at line 191 of file _hash_map.h.

192 { return _M_ht.insert_unique_noresize(__obj); }
hashtable::insert_unique_noresize
pair< iterator, bool > insert_unique_noresize(const value_type &__obj)
Definition: _hashtable.c:199

◆ key_eq()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
key_equal hash_map< _Key, _Tp,,, >::key_eq ( ) const
inline

Definition at line 81 of file _hash_map.h.

81{ return _M_ht.key_eq(); }
hashtable::key_eq
key_equal key_eq() const
Definition: _hashtable.h:247

◆ max_bucket_count()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
size_type hash_map< _Key, _Tp,,, >::max_bucket_count ( ) const
inline

Definition at line 225 of file _hash_map.h.

225{ return _M_ht.max_bucket_count(); }
hashtable::max_bucket_count
size_type max_bucket_count() const
Definition: _hashtable.h:392

◆ max_size()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
size_type hash_map< _Key, _Tp,,, >::max_size ( ) const
inline

Definition at line 167 of file _hash_map.h.

167{ return _M_ht.max_size(); }
hashtable::max_size
size_type max_size() const
Definition: _hashtable.h:364

◆ operator[]()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_STLP_TEMPLATE_FOR_CONT_EXT _Tp & hash_map< _Key, _Tp,,, >::operator[] ( const _KT &  __key)
inline

Definition at line 200 of file _hash_map.h.

200 {
201 iterator __it = _M_ht.find(__key);
202 return (__it == _M_ht.end() ?
203 _M_ht._M_insert(value_type(__key, _STLP_DEFAULT_CONSTRUCTED(_Tp))).second :
204 (*__it).second );
205 }
_STLP_DEFAULT_CONSTRUCTED
#define _STLP_DEFAULT_CONSTRUCTED(_TTp)
Definition: _construct.h:265
hash_map::value_type
pair< _STLP_CONST key_type, data_type > value_type
Definition: _hash_map.h:56
hashtable::_M_insert
reference _M_insert(const value_type &__obj)
Definition: _hashtable.c:254

◆ resize()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void hash_map< _Key, _Tp,,, >::resize ( size_type  __hint)
inline

Definition at line 223 of file _hash_map.h.

223{ _M_ht.resize(__hint); }
hashtable::resize
void resize(size_type __num_buckets_hint)
Definition: _hashtable.h:580

◆ size()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
size_type hash_map< _Key, _Tp,,, >::size ( ) const
inline

Definition at line 166 of file _hash_map.h.

166{ return _M_ht.size(); }
hashtable::size
size_type size() const
Definition: _hashtable.h:363

◆ swap()

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
void hash_map< _Key, _Tp,,, >::swap ( _Self &  __hs)
inline

Definition at line 169 of file _hash_map.h.

169{ _M_ht.swap(__hs._M_ht); }
hashtable::swap
void swap(_Self &__ht)
Definition: _hashtable.h:367

Member Data Documentation

◆ _M_ht

template<class _Key , class _Tp , _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) >
_Ht hash_map< _Key, _Tp,,, >::_M_ht
private

Definition at line 85 of file _hash_map.h.

Referenced by hash_map< _Key, _Tp,,, >::begin(), hash_map< _Key, _Tp,,, >::bucket_count(), hash_map< _Key, _Tp,,, >::clear(), hash_map< _Key, _Tp,,, >::count(), hash_map< _Key, _Tp,,, >::elems_in_bucket(), hash_map< _Key, _Tp,,, >::empty(), hash_map< _Key, _Tp,,, >::end(), hash_map< _Key, _Tp,,, >::equal_range(), hash_map< _Key, _Tp,,, >::erase(), hash_map< _Key, _Tp,,, >::find(), hash_map< _Key, _Tp,,, >::get_allocator(), hash_map< _Key, _Tp,,, >::hash_funct(), hash_map< _Key, _Tp,,, >::hash_map(), hash_map< _Key, _Tp,,, >::insert(), hash_map< _Key, _Tp,,, >::insert_noresize(), hash_map< _Key, _Tp,,, >::key_eq(), hash_map< _Key, _Tp,,, >::max_bucket_count(), hash_map< _Key, _Tp,,, >::max_size(), hash_map< _Key, _Tp,,, >::operator[](), hash_map< _Key, _Tp,,, >::resize(), hash_map< _Key, _Tp,,, >::size(), and hash_map< _Key, _Tp,,, >::swap().

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