File: subsumption.compile.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 (93 lines) | stat: -rw-r--r-- 2,382 bytes parent folder | download | duplicates (14)
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
//===----------------------------------------------------------------------===//
//
// 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

// 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>());