
Adds a new CMake option to disable the usage of incomplete headers. These incomplete headers are not guaranteed to be ABI stable. This option is intended to be used by vendors so they can avoid their users from code that's not ready for production usage. The option is enabled by default. Differential Revision: https://reviews.llvm.org/D106763
314 lines
11 KiB
C++
314 lines
11 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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 D>
|
|
// requires is_class_v<D> && same_as<D, remove_cv_t<D>>
|
|
// class view_interface;
|
|
|
|
#include <ranges>
|
|
|
|
#include <cassert>
|
|
#include "test_macros.h"
|
|
#include "test_iterators.h"
|
|
|
|
template<class T>
|
|
concept ValidViewInterfaceType = requires { typename std::ranges::view_interface<T>; };
|
|
|
|
struct Empty { };
|
|
|
|
static_assert(!ValidViewInterfaceType<void>);
|
|
static_assert(!ValidViewInterfaceType<void*>);
|
|
static_assert(!ValidViewInterfaceType<Empty*>);
|
|
static_assert(!ValidViewInterfaceType<Empty const>);
|
|
static_assert(!ValidViewInterfaceType<Empty &>);
|
|
static_assert( ValidViewInterfaceType<Empty>);
|
|
|
|
static_assert(std::derived_from<std::ranges::view_interface<Empty>, std::ranges::view_base>);
|
|
|
|
using InputIter = cpp20_input_iterator<const int*>;
|
|
|
|
struct InputRange : std::ranges::view_interface<InputRange> {
|
|
int buff[8] = {0, 1, 2, 3, 4, 5, 6, 7};
|
|
constexpr InputIter begin() const { return InputIter(buff); }
|
|
constexpr InputIter end() const { return InputIter(buff + 8); }
|
|
};
|
|
|
|
struct NotSizedSentinel {
|
|
using value_type = int;
|
|
using difference_type = std::ptrdiff_t;
|
|
using iterator_concept = std::forward_iterator_tag;
|
|
|
|
explicit NotSizedSentinel() = default;
|
|
explicit NotSizedSentinel(int*);
|
|
int& operator*() const;
|
|
NotSizedSentinel& operator++();
|
|
NotSizedSentinel operator++(int);
|
|
bool operator==(NotSizedSentinel const&) const;
|
|
};
|
|
static_assert(std::forward_iterator<NotSizedSentinel>);
|
|
|
|
using ForwardIter = forward_iterator<int*>;
|
|
|
|
// So that we conform to sized_sentinel_for.
|
|
constexpr std::ptrdiff_t operator-(const ForwardIter& x, const ForwardIter& y) {
|
|
return x.base() - y.base();
|
|
}
|
|
|
|
struct ForwardRange : std::ranges::view_interface<ForwardRange> {
|
|
int buff[8] = {0, 1, 2, 3, 4, 5, 6, 7};
|
|
constexpr ForwardIter begin() const { return ForwardIter(const_cast<int*>(buff)); }
|
|
constexpr ForwardIter end() const { return ForwardIter(const_cast<int*>(buff) + 8); }
|
|
};
|
|
|
|
struct MoveOnlyForwardRange : std::ranges::view_interface<MoveOnlyForwardRange> {
|
|
int buff[8] = {0, 1, 2, 3, 4, 5, 6, 7};
|
|
MoveOnlyForwardRange(MoveOnlyForwardRange const&) = delete;
|
|
MoveOnlyForwardRange(MoveOnlyForwardRange &&) = default;
|
|
MoveOnlyForwardRange() = default;
|
|
constexpr ForwardIter begin() const { return ForwardIter(const_cast<int*>(buff)); }
|
|
constexpr ForwardIter end() const { return ForwardIter(const_cast<int*>(buff) + 8); }
|
|
};
|
|
|
|
struct EmptyIsTrue : std::ranges::view_interface<EmptyIsTrue> {
|
|
int buff[8] = {0, 1, 2, 3, 4, 5, 6, 7};
|
|
constexpr ForwardIter begin() const { return ForwardIter(const_cast<int*>(buff)); }
|
|
constexpr ForwardIter end() const { return ForwardIter(const_cast<int*>(buff) + 8); }
|
|
constexpr bool empty() const { return true; }
|
|
};
|
|
|
|
struct SizeIsTen : std::ranges::view_interface<SizeIsTen> {
|
|
int buff[8] = {0, 1, 2, 3, 4, 5, 6, 7};
|
|
constexpr ForwardIter begin() const { return ForwardIter(const_cast<int*>(buff)); }
|
|
constexpr ForwardIter end() const { return ForwardIter(const_cast<int*>(buff) + 8); }
|
|
constexpr size_t size() const { return 10; }
|
|
};
|
|
|
|
using RAIter = random_access_iterator<int*>;
|
|
|
|
struct RARange : std::ranges::view_interface<RARange> {
|
|
int buff[8] = {0, 1, 2, 3, 4, 5, 6, 7};
|
|
constexpr RAIter begin() const { return RAIter(const_cast<int*>(buff)); }
|
|
constexpr RAIter end() const { return RAIter(const_cast<int*>(buff) + 8); }
|
|
};
|
|
|
|
using ContIter = contiguous_iterator<const int*>;
|
|
|
|
struct ContRange : std::ranges::view_interface<ContRange> {
|
|
int buff[8] = {0, 1, 2, 3, 4, 5, 6, 7};
|
|
constexpr ContIter begin() const { return ContIter(buff); }
|
|
constexpr ContIter end() const { return ContIter(buff + 8); }
|
|
};
|
|
|
|
struct DataIsNull : std::ranges::view_interface<DataIsNull> {
|
|
int buff[8] = {0, 1, 2, 3, 4, 5, 6, 7};
|
|
constexpr ContIter begin() const { return ContIter(buff); }
|
|
constexpr ContIter end() const { return ContIter(buff + 8); }
|
|
constexpr const int *data() const { return nullptr; }
|
|
};
|
|
|
|
template<bool IsNoexcept>
|
|
struct BoolConvertibleComparison : std::ranges::view_interface<BoolConvertibleComparison<IsNoexcept>> {
|
|
struct ResultType {
|
|
bool value;
|
|
constexpr operator bool() const noexcept(IsNoexcept) { return value; }
|
|
};
|
|
|
|
struct SentinelType {
|
|
int *base_;
|
|
SentinelType() = default;
|
|
explicit constexpr SentinelType(int *base) : base_(base) {}
|
|
friend constexpr ResultType operator==(ForwardIter const& iter, SentinelType const& sent) noexcept { return {iter.base() == sent.base_}; }
|
|
friend constexpr ResultType operator==(SentinelType const& sent, ForwardIter const& iter) noexcept { return {iter.base() == sent.base_}; }
|
|
friend constexpr ResultType operator!=(ForwardIter const& iter, SentinelType const& sent) noexcept { return {iter.base() != sent.base_}; }
|
|
friend constexpr ResultType operator!=(SentinelType const& sent, ForwardIter const& iter) noexcept { return {iter.base() != sent.base_}; }
|
|
};
|
|
|
|
int buff[8] = {0, 1, 2, 3, 4, 5, 6, 7};
|
|
constexpr ForwardIter begin() const noexcept { return ForwardIter(const_cast<int*>(buff)); }
|
|
constexpr SentinelType end() const noexcept { return SentinelType(const_cast<int*>(buff) + 8); }
|
|
};
|
|
|
|
template<class T>
|
|
concept EmptyInvocable = requires (T const& obj) { obj.empty(); };
|
|
|
|
template<class T>
|
|
concept BoolOpInvocable = requires (T const& obj) { bool(obj); };
|
|
|
|
constexpr bool testEmpty() {
|
|
static_assert(!EmptyInvocable<InputRange>);
|
|
static_assert( EmptyInvocable<ForwardRange>);
|
|
|
|
static_assert(!BoolOpInvocable<InputRange>);
|
|
static_assert( BoolOpInvocable<ForwardRange>);
|
|
|
|
ForwardRange forwardRange;
|
|
assert(!forwardRange.empty());
|
|
assert(!static_cast<ForwardRange const&>(forwardRange).empty());
|
|
|
|
assert(forwardRange);
|
|
assert(static_cast<ForwardRange const&>(forwardRange));
|
|
|
|
assert(!std::ranges::empty(forwardRange));
|
|
assert(!std::ranges::empty(static_cast<ForwardRange const&>(forwardRange)));
|
|
|
|
EmptyIsTrue emptyTrue;
|
|
assert(emptyTrue.empty());
|
|
assert(static_cast<EmptyIsTrue const&>(emptyTrue).empty());
|
|
assert(!emptyTrue.std::ranges::view_interface<EmptyIsTrue>::empty());
|
|
|
|
assert(!emptyTrue);
|
|
assert(!static_cast<EmptyIsTrue const&>(emptyTrue));
|
|
assert(!emptyTrue.std::ranges::view_interface<EmptyIsTrue>::operator bool());
|
|
|
|
assert(std::ranges::empty(emptyTrue));
|
|
assert(std::ranges::empty(static_cast<EmptyIsTrue const&>(emptyTrue)));
|
|
|
|
// Try calling empty on an rvalue.
|
|
MoveOnlyForwardRange moveOnly;
|
|
assert(!std::move(moveOnly).empty());
|
|
|
|
BoolConvertibleComparison<true> boolConv;
|
|
BoolConvertibleComparison<false> boolConv2;
|
|
static_assert(noexcept(boolConv.empty()));
|
|
static_assert(!noexcept(boolConv2.empty()));
|
|
|
|
assert(!boolConv.empty());
|
|
assert(!static_cast<BoolConvertibleComparison<true> const&>(boolConv).empty());
|
|
|
|
assert(boolConv);
|
|
assert(static_cast<BoolConvertibleComparison<true> const&>(boolConv));
|
|
|
|
assert(!std::ranges::empty(boolConv));
|
|
assert(!std::ranges::empty(static_cast<BoolConvertibleComparison<true> const&>(boolConv)));
|
|
|
|
return true;
|
|
}
|
|
|
|
template<class T>
|
|
concept DataInvocable = requires (T const& obj) { obj.data(); };
|
|
|
|
constexpr bool testData() {
|
|
static_assert(!DataInvocable<ForwardRange>);
|
|
static_assert( DataInvocable<ContRange>);
|
|
|
|
ContRange contiguous;
|
|
assert(contiguous.data() == contiguous.buff);
|
|
assert(static_cast<ContRange const&>(contiguous).data() == contiguous.buff);
|
|
|
|
assert(std::ranges::data(contiguous) == contiguous.buff);
|
|
assert(std::ranges::data(static_cast<ContRange const&>(contiguous)) == contiguous.buff);
|
|
|
|
DataIsNull dataNull;
|
|
assert(dataNull.data() == nullptr);
|
|
assert(static_cast<DataIsNull const&>(dataNull).data() == nullptr);
|
|
assert(dataNull.std::ranges::view_interface<DataIsNull>::data() == dataNull.buff);
|
|
|
|
assert(std::ranges::data(dataNull) == nullptr);
|
|
assert(std::ranges::data(static_cast<DataIsNull const&>(dataNull)) == nullptr);
|
|
|
|
return true;
|
|
}
|
|
|
|
template<class T>
|
|
concept SizeInvocable = requires (T const& obj) { obj.size(); };
|
|
|
|
constexpr bool testSize() {
|
|
static_assert(!SizeInvocable<InputRange>);
|
|
static_assert(!SizeInvocable<NotSizedSentinel>);
|
|
static_assert( SizeInvocable<ForwardRange>);
|
|
|
|
ForwardRange forwardRange;
|
|
assert(forwardRange.size() == 8);
|
|
assert(static_cast<ForwardRange const&>(forwardRange).size() == 8);
|
|
|
|
assert(std::ranges::size(forwardRange) == 8);
|
|
assert(std::ranges::size(static_cast<ForwardRange const&>(forwardRange)) == 8);
|
|
|
|
SizeIsTen sizeTen;
|
|
assert(sizeTen.size() == 10);
|
|
assert(static_cast<SizeIsTen const&>(sizeTen).size() == 10);
|
|
assert(sizeTen.std::ranges::view_interface<SizeIsTen>::size() == 8);
|
|
|
|
assert(std::ranges::size(sizeTen) == 10);
|
|
assert(std::ranges::size(static_cast<SizeIsTen const&>(sizeTen)) == 10);
|
|
|
|
return true;
|
|
}
|
|
|
|
template<class T>
|
|
concept SubscriptInvocable = requires (T const& obj, size_t n) { obj[n]; };
|
|
|
|
constexpr bool testSubscript() {
|
|
static_assert(!SubscriptInvocable<ForwardRange>);
|
|
static_assert( SubscriptInvocable<RARange>);
|
|
|
|
RARange randomAccess;
|
|
assert(randomAccess[2] == 2);
|
|
assert(static_cast<RARange const&>(randomAccess)[2] == 2);
|
|
randomAccess[2] = 3;
|
|
assert(randomAccess[2] == 3);
|
|
|
|
return true;
|
|
}
|
|
|
|
template<class T>
|
|
concept FrontInvocable = requires (T const& obj) { obj.front(); };
|
|
|
|
template<class T>
|
|
concept BackInvocable = requires (T const& obj) { obj.back(); };
|
|
|
|
constexpr bool testFrontBack() {
|
|
static_assert(!FrontInvocable<InputRange>);
|
|
static_assert( FrontInvocable<ForwardRange>);
|
|
static_assert(!BackInvocable<ForwardRange>);
|
|
static_assert( BackInvocable<RARange>);
|
|
|
|
ForwardRange forwardRange;
|
|
assert(forwardRange.front() == 0);
|
|
assert(static_cast<ForwardRange const&>(forwardRange).front() == 0);
|
|
forwardRange.front() = 2;
|
|
assert(forwardRange.front() == 2);
|
|
|
|
RARange randomAccess;
|
|
assert(randomAccess.front() == 0);
|
|
assert(static_cast<RARange const&>(randomAccess).front() == 0);
|
|
randomAccess.front() = 2;
|
|
assert(randomAccess.front() == 2);
|
|
|
|
assert(randomAccess.back() == 7);
|
|
assert(static_cast<RARange const&>(randomAccess).back() == 7);
|
|
randomAccess.back() = 2;
|
|
assert(randomAccess.back() == 2);
|
|
|
|
return true;
|
|
}
|
|
|
|
int main(int, char**) {
|
|
testEmpty();
|
|
static_assert(testEmpty());
|
|
|
|
testData();
|
|
static_assert(testData());
|
|
|
|
testSize();
|
|
static_assert(testSize());
|
|
|
|
testSubscript();
|
|
static_assert(testSubscript());
|
|
|
|
testFrontBack();
|
|
static_assert(testFrontBack());
|
|
|
|
return 0;
|
|
}
|