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 // <algorithm>
11
12 // template<class ForwardIterator, class Size, class T>
13 // constexpr ForwardIterator // constexpr after C++17
14 // search_n(ForwardIterator first, ForwardIterator last, Size count,
15 // const T& value);
16
17 #include <algorithm>
18 #include <cassert>
19
20 #include "test_macros.h"
21 #include "test_iterators.h"
22 #include "user_defined_integral.hpp"
23
24 #if TEST_STD_VER > 17
test_constexpr()25 TEST_CONSTEXPR bool test_constexpr() {
26 int ia[] = {0, 0, 1, 1, 2, 2};
27 return (std::search_n(std::begin(ia), std::end(ia), 1, 0) == ia)
28 && (std::search_n(std::begin(ia), std::end(ia), 2, 1) == ia+2)
29 && (std::search_n(std::begin(ia), std::end(ia), 1, 3) == std::end(ia))
30 ;
31 }
32 #endif
33
34 template <class Iter>
35 void
test()36 test()
37 {
38 int ia[] = {0, 1, 2, 3, 4, 5};
39 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
40 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia));
41 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0));
42 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa));
43 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0) == Iter(ia+sa));
44 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3) == Iter(ia));
45 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3) == Iter(ia+3));
46 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3) == Iter(ia+sa));
47 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3) == Iter(ia+sa));
48 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5) == Iter(ia));
49 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 5) == Iter(ia+5));
50 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 5) == Iter(ia+sa));
51 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 5) == Iter(ia+sa));
52
53 int ib[] = {0, 0, 1, 1, 2, 2};
54 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
55 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0) == Iter(ib));
56 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0) == Iter(ib+0));
57 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0) == Iter(ib+0));
58 assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 0) == Iter(ib+sb));
59 assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 0) == Iter(ib+sb));
60 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 1) == Iter(ib));
61 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 1) == Iter(ib+2));
62 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 1) == Iter(ib+2));
63 assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 1) == Iter(ib+sb));
64 assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 1) == Iter(ib+sb));
65 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 2) == Iter(ib));
66 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 2) == Iter(ib+4));
67 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 2) == Iter(ib+4));
68 assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 2) == Iter(ib+sb));
69 assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 2) == Iter(ib+sb));
70
71 int ic[] = {0, 0, 0};
72 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
73 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0) == Iter(ic));
74 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0) == Iter(ic));
75 assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0) == Iter(ic));
76 assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0) == Iter(ic));
77 assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0) == Iter(ic+sc));
78
79 // Check that we properly convert the size argument to an integral.
80 (void)std::search_n(Iter(ic), Iter(ic+sc), UserDefinedIntegral<unsigned>(0), 0);
81 }
82
main()83 int main()
84 {
85 test<forward_iterator<const int*> >();
86 test<bidirectional_iterator<const int*> >();
87 test<random_access_iterator<const int*> >();
88
89 #if TEST_STD_VER > 17
90 static_assert(test_constexpr());
91 #endif
92 }
93