adjacent_find.pass.cpp
3.99 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
// -*- C++ -*-
//===-- adjacent_find.pass.cpp --------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: c++98, c++03, c++11, c++14
#include "support/pstl_test_config.h"
#include <execution>
#include <algorithm>
#include "support/utils.h"
using namespace TestUtils;
struct test_adjacent_find
{
template <typename Policy, typename Iterator, typename Pred>
void
operator()(Policy&& exec, Iterator first, Iterator last, Pred pred)
{
using namespace std;
auto k = std::adjacent_find(first, last, pred);
auto i = adjacent_find(exec, first, last, pred);
EXPECT_TRUE(i == k, "wrong return value from adjacent_find with predicate");
i = adjacent_find(exec, first, last);
EXPECT_TRUE(i == k, "wrong return value from adjacent_find without predicate");
}
};
template <typename T>
void
test_adjacent_find_by_type()
{
size_t counts[] = {2, 3, 500};
for (size_t c = 0; c < const_size(counts); ++c)
{
for (size_t e = 0; e < (counts[c] >= 64 ? 64 : (counts[c] == 2 ? 1 : 2)); ++e)
{
Sequence<T> in(counts[c], [](size_t v) -> T { return T(v); }); //fill 0...n
in[e] = in[e + 1] = -1; //make an adjacent pair
auto i = std::adjacent_find(in.cbegin(), in.cend(), std::equal_to<T>());
EXPECT_TRUE(i == in.cbegin() + e, "std::adjacent_find returned wrong result");
invoke_on_all_policies(test_adjacent_find(), in.begin(), in.end(), std::equal_to<T>());
invoke_on_all_policies(test_adjacent_find(), in.cbegin(), in.cend(), std::equal_to<T>());
}
}
//special cases: size=0, size=1;
for (size_t expect = 0; expect < 1; ++expect)
{
Sequence<T> in(expect, [](size_t v) -> T { return T(v); }); //fill 0...n
auto i = std::adjacent_find(in.cbegin(), in.cend(), std::equal_to<T>());
EXPECT_TRUE(i == in.cbegin() + expect, "std::adjacent_find returned wrong result");
invoke_on_all_policies(test_adjacent_find(), in.begin(), in.end(), std::equal_to<T>());
invoke_on_all_policies(test_adjacent_find(), in.cbegin(), in.cend(), std::equal_to<T>());
}
//special cases:
Sequence<T> a1 = {5, 5, 5, 6, 7, 8, 9};
invoke_on_all_policies(test_adjacent_find(), a1.begin(), a1.end(), std::equal_to<T>());
invoke_on_all_policies(test_adjacent_find(), a1.begin() + 1, a1.end(), std::equal_to<T>());
invoke_on_all_policies(test_adjacent_find(), a1.cbegin(), a1.cend(), std::equal_to<T>());
invoke_on_all_policies(test_adjacent_find(), a1.cbegin() + 1, a1.cend(), std::equal_to<T>());
Sequence<T> a2 = {5, 6, 7, 8, 9, 9};
invoke_on_all_policies(test_adjacent_find(), a2.begin(), a2.end(), std::equal_to<T>());
invoke_on_all_policies(test_adjacent_find(), a2.begin(), a2.end() - 1, std::equal_to<T>());
invoke_on_all_policies(test_adjacent_find(), a2.cbegin(), a2.cend(), std::equal_to<T>());
invoke_on_all_policies(test_adjacent_find(), a2.cbegin(), a2.cend() - 1, std::equal_to<T>());
Sequence<T> a3 = {5, 6, 6, 6, 7, 9, 9, 9, 9};
invoke_on_all_policies(test_adjacent_find(), a3.begin(), a3.end(), std::equal_to<T>());
invoke_on_all_policies(test_adjacent_find(), a3.cbegin(), a3.cend(), std::equal_to<T>());
}
template <typename T>
struct test_non_const
{
template <typename Policy, typename Iterator>
void
operator()(Policy&& exec, Iterator iter)
{
adjacent_find(exec, iter, iter, non_const(std::equal_to<T>()));
}
};
int
main()
{
test_adjacent_find_by_type<int32_t>();
test_adjacent_find_by_type<float64_t>();
test_algo_basic_single<int32_t>(run_for_rnd_bi<test_non_const<int32_t>>());
std::cout << done() << std::endl;
return 0;
}