/// \file // Range v3 library // // Copyright Eric Niebler 2013-present // // Use, modification and distribution is subject to 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) // // Project home: https://github.com/ericniebler/range-v3 // #ifndef RANGES_V3_ITERATOR_TRAITS_HPP #define RANGES_V3_ITERATOR_TRAITS_HPP #include <iterator> #include <type_traits> #include <meta/meta.hpp> #include <concepts/concepts.hpp> #include <range/v3/range_fwd.hpp> #include <range/v3/iterator/access.hpp> // for iter_move, iter_swap #include <range/v3/utility/common_type.hpp> namespace ranges { /// \addtogroup group-iterator /// @{ /// \cond using input_iterator_tag RANGES_DEPRECATED( "Please switch to the standard iterator tags") = std::input_iterator_tag; using forward_iterator_tag RANGES_DEPRECATED( "Please switch to the standard iterator tags") = std::forward_iterator_tag; using bidirectional_iterator_tag RANGES_DEPRECATED( "Please switch to the standard iterator tags") = std::bidirectional_iterator_tag; using random_access_iterator_tag RANGES_DEPRECATED( "Please switch to the standard iterator tags") = std::random_access_iterator_tag; /// \cond struct contiguous_iterator_tag : std::random_access_iterator_tag {}; /// \cond struct input_iterator_concept; struct forward_iterator_concept; struct bidirectional_iterator_concept; struct random_access_iterator_concept; struct contiguous_iterator_concept; namespace detail { using input_iterator_tag_ = ::concepts::tag<input_iterator_concept>; using forward_iterator_tag_ = ::concepts::tag<forward_iterator_concept, input_iterator_tag_>; using bidirectional_iterator_tag_ = ::concepts::tag<bidirectional_iterator_concept, forward_iterator_tag_>; using random_access_iterator_tag_ = ::concepts::tag<random_access_iterator_concept, bidirectional_iterator_tag_>; using contiguous_iterator_tag_ = ::concepts::tag<contiguous_iterator_concept, random_access_iterator_tag_>; template<typename I, typename = iter_reference_t<I>, typename R = decltype(iter_move(std::declval<I &>())), typename = R &> using iter_rvalue_reference_t = R; template<typename I> RANGES_INLINE_VAR constexpr bool has_nothrow_iter_move_v = noexcept(iter_rvalue_reference_t<I>(ranges::iter_move(std::declval<I &>()))); } // namespace detail /// \endcond template<typename I> using iter_rvalue_reference_t = detail::iter_rvalue_reference_t<I>; template<typename I> using iter_common_reference_t = common_reference_t<iter_reference_t<I>, iter_value_t<I> &>; #if defined(RANGES_DEEP_STL_INTEGRATION) && RANGES_DEEP_STL_INTEGRATION && \ !defined(RANGES_DOXYGEN_INVOKED) template<typename T> using iter_difference_t = typename detail::if_then_t<detail::is_std_iterator_traits_specialized_v<T>, std::iterator_traits<T>, incrementable_traits<T>>::difference_type; #else template<typename T> using iter_difference_t = typename incrementable_traits<T>::difference_type; #endif // Defined in <range/v3/iterator/access.hpp> // template<typename T> // using iter_value_t = ... // Defined in <range/v3/iterator/access.hpp> // template<typename R> // using iter_reference_t = detail::iter_reference_t_<R>; // Defined in <range/v3/range_fwd.hpp>: // template<typename S, typename I> // inline constexpr bool disable_sized_sentinel = false; /// \cond namespace detail { template<typename I> using iter_size_t = meta::_t<if_then_t<std::is_integral<iter_difference_t<I>>::value, std::make_unsigned<iter_difference_t<I>>, meta::id<iter_difference_t<I>>>>; template<typename I> using iter_arrow_t = decltype(std::declval<I &>().operator->()); template<typename I> using iter_pointer_t = meta::_t<if_then_t<meta::is_trait<meta::defer<iter_arrow_t, I>>::value, meta::defer<iter_arrow_t, I>, std::add_pointer<iter_reference_t<I>>>>; template<typename T> struct difference_type_ : meta::defer<iter_difference_t, T> {}; template<typename T> struct value_type_ : meta::defer<iter_value_t, T> {}; template<typename T> struct size_type_ : meta::defer<iter_size_t, T> {}; } // namespace detail template<typename T> using difference_type_t RANGES_DEPRECATED( "ranges::difference_type_t is deprecated. Please use " "ranges::iter_difference_t instead.") = iter_difference_t<T>; template<typename T> using value_type_t RANGES_DEPRECATED( "ranges::value_type_t is deprecated. Please use " "ranges::iter_value_t instead.") = iter_value_t<T>; template<typename R> using reference_t RANGES_DEPRECATED( "ranges::reference_t is deprecated. Use ranges::iter_reference_t " "instead.") = iter_reference_t<R>; template<typename I> using rvalue_reference_t RANGES_DEPRECATED( "rvalue_reference_t is deprecated; " "use iter_rvalue_reference_t instead") = iter_rvalue_reference_t<I>; template<typename T> struct RANGES_DEPRECATED( "ranges::size_type is deprecated. Iterators do not have an associated " "size_type.") size_type : detail::size_type_<T> {}; template<typename I> using size_type_t RANGES_DEPRECATED("size_type_t is deprecated.") = detail::iter_size_t<I>; /// \endcond namespace cpp20 { using ranges::iter_common_reference_t; using ranges::iter_difference_t; using ranges::iter_reference_t; using ranges::iter_rvalue_reference_t; using ranges::iter_value_t; // Specialize these in the ranges:: namespace using ranges::disable_sized_sentinel; template<typename T> using incrementable_traits = ranges::incrementable_traits<T>; template<typename T> using readable_traits = ranges::readable_traits<T>; } // namespace cpp20 /// @} } // namespace ranges #endif // RANGES_V3_ITERATOR_TRAITS_HPP