File: minus.pass.cpp

package info (click to toggle)
llvm-toolchain-20 1%3A20.1.6-1~exp1
  • links: PTS, VCS
  • area: main
  • in suites: experimental
  • size: 2,111,304 kB
  • sloc: cpp: 7,438,677; ansic: 1,393,822; asm: 1,012,926; python: 241,650; f90: 86,635; objc: 75,479; lisp: 42,144; pascal: 17,286; sh: 10,027; ml: 5,082; perl: 4,730; awk: 3,523; makefile: 3,349; javascript: 2,251; xml: 892; fortran: 672
file content (85 lines) | stat: -rw-r--r-- 2,492 bytes parent folder | download | duplicates (6)
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
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//

// <iterator>

// reverse_iterator

// template <RandomAccessIterator Iter1, RandomAccessIterator Iter2>
//   requires HasMinus<Iter2, Iter1>
// auto operator-(const reverse_iterator<Iter1>& x, const reverse_iterator<Iter2>& y) // constexpr in C++17
//  -> decltype(y.base() - x.base());

#include <iterator>
#include <cstddef>
#include <cassert>
#include <type_traits>

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

template <class, class, class = void>
struct HasMinus : std::false_type {};
template <class R1, class R2>
struct HasMinus<R1, R2, decltype((R1() - R2(), void()))> : std::true_type {};

// Test non-subtractable base iterator types
static_assert(HasMinus<std::reverse_iterator<int*>, std::reverse_iterator<int*> >::value, "");
static_assert(HasMinus<std::reverse_iterator<int*>, std::reverse_iterator<const int*> >::value, "");

#if TEST_STD_VER >= 11
static_assert(!HasMinus<std::reverse_iterator<int*>, std::reverse_iterator<char*> >::value, "");
static_assert(!HasMinus<std::reverse_iterator<bidirectional_iterator<int*> >,
                        std::reverse_iterator<bidirectional_iterator<int*> > >::value,
              "");
#endif

template <class It1, class It2>
TEST_CONSTEXPR_CXX17 void test_one(It1 l, It2 r, std::ptrdiff_t x) {
  const std::reverse_iterator<It1> r1(l);
  const std::reverse_iterator<It2> r2(r);
  assert((r1 - r2) == x);
}

template <class Iter>
TEST_CONSTEXPR_CXX17 void test() {
  // Test same base iterator type
  char s[3] = {0};

  test_one(Iter(s), Iter(s), 0);
  test_one(Iter(s), Iter(s + 1), 1);
  test_one(Iter(s + 1), Iter(s), -1);
}

TEST_CONSTEXPR_CXX17 bool tests() {
  {
    test<char*>();
    test<random_access_iterator<char*> >();
#if TEST_STD_VER >= 20
    test<cpp20_random_access_iterator<char*>>();
#endif
  }
  {
    // Test different (but subtractable) base iterator types
    using PC  = const char*;
    char s[3] = {0};
    test_one(PC(s), s, 0);
    test_one(PC(s), s + 1, 1);
    test_one(PC(s + 1), s, -1);
  }

  return true;
}

int main(int, char**) {
  tests();
#if TEST_STD_VER > 14
  static_assert(tests(), "");
#endif
  return 0;
}