File: subsumption.compile.pass.cpp

package info (click to toggle)
llvm-toolchain-13 1%3A13.0.1-6~deb11u1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 1,418,812 kB
  • sloc: cpp: 5,290,827; ansic: 996,570; asm: 544,593; python: 188,212; objc: 72,027; lisp: 30,291; f90: 25,395; sh: 24,900; javascript: 9,780; pascal: 9,398; perl: 7,484; ml: 5,432; awk: 3,523; makefile: 2,892; xml: 953; cs: 573; fortran: 539
file content (96 lines) | stat: -rw-r--r-- 2,488 bytes parent folder | download | duplicates (3)
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
94
95
96
//===----------------------------------------------------------------------===//
//
// 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
// UNSUPPORTED: libcpp-no-concepts
// UNSUPPORTED: gcc-10
// UNSUPPORTED: libcpp-has-no-incomplete-ranges

// template<class T>
// concept input_iterator;

// std::ranges::forward_range

#include <ranges>

#include <iterator>

struct range {
  int* begin();
  int* end();
};

template<std::ranges::range R>
requires std::input_iterator<std::ranges::iterator_t<R>>
constexpr bool check_input_range_subsumption() {
  return false;
}

template<std::ranges::input_range>
requires true
constexpr bool check_input_range_subsumption() {
  return true;
}

static_assert(check_input_range_subsumption<range>());

template<std::ranges::input_range R>
requires std::forward_iterator<std::ranges::iterator_t<R>>
constexpr bool check_forward_range_subsumption() {
  return false;
}

template<std::ranges::forward_range>
requires true
constexpr bool check_forward_range_subsumption() {
  return true;
}

static_assert(check_forward_range_subsumption<range>());

template<std::ranges::forward_range R>
requires std::bidirectional_iterator<std::ranges::iterator_t<R>>
constexpr bool check_bidirectional_range_subsumption() {
  return false;
}

template<std::ranges::bidirectional_range>
requires true
constexpr bool check_bidirectional_range_subsumption() {
  return true;
}

static_assert(check_bidirectional_range_subsumption<range>());

template<std::ranges::bidirectional_range R>
requires std::random_access_iterator<std::ranges::iterator_t<R>>
constexpr bool check_random_access_range_subsumption() {
  return false;
}

template<std::ranges::random_access_range>
requires true
constexpr bool check_random_access_range_subsumption() {
  return true;
}

static_assert(check_random_access_range_subsumption<range>());

template<std::ranges::random_access_range R>
requires std::random_access_iterator<std::ranges::iterator_t<R>>
constexpr bool check_contiguous_range_subsumption() {
  return false;
}

template<std::ranges::contiguous_range>
requires true
constexpr bool check_contiguous_range_subsumption() {
  return true;
}

static_assert(check_contiguous_range_subsumption<range>());