ReactOS  0.4.15-dev-3303-g1ade494
Public Types | Public Member Functions | Private Types | Private Attributes | List of all members
unordered_map< _Key, _Tp,,, > Class Template Reference

#include <_unordered_map.h>

Collaboration diagram for unordered_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, _UnorderedMapTraits, _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::local_iterator local_iterator
 
typedef _Ht::const_local_iterator const_local_iterator
 
typedef _Ht::allocator_type allocator_type
 

Public Member Functions

hasher hash_function () const
 
key_equal key_eq () const
 
allocator_type get_allocator () const
 
 unordered_map (size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
 
 unordered_map (__move_source< _Self > src)
 
 unordered_map (const value_type *__f, const value_type *__l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
 
 unordered_map (const_iterator __f, const_iterator __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
 
_Self & operator= (const _Self &__other)
 
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)
 
iterator insert (const_iterator, const value_type &__obj)
 
void insert (const value_type *__f, const value_type *__l)
 
void insert (const_iterator __f, const_iterator __l)
 
_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
 
size_type erase (const key_type &__key)
 
void erase (const_iterator __it)
 
void erase (const_iterator __f, const_iterator __l)
 
void clear ()
 
size_type bucket_count () const
 
size_type max_bucket_count () const
 
size_type bucket_size (size_type __n) const
 
_STLP_TEMPLATE_FOR_CONT_EXT size_type bucket (const _KT &__k) const
 
local_iterator begin (size_type __n)
 
local_iterator end (size_type __n)
 
const_local_iterator begin (size_type __n) const
 
const_local_iterator end (size_type __n) const
 
float load_factor () const
 
float max_load_factor () const
 
void max_load_factor (float __val)
 
void rehash (size_type __hint)
 

Private Types

typedef unordered_map< _Key, _Tp, _HashFcn, _EqualKey, _Alloc > _Self
 
typedef _STLP_PRIV _UnorderedMapTraitsT< value_type > _UnorderedMapTraits
 

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 unordered_map< _Key, _Tp,,, >

Definition at line 37 of file _unordered_map.h.

Member Typedef Documentation

◆ _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, _UnorderedMapTraits, _STLP_SELECT1ST(value_type, _Key), _EqualKey, _Alloc > unordered_map< _Key, _Tp,,, >::_Ht

Definition at line 55 of file _unordered_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 unordered_map<_Key, _Tp, _HashFcn, _EqualKey, _Alloc> unordered_map< _Key, _Tp,,, >::_Self
private

Definition at line 43 of file _unordered_map.h.

◆ _UnorderedMapTraits

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 _UnorderedMapTraitsT<value_type> unordered_map< _Key, _Tp,,, >::_UnorderedMapTraits
private

Definition at line 51 of file _unordered_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 unordered_map< _Key, _Tp,,, >::allocator_type

Definition at line 72 of file _unordered_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 unordered_map< _Key, _Tp,,, >::const_iterator

Definition at line 68 of file _unordered_map.h.

◆ const_local_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_local_iterator unordered_map< _Key, _Tp,,, >::const_local_iterator

Definition at line 70 of file _unordered_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 unordered_map< _Key, _Tp,,, >::const_pointer

Definition at line 63 of file _unordered_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 unordered_map< _Key, _Tp,,, >::const_reference

Definition at line 65 of file _unordered_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 unordered_map< _Key, _Tp,,, >::data_type

Definition at line 46 of file _unordered_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 unordered_map< _Key, _Tp,,, >::difference_type

Definition at line 61 of file _unordered_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 unordered_map< _Key, _Tp,,, >::hasher

Definition at line 57 of file _unordered_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 unordered_map< _Key, _Tp,,, >::iterator

Definition at line 67 of file _unordered_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 unordered_map< _Key, _Tp,,, >::key_equal

Definition at line 58 of file _unordered_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 unordered_map< _Key, _Tp,,, >::key_type

Definition at line 45 of file _unordered_map.h.

◆ local_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::local_iterator unordered_map< _Key, _Tp,,, >::local_iterator

Definition at line 69 of file _unordered_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 unordered_map< _Key, _Tp,,, >::mapped_type

Definition at line 47 of file _unordered_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 unordered_map< _Key, _Tp,,, >::pointer

Definition at line 62 of file _unordered_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 unordered_map< _Key, _Tp,,, >::reference

Definition at line 64 of file _unordered_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 unordered_map< _Key, _Tp,,, >::size_type

Definition at line 60 of file _unordered_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> unordered_map< _Key, _Tp,,, >::value_type

Definition at line 48 of file _unordered_map.h.

Constructor & Destructor Documentation

◆ unordered_map() [1/4]

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) >
unordered_map< _Key, _Tp,,, >::unordered_map ( size_type  __n = 0,
const hasher &  __hf = hasher(),
const key_equal &  __eql = key_equal(),
const allocator_type &  __a = allocator_type() 
)
inlineexplicit

Definition at line 83 of file _unordered_map.h.

86  : _M_ht(__n, __hf, __eql, __a) {}
__n
return __n
Definition: _algo.h:75
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ unordered_map() [2/4]

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) >
unordered_map< _Key, _Tp,,, >::unordered_map ( __move_source< _Self >  src)
inline

