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
|
// Range v3 library
//
// Copyright Eric Niebler 2014-present
// Copyright Michel Morin 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
#include <forward_list>
#include <list>
#include <vector>
#include <limits>
#include <range/v3/core.hpp>
#include <range/v3/view/iota.hpp>
#include <range/v3/view/take_while.hpp>
#include "../array.hpp"
#include "../simple_test.hpp"
#include "../test_utils.hpp"
template<typename I, typename S>
void test_iterators(I first, S last, ranges::iter_difference_t<I> n)
{
using namespace ranges;
CHECK(distance(first, last) == n);
CHECK(distance_compare(first, last, n) == 0);
CHECK(distance_compare(first, last, n - 1) > 0);
CHECK(distance_compare(first, last, n + 1) < 0);
CHECK(distance_compare(first, last, (std::numeric_limits<iter_difference_t<I>>::min)()) > 0);
CHECK(distance_compare(first, last, (std::numeric_limits<iter_difference_t<I>>::max)()) < 0);
}
template<typename Rng>
void test_range(Rng&& rng, ranges::range_difference_t<Rng> n)
{
using namespace ranges;
CHECK(distance(rng) == n);
CHECK(distance_compare(rng, n) == 0);
CHECK(distance_compare(rng, n - 1) > 0);
CHECK(distance_compare(rng, n + 1) < 0);
CHECK(distance_compare(rng, (std::numeric_limits<range_difference_t<Rng>>::min)()) > 0);
CHECK(distance_compare(rng, (std::numeric_limits<range_difference_t<Rng>>::max)()) < 0);
}
template<typename Rng>
void test_infinite_range(Rng&& rng)
{
using namespace ranges;
CHECK(distance_compare(rng, 0) > 0);
CHECK(distance_compare(rng,-1) > 0);
CHECK(distance_compare(rng, 1) > 0);
CHECK(distance_compare(rng, (std::numeric_limits<range_difference_t<Rng>>::min)()) > 0);
if (is_infinite<Rng>::value) {
// For infinite ranges that can be detected by is_infinite<Rng> traits,
// distance_compare can compute the result in constant time.
CHECK(distance_compare(rng, (std::numeric_limits<range_difference_t<Rng>>::max)()) > 0);
}
else {
// For other infinite ranges, comparing to a huge number might take too much time.
// Thus commented out the test.
// CHECK(distance_compare(rng, (std::numeric_limits<range_difference_t<Rng>>::max)()) > 0);
}
}
constexpr bool test_constexpr()
{
using namespace ranges;
auto rng = test::array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
using Rng = decltype(rng);
auto bit = ranges::begin(rng);
using I = decltype(bit);
auto it = bit + 5;
auto eit = ranges::end(rng);
auto n = ranges::distance(rng);
auto en = ranges::enumerate(rng);
STATIC_CHECK_RETURN(n == 10);
STATIC_CHECK_RETURN(distance(bit, eit) == n);
STATIC_CHECK_RETURN(distance(it, eit) == 5);
STATIC_CHECK_RETURN(distance_compare(bit, eit, n) == 0);
STATIC_CHECK_RETURN(distance_compare(bit, eit, n - 1) > 0);
STATIC_CHECK_RETURN(distance_compare(bit, eit, n + 1) < 0);
STATIC_CHECK_RETURN(distance_compare(bit, eit, (std::numeric_limits<iter_difference_t<I>>::min)()) > 0);
STATIC_CHECK_RETURN(distance_compare(bit, eit, (std::numeric_limits<iter_difference_t<I>>::max)()) < 0);
STATIC_CHECK_RETURN(distance(rng) == n);
STATIC_CHECK_RETURN(distance_compare(rng, n) == 0);
STATIC_CHECK_RETURN(distance_compare(rng, n - 1) > 0);
STATIC_CHECK_RETURN(distance_compare(rng, n + 1) < 0);
STATIC_CHECK_RETURN(distance_compare(rng, (std::numeric_limits<range_difference_t<Rng>>::min)()) > 0);
STATIC_CHECK_RETURN(distance_compare(rng, (std::numeric_limits<range_difference_t<Rng>>::max)()) < 0);
STATIC_CHECK_RETURN(en.first == 10);
STATIC_CHECK_RETURN(en.second == eit);
return true;
}
int main()
{
using namespace ranges;
{
using cont_t = std::vector<int>;
cont_t c {1, 2, 3, 4};
test_range(c, 4);
test_iterators(c.begin(), c.end(), 4);
c.clear();
test_range(c, 0);
test_iterators(c.begin(), c.end(), 0);
}
{
using cont_t = std::list<int>;
cont_t c {1, 2, 3, 4};
test_range(c, 4);
test_iterators(c.begin(), c.end(), 4);
c.clear();
test_range(c, 0);
test_iterators(c.begin(), c.end(), 0);
}
{
using cont_t = std::forward_list<int>;
cont_t c {1, 2, 3, 4};
test_range(c, 4);
test_iterators(c.begin(), c.end(), 4);
c.clear();
test_range(c, 0);
test_iterators(c.begin(), c.end(), 0);
}
{
int a[] = {1, 2, 3, 4};
test_iterators(a + 4, a, -4);
}
{
test_range(views::iota(0) | views::take_while([](int i) { return i < 4; }), 4);
}
{
test_infinite_range(views::iota(0u));
}
{
STATIC_CHECK(test_constexpr());
}
return ::test_result();
}
|
