/
reverse.hpp
202 lines (192 loc) · 7.23 KB
/
reverse.hpp
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
/// \file
// Range v3 library
//
// Copyright Eric Niebler 2014
//
// 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 <utility>
#include <iterator>
#include <meta/meta.hpp>
#include <range/v3/detail/satisfy_boost_range.hpp>
#include <range/v3/range_fwd.hpp>
#include <range/v3/size.hpp>
#include <range/v3/begin_end.hpp>
#include <range/v3/range_traits.hpp>
#include <range/v3/view_adaptor.hpp>
#include <range/v3/detail/optional.hpp>
#include <range/v3/utility/box.hpp>
#include <range/v3/utility/get.hpp>
#include <range/v3/utility/iterator.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>()>
{
private:
CONCEPT_ASSERT(BidirectionalRange<Rng>());
friend range_access;
// BoundedRange == true
iterator_t<Rng> get_end_(std::true_type) const
{
return ranges::end(this->mutable_base());
}
// BoundedRange == false
iterator_t<Rng> get_end_(std::false_type)
{
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->mutable_base()),
ranges::end(this->mutable_base()));
return *end_;
}
// A rather convoluted implementation to avoid the problem std::reverse_iterator
// has adapting iterators that return references to internal data.
template<bool IsConst>
struct adaptor : adaptor_base
{
private:
using reverse_view_t = meta::invoke<meta::add_const_if_c<IsConst>, reverse_view>;
reverse_view_t *rng_;
public:
adaptor() = default;
adaptor(reverse_view_t &rng)
: rng_(&rng)
{}
iterator_t<Rng> begin(reverse_view_t &rng) const
{
auto it = rng.get_end_(BoundedRange<Rng>());
ranges::advance(it, -1, ranges::begin(rng.mutable_base()));
return it;
}
iterator_t<Rng> end(reverse_view_t &rng) const
{
return rng.get_end_(BoundedRange<Rng>());
}
void next(iterator_t<Rng> &it) const
{
if(0 != ranges::advance(it, -1, ranges::begin(rng_->mutable_base())))
it = rng_->get_end_(BoundedRange<Rng>());
}
void prev(iterator_t<Rng> &it) const
{
if(0 != ranges::advance(it, 1, ranges::end(rng_->mutable_base())))
it = ranges::begin(rng_->mutable_base());
}
CONCEPT_REQUIRES(RandomAccessRange<Rng>())
void advance(iterator_t<Rng> &it, range_difference_type_t<Rng> n) const
{
if(n > 0)
ranges::advance(it, -n + 1), this->next(it);
else if(n < 0)
this->prev(it), ranges::advance(it, -n - 1);
}
CONCEPT_REQUIRES(
SizedSentinel<iterator_t<Rng>, iterator_t<Rng>>())
range_difference_type_t<Rng>
distance_to(iterator_t<Rng> const &here, iterator_t<Rng> const &there,
adaptor const &other_adapt) const
{
RANGES_EXPECT(rng_ == other_adapt.rng_);
if(there == ranges::end(rng_->mutable_base()))
return here == ranges::end(rng_->mutable_base())
? 0 : (here - ranges::begin(rng_->mutable_base())) + 1;
else if(here == ranges::end(rng_->mutable_base()))
return (ranges::begin(rng_->mutable_base()) - there) - 1;
return here - there;
}
};
adaptor<false> begin_adaptor()
{
return {*this};
}
adaptor<false> end_adaptor()
{
return {*this};
}
CONCEPT_REQUIRES(BoundedRange<Rng const>())
adaptor<true> begin_adaptor() const
{
return {*this};
}
CONCEPT_REQUIRES(BoundedRange<Rng const>())
adaptor<true> end_adaptor() const
{
return {*this};
}
// SizedRange == true
range_size_type_t<Rng> size_(std::true_type)
{
return ranges::size(this->base());
}
// SizedRange == false, RandomAccessRange == true
range_size_type_t<Rng> size_(std::false_type)
{
return ranges::iter_size(this->begin(), this->end());
}
public:
reverse_view() = default;
explicit reverse_view(Rng rng)
: reverse_view::view_adaptor{std::move(rng)}
{}
CONCEPT_REQUIRES(SizedRange<Rng>() || RandomAccessRange<Rng>())
range_size_type_t<Rng> size()
{
return this->size_(SizedRange<Rng>());
}
CONCEPT_REQUIRES(SizedRange<Rng const>())
range_size_type_t<Rng> size() const
{
return ranges::size(this->base());
}
};
namespace view
{
struct reverse_fn
{
template<typename Rng>
using Concept = BidirectionalRange<Rng>;
template<typename Rng, CONCEPT_REQUIRES_(Concept<Rng>())>
reverse_view<all_t<Rng>> operator()(Rng && rng) const
{
return reverse_view<all_t<Rng>>{all(static_cast<Rng&&>(rng))};
}
#ifndef RANGES_DOXYGEN_INVOKED
// For error reporting
template<typename Rng, CONCEPT_REQUIRES_(!Concept<Rng>())>
void operator()(Rng &&) const
{
CONCEPT_ASSERT_MSG(BidirectionalRange<Rng>(),
"The object on which view::reverse operates must be a model of 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