Files
revng-revng/include/revng/ADT/Concepts.h
Ivan Krysak 37b8f80bf1 Concepts: introduce SpecializationOf
It was not available earlier because it required clang-13+
2023-07-02 17:05:52 +02:00

146 lines
5.1 KiB
C++

#pragma once
//
// This file is distributed under the MIT License. See LICENSE.md for details.
//
#include <array>
#include <concepts>
#include <iterator>
#include <string>
#include <string_view>
#include <type_traits>
//
// Concepts to simplify working with tuples.
//
template<class T>
concept TupleSizeCompatible = requires {
std::tuple_size<T>::value;
{ std::tuple_size_v<T> } -> std::convertible_to<size_t>;
};
static_assert(TupleSizeCompatible<std::tuple<>>);
static_assert(!TupleSizeCompatible<std::vector<int>>);
static_assert(!TupleSizeCompatible<int>);
namespace revng::detail {
template<class T, std::size_t N>
concept TupleElementCompatibleHelper = requires(T Value) {
typename std::tuple_element_t<N, std::remove_const_t<T>>;
{ get<N>(Value) } -> std::convertible_to<std::tuple_element_t<N, T> &>;
};
template<typename T, size_t... N>
constexpr auto checkTupleElementTypes(std::index_sequence<N...>) {
return (TupleElementCompatibleHelper<T, N> && ...);
}
template<TupleSizeCompatible T>
constexpr auto checkAllTupleElementTypes() {
constexpr std::size_t Size = std::tuple_size_v<T>;
return checkTupleElementTypes<T>(std::make_index_sequence<Size>());
}
} // namespace revng::detail
template<class T>
concept TupleLike = (TupleSizeCompatible<T>
and revng::detail::checkAllTupleElementTypes<T>());
static_assert(TupleLike<std::tuple<>>);
static_assert(TupleLike<std::tuple<int, int, long>>);
static_assert(TupleLike<std::pair<int, int>>);
static_assert(TupleLike<std::array<int, 0>>);
static_assert(not TupleLike<std::vector<int>>);
//
// Concepts to simplify working with specializations of templates.
//
/// A concept that helps determine whether a given object is a specialization
/// (or is inheriting a specialization) of a given template.
///
/// This lets us cut down on the number of `IsX` (e.g. `IsGenericGraph`,
/// `IsRank`) concepts needed since we can now just say
/// `SpecializationOf<GenericGraph>` on the interface boundaries and get
/// the expected check.
template<typename Type, template<typename...> class Ref>
concept SpecializationOf = requires(Type &Value) {
[]<typename... Ts>(Ref<Ts...> &) {
}(const_cast<std::remove_const_t<Type> &>(Value));
};
namespace revng::detail {
template<typename Test, template<typename...> class Ref>
struct StrictSpecializationHelper : std::false_type {};
template<template<typename...> class Ref, typename... Args>
struct StrictSpecializationHelper<Ref<Args...>, Ref> : std::true_type {};
template<template<typename...> class Ref, typename... Args>
struct StrictSpecializationHelper<const Ref<Args...>, Ref> : std::true_type {};
template<typename Test, template<typename...> class Ref>
constexpr bool
StrictSpecialization = StrictSpecializationHelper<Test, Ref>::value;
} // namespace revng::detail
/// A more strict version of the `SpecializationOf` concept. This one only
/// allows direct specializations (and aliases) - no inheritance.
///
/// It's useful in the cases when template parameter deduction is important,
/// e.g. when instantiating traits.
template<typename Test, template<typename...> class Ref>
concept StrictSpecializationOf = revng::detail::StrictSpecialization<Test, Ref>;
namespace examples {
static_assert(SpecializationOf<std::pair<int, long>, std::pair>);
static_assert(StrictSpecializationOf<std::pair<int, long>, std::pair>);
static_assert(SpecializationOf<const std::pair<int, long>, std::pair>);
static_assert(StrictSpecializationOf<const std::pair<int, long>, std::pair>);
static_assert(SpecializationOf<std::string, std::basic_string>);
static_assert(StrictSpecializationOf<std::string, std::basic_string>);
static_assert(not SpecializationOf<std::string, std::basic_string_view>);
static_assert(not StrictSpecializationOf<std::string, std::basic_string_view>);
using Alias = std::pair<int, long>;
static_assert(SpecializationOf<Alias, std::pair>);
static_assert(StrictSpecializationOf<Alias, std::pair>);
template<typename Type>
struct InheritanceT : std::pair<int, Type> {};
struct PublicInheritance : public InheritanceT<long> {};
struct PrivateInheritance : private InheritanceT<long> {};
struct ProtectedInheritance : protected InheritanceT<long> {};
static_assert(SpecializationOf<PublicInheritance, std::pair>);
static_assert(SpecializationOf<PublicInheritance, InheritanceT>);
static_assert(not SpecializationOf<PrivateInheritance, std::pair>);
static_assert(not SpecializationOf<ProtectedInheritance, std::pair>);
static_assert(not StrictSpecializationOf<PublicInheritance, std::pair>);
static_assert(not StrictSpecializationOf<PublicInheritance, InheritanceT>);
static_assert(not StrictSpecializationOf<PrivateInheritance, std::pair>);
static_assert(not StrictSpecializationOf<ProtectedInheritance, std::pair>);
} // namespace examples
//
// Other Miscellaneous concepts.
//
template<typename T, typename R>
concept ConstOrNot = std::is_same_v<R, T> or std::is_same_v<const R, T>;
template<class R, typename ValueType>
concept range_with_value_type = std::ranges::range<R>
&& std::is_convertible_v<typename R::value_type,
ValueType>;