-
Notifications
You must be signed in to change notification settings - Fork 311
/
Copy pathcstl_algo_nonmutating_private.c
319 lines (273 loc) · 10.9 KB
/
cstl_algo_nonmutating_private.c
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
/*
* The implementation of private non-mutating algorithm.
* Copyright (C) 2008 - 2013 Wangbo
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
* Author e-mail: activesys.wb@gmail.com
* activesys@sina.com.cn
*/
/** include section **/
#include <cstl/cstl_def.h>
#include <cstl/cstl_alloc.h>
#include <cstl/cstl_types.h>
#include <cstl/citerator.h>
#include <cstl/cstring.h>
#include <cstl/cfunctional.h>
#include <cstl/calgorithm.h>
/** local constant declaration and local macro section **/
/** local data type declaration and local struct, union, enum section **/
/** local function prototype section **/
/** exported global variable definition section **/
/** local global variable definition section **/
/** exported function implementation section **/
/**
* Locates the position of the first occurrence of an element in a range that has a specified value.
*/
input_iterator_t _algo_find(input_iterator_t it_first, input_iterator_t it_last, ...)
{
input_iterator_t it_iter;
va_list val_elemlist;
va_start(val_elemlist, it_last);
it_iter = _algo_find_varg(it_first, it_last, val_elemlist);
va_end(val_elemlist);
return it_iter;
}
/**
* Locates the position of the first occurrence of an element in a range that has a specified value.
*/
input_iterator_t _algo_find_varg(input_iterator_t it_first, input_iterator_t it_last, va_list val_elemlist)
{
void* pv_value = NULL;
bool_t b_result = false;
bool_t b_less = false;
bool_t b_greater = false;
bfun_t bfun_op;
assert(_iterator_valid_range(it_first, it_last, _INPUT_ITERATOR));
pv_value = _iterator_allocate_init_elem(it_first);
_type_get_varg_value(_iterator_get_typeinfo(it_first), val_elemlist, pv_value);
bfun_op = _fun_get_binary(it_first, _EQUAL_FUN);
assert(bfun_op != NULL);
if (bfun_op == fun_default_binary) {
bfun_op = _fun_get_binary(it_first, _LESS_FUN);
for (; !iterator_equal(it_first, it_last); it_first = iterator_next(it_first)) {
(*bfun_op)(iterator_get_pointer(it_first), pv_value, &b_less);
if (b_less) {
continue;
}
(*bfun_op)(pv_value, iterator_get_pointer(it_first), &b_greater);
if (b_greater) {
continue;
}
break;
}
} else {
if (strncmp(_iterator_get_typebasename(it_first), _C_STRING_TYPE, _TYPE_NAME_SIZE) == 0) {
for (; !iterator_equal(it_first, it_last); it_first = iterator_next(it_first)) {
(*bfun_op)(iterator_get_pointer(it_first), string_c_str((string_t*)pv_value), &b_result);
if (b_result) {
break;
}
}
} else {
for (; !iterator_equal(it_first, it_last); it_first = iterator_next(it_first)) {
(*bfun_op)(iterator_get_pointer(it_first), pv_value, &b_result);
if (b_result) {
break;
}
}
}
}
_iterator_deallocate_destroy_elem(it_first, pv_value);
pv_value = NULL;
return it_first;
}
/**
* Returns the number of elements in a range whose values match a specified value.
*/
size_t _algo_count(input_iterator_t it_first, input_iterator_t it_last, ...)
{
size_t t_count = 0;
va_list val_elemlist;
va_start(val_elemlist, it_last);
t_count = _algo_count_varg(it_first, it_last, val_elemlist);
va_end(val_elemlist);
return t_count;
}
/**
* Returns the number of elements in a range whose values match a specified value.
*/
size_t _algo_count_varg(input_iterator_t it_first, input_iterator_t it_last, va_list val_elemlist)
{
void* pv_value = NULL;
bool_t b_result = false;
bool_t b_less = false;
bool_t b_greater = false;
size_t t_count = 0;
bfun_t bfun_op;
assert(_iterator_valid_range(it_first, it_last, _INPUT_ITERATOR));
pv_value = _iterator_allocate_init_elem(it_first);
_type_get_varg_value(_iterator_get_typeinfo(it_first), val_elemlist, pv_value);
bfun_op = _fun_get_binary(it_first, _EQUAL_FUN);
assert(bfun_op != NULL);
if (bfun_op == fun_default_binary) {
bfun_op = _fun_get_binary(it_first, _LESS_FUN);
for (; !iterator_equal(it_first, it_last); it_first = iterator_next(it_first)) {
(*bfun_op)(iterator_get_pointer(it_first), pv_value, &b_less);
if (b_less) {
continue;
}
(*bfun_op)(pv_value, iterator_get_pointer(it_first), &b_greater);
if (b_greater) {
continue;
}
t_count++;
}
} else {
if (strncmp(_iterator_get_typebasename(it_first), _C_STRING_TYPE, _TYPE_NAME_SIZE) == 0) {
for (; !iterator_equal(it_first, it_last); it_first = iterator_next(it_first)) {
(*bfun_op)(iterator_get_pointer(it_first), string_c_str((string_t*)pv_value), &b_result);
if (b_result) {
t_count++;
}
}
} else {
for (; !iterator_equal(it_first, it_last); it_first = iterator_next(it_first)) {
(*bfun_op)(iterator_get_pointer(it_first), pv_value, &b_result);
if (b_result) {
t_count++;
}
}
}
}
_iterator_deallocate_destroy_elem(it_first, pv_value);
pv_value = NULL;
return t_count;
}
/**
* Searches for the first subsequence in a range that of a specified number of elements having a particular value.
*/
forward_iterator_t _algo_search_n(forward_iterator_t it_first, forward_iterator_t it_last, size_t t_count, ...)
{
forward_iterator_t it_iter;
va_list val_elemlist;
va_start(val_elemlist, t_count);
it_iter = _algo_search_n_if_varg(it_first, it_last, t_count, _fun_get_binary(it_first, _EQUAL_FUN), val_elemlist);
va_end(val_elemlist);
return it_iter;
}
/**
* Searches for the first subsequence in a range that of a specified number of elements having a relation to that value as specified by a binary predicate.
*/
forward_iterator_t _algo_search_n_if(
forward_iterator_t it_first, forward_iterator_t it_last, size_t t_count, bfun_t bfun_op, ...)
{
forward_iterator_t it_iter;
va_list val_elemlist;
va_start(val_elemlist, bfun_op);
it_iter = _algo_search_n_if_varg(it_first, it_last, t_count, bfun_op, val_elemlist);
va_end(val_elemlist);
return it_iter;
}
/**
* Searches for the first subsequence in a range that of a specified number of elements having a relation to that value as specified by a binary predicate.
*/
forward_iterator_t _algo_search_n_if_varg(
forward_iterator_t it_first, forward_iterator_t it_last, size_t t_count, bfun_t bfun_op, va_list val_elemlist)
{
void* pv_value = NULL;
bool_t b_result = false;
bool_t b_less = false;
bool_t b_greater = false;
iterator_t it_index;
size_t i = 0;
assert(_iterator_valid_range(it_first, it_last, _FORWARD_ITERATOR));
if (t_count == 0) {
return it_first;
}
if (bfun_op == NULL) {
bfun_op = _fun_get_binary(it_first, _EQUAL_FUN);
}
pv_value = _iterator_allocate_init_elem(it_first);
_type_get_varg_value(_iterator_get_typeinfo(it_first), val_elemlist, pv_value);
if (bfun_op == fun_default_binary) {
bfun_op = _fun_get_binary(it_first, _LESS_FUN);
for (; !iterator_equal(it_first, it_last); it_first = iterator_next(it_first)) {
(*bfun_op)(iterator_get_pointer(it_first), pv_value, &b_less);
if (b_less) {
continue;
}
(*bfun_op)(pv_value, iterator_get_pointer(it_first), &b_greater);
if (b_greater) {
continue;
}
for (i = 1, it_index = iterator_next(it_first);
i < t_count && !iterator_equal(it_index, it_last);
++i, it_index = iterator_next(it_index)) {
(*bfun_op)(iterator_get_pointer(it_index), pv_value, &b_less);
if (b_less) {
break;
}
(*bfun_op)(pv_value, iterator_get_pointer(it_index), &b_greater);
if (b_greater) {
break;
}
}
if (i == t_count) {
break;
}
}
} else {
if (strncmp(_iterator_get_typebasename(it_first), _C_STRING_TYPE, _TYPE_NAME_SIZE) == 0) {
for (; !iterator_equal(it_first, it_last); it_first = iterator_next(it_first)) {
(*bfun_op)(iterator_get_pointer(it_first), string_c_str((string_t*)pv_value), &b_result);
if (b_result) {
for (i = 1, it_index = iterator_next(it_first);
i < t_count && !iterator_equal(it_index, it_last);
++i, it_index = iterator_next(it_index)) {
(*bfun_op)(iterator_get_pointer(it_index), string_c_str((string_t*)pv_value), &b_result);
if (!b_result) {
break;
}
}
if (i == t_count) {
break;
}
}
}
} else {
for (; !iterator_equal(it_first, it_last); it_first = iterator_next(it_first)) {
(*bfun_op)(iterator_get_pointer(it_first), pv_value, &b_result);
if (b_result) {
for (i = 1, it_index = iterator_next(it_first);
i < t_count && !iterator_equal(it_index, it_last);
++i, it_index = iterator_next(it_index)) {
(*bfun_op)(iterator_get_pointer(it_index), pv_value, &b_result);
if (!b_result) {
break;
}
}
if (i == t_count) {
break;
}
}
}
}
}
_iterator_deallocate_destroy_elem(it_first, pv_value);
pv_value = NULL;
return it_first;
}
/** eof **/