-
Notifications
You must be signed in to change notification settings - Fork 0
/
set.hpp
390 lines (298 loc) · 13.2 KB
/
set.hpp
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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* set.hpp :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: ncarob <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2022/11/08 18:33:47 by ncarob #+# #+# */
/* Updated: 2022/12/04 17:58:34 by ncarob ### ########.fr */
/* */
/* ************************************************************************** */
#ifndef SET_H
# define SET_H
# include "Additional/less.hpp"
# include "Additional/equal.hpp"
# include "Additional/red_black_tree.hpp"
# include "Additional/lexicographical_compare.hpp"
namespace ft
{
template <typename T, typename Compare = ft::less<T>, typename Allocator = std::allocator<T> >
class set {
public:
/* MEMBER TYPES */
typedef T key_type;
typedef T value_type;
typedef Compare key_compare;
typedef Compare value_compare;
private:
typedef typename ft::red_black_tree<value_type, value_compare, Allocator> tree_type;
public:
typedef typename tree_type::pointer pointer;
typedef typename tree_type::const_pointer const_pointer;
typedef typename tree_type::reference reference;
typedef typename tree_type::const_reference const_reference;
typedef typename tree_type::iterator iterator;
typedef typename tree_type::const_iterator const_iterator;
typedef typename tree_type::reverse_iterator reverse_iterator;
typedef typename tree_type::const_reverse_iterator const_reverse_iterator;
typedef Allocator allocator_type;
typedef std::ptrdiff_t difference_type;
typedef std::size_t size_type;
/* ASSIGNMENT */
explicit set (const key_compare& comp = key_compare(), const allocator_type& alloc = allocator_type());
template <class InputIterator>
set(InputIterator first, InputIterator last, const key_compare& comp = key_compare(), const allocator_type& alloc = allocator_type());
set(const set& other);
~set();
set& operator = (const set& other);
/* ITERATORS */
iterator begin();
iterator end();
const_iterator begin() const;
const_iterator end() const;
reverse_iterator rbegin();
reverse_iterator rend();
const_reverse_iterator rbegin() const;
const_reverse_iterator rend() const;
/* CAPACITY */
bool empty() const;
size_type size(void) const;
size_type max_size(void) const;
/* MODIFIERS */
template <class InputIterator>
void insert(InputIterator first, InputIterator last);
pair<iterator,bool> insert(const value_type& val);
iterator insert(iterator position, const value_type& val);
void erase(iterator position);
size_type erase(const key_type& k);
void erase(iterator first, iterator last);
void swap(set& x);
void clear(void);
/* COMPARISON OBJECTS */
key_compare key_comp() const;
value_compare value_comp() const;
/* ELEMENT ACCESS */
iterator find(const key_type& k);
const_iterator find(const key_type& k) const;
size_type count(const key_type& k) const;
iterator lower_bound(const key_type& k);
const_iterator lower_bound(const key_type& k) const;
iterator upper_bound(const key_type& k);
const_iterator upper_bound(const key_type& k) const;
pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
pair<iterator,iterator> equal_range(const key_type& k);
/* ALLOCATOR */
allocator_type get_allocator() const;
private:
tree_type _tree;
};
/* CONSTRUCTORS AND DESTRUCTOR START --> */
template <typename T, typename Compare, typename Allocator>
set<T, Compare, Allocator>::set (const key_compare& comp, const allocator_type& alloc) : _tree(comp, alloc) { }
template <typename T, typename Compare, typename Allocator>
template <class InputIterator>
set<T, Compare, Allocator>::set(InputIterator first, InputIterator last, const key_compare& comp, const allocator_type& alloc) : _tree(comp, alloc) {
for (; first != last; ++first)
_tree.insert(nullptr, *first);
}
template <typename T, typename Compare, typename Allocator>
set<T, Compare, Allocator>::set(const set& other) : _tree(other._tree._compare, other._tree._alloc) {
for (const_iterator it1 = other.begin(), it2 = other.end(); it1 != it2; ++it1)
_tree.insert(nullptr, *it1);
}
template <typename T, typename Compare, typename Allocator>
set<T, Compare, Allocator>::~set() { }
template <typename T, typename Compare, typename Allocator>
set<T, Compare, Allocator>& set<T, Compare, Allocator>::operator = (const set& other) {
_tree = other._tree;
return *this;
}
/* <-- CONSTRUCTORS AND DESTRUCTOR END */
/* ITERATORS START --> */
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::iterator set<T, Compare, Allocator>::begin() {
return _tree.begin();
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::iterator set<T, Compare, Allocator>::end() {
return _tree.end();
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::const_iterator set<T, Compare, Allocator>::begin() const {
return _tree.begin();
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::const_iterator set<T, Compare, Allocator>::end() const {
return _tree.end();
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::reverse_iterator set<T, Compare, Allocator>::rbegin() {
return _tree.rbegin();
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::reverse_iterator set<T, Compare, Allocator>::rend() {
return _tree.rend();
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::const_reverse_iterator set<T, Compare, Allocator>::rbegin() const {
return _tree.rbegin();
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::const_reverse_iterator set<T, Compare, Allocator>::rend() const {
return _tree.rend();
}
/* <-- ITERATORS END */
/* CAPACITY START --> */
template <typename T, typename Compare, typename Allocator>
bool set<T, Compare, Allocator>::empty() const {
return size() ? false : true;
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::size_type set<T, Compare, Allocator>::size(void) const {
return _tree.size();
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::size_type set<T, Compare, Allocator>::max_size(void) const {
return _tree._alloc.max_size() > __LONG_LONG_MAX__ ? __LONG_LONG_MAX__ : _tree._alloc.max_size();
}
/* <-- CAPACITY END */
/* MODIFIERS START --> */
template <typename T, typename Compare, typename Allocator>
template <class InputIterator>
void set<T, Compare, Allocator>::insert(InputIterator first, InputIterator last) {
for (; first != last; ++first)
_tree.insert(nullptr, *first);
}
template <typename T, typename Compare, typename Allocator>
ft::pair<typename set<T, Compare, Allocator>::iterator, bool> set<T, Compare, Allocator>::insert(const value_type& val) {
return _tree.insert(nullptr, val);
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::iterator set<T, Compare, Allocator>::insert(iterator position, const value_type& val) {
return _tree.insert(position._base, val).first;
}
template <typename T, typename Compare, typename Allocator>
void set<T, Compare, Allocator>::erase(iterator position) {
_tree.erase(position._base);
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::size_type set<T, Compare, Allocator>::erase(const key_type& k) {
iterator it = find(k);
if (it != end()) {
_tree.erase(it._base);
return 1;
}
return 0;
}
template <typename T, typename Compare, typename Allocator>
void set<T, Compare, Allocator>::erase(iterator first, iterator last) {
size_type arr_size = std::distance(first, last);
key_type* array = new key_type [arr_size];
for (size_type i = 0; first != last; ++first, ++i) {
array[i] = *first;
}
for (size_type i = 0; i < arr_size; ++i) {
erase(array[i]);
}
delete [] array;
}
template <typename T, typename Compare, typename Allocator>
void set<T, Compare, Allocator>::swap(set& x) {
tree_type buf = x._tree;
x._tree = _tree;
_tree = buf;
}
template <typename T, typename Compare, typename Allocator>
void set<T, Compare, Allocator>::clear(void) {
_tree.clear();
}
/* <-- MODIFIERS END */
/* COMPARISON OBJECTS START --> */
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::key_compare set<T, Compare, Allocator>::key_comp(void) const {
return key_compare();
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::value_compare set<T, Compare, Allocator>::value_comp(void) const {
return value_compare();
}
/* <-- COMPARISON OBJECTS END */
/* ELEMENT ACCESS START --> */
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::iterator set<T, Compare, Allocator>::find(const key_type& k) {
return _tree.find(k);
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::const_iterator set<T, Compare, Allocator>::find(const key_type& k) const {
return _tree.find(k);
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::size_type set<T, Compare, Allocator>::count(const key_type& k) const {
return (_tree.find(k) == end() ? 0 : 1);
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::iterator set<T, Compare, Allocator>::lower_bound(const key_type& k) {
return _tree.lower_bound(k);
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::const_iterator set<T, Compare, Allocator>::lower_bound(const key_type& k) const {
return _tree.lower_bound(k);
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::iterator set<T, Compare, Allocator>::upper_bound(const key_type& k) {
return _tree.upper_bound(k);
}
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::const_iterator set<T, Compare, Allocator>::upper_bound(const key_type& k) const {
return _tree.upper_bound(k);
}
template <typename T, typename Compare, typename Allocator>
ft::pair<typename set<T, Compare, Allocator>::const_iterator, typename set<T, Compare, Allocator>::const_iterator> set<T, Compare, Allocator>::equal_range(const key_type& k) const {
return ft::make_pair(lower_bound(k), upper_bound(k));
};
template <typename T, typename Compare, typename Allocator>
ft::pair<typename set<T, Compare, Allocator>::iterator, typename set<T, Compare, Allocator>::iterator> set<T, Compare, Allocator>::equal_range(const key_type& k) {
return ft::make_pair(lower_bound(k), upper_bound(k));
}
/* <-- ELEMENT ACCESS END */
/* ALLOCATOR START --> */
template <typename T, typename Compare, typename Allocator>
typename set<T, Compare, Allocator>::allocator_type set<T, Compare, Allocator>::get_allocator() const {
return allocator_type();
}
/* <-- ALLOCATOR END */
/* NON-MEMBER FUNCTION OVERLOADS START --> */
template <typename T, typename Compare, typename Allocator>
bool operator == (const set<T, Compare, Allocator>& lhs, const set<T, Compare, Allocator>& rhs) {
if (lhs.size() != rhs.size())
return false;
return ft::equal(lhs.begin(), lhs.end(), rhs.begin());
}
template <typename T, typename Compare, typename Allocator>
bool operator != (const set<T, Compare, Allocator>& lhs, const set<T, Compare, Allocator>& rhs) {
return !(lhs == rhs);
}
template <typename T, typename Compare, typename Allocator>
bool operator < (const set<T, Compare, Allocator>& lhs, const set<T, Compare, Allocator>& rhs) {
return ft::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end());
}
template <typename T, typename Compare, typename Allocator>
bool operator <= (const set<T, Compare, Allocator>& lhs, const set<T, Compare, Allocator>& rhs) {
return !(rhs < lhs);
}
template <typename T, typename Compare, typename Allocator>
bool operator > (const set<T, Compare, Allocator>& lhs, const set<T, Compare, Allocator>& rhs) {
return (rhs < lhs);
}
template <typename T, typename Compare, typename Allocator>
bool operator >= (const set<T, Compare, Allocator>& lhs, const set<T, Compare, Allocator>& rhs) {
return !(lhs < rhs);
}
template <typename T, typename Compare, typename Allocator>
void swap(set<T, Compare, Allocator>& lhs, set<T, Compare, Allocator>& rhs) {
lhs.swap(rhs);
}
/* <-- NON-MEMBER FUNCTION OVERLOADS END */
} /* FT NAMESPACE */
#endif /* SET_H */