ReactOS 0.4.15-dev-8119-g4fb2fdb
hash_set< _Value,,, > Class Template Reference

#include <_hash_set.h>

Collaboration diagram for hash_set< _Value,,, >:

Public Types

typedef hashtable< _Value, _Value, _HashFcn, _HashSetTraits, _STLP_PRIV _Identity< _Value >, _EqualKey, _Alloc_Ht
 
typedef _Ht::key_type key_type
 
typedef _Ht::value_type value_type
 
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_set ()
 
 hash_set (size_type __n)
 
 hash_set (size_type __n, const hasher &__hf)
 
 hash_set (size_type __n, const hasher &__hf, const key_equal &__eql, const allocator_type &__a=allocator_type())
 
 hash_set (__move_source< _Self > src)
 
 hash_set (const value_type *__f, const value_type *__l)
 
 hash_set (const value_type *__f, const value_type *__l, size_type __n)
 
 hash_set (const value_type *__f, const value_type *__l, size_type __n, const hasher &__hf)
 
 hash_set (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_set (const_iterator __f, const_iterator __l)
 
 hash_set (const_iterator __f, const_iterator __l, size_type __n)
 
 hash_set (const_iterator __f, const_iterator __l, size_type __n, const hasher &__hf)
 
 hash_set (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, boolinsert (const value_type &__obj)
 
void insert (const_iterator __f, const_iterator __l)
 
void insert (const value_type *__f, const value_type *__l)
 
pair< iterator, boolinsert_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 size_type count (const _KT &__key) const
 
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iteratorequal_range (const _KT &__key)
 
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iteratorequal_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_set< _Value, _HashFcn, _EqualKey, _Alloc_Self
 
typedef _STLP_PRIV _HashSetTraitsT< _Value_HashSetTraits
 

Private Attributes

_Ht _M_ht
 

Detailed Description

template<class _Value, _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >), _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >), _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >)>
class hash_set< _Value,,, >

Definition at line 45 of file _hash_set.h.

Member Typedef Documentation

◆ _HashSetTraits

typedef _STLP_PRIV _HashSetTraitsT<_Value> hash_set< _Value,,, >::_HashSetTraits
private

Definition at line 52 of file _hash_set.h.

◆ _Ht

Definition at line 55 of file _hash_set.h.

◆ _Self

typedef hash_set<_Value, _HashFcn, _EqualKey, _Alloc> hash_set< _Value,,, >::_Self
private

Definition at line 50 of file _hash_set.h.

◆ allocator_type

Definition at line 72 of file _hash_set.h.

◆ const_iterator

Definition at line 70 of file _hash_set.h.

◆ const_pointer

Definition at line 65 of file _hash_set.h.

◆ const_reference

Definition at line 67 of file _hash_set.h.

◆ difference_type

Definition at line 63 of file _hash_set.h.

◆ hasher

Definition at line 59 of file _hash_set.h.

◆ iterator

Definition at line 69 of file _hash_set.h.

◆ key_equal

Definition at line 60 of file _hash_set.h.

◆ key_type

Definition at line 57 of file _hash_set.h.

◆ pointer

Definition at line 64 of file _hash_set.h.

◆ reference

◆ size_type

Definition at line 62 of file _hash_set.h.

◆ value_type

Definition at line 58 of file _hash_set.h.

Constructor & Destructor Documentation

◆ hash_set() [1/13]

Definition at line 83 of file _hash_set.h.

84 : _M_ht(0, hasher(), key_equal(), allocator_type()) {}
_Ht _M_ht
Definition: _hash_set.h:79
_Ht::hasher hasher
Definition: _hash_set.h:59
_Ht::key_equal key_equal
Definition: _hash_set.h:60
_Ht::allocator_type allocator_type
Definition: _hash_set.h:72

◆ hash_set() [2/13]

Definition at line 85 of file _hash_set.h.

return __n
Definition: _algo.h:75

◆ hash_set() [3/13]

Definition at line 87 of file _hash_set.h.

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

◆ hash_set() [4/13]

Definition at line 90 of file _hash_set.h.

94 : _M_ht(__n, __hf, __eql, allocator_type()) {}
95 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql,
96 const allocator_type& __a)
97#endif
98 : _M_ht(__n, __hf, __eql, __a) {}
_Ht::size_type size_type
Definition: _hash_set.h:62
hash_set()
Definition: _hash_set.h:83

◆ hash_set() [5/13]

Definition at line 101 of file _hash_set.h.

102 : _M_ht(__move_source<_Ht>(src.get()._M_ht)) {}
GLenum src
Definition: glext.h:6340

◆ hash_set() [6/13]

Definition at line 133 of file _hash_set.h.

