[英]How do you define a C++ concept for the standard library containers?
I would like an implementation of a C++ concept for the standard library containers.我想为标准库容器实现一个 C++ 概念。
Many thanks in advance!提前谢谢了!
Fixed up Caleth's answer with the C++ concepts library:用 C++ 概念库修正了 Caleth 的答案:
template <class ContainerType>
concept Container = requires(ContainerType a, const ContainerType b)
{
requires std::regular<ContainerType>;
requires std::swappable<ContainerType>;
requires std::destructible<typename ContainerType::value_type>;
requires std::same_as<typename ContainerType::reference, typename ContainerType::value_type &>;
requires std::same_as<typename ContainerType::const_reference, const typename ContainerType::value_type &>;
requires std::forward_iterator<typename ContainerType::iterator>;
requires std::forward_iterator<typename ContainerType::const_iterator>;
requires std::signed_integral<typename ContainerType::difference_type>;
requires std::same_as<typename ContainerType::difference_type, typename std::iterator_traits<typename
ContainerType::iterator>::difference_type>;
requires std::same_as<typename ContainerType::difference_type, typename std::iterator_traits<typename
ContainerType::const_iterator>::difference_type>;
{ a.begin() } -> typename ContainerType::iterator;
{ a.end() } -> typename ContainerType::iterator;
{ b.begin() } -> typename ContainerType::const_iterator;
{ b.end() } -> typename ContainerType::const_iterator;
{ a.cbegin() } -> typename ContainerType::const_iterator;
{ a.cend() } -> typename ContainerType::const_iterator;
{ a.size() } -> typename ContainerType::size_type;
{ a.max_size() } -> typename ContainerType::size_type;
{ a.empty() } -> bool;
};
There's the pre-concept Container requirements.有概念前的容器要求。 As a concept that would look something like
作为一个看起来像的概念
template <class E>
concept default_erasable = requires(E * p) {
std::destroy_at(p);
};
template <class E, class T, class A>
concept allocator_erasable = requires(A m, E * p) {
requires std::same_as<typename T::allocator_type, typename std::allocator_traits<A>::rebind_alloc<E>>;
std::allocator_traits<A>::destroy(m, p);
};
template <class T>
concept allocator_aware = requires (T a) {
{ a.get_allocator() } -> std::same_as<typename T::allocator_type>;
};
template <class T>
struct is_basic_string : std::false_type {};
template <class C, class T, class A>
struct is_basic_string<std::basic_string<C, T, A>> : std::true_type {};
template <class T>
constexpr bool is_basic_string_v = is_basic_string<T>::value;
template <class E, class T>
concept erasable = (is_basic_string_v<T> && default_erasable<E>)
|| (allocator_aware<T> && allocator_erasable<E, T, typename T::allocator_type>)
|| (!allocator_aware<T> && default_erasable<E>);
template <class T>
concept container = requires(T a, const T b)
{
requires std::regular<T>;
requires std::swappable<T>;
requires erasable<typename T::value_type, T>;
requires std::same_as<typename T::reference, typename T::value_type &>;
requires std::same_as<typename T::const_reference, const typename T::value_type &>;
requires std::forward_iterator<typename T::iterator>;
requires std::forward_iterator<typename T::const_iterator>;
requires std::signed_integral<typename T::difference_type>;
requires std::same_as<typename T::difference_type, typename std::iterator_traits<typename T::iterator>::difference_type>;
requires std::same_as<typename T::difference_type, typename std::iterator_traits<typename T::const_iterator>::difference_type>;
{ a.begin() } -> std::same_as<typename T::iterator>;
{ a.end() } -> std::same_as<typename T::iterator>;
{ b.begin() } -> std::same_as<typename T::const_iterator>;
{ b.end() } -> std::same_as<typename T::const_iterator>;
{ a.cbegin() } -> std::same_as<typename T::const_iterator>;
{ a.cend() } -> std::same_as<typename T::const_iterator>;
{ a.size() } -> std::same_as<typename T::size_type>;
{ a.max_size() } -> std::same_as<typename T::size_type>;
{ a.empty() } -> std::convertible_to<bool>;
};
and you probably want to add requires std::ranges::range<T>;
你可能想添加
requires std::ranges::range<T>;
for concept partial ordering.用于概念偏序。
Fixed version that actually compiles in C++…:实际在 C++ 中编译的固定版本……:
template <class ContainerType>
concept Container = requires(ContainerType a, const ContainerType b)
{
requires std::regular<ContainerType>;
requires std::swappable<ContainerType>;
requires std::destructible<typename ContainerType::value_type>;
requires std::same_as<typename ContainerType::reference, typename ContainerType::value_type &>;
requires std::same_as<typename ContainerType::const_reference, const typename ContainerType::value_type &>;
requires std::forward_iterator<typename ContainerType::iterator>;
requires std::forward_iterator<typename ContainerType::const_iterator>;
requires std::signed_integral<typename ContainerType::difference_type>;
requires std::same_as<typename ContainerType::difference_type, typename std::iterator_traits<typename ContainerType::iterator>::difference_type>;
requires std::same_as<typename ContainerType::difference_type, typename std::iterator_traits<typename ContainerType::const_iterator>::difference_type>;
{ a.begin() } -> std::same_as<typename ContainerType::iterator>;
{ a.end() } -> std::same_as<typename ContainerType::iterator>;
{ b.begin() } -> std::same_as<typename ContainerType::const_iterator>;
{ b.end() } -> std::same_as<typename ContainerType::const_iterator>;
{ a.cbegin() } -> std::same_as<typename ContainerType::const_iterator>;
{ a.cend() } -> std::same_as<typename ContainerType::const_iterator>;
{ a.size() } -> std::same_as<typename ContainerType::size_type>;
{ a.max_size() } -> std::same_as<typename ContainerType::size_type>;
{ a.empty() } -> std::same_as<bool>;
};
static_assert(Container<std::vector<unsigned char>>);
static_assert(Container<std::string>);
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.