| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| merge.h | 47 * @param begin2 Begin iterator of second sequence.
59 RandomAccessIterator2& begin2,
64 while (begin1 != end1 && begin2 != end2 && max_length > 0)
67 if (comp(*begin2, *begin1))
68 *target++ = *begin2++;
81 target = std::copy(begin2, begin2 + max_length, target);
82 begin2 += max_length;
96 * @param begin2 Begin iterator of second sequence.
108 RandomAccessIterator2& begin2,
[all...] |
| algobase.h | 55 mismatch(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2,
57 { return _GLIBCXX_STD_P::mismatch(begin1, end1, begin2); }
63 mismatch(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2,
65 { return _GLIBCXX_STD_P::mismatch(begin1, end1, begin2, pred); }
72 InputIterator2 begin2, Predicate pred, IteratorTag1,
74 { return _GLIBCXX_STD_P::mismatch(begin1, end1, begin2, pred); }
81 RandomAccessIterator2 begin2, Predicate pred,
87 __gnu_parallel::find_template(begin1, end1, begin2, pred,
90 return make_pair(res , begin2 + (res - begin1));
93 return _GLIBCXX_STD_P::mismatch(begin1, end1, begin2, pred)
[all...] |
| find_selectors.h | 66 * @param begin2 Begin iterator of second sequence.
74 RandomAccessIterator2 begin2, Pred pred)
76 sequential_tag()), begin2); }
99 * @param begin2 Begin iterator of second sequence.
107 RandomAccessIterator2 begin2, Pred pred)
114 return std::make_pair(spot, begin2);
137 * @param begin2 Begin iterator of second sequence.
145 RandomAccessIterator2 begin2, Pred pred)
146 { return mismatch(begin1, end1, begin2, pred, sequential_tag()); }
179 * @param begin2 Begin iterator of second sequence
[all...] |
| find.h | 49 * @param begin2 Begin iterator of second sequence. Must have same
61 RandomAccessIterator2 begin2, Pred pred, Selector selector)
66 return find_template(begin1, end1, begin2, pred, selector,
69 return find_template(begin1, end1, begin2, pred, selector,
72 return find_template(begin1, end1, begin2, pred, selector,
76 return std::make_pair(begin1, begin2);
86 * @param begin2 Begin iterator of second sequence. Second sequence
99 RandomAccessIterator2 begin2,
131 RandomAccessIterator2 i2 = begin2 + start;
157 begin2 + result)
[all...] |
| search.h | 74 * @param begin2 Begin iterator of second sequence.
83 _RandomAccessIterator2 begin2, _RandomAccessIterator2 end2,
89 _GLIBCXX_CALL((end1 - begin1) + (end2 - begin2));
91 difference_type pattern_length = end2 - begin2;
116 calc_borders(begin2, pattern_length, advances);
142 begin2[pos_in_pattern]))
|
| set_operations.h | 355 InputIterator begin2, InputIterator end2,
358 _GLIBCXX_CALL((end1 - begin1) + (end2 - begin2))
365 return op.first_empty(begin2, end2, result);
367 if (begin2 == end2)
370 const difference_type size = (end1 - begin1) + (end2 - begin2);
373 { std::make_pair(begin1, end1), std::make_pair(begin2, end2) } ;
381 std::min(end1 - begin1, end2 - begin2));
393 block_begins[0] = std::make_pair(begin1, begin2);
478 InputIterator begin2, InputIterator end2,
481 return parallel_set_operation(begin1, end1, begin2, end2, result
[all...] |
| algo.h | 214 ForwardIterator begin2, ForwardIterator end2,
216 { return _GLIBCXX_STD_P::find_first_of(begin1, end1, begin2, end2); }
223 ForwardIterator begin2, ForwardIterator end2,
225 { return _GLIBCXX_STD_P::find_first_of(begin1, end1, begin2, end2, comp); }
232 ForwardIterator begin2, ForwardIterator end2,
234 { return find_first_of(begin1, end1, begin2, end2,
243 ForwardIterator begin2, ForwardIterator end2,
250 <ForwardIterator>(begin2, end2)).first;
259 ForwardIterator begin2, ForwardIterator end2,
261 { return find_first_of(begin1, end1, begin2, end2, comp,
[all...] |
| /external/astl/include/ |
| algorithm | 255 // @param begin2 An input iterator.
263 _InputIterator2 begin2)
265 for (; begin1 < end1; ++begin1, ++begin2)
267 if (!(*begin1 == *begin2))
278 // @param begin2 An input iterator.
283 _InputIterator2 begin2, _BinaryPredicated binary_predicate)
285 for (; begin1 < end1; ++begin1, ++begin2)
287 if (!bool(binary_predicate(*begin1, *begin2)))
|