Searched refs:find_end (Results 1 - 12 of 12) sorted by relevance
/external/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/ |
H A D | find_end.pass.cpp | 15 // find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); 29 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1)) == Iter1(ia+sa-1)); 31 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2)) == Iter1(ia+18)); 33 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3)) == Iter1(ia+15)); 35 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4)) == Iter1(ia+11)); 37 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5)) == Iter1(ia+6)); 39 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6)) == Iter1(ia)); 41 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7)) == Iter1(ia+sa)); 42 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b)) == Iter1(ia+sa)); 43 assert(std::find_end(Iter [all...] |
H A D | Android.mk | 19 test_name := algorithms/alg.nonmodifying/alg.find.end/find_end 20 test_src := find_end.pass.cpp
|
H A D | find_end_pred.pass.cpp | 16 // find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred); 41 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-1)); 45 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)); 49 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)); 53 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)); 57 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6)); 61 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(g), Iter2(g+6), count_equal()) == Iter1(ia)); 65 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(h), Iter2(h+7), count_equal()) == Iter1(ia+sa)); 68 assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b), count_equal()) == Iter1(ia+sa)); 71 assert(std::find_end(Iter [all...] |
/external/chromium_org/third_party/re2/util/ |
H A D | stringpiece.cc | 66 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_);
|
/external/regex-re2/util/ |
H A D | stringpiece.cc | 66 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_);
|
/external/chromium_org/third_party/libphonenumber/src/phonenumbers/base/strings/ |
H A D | string_piece.cc | 69 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_);
|
/external/chromium_org/base/strings/ |
H A D | string_piece.cc | 157 std::find_end(self.begin(), last, s.begin(), s.end());
|
/external/stlport/stlport/stl/ |
H A D | _algobase.c | 361 // find_end, with and without an explicitly supplied comparison function. 363 // the *last* possible match. Note that find_end for bidirectional iterators 366 // find_end for forward iterators. 392 // find_end for bidirectional iterators. Requires partial specialization. 434 find_end(_ForwardIter1 __first1, _ForwardIter1 __last1, function
|
H A D | _algo.h | 154 find_end(_ForwardIter1 __first1, _ForwardIter1 __last1,
|
H A D | _algobase.h | 694 find_end(_ForwardIter1 __first1, _ForwardIter1 __last1,
|
H A D | _string.c | 462 const_pointer __result = _STLP_STD::find_end(this->_M_Start(), __last,
|
H A D | _algo.c | 273 find_end(_ForwardIter1 __first1, _ForwardIter1 __last1, function
|
Completed in 293 milliseconds