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
|
/*
*
* Copyright (c) 1994
* Hewlett-Packard Company
*
* Copyright (c) 1996,1997
* Silicon Graphics Computer Systems, Inc.
*
* Copyright (c) 1997
* Moscow Center for SPARC Technology
*
* Copyright (c) 1999
* Boris Fomitchev
*
* 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_SET_H
#define _STLP_INTERNAL_SET_H
#ifndef _STLP_INTERNAL_TREE_H
# include <stl/_tree.h>
#endif
#if !defined (_STLP_USE_PTR_SPECIALIZATIONS)
_STLP_BEGIN_NAMESPACE
//Specific iterator traits creation
_STLP_CREATE_ITERATOR_TRAITS(SetTraitsT, Const_traits)
template <class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less<_Key>),
_STLP_DFL_TMPL_PARAM(_Alloc, allocator<_Key>) >
class set
#if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND)
: public __stlport_class<set<_Key, _Compare, _Alloc> >
#endif
{
typedef set<_Key, _Compare, _Alloc> _Self;
public:
// typedefs:
typedef _Key key_type;
typedef _Key value_type;
typedef _Compare key_compare;
typedef _Compare value_compare;
private:
//Specific iterator traits creation
typedef _STLP_PRIV _SetTraitsT<value_type> _SetTraits;
public:
//Following typedef have to be public for __move_traits specialization.
typedef _STLP_PRIV _Rb_tree<key_type, key_compare,
value_type, _STLP_PRIV _Identity<value_type>,
_SetTraits, _Alloc> _Rep_type;
typedef typename _Rep_type::pointer pointer;
typedef typename _Rep_type::const_pointer const_pointer;
typedef typename _Rep_type::reference reference;
typedef typename _Rep_type::const_reference const_reference;
typedef typename _Rep_type::iterator iterator;
typedef typename _Rep_type::const_iterator const_iterator;
typedef typename _Rep_type::reverse_iterator reverse_iterator;
typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;
typedef typename _Rep_type::size_type size_type;
typedef typename _Rep_type::difference_type difference_type;
typedef typename _Rep_type::allocator_type allocator_type;
private:
_Rep_type _M_t; // red-black tree representing set
_STLP_KEY_TYPE_FOR_CONT_EXT(key_type)
public:
// allocation/deallocation
#if !defined (_STLP_DONT_SUP_DFLT_PARAM)
explicit set(const _Compare& __comp = _Compare(),
const allocator_type& __a = allocator_type())
#else
set()
: _M_t(_Compare(), allocator_type()) {}
explicit set(const _Compare& __comp)
: _M_t(__comp, allocator_type()) {}
set(const _Compare& __comp, const allocator_type& __a)
#endif
: _M_t(__comp, __a) {}
#if defined (_STLP_MEMBER_TEMPLATES)
template <class _InputIterator>
set(_InputIterator __first, _InputIterator __last)
: _M_t(_Compare(), allocator_type())
{ _M_t.insert_unique(__first, __last); }
# if defined (_STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS)
template <class _InputIterator>
set(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
: _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
# endif
template <class _InputIterator>
set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL)
: _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
#else
set(const value_type* __first, const value_type* __last)
: _M_t(_Compare(), allocator_type())
{ _M_t.insert_unique(__first, __last); }
set(const value_type* __first,
const value_type* __last, const _Compare& __comp,
const allocator_type& __a = allocator_type())
: _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
set(const_iterator __first, const_iterator __last)
: _M_t(_Compare(), allocator_type())
{ _M_t.insert_unique(__first, __last); }
set(const_iterator __first, const_iterator __last, const _Compare& __comp,
const allocator_type& __a = allocator_type())
: _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
#endif /* _STLP_MEMBER_TEMPLATES */
set(const _Self& __x) : _M_t(__x._M_t) {}
#if !defined (_STLP_NO_MOVE_SEMANTIC)
set(__move_source<_Self> src)
: _M_t(__move_source<_Rep_type>(src.get()._M_t)) {}
#endif
_Self& operator=(const _Self& __x) {
_M_t = __x._M_t;
return *this;
}
// accessors:
key_compare key_comp() const { return _M_t.key_comp(); }
value_compare value_comp() const { return _M_t.key_comp(); }
allocator_type get_allocator() const { return _M_t.get_allocator(); }
iterator begin() { return _M_t.begin(); }
iterator end() { return _M_t.end(); }
const_iterator begin() const { return _M_t.begin(); }
const_iterator end() const { return _M_t.end(); }
reverse_iterator rbegin() { return _M_t.rbegin(); }
reverse_iterator rend() { return _M_t.rend(); }
const_reverse_iterator rbegin() const { return _M_t.rbegin(); }
const_reverse_iterator rend() const { return _M_t.rend(); }
bool empty() const { return _M_t.empty(); }
size_type size() const { return _M_t.size(); }
size_type max_size() const { return _M_t.max_size(); }
void swap(_Self& __x) { _M_t.swap(__x._M_t); }
#if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (_STLP_FUNCTION_TMPL_PARTIAL_ORDER)
void _M_swap_workaround(_Self& __x) { swap(__x); }
#endif
// insert/erase
pair<iterator,bool> insert(const value_type& __x)
{ return _M_t.insert_unique(__x); }
iterator insert(iterator __pos, const value_type& __x)
{ return _M_t.insert_unique( __pos , __x); }
#if defined (_STLP_MEMBER_TEMPLATES)
template <class _InputIterator>
void insert(_InputIterator __first, _InputIterator __last)
{ _M_t.insert_unique(__first, __last); }
#else
void insert(const_iterator __first, const_iterator __last)
{ _M_t.insert_unique(__first, __last); }
void insert(const value_type* __first, const value_type* __last)
{ _M_t.insert_unique(__first, __last); }
#endif /* _STLP_MEMBER_TEMPLATES */
void erase(iterator __pos) { _M_t.erase( __pos ); }
size_type erase(const key_type& __x) { return _M_t.erase_unique(__x); }
void erase(iterator __first, iterator __last) { _M_t.erase(__first, __last ); }
void clear() { _M_t.clear(); }
// set operations:
_STLP_TEMPLATE_FOR_CONT_EXT
const_iterator find(const _KT& __x) const { return _M_t.find(__x); }
_STLP_TEMPLATE_FOR_CONT_EXT
iterator find(const _KT& __x) { return _M_t.find(__x); }
_STLP_TEMPLATE_FOR_CONT_EXT
size_type count(const _KT& __x) const
{ return _M_t.find(__x) == _M_t.end() ? 0 : 1 ; }
_STLP_TEMPLATE_FOR_CONT_EXT
iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); }
_STLP_TEMPLATE_FOR_CONT_EXT
const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); }
_STLP_TEMPLATE_FOR_CONT_EXT
iterator upper_bound(const _KT& __x) { return _M_t.upper_bound(__x); }
_STLP_TEMPLATE_FOR_CONT_EXT
const_iterator upper_bound(const _KT& __x) const { return _M_t.upper_bound(__x); }
_STLP_TEMPLATE_FOR_CONT_EXT
pair<iterator, iterator> equal_range(const _KT& __x)
{ return _M_t.equal_range_unique(__x); }
_STLP_TEMPLATE_FOR_CONT_EXT
pair<const_iterator, const_iterator> equal_range(const _KT& __x) const
{ return _M_t.equal_range_unique(__x); }
};
//Specific iterator traits creation
_STLP_CREATE_ITERATOR_TRAITS(MultisetTraitsT, Const_traits)
template <class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less<_Key>),
_STLP_DFL_TMPL_PARAM(_Alloc, allocator<_Key>) >
class multiset
#if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND)
: public __stlport_class<multiset<_Key, _Compare, _Alloc> >
#endif
{
typedef multiset<_Key, _Compare, _Alloc> _Self;
public:
// typedefs:
typedef _Key key_type;
typedef _Key value_type;
typedef _Compare key_compare;
typedef _Compare value_compare;
private:
//Specific iterator traits creation
typedef _STLP_PRIV _MultisetTraitsT<value_type> _MultisetTraits;
public:
//Following typedef have to be public for __move_traits specialization.
typedef _STLP_PRIV _Rb_tree<key_type, key_compare,
value_type, _STLP_PRIV _Identity<value_type>,
_MultisetTraits, _Alloc> _Rep_type;
typedef typename _Rep_type::pointer pointer;
typedef typename _Rep_type::const_pointer const_pointer;
typedef typename _Rep_type::reference reference;
typedef typename _Rep_type::const_reference const_reference;
typedef typename _Rep_type::iterator iterator;
typedef typename _Rep_type::const_iterator const_iterator;
typedef typename _Rep_type::reverse_iterator reverse_iterator;
typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;
typedef typename _Rep_type::size_type size_type;
typedef typename _Rep_type::difference_type difference_type;
typedef typename _Rep_type::allocator_type allocator_type;
private:
_Rep_type _M_t; // red-black tree representing multiset
_STLP_KEY_TYPE_FOR_CONT_EXT(key_type)
public:
#if !defined (_STLP_DONT_SUP_DFLT_PARAM)
explicit multiset(const _Compare& __comp = _Compare(),
const allocator_type& __a = allocator_type())
#else
multiset()
: _M_t(_Compare(), allocator_type()) {}
explicit multiset(const _Compare& __comp)
: _M_t(__comp, allocator_type()) {}
multiset(const _Compare& __comp, const allocator_type& __a)
#endif
: _M_t(__comp, __a) {}
#if defined (_STLP_MEMBER_TEMPLATES)
template <class _InputIterator>
multiset(_InputIterator __first, _InputIterator __last)
: _M_t(_Compare(), allocator_type())
{ _M_t.insert_equal(__first, __last); }
template <class _InputIterator>
multiset(_InputIterator __first, _InputIterator __last,
const _Compare& __comp,
const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL)
: _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); }
# if defined (_STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS)
template <class _InputIterator>
multiset(_InputIterator __first, _InputIterator __last,
const _Compare& __comp)
: _M_t(__comp, allocator_type()) { _M_t.insert_equal(__first, __last); }
# endif
#else
multiset(const value_type* __first, const value_type* __last)
: _M_t(_Compare(), allocator_type())
{ _M_t.insert_equal(__first, __last); }
multiset(const value_type* __first, const value_type* __last,
const _Compare& __comp,
const allocator_type& __a = allocator_type())
: _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); }
multiset(const_iterator __first, const_iterator __last)
: _M_t(_Compare(), allocator_type())
{ _M_t.insert_equal(__first, __last); }
multiset(const_iterator __first, const_iterator __last,
const _Compare& __comp,
const allocator_type& __a = allocator_type())
: _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); }
#endif /* _STLP_MEMBER_TEMPLATES */
multiset(const _Self& __x) : _M_t(__x._M_t) {}
_Self& operator=(const _Self& __x) {
_M_t = __x._M_t;
return *this;
}
#if !defined (_STLP_NO_MOVE_SEMANTIC)
multiset(__move_source<_Self> src)
: _M_t(__move_source<_Rep_type>(src.get()._M_t)) {}
#endif
// accessors:
key_compare key_comp() const { return _M_t.key_comp(); }
value_compare value_comp() const { return _M_t.key_comp(); }
allocator_type get_allocator() const { return _M_t.get_allocator(); }
iterator begin() { return _M_t.begin(); }
iterator end() { return _M_t.end(); }
const_iterator begin() const { return _M_t.begin(); }
const_iterator end() const { return _M_t.end(); }
reverse_iterator rbegin() { return _M_t.rbegin(); }
reverse_iterator rend() { return _M_t.rend(); }
const_reverse_iterator rbegin() const { return _M_t.rbegin(); }
const_reverse_iterator rend() const { return _M_t.rend(); }
bool empty() const { return _M_t.empty(); }
size_type size() const { return _M_t.size(); }
size_type max_size() const { return _M_t.max_size(); }
void swap(_Self& __x) { _M_t.swap(__x._M_t); }
#if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (_STLP_FUNCTION_TMPL_PARTIAL_ORDER)
void _M_swap_workaround(_Self& __x) { swap(__x); }
#endif
// insert/erase
iterator insert(const value_type& __x)
{ return _M_t.insert_equal(__x); }
iterator insert(iterator __pos, const value_type& __x)
{ return _M_t.insert_equal(__pos, __x); }
#if defined (_STLP_MEMBER_TEMPLATES)
template <class _InputIterator>
void insert(_InputIterator __first, _InputIterator __last)
{ _M_t.insert_equal(__first, __last); }
#else
void insert(const value_type* __first, const value_type* __last)
{ _M_t.insert_equal(__first, __last); }
void insert(const_iterator __first, const_iterator __last)
{ _M_t.insert_equal(__first, __last); }
#endif /* _STLP_MEMBER_TEMPLATES */
void erase(iterator __pos) { _M_t.erase( __pos ); }
size_type erase(const key_type& __x) { return _M_t.erase(__x); }
void erase(iterator __first, iterator __last) { _M_t.erase( __first, __last ); }
void clear() { _M_t.clear(); }
// multiset operations:
_STLP_TEMPLATE_FOR_CONT_EXT
iterator find(const _KT& __x) { return _M_t.find(__x); }
_STLP_TEMPLATE_FOR_CONT_EXT
const_iterator find(const _KT& __x) const { return _M_t.find(__x); }
_STLP_TEMPLATE_FOR_CONT_EXT
size_type count(const _KT& __x) const { return _M_t.count(__x); }
_STLP_TEMPLATE_FOR_CONT_EXT
iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); }
_STLP_TEMPLATE_FOR_CONT_EXT
const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); }
_STLP_TEMPLATE_FOR_CONT_EXT
iterator upper_bound(const _KT& __x) { return _M_t.upper_bound(__x); }
_STLP_TEMPLATE_FOR_CONT_EXT
const_iterator upper_bound(const _KT& __x) const { return _M_t.upper_bound(__x); }
_STLP_TEMPLATE_FOR_CONT_EXT
pair<iterator, iterator> equal_range(const _KT& __x) { return _M_t.equal_range(__x); }
_STLP_TEMPLATE_FOR_CONT_EXT
pair<const_iterator, const_iterator> equal_range(const _KT& __x) const { return _M_t.equal_range(__x); }
};
#else
# include <stl/pointers/_set.h>
_STLP_BEGIN_NAMESPACE
#endif /* _STLP_USE_PTR_SPECIALIZATIONS */
#define _STLP_TEMPLATE_HEADER template <class _Key, class _Compare, class _Alloc>
#define _STLP_TEMPLATE_CONTAINER set<_Key,_Compare,_Alloc>
#include <stl/_relops_cont.h>
#undef _STLP_TEMPLATE_CONTAINER
#define _STLP_TEMPLATE_CONTAINER multiset<_Key,_Compare,_Alloc>
#include <stl/_relops_cont.h>
#undef _STLP_TEMPLATE_CONTAINER
#undef _STLP_TEMPLATE_HEADER
#if defined (_STLP_CLASS_PARTIAL_SPECIALIZATION) && !defined (_STLP_NO_MOVE_SEMANTIC)
template <class _Key, class _Compare, class _Alloc>
struct __move_traits<set<_Key,_Compare,_Alloc> > :
_STLP_PRIV __move_traits_aux<typename set<_Key,_Compare,_Alloc>::_Rep_type>
{};
template <class _Key, class _Compare, class _Alloc>
struct __move_traits<multiset<_Key,_Compare,_Alloc> > :
_STLP_PRIV __move_traits_aux<typename multiset<_Key,_Compare,_Alloc>::_Rep_type>
{};
#endif
_STLP_END_NAMESPACE
#endif /* _STLP_INTERNAL_SET_H */
// Local Variables:
// mode:C++
// End:
|
