/usr/include/range/v3/view/reverse.hpp is in librange-v3-dev 0.3.5-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 | /// \file
// Range v3 library
//
// Copyright Eric Niebler 2014-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_VIEW_REVERSE_HPP
#define RANGES_V3_VIEW_REVERSE_HPP
#include <iterator>
#include <utility>
#include <meta/meta.hpp>
#include <range/v3/begin_end.hpp>
#include <range/v3/range_fwd.hpp>
#include <range/v3/range_traits.hpp>
#include <range/v3/size.hpp>
#include <range/v3/view_adaptor.hpp>
#include <range/v3/detail/satisfy_boost_range.hpp>
#include <range/v3/utility/box.hpp>
#include <range/v3/utility/get.hpp>
#include <range/v3/utility/iterator.hpp>
#include <range/v3/utility/optional.hpp>
#include <range/v3/utility/static_const.hpp>
#include <range/v3/view/view.hpp>
namespace ranges
{
inline namespace v3
{
/// \addtogroup group-views
/// @{
template<typename Rng>
struct reverse_view
: view_adaptor<reverse_view<Rng>, Rng>
, private detail::non_propagating_cache<
iterator_t<Rng>, reverse_view<Rng>, !BoundedRange<Rng>()>
{
CONCEPT_ASSERT(BidirectionalRange<Rng>());
reverse_view() = default;
explicit constexpr reverse_view(Rng rng)
noexcept(std::is_nothrow_constructible<
typename reverse_view::view_adaptor, Rng>::value)
: reverse_view::view_adaptor{detail::move(rng)}
{}
CONCEPT_REQUIRES(SizedRange<Rng const>())
constexpr range_size_type_t<Rng> size() const
noexcept(noexcept(ranges::size(std::declval<Rng const &>())))
{
return ranges::size(this->base());
}
CONCEPT_REQUIRES(!SizedRange<Rng const>() && (SizedRange<Rng>() ||
SizedSentinel<iterator_t<Rng>, iterator_t<Rng>>()))
RANGES_CXX14_CONSTEXPR range_size_type_t<Rng> size()
noexcept(noexcept(std::declval<reverse_view &>().size_(SizedRange<Rng>())))
{
return size_(SizedRange<Rng>());
}
private:
friend range_access;
static constexpr bool const_iterable = BoundedRange<Rng const>();
CONCEPT_REQUIRES(const_iterable)
constexpr iterator_t<Rng> get_end() const
noexcept(noexcept(ranges::end(std::declval<Rng const &>())))
{
return ranges::end(this->base());
}
RANGES_CXX14_CONSTEXPR iterator_t<Rng> get_end_(std::true_type)
noexcept(noexcept(ranges::end(std::declval<Rng &>())))
{
CONCEPT_ASSERT(BoundedRange<Rng>());
return ranges::end(this->base());
}
RANGES_CXX14_CONSTEXPR iterator_t<Rng> get_end_(std::false_type)
noexcept(noexcept(iterator_t<Rng>(ranges::next(
ranges::begin(std::declval<Rng &>()),
ranges::end(std::declval<Rng &>())))))
{
CONCEPT_ASSERT(!BoundedRange<Rng>());
using cache_t = detail::non_propagating_cache<iterator_t<Rng>, reverse_view<Rng>>;
auto &end_ = static_cast<cache_t &>(*this);
if(!end_)
end_ = ranges::next(ranges::begin(this->base()), ranges::end(this->base()));
return *end_;
}
CONCEPT_REQUIRES(!const_iterable)
RANGES_CXX14_CONSTEXPR iterator_t<Rng> get_end()
noexcept(noexcept(std::declval<reverse_view &>().get_end_(BoundedRange<Rng>())))
{
return get_end_(BoundedRange<Rng>());
}
struct adaptor : adaptor_base
{
private:
using Parent = meta::const_if_c<const_iterable, reverse_view>;
using Base = meta::const_if_c<const_iterable, Rng>;
#ifndef NDEBUG
Parent *rng_;
#endif
public:
adaptor() = default;
#ifndef NDEBUG
constexpr adaptor(Parent &rng) noexcept
: rng_(&rng)
{}
#else
constexpr adaptor(Parent &) noexcept
{}
#endif
RANGES_CXX14_CONSTEXPR static auto begin(Parent &rng)
RANGES_DECLTYPE_AUTO_RETURN_NOEXCEPT
(
rng.get_end()
)
RANGES_CXX14_CONSTEXPR static auto end(Parent &rng)
RANGES_DECLTYPE_AUTO_RETURN_NOEXCEPT
(
ranges::begin(rng.base())
)
RANGES_CXX14_CONSTEXPR auto read(iterator_t<Rng> it) const
RANGES_DECLTYPE_AUTO_RETURN_NOEXCEPT
(
*--it
)
RANGES_CXX14_CONSTEXPR void next(iterator_t<Rng> &it) const
noexcept(noexcept(--it))
{
RANGES_ASSERT(it != ranges::begin(rng_->base()));
--it;
}
RANGES_CXX14_CONSTEXPR void prev(iterator_t<Rng> &it) const
noexcept(noexcept(++it))
{
RANGES_ASSERT(it != ranges::end(rng_->base()));
++it;
}
CONCEPT_REQUIRES(RandomAccessRange<Rng>())
RANGES_CXX14_CONSTEXPR
void advance(iterator_t<Rng> &it, range_difference_type_t<Rng> n) const
noexcept(noexcept(ranges::advance(it, -n)))
{
RANGES_ASSERT(n <= it - ranges::begin(rng_->base()));
RANGES_ASSERT(it - rng_->get_end() <= n);
ranges::advance(it, -n);
}
CONCEPT_REQUIRES(SizedSentinel<iterator_t<Rng>, iterator_t<Rng>>())
RANGES_CXX14_CONSTEXPR range_difference_type_t<Rng>
distance_to(iterator_t<Rng> const &here, iterator_t<Rng> const &there,
adaptor const &other_adapt) const
noexcept(noexcept(here - there))
{
RANGES_ASSERT(rng_ == other_adapt.rng_); (void)other_adapt;
return here - there;
}
};
CONCEPT_REQUIRES(const_iterable)
RANGES_CXX14_CONSTEXPR adaptor begin_adaptor() const
noexcept(std::is_nothrow_constructible<adaptor, reverse_view const &>::value)
{
return {*this};
}
CONCEPT_REQUIRES(const_iterable)
RANGES_CXX14_CONSTEXPR adaptor end_adaptor() const
noexcept(std::is_nothrow_constructible<adaptor, reverse_view const &>::value)
{
return {*this};
}
CONCEPT_REQUIRES(!const_iterable)
RANGES_CXX14_CONSTEXPR adaptor begin_adaptor()
noexcept(std::is_nothrow_constructible<adaptor, reverse_view &>::value)
{
return {*this};
}
CONCEPT_REQUIRES(!const_iterable)
RANGES_CXX14_CONSTEXPR adaptor end_adaptor()
noexcept(std::is_nothrow_constructible<adaptor, reverse_view &>::value)
{
return {*this};
}
// SizedRange == true
RANGES_CXX14_CONSTEXPR range_size_type_t<Rng> size_(std::true_type)
noexcept(noexcept(ranges::size(std::declval<Rng &>())))
{
return ranges::size(this->base());
}
// SizedRange == false, SizedSentinel == true
RANGES_CXX14_CONSTEXPR range_size_type_t<Rng> size_(std::false_type)
noexcept(noexcept(ranges::iter_size(
std::declval<reverse_view &>().begin(),
std::declval<reverse_view &>().end())))
{
// NB: This may trigger the O(N) walk over the sequence to find
// last iterator. That cost is amortized over all calls to size()
// and end, so we'll squint and call it "amortized O(1)."
return ranges::iter_size(this->begin(), this->end());
}
};
namespace view
{
struct reverse_fn
{
template<typename Rng>
using Constraint = BidirectionalRange<Rng>;
template<typename Rng, CONCEPT_REQUIRES_(Constraint<Rng>())>
#if defined(__GNUC__) && !defined(__clang__) && __GNUC__ == 5
// Avoid GCC5 bug that ODR-uses std::declval?!?
RANGES_CXX14_CONSTEXPR
#else
constexpr
#endif
auto operator()(Rng &&rng) const
RANGES_DECLTYPE_AUTO_RETURN_NOEXCEPT
(
reverse_view<all_t<Rng>>{all(static_cast<Rng &&>(rng))}
)
#ifndef RANGES_DOXYGEN_INVOKED
// For error reporting
template<typename Rng, CONCEPT_REQUIRES_(!Constraint<Rng>())>
void operator()(Rng &&) const
{
CONCEPT_ASSERT_MSG(BidirectionalRange<Rng>(),
"The object on which view::reverse operates must model the "
"BidirectionalRange concept.");
}
#endif
};
/// \relates reverse_fn
/// \ingroup group-views
RANGES_INLINE_VARIABLE(view<reverse_fn>, reverse)
}
/// @}
}
}
RANGES_SATISFY_BOOST_RANGE(::ranges::v3::reverse_view)
#endif
|