| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/ |
| D | ranges_robust_against_differing_projections.pass.cpp | 54 auto proj2 = [](A a) { return a.x * -1; }; in test_all() local
56 test(std::ranges::equal, in, in2, eq, proj1, proj2); in test_all()
57 test(std::ranges::lexicographical_compare, in, in2, eq, proj1, proj2); in test_all()
58 test(std::ranges::is_permutation, in, in2, eq, proj1, proj2); in test_all()
59 test(std::ranges::includes, in, in2, less, proj1, proj2); in test_all()
60 test(std::ranges::find_first_of, in, in2, eq, proj1, proj2); in test_all()
61 test(std::ranges::mismatch, in, in2, eq, proj1, proj2); in test_all()
62 test(std::ranges::search, in, in2, eq, proj1, proj2); in test_all()
63 test(std::ranges::find_end, in, in2, eq, proj1, proj2); in test_all()
64 test(std::ranges::transform, in, in2, out, sum, proj1, proj2); in test_all()
[all …]
|
| /external/cronet/base/ranges/ |
| D | algorithm.h | 61 constexpr BinaryPredicateProjector(Pred& pred, Proj1& proj1, Proj2& proj2) in BinaryPredicateProjector() argument
62 : pred_(pred), proj1_(proj1), proj2_(proj2) {} in BinaryPredicateProjector()
121 Proj2& proj2) noexcept { in ProjectedBinaryPredicate() argument
122 return BinaryPredicateProjector<Pred, Proj1, Proj2>(pred, proj1, proj2); in ProjectedBinaryPredicate()
128 Proj2& proj2) noexcept { in PermutedProjectedBinaryPredicate() argument
129 return BinaryPredicateProjector<Pred, Proj1, Proj2, true>(pred, proj1, proj2); in PermutedProjectedBinaryPredicate()
564 Proj2 proj2 = {}) {
566 internal::ProjectedBinaryPredicate(pred, proj1, proj2));
601 Proj2 proj2 = {}) {
604 std::move(pred), std::move(proj1), std::move(proj2));
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
| D | ranges_includes.pass.cpp | 46 …&& iter1, Sent1&& sent1, Iter2&& iter2, Sent2&& sent2, Comp&& comp, Proj1&& proj1, Proj2&& proj2) {
54 std::forward<Proj2>(proj2));
82 requires(Range1&& range1, Range2&& range2, Comp&& comp, Proj1&& proj1, Proj2&& proj2) {
88 std::forward<Proj2>(proj2));
310 constexpr auto proj2() { in test() function
326 …1.begin(), r1.end(), r2.begin(), r2.end(), compProjs.comp(), compProjs.proj1(), compProjs.proj2()); in test()
337 …uto result = std::ranges::includes(r1, r2, compProjs.comp(), compProjs.proj1(), compProjs.proj2()); in test()
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| D | ranges.is_permutation.pass.cpp | 206 counting_projection<> proj2(proj2Count); in test() local
218 auto ret = std::ranges::is_permutation(a, a + 5, b_begin, b_end, pred, proj1, proj2); in test()
228 …to ret = std::ranges::is_permutation(a, std::ranges::subrange(b_begin, b_end), pred, proj1, proj2); in test()
246 auto ret = std::ranges::is_permutation(a, a + 5, b, b + 5, pred, proj1, proj2); in test()
256 auto ret = std::ranges::is_permutation(a, b, pred, proj1, proj2); in test()
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| D | ranges.lexicographical_compare.pass.cpp | 210 auto proj2 = [&](int i) { ++proj2Count; return i; }; in test() local
212 …exicographical_compare(std::begin(a), std::end(a), std::begin(a), std::end(a), pred, proj1, proj2); in test()
224 auto proj2 = [&](int i) { ++proj2Count; return i; }; in test() local
226 auto ret = std::ranges::lexicographical_compare(a, a, pred, proj1, proj2); in test()
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/ |
| D | ranges_partial_sort_copy.pass.cpp | 270 auto proj2 = [](A value) { return value.a * -1; }; in test() local
281 …t = std::ranges::partial_sort_copy(in.begin(), in.end(), out.begin(), out.end(), {}, proj1, proj2); in test()
290 result = std::ranges::partial_sort_copy(in, out, {}, proj1, proj2); in test()
|
| /external/cronet/buildtools/third_party/libc++/trunk/include/ |
| D | algorithm | 68 …tch()(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {})
74 …mismatch(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) …
155 … F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
163 … F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
417 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
423 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
456 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
466 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
553 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
561 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| D | ranges_set_intersection.pass.cpp | 491 const auto proj2 = [&numberOfProj2](const Data& d) { in test() local
496 …nges::set_intersection(r1.begin(), r1.end(), r2.begin(), r2.end(), out.data(), comp, proj1, proj2); in test()
521 const auto proj2 = [&numberOfProj2](const Data& d) { in test() local
526 std::ranges::set_intersection(r1, r2, out.data(), comp, proj1, proj2); in test()
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| D | ranges_set_difference.pass.cpp | 472 const auto proj2 = [&numberOfProj2](const Data& d) { in test() local
477 …ranges::set_difference(r1.begin(), r1.end(), r2.begin(), r2.end(), out.data(), comp, proj1, proj2); in test()
502 const auto proj2 = [&numberOfProj2](const Data& d) { in test() local
507 std::ranges::set_difference(r1, r2, out.data(), comp, proj1, proj2); in test()
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.modifying.operations/alg.transform/ |
| D | ranges.transform.binary.iterator.pass.cpp | 164 auto proj2 = [&](int) { ++proj2Count; return 0; }; in test_iterators() local
168 …transform(In1(a), Sent1(In1(a + 4)), In2(b), Sent2(In2(b + 4)), Out(c.data()), pred, proj1, proj2); in test_iterators()
|
| D | ranges.transform.binary.range.pass.cpp | 177 auto proj2 = [&](int) { ++proj2Count; return 0; }; in test_iterators() local
183 std::ranges::transform(range1, range2, Out(c.data()), pred, proj1, proj2); in test_iterators()
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.sorting/alg.merge/ |
| D | ranges_merge.pass.cpp | 499 const auto proj2 = [&numberOfProj2](const Data& d) { in test() local
504 std::ranges::merge(r1, r1 + 10, r2, r2 + 10, out.data(), comp, proj1, proj2); in test()
528 const auto proj2 = [&numberOfProj2](const Data& d) { in test() local
533 std::ranges::merge(r1, r2, out.data(), comp, proj1, proj2); in test()
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.sorting/alg.set.operations/set.union/ |
| D | ranges_set_union.pass.cpp | 442 constexpr auto proj2() { in test() function
469 compProjs.proj2()); in test()
482 …std::ranges::set_union(r1, r2, out.data(), compProjs.comp(), compProjs.proj1(), compProjs.proj2()); in test()
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| D | ranges_set_symmetric_difference.pass.cpp | 442 constexpr auto proj2() { in test() function
469 compProjs.proj2()); in test()
482 …t_symmetric_difference(r1, r2, out.data(), compProjs.comp(), compProjs.proj1(), compProjs.proj2()); in test()
|