File: transform.cpp

package info (click to toggle)
range-v3 0.12.0-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 5,652 kB
  • sloc: cpp: 76,839; xml: 226; sh: 89; python: 34; makefile: 19; perl: 15
file content (226 lines) | stat: -rw-r--r-- 8,847 bytes parent folder | download | duplicates (4)
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
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
// 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 <string>
#include <vector>
#include <iterator>
#include <functional>
#include <range/v3/core.hpp>
#include <range/v3/algorithm/move.hpp>
#include <range/v3/functional/overload.hpp>
#include <range/v3/iterator/insert_iterators.hpp>
#include <range/v3/utility/copy.hpp>
#include <range/v3/view/transform.hpp>
#include <range/v3/view/counted.hpp>
#include <range/v3/view/reverse.hpp>
#include <range/v3/view/span.hpp>
#include <range/v3/view/zip.hpp>
#include "../simple_test.hpp"
#include "../test_utils.hpp"

struct is_odd
{
    bool operator()(int i) const
    {
        return (i % 2) == 1;
    }
};

// https://github.com/ericniebler/range-v3/issues/996
void bug_996()
{
    std::vector<int> buff(12, -1);
    ::ranges::span<int> sp(buff.data(), 12);

    auto x = ::ranges::views::transform(sp, [](int a) { return a > 3 ? a : 42; });
    auto y = ::ranges::views::transform(x, sp, [](int a, int b) { return a + b; });
    auto rng = ::ranges::views::transform(y, [](int a) { return a + 1; });
    (void)rng;
}

