-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathutil.hpp
217 lines (167 loc) · 5.6 KB
/
util.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
#ifndef DB_UTIL_HPP
#define DB_UTIL_HPP
#include <set>
#include <string>
#include <iostream>
template <typename T>
using Set = std::set<T>;
class Field {
private:
friend std::istream& operator >> (std::istream& in, Field& field);
friend std::ostream& operator << (std::ostream& out, const Field& field);
std::string string_;
public:
Field(const char *s): string_{s} {}
Field(std::string s): string_{std::move(s)} {}
Field() = default;
Field(const Field& other) {
string_ = other.string_;
}
Field(Field&& other) {
string_ = other.string_;
}
bool operator == (const Field& other) const {
return string_ == other.string_;
}
bool operator == (Field&& other) const {
return string_ == other.string_;
}
bool operator < (const Field& other) const {
return string_ < other.string_;
}
bool operator < (Field&& other) const {
return string_ < other.string_;
}
Field& operator = (const Field& other) {
string_ = other.string_;
return *this;
}
Field& operator = (Field&& other) {
string_ = other.string_;
return *this;
}
operator Set<Field>() const {
return Set<Field>{*this};
}
};
using FieldSet = Set<Field>;
using FD = std::pair<FieldSet, FieldSet>;
using FDSet = Set<FD>;
namespace detail {
template <typename Set>
struct is_set: std::false_type {};
template <typename E>
struct is_set<Set<E>>: std::true_type {};
template <typename T>
using remove_rcv_t = std::remove_cv_t<std::remove_reference_t<T>>;
template <bool Value, bool ... Values>
struct all_of {
static constexpr bool value = Value && all_of<Values...>::value;
};
template <bool Value>
struct all_of<Value> {
static constexpr bool value = Value;
};
template <typename ... Sets>
using all_are_set_t = std::enable_if_t<
all_of<is_set<remove_rcv_t<Sets>>::value ...>::value>;
} // namespace detail
using detail::all_are_set_t;
template <typename Field>
auto make_set(Field&& field) {
return Set<
std::remove_cv_t<std::remove_reference_t<Field>>
>{std::forward<Field>(field)};
}
template <typename Field, typename ... Fields>
auto make_set(Field&& field, Fields&& ... fields) {
auto set = make_set(std::forward<Fields>(fields)...);
set.insert(std::forward<Field>(field));
return set;
}
template <typename Set, typename Element, typename = all_are_set_t<Set>>
bool set_contains(Set&& set, Element&& e) {
return set.find(std::forward<Element>(e)) != set.end();
}
template <typename ... Args>
FD make_FD(Args&& ... args) {
return FD{args ...};
}
template <typename Set1, typename Set2, typename = all_are_set_t<Set1, Set2>>
auto set_union(Set1&& set1, Set2&& set2) {
using ReturnType = std::remove_cv_t<std::remove_reference_t<Set1>>;
using ReturnType2 = std::remove_cv_t<std::remove_reference_t<Set2>>;
static_assert(std::is_same<ReturnType, ReturnType2>::value, "Same parameter's types");
ReturnType result{set1};
result.insert(set2.begin(), set2.end());
return result;
}
template <typename Set1, typename Set2, typename = all_are_set_t<Set1, Set2>>
auto operator + (Set1&& set1, Set2&& set2) {
return set_union(std::forward<Set1>(set1), std::forward<Set2>(set2));
}
template <typename Set1, typename Set2>
all_are_set_t<Set1, Set2>
operator += (Set1&& set1, Set2&& set2) {
for (auto& e: set2) {
set1.insert(e);
}
}
template <typename Set1, typename Set2, typename = all_are_set_t<Set1, Set2>>
auto set_difference(Set1&& set1, Set2&& set2) {
using ReturnType = std::remove_cv_t<std::remove_reference_t<Set1>>;
using ReturnType2 = std::remove_cv_t<std::remove_reference_t<Set2>>;
static_assert(std::is_same<ReturnType, ReturnType2>::value, "Same parameter's types");
ReturnType result{set1};
for (auto& e: set2) {
auto it = result.find(e);
if (it != result.end())
result.erase(it);
}
return result;
}
template <typename Set1, typename Set2, typename = all_are_set_t<Set1, Set2>>
auto operator - (Set1&& set1, Set2&& set2) {
return set_difference(std::forward<Set1>(set1), std::forward<Set2>(set2));
}
template <typename Set1, typename Set2>
all_are_set_t<Set1, Set2>
operator -= (Set1&& set1, Set2&& set2) {
for (auto& e: set2) {
auto it = set1.find(e);
if (it != set1.end()) {
set1.erase(it);
}
}
}
template <typename Set1, typename Set2, typename = all_are_set_t<Set1, Set2>>
auto set_intersection(Set1&& set1, Set2&& set2) {
using ReturnType = std::remove_cv_t<std::remove_reference_t<Set1>>;
using ReturnType2 = std::remove_cv_t<std::remove_reference_t<Set2>>;
static_assert(std::is_same<ReturnType, ReturnType2>::value, "Same parameter's types");
ReturnType result;
for (auto& e: set2) {
if (set1.find(e) != set1.end()) {
result.insert(e);
}
}
return result;
}
template <typename Set1, typename Set2, typename = all_are_set_t<Set1, Set2>>
auto operator * (Set1&& set1, Set2&& set2) {
return set_intersection(std::forward<Set1>(set1), std::forward<Set2>(set2));
}
template <typename Set1, typename Set2, typename = all_are_set_t<Set1, Set2>>
bool is_subset(Set1&& set1, Set2&& set2) {
for (auto& e: set1) {
if (set2.find(e) == set2.end())
return false;
}
return true;
}
FieldSet field_set_from(const FDSet& set);
FieldSet field_set_from(FDSet&& set);
std::istream& operator >> (std::istream& in, FDSet& set);
std::ostream& operator << (std::ostream& out, const FDSet& set);
std::ostream& operator << (std::ostream& out, FDSet&& set);
#endif // DB_UTIL_HPP