1//===----------------------------------------------------------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9// UNSUPPORTED: c++03, c++11, c++14
10
11// UNSUPPORTED: libcpp-has-no-incomplete-pstl
12
13// <algorithm>
14
15// template<class ExecutionPolicy, class ForwardIterator, class T>
16// ForwardIterator find(ExecutionPolicy&& exec, ForwardIterator first, ForwardIterator last,
17// const T& value);
18
19#include <algorithm>
20#include <cassert>
21#include <vector>
22
23#include "test_macros.h"
24#include "test_execution_policies.h"
25#include "test_iterators.h"
26
27EXECUTION_POLICY_SFINAE_TEST(find);
28
29static_assert(sfinae_test_find<int, int*, int*, bool (*)(int)>);
30static_assert(!sfinae_test_find<std::execution::parallel_policy, int*, int*, int>);
31
32template <class Iter>
33struct Test {
34 template <class Policy>
35 void operator()(Policy&& policy) {
36 int a[] = {1, 2, 3, 4, 5, 6, 7, 8};
37
38 // simple test
39 assert(base(std::find(policy, Iter(std::begin(a)), Iter(std::end(a)), 3)) == a + 2);
40
41 // check that last is returned if no element matches
42 assert(base(std::find(policy, Iter(std::begin(a)), Iter(std::end(a)), 0)) == std::end(a));
43
44 // check that the first element is returned
45 assert(base(std::find(policy, Iter(std::begin(a)), Iter(std::end(a)), 1)) == std::begin(a));
46
47 // check that an empty range works
48 assert(base(std::find(policy, Iter(std::begin(a)), Iter(std::begin(a)), 1)) == std::begin(a));
49
50 // check that a one-element range works
51 assert(base(std::find(policy, Iter(std::begin(a)), Iter(std::begin(a) + 1), 1)) == std::begin(a));
52
53 // check that a two-element range works
54 assert(base(std::find(policy, Iter(std::begin(a)), Iter(std::begin(a) + 2), 2)) == std::begin(a) + 1);
55
56 // check that a large number of elements works
57 std::vector<int> vec(200, 4);
58 vec[176] = 5;
59 assert(base(std::find(policy, Iter(std::data(vec)), Iter(std::data(vec) + std::size(vec)), 5)) ==
60 std::data(vec) + 176);
61 }
62};
63
64int main(int, char**) {
65 types::for_each(types::forward_iterator_list<int*>{}, TestIteratorWithPolicies<Test>{});
66
67 return 0;
68}
69

source code of libcxx/test/std/algorithms/alg.nonmodifying/alg.find/pstl.find.pass.cpp