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
|
/// \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_ALGORITHM_REVERSE_HPP
#define RANGES_V3_ALGORITHM_REVERSE_HPP
#include <range/v3/range_fwd.hpp>
#include <range/v3/iterator/concepts.hpp>
#include <range/v3/iterator/operations.hpp>
#include <range/v3/iterator/traits.hpp>
#include <range/v3/range/access.hpp>
#include <range/v3/range/concepts.hpp>
#include <range/v3/range/dangling.hpp>
#include <range/v3/range/traits.hpp>
#include <range/v3/utility/static_const.hpp>
#include <range/v3/utility/swap.hpp>
#include <range/v3/detail/prologue.hpp>
namespace ranges
{
/// \addtogroup group-algorithms
/// @{
/// \cond
namespace detail
{
template<typename I>
constexpr void reverse_impl(I first, I last, std::bidirectional_iterator_tag)
{
while(first != last)
{
if(first == --last)
break;
ranges::iter_swap(first, last);
++first;
}
}
template<typename I>
constexpr void reverse_impl(I first, I last, std::random_access_iterator_tag)
{
if(first != last)
for(; first < --last; ++first)
ranges::iter_swap(first, last);
}
} // namespace detail
/// \endcond
RANGES_FUNC_BEGIN(reverse)
/// \brief function template \c reverse
template(typename I, typename S)(
requires bidirectional_iterator<I> AND sentinel_for<S, I> AND permutable<I>)
constexpr I RANGES_FUNC(reverse)(I first, S end_)
{
I last = ranges::next(first, end_);
detail::reverse_impl(first, last, iterator_tag_of<I>{});
return last;
}
/// \overload
template(typename Rng, typename I = iterator_t<Rng>)(
requires bidirectional_range<Rng> AND permutable<I>)
constexpr borrowed_iterator_t<Rng> RANGES_FUNC(reverse)(Rng && rng) //
{
return (*this)(begin(rng), end(rng));
}
RANGES_FUNC_END(reverse)
namespace cpp20
{
using ranges::reverse;
}
/// @}
} // namespace ranges
#include <range/v3/detail/epilogue.hpp>
#endif
|
