| /external/abseil-cpp/absl/algorithm/ |
| D | algorithm.h | 45 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
49 if (first1 == last1) return first2 == last2; in EqualImpl()
50 if (first2 == last2) return false; in EqualImpl()
51 if (!pred(*first1, *first2)) return false; in EqualImpl()
53 ++first2; in EqualImpl()
58 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
61 return (last1 - first1 == last2 - first2) && in EqualImpl()
62 std::equal(first1, last1, first2, std::forward<Pred>(pred)); in EqualImpl()
69 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
73 return (last1 - first1 == last2 - first2) && in EqualImpl()
[all …]
|
| /external/webrtc/third_party/abseil-cpp/absl/algorithm/ |
| D | algorithm.h | 45 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
49 if (first1 == last1) return first2 == last2; in EqualImpl()
50 if (first2 == last2) return false; in EqualImpl()
51 if (!pred(*first1, *first2)) return false; in EqualImpl()
53 ++first2; in EqualImpl()
58 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
61 return (last1 - first1 == last2 - first2) && in EqualImpl()
62 std::equal(first1, last1, first2, std::forward<Pred>(pred)); in EqualImpl()
69 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
73 return (last1 - first1 == last2 - first2) && in EqualImpl()
[all …]
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/algorithm/ |
| D | algorithm.h | 45 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
49 if (first1 == last1) return first2 == last2; in EqualImpl()
50 if (first2 == last2) return false; in EqualImpl()
51 if (!pred(*first1, *first2)) return false; in EqualImpl()
53 ++first2; in EqualImpl()
58 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
61 return (last1 - first1 == last2 - first2) && in EqualImpl()
62 std::equal(first1, last1, first2, std::forward<Pred>(pred)); in EqualImpl()
69 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
73 return (last1 - first1 == last2 - first2) && in EqualImpl()
[all …]
|
| D | container.h | 350 auto first2 = container_algorithm_internal::c_begin(c2);
353 for (; first1 != last1 && first2 != last2; ++first1, (void)++first2) {
356 if (!(*first1 == *first2)) {
361 return std::make_pair(first1, first2);
372 auto first2 = container_algorithm_internal::c_begin(c2);
375 for (; first1 != last1 && first2 != last2; ++first1, (void)++first2) {
376 if (!pred(*first1, *first2)) {
381 return std::make_pair(first1, first2);
569 auto first2 = container_algorithm_internal::c_begin(c2);
573 for (; first1 != last1 && first2 != last2; ++first1, (void)++first2) {
[all …]
|
| /external/openscreen/third_party/abseil/src/absl/algorithm/ |
| D | algorithm.h | 45 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
49 if (first1 == last1) return first2 == last2; in EqualImpl()
50 if (first2 == last2) return false; in EqualImpl()
51 if (!pred(*first1, *first2)) return false; in EqualImpl()
53 ++first2; in EqualImpl()
58 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
61 return (last1 - first1 == last2 - first2) && in EqualImpl()
62 std::equal(first1, last1, first2, std::forward<Pred>(pred)); in EqualImpl()
69 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
73 return (last1 - first1 == last2 - first2) && in EqualImpl()
[all …]
|
| D | container.h | 350 auto first2 = container_algorithm_internal::c_begin(c2);
353 for (; first1 != last1 && first2 != last2; ++first1, (void)++first2) {
356 if (!(*first1 == *first2)) {
361 return std::make_pair(first1, first2);
372 auto first2 = container_algorithm_internal::c_begin(c2);
375 for (; first1 != last1 && first2 != last2; ++first1, (void)++first2) {
376 if (!pred(*first1, *first2)) {
381 return std::make_pair(first1, first2);
569 auto first2 = container_algorithm_internal::c_begin(c2);
573 for (; first1 != last1 && first2 != last2; ++first1, (void)++first2) {
[all …]
|
| /external/libtextclassifier/abseil-cpp/absl/algorithm/ |
| D | algorithm.h | 45 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
49 if (first1 == last1) return first2 == last2; in EqualImpl()
50 if (first2 == last2) return false; in EqualImpl()
51 if (!pred(*first1, *first2)) return false; in EqualImpl()
53 ++first2; in EqualImpl()
58 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
61 return (last1 - first1 == last2 - first2) && in EqualImpl()
62 std::equal(first1, last1, first2, std::forward<Pred>(pred)); in EqualImpl()
69 bool EqualImpl(InputIter1 first1, InputIter1 last1, InputIter2 first2, in EqualImpl() argument
73 return (last1 - first1 == last2 - first2) && in EqualImpl()
[all …]
|
| D | container.h | 350 auto first2 = container_algorithm_internal::c_begin(c2);
353 for (; first1 != last1 && first2 != last2; ++first1, (void)++first2) {
356 if (!(*first1 == *first2)) {
361 return std::make_pair(first1, first2);
372 auto first2 = container_algorithm_internal::c_begin(c2);
375 for (; first1 != last1 && first2 != last2; ++first1, (void)++first2) {
376 if (!pred(*first1, *first2)) {
381 return std::make_pair(first1, first2);
569 auto first2 = container_algorithm_internal::c_begin(c2);
573 for (; first1 != last1 && first2 != last2; ++first1, (void)++first2) {
[all …]
|
| /external/llvm-project/pstl/test/std/algorithms/alg.modifying.operations/ |
| D | unique.pass.cpp | 28 …perator()(pstl::execution::unsequenced_policy, ForwardIt first1, ForwardIt last1, ForwardIt first2, in operator ()()
35 …(pstl::execution::parallel_unsequenced_policy, ForwardIt first1, ForwardIt last1, ForwardIt first2, in operator ()()
42 …perator()(pstl::execution::unsequenced_policy, ForwardIt first1, ForwardIt last1, ForwardIt first2, in operator ()()
49 …(pstl::execution::parallel_unsequenced_policy, ForwardIt first1, ForwardIt last1, ForwardIt first2, in operator ()()
57 …operator()(Policy&& exec, ForwardIt first1, ForwardIt last1, ForwardIt first2, ForwardIt last2, Ge… in operator ()()
63 fill_data(first2, last2, generator); in operator ()()
66 ForwardIt k = unique(exec, first2, last2); in operator ()()
69 … EXPECT_TRUE(std::distance(first2, k) == n, "wrong return value from unique without predicate"); in operator ()()
70 EXPECT_EQ_N(first1, first2, n, "wrong effect from unique without predicate"); in operator ()()
75 …operator()(Policy&& exec, ForwardIt first1, ForwardIt last1, ForwardIt first2, ForwardIt last2, Bi… in operator ()()
[all …]
|
| D | transform_binary.pass.cpp | 37 check_and_reset(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, OutputIterator … in check_and_reset() argument
41 for (; first1 != last1; ++first1, ++first2, ++out_first, ++k) in check_and_reset()
44 Out expected = Out(1.5) + *first1 - *first2; in check_and_reset()
65 …operator()(Policy&& exec, InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, Inpu… in operator ()()
68 auto result = std::transform(exec, first1, last1, first2, out_first, op); in operator ()()
70 check_and_reset(first1, last1, first2, out_first); in operator ()()
|
| /external/llvm-project/pstl/test/std/algorithms/alg.sorting/alg.set.operations/ |
| D | set.pass.cpp | 59 …operator()(Policy&& exec, InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, Inpu… in operator ()()
65 auto n2 = std::distance(first2, last2); in operator ()()
70 auto expect_res = std::set_union(first1, last1, first2, last2, expect.begin(), comp); in operator ()()
71 auto res = std::set_union(exec, first1, last1, first2, last2, out.begin(), comp); in operator ()()
89 …operator()(Policy&& exec, InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, Inpu… in operator ()()
95 auto n2 = std::distance(first2, last2); in operator ()()
100 auto expect_res = std::set_intersection(first1, last1, first2, last2, expect.begin(), comp); in operator ()()
101 auto res = std::set_intersection(exec, first1, last1, first2, last2, out.begin(), comp); in operator ()()
119 …operator()(Policy&& exec, InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, Inpu… in operator ()()
125 auto n2 = std::distance(first2, last2); in operator ()()
[all …]
|
| D | includes.pass.cpp | 49 …operator()(Policy&& exec, InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, Inpu… in operator ()()
53 auto expect_res = std::includes(first1, last1, first2, last2, comp); in operator ()()
54 auto res = std::includes(exec, first1, last1, first2, last2, comp); in operator ()()
|
| /external/llvm-project/libcxx/test/libcxx/fuzzing/ |
| D | fuzz.h | 67 bool fast_is_permutation(Iter1 first1, Iter1 last1, Iter2 first2) { in fast_is_permutation() argument
73 for (; first1 != last1; ++first1, ++first2) { in fast_is_permutation()
77 yBuckets[first2->key]++; in fast_is_permutation()
78 yPayloads[first2->key] += first2->payload; in fast_is_permutation()
95 bool fast_is_permutation(Iter1 first1, Iter1 last1, Iter2 first2) { in fast_is_permutation() argument
99 for (; first1 != last1; ++first1, ++first2) { in fast_is_permutation()
101 yBuckets[*first2]++; in fast_is_permutation()
|
| /external/llvm-project/pstl/test/std/algorithms/alg.nonmodifying/ |
| D | mismatch.pass.cpp | 25 operator()(Policy&& exec, Iterator1 first1, Iterator1 last1, Iterator2 first2) in operator ()()
30 const auto expected = std::mismatch(first1, last1, first2, std::equal_to<T>()); in operator ()()
31 const auto res3 = mismatch(exec, first1, last1, first2, std::equal_to<T>()); in operator ()()
33 const auto res4 = mismatch(exec, first1, last1, first2); in operator ()()
39 operator()(Policy&& exec, Iterator1 first1, Iterator1 last1, Iterator2 first2, Iterator2 last2) in operator ()()
44 …const auto expected = mismatch(std::execution::seq, first1, last1, first2, last2, std::equal_to<T>… in operator ()()
45 const auto res1 = mismatch(exec, first1, last1, first2, last2, std::equal_to<T>()); in operator ()()
47 const auto res2 = mismatch(exec, first1, last1, first2, last2); in operator ()()
|
| D | nth_element.pass.cpp | 75 …perator()(pstl::execution::unsequenced_policy, Iterator1 first1, Iterator1 last1, Iterator1 first2, in operator ()()
81 …(pstl::execution::parallel_unsequenced_policy, Iterator1 first1, Iterator1 last1, Iterator1 first2, in operator ()()
91 …operator()(Policy&& exec, Iterator1 first1, Iterator1 last1, Iterator1 first2, Iterator1 last2, Si… in operator ()()
97 const Iterator1 mid2 = std::next(first2, m); in operator ()()
101 fill_data(first2, mid2, generator1); in operator ()()
104 std::nth_element(exec, first2, mid2, last2, comp); in operator ()()
109 …EXPECT_TRUE(std::find_first_of(first2, mid2, mid2, last2, [comp](T& x, T& y) { return comp(y, x); … in operator ()()
|
| D | equal.pass.cpp | 100 …operator()(ExecutionPolicy&& exec, Iterator1 first1, Iterator1 last1, Iterator2 first2, bool is_tr… in operator ()()
104 auto expected = equal(first1, last1, first2); in operator ()()
105 auto actual = equal(exec, first1, last1, first2); in operator ()()
|
| /external/llvm-project/pstl/test/std/algorithms/alg.merge/ |
| D | merge.pass.cpp | 27 …operator()(Policy&& exec, InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, Inpu… in operator ()()
32 const auto res = merge(exec, first1, last1, first2, last2, out_first, comp); in operator ()()
36 …EXPECT_TRUE(includes(out_first, res, first2, last2, comp), "second sequence is not a part of resul… in operator ()()
39 const auto res = merge(exec, first1, last1, first2, last2, out_first); in operator ()()
50 … std::reverse_iterator<InputIterator2> first2, std::reverse_iterator<InputIterator2> last2, in operator ()()
55 const auto res = merge(exec, first1, last1, first2, last2, out_first, std::greater<T>()); in operator ()()
61 EXPECT_TRUE(includes(out_first, res, first2, last2, std::greater<T>()), in operator ()()
|
| D | inplace_merge.pass.cpp | 27 …l::execution::unsequenced_policy, BiDirIt1 first1, BiDirIt1 last1, BiDirIt1 first2, BiDirIt1 last2, in operator ()()
34 …r()(pstl::execution::parallel_unsequenced_policy, BiDirIt1 first1, BiDirIt1 last1, BiDirIt1 first2, in operator ()()
44 …operator()(Policy&& exec, BiDirIt1 first1, BiDirIt1 last1, BiDirIt1 first2, BiDirIt1 last2, Size n… in operator ()()
51 const BiDirIt1 mid2 = std::next(first2, m); in operator ()()
52 fill_data(first2, mid2, generator1); in operator ()()
56 std::inplace_merge(exec, first2, mid2, last2, comp); in operator ()()
57 EXPECT_EQ_N(first1, first2, n, "wrong effect from inplace_merge with predicate"); in operator ()()
|
| /external/libcxx/fuzzing/ |
| D | fuzzing.cpp | 114 bool is_permutation(SVIter first1, SVIter last1, SVIter first2) in is_permutation() argument
121 for (; first1 != last1; ++first1, ++first2) in is_permutation()
126 yBuckets [first2->key]++; in is_permutation()
127 yPayloads[first2->key] += first2->payload; in is_permutation()
142 bool is_permutation(Iter1 first1, Iter1 last1, Iter2 first2) in is_permutation() argument
150 for (; first1 != last1; ++first1, ++first2) in is_permutation()
153 yBuckets [*first2]++; in is_permutation()
341 static bool compare_unique(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2) in compare_unique() argument
343 assert(first1 != last1 && first2 != last2); in compare_unique()
344 if (*first1 != *first2) return false; in compare_unique()
[all …]
|
| /external/llvm-project/libcxx/test/std/numerics/numeric.ops/transform.reduce/ |
| D | transform_reduce_iter_iter_iter_init.pass.cpp | 30 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x) in test() argument
33 decltype(std::transform_reduce(first1, last1, first2, init))> ); in test()
34 assert(std::transform_reduce(first1, last1, first2, init) == x); in test()
|
| D | transform_reduce_iter_iter_iter_init_op_op.pass.cpp | 32 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, Op1 op1, Op2 op2, T x) in test() argument
35 decltype(std::transform_reduce(first1, last1, first2, init, op1, op2))> ); in test()
36 assert(std::transform_reduce(first1, last1, first2, init, op1, op2) == x); in test()
|
| /external/libcxx/test/std/numerics/numeric.ops/transform.reduce/ |
| D | transform_reduce_iter_iter_iter_init.pass.cpp | 27 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x) in test() argument
30 decltype(std::transform_reduce(first1, last1, first2, init))> ); in test()
31 assert(std::transform_reduce(first1, last1, first2, init) == x); in test()
|
| D | transform_reduce_iter_iter_iter_init_op_op.pass.cpp | 29 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, Op1 op1, Op2 op2, T x) in test() argument
32 decltype(std::transform_reduce(first1, last1, first2, init, op1, op2))> ); in test()
33 assert(std::transform_reduce(first1, last1, first2, init, op1, op2) == x); in test()
|
| /external/llvm-project/pstl/test/std/utilities/memory/specialized.algorithms/ |
| D | uninitialized_copy_move.pass.cpp | 26 IsCheckValueCorrectness(InputIterator first1, OutputIterator first2, Size n) in IsCheckValueCorrectness() argument
28 for (Size i = 0; i < n; ++i, ++first1, ++first2) in IsCheckValueCorrectness()
30 if (*first1 != *first2) in IsCheckValueCorrectness()
|
| /external/llvm-project/pstl/test/std/numerics/numeric.ops/ |
| D | transform_reduce.pass.cpp | 82 …operator()(Policy&& exec, InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, Inpu… in operator ()()
86 auto expectedB = std::inner_product(first1, last1, first2, init, opB1, opB2); in operator ()()
88 T resRA = std::transform_reduce(exec, first1, last1, first2, init, opB1, opB2); in operator ()()
|