File: 1.cc

package info (click to toggle)
gcc-arm-none-eabi 15%3A14.2.rel1-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,099,328 kB
  • sloc: cpp: 3,627,108; ansic: 2,571,498; ada: 834,230; f90: 235,082; makefile: 79,231; asm: 74,984; xml: 51,692; exp: 39,736; sh: 33,298; objc: 15,629; python: 15,069; fortran: 14,429; pascal: 7,003; awk: 5,070; perl: 3,106; ml: 285; lisp: 253; lex: 204; haskell: 135
file content (93 lines) | stat: -rw-r--r-- 2,350 bytes parent folder | download
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
// { dg-do run { target c++23 } }

#include <algorithm>
#include <testsuite_hooks.h>
#include <testsuite_iterators.h>

#if __cpp_lib_ranges_find_last != 202207L
# error "Feature-test macro __cpp_lib_ranges_find_last has wrong value in <algorithm>"
#endif

namespace ranges = std::ranges;

constexpr bool
test01()
{
  int x[] = {1, 2, 1, 2, 1, 2, 1, 2};

  auto sr0 = ranges::find_last(x, 0);
  VERIFY( ranges::empty(sr0) );
  VERIFY( sr0.begin() == ranges::end(x) );

  auto sr1 = ranges::find_last(x, 1);
  VERIFY( ranges::equal(sr1, (int[]){1, 2}) );
  VERIFY( sr1.begin() == &x[6] );

  auto sr2 = ranges::find_last(x, 2);
  VERIFY( ranges::equal(sr2, (int[]){2}) );
  VERIFY( sr2.begin() == &x[7] );

  auto plus3 = [](int n) { return n+3; };

  auto sr3 = ranges::find_last(x, 3, plus3);
  VERIFY( ranges::empty(sr3) );
  VERIFY( sr3.begin() == ranges::end(x) );

  auto sr4 = ranges::find_last(x, 4, plus3);
  VERIFY( ranges::equal(sr4, (int[]){1, 2}) );
  VERIFY( sr4.begin() == &x[6] );

  auto sr5 = ranges::find_last(x, 5, plus3);
  VERIFY( ranges::equal(sr5, (int[]){2}) );
  VERIFY( sr5.begin() == &x[7] );

  return true;
}

void
test02()
{
  int x[] = {1, 2, 3, 1, 2, 3, 1, 2, 3};
  __gnu_test::test_forward_range<int> rx(x);

  auto sr0 = ranges::find_last(rx, 0);
  VERIFY( ranges::empty(sr0) );
  VERIFY( sr0.begin() == ranges::end(rx) );

  auto sr1 = ranges::find_last(rx, 1);
  VERIFY( ranges::equal(sr1, (int[]){1, 2, 3}) );
  VERIFY( sr1.begin().ptr == &x[6] );

  auto sr2 = ranges::find_last(rx, 2);
  VERIFY( ranges::equal(sr2, (int[]){2, 3}) );
  VERIFY( sr2.begin().ptr == &x[7] );

  auto sr3 = ranges::find_last(rx, 3);
  VERIFY( ranges::equal(sr3, (int[]){3}) );
  VERIFY( sr3.begin().ptr == &x[8] );

  auto plus4 = [](int n) { return n+4; };

  auto sr4 = ranges::find_last(rx, 4, plus4);
  VERIFY( ranges::empty(sr4) );
  VERIFY( sr4.begin() == ranges::end(rx) );

  auto sr5 = ranges::find_last(rx, 5, plus4);
  VERIFY( ranges::equal(sr5, (int[]){1, 2, 3}) );
  VERIFY( sr5.begin().ptr == &x[6] );

  auto sr6 = ranges::find_last(rx, 6, plus4);
  VERIFY( ranges::equal(sr6, (int[]){2, 3}) );
  VERIFY( sr6.begin().ptr == &x[7] );

  auto sr7 = ranges::find_last(rx, 7, plus4);
  VERIFY( ranges::equal(sr7, (int[]){3}) );
  VERIFY( sr7.begin().ptr == &x[8] );
}

int
main()
{
  static_assert(test01());
  test02();
}