ReactOS 0.4.15-dev-6657-ged9973f
_hash_set.h
Go to the documentation of this file.
1/*
2 *
3 * Copyright (c) 1994
4 * Hewlett-Packard Company
5 *
6 * Copyright (c) 1996,1997
7 * Silicon Graphics Computer Systems, Inc.
8 *
9 * Copyright (c) 1997
10 * Moscow Center for SPARC Technology
11 *
12 * Copyright (c) 1999
13 * Boris Fomitchev
14 *
15 * This material is provided "as is", with absolutely no warranty expressed
16 * or implied. Any use is at your own risk.
17 *
18 * Permission to use or copy this software for any purpose is hereby granted
19 * without fee, provided the above notices are retained on all copies.
20 * Permission to modify the code and to distribute modified code is granted,
21 * provided the above notices are retained, and a notice that the code was
22 * modified is included with the above copyright notice.
23 *
24 */
25
26/* NOTE: This is an internal header file, included by other STL headers.
27 * You should not attempt to use it directly.
28 */
29
30#ifndef _STLP_INTERNAL_HASH_SET_H
31#define _STLP_INTERNAL_HASH_SET_H
32
33#ifndef _STLP_INTERNAL_HASHTABLE_H
34# include <stl/_hashtable.h>
35#endif
36
38
39//Specific iterator traits creation
40_STLP_CREATE_HASH_ITERATOR_TRAITS(HashSetTraitsT, Const_traits)
41
42template <class _Value, _STLP_DFL_TMPL_PARAM(_HashFcn,hash<_Value>),
43 _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to<_Value>),
44 _STLP_DFL_TMPL_PARAM(_Alloc, allocator<_Value>) >
46#if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND)
47 : public __stlport_class<hash_set<_Value, _HashFcn, _EqualKey, _Alloc> >
48#endif
49{
51 //Specific iterator traits creation
52 typedef _STLP_PRIV _HashSetTraitsT<_Value> _HashSetTraits;
53public:
54 typedef hashtable<_Value, _Value, _HashFcn,
56public:
57 typedef typename _Ht::key_type key_type;
58 typedef typename _Ht::value_type value_type;
59 typedef typename _Ht::hasher hasher;
60 typedef typename _Ht::key_equal key_equal;
61
62 typedef typename _Ht::size_type size_type;
64 typedef typename _Ht::pointer pointer;
66 typedef typename _Ht::reference reference;
68
69 typedef typename _Ht::iterator iterator;
71
73
74 hasher hash_funct() const { return _M_ht.hash_funct(); }
75 key_equal key_eq() const { return _M_ht.key_eq(); }
77
78private:
81
82public:
84 : _M_ht(0, hasher(), key_equal(), allocator_type()) {}
88 : _M_ht(__n, __hf, key_equal(), allocator_type()) {}
89#if !defined (_STLP_DONT_SUP_DFLT_PARAM)
90 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql,
91 const allocator_type& __a = allocator_type())
92#else
93 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql)
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) {}
99
100#if !defined (_STLP_NO_MOVE_SEMANTIC)
103#endif
104
105#if defined (_STLP_MEMBER_TEMPLATES)
106 template <class _InputIterator>
107 hash_set(_InputIterator __f, _InputIterator __l)
109 { _M_ht.insert_unique(__f, __l); }
110 template <class _InputIterator>
111 hash_set(_InputIterator __f, _InputIterator __l, size_type __n)
113 { _M_ht.insert_unique(__f, __l); }
114 template <class _InputIterator>
115 hash_set(_InputIterator __f, _InputIterator __l, size_type __n,
116 const hasher& __hf)
117 : _M_ht(__n, __hf, key_equal(), allocator_type())
118 { _M_ht.insert_unique(__f, __l); }
119 template <class _InputIterator>
120 hash_set(_InputIterator __f, _InputIterator __l, size_type __n,
121 const hasher& __hf, const key_equal& __eql,
123 : _M_ht(__n, __hf, __eql, __a)
124 { _M_ht.insert_unique(__f, __l); }
125# if defined (_STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS)
126 template <class _InputIterator>
127 hash_set(_InputIterator __f, _InputIterator __l, size_type __n,
128 const hasher& __hf, const key_equal& __eql)
129 : _M_ht(__n, __hf, __eql, allocator_type())
130 { _M_ht.insert_unique(__f, __l); }
131# endif
132#else
133 hash_set(const value_type* __f, const value_type* __l)
135 { _M_ht.insert_unique(__f, __l); }
136 hash_set(const value_type* __f, const value_type* __l, size_type __n)
138 { _M_ht.insert_unique(__f, __l); }
139 hash_set(const value_type* __f, const value_type* __l, size_type __n,
140 const hasher& __hf)
141 : _M_ht(__n, __hf, key_equal(), allocator_type())
142 { _M_ht.insert_unique(__f, __l); }
143 hash_set(const value_type* __f, const value_type* __l, size_type __n,
144 const hasher& __hf, const key_equal& __eql,
145 const allocator_type& __a = allocator_type())
146 : _M_ht(__n, __hf, __eql, __a)
147 { _M_ht.insert_unique(__f, __l); }
148
151 { _M_ht.insert_unique(__f, __l); }
154 { _M_ht.insert_unique(__f, __l); }
156 const hasher& __hf)
157 : _M_ht(__n, __hf, key_equal(), allocator_type())
158 { _M_ht.insert_unique(__f, __l); }
160 const hasher& __hf, const key_equal& __eql,
161 const allocator_type& __a = allocator_type())
162 : _M_ht(__n, __hf, __eql, __a)
163 { _M_ht.insert_unique(__f, __l); }
164#endif /*_STLP_MEMBER_TEMPLATES */
165
166public:
167 size_type size() const { return _M_ht.size(); }
168 size_type max_size() const { return _M_ht.max_size(); }
169 bool empty() const { return _M_ht.empty(); }
170 void swap(_Self& __hs) { _M_ht.swap(__hs._M_ht); }
171#if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (_STLP_FUNCTION_TMPL_PARTIAL_ORDER)
172 void _M_swap_workaround(_Self& __x) { swap(__x); }
173#endif
174
175 iterator begin() { return _M_ht.begin(); }
176 iterator end() { return _M_ht.end(); }
177 const_iterator begin() const { return _M_ht.begin(); }
178 const_iterator end() const { return _M_ht.end(); }
179
180public:
182 { return _M_ht.insert_unique(__obj); }
183#if defined (_STLP_MEMBER_TEMPLATES)
184 template <class _InputIterator>
185 void insert(_InputIterator __f, _InputIterator __l)
186#else
188 {_M_ht.insert_unique(__f, __l); }
189 void insert(const value_type* __f, const value_type* __l)
190#endif
191 { _M_ht.insert_unique(__f,__l); }
192
194 { return _M_ht.insert_unique_noresize(__obj); }
195
197 iterator find(const _KT& __key) { return _M_ht.find(__key); }
199 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); }
200
202 size_type count(const _KT& __key) const { return _M_ht.count(__key); }
203
206 { return _M_ht.equal_range(__key); }
209 { return _M_ht.equal_range(__key); }
210
212 size_type erase(const _KT& __key) {return _M_ht.erase(__key); }
214 void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); }
215 void clear() { _M_ht.clear(); }
216
217public:
218 void resize(size_type __hint) { _M_ht.resize(__hint); }
222 { return _M_ht.elems_in_bucket(__n); }
223};
224
225//Specific iterator traits creation
226_STLP_CREATE_HASH_ITERATOR_TRAITS(HashMultisetTraitsT, Const_traits)
227
228template <class _Value, _STLP_DFL_TMPL_PARAM(_HashFcn,hash<_Value>),
229 _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to<_Value>),
230 _STLP_DFL_TMPL_PARAM(_Alloc, allocator<_Value>) >
232#if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND)
233 : public __stlport_class<hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc> >
234#endif
235{
237 //Specific iterator traits creation
238 typedef _STLP_PRIV _HashMultisetTraitsT<_Value> _HashMultisetTraits;
239public:
240 typedef hashtable<_Value, _Value, _HashFcn,
242
243 typedef typename _Ht::key_type key_type;
244 typedef typename _Ht::value_type value_type;
245 typedef typename _Ht::hasher hasher;
246 typedef typename _Ht::key_equal key_equal;
247
248 typedef typename _Ht::size_type size_type;
250 typedef typename _Ht::pointer pointer;
252 typedef typename _Ht::reference reference;
254
255 typedef typename _Ht::iterator iterator;
257
259
260 hasher hash_funct() const { return _M_ht.hash_funct(); }
261 key_equal key_eq() const { return _M_ht.key_eq(); }
263
264private:
267
268public:
270 : _M_ht(0, hasher(), key_equal(), allocator_type()) {}
274 : _M_ht(__n, __hf, key_equal(), allocator_type()) {}
275 hash_multiset(size_type __n, const hasher& __hf, const key_equal& __eql)
276 : _M_ht(__n, __hf, __eql, allocator_type()) {}
277 hash_multiset(size_type __n, const hasher& __hf, const key_equal& __eql,
278 const allocator_type& __a)
279 : _M_ht(__n, __hf, __eql, __a) {}
280
281#if !defined (_STLP_NO_MOVE_SEMANTIC)
284#endif
285
286#if defined (_STLP_MEMBER_TEMPLATES)
287 template <class _InputIterator>
288 hash_multiset(_InputIterator __f, _InputIterator __l)
290 { _M_ht.insert_equal(__f, __l); }
291 template <class _InputIterator>
292 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n)
294 { _M_ht.insert_equal(__f, __l); }
295 template <class _InputIterator>
296 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n,
297 const hasher& __hf)
298 : _M_ht(__n, __hf, key_equal(), allocator_type())
299 { _M_ht.insert_equal(__f, __l); }
300
301 template <class _InputIterator>
302 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n,
303 const hasher& __hf, const key_equal& __eql,
305 : _M_ht(__n, __hf, __eql, __a)
306 { _M_ht.insert_equal(__f, __l); }
307# if defined (_STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS)
308 template <class _InputIterator>
309 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n,
310 const hasher& __hf, const key_equal& __eql)
311 : _M_ht(__n, __hf, __eql, allocator_type())
312 { _M_ht.insert_equal(__f, __l); }
313# endif
314#else
315 hash_multiset(const value_type* __f, const value_type* __l)
317 { _M_ht.insert_equal(__f, __l); }
320 { _M_ht.insert_equal(__f, __l); }
322 const hasher& __hf)
323 : _M_ht(__n, __hf, key_equal(), allocator_type())
324 { _M_ht.insert_equal(__f, __l); }
326 const hasher& __hf, const key_equal& __eql,
327 const allocator_type& __a = allocator_type())
328 : _M_ht(__n, __hf, __eql, __a)
329 { _M_ht.insert_equal(__f, __l); }
330
333 { _M_ht.insert_equal(__f, __l); }
336 { _M_ht.insert_equal(__f, __l); }
338 const hasher& __hf)
339 : _M_ht(__n, __hf, key_equal(), allocator_type())
340 { _M_ht.insert_equal(__f, __l); }
342 const hasher& __hf, const key_equal& __eql,
343 const allocator_type& __a = allocator_type())
344 : _M_ht(__n, __hf, __eql, __a)
345 { _M_ht.insert_equal(__f, __l); }
346#endif /*_STLP_MEMBER_TEMPLATES */
347
348public:
349 size_type size() const { return _M_ht.size(); }
350 size_type max_size() const { return _M_ht.max_size(); }
351 bool empty() const { return _M_ht.empty(); }
352 void swap(_Self& hs) { _M_ht.swap(hs._M_ht); }
353#if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (_STLP_FUNCTION_TMPL_PARTIAL_ORDER)
354 void _M_swap_workaround(_Self& __x) { swap(__x); }
355#endif
356
357 iterator begin() { return _M_ht.begin(); }
358 iterator end() { return _M_ht.end(); }
359 const_iterator begin() const { return _M_ht.begin(); }
360 const_iterator end() const { return _M_ht.end(); }
361
362public:
363 iterator insert(const value_type& __obj) { return _M_ht.insert_equal(__obj); }
364#if defined (_STLP_MEMBER_TEMPLATES)
365 template <class _InputIterator>
366 void insert(_InputIterator __f, _InputIterator __l)
367 { _M_ht.insert_equal(__f,__l); }
368#else
369 void insert(const value_type* __f, const value_type* __l)
370 { _M_ht.insert_equal(__f,__l); }
372 { _M_ht.insert_equal(__f, __l); }
373#endif /*_STLP_MEMBER_TEMPLATES */
375 { return _M_ht.insert_equal_noresize(__obj); }
376
378 iterator find(const _KT& __key) { return _M_ht.find(__key); }
379
381 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); }
382
384 size_type count(const _KT& __key) const { return _M_ht.count(__key); }
385
388 { return _M_ht.equal_range(__key); }
391 { return _M_ht.equal_range(__key); }
392
394 size_type erase(const _KT& __key) {return _M_ht.erase(__key); }
396 void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); }
397 void clear() { _M_ht.clear(); }
398
399public:
400 void resize(size_type __hint) { _M_ht.resize(__hint); }
404 { return _M_ht.elems_in_bucket(__n); }
405};
406
407#define _STLP_TEMPLATE_HEADER template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
408#define _STLP_TEMPLATE_CONTAINER hash_set<_Value,_HashFcn,_EqualKey,_Alloc>
409
411
412#undef _STLP_TEMPLATE_CONTAINER
413#define _STLP_TEMPLATE_CONTAINER hash_multiset<_Value,_HashFcn,_EqualKey,_Alloc>
415
416#undef _STLP_TEMPLATE_CONTAINER
417#undef _STLP_TEMPLATE_HEADER
418
419// Specialization of insert_iterator so that it will work for hash_set
420// and hash_multiset.
421
422#if defined (_STLP_CLASS_PARTIAL_SPECIALIZATION)
423# if !defined (_STLP_NO_MOVE_SEMANTIC)
424template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
425struct __move_traits<hash_set<_Value, _HashFcn, _EqualKey, _Alloc> > :
426 _STLP_PRIV __move_traits_aux<typename hash_set<_Value, _HashFcn, _EqualKey, _Alloc>::_Ht>
427{};
428
429template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
430struct __move_traits<hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc> > :
431 _STLP_PRIV __move_traits_aux<typename hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc>::_Ht>
432{};
433# endif
434
435template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
436class insert_iterator<hash_set<_Value, _HashFcn, _EqualKey, _Alloc> > {
437protected:
439 _Container* container;
440public:
441 typedef _Container container_type;
443 typedef void value_type;
444 typedef void difference_type;
445 typedef void pointer;
446 typedef void reference;
447
448 insert_iterator(_Container& __x) : container(&__x) {}
449 insert_iterator(_Container& __x, typename _Container::iterator)
450 : container(&__x) {}
452 operator=(const typename _Container::value_type& __val) {
453 container->insert(__val);
454 return *this;
455 }
456 insert_iterator<_Container>& operator*() { return *this; }
457 insert_iterator<_Container>& operator++() { return *this; }
458 insert_iterator<_Container>& operator++(int) { return *this; }
459};
460
461template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
462class insert_iterator<hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc> > {
463protected:
465 _Container* container;
466 typename _Container::iterator iter;
467public:
468 typedef _Container container_type;
470 typedef void value_type;
471 typedef void difference_type;
472 typedef void pointer;
473 typedef void reference;
474
475 insert_iterator(_Container& __x) : container(&__x) {}
476 insert_iterator(_Container& __x, typename _Container::iterator)
477 : container(&__x) {}
479 operator=(const typename _Container::value_type& __val) {
480 container->insert(__val);
481 return *this;
482 }
483 insert_iterator<_Container>& operator*() { return *this; }
484 insert_iterator<_Container>& operator++() { return *this; }
485 insert_iterator<_Container>& operator++(int) { return *this; }
486};
487#endif /* _STLP_CLASS_PARTIAL_SPECIALIZATION */
488
490
491#endif /* _STLP_INTERNAL_HASH_SET_H */
492
493// Local Variables:
494// mode:C++
495// End:
return __n
Definition: _algo.h:75
_STLP_INLINE_LOOP _InputIter const _Tp & __val
Definition: _algobase.h:656
#define _Alloc
Definition: _bvector.h:330
#define _STLP_PRIV
Definition: _dm.h:70
#define _STLP_CREATE_HASH_ITERATOR_TRAITS(Motif, Traits)
_STLP_MOVE_TO_PRIV_NAMESPACE const _InputIterator const input_iterator_tag &_InputIterator __it(__first)
void get(int argc, const char *argv[])
Definition: cmds.c:480
key_equal key_eq() const
Definition: _hash_set.h:261
hash_multiset(size_type __n, const hasher &__hf, const key_equal &__eql, const allocator_type &__a)
Definition: _hash_set.h:277
_Ht::const_pointer const_pointer
Definition: _hash_set.h:251
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator find(const _KT &__key) const
Definition: _hash_set.h:381
_Ht::hasher hasher
Definition: _hash_set.h:245
hash_multiset(const value_type *__f, const value_type *__l, size_type __n, const hasher &__hf)
Definition: _hash_set.h:321
_Ht::difference_type difference_type
Definition: _hash_set.h:249
_Ht::value_type value_type
Definition: _hash_set.h:244
_STLP_PRIV _HashMultisetTraitsT< _Value > _HashMultisetTraits
Definition: _hash_set.h:238
hash_multiset(size_type __n, const hasher &__hf)
Definition: _hash_set.h:273
_STLP_TEMPLATE_FOR_CONT_EXT size_type erase(const _KT &__key)
Definition: _hash_set.h:394
hasher hash_funct() const
Definition: _hash_set.h:260
iterator begin()
Definition: _hash_set.h:357
void erase(iterator __f, iterator __l)
Definition: _hash_set.h:396
size_type max_size() const
Definition: _hash_set.h:350
hash_multiset(__move_source< _Self > src)
Definition: _hash_set.h:282
size_type bucket_count() const
Definition: _hash_set.h:401
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iterator > equal_range(const _KT &__key)
Definition: _hash_set.h:387
hash_multiset(const value_type *__f, const value_type *__l, size_type __n, const hasher &__hf, const key_equal &__eql, const allocator_type &__a=allocator_type())
Definition: _hash_set.h:325
hash_multiset(const_iterator __f, const_iterator __l)
Definition: _hash_set.h:331
hash_multiset(const_iterator __f, const_iterator __l, size_type __n, const hasher &__hf)
Definition: _hash_set.h:337
void erase(iterator __it)
Definition: _hash_set.h:395
_Ht::const_reference const_reference
Definition: _hash_set.h:253
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iterator > equal_range(const _KT &__key) const
Definition: _hash_set.h:390
_STLP_TEMPLATE_FOR_CONT_EXT iterator find(const _KT &__key)
Definition: _hash_set.h:378
size_type elems_in_bucket(size_type __n) const
Definition: _hash_set.h:403
_Ht::reference reference
Definition: _hash_set.h:252
_Ht::const_iterator const_iterator
Definition: _hash_set.h:256
void swap(_Self &hs)
Definition: _hash_set.h:352
_Ht::pointer pointer
Definition: _hash_set.h:250
allocator_type get_allocator() const
Definition: _hash_set.h:262
void insert(const value_type *__f, const value_type *__l)
Definition: _hash_set.h:369
void clear()
Definition: _hash_set.h:397
void insert(const_iterator __f, const_iterator __l)
Definition: _hash_set.h:371
_Ht::size_type size_type
Definition: _hash_set.h:248
_Ht::key_equal key_equal
Definition: _hash_set.h:246
_STLP_TEMPLATE_FOR_CONT_EXT size_type count(const _KT &__key) const
Definition: _hash_set.h:384
size_type max_bucket_count() const
Definition: _hash_set.h:402
_Ht::key_type key_type
Definition: _hash_set.h:243
const_iterator begin() const
Definition: _hash_set.h:359
iterator end()
Definition: _hash_set.h:358
bool empty() const
Definition: _hash_set.h:351
hash_multiset(const value_type *__f, const value_type *__l, size_type __n)
Definition: _hash_set.h:318
_Ht::iterator iterator
Definition: _hash_set.h:255
hashtable< _Value, _Value, _HashFcn, _HashMultisetTraits, _STLP_PRIV _Identity< _Value >, _EqualKey, _Alloc > _Ht
Definition: _hash_set.h:241
hash_multiset(size_type __n, const hasher &__hf, const key_equal &__eql)
Definition: _hash_set.h:275
hash_multiset(size_type __n)
Definition: _hash_set.h:271
void resize(size_type __hint)
Definition: _hash_set.h:400
hash_multiset(const_iterator __f, const_iterator __l, size_type __n)
Definition: _hash_set.h:334
iterator insert_noresize(const value_type &__obj)
Definition: _hash_set.h:374
hash_multiset(const value_type *__f, const value_type *__l)
Definition: _hash_set.h:315
size_type size() const
Definition: _hash_set.h:349
_Ht::allocator_type allocator_type
Definition: _hash_set.h:258
hash_multiset< _Value, _HashFcn, _EqualKey, _Alloc > _Self
Definition: _hash_set.h:236
hash_multiset(const_iterator __f, const_iterator __l, size_type __n, const hasher &__hf, const key_equal &__eql, const allocator_type &__a=allocator_type())
Definition: _hash_set.h:341
iterator insert(const value_type &__obj)
Definition: _hash_set.h:363
const_iterator end() const
Definition: _hash_set.h:360
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iterator > equal_range(const _KT &__key)
Definition: _hash_set.h:205
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iterator > equal_range(const _KT &__key) const
Definition: _hash_set.h:208
void insert(const_iterator __f, const_iterator __l)
Definition: _hash_set.h:187
hash_set(const_iterator __f, const_iterator __l, size_type __n, const hasher &__hf)
Definition: _hash_set.h:155
size_type size() const
Definition: _hash_set.h:167
_STLP_TEMPLATE_FOR_CONT_EXT iterator find(const _KT &__key)
Definition: _hash_set.h:197
_STLP_PRIV _HashSetTraitsT< _Value > _HashSetTraits
Definition: _hash_set.h:52
_Ht::difference_type difference_type
Definition: _hash_set.h:63
_Ht _M_ht
Definition: _hash_set.h:79
_Ht::size_type size_type
Definition: _hash_set.h:62
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator find(const _KT &__key) const
Definition: _hash_set.h:199
_Ht::const_reference const_reference
Definition: _hash_set.h:67
const_iterator begin() const
Definition: _hash_set.h:177
hash_set(const value_type *__f, const value_type *__l, size_type __n)
Definition: _hash_set.h:136
hash_set(const value_type *__f, const value_type *__l, size_type __n, const hasher &__hf)
Definition: _hash_set.h:139
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())
Definition: _hash_set.h:143
size_type max_size() const
Definition: _hash_set.h:168
hash_set(size_type __n, const hasher &__hf)
Definition: _hash_set.h:87
hash_set(const value_type *__f, const value_type *__l)
Definition: _hash_set.h:133
_Ht::reference reference
Definition: _hash_set.h:66
iterator end()
Definition: _hash_set.h:176
_Ht::const_iterator const_iterator
Definition: _hash_set.h:70
_Ht::pointer pointer
Definition: _hash_set.h:64
hash_set(const_iterator __f, const_iterator __l, size_type __n)
Definition: _hash_set.h:152
key_equal key_eq() const
Definition: _hash_set.h:75
hash_set(const_iterator __f, const_iterator __l)
Definition: _hash_set.h:149
hash_set(const_iterator __f, const_iterator __l, size_type __n, const hasher &__hf, const key_equal &__eql, const allocator_type &__a=allocator_type())
Definition: _hash_set.h:159
_Ht::key_type key_type
Definition: _hash_set.h:57
void clear()
Definition: _hash_set.h:215
iterator begin()
Definition: _hash_set.h:175
_Ht::hasher hasher
Definition: _hash_set.h:59
void erase(iterator __it)
Definition: _hash_set.h:213
hasher hash_funct() const
Definition: _hash_set.h:74
void erase(iterator __f, iterator __l)
Definition: _hash_set.h:214
size_type elems_in_bucket(size_type __n) const
Definition: _hash_set.h:221
const_iterator end() const
Definition: _hash_set.h:178
hash_set()
Definition: _hash_set.h:83
void swap(_Self &__hs)
Definition: _hash_set.h:170
_STLP_TEMPLATE_FOR_CONT_EXT size_type erase(const _KT &__key)
Definition: _hash_set.h:212
pair< iterator, bool > insert_noresize(const value_type &__obj)
Definition: _hash_set.h:193
_Ht::const_pointer const_pointer
Definition: _hash_set.h:65
_Ht::key_equal key_equal
Definition: _hash_set.h:60
allocator_type get_allocator() const
Definition: _hash_set.h:76
size_type max_bucket_count() const
Definition: _hash_set.h:220
hash_set(size_type __n, const hasher &__hf, const key_equal &__eql, const allocator_type &__a=allocator_type())
Definition: _hash_set.h:90
void insert(const value_type *__f, const value_type *__l)
Definition: _hash_set.h:189
hash_set(size_type __n)
Definition: _hash_set.h:85
hashtable< _Value, _Value, _HashFcn, _HashSetTraits, _STLP_PRIV _Identity< _Value >, _EqualKey, _Alloc > _Ht
Definition: _hash_set.h:55
pair< iterator, bool > insert(const value_type &__obj)
Definition: _hash_set.h:181
hash_set< _Value, _HashFcn, _EqualKey, _Alloc > _Self
Definition: _hash_set.h:50
size_type bucket_count() const
Definition: _hash_set.h:219
_Ht::iterator iterator
Definition: _hash_set.h:69
_Ht::allocator_type allocator_type
Definition: _hash_set.h:72
_STLP_TEMPLATE_FOR_CONT_EXT size_type count(const _KT &__key) const
Definition: _hash_set.h:202
hash_set(__move_source< _Self > src)
Definition: _hash_set.h:101
bool empty() const
Definition: _hash_set.h:169
void resize(size_type __hint)
Definition: _hash_set.h:218
_Ht::value_type value_type
Definition: _hash_set.h:58
size_type erase(const key_type &__key)
Definition: _hashtable.c:263
allocator_type get_allocator() const
Definition: _hashtable.h:300
key_equal key_eq() const
Definition: _hashtable.h:247
iterator insert_equal(const value_type &__obj)
Definition: _hashtable.h:412
pair< iterator, bool > insert_unique(const value_type &__obj)
Definition: _hashtable.h:407
iterator end()
Definition: _hashtable.h:377
iterator insert_equal_noresize(const value_type &__obj)
Definition: _hashtable.c:230
bool empty() const
Definition: _hashtable.h:365
size_type bucket_count() const
Definition: _hashtable.h:391
size_type max_bucket_count() const
Definition: _hashtable.h:392
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iterator > equal_range(const _KT &__key)
Definition: _hashtable.h:534
_STLP_TEMPLATE_FOR_CONT_EXT iterator find(const _KT &__key)
Definition: _hashtable.h:511
size_type max_size() const
Definition: _hashtable.h:364
void swap(_Self &__ht)
Definition: _hashtable.h:367
size_type elems_in_bucket(size_type __bucket) const
Definition: _hashtable.h:393
size_type size() const
Definition: _hashtable.h:363
void clear()
Definition: _hashtable.c:501
iterator begin()
Definition: _hashtable.h:376
void resize(size_type __num_buckets_hint)
Definition: _hashtable.h:580
hasher hash_funct() const
Definition: _hashtable.h:246
_STLP_TEMPLATE_FOR_CONT_EXT size_type count(const _KT &__key) const
Definition: _hashtable.h:516
pair< iterator, bool > insert_unique_noresize(const value_type &__obj)
Definition: _hashtable.c:199
output_iterator_tag iterator_category
Definition: _iterator.h:229
_Self & operator=(_Self const &__other)
Definition: _iterator.h:233
_Self & operator++()
Definition: _iterator.h:244
_Container * container
Definition: _iterator.h:225
_Container container_type
Definition: _iterator.h:228
_Self & operator*()
Definition: _iterator.h:243
int _Value
Definition: setjmp.h:214
#define _STLP_TEMPLATE_FOR_CONT_EXT
Definition: features.h:623
#define _STLP_ALLOCATOR_TYPE_DFL
Definition: features.h:691
#define _STLP_KEY_TYPE_FOR_CONT_EXT(type)
Definition: features.h:622
#define _STLP_BEGIN_NAMESPACE
Definition: features.h:501
#define _STLP_END_NAMESPACE
Definition: features.h:503
GLenum src
Definition: glext.h:6340
GLsizei const GLvoid * pointer
Definition: glext.h:5848
GLint reference
Definition: glext.h:11729
if(dx< 0)
Definition: linetemp.h:194
#define swap(a, b)
Definition: qsort.c:63
Definition: _pair.h:47
static int insert
Definition: xmllint.c:138