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
|
// 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
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#include <vector>
#include <range/v3/core.hpp>
#include <range/v3/algorithm/generate.hpp>
#include <range/v3/iterator/insert_iterators.hpp>
#include <range/v3/view/counted.hpp>
#include "../simple_test.hpp"
#include "../test_utils.hpp"
#include "../test_iterators.hpp"
struct gen_test
{
int i_;
constexpr gen_test()
: i_{}
{}
constexpr gen_test(int i)
: i_(i)
{}
constexpr int operator()()
{
return i_++;
}
};
template<class Iter, class Sent = Iter>
void
test()
{
const unsigned n = 4;
int ia[n] = {0};
ranges::generate_result<Iter, gen_test> res = ranges::generate(Iter(ia), Sent(ia + n), gen_test(1));
CHECK(ia[0] == 1);
CHECK(ia[1] == 2);
CHECK(ia[2] == 3);
CHECK(ia[3] == 4);
CHECK(res.out == Iter(ia + n));
CHECK(res.fun.i_ == 5);
auto rng = ::MakeTestRange(Iter(ia), Sent(ia + n));
res = ranges::generate(rng, res.fun);
CHECK(ia[0] == 5);
CHECK(ia[1] == 6);
CHECK(ia[2] == 7);
CHECK(ia[3] == 8);
CHECK(res.out == Iter(ia + n));
CHECK(res.fun.i_ == 9);
auto res2 = ranges::generate(std::move(rng), res.fun);
CHECK(ia[0] == 9);
CHECK(ia[1] == 10);
CHECK(ia[2] == 11);
CHECK(ia[3] == 12);
CHECK(::is_dangling(res2.out));
CHECK(res2.fun.i_ == 13);
}
void test2()
{
// Test ranges::generate with a genuine output range
std::vector<int> v;
auto rng = ranges::views::counted(ranges::back_inserter(v), 5);
ranges::generate(rng, gen_test(1));
CHECK(v.size() == 5u);
CHECK(v[0] == 1);
CHECK(v[1] == 2);
CHECK(v[2] == 3);
CHECK(v[3] == 4);
CHECK(v[4] == 5);
}
template<class Iter, class Sent = Iter>
constexpr bool test_constexpr()
{
const unsigned n = 4;
int ia[n] = {0};
const auto res = ranges::generate(Iter(ia), Sent(ia + n), gen_test(1));
STATIC_CHECK_RETURN(ia[0] == 1);
STATIC_CHECK_RETURN(ia[1] == 2);
STATIC_CHECK_RETURN(ia[2] == 3);
STATIC_CHECK_RETURN(ia[3] == 4);
STATIC_CHECK_RETURN(res.out == Iter(ia + n));
STATIC_CHECK_RETURN(res.fun.i_ == 5);
auto rng = ranges::make_subrange(Iter(ia), Sent(ia + n));
const auto res2 = ranges::generate(rng, res.fun);
STATIC_CHECK_RETURN(ia[0] == 5);
STATIC_CHECK_RETURN(ia[1] == 6);
STATIC_CHECK_RETURN(ia[2] == 7);
STATIC_CHECK_RETURN(ia[3] == 8);
STATIC_CHECK_RETURN(res2.out == Iter(ia + n));
STATIC_CHECK_RETURN(res2.fun.i_ == 9);
const auto res3 = ranges::generate(std::move(rng), res2.fun);
STATIC_CHECK_RETURN(ia[0] == 9);
STATIC_CHECK_RETURN(ia[1] == 10);
STATIC_CHECK_RETURN(ia[2] == 11);
STATIC_CHECK_RETURN(ia[3] == 12);
STATIC_CHECK_RETURN(res3.out == Iter(ia + n));
STATIC_CHECK_RETURN(res3.fun.i_ == 13);
return true;
}
int main()
{
test<ForwardIterator<int*> >();
test<BidirectionalIterator<int*> >();
test<RandomAccessIterator<int*> >();
test<int*>();
test<ForwardIterator<int*>, Sentinel<int*> >();
test<BidirectionalIterator<int*>, Sentinel<int*> >();
test<RandomAccessIterator<int*>, Sentinel<int*> >();
test2();
STATIC_CHECK(test_constexpr<ForwardIterator<int *>>());
STATIC_CHECK(test_constexpr<BidirectionalIterator<int *>>());
STATIC_CHECK(test_constexpr<RandomAccessIterator<int *>>());
STATIC_CHECK(test_constexpr<int *>());
STATIC_CHECK(test_constexpr<ForwardIterator<int *>, Sentinel<int *>>());
STATIC_CHECK(test_constexpr<BidirectionalIterator<int *>, Sentinel<int *>>());
STATIC_CHECK(test_constexpr<RandomAccessIterator<int *>, Sentinel<int *>>());
return ::test_result();
}
|
