| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/ |
| D | robust_against_adl.compile.pass.cpp | 49 Holder<Incomplete> **first2 = u.data; in all_the_algorithms() local
67 (void)std::copy(first, last, first2); in all_the_algorithms()
69 (void)std::copy_n(first, count, first2); in all_the_algorithms()
73 (void)std::equal(first, last, first2); in all_the_algorithms()
74 (void)std::equal(first, last, first2, std::equal_to<void*>()); in all_the_algorithms()
76 (void)std::equal(first, last, first2, last2); in all_the_algorithms()
77 (void)std::equal(first, last, first2, last2, std::equal_to<void*>()); in all_the_algorithms()
84 (void)std::find_end(first, last, first2, mid2); in all_the_algorithms()
85 (void)std::find_end(first, last, first2, mid2, std::equal_to<void*>()); in all_the_algorithms()
94 (void)std::includes(first, last, first2, last2); in all_the_algorithms()
[all …]
|
| D | robust_re_difference_type.compile.pass.cpp | 81 auto first2 = PickyIterator<void**, long long>(b); in all_the_algorithms() local
99 (void)std::copy(first, last, first2); in all_the_algorithms()
101 (void)std::copy_n(first, count, first2); in all_the_algorithms()
105 (void)std::equal(first, last, first2); in all_the_algorithms()
106 (void)std::equal(first, last, first2, std::equal_to<void*>()); in all_the_algorithms()
108 (void)std::equal(first, last, first2, last2); in all_the_algorithms()
109 (void)std::equal(first, last, first2, last2, std::equal_to<void*>()); in all_the_algorithms()
116 (void)std::find_end(first, last, first2, mid2); in all_the_algorithms()
117 (void)std::find_end(first, last, first2, mid2, std::equal_to<void*>()); in all_the_algorithms()
126 (void)std::includes(first, last, first2, last2); in all_the_algorithms()
[all …]
|
| /external/angle/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 | 353 auto first2 = container_algorithm_internal::c_begin(c2);
356 for (; first1 != last1 && first2 != last2; ++first1, (void)++first2) {
359 if (!(*first1 == *first2)) {
364 return std::make_pair(first1, first2);
375 auto first2 = container_algorithm_internal::c_begin(c2);
378 for (; first1 != last1 && first2 != last2; ++first1, (void)++first2) {
379 if (!pred(*first1, *first2)) {
384 return std::make_pair(first1, first2);
572 auto first2 = container_algorithm_internal::c_begin(c2);
576 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 …]
|
| /external/tensorflow/third_party/absl/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/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/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/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 …]
|
| /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/cronet/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/cronet/buildtools/third_party/libc++/trunk/test/libcxx/algorithms/ |
| D | robust_against_copying_comparators.pass.cpp | 100 T *first2 = b; in all_the_algorithms() local
117 (void)std::copy_if(first, last, first2, UnaryTrue<T>(&copies)); assert(copies == 0); in all_the_algorithms()
118 (void)std::equal(first, last, first2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
120 (void)std::equal(first, last, first2, last2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
123 (void)std::find_end(first, last, first2, mid2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
124 (void)std::find_first_of(first, last, first2, last2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
133 (void)std::includes(first, last, first2, last2, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
137 (void)std::is_permutation(first, last, first2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
139 (void)std::is_permutation(first, last, first2, last2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
144 …(void)std::lexicographical_compare(first, last, first2, last2, Less<T>(&copies)); assert(copies ==… in all_the_algorithms()
[all …]
|
| D | ranges_robust_against_copying_comparators.pass.cpp | 85 void **first2 = b; in all_the_algorithms() local
103 (void)std::ranges::copy_if(first, last, first2, UnaryTrue(&copies)); assert(copies == 0); in all_the_algorithms()
104 (void)std::ranges::copy_if(a, first2, UnaryTrue(&copies)); assert(copies == 0); in all_the_algorithms()
108 (void)std::ranges::equal(first, last, first2, last2, Equal(&copies)); assert(copies == 0); in all_the_algorithms()
112 (void)std::ranges::find_end(first, last, first2, mid2, Equal(&copies)); assert(copies == 0); in all_the_algorithms()
114 … (void)std::ranges::find_first_of(first, last, first2, last2, Equal(&copies)); assert(copies == 0); in all_the_algorithms()
126 (void)std::ranges::includes(first, last, first2, last2, Less(&copies)); assert(copies == 0); in all_the_algorithms()
134 …(void)std::ranges::is_permutation(first, last, first2, last2, Equal(&copies)); assert(copies == 0); in all_the_algorithms()
142 …(void)std::ranges::lexicographical_compare(first, last, first2, last2, Less(&copies)); assert(copi… in all_the_algorithms()
153 (void)std::ranges::merge(first, mid, mid, last, first2, Less(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| D | ranges_robust_against_copying_projections.pass.cpp | 67 T *first2 = b; in all_the_algorithms() local
87 … (void)std::ranges::copy_if(first, last, first2, UnaryTrue(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
88 (void)std::ranges::copy_if(a, first2, UnaryTrue(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
92 …(void)std::ranges::equal(first, last, first2, last2, Equal(), Proj(&copies), Proj(&copies)); asser… in all_the_algorithms()
98 …(void)std::ranges::find_end(first, last, first2, mid2, Equal(), Proj(&copies), Proj(&copies)); ass… in all_the_algorithms()
100 …(void)std::ranges::find_first_of(first, last, first2, last2, Equal(), Proj(&copies), Proj(&copies)… in all_the_algorithms()
109 …(void)std::ranges::includes(first, last, first2, last2, Less(), Proj(&copies), Proj(&copies)); ass… in all_the_algorithms()
117 …(void)std::ranges::is_permutation(first, last, first2, last2, Equal(), Proj(&copies), Proj(&copies… in all_the_algorithms()
125 …(void)std::ranges::lexicographical_compare(first, last, first2, last2, Less(), Proj(&copies), Proj… in all_the_algorithms()
136 …(void)std::ranges::merge(first, mid, mid, last, first2, Less(), Proj(&copies), Proj(&copies)); ass… in all_the_algorithms()
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/libcxx/fuzzing/ |
| D | fuzz.h | 68 bool fast_is_permutation(Iter1 first1, Iter1 last1, Iter2 first2) { in fast_is_permutation() argument
74 for (; first1 != last1; ++first1, ++first2) { in fast_is_permutation()
78 yBuckets[first2->key]++; in fast_is_permutation()
79 yPayloads[first2->key] += first2->payload; in fast_is_permutation()
96 bool fast_is_permutation(Iter1 first1, Iter1 last1, Iter2 first2) { in fast_is_permutation() argument
100 for (; first1 != last1; ++first1, ++first2) { in fast_is_permutation()
102 yBuckets[*first2]++; in fast_is_permutation()
|
| /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/pigweed/pw_containers/public/pw_containers/ |
| D | algorithm.h | 218 auto first2 = std::begin(c2); in Mismatch() local
221 for (; first1 != last1 && first2 != last2; ++first1, (void)++first2) { in Mismatch()
224 if (!(*first1 == *first2)) { in Mismatch()
229 return std::make_pair(first1, first2); in Mismatch()
240 auto first2 = std::begin(c2); in Mismatch() local
243 for (; first1 != last1 && first2 != last2; ++first1, (void)++first2) { in Mismatch()
244 if (!pred(*first1, *first2)) { in Mismatch()
249 return std::make_pair(first1, first2); in Mismatch()
|
| /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/cronet/buildtools/third_party/libc++/trunk/test/std/numerics/numeric.ops/transform.reduce/ |
| D | transform_reduce_iter_iter_iter_init.pass.cpp | 29 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x) in test() argument
32 decltype(std::transform_reduce(first1, last1, first2, init))> ); in test()
33 assert(std::transform_reduce(first1, last1, first2, init) == x); in test()
|
| D | transform_reduce_iter_iter_iter_init_op_op.pass.cpp | 31 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, Op1 op1, Op2 op2, T x) in test() argument
34 decltype(std::transform_reduce(first1, last1, first2, init, op1, op2))> ); in test()
35 assert(std::transform_reduce(first1, last1, first2, init, op1, op2) == x); in test()
|
| /external/cronet/base/ |
| D | value_iterators_unittest.cc | 24 InputIterator2 first2, in are_equal() argument
27 for (; first1 != last1 && first2 != last2; ++first1, ++first2) { in are_equal()
28 if (!pred(*first1, *first2)) in are_equal()
31 return first1 == last1 && first2 == last2; in are_equal()
|
| /external/cronet/buildtools/third_party/libc++/trunk/include/ |
| D | algorithm | 68 …mismatch()(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2…
154 transform(I1 first1, S1 last1, I2 first2, S2 last2, O result,
415 constexpr bool ranges::equal(I1 first1, S1 last1, I2 first2, S2 last2,
551 constexpr I1 ranges::find_first_of(I1 first1, S1 last1, I2 first2, S2 last2,
606 ranges::lexicographical_compare(I1 first1, S1 last1, I2 first2, S2 last2,
673 merge(I1 first1, S1 last1, I2 first2, S2 last2, O result,
711 set_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result,
729 set_intersection(I1 first1, S1 last1, I2 first2, S2 last2, O result,
799 constexpr bool ranges::is_permutation(I1 first1, S1 last1, I2 first2, S2 last2,
815 ranges::search(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
[all …]
|