/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
default.pass.cpp | 41 template <typename Iter1, typename Iter2> 42 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { 47 template <class Iter1, class Iter2> 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)) [all...] |
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
make_default_searcher.pass.cpp | 26 template <typename Iter1, typename Iter2> 27 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { 32 template <class Iter1, class Iter2> 38 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 39 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)) [all...] |
make_default_searcher.pred.pass.cpp | 36 template <typename Iter1, typename Iter2> 37 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { 44 template <class Iter1, class Iter2> 50 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 51 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa) [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/experimental/func/func.searchers/func.searchers.default/ |
default.pass.cpp | 41 template <typename Iter1, typename Iter2> 42 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { 47 template <class Iter1, class Iter2> 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)) [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
make_default_searcher.pass.cpp | 26 template <typename Iter1, typename Iter2> 27 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { 32 template <class Iter1, class Iter2> 38 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 39 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)) [all...] |
make_default_searcher.pred.pass.cpp | 36 template <typename Iter1, typename Iter2> 37 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { 44 template <class Iter1, class Iter2> 50 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 51 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa) [all...] |
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
default.pass.cpp | 41 template <typename Iter1, typename Iter2> 42 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { 47 template <class Iter1, class Iter2> 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)) [all...] |
hash.pass.cpp | 45 template <typename Iter1, typename Iter2> 46 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned /*max_count*/) { 53 template <class Iter1, class Iter2> 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa) [all...] |
hash.pred.pass.cpp | 55 template <typename Iter1, typename Iter2> 56 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { 66 template <class Iter1, class Iter2> 72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa) [all...] |
pred.pass.cpp | 51 template <typename Iter1, typename Iter2> 52 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { 60 template <class Iter1, class Iter2> 66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa) [all...] |
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
default.pass.cpp | 41 template <typename Iter1, typename Iter2> 42 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { 47 template <class Iter1, class Iter2> 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)) [all...] |
hash.pass.cpp | 44 template <typename Iter1, typename Iter2> 45 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned /*max_count*/) { 52 template <class Iter1, class Iter2> 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa) [all...] |
hash.pred.pass.cpp | 54 template <typename Iter1, typename Iter2> 55 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { 65 template <class Iter1, class Iter2> 71 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa) [all...] |
pred.pass.cpp | 50 template <typename Iter1, typename Iter2> 51 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { 59 template <class Iter1, class Iter2> 65 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa) [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
default.pass.cpp | 41 template <typename Iter1, typename Iter2> 42 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { 47 template <class Iter1, class Iter2> 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)) [all...] |
hash.pass.cpp | 45 template <typename Iter1, typename Iter2> 46 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { 53 template <class Iter1, class Iter2> 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa) [all...] |
hash.pred.pass.cpp | 55 template <typename Iter1, typename Iter2> 56 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { 64 template <class Iter1, class Iter2> 70 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 71 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa) [all...] |
pred.pass.cpp | 51 template <typename Iter1, typename Iter2> 52 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { 60 template <class Iter1, class Iter2> 66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa) [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
default.pass.cpp | 41 template <typename Iter1, typename Iter2> 42 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { 47 template <class Iter1, class Iter2> 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)) [all...] |
hash.pass.cpp | 44 template <typename Iter1, typename Iter2> 45 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { 52 template <class Iter1, class Iter2> 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa) [all...] |
hash.pred.pass.cpp | 54 template <typename Iter1, typename Iter2> 55 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { 63 template <class Iter1, class Iter2> 69 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 70 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa) [all...] |
pred.pass.cpp | 50 template <typename Iter1, typename Iter2> 51 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { 59 template <class Iter1, class Iter2> 65 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); 66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa) [all...] |
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
search.pass.cpp | 12 // template<ForwardIterator Iter1, ForwardIterator Iter2> 13 // requires HasEqualTo<Iter1::value_type, Iter2::value_type> 14 // Iter1 15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); 22 template <class Iter1, class Iter2> 28 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia)); 29 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia)) [all...] |
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
search.pass.cpp | 12 // template<ForwardIterator Iter1, ForwardIterator Iter2> 13 // requires HasEqualTo<Iter1::value_type, Iter2::value_type> 14 // Iter1 15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); 22 template <class Iter1, class Iter2> 28 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia)); 29 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia)) [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.search/ |
search.pass.cpp | 12 // template<ForwardIterator Iter1, ForwardIterator Iter2> 13 // requires HasEqualTo<Iter1::value_type, Iter2::value_type> 14 // Iter1 15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2); 22 template <class Iter1, class Iter2> 28 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia)); 29 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia)) [all...] |