-
Notifications
You must be signed in to change notification settings - Fork 0
/
set.hpp
176 lines (151 loc) · 6.89 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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* set.hpp :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: mannouao <mannouao@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2022/07/28 16:17:26 by mannouao #+# #+# */
/* Updated: 2022/07/29 15:28:00 by mannouao ### ########.fr */
/* */
/* ************************************************************************** */
# ifndef SET_HPP
# define SET_HPP
# include "__tree.hpp"
# include "vector.hpp"
# include <memory>
namespace ft
{
// set -------------------------------------------------------------------------------------------------------------
template<class _Tp, class _Compare = std::less<_Tp>, class _Allocator = std::allocator<_Tp> >
class set
{
public:
typedef _Tp key_type;
typedef key_type value_type;
typedef _Compare key_compare;
typedef key_compare value_compare;
typedef _Allocator allocator_type;
private:
typedef ft::tree<key_type, value_type, key_compare, allocator_type> tree_type;
tree_type __tree_;
public:
typedef typename tree_type::reference reference;
typedef typename tree_type::const_reference const_reference;
typedef typename tree_type::pointer pointer;
typedef typename tree_type::const_pointer const_pointer;
typedef typename tree_type::difference_type difference_type;
typedef typename tree_type::size_type size_type;
typedef typename tree_type::iterator iterator;
typedef typename tree_type::const_iterator const_iterator;
typedef ft::reverse_iterator<iterator> reverse_iterator;
typedef ft::reverse_iterator<const_iterator> const_reverse_iterator;
explicit set(const key_compare& comp = key_compare(), const allocator_type& alloc = allocator_type())
: __tree_(comp, alloc)
{}
template<class _Iter>
set(_Iter first, _Iter secend, const key_compare& comp = key_compare(), const allocator_type& alloc = allocator_type())
: __tree_(comp, alloc)
{ insert(first, secend); }
set(const set& __s)
: __tree_(__s.__tree_)
{ insert(__s.begin(), __s.end()); }
~set() {};
set& operator = (const set& __s)
{
if (this != &__s)
{
clear();
__tree_.value_comp() = __s.__tree_.value_comp();
insert(__s.begin(), __s.end());
}
return *this;
}
iterator begin() { return __tree_.begin(); }
const_iterator begin() const { return __tree_.begin(); }
iterator end() { return __tree_.end(); }
const_iterator end() const { return __tree_.end(); }
reverse_iterator rbegin() { return reverse_iterator(end()); }
const_reverse_iterator rbegin() const { return const_reverse_iterator(end()); }
reverse_iterator rend() { return reverse_iterator(begin()); }
const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
iterator lower_bound(const key_type& __k) { return __tree_.lower_bound(__k); }
const_iterator lower_bound(const key_type& __k) const { return __tree_.lower_bound(__k); }
iterator upper_bound(const key_type& __k) { return __tree_.upper_bound(__k); }
const_iterator upper_bound(const key_type& __k) const { return __tree_.upper_bound(__k); }
iterator find(const key_type& __k) { return __tree_.find(__k); }
const_iterator find(const key_type& __k) const { return __tree_.find(__k); }
bool empty() const { return __tree_.size() == 0; }
size_type size() const { return __tree_.size(); }
size_type max_size() const { return __tree_.max_size(); }
allocator_type get_allocator() const { return __tree_.get_allocator(); }
key_compare key_comp() const { return __tree_.value_comp(); }
value_compare value_comp() const { return key_comp(); }
ft::pair<iterator, bool> insert(const value_type& val) { return __tree_.insert(val); }
iterator insert(iterator __p, const value_type& val) { return __tree_.insert(__p, val); }
template<class _Iter>
void insert(_Iter first, _Iter last)
{
for (; first != last; ++first)
insert(*first);
}
void erase(iterator __pos) { return __tree_.erase(__pos); }
size_type erase(const key_type& __k)
{
iterator __p = find(__k);
if (__p != end())
{
__tree_.erase(__p);
return (1);
}
return (0);
}
void erase(iterator first, iterator last)
{
ft::vector<value_type> holder(first, last);
for (size_t i = 0; i < holder.size(); ++i)
erase(holder[i]);
}
void swap(set& __x) { __tree_.swap(__x.__tree_); }
void clear() { __tree_.clear(); }
size_type count(const key_type& __k) const { return find(__k) != end(); }
ft::pair<iterator, iterator> equal_range(const value_type& __k) const
{
iterator __p = lower_bound(__k);
if (__p == end() || *__p != __k)
return ft::make_pair(__p, __p);
else
return ft::make_pair(__p++, __p);
}
};
template<class _Key, class _Compare, class _Allocator>
bool operator == (const set<_Key, _Compare, _Allocator>& __x,
const set<_Key, _Compare, _Allocator>& __y)
{ return __x.size() == __y.size() && ft::equal(__x.begin(), __x.end(), __y.begin()); }
template<class _Key, class _Compare, class _Allocator>
bool operator < (const set<_Key, _Compare, _Allocator>& __x,
const set<_Key, _Compare, _Allocator>& __y)
{ return ft::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end()); }
template<class _Key, class _Compare, class _Allocator>
bool operator != (const set<_Key, _Compare, _Allocator>& __x,
const set<_Key, _Compare, _Allocator>& __y)
{ return !(__x == __y); }
template<class _Key, class _Compare, class _Allocator>
bool operator > (const set<_Key, _Compare, _Allocator>& __x,
const set<_Key, _Compare, _Allocator>& __y)
{ return __y < __x; }
template<class _Key, class _Compare, class _Allocator>
bool operator >= (const set<_Key, _Compare, _Allocator>& __x,
const set<_Key, _Compare, _Allocator>& __y)
{ return !(__x < __y); }
template<class _Key, class _Compare, class _Allocator>
bool operator <= (const set<_Key, _Compare, _Allocator>& __x,
const set<_Key, _Compare, _Allocator>& __y)
{ return !(__y < __x); }
template<class _Key, class _Compare, class _Allocator>
void swap(set<_Key, _Compare, _Allocator>& __x,
set<_Key, _Compare, _Allocator>& __y)
{ __x.swap(__y); }
// -----------------------------------------------------------------------------------------------------------------
} // ft
# endif