Definition at line 89 of file _unordered_map.h.

90  : _M_ht(__move_source<_Ht>(src.get()._M_ht)) {}
src
GLenum src
Definition: glext.h:6340
__move_source
Definition: _move_construct_fwk.h:35
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ unordered_map() [3/4]

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) >
unordered_map< _Key, _Tp,,, >::unordered_map ( const value_type *  __f,
const value_type *  __l,
size_type  __n = 0,
const hasher &  __hf = hasher(),
const key_equal &  __eql = key_equal(),
const allocator_type &  __a = allocator_type() 
)
inline

Definition at line 102 of file _unordered_map.h.

106  : _M_ht(__n, __hf, __eql, __a)
107  { _M_ht.insert_unique(__f, __l); }
__n
return __n
Definition: _algo.h:75
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79
hashtable::insert_unique
pair< iterator, bool > insert_unique(const value_type &__obj)
Definition: _hashtable.h:407

◆ unordered_map() [4/4]

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) >
unordered_map< _Key, _Tp,,, >::unordered_map ( const_iterator  __f,
const_iterator  __l,
size_type  __n = 0,
const hasher &  __hf = hasher(),
const key_equal &  __eql = key_equal(),
const allocator_type &  __a = allocator_type() 
)
inline

Definition at line 109 of file _unordered_map.h.

113  : _M_ht(__n, __hf, __eql, __a)
114  { _M_ht.insert_unique(__f, __l); }
__n
return __n
Definition: _algo.h:75
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79
hashtable::insert_unique
pair< iterator, bool > insert_unique(const value_type &__obj)
Definition: _hashtable.h:407

Member Function Documentation

◆ begin() [1/4]

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 unordered_map< _Key, _Tp,,, >::begin ( )
inline

Definition at line 128 of file _unordered_map.h.

128 { return _M_ht.begin(); }
hashtable::begin
iterator begin()
Definition: _hashtable.h:376
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ begin() [2/4]

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 unordered_map< _Key, _Tp,,, >::begin ( ) const
inline

Definition at line 130 of file _unordered_map.h.

130 { return _M_ht.begin(); }
hashtable::begin
iterator begin()
Definition: _hashtable.h:376
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ begin() [3/4]

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) >
local_iterator unordered_map< _Key, _Tp,,, >::begin ( size_type  __n)
inline

Definition at line 180 of file _unordered_map.h.

180 { return _M_ht.begin(__n); }
__n
return __n
Definition: _algo.h:75
hashtable::begin
iterator begin()
Definition: _hashtable.h:376
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ begin() [4/4]

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_local_iterator unordered_map< _Key, _Tp,,, >::begin ( size_type  __n) const
inline

Definition at line 182 of file _unordered_map.h.

182 { return _M_ht.begin(__n); }
__n
return __n
Definition: _algo.h:75
hashtable::begin
iterator begin()
Definition: _hashtable.h:376
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ 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) >
_STLP_TEMPLATE_FOR_CONT_EXT size_type unordered_map< _Key, _Tp,,, >::bucket ( const _KT &  __k) const
inline

Definition at line 179 of file _unordered_map.h.

179 { return _M_ht.bucket(__k); }
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79
hashtable::bucket
_STLP_TEMPLATE_FOR_CONT_EXT size_type bucket(const _KT &__k) const
Definition: _hashtable.h:397

