| author | Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com> |
| Fri, 19 Feb 2010 23:40:16 +0200 | |
| branch | RCL_3 |
| changeset 4 | 3b1da2848fc7 |
| parent 0 | 1918ee327afb |
| permissions | -rw-r--r-- |
| 0 | 1 |
/**************************************************************************** |
2 |
** |
|
|
4
3b1da2848fc7
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3 |
** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies). |
| 0 | 4 |
** All rights reserved. |
5 |
** Contact: Nokia Corporation (qt-info@nokia.com) |
|
6 |
** |
|
7 |
** This file is part of the QtCore module of the Qt Toolkit. |
|
8 |
** |
|
9 |
** $QT_BEGIN_LICENSE:LGPL$ |
|
10 |
** No Commercial Usage |
|
11 |
** This file contains pre-release code and may not be distributed. |
|
12 |
** You may use this file in accordance with the terms and conditions |
|
13 |
** contained in the Technology Preview License Agreement accompanying |
|
14 |
** this package. |
|
15 |
** |
|
16 |
** GNU Lesser General Public License Usage |
|
17 |
** Alternatively, this file may be used under the terms of the GNU Lesser |
|
18 |
** General Public License version 2.1 as published by the Free Software |
|
19 |
** Foundation and appearing in the file LICENSE.LGPL included in the |
|
20 |
** packaging of this file. Please review the following information to |
|
21 |
** ensure the GNU Lesser General Public License version 2.1 requirements |
|
22 |
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. |
|
23 |
** |
|
24 |
** In addition, as a special exception, Nokia gives you certain additional |
|
25 |
** rights. These rights are described in the Nokia Qt LGPL Exception |
|
26 |
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. |
|
27 |
** |
|
28 |
** If you have questions regarding the use of this file, please contact |
|
29 |
** Nokia at qt-info@nokia.com. |
|
30 |
** |
|
31 |
** |
|
32 |
** |
|
33 |
** |
|
34 |
** |
|
35 |
** |
|
36 |
** |
|
37 |
** |
|
38 |
** $QT_END_LICENSE$ |
|
39 |
** |
|
40 |
****************************************************************************/ |
|
41 |
||
42 |
#ifndef QTCONCURRENT_FILTER_H |
|
43 |
#define QTCONCURRENT_FILTER_H |
|
44 |
||
45 |
#include <QtCore/qglobal.h> |
|
46 |
||
47 |
#ifndef QT_NO_CONCURRENT |
|
48 |
||
49 |
#include <QtCore/qtconcurrentfilterkernel.h> |
|
50 |
#include <QtCore/qtconcurrentfunctionwrappers.h> |
|
51 |
||
52 |
QT_BEGIN_HEADER |
|
53 |
QT_BEGIN_NAMESPACE |
|
54 |
||
55 |
QT_MODULE(Core) |
|
56 |
||
57 |
#ifdef qdoc |
|
58 |
||
59 |
namespace QtConcurrent {
|
|
60 |
||
61 |
QFuture<void> filter(Sequence &sequence, FilterFunction filterFunction); |
|
62 |
||
63 |
template <typename T> |
|
64 |
QFuture<T> filtered(const Sequence &sequence, FilterFunction filterFunction); |
|
65 |
template <typename T> |
|
66 |
QFuture<T> filtered(ConstIterator begin, ConstIterator end, FilterFunction filterFunction); |
|
67 |
||
68 |
template <typename T> |
|
69 |
QFuture<T> filteredReduced(const Sequence &sequence, |
|
70 |
FilterFunction filterFunction, |
|
71 |
ReduceFunction reduceFunction, |
|
72 |
QtConcurrent::ReduceOptions reduceOptions = UnorderedReduce | SequentialReduce); |
|
73 |
template <typename T> |
|
74 |
QFuture<T> filteredReduced(ConstIterator begin, |
|
75 |
ConstIterator end, |
|
76 |
FilterFunction filterFunction, |
|
77 |
ReduceFunction reduceFunction, |
|
78 |
QtConcurrent::ReduceOptions reduceOptions = UnorderedReduce | SequentialReduce); |
|
79 |
||
80 |
void blockingFilter(Sequence &sequence, FilterFunction filterFunction); |
|
81 |
||
82 |
template <typename Sequence> |
|
83 |
Sequence blockingFiltered(const Sequence &sequence, FilterFunction filterFunction); |
|
84 |
template <typename Sequence> |
|
85 |
Sequence blockingFiltered(ConstIterator begin, ConstIterator end, FilterFunction filterFunction); |
|
86 |
||
87 |
template <typename T> |
|
88 |
T blockingFilteredReduced(const Sequence &sequence, |
|
89 |
FilterFunction filterFunction, |
|
90 |
ReduceFunction reduceFunction, |
|
91 |
QtConcurrent::ReduceOptions reduceOptions = UnorderedReduce | SequentialReduce); |
|
92 |
template <typename T> |
|
93 |
T blockingFilteredReduced(ConstIterator begin, |
|
94 |
ConstIterator end, |
|
95 |
FilterFunction filterFunction, |
|
96 |
ReduceFunction reduceFunction, |
|
97 |
QtConcurrent::ReduceOptions reduceOptions = UnorderedReduce | SequentialReduce); |
|
98 |
||
99 |
} // namespace QtConcurrent |
|
100 |
||
101 |
#else |
|
102 |
||
103 |
namespace QtConcurrent {
|
|
104 |
||
105 |
template <typename Sequence, typename KeepFunctor, typename T, typename C, typename U> |
|
106 |
ThreadEngineStarter<void> filterInternal(Sequence &sequence, KeepFunctor keep, T (C::*reduce)(U)) |
|
107 |
{
|
|
108 |
typedef MemberFunctionWrapper1<T, C, U> ReduceFunctor; |
|
109 |
typedef typename Sequence::const_iterator Iterator; |
|
110 |
typedef FilterKernel<Sequence, KeepFunctor, ReduceFunctor> KernelType; |
|
111 |
return startThreadEngine(new KernelType(sequence, keep, reduce)); |
|
112 |
} |
|
113 |
||
114 |
// filter() on sequences |
|
115 |
template <typename Sequence, typename KeepFunctor> |
|
116 |
QFuture<void> filter(Sequence &sequence, KeepFunctor keep) |
|
117 |
{
|
|
118 |
return filterInternal(sequence, keep, &Sequence::push_back); |
|
119 |
} |
|
120 |
||
121 |
template <typename Sequence, typename T> |
|
122 |
QFuture<void> filter(Sequence &sequence, bool (keep)(T)) |
|
123 |
{
|
|
124 |
return filterInternal(sequence, FunctionWrapper1<bool, T>(keep), &Sequence::push_back); |
|
125 |
} |
|
126 |
||
127 |
template <typename Sequence, typename C> |
|
128 |
QFuture<void> filter(Sequence &sequence, bool (C::*keep)() const) |
|
129 |
{
|
|
130 |
return filterInternal(sequence, ConstMemberFunctionWrapper<bool, C>(keep), &Sequence::push_back); |
|
131 |
} |
|
132 |
||
133 |
// filteredReduced() on sequences |
|
134 |
template <typename ResultType, typename Sequence, typename KeepFunctor, typename ReduceFunctor> |
|
135 |
QFuture<ResultType> filteredReduced(const Sequence &sequence, |
|
136 |
KeepFunctor keep, |
|
137 |
ReduceFunctor reduce, |
|
138 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
139 |
{
|
|
140 |
return startFilteredReduced<ResultType>(sequence, keep, reduce, options); |
|
141 |
} |
|
142 |
||
143 |
template <typename ResultType, typename Sequence, typename T, typename ReduceFunctor> |
|
144 |
QFuture<ResultType> filteredReduced(const Sequence &sequence, |
|
145 |
bool (filter)(T), |
|
146 |
ReduceFunctor reduce, |
|
147 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
148 |
{
|
|
149 |
return filteredReduced<ResultType>(sequence, |
|
150 |
FunctionWrapper1<bool, T>(filter), |
|
151 |
reduce, |
|
152 |
options); |
|
153 |
} |
|
154 |
||
155 |
template <typename ResultType, typename Sequence, typename C, typename ReduceFunctor> |
|
156 |
QFuture<ResultType> filteredReduced(const Sequence &sequence, |
|
157 |
bool (C::*filter)() const, |
|
158 |
ReduceFunctor reduce, |
|
159 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
160 |
{
|
|
161 |
return filteredReduced<ResultType>(sequence, |
|
162 |
ConstMemberFunctionWrapper<bool, C>(filter), |
|
163 |
reduce, |
|
164 |
options); |
|
165 |
} |
|
166 |
||
167 |
template <typename Sequence, typename KeepFunctor, typename T, typename U, typename V> |
|
168 |
QFuture<U> filteredReduced(const Sequence &sequence, |
|
169 |
KeepFunctor keep, |
|
170 |
T (reduce)(U &, V), |
|
171 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
172 |
{
|
|
173 |
return filteredReduced<U>(sequence, |
|
174 |
keep, |
|
175 |
FunctionWrapper2<T, U &, V>(reduce), |
|
176 |
options); |
|
177 |
} |
|
178 |
||
179 |
template <typename Sequence, typename KeepFunctor, typename T, typename C, typename U> |
|
180 |
QFuture<C> filteredReduced(const Sequence &sequence, |
|
181 |
KeepFunctor keep, |
|
182 |
T (C::*reduce)(U), |
|
183 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
184 |
{
|
|
185 |
return filteredReduced<C>(sequence, |
|
186 |
keep, |
|
187 |
MemberFunctionWrapper1<T, C, U>(reduce), |
|
188 |
options); |
|
189 |
} |
|
190 |
||
191 |
template <typename Sequence, typename T, typename U, typename V, typename W> |
|
192 |
QFuture<V> filteredReduced(const Sequence &sequence, |
|
193 |
bool (keep)(T), |
|
194 |
U (reduce)(V &, W), |
|
195 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
196 |
{
|
|
197 |
return filteredReduced<V>(sequence, |
|
198 |
FunctionWrapper1<bool, T>(keep), |
|
199 |
FunctionWrapper2<U, V &, W>(reduce), |
|
200 |
options); |
|
201 |
} |
|
202 |
||
203 |
template <typename Sequence, typename C, typename T, typename U, typename V> |
|
204 |
QFuture<U> filteredReduced(const Sequence &sequence, |
|
205 |
bool (C::*keep)() const, |
|
206 |
T (reduce)(U &, V), |
|
207 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
208 |
{
|
|
209 |
return filteredReduced<U>(sequence, |
|
210 |
ConstMemberFunctionWrapper<bool, C>(keep), |
|
211 |
FunctionWrapper2<T, U &, V>(reduce), |
|
212 |
options); |
|
213 |
} |
|
214 |
||
215 |
template <typename Sequence, typename T, typename U, typename C, typename V> |
|
216 |
QFuture<C> filteredReduced(const Sequence &sequence, |
|
217 |
bool (keep)(T), |
|
218 |
U (C::*reduce)(V), |
|
219 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
220 |
{
|
|
221 |
return filteredReduced<C>(sequence, |
|
222 |
FunctionWrapper1<bool, T>(keep), |
|
223 |
MemberFunctionWrapper1<U, C, V>(reduce), |
|
224 |
options); |
|
225 |
} |
|
226 |
||
227 |
template <typename Sequence, typename C, typename T, typename D, typename U> |
|
228 |
QFuture<D> filteredReduced(const Sequence &sequence, |
|
229 |
bool (C::*keep)() const, |
|
230 |
T (D::*reduce)(U), |
|
231 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
232 |
{
|
|
233 |
return filteredReduced<D>(sequence, |
|
234 |
ConstMemberFunctionWrapper<bool, C>(keep), |
|
235 |
MemberFunctionWrapper1<T, D, U>(reduce), |
|
236 |
options); |
|
237 |
} |
|
238 |
||
239 |
// filteredReduced() on iterators |
|
240 |
template <typename ResultType, typename Iterator, typename KeepFunctor, typename ReduceFunctor> |
|
241 |
QFuture<ResultType> filteredReduced(Iterator begin, |
|
242 |
Iterator end, |
|
243 |
KeepFunctor keep, |
|
244 |
ReduceFunctor reduce, |
|
245 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
246 |
{
|
|
247 |
return startFilteredReduced<ResultType>(begin, end, keep, reduce, options); |
|
248 |
} |
|
249 |
||
250 |
template <typename ResultType, typename Iterator, typename T, typename ReduceFunctor> |
|
251 |
QFuture<ResultType> filteredReduced(Iterator begin, |
|
252 |
Iterator end, |
|
253 |
bool (filter)(T), |
|
254 |
ReduceFunctor reduce, |
|
255 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
256 |
{
|
|
257 |
return filteredReduced<ResultType>(begin, |
|
258 |
end, |
|
259 |
FunctionWrapper1<bool, T>(filter), |
|
260 |
reduce, |
|
261 |
options); |
|
262 |
} |
|
263 |
||
264 |
template <typename ResultType, typename Iterator, typename C, typename ReduceFunctor> |
|
265 |
QFuture<ResultType> filteredReduced(Iterator begin, |
|
266 |
Iterator end, |
|
267 |
bool (C::*filter)() const, |
|
268 |
ReduceFunctor reduce, |
|
269 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
270 |
{
|
|
271 |
return filteredReduced<ResultType>(begin, |
|
272 |
end, |
|
273 |
ConstMemberFunctionWrapper<bool, C>(filter), |
|
274 |
reduce, |
|
275 |
options); |
|
276 |
} |
|
277 |
||
278 |
template <typename Iterator, typename KeepFunctor, typename T, typename U, typename V> |
|
279 |
QFuture<U> filteredReduced(Iterator begin, |
|
280 |
Iterator end, |
|
281 |
KeepFunctor keep, |
|
282 |
T (reduce)(U &, V), |
|
283 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
284 |
{
|
|
285 |
return filteredReduced<U>(begin, |
|
286 |
end, |
|
287 |
keep, |
|
288 |
FunctionWrapper2<T, U &, V>(reduce), |
|
289 |
options); |
|
290 |
} |
|
291 |
||
292 |
template <typename Iterator, typename KeepFunctor, typename T, typename C, typename U> |
|
293 |
QFuture<C> filteredReduced(Iterator begin, |
|
294 |
Iterator end, |
|
295 |
KeepFunctor keep, |
|
296 |
T (C::*reduce)(U), |
|
297 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
298 |
{
|
|
299 |
return filteredReduced<C>(begin, |
|
300 |
end, |
|
301 |
keep, |
|
302 |
MemberFunctionWrapper1<T, C, U>(reduce), |
|
303 |
options); |
|
304 |
} |
|
305 |
||
306 |
template <typename Iterator, typename T, typename U, typename V, typename W> |
|
307 |
QFuture<V> filteredReduced(Iterator begin, |
|
308 |
Iterator end, |
|
309 |
bool (keep)(T), |
|
310 |
U (reduce)(V &, W), |
|
311 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
312 |
{
|
|
313 |
return filteredReduced<V>(begin, |
|
314 |
end, |
|
315 |
FunctionWrapper1<bool, T>(keep), |
|
316 |
FunctionWrapper2<U, V &, W>(reduce), |
|
317 |
options); |
|
318 |
} |
|
319 |
||
320 |
template <typename Iterator, typename C, typename T, typename U, typename V> |
|
321 |
QFuture<U> filteredReduced(Iterator begin, |
|
322 |
Iterator end, |
|
323 |
bool (C::*keep)() const, |
|
324 |
T (reduce)(U &, V), |
|
325 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
326 |
{
|
|
327 |
return filteredReduced<U>(begin, |
|
328 |
end, |
|
329 |
ConstMemberFunctionWrapper<bool, C>(keep), |
|
330 |
FunctionWrapper2<T, U &, V>(reduce), |
|
331 |
options); |
|
332 |
} |
|
333 |
||
334 |
template <typename Iterator, typename T, typename U, typename C, typename V> |
|
335 |
QFuture<C> filteredReduced(Iterator begin, |
|
336 |
Iterator end, |
|
337 |
bool (keep)(T), |
|
338 |
U (C::*reduce)(V), |
|
339 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
340 |
{
|
|
341 |
return filteredReduced<C>(begin, |
|
342 |
end, |
|
343 |
FunctionWrapper1<bool, T>(keep), |
|
344 |
MemberFunctionWrapper1<U, C, V>(reduce), |
|
345 |
options); |
|
346 |
} |
|
347 |
||
348 |
template <typename Iterator, typename C, typename T, typename D, typename U> |
|
349 |
QFuture<D> filteredReduced(Iterator begin, |
|
350 |
Iterator end, |
|
351 |
bool (C::*keep)() const, |
|
352 |
T (D::*reduce)(U), |
|
353 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
354 |
{
|
|
355 |
return filteredReduced<D>(begin, |
|
356 |
end, |
|
357 |
ConstMemberFunctionWrapper<bool, C>(keep), |
|
358 |
MemberFunctionWrapper1<T, D, U>(reduce), |
|
359 |
options); |
|
360 |
} |
|
361 |
||
362 |
||
363 |
// filtered() on sequences |
|
364 |
template <typename Sequence, typename KeepFunctor> |
|
365 |
QFuture<typename Sequence::value_type> filtered(const Sequence &sequence, KeepFunctor keep) |
|
366 |
{
|
|
367 |
return startFiltered(sequence, keep); |
|
368 |
} |
|
369 |
||
370 |
template <typename Sequence, typename T> |
|
371 |
QFuture<typename Sequence::value_type> filtered(const Sequence &sequence, bool (keep)(T)) |
|
372 |
{
|
|
373 |
return startFiltered(sequence, FunctionWrapper1<bool, T>(keep)); |
|
374 |
} |
|
375 |
||
376 |
template <typename Sequence, typename C> |
|
377 |
QFuture<typename Sequence::value_type> filtered(const Sequence &sequence, bool (C::*keep)() const) |
|
378 |
{
|
|
379 |
return startFiltered(sequence, ConstMemberFunctionWrapper<bool, C>(keep)); |
|
380 |
} |
|
381 |
||
382 |
// filtered() on iterators |
|
383 |
template <typename Iterator, typename KeepFunctor> |
|
384 |
QFuture<typename qValueType<Iterator>::value_type> filtered(Iterator begin, Iterator end, KeepFunctor keep) |
|
385 |
{
|
|
386 |
return startFiltered(begin, end, keep); |
|
387 |
} |
|
388 |
||
389 |
template <typename Iterator, typename T> |
|
390 |
QFuture<typename qValueType<Iterator>::value_type> filtered(Iterator begin, Iterator end, bool (keep)(T)) |
|
391 |
{
|
|
392 |
return startFiltered(begin, end, FunctionWrapper1<bool, T>(keep)); |
|
393 |
} |
|
394 |
||
395 |
template <typename Iterator, typename C> |
|
396 |
QFuture<typename qValueType<Iterator>::value_type> filtered(Iterator begin, |
|
397 |
Iterator end, |
|
398 |
bool (C::*keep)() const) |
|
399 |
{
|
|
400 |
return startFiltered(begin, end, ConstMemberFunctionWrapper<bool, C>(keep)); |
|
401 |
} |
|
402 |
||
403 |
||
404 |
// blocking filter() on sequences |
|
405 |
template <typename Sequence, typename KeepFunctor> |
|
406 |
void blockingFilter(Sequence &sequence, KeepFunctor keep) |
|
407 |
{
|
|
408 |
filterInternal(sequence, keep, &Sequence::push_back).startBlocking(); |
|
409 |
} |
|
410 |
||
411 |
template <typename Sequence, typename T> |
|
412 |
void blockingFilter(Sequence &sequence, bool (keep)(T)) |
|
413 |
{
|
|
414 |
filterInternal(sequence, FunctionWrapper1<bool, T>(keep), &Sequence::push_back) |
|
415 |
.startBlocking(); |
|
416 |
} |
|
417 |
||
418 |
template <typename Sequence, typename C> |
|
419 |
void blockingFilter(Sequence &sequence, bool (C::*keep)() const) |
|
420 |
{
|
|
421 |
filterInternal(sequence, |
|
422 |
ConstMemberFunctionWrapper<bool, C>(keep), |
|
423 |
&Sequence::push_back) |
|
424 |
.startBlocking(); |
|
425 |
} |
|
426 |
||
427 |
// blocking filteredReduced() on sequences |
|
428 |
template <typename ResultType, typename Sequence, typename KeepFunctor, typename ReduceFunctor> |
|
429 |
ResultType blockingFilteredReduced(const Sequence &sequence, |
|
430 |
KeepFunctor keep, |
|
431 |
ReduceFunctor reduce, |
|
432 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
433 |
{
|
|
434 |
return startFilteredReduced<ResultType>(sequence, keep, reduce, options) |
|
435 |
.startBlocking(); |
|
436 |
} |
|
437 |
||
438 |
template <typename ResultType, typename Sequence, typename T, typename ReduceFunctor> |
|
439 |
ResultType blockingFilteredReduced(const Sequence &sequence, |
|
440 |
bool (filter)(T), |
|
441 |
ReduceFunctor reduce, |
|
442 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
443 |
{
|
|
444 |
return blockingFilteredReduced<ResultType> |
|
445 |
(sequence, |
|
446 |
FunctionWrapper1<bool, T>(filter), |
|
447 |
reduce, |
|
448 |
options); |
|
449 |
} |
|
450 |
||
451 |
template <typename ResultType, typename Sequence, typename C, typename ReduceFunctor> |
|
452 |
ResultType blockingFilteredReduced(const Sequence &sequence, |
|
453 |
bool (C::*filter)() const, |
|
454 |
ReduceFunctor reduce, |
|
455 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
456 |
{
|
|
457 |
return blockingFilteredReduced<ResultType> |
|
458 |
(sequence, |
|
459 |
ConstMemberFunctionWrapper<bool, C>(filter), |
|
460 |
reduce, |
|
461 |
options); |
|
462 |
} |
|
463 |
||
464 |
template <typename Sequence, typename KeepFunctor, typename T, typename U, typename V> |
|
465 |
U blockingFilteredReduced(const Sequence &sequence, |
|
466 |
KeepFunctor keep, |
|
467 |
T (reduce)(U &, V), |
|
468 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
469 |
{
|
|
470 |
return blockingFilteredReduced<U> |
|
471 |
(sequence, |
|
472 |
keep, |
|
473 |
FunctionWrapper2<T, U &, V>(reduce), |
|
474 |
options); |
|
475 |
} |
|
476 |
||
477 |
template <typename Sequence, typename KeepFunctor, typename T, typename C, typename U> |
|
478 |
C blockingFilteredReduced(const Sequence &sequence, |
|
479 |
KeepFunctor keep, |
|
480 |
T (C::*reduce)(U), |
|
481 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
482 |
{
|
|
483 |
return blockingFilteredReduced<C> |
|
484 |
(sequence, |
|
485 |
keep, |
|
486 |
MemberFunctionWrapper1<T, C, U>(reduce), |
|
487 |
options); |
|
488 |
} |
|
489 |
||
490 |
template <typename Sequence, typename T, typename U, typename V, typename W> |
|
491 |
V blockingFilteredReduced(const Sequence &sequence, |
|
492 |
bool (keep)(T), |
|
493 |
U (reduce)(V &, W), |
|
494 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
495 |
{
|
|
496 |
return blockingFilteredReduced<V> |
|
497 |
(sequence, |
|
498 |
FunctionWrapper1<bool, T>(keep), |
|
499 |
FunctionWrapper2<U, V &, W>(reduce), |
|
500 |
options); |
|
501 |
} |
|
502 |
||
503 |
template <typename Sequence, typename C, typename T, typename U, typename V> |
|
504 |
U blockingFilteredReduced(const Sequence &sequence, |
|
505 |
bool (C::*keep)() const, |
|
506 |
T (reduce)(U &, V), |
|
507 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
508 |
{
|
|
509 |
return blockingFilteredReduced<U> |
|
510 |
(sequence, |
|
511 |
ConstMemberFunctionWrapper<bool, C>(keep), |
|
512 |
FunctionWrapper2<T, U &, V>(reduce), |
|
513 |
options); |
|
514 |
} |
|
515 |
||
516 |
template <typename Sequence, typename T, typename U, typename C, typename V> |
|
517 |
C blockingFilteredReduced(const Sequence &sequence, |
|
518 |
bool (keep)(T), |
|
519 |
U (C::*reduce)(V), |
|
520 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
521 |
{
|
|
522 |
return blockingFilteredReduced<C> |
|
523 |
(sequence, |
|
524 |
FunctionWrapper1<bool, T>(keep), |
|
525 |
MemberFunctionWrapper1<U, C, V>(reduce), |
|
526 |
options); |
|
527 |
} |
|
528 |
||
529 |
template <typename Sequence, typename C, typename T, typename D, typename U> |
|
530 |
D blockingFilteredReduced(const Sequence &sequence, |
|
531 |
bool (C::*keep)() const, |
|
532 |
T (D::*reduce)(U), |
|
533 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
534 |
{
|
|
535 |
return blockingFilteredReduced<D> |
|
536 |
(sequence, |
|
537 |
ConstMemberFunctionWrapper<bool, C>(keep), |
|
538 |
MemberFunctionWrapper1<T, D, U>(reduce), |
|
539 |
options); |
|
540 |
} |
|
541 |
||
542 |
// blocking filteredReduced() on iterators |
|
543 |
template <typename ResultType, typename Iterator, typename KeepFunctor, typename ReduceFunctor> |
|
544 |
ResultType blockingFilteredReduced(Iterator begin, |
|
545 |
Iterator end, |
|
546 |
KeepFunctor keep, |
|
547 |
ReduceFunctor reduce, |
|
548 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
549 |
{
|
|
550 |
return startFilteredReduced<ResultType>(begin, end, keep, reduce, options) |
|
551 |
.startBlocking(); |
|
552 |
} |
|
553 |
||
554 |
template <typename ResultType, typename Iterator, typename T, typename ReduceFunctor> |
|
555 |
ResultType blockingFilteredReduced(Iterator begin, |
|
556 |
Iterator end, |
|
557 |
bool (filter)(T), |
|
558 |
ReduceFunctor reduce, |
|
559 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
560 |
{
|
|
561 |
return blockingFilteredReduced<ResultType> |
|
562 |
(begin, |
|
563 |
end, |
|
564 |
FunctionWrapper1<bool, T>(filter), |
|
565 |
reduce, |
|
566 |
options); |
|
567 |
} |
|
568 |
||
569 |
template <typename ResultType, typename Iterator, typename C, typename ReduceFunctor> |
|
570 |
ResultType blockingFilteredReduced(Iterator begin, |
|
571 |
Iterator end, |
|
572 |
bool (C::*filter)() const, |
|
573 |
ReduceFunctor reduce, |
|
574 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
575 |
{
|
|
576 |
return blockingFilteredReduced<ResultType> |
|
577 |
(begin, |
|
578 |
end, |
|
579 |
ConstMemberFunctionWrapper<bool, C>(filter), |
|
580 |
reduce, |
|
581 |
options); |
|
582 |
} |
|
583 |
||
584 |
template <typename Iterator, typename KeepFunctor, typename T, typename U, typename V> |
|
585 |
U blockingFilteredReduced(Iterator begin, |
|
586 |
Iterator end, |
|
587 |
KeepFunctor keep, |
|
588 |
T (reduce)(U &, V), |
|
589 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
590 |
{
|
|
591 |
return blockingFilteredReduced<U> |
|
592 |
(begin, |
|
593 |
end, |
|
594 |
keep, |
|
595 |
FunctionWrapper2<T, U &, V>(reduce), |
|
596 |
options); |
|
597 |
} |
|
598 |
||
599 |
template <typename Iterator, typename KeepFunctor, typename T, typename C, typename U> |
|
600 |
C blockingFilteredReduced(Iterator begin, |
|
601 |
Iterator end, |
|
602 |
KeepFunctor keep, |
|
603 |
T (C::*reduce)(U), |
|
604 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
605 |
{
|
|
606 |
return blockingFilteredReduced<C> |
|
607 |
(begin, |
|
608 |
end, |
|
609 |
keep, |
|
610 |
MemberFunctionWrapper1<T, C, U>(reduce), |
|
611 |
options); |
|
612 |
} |
|
613 |
||
614 |
template <typename Iterator, typename T, typename U, typename V, typename W> |
|
615 |
V blockingFilteredReduced(Iterator begin, |
|
616 |
Iterator end, |
|
617 |
bool (keep)(T), |
|
618 |
U (reduce)(V &, W), |
|
619 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
620 |
{
|
|
621 |
return blockingFilteredReduced<V> |
|
622 |
(begin, |
|
623 |
end, |
|
624 |
FunctionWrapper1<bool, T>(keep), |
|
625 |
FunctionWrapper2<U, V &, W>(reduce), |
|
626 |
options); |
|
627 |
} |
|
628 |
||
629 |
template <typename Iterator, typename C, typename T, typename U, typename V> |
|
630 |
U blockingFilteredReduced(Iterator begin, |
|
631 |
Iterator end, |
|
632 |
bool (C::*keep)() const, |
|
633 |
T (reduce)(U &, V), |
|
634 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
635 |
{
|
|
636 |
return blockingFilteredReduced<U> |
|
637 |
(begin, |
|
638 |
end, |
|
639 |
ConstMemberFunctionWrapper<bool, C>(keep), |
|
640 |
FunctionWrapper2<T, U &, V>(reduce), |
|
641 |
options); |
|
642 |
} |
|
643 |
||
644 |
template <typename Iterator, typename T, typename U, typename C, typename V> |
|
645 |
C blockingFilteredReduced(Iterator begin, |
|
646 |
Iterator end, |
|
647 |
bool (keep)(T), |
|
648 |
U (C::*reduce)(V), |
|
649 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
650 |
{
|
|
651 |
return blockingFilteredReduced<C> |
|
652 |
(begin, |
|
653 |
end, |
|
654 |
FunctionWrapper1<bool, T>(keep), |
|
655 |
MemberFunctionWrapper1<U, C, V>(reduce), |
|
656 |
options); |
|
657 |
} |
|
658 |
||
659 |
template <typename Iterator, typename C, typename T, typename D, typename U> |
|
660 |
D blockingFilteredReduced(Iterator begin, |
|
661 |
Iterator end, |
|
662 |
bool (C::*keep)() const, |
|
663 |
T (D::*reduce)(U), |
|
664 |
ReduceOptions options = ReduceOptions(UnorderedReduce | SequentialReduce)) |
|
665 |
{
|
|
666 |
return blockingFilteredReduced<D> |
|
667 |
(begin, |
|
668 |
end, |
|
669 |
ConstMemberFunctionWrapper<bool, C>(keep), |
|
670 |
MemberFunctionWrapper1<T, D, U>(reduce), |
|
671 |
options); |
|
672 |
} |
|
673 |
||
674 |
// blocking filtered() on sequences |
|
675 |
template <typename Sequence, typename KeepFunctor> |
|
676 |
Sequence blockingFiltered(const Sequence &sequence, KeepFunctor keep) |
|
677 |
{
|
|
678 |
return blockingFilteredReduced(sequence, keep, &Sequence::push_back, OrderedReduce); |
|
679 |
} |
|
680 |
||
681 |
template <typename Sequence, typename T> |
|
682 |
Sequence blockingFiltered(const Sequence &sequence, bool (keep)(T)) |
|
683 |
{
|
|
684 |
return blockingFilteredReduced(sequence, keep, &Sequence::push_back, OrderedReduce); |
|
685 |
} |
|
686 |
||
687 |
template <typename Sequence, typename C> |
|
688 |
Sequence blockingFiltered(const Sequence &sequence, bool (C::*filter)() const) |
|
689 |
{
|
|
690 |
return blockingFilteredReduced(sequence, |
|
691 |
filter, |
|
692 |
&Sequence::push_back, |
|
693 |
OrderedReduce); |
|
694 |
} |
|
695 |
||
696 |
// blocking filtered() on iterators |
|
697 |
template <typename OutputSequence, typename Iterator, typename KeepFunctor> |
|
698 |
OutputSequence blockingFiltered(Iterator begin, Iterator end, KeepFunctor keep) |
|
699 |
{
|
|
700 |
return blockingFilteredReduced(begin, |
|
701 |
end, |
|
702 |
keep, |
|
703 |
&OutputSequence::push_back, |
|
704 |
OrderedReduce); |
|
705 |
} |
|
706 |
||
707 |
template <typename OutputSequence, typename Iterator, typename T> |
|
708 |
OutputSequence blockingFiltered(Iterator begin, Iterator end, bool (keep)(T)) |
|
709 |
{
|
|
710 |
return blockingFilteredReduced(begin, |
|
711 |
end, |
|
712 |
keep, |
|
713 |
&OutputSequence::push_back, |
|
714 |
OrderedReduce); |
|
715 |
} |
|
716 |
||
717 |
template <typename OutputSequence, typename Iterator, typename C> |
|
718 |
OutputSequence blockingFiltered(Iterator begin, Iterator end, bool (C::*filter)() const) |
|
719 |
{
|
|
720 |
return blockingFilteredReduced(begin, |
|
721 |
end, |
|
722 |
filter, |
|
723 |
&OutputSequence::push_back, |
|
724 |
OrderedReduce); |
|
725 |
} |
|
726 |
||
727 |
} // namespace QtConcurrent |
|
728 |
||
729 |
#endif // qdoc |
|
730 |
||
731 |
QT_END_NAMESPACE |
|
732 |
QT_END_HEADER |
|
733 |
||
734 |
#endif // QT_NO_CONCURRENT |
|
735 |
||
736 |
#endif |