File: decrement.pass.cpp

package info (click to toggle)
llvm-toolchain-16 1%3A16.0.6-15~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,634,792 kB
  • sloc: cpp: 6,179,261; ansic: 1,216,205; asm: 741,319; python: 196,614; objc: 75,325; f90: 49,640; lisp: 32,396; pascal: 12,286; sh: 9,394; perl: 7,442; ml: 5,494; awk: 3,523; makefile: 2,723; javascript: 1,206; xml: 886; fortran: 581; cs: 573
file content (91 lines) | stat: -rw-r--r-- 2,421 bytes parent folder | download | duplicates (13)
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
//===----------------------------------------------------------------------===//
//
// 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, c++17

// constexpr iterator& operator--() requires bidirectional_range<Base>;
// constexpr iterator operator--(int) requires bidirectional_range<Base>;

#include <array>
#include <cassert>
#include <ranges>
#include <tuple>

#include "test_iterators.h"

template <class Iter>
concept CanPreDecrement = requires(Iter it) { --it; };

template <class Iter>
concept CanPostDecrement = requires(Iter it) { it--; };

template <class Iter, class Sent = sentinel_wrapper<Iter>>
constexpr void testOne() {
  using Range          = std::ranges::subrange<Iter, Sent>;
  std::tuple<int> ts[] = {{1}, {2}, {3}};
  auto ev              = Range{Iter{&ts[0]}, Sent{Iter{&ts[0] + 3}}} | std::views::elements<0>;

  using ElementIter = std::ranges::iterator_t<decltype(ev)>;

  if constexpr (!std::bidirectional_iterator<Iter>) {
    auto it = ev.begin();
    static_assert(!CanPreDecrement<decltype(it)>);
    static_assert(!CanPostDecrement<decltype(it)>);
  } else {
    // --i
    {
      auto it = ev.begin();
      static_assert(CanPreDecrement<decltype(it)>);

      ++it;
      assert(base(it.base()) == &ts[1]);

      decltype(auto) result = --it;

      static_assert(std::is_same_v<decltype(result), ElementIter&>);
      assert(&result == &it);

      assert(base(it.base()) == &ts[0]);
    }

    // i--
    {
      auto it = ev.begin();
      static_assert(CanPostDecrement<decltype(it)>);

      ++it;
      assert(base(it.base()) == &ts[1]);

      decltype(auto) result = it--;

      static_assert(std::is_same_v<decltype(result), ElementIter>);

      assert(base(it.base()) == &ts[0]);
      assert(base(result.base()) == &ts[1]);
    }
  }
}

constexpr bool test() {
  using Ptr = std::tuple<int>*;
  testOne<cpp20_input_iterator<Ptr>>();
  testOne<forward_iterator<Ptr>>();
  testOne<bidirectional_iterator<Ptr>>();
  testOne<random_access_iterator<Ptr>>();
  testOne<contiguous_iterator<Ptr>>();
  testOne<Ptr>();

  return true;
}

int main(int, char**) {
  test();
  static_assert(test());

  return 0;
}