Home
last modified time | relevance | path

Searched refs:find_end (Results 1 – 25 of 37) sorted by relevance

12

/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/
Dfind_end.pass.cpp32 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
33 …&& (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib))) == F… in test_constexpr()
34 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia))) == B… in test_constexpr()
35 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib))) == B… in test_constexpr()
36 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia))) == R… in test_constexpr()
37 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib))) == R… in test_constexpr()
49 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1)) == Iter1(ia+sa-1)); in test()
51 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2)) == Iter1(ia+18)); in test()
53 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3)) == Iter1(ia+15)); in test()
55 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4)) == Iter1(ia+11)); in test()
[all …]
Dfind_end_pred.pass.cpp42 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
43 …&& (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib)), eq) … in test_constexpr()
44 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr()
45 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)), eq) … in test_constexpr()
46 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)), eq) … in test_constexpr()
47 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)), eq) … in test_constexpr()
62 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-… in test()
66 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)… in test()
70 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)… in test()
74 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)… in test()
[all …]
/external/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/
Dfind_end.pass.cpp31 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
32 …&& (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib))) == F… in test_constexpr()
33 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia))) == B… in test_constexpr()
34 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib))) == B… in test_constexpr()
35 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia))) == R… in test_constexpr()
36 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib))) == R… in test_constexpr()
48 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1)) == Iter1(ia+sa-1)); in test()
50 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2)) == Iter1(ia+18)); in test()
52 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3)) == Iter1(ia+15)); in test()
54 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4)) == Iter1(ia+11)); in test()
[all …]
Dfind_end_pred.pass.cpp41 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
42 …&& (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib)), eq) … in test_constexpr()
43 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr()
44 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)), eq) … in test_constexpr()
45 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)), eq) … in test_constexpr()
46 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)), eq) … in test_constexpr()
61 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-… in test()
65 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)… in test()
69 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)… in test()
73 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)… in test()
[all …]
/external/llvm-project/pstl/test/std/algorithms/alg.nonmodifying/
Dfind_end.pass.cpp46 auto expected = find_end(b, e, bsub, esub, pred); in operator ()()
47 auto actual = find_end(exec, b, e, bsub, esub); in operator ()()
50 actual = find_end(exec, b, e, bsub, esub, pred); in operator ()()
103 … find_end(exec, first_iter, first_iter, second_iter, second_iter, non_const(std::equal_to<T>())); in operator ()()
/external/rust/crates/regex/src/literal/
Dmod.rs39 pub fn find_end(&self, _: &[u8]) -> Option<(usize, usize)> { in find_end() method
Dimp.rs114 pub fn find_end(&self, haystack: &[u8]) -> Option<(usize, usize)> { in find_end() method
/external/llvm-project/clang/test/Analysis/
Dstl-algorithm-modeling.cpp224 const auto i5 = std::find_end(i1, i2, i3, i4); in test_find_end1()
245 const auto i5 = std::find_end(std::execution::sequenced_policy(), in test_find_end2()
267 const auto i5 = std::find_end(i1, i2, i3, i4, odd); in test_find_end3()
288 const auto i5 = std::find_end(std::execution::sequenced_policy(), in test_find_end4()
Dstl-algorithm-modeling-aggressive-std-find-modeling.cpp245 const auto i5 = std::find_end(i1, i2, i3, i4); in test_find_end1()
268 const auto i5 = std::find_end(std::execution::sequenced_policy(), in test_find_end2()
292 const auto i5 = std::find_end(i1, i2, i3, i4, odd); in test_find_end3()
315 const auto i5 = std::find_end(std::execution::sequenced_policy(), in test_find_end4()
/external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/
Dstringpiece.cc48 const_pointer result = std::find_end(data_, last, s.data_, s.data_ + s.size_); in rfind()
/external/llvm-project/libcxx/test/libcxx/diagnostics/
Dnodiscard_extensions.verify.cpp94 std::find_end(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr)); in main()
97 std::find_end(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr), in main()
Dnodiscard_extensions.pass.cpp61 std::find_end(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr)); in main()
62 std::find_end(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr), in main()
/external/llvm-project/libcxx/test/std/algorithms/
Drobust_against_adl.pass.cpp91 (void)std::find_end(t.data, t.data+10, u.data, u.data+5); in test()
135 (void)std::find_end(t.data, t.data+10, u.data, u.data+5, std::equal_to<void*>()); in test()
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/strings/
Dstring_view.cc106 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_); in rfind()
/external/abseil-cpp/absl/strings/
Dstring_view.cc106 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_); in rfind()
/external/libtextclassifier/abseil-cpp/absl/strings/
Dstring_view.cc106 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_); in rfind()
/external/openscreen/third_party/abseil/src/absl/strings/
Dstring_view.cc106 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_); in rfind()
/external/webrtc/third_party/abseil-cpp/absl/strings/
Dstring_view.cc106 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_); in rfind()
/external/angle/third_party/abseil-cpp/absl/strings/
Dstring_view.cc106 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_); in rfind()
/external/protobuf/src/google/protobuf/stubs/
Dstringpiece.cc129 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_); in rfind()
/external/llvm-project/clang/test/Analysis/Inputs/
Dsystem-header-simulator-cxx.h875 InputIt find_end(InputIt first, InputIt last,
879 ForwardIt1 find_end (ExecutionPolicy&& policy,
884 InputIt find_end (InputIt first, InputIt last,
890 ForwardIt1 find_end (ExecutionPolicy&& policy,
/external/libchrome/base/strings/
Dstring_piece.cc162 std::find_end(self.begin(), last, s.begin(), s.end()); in rfindT()
/external/llvm-project/pstl/include/pstl/internal/
Dglue_algorithm_defs.h70 find_end(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _ForwardIterator1 __last, _ForwardIt…
75 find_end(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _ForwardIterator1 __last, _ForwardIt…
Dglue_algorithm_impl.h111 find_end(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _ForwardIterator1 __last, _ForwardIt… in find_end() function
124 find_end(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _ForwardIterator1 __last, _ForwardIt… in find_end() function
127 … return std::find_end(std::forward<_ExecutionPolicy>(__exec), __first, __last, __s_first, __s_last, in find_end()
/external/libtextclassifier/abseil-cpp/absl/algorithm/
Dcontainer.h251 return std::find_end(container_algorithm_internal::c_begin(sequence),
262 return std::find_end(container_algorithm_internal::c_begin(sequence),

12