File: random_access_range.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 (56 lines) | stat: -rw-r--r-- 2,588 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
//===----------------------------------------------------------------------===//
//
// 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 R>
// concept random_access_range;

#include <ranges>

#include "test_range.h"
#include "test_iterators.h"

namespace ranges = std::ranges;

template <template <class...> class I>
constexpr bool check_range() {
  constexpr bool result = ranges::random_access_range<test_range<I> >;
  static_assert(ranges::random_access_range<test_range<I> const> == result);
  static_assert(ranges::random_access_range<test_non_const_common_range<I> > == result);
  static_assert(ranges::random_access_range<test_non_const_range<I> > == result);
  static_assert(ranges::random_access_range<test_common_range<I> > == result);
  static_assert(ranges::random_access_range<test_common_range<I> const> == result);
  static_assert(!ranges::random_access_range<test_non_const_common_range<I> const>);
  static_assert(!ranges::random_access_range<test_non_const_range<I> const>);
  return result;
}

static_assert(!check_range<cpp20_input_iterator>());
static_assert(!check_range<forward_iterator>());
static_assert(!check_range<bidirectional_iterator>());
static_assert(check_range<random_access_iterator>());
static_assert(check_range<contiguous_iterator>());

// Test ADL-proofing.
struct Incomplete;
template<class T> struct Holder { T t; };

static_assert(!std::ranges::random_access_range<Holder<Incomplete>*>);
static_assert(!std::ranges::random_access_range<Holder<Incomplete>*&>);
static_assert(!std::ranges::random_access_range<Holder<Incomplete>*&&>);
static_assert(!std::ranges::random_access_range<Holder<Incomplete>* const>);
static_assert(!std::ranges::random_access_range<Holder<Incomplete>* const&>);
static_assert(!std::ranges::random_access_range<Holder<Incomplete>* const&&>);

static_assert( std::ranges::random_access_range<Holder<Incomplete>*[10]>);
static_assert( std::ranges::random_access_range<Holder<Incomplete>*(&)[10]>);
static_assert( std::ranges::random_access_range<Holder<Incomplete>*(&&)[10]>);
static_assert( std::ranges::random_access_range<Holder<Incomplete>* const[10]>);
static_assert( std::ranges::random_access_range<Holder<Incomplete>* const(&)[10]>);
static_assert( std::ranges::random_access_range<Holder<Incomplete>* const(&&)[10]>);