thrust / dependencies /libcudacxx /libcxx /test /std /utilities /function.objects /func.search /func.search.bm /hash.pass.cpp
| //===----------------------------------------------------------------------===// | |
| // | |
| // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. | |
| // See https://llvm.org/LICENSE.txt for license information. | |
| // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception | |
| // | |
| //===----------------------------------------------------------------------===// | |
| // UNSUPPORTED: c++98, c++03, c++11, c++14 | |
| // XFAIL: c++17, c++2a, c++20 | |
| // <functional> | |
| // boyer_moore searcher | |
| // template<class RandomAccessIterator1, | |
| // class Hash = hash<typename iterator_traits<RandomAccessIterator1>::value_type>, | |
| // class BinaryPredicate = equal_to<>> | |
| // class boyer_moore_searcher { | |
| // public: | |
| // boyer_moore_searcher(RandomAccessIterator1 pat_first, RandomAccessIterator1 pat_last, | |
| // Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate()); | |
| // | |
| // template<class RandomAccessIterator2> | |
| // pair<RandomAccessIterator2, RandomAccessIterator2> | |
| // operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const; | |
| // | |
| // private: | |
| // RandomAccessIterator1 pat_first_; // exposition only | |
| // RandomAccessIterator1 pat_last_; // exposition only | |
| // Hash hash_; // exposition only | |
| // BinaryPredicate pred_; // exposition only | |
| // }; | |
| template <typename T> struct MyHash { | |
| size_t operator () (T t) const { return static_cast<size_t>(t); } | |
| }; | |
| template <typename Iter1, typename Iter2> | |
| void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned /*max_count*/) { | |
| std::boyer_moore_searcher<Iter2, | |
| MyHash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>> | |
| s{b2, e2}; | |
| assert(result == std::search(b1, e1, s)); | |
| } | |
| template <class Iter1, class Iter2> | |
| void | |
| test() | |
| { | |
| int ia[] = {0, 1, 2, 3, 4, 5}; | |
| const unsigned sa = sizeof(ia)/sizeof(ia[0]); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); | |
| do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); | |
| do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1), (sa-1)*sa); | |
| do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1), sa); | |
| int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; | |
| const unsigned sb = sizeof(ib)/sizeof(ib[0]); | |
| int ic[] = {1}; | |
| do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); | |
| int id[] = {1, 2}; | |
| do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); | |
| int ie[] = {1, 2, 3}; | |
| do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); | |
| int ig[] = {1, 2, 3, 4}; | |
| do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); | |
| int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; | |
| const unsigned sh = sizeof(ih)/sizeof(ih[0]); | |
| int ii[] = {1, 1, 2}; | |
| do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); | |
| } | |
| template <class Iter1, class Iter2> | |
| void | |
| test2() | |
| { | |
| char ia[] = {0, 1, 2, 3, 4, 5}; | |
| const unsigned sa = sizeof(ia)/sizeof(ia[0]); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); | |
| do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); | |
| do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); | |
| do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1), (sa-1)*sa); | |
| do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1), sa); | |
| char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; | |
| const unsigned sb = sizeof(ib)/sizeof(ib[0]); | |
| char ic[] = {1}; | |
| do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb); | |
| char id[] = {1, 2}; | |
| do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2); | |
| char ie[] = {1, 2, 3}; | |
| do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3); | |
| char ig[] = {1, 2, 3, 4}; | |
| do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4); | |
| char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; | |
| const unsigned sh = sizeof(ih)/sizeof(ih[0]); | |
| char ii[] = {1, 1, 2}; | |
| do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3); | |
| } | |
| int main(int, char**) { | |
| test<random_access_iterator<const int*>, random_access_iterator<const int*> >(); | |
| test2<random_access_iterator<const char*>, random_access_iterator<const char*> >(); | |
| return 0; | |
| } | |