Home
last modified time | relevance | path

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

/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/
Dfind_end.pass.cpp29 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1)) == Iter1(ia+sa-1)); in test()
31 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2)) == Iter1(ia+18)); in test()
33 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3)) == Iter1(ia+15)); in test()
35 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4)) == Iter1(ia+11)); in test()
37 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5)) == Iter1(ia+6)); in test()
39 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6)) == Iter1(ia)); in test()
41 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7)) == Iter1(ia+sa)); in test()
42 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b)) == Iter1(ia+sa)); in test()
43 assert(std::find_end(Iter1(ia), Iter1(ia), Iter2(b), Iter2(b+1)) == Iter1(ia)); in test()
Dfind_end_pred.pass.cpp41 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-… in test()
45 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)… in test()
49 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)… in test()
53 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)… in test()
57 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6)); in test()
61 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6), count_equal()) == Iter1(ia)); in test()
65 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7), count_equal()) == Iter1(ia+sa)… in test()
68 … assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b), count_equal()) == Iter1(ia+sa)); in test()
71 assert(std::find_end(Iter1(ia), Iter1(ia), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia)); in test()
/ndk/sources/host-tools/make-3.81/
Dcommands.c292 find_end:; in chop_commands()
305 goto find_end; in chop_commands()
/ndk/sources/cxx-stl/stlport/stlport/stl/
D_algobase.c434 find_end(_ForwardIter1 __first1, _ForwardIter1 __last1,
D_algobase.h694 find_end(_ForwardIter1 __first1, _ForwardIter1 __last1,
D_algo.h154 find_end(_ForwardIter1 __first1, _ForwardIter1 __last1,
D_string.c462 const_pointer __result = _STLP_STD::find_end(this->_M_Start(), __last, in rfind()
D_algo.c273 find_end(_ForwardIter1 __first1, _ForwardIter1 __last1, in find_end() function
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
Dalgorithm52 find_end(ForwardIterator1 first1, ForwardIterator1 last1,
57 find_end(ForwardIterator1 first1, ForwardIterator1 last1,
894 // find_end
1021 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1033 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1038 return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>());
Dstring1057 const _CharT* __r = _VSTD::find_end(__p, __p + __pos, __s, __s + __n, _Traits::eq);
/ndk/tests/device/test-libc++-shared-full/jni/
DAndroid.mk198 $(call gen-test, algorithms/alg.nonmodifying/alg.find.end/find_end)
/ndk/tests/device/test-libc++-static-full/jni/
DAndroid.mk189 $(call gen-test, algorithms/alg.nonmodifying/alg.find.end/find_end)