summaryrefslogtreecommitdiff
path: root/test/std/utilities/function.objects/func.search/func.search.bmh/default.pass.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'test/std/utilities/function.objects/func.search/func.search.bmh/default.pass.cpp')
-rw-r--r--test/std/utilities/function.objects/func.search/func.search.bmh/default.pass.cpp129
1 files changed, 0 insertions, 129 deletions
diff --git a/test/std/utilities/function.objects/func.search/func.search.bmh/default.pass.cpp b/test/std/utilities/function.objects/func.search/func.search.bmh/default.pass.cpp
deleted file mode 100644
index ec65a4b9b69fb..0000000000000
--- a/test/std/utilities/function.objects/func.search/func.search.bmh/default.pass.cpp
+++ /dev/null
@@ -1,129 +0,0 @@
-//===----------------------------------------------------------------------===//
-//
-// The LLVM Compiler Infrastructure
-//
-// This file is dual licensed under the MIT and the University of Illinois Open
-// Source Licenses. See LICENSE.TXT for details.
-//
-//===----------------------------------------------------------------------===//
-
-// UNSUPPORTED: c++98, c++03, c++11, c++14
-// XFAIL: c++17, c++2a
-
-// <functional>
-
-// boyer_moore_horspool searcher
-// template<class RandomAccessIterator1,
-// class Hash = hash<typename iterator_traits<RandomAccessIterator1>::value_type>,
-// class BinaryPredicate = equal_to<>>
-// class boyer_moore_horspool_searcher {
-// public:
-// boyer_moore_horspool_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
-// };
-
-
-#include <algorithm>
-#include <functional>
-#include <cassert>
-
-#include "test_iterators.h"
-
-template <typename Iter1, typename Iter2>
-void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result) {
- std::boyer_moore_horspool_searcher<Iter2> 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));
- do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia));
- do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1));
- do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia));
- do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));
- do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));
- do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia));
- do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1));
- do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3));
- do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia));
- do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1));
- do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1));
- 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));
- int id[] = {1, 2};
- do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
- int ie[] = {1, 2, 3};
- do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4));
- int ig[] = {1, 2, 3, 4};
- do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
- 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));
- int ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0};
- const unsigned sj = sizeof(ij)/sizeof(ij[0]);
- int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0};
- const unsigned sk = sizeof(ik)/sizeof(ik[0]);
- do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6));
-}
-
-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));
- do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia));
- do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1));
- do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia));
- do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));
- do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2));
- do_search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), Iter1(ia));
- do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1));
- do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3));
- do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia));
- do_search(Iter1(ia), Iter1(ia+sa-1), Iter2(ia), Iter2(ia+sa), Iter1(ia+sa-1));
- do_search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), Iter1(ia+1));
- 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));
- char id[] = {1, 2};
- do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
- char ie[] = {1, 2, 3};
- do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4));
- char ig[] = {1, 2, 3, 4};
- do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
- 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));
- char ij[] = {0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0};
- const unsigned sj = sizeof(ij)/sizeof(ij[0]);
- char ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0};
- const unsigned sk = sizeof(ik)/sizeof(ik[0]);
- do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6));
-}
-
-int main() {
- test<random_access_iterator<const int*>, random_access_iterator<const int*> >();
- test2<random_access_iterator<const char*>, random_access_iterator<const char*> >();
-}
generated by cgit v1.2.3 (git 2.25.1) at 2025-11-02 23:22:45 +0000