◆ 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 unordered_map< _Key, _Tp,,, >::bucket_count ( ) const
inline

Definition at line 175 of file _unordered_map.h.

175 { return _M_ht.bucket_count(); }
hashtable::bucket_count
size_type bucket_count() const
Definition: _hashtable.h:391
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ bucket_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 unordered_map< _Key, _Tp,,, >::bucket_size ( size_type  __n) const
inline

Definition at line 177 of file _unordered_map.h.

177 { return _M_ht.elems_in_bucket(__n); }
__n
return __n
Definition: _algo.h:75
hashtable::elems_in_bucket
size_type elems_in_bucket(size_type __bucket) const
Definition: _hashtable.h:393
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ 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 unordered_map< _Key, _Tp,,, >::clear ( void  )
inline

Definition at line 173 of file _unordered_map.h.

173 { _M_ht.clear(); }
hashtable::clear
void clear()
Definition: _hashtable.c:501
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ 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 unordered_map< _Key, _Tp,,, >::count ( const _KT &  __key) const
inline

Definition at line 161 of file _unordered_map.h.

161 { return _M_ht.count(__key); }
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79
hashtable::count
_STLP_TEMPLATE_FOR_CONT_EXT size_type count(const _KT &__key) const
Definition: _hashtable.h:516

◆ 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 unordered_map< _Key, _Tp,,, >::empty ( ) const
inline

Definition at line 122 of file _unordered_map.h.

122 { return _M_ht.empty(); }
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79
hashtable::empty
bool empty() const
Definition: _hashtable.h:365

◆ end() [1/4]

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 unordered_map< _Key, _Tp,,, >::end ( )
inline

Definition at line 129 of file _unordered_map.h.

129 { return _M_ht.end(); }
hashtable::end
iterator end()
Definition: _hashtable.h:377
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ end() [2/4]

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 unordered_map< _Key, _Tp,,, >::end ( ) const
inline

Definition at line 131 of file _unordered_map.h.

131 { return _M_ht.end(); }
hashtable::end
iterator end()
Definition: _hashtable.h:377
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ end() [3/4]

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) >
local_iterator unordered_map< _Key, _Tp,,, >::end ( size_type  __n)
inline

Definition at line 181 of file _unordered_map.h.

181 { return _M_ht.end(__n); }
__n
return __n
Definition: _algo.h:75
hashtable::end
iterator end()
Definition: _hashtable.h:377
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ end() [4/4]

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_local_iterator unordered_map< _Key, _Tp,,, >::end ( size_type  __n) const
inline

Definition at line 183 of file _unordered_map.h.

183 { return _M_ht.end(__n); }
__n
return __n
Definition: _algo.h:75
hashtable::end
iterator end()
Definition: _hashtable.h:377
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ 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> unordered_map< _Key, _Tp,,, >::equal_range ( const _KT &  __key)
inline

Definition at line 164 of file _unordered_map.h.

165  { return _M_ht.equal_range(__key); }
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79
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> unordered_map< _Key, _Tp,,, >::equal_range ( const _KT &  __key) const
inline

Definition at line 167 of file _unordered_map.h.

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

◆ 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) >
size_type unordered_map< _Key, _Tp,,, >::erase ( const key_type &  __key)
inline

Definition at line 170 of file _unordered_map.h.

170 {return _M_ht.erase(__key); }
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79
hashtable::erase
size_type erase(const key_type &__key)
Definition: _hashtable.c:263

◆ 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 unordered_map< _Key, _Tp,,, >::erase ( const_iterator  __it)
inline

Definition at line 171 of file _unordered_map.h.

171 { _M_ht.erase(__it); }
__it
_STLP_MOVE_TO_PRIV_NAMESPACE const _InputIterator const input_iterator_tag &_InputIterator __it(__first)
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79
hashtable::erase
size_type erase(const key_type &__key)
Definition: _hashtable.c:263

◆ 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 unordered_map< _Key, _Tp,,, >::erase ( const_iterator  __f,
const_iterator  __l 
)
inline

Definition at line 172 of file _unordered_map.h.

172 { _M_ht.erase(__f, __l); }
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79
hashtable::erase
size_type erase(const key_type &__key)
Definition: _hashtable.c:263

◆ 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 unordered_map< _Key, _Tp,,, >::find ( const _KT &  __key)
inline

Definition at line 148 of file _unordered_map.h.

