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
|
// 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
#include <vector>
#include <memory>
#include <range/v3/core.hpp>
#include <range/v3/view/indirect.hpp>
#include <range/v3/view/transform.hpp>
#include "../simple_test.hpp"
#include "../test_utils.hpp"
int main()
{
using namespace ranges;
{
std::vector<std::shared_ptr<int>> vp;
for(int i = 0; i < 10; ++i)
vp.push_back(std::make_shared<int>(i));
auto && rng = vp | views::indirect;
CHECK(&*begin(rng) == vp[0].get());
::check_equal(rng, {0, 1, 2, 3, 4, 5, 6, 7, 8, 9});
}
{
int const some_ints[] = {0,1,2,3};
int const *some_int_pointers[] = {
some_ints + 0, some_ints + 1, some_ints + 2, some_ints + 3
};
auto make_range = [&]{
return debug_input_view<int const *>{some_int_pointers} | views::indirect;
};
auto rng = make_range();
::check_equal(rng, some_ints);
rng = make_range();
CHECK(&*begin(rng) == some_ints + 0);
}
#if RANGES_CXX_RETURN_TYPE_DEDUCTION >= RANGES_CXX_RETURN_TYPE_DEDUCTION_14
{
// regression test for #946
class Data;
struct Test
{
std::vector<Data*> m_list;
auto list()
{
return m_list | ranges::views::indirect;
}
};
class Data
{};
CHECK(Test{std::vector<Data*>(42)}.list().size() == 42u);
}
#endif // RANGES_CXX_RETURN_TYPE_DEDUCTION
{
// regression test for #952
int some_ints[42]{};
auto a = some_ints | views::transform([](int& i) { return &i; })
| views::indirect;
(void) a.begin();
}
return test_result();
}
|