int main()
{
    using namespace ranges;

    int rgi[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
    std::pair<int, int> rgp[] = {{1,1}, {2,2}, {3,3}, {4,4}, {5,5}, {6,6}, {7,7}, {8,8}, {9,9}, {10,10}};

    {
        auto rng = rgi | views::transform(is_odd());
        has_type<int &>(*begin(rgi));
        has_type<bool>(*begin(rng));
        CPP_assert(view_<decltype(rng)>);
        CPP_assert(sized_range<decltype(rng)>);
        CPP_assert(random_access_range<decltype(rng)>);
        ::check_equal(rng, {true, false, true, false, true, false, true, false, true, false});
    }

    {
        auto rng2 = rgp | views::transform(&std::pair<int,int>::first);
        has_type<int &>(*begin(rng2));
        CPP_assert(same_as<range_value_t<decltype(rng2)>, int>);
        CPP_assert(same_as<decltype(iter_move(begin(rng2))), int &&>);
        CPP_assert(view_<decltype(rng2)>);
        CPP_assert(common_range<decltype(rng2)>);
        CPP_assert(sized_range<decltype(rng2)>);
        CPP_assert(random_access_range<decltype(rng2)>);
        ::check_equal(rng2, {1,2,3,4,5,6,7,8,9,10});
        ::check_equal(rng2 | views::reverse, {10,9,8,7,6,5,4,3,2,1});
        CHECK(&*begin(rng2) == &rgp[0].first);
        CHECK(rng2.size() == 10u);
    }

    {

        auto rng3 = views::counted(rgp, 10) | views::transform(&std::pair<int,int>::first);
        has_type<int &>(*begin(rng3));
        CPP_assert(view_<decltype(rng3)>);
        CPP_assert(common_range<decltype(rng3)>);
        CPP_assert(sized_range<decltype(rng3)>);
        CPP_assert(random_access_range<decltype(rng3)>);
        ::check_equal(rng3, {1,2,3,4,5,6,7,8,9,10});
        CHECK(&*begin(rng3) == &rgp[0].first);
        CHECK(rng3.size() == 10u);
    }

    {
        auto rng4 = views::counted(ForwardIterator<std::pair<int, int>*>{rgp}, 10)
                        | views::transform(&std::pair<int,int>::first);
        has_type<int &>(*begin(rng4));
        CPP_assert(view_<decltype(rng4)>);
        CPP_assert(!common_range<decltype(rng4)>);
        CPP_assert(sized_range<decltype(rng4)>);
        CPP_assert(forward_range<decltype(rng4)>);
        CPP_assert(!bidirectional_range<decltype(rng4)>);
        ::check_equal(rng4, {1,2,3,4,5,6,7,8,9,10});
        CHECK(&*begin(rng4) == &rgp[0].first);
        CHECK(rng4.size() == 10u);

        counted_iterator<ForwardIterator<std::pair<int, int>*>> i = begin(rng4).base();
        (void)i;
    }

    // Test transform with a mutable lambda
    {
        int cnt = 100;
        auto mutable_rng = views::transform(rgi, [cnt](int) mutable { return cnt++;});
        ::check_equal(mutable_rng, {100,101,102,103,104,105,106,107,108,109});
        CHECK(cnt == 100);
        CPP_assert(view_<decltype(mutable_rng)>);
        CPP_assert(!view_<decltype(mutable_rng) const>);
    }

    // Test iter_transform by transforming a zip view to select one element.
    {
        auto v0 = to<std::vector<MoveOnlyString>>({"a","b","c"});
        auto v1 = to<std::vector<MoveOnlyString>>({"x","y","z"});

        auto rng1 = views::zip(v0, v1);
        CPP_assert(random_access_range<decltype(rng1)>);

        std::vector<MoveOnlyString> res;
        using R1 = decltype(rng1);
        using I1 = iterator_t<R1>;
        // Needlessly verbose -- a simple transform would do the same, but this
        // is an interesting test.
        auto proj = overload(
            [](I1 i1) -> MoveOnlyString& {return (*i1).first;},
            [](copy_tag, I1) -> MoveOnlyString {return {};},
            [](move_tag, I1 i1) -> MoveOnlyString&& {return std::move((*i1).first);}
        );
        auto rng2 = rng1 | views::iter_transform(proj);
        move(rng2, ranges::back_inserter(res));
        ::check_equal(res, {"a","b","c"});
        ::check_equal(v0, {"","",""});
        ::check_equal(v1, {"x","y","z"});
        using R2 = decltype(rng2);
        CPP_assert(same_as<range_value_t<R2>, MoveOnlyString>);
        CPP_assert(same_as<range_reference_t<R2>, MoveOnlyString &>);
        CPP_assert(same_as<range_rvalue_reference_t<R2>, MoveOnlyString &&>);
    }

    // two range transform
    {
        auto v0 = to<std::vector<std::string>>({"a","b","c"});
        auto v1 = to<std::vector<std::string>>({"x","y","z"});

        auto rng = views::transform(v0, v1, [](std::string& s0, std::string& s1){return std::tie(s0, s1);});
        using R = decltype(rng);
        CPP_assert(same_as<range_value_t<R>, std::tuple<std::string&, std::string&>>);
        CPP_assert(same_as<range_reference_t<R>, std::tuple<std::string&, std::string&>>);
        CPP_assert(same_as<range_rvalue_reference_t<R>, std::tuple<std::string&, std::string&>>);

        using T = std::tuple<std::string, std::string>;
        ::check_equal(rng, {T{"a","x"}, T{"b","y"}, T{"c","z"}});
    }

    // two range indirect transform
    {
        auto v0 = to<std::vector<std::string>>({"a","b","c"});
        auto v1 = to<std::vector<std::string>>({"x","y","z"});
        using I = std::vector<std::string>::iterator;

        auto fun = overload(
            [](I i, I j)           { return std::tie(*i, *j); },
            [](copy_tag, I, I)     { return std::tuple<std::string, std::string>{}; },
            [](move_tag, I i, I j) { return common_tuple<std::string&&, std::string&&>{
                std::move(*i), std::move(*j)}; } );

        auto rng = views::iter_transform(v0, v1, fun);
        using R = decltype(rng);
        CPP_assert(same_as<range_value_t<R>, std::tuple<std::string, std::string>>);
        CPP_assert(same_as<range_reference_t<R>, std::tuple<std::string&, std::string&>>);
        CPP_assert(same_as<range_rvalue_reference_t<R>, common_tuple<std::string&&, std::string&&>>);

        using T = std::tuple<std::string, std::string>;
        ::check_equal(rng, {T{"a","x"}, T{"b","y"}, T{"c","z"}});
    }

    {
        auto rng = debug_input_view<int const>{rgi} | views::transform(is_odd{});
        ::check_equal(rng, {true, false, true, false, true, false, true, false, true, false});
    }

    {
        auto v0 = to<std::vector<std::string>>({"a","b","c"});
        auto v1 = to<std::vector<std::string>>({"x","y","z"});

        auto r0 = debug_input_view<std::string>{v0.data(), distance(v0)};
        auto r1 = debug_input_view<std::string>{v1.data(), distance(v1)};
        auto rng = views::transform(std::move(r0), std::move(r1),
            [](std::string &s0, std::string &s1){ return std::tie(s0, s1); });
        using R = decltype(rng);
        CPP_assert(same_as<range_value_t<R>, std::tuple<std::string &, std::string &>>);
        CPP_assert(same_as<range_reference_t<R>, std::tuple<std::string &, std::string &>>);
        CPP_assert(same_as<range_rvalue_reference_t<R>, std::tuple<std::string &, std::string &>>);

        using T = std::tuple<std::string, std::string>;
        ::check_equal(rng, {T{"a","x"}, T{"b","y"}, T{"c","z"}});
    }

    {
#if RANGES_CXX_DEDUCTION_GUIDES >= RANGES_CXX_DEDUCTION_GUIDES_17
#if defined(__clang__) && __clang_major__ < 6
        // Workaround https://bugs.llvm.org/show_bug.cgi?id=33314
        RANGES_DIAGNOSTIC_PUSH
        RANGES_DIAGNOSTIC_IGNORE_UNDEFINED_FUNC_TEMPLATE
#endif
        std::vector<int> vi = {1, 2, 3};
        ranges::transform_view times_ten{vi, [](int i) { return i * 10; }};
        ::check_equal(times_ten, {10, 20, 30});
#if defined(__clang__) && __clang_major__ < 6
        RANGES_DIAGNOSTIC_POP
#endif // clang bug workaround
#endif // use deduction guides
    }

    return test_result();
}