| /llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/ |
| H A D | ranges.adjacent_find.pass.cpp | 32 concept HasAdjacentFindIt = requires (Iter iter, Sent sent) { std::ranges::adjacent_find(iter, sent…
44 concept HasAdjacentFindR = requires (Range range) { std::ranges::adjacent_find(range); };
63 … std::ranges::adjacent_find(Iter(d.input.data()), Sent(Iter(d.input.data() + d.input.size()))); in test()
68 std::same_as<Iter> decltype(auto) ret = std::ranges::adjacent_find(range); in test()
102 std::ranges::adjacent_find(std::array{1, 2, 3, 4}); in test()
112 auto ret = std::ranges::adjacent_find(a, a + 5, pred, proj); in test()
123 auto ret = std::ranges::adjacent_find(a, pred, proj); in test()
137 auto ret = std::ranges::adjacent_find(a, a + 5, pred, proj); in test()
148 auto ret = std::ranges::adjacent_find(a, pred, proj); in test()
164 auto ret = std::ranges::adjacent_find(std::begin(a), std::end(a), &S::compare, &S::identity); in test()
[all …]
|
| H A D | adjacent_find.pass.cpp | 27 return (std::adjacent_find(std::begin(ia), std::end(ia)) == ia+2) in test_constexpr()
28 && (std::adjacent_find(std::begin(ib), std::end(ib)) == std::end(ib)) in test_constexpr()
37 assert(std::adjacent_find(forward_iterator<const int*>(ia), in main()
40 assert(std::adjacent_find(forward_iterator<const int*>(ia), in main()
43 assert(std::adjacent_find(forward_iterator<const int*>(ia+3), in main()
|
| H A D | adjacent_find_pred.pass.cpp | 31 return (std::adjacent_find(std::begin(ia), std::end(ia), eq) == ia+2) in test_constexpr()
32 && (std::adjacent_find(std::begin(ib), std::end(ib), eq) == std::end(ib)) in test_constexpr()
41 assert(std::adjacent_find(forward_iterator<const int*>(ia), in main()
45 assert(std::adjacent_find(forward_iterator<const int*>(ia), in main()
49 assert(std::adjacent_find(forward_iterator<const int*>(ia+3), in main()
|
| /llvm-project/pstl/test/std/algorithms/alg.nonmodifying/ |
| H A D | adjacent_find.pass.cpp | 29 auto k = std::adjacent_find(first, last, pred); in operator ()()
30 auto i = adjacent_find(exec, first, last, pred); in operator ()()
33 i = adjacent_find(exec, first, last); in operator ()()
52 auto i = std::adjacent_find(in.cbegin(), in.cend(), std::equal_to<T>()); in test_adjacent_find_by_type()
64 auto i = std::adjacent_find(in.cbegin(), in.cend(), std::equal_to<T>()); in test_adjacent_find_by_type()
99 adjacent_find(exec, iter, iter, non_const(std::equal_to<T>())); in operator ()()
|
| /llvm-project/libcxx/include/__algorithm/ |
| H A D | adjacent_find.h | 45 adjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) { in adjacent_find()
52 adjacent_find(_ForwardIterator __first, _ForwardIterator __last) { in adjacent_find()
53 return std::adjacent_find(std::move(__first), std::move(__last), __equal_to());
44 adjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) { adjacent_find() function
50 adjacent_find(_ForwardIterator __first, _ForwardIterator __last) { adjacent_find() function
|
| H A D | ranges_adjacent_find.h | 12 #include <__algorithm/adjacent_find.h>
56 inline constexpr auto adjacent_find = __adjacent_find{};
|
| /llvm-project/libcxx/test/std/time/time.zone/time.zone.db/time.zone.db.access/ |
| H A D | get_tzdb.pass.cpp | 32 assert(std::ranges::adjacent_find(db.zones) == db.zones.end()); // is unique? in main()
36 assert(std::ranges::adjacent_find(db.links) == db.links.end()); // is unique? in main()
|
| /llvm-project/libcxx/test/libcxx/diagnostics/ |
| H A D | algorithm.nodiscard.verify.cpp | 29 std::adjacent_find(std::begin(arr), std::end(arr)); in test()
32 std::adjacent_find(std::begin(arr), std::end(arr), std::greater<int>()); in test()
293 std::ranges::adjacent_find(range); // expected-warning {{ignoring return value of function declared with 'nodiscard' attribute}} in test()
294 std::ranges::adjacent_find(iter, iter); // expected-warning {{ignoring return value of function declared with 'nodiscard' attribute}} in test()
|
| /llvm-project/libcxx/include/__ranges/ |
| H A D | chunk_by_view.h | 75 ranges::adjacent_find(__current, ranges::end(__base_), __reversed_pred), 1, ranges::end(__base_)); in __find_next()
92 return ranges::prev(ranges::adjacent_find(__reversed, __reversed_pred).base(), 1, std::move(__first)); in __find_prev()
|
| /llvm-project/mlir/lib/Dialect/Polynomial/IR/ |
| H A D | Polynomial.cpp | 24 if (std::adjacent_find(monomialsCopy.begin(), monomialsCopy.end(), in fromMonomialsImpl()
|
| /llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| H A D | pstl.rotate_copy.pass.cpp | 85 assert(std::adjacent_find(out.begin(), out.end(), [](int lhs, int rhs) { in operator ()()
|
| /llvm-project/libcxx/test/libcxx/algorithms/ |
| H A D | robust_against_cpp20_hostile_iterators.compile.pass.cpp | 86 (void) std::adjacent_find(it, it); in test()
87 (void) std::adjacent_find(it, it, pred); in test()
|
| H A D | ranges_robust_against_copying_comparators.pass.cpp | 94 (void)std::ranges::adjacent_find(first, last, Equal(&copies)); assert(copies == 0); in all_the_algorithms()
95 (void)std::ranges::adjacent_find(a, Equal(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | ranges_robust_against_copying_projections.pass.cpp | 76 (void)std::ranges::adjacent_find(first, last, Equal(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
77 (void)std::ranges::adjacent_find(a, Equal(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
|
| /llvm-project/llvm/lib/Target/X86/ |
| H A D | X86InstrFoldTables.cpp | 94 assert(std::adjacent_find(std::begin(Table), std::end(Table)) == \ in lookupFoldTableImpl()
217 assert(std::adjacent_find(Table.begin(), Table.end()) == Table.end() && in X86MemUnfoldTable()
|
| /llvm-project/libcxx/test/std/algorithms/ |
| H A D | robust_against_adl.compile.pass.cpp | 50 (void)std::adjacent_find(first, last); in all_the_algorithms()
51 (void)std::adjacent_find(first, last, std::equal_to<void*>()); in all_the_algorithms()
|
| H A D | robust_re_difference_type.compile.pass.cpp | 88 (void)std::adjacent_find(first, last); in all_the_algorithms()
89 (void)std::adjacent_find(first, last, std::equal_to<void*>()); in all_the_algorithms()
|
| H A D | ranges_robust_against_proxy_iterators.pass.cpp | 91 test(std::ranges::adjacent_find, in); in run_tests()
|
| H A D | ranges_robust_against_omitting_invoke.pass.cpp | 88 test(std::ranges::adjacent_find, in, &Foo::binary_pred, &Bar::val); in test_all()
|
| /llvm-project/clang-tools-extra/docs/clang-tidy/checks/modernize/ |
| H A D | use-ranges.rst | 31 ``std::adjacent_find``,
|
| /llvm-project/clang-tools-extra/docs/clang-tidy/checks/boost/ |
| H A D | use-ranges.rst | 33 ``std::adjacent_find``,
|
| /llvm-project/libcxx/modules/std/ |
| H A D | algorithm.inc | 104 using std::adjacent_find;
107 using std::ranges::adjacent_find;
|
| /llvm-project/lldb/source/Plugins/Process/Utility/ |
| H A D | MemoryTagManagerAArch64MTE.cpp | 168 MemoryRegionInfos::const_iterator overlap = std::adjacent_find( in MakeTaggedRanges()
|
| /llvm-project/libcxx/test/std/library/description/conventions/customization.point.object/ |
| H A D | niebloid.compile.pass.cpp | 65 static_assert(test(std::ranges::adjacent_find, a));
|
| /llvm-project/pstl/include/pstl/internal/ |
| H A D | glue_algorithm_defs.h | 94 adjacent_find(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last);
98 adjacent_find(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Binary…
|