// 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_REVERSE_ITERATOR_HPP #define BOOST_STL_INTERFACES_REVERSE_ITERATOR_HPP #include namespace boost { namespace stl_interfaces { inline namespace v1 { namespace v1_dtl { template constexpr auto ce_dist(Iter f, Iter l, std::random_access_iterator_tag) -> decltype(l - f) { return l - f; } template constexpr auto ce_dist(Iter f, Iter l, Tag) -> decltype(std::distance(f, l)) { decltype(std::distance(f, l)) retval = 0; for (; f != l; ++f) { ++retval; } return retval; } template constexpr Iter ce_prev(Iter it) { return --it; } template constexpr void ce_adv(Iter & f, Offset n, std::random_access_iterator_tag) { f += n; } template constexpr void ce_adv(Iter & f, Offset n, Tag) { if (0 < n) { for (Offset i = 0; i < n; ++i) { ++f; } } else { for (Offset i = 0; i < -n; ++i) { --f; } } } } /** This type is very similar to the C++20 version of `std::reverse_iterator`; it is `constexpr`-, `noexcept`-, and proxy-friendly. */ template struct reverse_iterator : iterator_interface< reverse_iterator, #if 201703L < __cplusplus && defined(__cpp_lib_ranges) typename v2::detail::iter_concept_t, #else typename std::iterator_traits::iterator_category, #endif typename std::iterator_traits::value_type, typename std::iterator_traits::reference, typename std::iterator_traits::pointer, typename std::iterator_traits::difference_type> { constexpr reverse_iterator() noexcept(noexcept(BidiIter())) : it_() {} constexpr reverse_iterator(BidiIter it) noexcept( noexcept(BidiIter(it))) : it_(it) {} template< typename BidiIter2, typename E = std::enable_if_t< std::is_convertible::value>> reverse_iterator(reverse_iterator const & it) : it_(it.it_) {} friend BOOST_STL_INTERFACES_HIDDEN_FRIEND_CONSTEXPR auto operator-(reverse_iterator lhs, reverse_iterator rhs) noexcept( noexcept(v1_dtl::ce_dist( lhs.it_, rhs.it_, typename std::iterator_traits::iterator_category{}))) { return -v1_dtl::ce_dist( rhs.it_, lhs.it_, typename std::iterator_traits::iterator_category{}); } constexpr typename std::iterator_traits::reference operator*() const noexcept( noexcept(std::prev(v1_dtl::ce_prev(std::declval())))) { return *v1_dtl::ce_prev(it_); } constexpr reverse_iterator & operator+=( typename std::iterator_traits::difference_type n) noexcept(noexcept(v1_dtl:: ce_adv( std::declval(), -n, typename std::iterator_traits< BidiIter>:: iterator_category{}))) { v1_dtl::ce_adv( it_, -n, typename std::iterator_traits::iterator_category{}); return *this; } constexpr BidiIter base() const noexcept { return it_; } private: friend access; constexpr BidiIter & base_reference() noexcept { return it_; } constexpr BidiIter const & base_reference() const noexcept { return it_; } template friend struct reverse_iterator; BidiIter it_; }; template constexpr auto operator==( reverse_iterator lhs, reverse_iterator rhs) noexcept(noexcept(lhs.base() == rhs.base())) -> decltype(rhs.base() == lhs.base()) { return lhs.base() == rhs.base(); } template constexpr auto operator==( reverse_iterator lhs, reverse_iterator rhs) noexcept(noexcept(lhs.base() == rhs.base())) -> decltype(rhs.base() == lhs.base()) { return lhs.base() == rhs.base(); } /** Makes a `reverse_iterator` from an iterator of type `Bidiiter`. */ template auto make_reverse_iterator(BidiIter it) { return reverse_iterator(it); } }}} #if 201703L < __cplusplus && defined(__cpp_lib_concepts) || \ defined(BOOST_STL_INTERFACES_DOXYGEN) namespace boost { namespace stl_interfaces { namespace v2 { /** A template alias for `std::reverse_iterator`. This only exists to make migration from Boost.STLInterfaces to C++20 easier; switch to the one in `std` as soon as you can. */ template using reverse_iterator = std::reverse_iterator; /** Makes a `reverse_iterator` from an iterator of type `Bidiiter`. This only exists to make migration from Boost.STLInterfaces to C++20 easier; switch to the one in `std` as soon as you can. */ template auto make_reverse_iterator(BidiIter it) { return reverse_iterator(it); } }}} #endif #endif