brintos

brintos / llvm-project-archived public Read only

0
0
Text · 2.6 KiB · 49eef2a Raw
75 lines · cpp
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-exception6//7//===----------------------------------------------------------------------===//8 9// UNSUPPORTED: c++03, c++11, c++1410 11// UNSUPPORTED: libcpp-has-no-incomplete-pstl12 13// <algorithm>14 15// template<class ExecutionPolicy, class ForwardIterator, class Predicate>16//   ForwardIterator find_if(ExecutionPolicy&& exec, ForwardIterator first, ForwardIterator last,17//                           Predicate pred);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_if);28 29static_assert(sfinae_test_find_if<int, int*, int*, bool (*)(int)>);30static_assert(!sfinae_test_find_if<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 test39    assert(base(std::find_if(policy, Iter(std::begin(a)), Iter(std::end(a)), [](int i) { return i == 3; })) == a + 2);40 41    // check that last is returned if no element matches42    assert(base(std::find_if(policy, Iter(std::begin(a)), Iter(std::end(a)), [](int i) { return i == 0; })) ==43           std::end(a));44 45    // check that the first element is returned46    assert(base(std::find_if(policy, Iter(std::begin(a)), Iter(std::end(a)), [](int i) { return i == 1; })) ==47           std::begin(a));48 49    // check that an empty range works50    assert(base(std::find_if(policy, Iter(std::begin(a)), Iter(std::begin(a)), [](int i) { return i == 1; })) ==51           std::begin(a));52 53    // check that a one-element range works54    assert(base(std::find_if(policy, Iter(std::begin(a)), Iter(std::begin(a) + 1), [](int i) { return i == 1; })) ==55           std::begin(a));56 57    // check that a two-element range works58    assert(base(std::find_if(policy, Iter(std::begin(a)), Iter(std::begin(a) + 2), [](int i) { return i == 2; })) ==59           std::begin(a) + 1);60 61    // check that a large number of elements works62    std::vector<int> vec(200, 4);63    vec[176] = 5;64    assert(base(std::find_if(policy, Iter(std::data(vec)), Iter(std::data(vec) + std::size(vec)), [](int i) {65             return i == 5;66           })) == std::data(vec) + 176);67  }68};69 70int main(int, char**) {71  types::for_each(types::forward_iterator_list<int*>{}, TestIteratorWithPolicies<Test>{});72 73  return 0;74}75