676 lines
24 KiB
C++
676 lines
24 KiB
C++
// Copyright (C) 2019 T. Zachary Laine
|
|
//
|
|
// Distributed under the Boost Software License, Version 1.0. (See
|
|
// accompanying file LICENSE_1_0.txt or copy at
|
|
// http://www.boost.org/LICENSE_1_0.txt)
|
|
#ifndef BOOST_STL_INTERFACES_ITERATOR_INTERFACE_HPP
|
|
#define BOOST_STL_INTERFACES_ITERATOR_INTERFACE_HPP
|
|
|
|
#include <boost/stl_interfaces/fwd.hpp>
|
|
|
|
#include <utility>
|
|
#include <type_traits>
|
|
#if defined(__cpp_lib_three_way_comparison)
|
|
#include <compare>
|
|
#endif
|
|
|
|
|
|
namespace boost { namespace stl_interfaces {
|
|
|
|
/** A type for granting access to the private members of an iterator
|
|
derived from `iterator_interface`. */
|
|
struct access
|
|
{
|
|
#ifndef BOOST_STL_INTERFACES_DOXYGEN
|
|
|
|
template<typename D>
|
|
static constexpr auto base(D & d) noexcept
|
|
-> decltype(d.base_reference())
|
|
{
|
|
return d.base_reference();
|
|
}
|
|
template<typename D>
|
|
static constexpr auto base(D const & d) noexcept
|
|
-> decltype(d.base_reference())
|
|
{
|
|
return d.base_reference();
|
|
}
|
|
|
|
#endif
|
|
};
|
|
|
|
/** The return type of `operator->()` in a proxy iterator.
|
|
|
|
This template is used as the default `Pointer` template parameter in
|
|
the `proxy_iterator_interface` template alias. Note that the use of
|
|
this template implies a copy or move of the underlying object of type
|
|
`T`. */
|
|
template<typename T>
|
|
struct proxy_arrow_result
|
|
{
|
|
constexpr proxy_arrow_result(T const & value) noexcept(
|
|
noexcept(T(value))) :
|
|
value_(value)
|
|
{}
|
|
constexpr proxy_arrow_result(T && value) noexcept(
|
|
noexcept(T(std::move(value)))) :
|
|
value_(std::move(value))
|
|
{}
|
|
|
|
constexpr T const * operator->() const noexcept { return &value_; }
|
|
constexpr T * operator->() noexcept { return &value_; }
|
|
|
|
private:
|
|
T value_;
|
|
};
|
|
|
|
namespace detail {
|
|
template<typename Pointer, typename T>
|
|
auto make_pointer(
|
|
T && value,
|
|
std::enable_if_t<std::is_pointer<Pointer>::value, int> = 0)
|
|
-> decltype(std::addressof(value))
|
|
{
|
|
return std::addressof(value);
|
|
}
|
|
|
|
template<typename Pointer, typename T>
|
|
auto make_pointer(
|
|
T && value,
|
|
std::enable_if_t<!std::is_pointer<Pointer>::value, int> = 0)
|
|
{
|
|
return Pointer(std::forward<T>(value));
|
|
}
|
|
|
|
template<typename IteratorConcept>
|
|
struct concept_category
|
|
{
|
|
using type = IteratorConcept;
|
|
};
|
|
template<typename IteratorConcept>
|
|
using concept_category_t =
|
|
typename concept_category<IteratorConcept>::type;
|
|
|
|
template<typename Pointer, typename IteratorConcept>
|
|
struct pointer
|
|
{
|
|
using type = Pointer;
|
|
};
|
|
template<typename Pointer>
|
|
struct pointer<Pointer, std::output_iterator_tag>
|
|
{
|
|
using type = void;
|
|
};
|
|
template<typename Pointer, typename IteratorConcept>
|
|
using pointer_t = typename pointer<Pointer, IteratorConcept>::type;
|
|
|
|
template<typename T, typename U>
|
|
using interoperable = std::integral_constant<
|
|
bool,
|
|
(std::is_convertible<T, U>::value ||
|
|
std::is_convertible<U, T>::value)>;
|
|
|
|
template<typename T, typename U>
|
|
using common_t =
|
|
std::conditional_t<std::is_convertible<T, U>::value, U, T>;
|
|
|
|
template<typename T>
|
|
using use_base = decltype(access::base(std::declval<T &>()));
|
|
|
|
template<typename... T>
|
|
using void_t = void;
|
|
|
|
template<
|
|
typename AlwaysVoid,
|
|
template<class...> class Template,
|
|
typename... Args>
|
|
struct detector : std::false_type
|
|
{
|
|
};
|
|
|
|
template<template<class...> class Template, typename... Args>
|
|
struct detector<void_t<Template<Args...>>, Template, Args...>
|
|
: std::true_type
|
|
{
|
|
};
|
|
|
|
template<
|
|
typename T,
|
|
typename U,
|
|
bool UseBase = detector<void, use_base, T>::value>
|
|
struct common_eq
|
|
{
|
|
static constexpr auto call(T lhs, U rhs)
|
|
{
|
|
return static_cast<common_t<T, U>>(lhs).derived() ==
|
|
static_cast<common_t<T, U>>(rhs).derived();
|
|
}
|
|
};
|
|
template<typename T, typename U>
|
|
struct common_eq<T, U, true>
|
|
{
|
|
static constexpr auto call(T lhs, U rhs)
|
|
{
|
|
return access::base(lhs) == access::base(rhs);
|
|
}
|
|
};
|
|
|
|
template<typename T, typename U>
|
|
constexpr auto common_diff(T lhs, U rhs) noexcept(noexcept(
|
|
static_cast<common_t<T, U>>(lhs) -
|
|
static_cast<common_t<T, U>>(rhs)))
|
|
-> decltype(
|
|
static_cast<common_t<T, U>>(lhs) -
|
|
static_cast<common_t<T, U>>(rhs))
|
|
{
|
|
return static_cast<common_t<T, U>>(lhs) -
|
|
static_cast<common_t<T, U>>(rhs);
|
|
}
|
|
}
|
|
|
|
}}
|
|
|
|
namespace boost { namespace stl_interfaces { inline namespace v1 {
|
|
|
|
/** A CRTP template that one may derive from to make defining iterators
|
|
easier.
|
|
|
|
The template parameter `D` for `iterator_interface` may be an
|
|
incomplete type. Before any member of the resulting specialization of
|
|
`iterator_interface` other than special member functions is
|
|
referenced, `D` shall be complete, and model
|
|
`std::derived_from<iterator_interface<D>>`. */
|
|
template<
|
|
typename Derived,
|
|
typename IteratorConcept,
|
|
typename ValueType,
|
|
typename Reference = ValueType &,
|
|
typename Pointer = ValueType *,
|
|
typename DifferenceType = std::ptrdiff_t
|
|
#ifndef BOOST_STL_INTERFACES_DOXYGEN
|
|
,
|
|
typename E = std::enable_if_t<
|
|
std::is_class<Derived>::value &&
|
|
std::is_same<Derived, std::remove_cv_t<Derived>>::value>
|
|
#endif
|
|
>
|
|
struct iterator_interface;
|
|
|
|
namespace v1_dtl {
|
|
template<typename Iterator, typename = void>
|
|
struct ra_iter : std::false_type
|
|
{
|
|
};
|
|
template<typename Iterator>
|
|
struct ra_iter<Iterator, void_t<typename Iterator::iterator_concept>>
|
|
: std::integral_constant<
|
|
bool,
|
|
std::is_base_of<
|
|
std::random_access_iterator_tag,
|
|
typename Iterator::iterator_concept>::value>
|
|
{
|
|
};
|
|
|
|
template<typename Iterator, typename DifferenceType, typename = void>
|
|
struct plus_eq : std::false_type
|
|
{
|
|
};
|
|
template<typename Iterator, typename DifferenceType>
|
|
struct plus_eq<
|
|
Iterator,
|
|
DifferenceType,
|
|
void_t<decltype(
|
|
std::declval<Iterator &>() += std::declval<DifferenceType>())>>
|
|
: std::true_type
|
|
{
|
|
};
|
|
|
|
template<
|
|
typename D,
|
|
typename IteratorConcept,
|
|
typename ValueType,
|
|
typename Reference,
|
|
typename Pointer,
|
|
typename DifferenceType>
|
|
void derived_iterator(iterator_interface<
|
|
D,
|
|
IteratorConcept,
|
|
ValueType,
|
|
Reference,
|
|
Pointer,
|
|
DifferenceType> const &);
|
|
}
|
|
|
|
template<
|
|
typename Derived,
|
|
typename IteratorConcept,
|
|
typename ValueType,
|
|
typename Reference,
|
|
typename Pointer,
|
|
typename DifferenceType
|
|
#ifndef BOOST_STL_INTERFACES_DOXYGEN
|
|
,
|
|
typename E
|
|
#endif
|
|
>
|
|
struct iterator_interface
|
|
{
|
|
#ifndef BOOST_STL_INTERFACES_DOXYGEN
|
|
private:
|
|
constexpr Derived & derived() noexcept
|
|
{
|
|
return static_cast<Derived &>(*this);
|
|
}
|
|
constexpr Derived const & derived() const noexcept
|
|
{
|
|
return static_cast<Derived const &>(*this);
|
|
}
|
|
|
|
template<typename T, typename U, bool UseBase>
|
|
friend struct detail::common_eq;
|
|
#endif
|
|
|
|
public:
|
|
using iterator_concept = IteratorConcept;
|
|
using iterator_category = detail::concept_category_t<iterator_concept>;
|
|
using value_type = std::remove_const_t<ValueType>;
|
|
using reference = Reference;
|
|
using pointer = detail::pointer_t<Pointer, iterator_concept>;
|
|
using difference_type = DifferenceType;
|
|
|
|
template<typename D = Derived>
|
|
constexpr auto operator*() const
|
|
noexcept(noexcept(*access::base(std::declval<D const &>())))
|
|
-> decltype(*access::base(std::declval<D const &>()))
|
|
{
|
|
return *access::base(derived());
|
|
}
|
|
|
|
template<typename D = Derived>
|
|
constexpr auto operator-> () const noexcept(
|
|
noexcept(detail::make_pointer<pointer>(*std::declval<D const &>())))
|
|
-> decltype(
|
|
detail::make_pointer<pointer>(*std::declval<D const &>()))
|
|
{
|
|
return detail::make_pointer<pointer>(*derived());
|
|
}
|
|
|
|
template<typename D = Derived>
|
|
constexpr auto operator[](difference_type i) const noexcept(noexcept(
|
|
D(std::declval<D const &>()),
|
|
std::declval<D &>() += i,
|
|
*std::declval<D &>()))
|
|
-> decltype(std::declval<D &>() += i, *std::declval<D &>())
|
|
{
|
|
D retval = derived();
|
|
retval += i;
|
|
return *retval;
|
|
}
|
|
|
|
template<
|
|
typename D = Derived,
|
|
typename Enable =
|
|
std::enable_if_t<!v1_dtl::plus_eq<D, difference_type>::value>>
|
|
constexpr auto
|
|
operator++() noexcept(noexcept(++access::base(std::declval<D &>())))
|
|
-> decltype(++access::base(std::declval<D &>()))
|
|
{
|
|
return ++access::base(derived());
|
|
}
|
|
|
|
template<typename D = Derived>
|
|
constexpr auto operator++() noexcept(
|
|
noexcept(std::declval<D &>() += difference_type(1)))
|
|
-> decltype(
|
|
std::declval<D &>() += difference_type(1), std::declval<D &>())
|
|
{
|
|
derived() += difference_type(1);
|
|
return derived();
|
|
}
|
|
template<typename D = Derived>
|
|
constexpr auto operator++(int)noexcept(
|
|
noexcept(D(std::declval<D &>()), ++std::declval<D &>()))
|
|
-> std::remove_reference_t<decltype(
|
|
D(std::declval<D &>()),
|
|
++std::declval<D &>(),
|
|
std::declval<D &>())>
|
|
{
|
|
D retval = derived();
|
|
++derived();
|
|
return retval;
|
|
}
|
|
|
|
template<typename D = Derived>
|
|
constexpr auto operator+=(difference_type n) noexcept(
|
|
noexcept(access::base(std::declval<D &>()) += n))
|
|
-> decltype(access::base(std::declval<D &>()) += n)
|
|
{
|
|
return access::base(derived()) += n;
|
|
}
|
|
|
|
template<typename D = Derived>
|
|
constexpr auto operator+(difference_type i) const
|
|
noexcept(noexcept(D(std::declval<D &>()), std::declval<D &>() += i))
|
|
-> std::remove_reference_t<decltype(
|
|
D(std::declval<D &>()),
|
|
std::declval<D &>() += i,
|
|
std::declval<D &>())>
|
|
{
|
|
D retval = derived();
|
|
retval += i;
|
|
return retval;
|
|
}
|
|
friend BOOST_STL_INTERFACES_HIDDEN_FRIEND_CONSTEXPR Derived
|
|
operator+(difference_type i, Derived it) noexcept
|
|
{
|
|
return it + i;
|
|
}
|
|
|
|
template<
|
|
typename D = Derived,
|
|
typename Enable =
|
|
std::enable_if_t<!v1_dtl::plus_eq<D, difference_type>::value>>
|
|
constexpr auto
|
|
operator--() noexcept(noexcept(--access::base(std::declval<D &>())))
|
|
-> decltype(--access::base(std::declval<D &>()))
|
|
{
|
|
return --access::base(derived());
|
|
}
|
|
|
|
template<typename D = Derived>
|
|
constexpr auto operator--() noexcept(noexcept(
|
|
D(std::declval<D &>()), std::declval<D &>() += -difference_type(1)))
|
|
-> decltype(
|
|
std::declval<D &>() += -difference_type(1), std::declval<D &>())
|
|
{
|
|
derived() += -difference_type(1);
|
|
return derived();
|
|
}
|
|
template<typename D = Derived>
|
|
constexpr auto operator--(int)noexcept(
|
|
noexcept(D(std::declval<D &>()), --std::declval<D &>()))
|
|
-> std::remove_reference_t<decltype(
|
|
D(std::declval<D &>()),
|
|
--std::declval<D &>(),
|
|
std::declval<D &>())>
|
|
{
|
|
D retval = derived();
|
|
--derived();
|
|
return retval;
|
|
}
|
|
|
|
template<typename D = Derived>
|
|
constexpr D & operator-=(difference_type i) noexcept
|
|
{
|
|
derived() += -i;
|
|
return derived();
|
|
}
|
|
|
|
template<typename D = Derived>
|
|
constexpr auto operator-(D other) const noexcept(noexcept(
|
|
access::base(std::declval<D const &>()) - access::base(other)))
|
|
-> decltype(
|
|
access::base(std::declval<D const &>()) - access::base(other))
|
|
{
|
|
return access::base(derived()) - access::base(other);
|
|
}
|
|
|
|
friend BOOST_STL_INTERFACES_HIDDEN_FRIEND_CONSTEXPR Derived
|
|
operator-(Derived it, difference_type i) noexcept
|
|
{
|
|
Derived retval = it;
|
|
retval += -i;
|
|
return retval;
|
|
}
|
|
};
|
|
|
|
/** Implementation of `operator==()`, implemented in terms of the iterator
|
|
underlying IteratorInterface, for all iterators derived from
|
|
`iterator_interface`, except those with an iterator category derived
|
|
from `std::random_access_iterator_tag`. */
|
|
template<
|
|
typename IteratorInterface1,
|
|
typename IteratorInterface2,
|
|
typename Enable =
|
|
std::enable_if_t<!v1_dtl::ra_iter<IteratorInterface1>::value>>
|
|
constexpr auto
|
|
operator==(IteratorInterface1 lhs, IteratorInterface2 rhs) noexcept
|
|
-> decltype(
|
|
access::base(std::declval<IteratorInterface1 &>()) ==
|
|
access::base(std::declval<IteratorInterface2 &>()))
|
|
{
|
|
return access::base(lhs) == access::base(rhs);
|
|
}
|
|
|
|
/** Implementation of `operator==()` for all iterators derived from
|
|
`iterator_interface` that have an iterator category derived from
|
|
`std::random_access_iterator_tag`. */
|
|
template<
|
|
typename IteratorInterface1,
|
|
typename IteratorInterface2,
|
|
typename Enable =
|
|
std::enable_if_t<v1_dtl::ra_iter<IteratorInterface1>::value>>
|
|
constexpr auto
|
|
operator==(IteratorInterface1 lhs, IteratorInterface2 rhs) noexcept(
|
|
noexcept(detail::common_diff(lhs, rhs)))
|
|
-> decltype(
|
|
v1_dtl::derived_iterator(lhs), detail::common_diff(lhs, rhs) == 0)
|
|
{
|
|
return detail::common_diff(lhs, rhs) == 0;
|
|
}
|
|
|
|
/** Implementation of `operator!=()` for all iterators derived from
|
|
`iterator_interface`. */
|
|
template<typename IteratorInterface1, typename IteratorInterface2>
|
|
constexpr auto operator!=(
|
|
IteratorInterface1 lhs,
|
|
IteratorInterface2 rhs) noexcept(noexcept(!(lhs == rhs)))
|
|
-> decltype(v1_dtl::derived_iterator(lhs), !(lhs == rhs))
|
|
{
|
|
return !(lhs == rhs);
|
|
}
|
|
|
|
/** Implementation of `operator<()` for all iterators derived from
|
|
`iterator_interface` that have an iterator category derived from
|
|
`std::random_access_iterator_tag`. */
|
|
template<typename IteratorInterface1, typename IteratorInterface2>
|
|
constexpr auto
|
|
operator<(IteratorInterface1 lhs, IteratorInterface2 rhs) noexcept(
|
|
noexcept(detail::common_diff(lhs, rhs)))
|
|
-> decltype(
|
|
v1_dtl::derived_iterator(lhs), detail::common_diff(lhs, rhs) < 0)
|
|
{
|
|
return detail::common_diff(lhs, rhs) < 0;
|
|
}
|
|
|
|
/** Implementation of `operator<=()` for all iterators derived from
|
|
`iterator_interface` that have an iterator category derived from
|
|
`std::random_access_iterator_tag`. */
|
|
template<typename IteratorInterface1, typename IteratorInterface2>
|
|
constexpr auto
|
|
operator<=(IteratorInterface1 lhs, IteratorInterface2 rhs) noexcept(
|
|
noexcept(detail::common_diff(lhs, rhs)))
|
|
-> decltype(
|
|
v1_dtl::derived_iterator(lhs), detail::common_diff(lhs, rhs) <= 0)
|
|
{
|
|
return detail::common_diff(lhs, rhs) <= 0;
|
|
}
|
|
|
|
/** Implementation of `operator>()` for all iterators derived from
|
|
`iterator_interface` that have an iterator category derived from
|
|
`std::random_access_iterator_tag`. */
|
|
template<typename IteratorInterface1, typename IteratorInterface2>
|
|
constexpr auto
|
|
operator>(IteratorInterface1 lhs, IteratorInterface2 rhs) noexcept(
|
|
noexcept(detail::common_diff(lhs, rhs)))
|
|
-> decltype(
|
|
v1_dtl::derived_iterator(lhs), detail::common_diff(lhs, rhs) > 0)
|
|
{
|
|
return detail::common_diff(lhs, rhs) > 0;
|
|
}
|
|
|
|
/** Implementation of `operator>=()` for all iterators derived from
|
|
`iterator_interface` that have an iterator category derived from
|
|
`std::random_access_iterator_tag`. */
|
|
template<typename IteratorInterface1, typename IteratorInterface2>
|
|
constexpr auto
|
|
operator>=(IteratorInterface1 lhs, IteratorInterface2 rhs) noexcept(
|
|
noexcept(detail::common_diff(lhs, rhs)))
|
|
-> decltype(
|
|
v1_dtl::derived_iterator(lhs), detail::common_diff(lhs, rhs) >= 0)
|
|
{
|
|
return detail::common_diff(lhs, rhs) >= 0;
|
|
}
|
|
|
|
|
|
/** A template alias useful for defining proxy iterators. \see
|
|
`iterator_interface`. */
|
|
template<
|
|
typename Derived,
|
|
typename IteratorConcept,
|
|
typename ValueType,
|
|
typename Reference = ValueType,
|
|
typename DifferenceType = std::ptrdiff_t>
|
|
using proxy_iterator_interface = iterator_interface<
|
|
Derived,
|
|
IteratorConcept,
|
|
ValueType,
|
|
Reference,
|
|
proxy_arrow_result<Reference>,
|
|
DifferenceType>;
|
|
|
|
}}}
|
|
|
|
#if 201703L < __cplusplus && defined(__cpp_lib_ranges)
|
|
|
|
namespace boost { namespace stl_interfaces { namespace v2 { namespace detail {
|
|
|
|
template<typename Iterator>
|
|
struct iter_concept;
|
|
|
|
template<typename Iterator>
|
|
requires requires
|
|
{
|
|
typename std::iterator_traits<Iterator>::iterator_concept;
|
|
}
|
|
struct iter_concept<Iterator>
|
|
{
|
|
using type = typename std::iterator_traits<Iterator>::iterator_concept;
|
|
};
|
|
|
|
template<typename Iterator>
|
|
requires(
|
|
!requires {
|
|
typename std::iterator_traits<Iterator>::iterator_concept;
|
|
} &&
|
|
requires {
|
|
typename std::iterator_traits<Iterator>::iterator_category;
|
|
}) struct iter_concept<Iterator>
|
|
{
|
|
using type = typename std::iterator_traits<Iterator>::iterator_category;
|
|
};
|
|
|
|
template<typename Iterator>
|
|
requires(
|
|
!requires {
|
|
typename std::iterator_traits<Iterator>::iterator_concept;
|
|
} &&
|
|
!requires {
|
|
typename std::iterator_traits<Iterator>::iterator_category;
|
|
}) struct iter_concept<Iterator>
|
|
{
|
|
using type = std::random_access_iterator_tag;
|
|
};
|
|
|
|
template<typename Iterator>
|
|
struct iter_concept
|
|
{};
|
|
|
|
template<typename Iterator>
|
|
using iter_concept_t = typename iter_concept<Iterator>::type;
|
|
|
|
}}}}
|
|
|
|
#endif
|
|
|
|
#ifdef BOOST_STL_INTERFACES_DOXYGEN
|
|
|
|
/** `static_asserts` that type `type` models concept `concept_name`. This is
|
|
useful for checking that an iterator, view, etc. that you write using one
|
|
of the *`_interface` templates models the right C++ concept.
|
|
|
|
For example: `BOOST_STL_INTERFACES_STATIC_ASSERT_CONCEPT(my_iter,
|
|
std::input_iterator)`.
|
|
|
|
\note This macro expands to nothing when `__cpp_lib_concepts` is not
|
|
defined. */
|
|
#define BOOST_STL_INTERFACES_STATIC_ASSERT_CONCEPT(type, concept_name)
|
|
|
|
/** `static_asserts` that the types of all typedefs in
|
|
`std::iterator_traits<iter>` match the remaining macro parameters. This
|
|
is useful for checking that an iterator you write using
|
|
`iterator_interface` has the correct iterator traits.
|
|
|
|
For example: `BOOST_STL_INTERFACES_STATIC_ASSERT_ITERATOR_TRAITS(my_iter,
|
|
std::input_iterator_tag, std::input_iterator_tag, int, int &, int *, std::ptrdiff_t)`.
|
|
|
|
\note This macro ignores the `concept` parameter when `__cpp_lib_concepts`
|
|
is not defined. */
|
|
#define BOOST_STL_INTERFACES_STATIC_ASSERT_ITERATOR_TRAITS( \
|
|
iter, category, concept, value_type, reference, pointer, difference_type)
|
|
|
|
#else
|
|
|
|
#define BOOST_STL_INTERFACES_STATIC_ASSERT_ITERATOR_CONCEPT_IMPL( \
|
|
type, concept_name) \
|
|
static_assert(concept_name<type>, "");
|
|
|
|
#define BOOST_STL_INTERFACES_STATIC_ASSERT_CONCEPT(iter, concept_name)
|
|
|
|
#define BOOST_STL_INTERFACES_STATIC_ASSERT_ITERATOR_TRAITS_IMPL( \
|
|
iter, category, value_t, ref, ptr, diff_t) \
|
|
static_assert( \
|
|
std::is_same< \
|
|
typename std::iterator_traits<iter>::iterator_category, \
|
|
category>::value, \
|
|
""); \
|
|
static_assert( \
|
|
std::is_same< \
|
|
typename std::iterator_traits<iter>::value_type, \
|
|
value_t>::value, \
|
|
""); \
|
|
static_assert( \
|
|
std::is_same<typename std::iterator_traits<iter>::reference, ref>:: \
|
|
value, \
|
|
""); \
|
|
static_assert( \
|
|
std::is_same<typename std::iterator_traits<iter>::pointer, ptr>:: \
|
|
value, \
|
|
""); \
|
|
static_assert( \
|
|
std::is_same< \
|
|
typename std::iterator_traits<iter>::difference_type, \
|
|
diff_t>::value, \
|
|
"");
|
|
|
|
#if 201703L < __cplusplus && defined(__cpp_lib_ranges)
|
|
#define BOOST_STL_INTERFACES_STATIC_ASSERT_ITERATOR_TRAITS( \
|
|
iter, category, concept, value_type, reference, pointer, difference_type) \
|
|
static_assert( \
|
|
std::is_same_v< \
|
|
boost::stl_interfaces::v2::detail::iter_concept_t<iter>, \
|
|
concept>, \
|
|
""); \
|
|
BOOST_STL_INTERFACES_STATIC_ASSERT_ITERATOR_TRAITS_IMPL( \
|
|
iter, category, value_type, reference, pointer, difference_type)
|
|
#else
|
|
#define BOOST_STL_INTERFACES_STATIC_ASSERT_ITERATOR_TRAITS( \
|
|
iter, category, concept, value_type, reference, pointer, difference_type) \
|
|
BOOST_STL_INTERFACES_STATIC_ASSERT_ITERATOR_TRAITS_IMPL( \
|
|
iter, category, value_type, reference, pointer, difference_type)
|
|
#endif
|
|
|
|
#endif
|
|
|
|
#endif
|