/
search.h
324 lines (273 loc) · 7.53 KB
/
search.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
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
/*
* search.h
*
* Created on: Oct 7, 2014
* Author: nbingham
*/
#pragma once
namespace core
{
template <typename container, typename element>
typename container::iterator find_first(container &c, const element &t)
{
for (typename container::iterator i = c.begin(); i != c.end(); i++)
if (*i == t)
return i;
return c.end();
}
template <typename container, typename element>
typename container::const_iterator find_first(const container &c, const element &t)
{
for (typename container::const_iterator i = c.begin(); i != c.end(); i++)
if (*i == t)
return i;
return c.end();
}
template <typename container, typename element>
bool contains(const container &c, const element &t)
{
return (find_first(c, t) != c.end());
}
template <typename container, typename element>
typename container::iterator find_last(container &c, const element &t)
{
for (typename container::iterator i = c.rbegin(); i != c.rend(); i--)
if (*i == t)
return i;
return c.rend();
}
template <typename container, typename element>
typename container::const_iterator find_last(const container &c, const element &t)
{
for (typename container::const_iterator i = c.rbegin(); i != c.rend(); i--)
if (*i == t)
return i;
return c.rend();
}
template <typename container, typename element>
int count_all(const container &c, const element &t)
{
int result = 0;
for (typename container::const_iterator i = c.begin(); i != c.end(); i++)
result += (*i == t);
return result;
}
template <typename container1, typename container2>
typename container1::iterator find_first_of(container1 &c1, const container2 &c2)
{
for (typename container1::iterator i = c1.begin(); i != c1.end(); i++)
if (contains(c2, *i))
return i;
return c1.end();
}
template <typename container1, typename container2>
typename container1::const_iterator find_first_of(const container1 &c1, const container2 &c2)
{
for (typename container1::const_iterator i = c1.begin(); i != c1.end(); i++)
if (contains(c2, *i))
return i;
return c1.end();
}
template <typename container1, typename container2>
bool contains_one_of(const container1 &c1, const container2 &c2)
{
return (find_first_of(c1, c2) != c1.end());
}
template <typename container1, typename container2>
typename container1::iterator find_last_of(container1 &c1, const container2 &c2)
{
for (typename container1::iterator i = c1.rbegin(); i != c1.rend(); i--)
if (contains(c2, *i))
return i;
return c1.rend();
}
template <typename container1, typename container2>
typename container1::const_iterator find_last_of(const container1 &c1, const container2 &c2)
{
for (typename container1::const_iterator i = c1.rbegin(); i != c1.rend(); i--)
if (contains(c2, *i))
return i;
return c1.rend();
}
template <typename container1, typename container2>
bool contains_all_of(const container1 &c1, const container2 &c2)
{
for (typename container2::const_iterator i = c2.begin(); i != c2.end(); i++)
if (!contains(c1, *i))
return false;
return true;
}
template <typename container, typename container2>
int count_all_of(const container &c, const container2 &c2)
{
int result = 0;
for (typename container::const_iterator i = c.begin(); i != c.end(); i++)
result += contains(c2, *i);
return result;
}
template <typename container, typename container2>
typename container::iterator find_first_pattern(container &c, const container2 &t)
{
for (typename container::iterator i = c.begin(); i != c.end(); i++)
{
bool found = true;
typename container::iterator k = i;
for (typename container2::const_iterator j = t.begin(); j != t.end() && found; j++,k++)
{
if (k == c.end())
return c.end();
else
found = (*k == *j);
}
if (found)
return i;
}
return c.end();
}
template <typename container, typename container2>
typename container::const_iterator find_first_pattern(const container &c, const container2 &t)
{
for (typename container::const_iterator i = c.begin(); i != c.end(); i++)
{
bool found = true;
typename container::const_iterator k = i;
for (typename container2::const_iterator j = t.begin(); j != t.end() && found; j++,k++)
{
if (k == c.end())
return c.end();
else
found = (*k == *j);
}
if (found)
return i;
}
return c.end();
}
template <typename container, typename container2>
typename container::iterator find_last_pattern(container &c, const container2 &t)
{
for (typename container::iterator i = c.rbegin(); i != c.rend(); i--)
{
bool found = true;
typename container::iterator k = i;
for (typename container2::const_iterator j = t.begin(); j != t.end() && found; j++,k++)
found = (k != c.end()) && (*k == *j);
if (found)
return i;
}
return c.rend();
}
template <typename container, typename container2>
typename container::const_iterator find_last_pattern(const container &c, const container2 &t)
{
for (typename container::const_iterator i = c.rbegin(); i != c.rend(); i--)
{
bool found = true;
typename container::const_iterator k = i;
for (typename container2::const_iterator j = t.begin(); j != t.end() && found; j++,k++)
found = (k != c.end()) && (*k == *j);
if (found)
return i;
}
return c.rend();
}
template <typename container, typename container2>
int count_all_pattern(const container &c, const container2 &t)
{
int result = 0;
for (typename container::const_iterator i = c.begin(); i != c.end(); i++)
{
bool found = true;
typename container::const_iterator k = i;
for (typename container2::const_iterator j = t.begin(); j != t.end() && found; j++,k++)
{
if (k == c.end())
return result;
else
found = (*k == *j);
}
result += found;
}
return result;
}
template <typename container, typename element>
typename container::iterator lower_bound(container &c, const element &t, int radix = 2)
{
return lower_bound(c.begin(), c.end(), t, radix, c.size());
}
template <typename container, typename element>
typename container::const_iterator lower_bound(const container &c, const element &t, int radix = 2)
{
return lower_bound(c.begin(), c.end(), t, radix, c.size());
}
template <typename iterator, typename element>
iterator lower_bound(iterator start, iterator end, const element &t, int radix = 2, int size = -1)
{
if (size < 0)
size = end - start;
if (size >= radix)
{
int D = radix - size;
for (iterator i = start; i != end; i++)
{
if (D > 0)
{
if (t <= *(i-1))
return lower_bound(start, i, t, radix, size/radix);
start = i;
D += radix - size;
}
else
D += radix;
}
return lower_bound(start, end, t, radix, size%radix);
}
else
{
iterator i = start;
while (i != end && *i < t)
i++;
return i;
}
}
template <typename container, typename element>
typename container::iterator upper_bound(container &c, const element &t, int radix = 2)
{
return upper_bound(c.begin(), c.end(), t, radix, c.size());
}
template <typename container, typename element>
typename container::const_iterator upper_bound(const container &c, const element &t, int radix = 2)
{
return upper_bound(c.begin(), c.end(), t, radix, c.size());
}
template <typename iterator, typename element>
iterator upper_bound(iterator start, iterator end, const element &t, int radix = 2, int size = -1)
{
if (size < 0)
size = end - start;
if (size >= radix)
{
int D = radix - size;
for (iterator i = start; i != end; i++)
{
if (D > 0)
{
if (t < *(i-1))
return upper_bound(start, i, t, radix, size/radix);
start = i;
D += radix - size;
}
else
D += radix;
}
return upper_bound(start, end, t, radix, size%radix);
}
else
{
iterator i = start;
while (i != end && *i <= t)
i++;
return i;
}
}
}