135 { _M_ht.insert_unique(__f, __l); }
pair< iterator, bool > insert_unique(const value_type &__obj)
Definition: _hashtable.h:407

◆ hash_set() [7/13]

Definition at line 136 of file _hash_set.h.

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

◆ hash_set() [8/13]

Definition at line 139 of file _hash_set.h.

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

◆ hash_set() [9/13]

Definition at line 143 of file _hash_set.h.

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

◆ hash_set() [10/13]

Definition at line 149 of file _hash_set.h.

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

◆ hash_set() [11/13]

Definition at line 152 of file _hash_set.h.

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

◆ hash_set() [12/13]

Definition at line 155 of file _hash_set.h.

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

◆ hash_set() [13/13]

Definition at line 159 of file _hash_set.h.

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

Member Function Documentation

◆ begin() [1/2]

Definition at line 175 of file _hash_set.h.

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

◆ begin() [2/2]

const_iterator hash_set< _Value,,, >::begin ( ) const
inline

Definition at line 177 of file _hash_set.h.

177{ return _M_ht.begin(); }

◆ bucket_count()

size_type hash_set< _Value,,, >::bucket_count ( ) const
inline

Definition at line 219 of file _hash_set.h.

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

◆ clear()

void hash_set< _Value,,, >::clear ( )
inline

Definition at line 215 of file _hash_set.h.

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

◆ count()

Definition at line 202 of file _hash_set.h.

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

◆ elems_in_bucket()

size_type hash_set< _Value,,, >::elems_in_bucket ( size_type  __n) const
inline

Definition at line 221 of file _hash_set.h.

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

◆ empty()

bool hash_set< _Value,,, >::empty ( ) const
inline

Definition at line 169 of file _hash_set.h.

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

◆ end() [1/2]

Definition at line 176 of file _hash_set.h.

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

◆ end() [2/2]

Definition at line 178 of file _hash_set.h.

178{ return _M_ht.end(); }

◆ equal_range() [1/2]

Definition at line 205 of file _hash_set.h.

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

◆ equal_range() [2/2]

Definition at line 208 of file _hash_set.h.

209 { return _M_ht.equal_range(__key); }

◆ erase() [1/3]

Definition at line 212 of file _hash_set.h.

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

◆ erase() [2/3]

void hash_set< _Value,,, >::erase ( iterator  __f,
iterator  __l 
)
inline

Definition at line 214 of file _hash_set.h.

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

◆ erase() [3/3]

void hash_set< _Value,,, >::erase ( iterator  __it)
inline

Definition at line 213 of file _hash_set.h.

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

◆ find() [1/2]

Definition at line 197 of file _hash_set.h.

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

◆ find() [2/2]

Definition at line 199 of file _hash_set.h.

199{ return _M_ht.find(__key); }

◆ get_allocator()

allocator_type hash_set< _Value,,, >::get_allocator ( ) const
inline

Definition at line 76 of file _hash_set.h.

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

◆ hash_funct()

hasher hash_set< _Value,,, >::hash_funct ( ) const
inline

Definition at line 74 of file _hash_set.h.

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

◆ insert() [1/3]

pair< iterator, bool > hash_set< _Value,,, >::insert ( const value_type __obj)
inline

Definition at line 181 of file _hash_set.h.

182 { return _M_ht.insert_unique(__obj); }

◆ insert() [2/3]

void hash_set< _Value,,, >::insert ( const value_type __f,
const value_type __l 
)
inline

Definition at line 189 of file _hash_set.h.

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

◆ insert() [3/3]

void hash_set< _Value,,, >::insert ( const_iterator  __f,
const_iterator  __l 
)
inline

Definition at line 187 of file _hash_set.h.

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

◆ insert_noresize()

pair< iterator, bool > hash_set< _Value,,, >::insert_noresize ( const value_type __obj)
inline

Definition at line 193 of file _hash_set.h.

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

◆ key_eq()

key_equal hash_set< _Value,,, >::key_eq ( ) const
inline

Definition at line 75 of file _hash_set.h.

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

◆ max_bucket_count()

size_type hash_set< _Value,,, >::max_bucket_count ( ) const
inline

Definition at line 220 of file _hash_set.h.

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

◆ max_size()

size_type hash_set< _Value,,, >::max_size ( ) const
inline

Definition at line 168 of file _hash_set.h.

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

◆ resize()

void hash_set< _Value,,, >::resize ( size_type  __hint)
inline

Definition at line 218 of file _hash_set.h.

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

◆ size()

Definition at line 167 of file _hash_set.h.

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

◆ swap()

void hash_set< _Value,,, >::swap ( _Self __hs)
inline

Definition at line 170 of file _hash_set.h.

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

Member Data Documentation

◆ _M_ht


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