File: pstl.count_if.pass.cpp

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm-proposed-updates
  • size: 1,998,492 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (86 lines) | stat: -rw-r--r-- 3,214 bytes parent folder | download | duplicates (11)
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
//===----------------------------------------------------------------------===//
//
// 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++03, c++11, c++14

// UNSUPPORTED: libcpp-has-no-incomplete-pstl

// <algorithm>

// template<class ExecutionPolicy, class ForwardIterator, class Predicate>
//   typename iterator_traits<ForwardIterator>::difference_type
//     count_if(ExecutionPolicy&& exec,
//              ForwardIterator first, ForwardIterator last, Predicate pred);

#include <algorithm>
#include <array>
#include <cassert>
#include <vector>

#include "test_macros.h"
#include "test_execution_policies.h"
#include "test_iterators.h"

EXECUTION_POLICY_SFINAE_TEST(count_if);

static_assert(sfinae_test_count_if<int, int*, int*, bool (*)(int)>);
static_assert(!sfinae_test_count_if<std::execution::parallel_policy, int*, int*, int>);

template <class Iter>
struct Test {
  template <class Policy>
  void operator()(Policy&& policy) {
    { // simple test
      int a[]            = {1, 2, 3, 4, 5};
      decltype(auto) ret = std::count_if(policy, std::begin(a), std::end(a), [](int i) { return i < 3; });
      static_assert(std::is_same_v<decltype(ret), typename std::iterator_traits<Iter>::difference_type>);
      assert(ret == 2);
    }

    { // test that an empty range works
      std::array<int, 0> a;
      decltype(auto) ret = std::count_if(policy, std::begin(a), std::end(a), [](int i) { return i < 3; });
      static_assert(std::is_same_v<decltype(ret), typename std::iterator_traits<Iter>::difference_type>);
      assert(ret == 0);
    }

    { // test that a single-element range works
      int a[] = {1};
      decltype(auto) ret = std::count_if(policy, std::begin(a), std::end(a), [](int i) { return i < 3; });
      static_assert(std::is_same_v<decltype(ret), typename std::iterator_traits<Iter>::difference_type>);
      assert(ret == 1);
    }

    { // test that a two-element range works
      int a[] = {1, 3};
      decltype(auto) ret = std::count_if(policy, std::begin(a), std::end(a), [](int i) { return i < 3; });
      static_assert(std::is_same_v<decltype(ret), typename std::iterator_traits<Iter>::difference_type>);
      assert(ret == 1);
    }

    { // test that a three-element range works
      int a[] = {2, 3, 2};
      decltype(auto) ret = std::count_if(policy, std::begin(a), std::end(a), [](int i) { return i < 3; });
      static_assert(std::is_same_v<decltype(ret), typename std::iterator_traits<Iter>::difference_type>);
      assert(ret == 2);
    }

    { // test that a large range works
      std::vector<int> a(100, 2);
      decltype(auto) ret = std::count_if(policy, std::begin(a), std::end(a), [](int i) { return i < 3; });
      static_assert(std::is_same_v<decltype(ret), typename std::iterator_traits<Iter>::difference_type>);
      assert(ret == 100);
    }
  }
};

int main(int, char**) {
  types::for_each(types::forward_iterator_list<int*>{}, TestIteratorWithPolicies<Test>{});

  return 0;
}