-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfunctionalIterator.h
215 lines (160 loc) · 5.48 KB
/
functionalIterator.h
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
//
// Created by datagram-db on 13/10/2019.
//
#ifndef SKELETON_FUNCTIONALITERATOR_H
#define SKELETON_FUNCTIONALITERATOR_H
#include "languageStyleIterator/javaIterators.h"
#include <functional>
#include <ostream>
namespace functional {
/**
* Maps the elements of a collection without recreating a new value
* @tparam T type of the original iterator
* @tparam U type of the transformed iterator
*/
template<typename T, typename U>
class MapIterator : public java::Iterator<U> {
java::Iterator<T> *iterator;
std::function<U(T)> fun;
public:
MapIterator(java::Iterator<T> *iterator, const std::function<U(T)> &fun) : iterator(iterator), fun(fun) {}
MapIterator(MapIterator<T, U>& cp) : iterator{cp.iterator}, fun{cp.fun} {}
~MapIterator() override {
if (iterator) delete iterator;
}
bool hasNext() override {
return iterator && iterator->hasNext();
}
U next() override {
return fun(iterator->next());
}
/**
* Clones the current element into a shared_ptr
* @return
*/
std::shared_ptr<java::Iterator<U>> clone() override { return std::make_shared<java::Iterator<U>>(*this); }
};
template<typename T, typename U>
java::Iterator<T> *operator>>(java::Iterator<T> *os, const std::function<U(T)> &pref) {
return new MapIterator<T, U>(os, pref);
}
/**
* Filters the elements of a collection without creating a shrinked collection
* @tparam T
*/
template<typename T>
class FilterIterator : public java::Iterator<T> {
java::Iterator<T> *iterator;
std::function<bool(T)> predicate;
T elem;
public:
FilterIterator(java::Iterator<T> *iterator, const std::function<bool(T)> &fun) : iterator(iterator),
predicate(fun) {}
FilterIterator(FilterIterator<T>& cp) : iterator{cp.iterator}, predicate{cp.predicate} {}
~FilterIterator<T>() override {}
bool hasNext() override {
if (!iterator->hasNext())
return false;
while (iterator->hasNext()) {
if (predicate(elem = iterator->next()))
return true;
}
return false;
}
T next() override {
return elem;
}
std::shared_ptr<java::Iterator<T>> clone() override { return std::make_shared<java::Iterator<T>>(*this); }
};
template<typename T>
java::Iterator<T> *operator&(java::Iterator<T> *os, std::function<bool(T)> pref) {
return new FilterIterator<T>(os->quit(), pref);
}
/**
* Creates a collection with one single element
* @tparam T
*/
template<typename T>
class Inject : public java::Iterator<T> {
bool got;
T value;
public:
Inject(T x) : java::Iterator<T>{}, value{x}, got{false} {}
Inject(Inject<T>& cp) : Inject{cp.value} {}
~Inject() override {}
bool hasNext() override {
return !got;
}
T next() override {
got = false;
return value;
}
std::shared_ptr<java::Iterator<T>> clone() const override { return std::make_shared<java::Iterator<T>>(*this); }
};
struct done {};
struct done quit_join;
/**
*
* @tparam T
*/
template<typename T>
class Join {
class Unnest : public java::Iterator<T> {
public:
typedef typename std::vector<std::shared_ptr<java::Iterator<T>>>::iterator itT;
typedef typename std::vector<std::shared_ptr<java::Iterator<T>>> vec;
~Unnest() override {}
Unnest() : java::Iterator<T>{} {}
void add(const java::Iterator<T>* m) {
v.push_back(std::make_shared(m));
}
void add(const std::shared_ptr<java::Iterator<T>> m) {
v.push_back(m->clone());
}
Unnest &quit() {
beg = v.begin();
en = v.end();
}
bool hasNext() override {
while (beg != en) {
if ((*beg)->hasNext())
return true;
else (beg++);
}
return beg != en;
}
T next() override {
return (*beg)->next();
}
std::shared_ptr<java::Iterator<T>> clone() override { return std::make_shared<java::Iterator<T>>(*this); }
private:
itT beg, en;
vec v;
};
std::unique_ptr<Unnest> result;
public:
Join<T>() : result{new Unnest()} {}
virtual ~Join<T>() {}
Join<T> &add(const java::Iterator<T>* m) {
result->add(m);
return *this;
}
Join<T> &add(const std::shared_ptr<java::Iterator<T>> m) {
result->add(m);
return *this;
}
java::Iterator<T>* done() {
result->quit();
return result.get();
}
};
template <typename T>
Join<T> &operator>>(Join<T> &os, const java::Iterator<T>* join) {
return join ? os.add(join) : os;
}
template <typename T>
Join<T> &operator>>(Join<T> &os, const std::shared_ptr<java::Iterator<T>>& join) {
return join ? os.add(join) : os;
}
}
#endif //SKELETON_FUNCTIONALITERATOR_H