Gitiles
Code Review Sign In
gerrit-public.fairphone.software / platform / external / libcxx / c004fd909c006eec55077c52ee119e1fa338c9e9 / . / test / std / experimental / func / func.searchers / func.searchers.boyer_moore / hash.pred.pass.cpp
blob: 629a038663aadb3f6ccb191aacbbb7d5f173d5ac [file] [log] [blame]
Marshall Clowaf9a44f2015-09-08 17:59:09 +0000[diff] [blame]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>
Marshall Clowf6d6b512016-03-08 15:12:52 +0000[diff] [blame]24// pair<RandomAccessIterator2, RandomAccessIterator2>
Marshall Clowaf9a44f2015-09-08 17:59:09 +0000[diff] [blame]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 assert(result == std::experimental::search(b1, e1, s));
62}
63
64template <class Iter1, class Iter2>
65void
66test()
67{
68 int ia[] = {0, 1, 2, 3, 4, 5};
69 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
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);
72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa);
73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0);
74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa);
75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa);
76 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0);
77 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa);
78 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa);
79 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa);
80 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1), (sa-1)*sa);
81 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1), sa);
82 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};
83 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
84 int ic[] = {1};
85 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
86 int id[] = {1, 2};
87 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
88 int ie[] = {1, 2, 3};
89 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3);
90 int ig[] = {1, 2, 3, 4};
91 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
92 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};
93 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
94 int ii[] = {1, 1, 2};
95 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
96}
97
98template <class Iter1, class Iter2>
99void
100test2()
101{
102 char ia[] = {0, 1, 2, 3, 4, 5};
103 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
104 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
105 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa);
106 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa);
107 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0);
108 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa);
109 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa);
110 do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia), 0);
111 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa);
112 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa);
113 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa);
114 do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1), (sa-1)*sa);
115 do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1), sa);
116 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4};
117 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
118 char ic[] = {1};
119 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
120 char id[] = {1, 2};
121 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
122 char ie[] = {1, 2, 3};
123 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3);
124 char ig[] = {1, 2, 3, 4};
125 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
126 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4};
127 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
128 char ii[] = {1, 1, 2};
129 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
130}
131
132int main() {
133 test<random_access_iterator<const int*>, random_access_iterator<const int*> >();
134 test2<random_access_iterator<const char*>, random_access_iterator<const char*> >();
135}