126 lines · cpp
1//===----------------------------------------------------------------------===//2//3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.4// See https://llvm.org/LICENSE.txt for license information.5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception6//7//===----------------------------------------------------------------------===//8 9// UNSUPPORTED: c++03, c++11, c++1410 11// <functional>12 13// boyer_moore_horspool searcher14// template<class RandomAccessIterator1,15// class Hash = hash<typename iterator_traits<RandomAccessIterator1>::value_type>,16// class BinaryPredicate = equal_to<>>17// class boyer_moore_horspool_searcher {18// public:19// boyer_moore_horspool_searcher(RandomAccessIterator1 pat_first, RandomAccessIterator1 pat_last,20// Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate());21//22// template<class RandomAccessIterator2>23// pair<RandomAccessIterator2, RandomAccessIterator2>24// operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const;25//26// private:27// RandomAccessIterator1 pat_first_; // exposition only28// RandomAccessIterator1 pat_last_; // exposition only29// Hash hash_; // exposition only30// BinaryPredicate pred_; // exposition only31// };32 33#include <algorithm>34#include <cassert>35#include <cstddef>36#include <functional>37 38#include "test_iterators.h"39 40template <typename T> struct MyHash {41 std::size_t operator () (T t) const { return static_cast<size_t>(t); }42};43 44template <typename Iter1, typename Iter2>45void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned /*max_count*/) {46 std::boyer_moore_horspool_searcher<Iter2,47 MyHash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>>48 s{b2, e2};49 assert(result == std::search(b1, e1, s));50}51 52template <class Iter1, class Iter2>53void54test()55{56 int ia[] = {0, 1, 2, 3, 4, 5};57 const unsigned sa = sizeof(ia)/sizeof(ia[0]);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);60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa);61 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0);62 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa);63 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa);64 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0);65 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa);66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa);67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa);68 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1), (sa-1)*sa);69 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1), sa);70 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};71 const unsigned sb = sizeof(ib)/sizeof(ib[0]);72 int ic[] = {1};73 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);74 int id[] = {1, 2};75 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);76 int ie[] = {1, 2, 3};77 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3);78 int ig[] = {1, 2, 3, 4};79 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);80 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};81 const unsigned sh = sizeof(ih)/sizeof(ih[0]);82 int ii[] = {1, 1, 2};83 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);84}85 86template <class Iter1, class Iter2>87void88test2()89{90 char ia[] = {0, 1, 2, 3, 4, 5};91 const unsigned sa = sizeof(ia)/sizeof(ia[0]);92 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);93 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa);94 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa);95 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0);96 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa);97 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa);98 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0);99 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa);100 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa);101 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa);102 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1), (sa-1)*sa);103 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1), sa);104 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};105 const unsigned sb = sizeof(ib)/sizeof(ib[0]);106 char ic[] = {1};107 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);108 char id[] = {1, 2};109 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);110 char ie[] = {1, 2, 3};111 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3);112 char ig[] = {1, 2, 3, 4};113 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);114 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};115 const unsigned sh = sizeof(ih)/sizeof(ih[0]);116 char ii[] = {1, 1, 2};117 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);118}119 120int main(int, char**) {121 test<random_access_iterator<const int*>, random_access_iterator<const int*> >();122 test2<random_access_iterator<const char*>, random_access_iterator<const char*> >();123 124 return 0;125}126