148 { return _M_ht.find(__key); }
hashtable::find
_STLP_TEMPLATE_FOR_CONT_EXT iterator find(const _KT &__key)
Definition: _hashtable.h:511
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ 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 unordered_map< _Key, _Tp,,, >::find ( const _KT &  __key) const
inline

Definition at line 150 of file _unordered_map.h.

150 { return _M_ht.find(__key); }
hashtable::find
_STLP_TEMPLATE_FOR_CONT_EXT iterator find(const _KT &__key)
Definition: _hashtable.h:511
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ 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 unordered_map< _Key, _Tp,,, >::get_allocator ( ) const
inline

Definition at line 76 of file _unordered_map.h.

76 { return _M_ht.get_allocator(); }
hashtable::get_allocator
allocator_type get_allocator() const
Definition: _hashtable.h:300
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ hash_function()

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 unordered_map< _Key, _Tp,,, >::hash_function ( ) const
inline

Definition at line 74 of file _unordered_map.h.

74 { return _M_ht.hash_funct(); }
hashtable::hash_funct
hasher hash_funct() const
Definition: _hashtable.h:246
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ insert() [1/4]

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> unordered_map< _Key, _Tp,,, >::insert ( const value_type &  __obj)
inline

Definition at line 133 of file _unordered_map.h.

134  { return _M_ht.insert_unique(__obj); }
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79
hashtable::insert_unique
pair< iterator, bool > insert_unique(const value_type &__obj)
Definition: _hashtable.h:407

◆ insert() [2/4]

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 unordered_map< _Key, _Tp,,, >::insert ( const_iterator  ,
const value_type &  __obj 
)
inline

Definition at line 135 of file _unordered_map.h.

136  { return _M_ht.insert_unique(__obj); }
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79
hashtable::insert_unique
pair< iterator, bool > insert_unique(const value_type &__obj)
Definition: _hashtable.h:407

◆ insert() [3/4]

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 unordered_map< _Key, _Tp,,, >::insert ( const value_type *  __f,
const value_type *  __l 
)
inline

Definition at line 141 of file _unordered_map.h.

142  { _M_ht.insert_unique(__f,__l); }
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79
hashtable::insert_unique
pair< iterator, bool > insert_unique(const value_type &__obj)
Definition: _hashtable.h:407

◆ insert() [4/4]

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 unordered_map< _Key, _Tp,,, >::insert ( const_iterator  __f,
const_iterator  __l 
)
inline

Definition at line 143 of file _unordered_map.h.

145  { _M_ht.insert_unique(__f, __l); }
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79
hashtable::insert_unique
pair< iterator, bool > insert_unique(const value_type &__obj)
Definition: _hashtable.h:407

◆ 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 unordered_map< _Key, _Tp,,, >::key_eq ( ) const
inline

Definition at line 75 of file _unordered_map.h.

75 { return _M_ht.key_eq(); }
hashtable::key_eq
key_equal key_eq() const
Definition: _hashtable.h:247
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ load_factor()

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) >
float unordered_map< _Key, _Tp,,, >::load_factor ( ) const
inline

Definition at line 185 of file _unordered_map.h.

185 { return _M_ht.load_factor(); }
hashtable::load_factor
float load_factor() const
Definition: _hashtable.h:400
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ 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 unordered_map< _Key, _Tp,,, >::max_bucket_count ( ) const
inline

Definition at line 176 of file _unordered_map.h.

176 { return _M_ht.max_bucket_count(); }
hashtable::max_bucket_count
size_type max_bucket_count() const
Definition: _hashtable.h:392
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ max_load_factor() [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) >
float unordered_map< _Key, _Tp,,, >::max_load_factor ( ) const
inline

Definition at line 186 of file _unordered_map.h.

186 { return _M_ht.max_load_factor(); }
hashtable::max_load_factor
float max_load_factor() const
Definition: _hashtable.h:401
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ max_load_factor() [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) >
void unordered_map< _Key, _Tp,,, >::max_load_factor ( float  __val)
inline

Definition at line 187 of file _unordered_map.h.

187 { _M_ht.max_load_factor(__val); }
hashtable::max_load_factor
float max_load_factor() const
Definition: _hashtable.h:401
__val
_STLP_INLINE_LOOP _InputIter const _Tp & __val
Definition: _algobase.h:656
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ 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 unordered_map< _Key, _Tp,,, >::max_size ( ) const
inline

