1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
|
/*
* Copyright (c) 2004
* Francois Dumont
*
* This material is provided "as is", with absolutely no warranty expressed
* or implied. Any use is at your own risk.
*
* Permission to use or copy this software for any purpose is hereby granted
* without fee, provided the above notices are retained on all copies.
* Permission to modify the code and to distribute modified code is granted,
* provided the above notices are retained, and a notice that the code was
* modified is included with the above copyright notice.
*
*/
/* NOTE: This is an internal header file, included by other STL headers.
* You should not attempt to use it directly.
*/
#ifndef _STLP_INTERNAL_UNORDERED_SET_H
#define _STLP_INTERNAL_UNORDERED_SET_H
#ifndef _STLP_INTERNAL_HASHTABLE_H
# include <stl/_hashtable.h>
#endif
_STLP_BEGIN_NAMESPACE
//Specific iterator traits creation
_STLP_CREATE_HASH_ITERATOR_TRAITS(UnorderedSetTraitsT, Const_traits)
_STLP_BEGIN_TR1_NAMESPACE
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 unordered_set
#if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND)
: public __stlport_class<unordered_set<_Value, _HashFcn, _EqualKey, _Alloc> >
#endif
{
typedef unordered_set<_Value, _HashFcn, _EqualKey, _Alloc> _Self;
//Specific iterator traits creation
typedef _STLP_PRIV _UnorderedSetTraitsT<_Value> _UnorderedSetTraits;
public:
typedef hashtable<_Value, _Value, _HashFcn,
_UnorderedSetTraits, _STLP_PRIV _Identity<_Value>, _EqualKey, _Alloc> _Ht;
public:
typedef typename _Ht::key_type key_type;
typedef typename _Ht::value_type value_type;
typedef typename _Ht::hasher hasher;
typedef typename _Ht::key_equal key_equal;
typedef typename _Ht::size_type size_type;
typedef typename _Ht::difference_type difference_type;
typedef typename _Ht::pointer pointer;
typedef typename _Ht::const_pointer const_pointer;
typedef typename _Ht::reference reference;
typedef typename _Ht::const_reference const_reference;
typedef typename _Ht::iterator iterator;
typedef typename _Ht::const_iterator const_iterator;
typedef typename _Ht::local_iterator local_iterator;
typedef typename _Ht::const_local_iterator const_local_iterator;
typedef typename _Ht::allocator_type allocator_type;
hasher hash_function() const { return _M_ht.hash_funct(); }
key_equal key_eq() const { return _M_ht.key_eq(); }
allocator_type get_allocator() const { return _M_ht.get_allocator(); }
private:
_Ht _M_ht;
_STLP_KEY_TYPE_FOR_CONT_EXT(key_type)
public:
explicit unordered_set(size_type __n = 0, const hasher& __hf = hasher(),
const key_equal& __eql = key_equal(),
const allocator_type& __a = allocator_type())
: _M_ht(__n, __hf, __eql, __a) {}
#if !defined (_STLP_NO_MOVE_SEMANTIC)
unordered_set(__move_source<_Self> src)
: _M_ht(__move_source<_Ht>(src.get()._M_ht)) {}
#endif
#if defined (_STLP_MEMBER_TEMPLATES)
template <class _InputIterator>
unordered_set(_InputIterator __f, _InputIterator __l,
size_type __n = 0, const hasher& __hf = hasher(),
const key_equal& __eql = key_equal(),
const allocator_type& __a = allocator_type())
: _M_ht(__n, __hf, __eql, __a)
{ _M_ht.insert_unique(__f, __l); }
#else
unordered_set(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())
: _M_ht(__n, __hf, __eql, __a)
{ _M_ht.insert_unique(__f, __l); }
unordered_set(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())
: _M_ht(__n, __hf, __eql, __a)
{ _M_ht.insert_unique(__f, __l); }
#endif /*_STLP_MEMBER_TEMPLATES */
_Self& operator = (const _Self& __other)
{ _M_ht = __other._M_ht; return *this; }
size_type size() const { return _M_ht.size(); }
size_type max_size() const { return _M_ht.max_size(); }
bool empty() const { return _M_ht.empty(); }
void swap(_Self& __hs) { _M_ht.swap(__hs._M_ht); }
#if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (_STLP_FUNCTION_TMPL_PARTIAL_ORDER)
void _M_swap_workaround(_Self& __x) { swap(__x); }
#endif
iterator begin() { return _M_ht.begin(); }
iterator end() { return _M_ht.end(); }
const_iterator begin() const { return _M_ht.begin(); }
const_iterator end() const { return _M_ht.end(); }
pair<iterator, bool> insert(const value_type& __obj)
{ return _M_ht.insert_unique(__obj); }
iterator insert(const_iterator /*__hint*/, const value_type& __obj)
{ return _M_ht.insert_unique(__obj); }
#if defined (_STLP_MEMBER_TEMPLATES)
template <class _InputIterator>
void insert(_InputIterator __f, _InputIterator __l)
#else
void insert(const_iterator __f, const_iterator __l)
{_M_ht.insert_unique(__f, __l); }
void insert(const value_type* __f, const value_type* __l)
#endif
{ _M_ht.insert_unique(__f,__l); }
_STLP_TEMPLATE_FOR_CONT_EXT
iterator find(const _KT& __key) { return _M_ht.find(__key); }
_STLP_TEMPLATE_FOR_CONT_EXT
const_iterator find(const _KT& __key) const { return _M_ht.find(__key); }
_STLP_TEMPLATE_FOR_CONT_EXT
size_type count(const _KT& __key) const { return _M_ht.count(__key); }
_STLP_TEMPLATE_FOR_CONT_EXT
pair<iterator, iterator> equal_range(const _KT& __key)
{ return _M_ht.equal_range(__key); }
_STLP_TEMPLATE_FOR_CONT_EXT
pair<const_iterator, const_iterator> equal_range(const _KT& __key) const
{ return _M_ht.equal_range(__key); }
size_type erase(const key_type& __key) {return _M_ht.erase(__key); }
void erase(const_iterator __it) { _M_ht.erase(__it); }
void erase(const_iterator __f, const_iterator __l) { _M_ht.erase(__f, __l); }
void clear() { _M_ht.clear(); }
size_type bucket_count() const { return _M_ht.bucket_count(); }
size_type max_bucket_count() const { return _M_ht.max_bucket_count(); }
size_type bucket_size(size_type __n) const { return _M_ht.elems_in_bucket(__n); }
_STLP_TEMPLATE_FOR_CONT_EXT
size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
local_iterator begin(size_type __n) { return _M_ht.begin(__n); }
local_iterator end(size_type __n) { return _M_ht.end(__n); }
const_local_iterator begin(size_type __n) const { return _M_ht.begin(__n); }
const_local_iterator end(size_type __n) const { return _M_ht.end(__n); }
float load_factor() const { return _M_ht.load_factor(); }
float max_load_factor() const { return _M_ht.max_load_factor(); }
void max_load_factor(float __val) { _M_ht.max_load_factor(__val); }
void rehash(size_type __hint) { _M_ht.rehash(__hint); }
};
_STLP_END_NAMESPACE
//Specific iterator traits creation
_STLP_CREATE_HASH_ITERATOR_TRAITS(UnorderedMultisetTraitsT, Const_traits)
_STLP_BEGIN_TR1_NAMESPACE
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 unordered_multiset
#if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND)
: public __stlport_class<unordered_multiset<_Value, _HashFcn, _EqualKey, _Alloc> >
#endif
{
typedef unordered_multiset<_Value, _HashFcn, _EqualKey, _Alloc> _Self;
//Specific iterator traits creation
typedef _STLP_PRIV _UnorderedMultisetTraitsT<_Value> _UnorderedMultisetTraits;
public:
typedef hashtable<_Value, _Value, _HashFcn,
_UnorderedMultisetTraits, _STLP_PRIV _Identity<_Value>, _EqualKey, _Alloc> _Ht;
typedef typename _Ht::key_type key_type;
typedef typename _Ht::value_type value_type;
typedef typename _Ht::hasher hasher;
typedef typename _Ht::key_equal key_equal;
typedef typename _Ht::size_type size_type;
typedef typename _Ht::difference_type difference_type;
typedef typename _Ht::pointer pointer;
typedef typename _Ht::const_pointer const_pointer;
typedef typename _Ht::reference reference;
typedef typename _Ht::const_reference const_reference;
typedef typename _Ht::iterator iterator;
typedef typename _Ht::const_iterator const_iterator;
typedef typename _Ht::local_iterator local_iterator;
typedef typename _Ht::const_local_iterator const_local_iterator;
typedef typename _Ht::allocator_type allocator_type;
hasher hash_function() const { return _M_ht.hash_funct(); }
key_equal key_eq() const { return _M_ht.key_eq(); }
allocator_type get_allocator() const { return _M_ht.get_allocator(); }
private:
_Ht _M_ht;
_STLP_KEY_TYPE_FOR_CONT_EXT(key_type)
public:
explicit unordered_multiset(size_type __n = 0, const hasher& __hf = hasher(),
const key_equal& __eql = key_equal(),
const allocator_type& __a = allocator_type())
: _M_ht(__n, __hf, __eql, __a) {}
#if !defined (_STLP_NO_MOVE_SEMANTIC)
unordered_multiset(__move_source<_Self> src)
: _M_ht(__move_source<_Ht>(src.get()._M_ht)) {}
#endif
#if defined (_STLP_MEMBER_TEMPLATES)
template <class _InputIterator>
unordered_multiset(_InputIterator __f, _InputIterator __l,
size_type __n = 0, const hasher& __hf = hasher(),
const key_equal& __eql = key_equal(),
const allocator_type& __a = allocator_type())
: _M_ht(__n, __hf, __eql, __a)
{ _M_ht.insert_equal(__f, __l); }
#else
unordered_multiset(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())
: _M_ht(__n, __hf, __eql, __a)
{ _M_ht.insert_equal(__f, __l); }
unordered_multiset(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())
: _M_ht(__n, __hf, __eql, __a)
{ _M_ht.insert_equal(__f, __l); }
#endif /*_STLP_MEMBER_TEMPLATES */
_Self& operator = (const _Self& __other)
{ _M_ht = __other._M_ht; return *this; }
size_type size() const { return _M_ht.size(); }
size_type max_size() const { return _M_ht.max_size(); }
bool empty() const { return _M_ht.empty(); }
void swap(_Self& hs) { _M_ht.swap(hs._M_ht); }
#if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (_STLP_FUNCTION_TMPL_PARTIAL_ORDER)
void _M_swap_workaround(_Self& __x) { swap(__x); }
#endif
iterator begin() { return _M_ht.begin(); }
iterator end() { return _M_ht.end(); }
const_iterator begin() const { return _M_ht.begin(); }
const_iterator end() const { return _M_ht.end(); }
iterator insert(const value_type& __obj)
{ return _M_ht.insert_equal(__obj); }
iterator insert(const_iterator /*__hint*/, const value_type& __obj)
{ return _M_ht.insert_equal(__obj); }
#if defined (_STLP_MEMBER_TEMPLATES)
template <class _InputIterator>
void insert(_InputIterator __f, _InputIterator __l)
#else
void insert(const value_type* __f, const value_type* __l)
{ _M_ht.insert_equal(__f,__l); }
void insert(const_iterator __f, const_iterator __l)
#endif /*_STLP_MEMBER_TEMPLATES */
{ _M_ht.insert_equal(__f, __l); }
_STLP_TEMPLATE_FOR_CONT_EXT
iterator find(const _KT& __key) { return _M_ht.find(__key); }
_STLP_TEMPLATE_FOR_CONT_EXT
const_iterator find(const _KT& __key) const { return _M_ht.find(__key); }
_STLP_TEMPLATE_FOR_CONT_EXT
size_type count(const _KT& __key) const { return _M_ht.count(__key); }
_STLP_TEMPLATE_FOR_CONT_EXT
pair<iterator, iterator> equal_range(const _KT& __key)
{ return _M_ht.equal_range(__key); }
_STLP_TEMPLATE_FOR_CONT_EXT
pair<const_iterator, const_iterator> equal_range(const _KT& __key) const
{ return _M_ht.equal_range(__key); }
size_type erase(const key_type& __key) {return _M_ht.erase(__key); }
void erase(const_iterator __it) { _M_ht.erase(__it); }
void erase(const_iterator __f, const_iterator __l) { _M_ht.erase(__f, __l); }
void clear() { _M_ht.clear(); }
size_type bucket_count() const { return _M_ht.bucket_count(); }
size_type max_bucket_count() const { return _M_ht.max_bucket_count(); }
size_type bucket_size(size_type __n) const { return _M_ht.elems_in_bucket(__n); }
_STLP_TEMPLATE_FOR_CONT_EXT
size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
local_iterator begin(size_type __n) { return _M_ht.begin(__n); }
local_iterator end(size_type __n) { return _M_ht.end(__n); }
const_local_iterator begin(size_type __n) const { return _M_ht.begin(__n); }
const_local_iterator end(size_type __n) const { return _M_ht.end(__n); }
float load_factor() const { return _M_ht.load_factor(); }
float max_load_factor() const { return _M_ht.max_load_factor(); }
void max_load_factor(float __val) { _M_ht.max_load_factor(__val); }
void rehash(size_type __hint) { _M_ht.rehash(__hint); }
};
#define _STLP_TEMPLATE_HEADER template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
#define _STLP_TEMPLATE_CONTAINER unordered_set<_Value,_HashFcn,_EqualKey,_Alloc>
#include <stl/_relops_hash_cont.h>
#undef _STLP_TEMPLATE_CONTAINER
#define _STLP_TEMPLATE_CONTAINER unordered_multiset<_Value,_HashFcn,_EqualKey,_Alloc>
#include <stl/_relops_hash_cont.h>
#undef _STLP_TEMPLATE_CONTAINER
#undef _STLP_TEMPLATE_HEADER
_STLP_END_NAMESPACE
// Specialization of insert_iterator so that it will work for unordered_set
// and unordered_multiset.
#if defined (_STLP_CLASS_PARTIAL_SPECIALIZATION)
# if !defined (_STLP_NO_MOVE_SEMANTIC)
template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
struct __move_traits<_STLP_TR1 unordered_set<_Value, _HashFcn, _EqualKey, _Alloc> > :
_STLP_PRIV __move_traits_aux<typename _STLP_TR1 unordered_set<_Value, _HashFcn, _EqualKey, _Alloc>::_Ht>
{};
template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
struct __move_traits<_STLP_TR1 unordered_multiset<_Value, _HashFcn, _EqualKey, _Alloc> > :
_STLP_PRIV __move_traits_aux<typename _STLP_TR1 unordered_multiset<_Value, _HashFcn, _EqualKey, _Alloc>::_Ht>
{};
# endif
template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
class insert_iterator<_STLP_TR1 unordered_set<_Value, _HashFcn, _EqualKey, _Alloc> > {
protected:
typedef _STLP_TR1 unordered_set<_Value, _HashFcn, _EqualKey, _Alloc> _Container;
_Container* container;
public:
typedef _Container container_type;
typedef output_iterator_tag iterator_category;
typedef void value_type;
typedef void difference_type;
typedef void pointer;
typedef void reference;
insert_iterator(_Container& __x) : container(&__x) {}
insert_iterator(_Container& __x, typename _Container::iterator)
: container(&__x) {}
insert_iterator<_Container>&
operator=(const typename _Container::value_type& __val) {
container->insert(__val);
return *this;
}
insert_iterator<_Container>& operator*() { return *this; }
insert_iterator<_Container>& operator++() { return *this; }
insert_iterator<_Container>& operator++(int) { return *this; }
};
template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
class insert_iterator<_STLP_TR1 unordered_multiset<_Value, _HashFcn, _EqualKey, _Alloc> > {
protected:
typedef _STLP_TR1 unordered_multiset<_Value, _HashFcn, _EqualKey, _Alloc> _Container;
_Container* container;
typename _Container::iterator iter;
public:
typedef _Container container_type;
typedef output_iterator_tag iterator_category;
typedef void value_type;
typedef void difference_type;
typedef void pointer;
typedef void reference;
insert_iterator(_Container& __x) : container(&__x) {}
insert_iterator(_Container& __x, typename _Container::iterator)
: container(&__x) {}
insert_iterator<_Container>&
operator=(const typename _Container::value_type& __val) {
container->insert(__val);
return *this;
}
insert_iterator<_Container>& operator*() { return *this; }
insert_iterator<_Container>& operator++() { return *this; }
insert_iterator<_Container>& operator++(int) { return *this; }
};
#endif /* _STLP_CLASS_PARTIAL_SPECIALIZATION */
_STLP_END_NAMESPACE
#endif /* _STLP_INTERNAL_UNORDERED_SET_H */
// Local Variables:
// mode:C++
// End:
|
