1//===----------------------------------------------------------------------===//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file is dual licensed under the MIT and the University of Illinois Open
6// Source Licenses. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
10// UNSUPPORTED: c++98, c++03, c++11
11
12// <functional>
13
14// boyer_moore searcher
15// template<class RandomAccessIterator1,
16//          class Hash = hash<typename iterator_traits<RandomAccessIterator1>::value_type>,
17//          class BinaryPredicate = equal_to<>>
18// class boyer_moore_searcher {
19// public:
20//   boyer_moore_searcher(RandomAccessIterator1 pat_first, RandomAccessIterator1 pat_last,
21//                        Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate());
22//
23//   template<class RandomAccessIterator2>
24//   pair<RandomAccessIterator2, RandomAccessIterator2>
25//   operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const;
26//
27// private:
28//   RandomAccessIterator1 pat_first_; // exposition only
29//   RandomAccessIterator1 pat_last_;  // exposition only
30//   Hash                  hash_;      // exposition only
31//   BinaryPredicate       pred_;      // exposition only
32// };
33
34
35#include <experimental/algorithm>
36#include <experimental/functional>
37#include <cassert>
38
39#include "test_iterators.h"
40
41template <typename T> struct MyHash {
42    size_t operator () (T t) const { return static_cast<size_t>(t); }
43};
44
45struct count_equal
46{
47    static unsigned count;
48    template <class T>
49    bool operator()(const T& x, const T& y) const
50        {++count; return x == y;}
51};
52
53unsigned count_equal::count = 0;
54
55template <typename Iter1, typename Iter2>
56void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) {
57    std::experimental::boyer_moore_searcher<Iter2,
58                 MyHash<typename std::remove_cv<typename std::iterator_traits<Iter2>::value_type>::type>,
59                 count_equal>
60          s{b2, e2};
61    count_equal::count = 0;
62    assert(result == std::experimental::search(b1, e1, s));
63    assert(count_equal::count <= max_count);
64}
65
66template <class Iter1, class Iter2>
67void
68test()
69{
70    int ia[] = {0, 1, 2, 3, 4, 5};
71    const unsigned sa = sizeof(ia)/sizeof(ia[0]);
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);
74    do_search(Iter1(ia), Iter1(ia+sa),   Iter2(ia+1),    Iter2(ia+2),  Iter1(ia+1),    sa);
75    do_search(Iter1(ia), Iter1(ia+sa),   Iter2(ia+2),    Iter2(ia+2),  Iter1(ia),      0);
76    do_search(Iter1(ia), Iter1(ia+sa),   Iter2(ia+2),    Iter2(ia+3),  Iter1(ia+2),    sa);
77    do_search(Iter1(ia), Iter1(ia+sa),   Iter2(ia+2),    Iter2(ia+3),  Iter1(ia+2),    sa);
78    do_search(Iter1(ia), Iter1(ia),      Iter2(ia+2),    Iter2(ia+3),  Iter1(ia),      0);
79    do_search(Iter1(ia), Iter1(ia+sa),   Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa);
80    do_search(Iter1(ia), Iter1(ia+sa),   Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa);
81    do_search(Iter1(ia), Iter1(ia+sa),   Iter2(ia),      Iter2(ia+sa), Iter1(ia),      sa*sa);
82    do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia),      Iter2(ia+sa), Iter1(ia+sa-1), (sa-1)*sa);
83
84    do_search(Iter1(ia), Iter1(ia+1),    Iter2(ia),      Iter2(ia+sa), Iter1(ia+1),     sa);
85
86    int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};
87    const unsigned sb = sizeof(ib)/sizeof(ib[0]);
88    int ic[] = {1};
89    do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
90    int id[] = {1, 2};
91    do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
92    int ie[] = {1, 2, 3};
93    do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3);
94    int ig[] = {1, 2, 3, 4};
95    do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
96    int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};
97    const unsigned sh = sizeof(ih)/sizeof(ih[0]);
98    int ii[] = {1, 1, 2};
99    do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3),  sh*3);
100
101}
102
103template <class Iter1, class Iter2>
104void
105test2()
106{
107    char ia[] = {0, 1, 2, 3, 4, 5};
108    const unsigned sa = sizeof(ia)/sizeof(ia[0]);
109    do_search(Iter1(ia), Iter1(ia+sa),   Iter2(ia),      Iter2(ia),    Iter1(ia),      0);
110    do_search(Iter1(ia), Iter1(ia+sa),   Iter2(ia),      Iter2(ia+1),  Iter1(ia),      sa);
111    do_search(Iter1(ia), Iter1(ia+sa),   Iter2(ia+1),    Iter2(ia+2),  Iter1(ia+1),    sa);
112    do_search(Iter1(ia), Iter1(ia+sa),   Iter2(ia+2),    Iter2(ia+2),  Iter1(ia),      0);
113    do_search(Iter1(ia), Iter1(ia+sa),   Iter2(ia+2),    Iter2(ia+3),  Iter1(ia+2),    sa);
114    do_search(Iter1(ia), Iter1(ia+sa),   Iter2(ia+2),    Iter2(ia+3),  Iter1(ia+2),    sa);
115    do_search(Iter1(ia), Iter1(ia),      Iter2(ia+2),    Iter2(ia+3),  Iter1(ia),      0);
116    do_search(Iter1(ia), Iter1(ia+sa),   Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa);
117    do_search(Iter1(ia), Iter1(ia+sa),   Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa);
118    do_search(Iter1(ia), Iter1(ia+sa),   Iter2(ia),      Iter2(ia+sa), Iter1(ia),      sa*sa);
119    do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia),      Iter2(ia+sa), Iter1(ia+sa-1), (sa-1)*sa);
120
121    do_search(Iter1(ia), Iter1(ia+1),    Iter2(ia),      Iter2(ia+sa), Iter1(ia+1),    sa);
122
123    char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};
124    const unsigned sb = sizeof(ib)/sizeof(ib[0]);
125    char ic[] = {1};
126    do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
127    char id[] = {1, 2};
128    do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
129    char ie[] = {1, 2, 3};
130    do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3);
131    char ig[] = {1, 2, 3, 4};
132    do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
133    char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};
134    const unsigned sh = sizeof(ih)/sizeof(ih[0]);
135    char ii[] = {1, 1, 2};
136    do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3),  sh*3);
137}
138
139int main() {
140    test<random_access_iterator<const int*>, random_access_iterator<const int*> >();
141    test2<random_access_iterator<const char*>, random_access_iterator<const char*> >();
142}
143