Definition at line 121 of file _unordered_map.h.

121 { return _M_ht.max_size(); }
hashtable::max_size
size_type max_size() const
Definition: _hashtable.h:364
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ 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) >
_Self& unordered_map< _Key, _Tp,,, >::operator= ( const _Self &  __other)
inline

Definition at line 117 of file _unordered_map.h.

118  { _M_ht = __other._M_ht; return *this; }
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ 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& unordered_map< _Key, _Tp,,, >::operator[] ( const _KT &  __key)
inline

Definition at line 153 of file _unordered_map.h.

153  {
154  iterator __it = _M_ht.find(__key);
155  return (__it == _M_ht.end() ?
156  _M_ht._M_insert(value_type(__key, _STLP_DEFAULT_CONSTRUCTED(_Tp))).second :
157  (*__it).second );
158  }
unordered_map::value_type
pair< _STLP_CONST key_type, data_type > value_type
Definition: _unordered_map.h:48
hashtable::end
iterator end()
Definition: _hashtable.h:377
_STLP_DEFAULT_CONSTRUCTED
#define _STLP_DEFAULT_CONSTRUCTED(_TTp)
Definition: _construct.h:265
__it
_STLP_MOVE_TO_PRIV_NAMESPACE const _InputIterator const input_iterator_tag &_InputIterator __it(__first)
hashtable::find
_STLP_TEMPLATE_FOR_CONT_EXT iterator find(const _KT &__key)
Definition: _hashtable.h:511
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79
hashtable::_M_insert
reference _M_insert(const value_type &__obj)
Definition: _hashtable.c:254

◆ rehash()

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 unordered_map< _Key, _Tp,,, >::rehash ( size_type  __hint)
inline

Definition at line 188 of file _unordered_map.h.

188 { _M_ht.rehash(__hint); }
hashtable::rehash
void rehash(size_type __num_buckets_hint)
Definition: _hashtable.c:365
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ 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 unordered_map< _Key, _Tp,,, >::size ( ) const
inline

Definition at line 120 of file _unordered_map.h.

120 { return _M_ht.size(); }
hashtable::size
size_type size() const
Definition: _hashtable.h:363
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

◆ 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 unordered_map< _Key, _Tp,,, >::swap ( _Self &  __hs)
inline

Definition at line 123 of file _unordered_map.h.

123 { _M_ht.swap(__hs._M_ht); }
hashtable::swap
void swap(_Self &__ht)
Definition: _hashtable.h:367
unordered_map::_M_ht
_Ht _M_ht
Definition: _unordered_map.h:79

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 unordered_map< _Key, _Tp,,, >::_M_ht
private

Definition at line 79 of file _unordered_map.h.

Referenced by unordered_map< _Key, _Tp,,, >::begin(), unordered_map< _Key, _Tp,,, >::bucket(), unordered_map< _Key, _Tp,,, >::bucket_count(), unordered_map< _Key, _Tp,,, >::bucket_size(), unordered_map< _Key, _Tp,,, >::clear(), unordered_map< _Key, _Tp,,, >::count(), unordered_map< _Key, _Tp,,, >::empty(), unordered_map< _Key, _Tp,,, >::end(), unordered_map< _Key, _Tp,,, >::equal_range(), unordered_map< _Key, _Tp,,, >::erase(), unordered_map< _Key, _Tp,,, >::find(), unordered_map< _Key, _Tp,,, >::get_allocator(), unordered_map< _Key, _Tp,,, >::hash_function(), unordered_map< _Key, _Tp,,, >::insert(), unordered_map< _Key, _Tp,,, >::key_eq(), unordered_map< _Key, _Tp,,, >::load_factor(), unordered_map< _Key, _Tp,,, >::max_bucket_count(), unordered_map< _Key, _Tp,,, >::max_load_factor(), unordered_map< _Key, _Tp,,, >::max_size(), unordered_map< _Key, _Tp,,, >::operator=(), unordered_map< _Key, _Tp,,, >::operator[](), unordered_map< _Key, _Tp,,, >::rehash(), unordered_map< _Key, _Tp,,, >::size(), unordered_map< _Key, _Tp,,, >::swap(), and unordered_map< _Key, _Tp,,, >::unordered_map().

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