/external/llvm-project/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
D | default.pass.cpp | 41 template <typename Iter1, typename Iter2> 42 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { in do_search() 43 std::experimental::boyer_moore_searcher<Iter2> s{b2, e2}; in do_search() 47 template <class Iter1, class Iter2> 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); in test() 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); in test() 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); in test() 56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); in test() 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test() 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test() [all …]
|
D | 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*/) { in do_search() 47 std::experimental::boyer_moore_searcher<Iter2, in do_search() 48 … MyHash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>> in do_search() 53 template <class Iter1, class Iter2> 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test() 60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test() 61 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test() 62 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test() 63 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test() [all …]
|
D | 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) { in do_search() 57 std::experimental::boyer_moore_searcher<Iter2, in do_search() 58 … MyHash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>, in do_search() 66 template <class Iter1, class Iter2> 72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test() 73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test() 74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test() 75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test() 76 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test() [all …]
|
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
D | default.pass.cpp | 41 template <typename Iter1, typename Iter2> 42 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { in do_search() 43 std::experimental::boyer_moore_searcher<Iter2> s{b2, e2}; in do_search() 47 template <class Iter1, class Iter2> 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); in test() 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); in test() 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); in test() 56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); in test() 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test() 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test() [all …]
|
D | 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) { in do_search() 53 std::experimental::boyer_moore_searcher<Iter2, in do_search() 54 …typename std::hash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type… in do_search() 60 template <class Iter1, class Iter2> 66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test() 67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test() 68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test() 69 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test() 70 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test() [all …]
|
/external/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
D | default.pass.cpp | 42 template <typename Iter1, typename Iter2> 43 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { in do_search() 44 std::boyer_moore_horspool_searcher<Iter2> s{b2, e2}; in do_search() 48 template <class Iter1, class Iter2> 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); in test() 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); in test() 56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); in test() 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); in test() 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test() 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test() [all …]
|
D | 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) { in do_search() 57 std::boyer_moore_horspool_searcher<Iter2, in do_search() 58 … MyHash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>, in do_search() 66 template <class Iter1, class Iter2> 72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test() 73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test() 74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test() 75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test() 76 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test() [all …]
|
D | 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*/) { in do_search() 47 std::boyer_moore_horspool_searcher<Iter2, in do_search() 48 … MyHash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>> in do_search() 53 template <class Iter1, class Iter2> 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test() 60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test() 61 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test() 62 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test() 63 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test() [all …]
|
/external/llvm-project/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
D | default.pass.cpp | 42 template <typename Iter1, typename Iter2> 43 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { in do_search() 44 std::boyer_moore_searcher<Iter2> s{b2, e2}; in do_search() 48 template <class Iter1, class Iter2> 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); in test() 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); in test() 56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); in test() 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); in test() 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test() 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test() [all …]
|
D | hash.pred.pass.cpp | 56 template <typename Iter1, typename Iter2> 57 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { in do_search() 58 std::boyer_moore_searcher<Iter2, in do_search() 59 … MyHash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>, in do_search() 67 template <class Iter1, class Iter2> 73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test() 74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test() 75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test() 76 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test() 77 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test() [all …]
|
D | pred.pass.cpp | 52 template <typename Iter1, typename Iter2> 53 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { in do_search() 54 std::boyer_moore_searcher<Iter2, in do_search() 55 …typename std::hash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type… in do_search() 61 template <class Iter1, class Iter2> 67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test() 68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test() 69 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test() 70 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test() 71 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test() [all …]
|
/external/llvm-project/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
D | default.pass.cpp | 41 template <typename Iter1, typename Iter2> 42 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { in do_search() 43 std::experimental::boyer_moore_horspool_searcher<Iter2> s{b2, e2}; in do_search() 47 template <class Iter1, class Iter2> 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); in test() 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); in test() 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); in test() 56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); in test() 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test() 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test() [all …]
|
D | 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) { in do_search() 56 std::experimental::boyer_moore_horspool_searcher<Iter2, in do_search() 57 … MyHash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>, in do_search() 65 template <class Iter1, class Iter2> 71 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test() 72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test() 73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test() 74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test() 75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test() [all …]
|
D | 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) { in do_search() 52 std::experimental::boyer_moore_horspool_searcher<Iter2, in do_search() 53 …typename std::hash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type… in do_search() 59 template <class Iter1, class Iter2> 65 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test() 66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test() 67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test() 68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test() 69 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test() [all …]
|
/external/llvm-project/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
D | default.pass.cpp | 42 template <typename Iter1, typename Iter2> 43 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { in do_search() 44 std::boyer_moore_horspool_searcher<Iter2> s{b2, e2}; in do_search() 48 template <class Iter1, class Iter2> 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); in test() 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); in test() 56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); in test() 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); in test() 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test() 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test() [all …]
|
D | 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) { in do_search() 57 std::boyer_moore_horspool_searcher<Iter2, in do_search() 58 … MyHash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>, in do_search() 66 template <class Iter1, class Iter2> 72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test() 73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test() 74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test() 75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test() 76 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test() [all …]
|
D | 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*/) { in do_search() 47 std::boyer_moore_horspool_searcher<Iter2, in do_search() 48 … MyHash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>> in do_search() 53 template <class Iter1, class Iter2> 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test() 60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test() 61 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test() 62 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test() 63 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test() [all …]
|
D | 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) { in do_search() 53 std::boyer_moore_horspool_searcher<Iter2, in do_search() 54 …typename std::hash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type… in do_search() 60 template <class Iter1, class Iter2> 66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test() 67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test() 68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test() 69 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test() 70 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test() [all …]
|
/external/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
D | default.pass.cpp | 42 template <typename Iter1, typename Iter2> 43 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { in do_search() 44 std::boyer_moore_searcher<Iter2> s{b2, e2}; in do_search() 48 template <class Iter1, class Iter2> 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); in test() 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); in test() 56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); in test() 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); in test() 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test() 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test() [all …]
|
D | pred.pass.cpp | 52 template <typename Iter1, typename Iter2> 53 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { in do_search() 54 std::boyer_moore_searcher<Iter2, in do_search() 55 …typename std::hash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type… in do_search() 61 template <class Iter1, class Iter2> 67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test() 68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test() 69 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test() 70 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test() 71 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test() [all …]
|
D | hash.pred.pass.cpp | 56 template <typename Iter1, typename Iter2> 57 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { in do_search() 58 std::boyer_moore_searcher<Iter2, in do_search() 59 … MyHash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>, in do_search() 67 template <class Iter1, class Iter2> 73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test() 74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test() 75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test() 76 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test() 77 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test() [all …]
|
D | hash.pass.cpp | 46 template <typename Iter1, typename Iter2> 47 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned /*max_count*/) { in do_search() 48 std::boyer_moore_searcher<Iter2, in do_search() 49 … MyHash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>> in do_search() 54 template <class Iter1, class Iter2> 60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test() 61 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test() 62 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test() 63 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test() 64 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test() [all …]
|
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
D | default.pass.cpp | 41 template <typename Iter1, typename Iter2> 42 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) { in do_search() 43 std::experimental::boyer_moore_horspool_searcher<Iter2> s{b2, e2}; in do_search() 47 template <class Iter1, class Iter2> 53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); in test() 54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); in test() 55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); in test() 56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); in test() 57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test() 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test() [all …]
|
D | 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*/) { in do_search() 46 std::experimental::boyer_moore_horspool_searcher<Iter2, in do_search() 47 … MyHash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>> in do_search() 52 template <class Iter1, class Iter2> 58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test() 59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test() 60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test() 61 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test() 62 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test() [all …]
|
D | 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) { in do_search() 56 std::experimental::boyer_moore_horspool_searcher<Iter2, in do_search() 57 … MyHash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>, in do_search() 65 template <class Iter1, class Iter2> 71 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test() 72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test() 73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test() 74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test() 75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test() [all …]
|