File: push_front.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 (100 lines) | stat: -rw-r--r-- 3,078 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
// 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)

#include <list>
#include <vector>
#include <range/v3/core.hpp>
#include <range/v3/view/iota.hpp>
#include <range/v3/view/take.hpp>
#include <range/v3/view/for_each.hpp>
#include <range/v3/action/push_front.hpp>
#include "../simple_test.hpp"
#include "../test_utils.hpp"

int main()
{
    using namespace ranges;

    {
        std::vector<int> v;
        push_front(v, {1,2,3});
        ::check_equal(v, {1,2,3});

        push_front(v, views::iota(10) | views::take(3));
        ::check_equal(v, {10,11,12,1,2,3});

        push_front(v, views::iota(10) | views::take(3));
        ::check_equal(v, {10,11,12,10,11,12,1,2,3});

        int rg[] = {9,8,7};
        push_front(v, rg);
        ::check_equal(v, {9,8,7,10,11,12,10,11,12,1,2,3});
        push_front(v, rg);
        ::check_equal(v, {9,8,7,9,8,7,10,11,12,10,11,12,1,2,3});

        std::list<int> s;
        push_front(s,
            views::ints|views::take(10)|views::for_each([](int i){return yield_if(i%2==0,i);}));
        ::check_equal(s, {0,2,4,6,8});
        push_front(s, -2);
        ::check_equal(s, {-2,0,2,4,6,8});
    }

    {
        std::vector<int> v;
        v = std::move(v) | push_front({1,2,3});
        ::check_equal(v, {1,2,3});

        v = std::move(v) | push_front(views::iota(10) | views::take(3));
        ::check_equal(v, {10,11,12,1,2,3});

        v = std::move(v) | push_front(views::iota(10) | views::take(3));
        ::check_equal(v, {10,11,12,10,11,12,1,2,3});

        int rg[] = {9,8,7};
        v = std::move(v) | push_front(rg);
        ::check_equal(v, {9,8,7,10,11,12,10,11,12,1,2,3});
        v = std::move(v) | push_front(rg);
        ::check_equal(v, {9,8,7,9,8,7,10,11,12,10,11,12,1,2,3});

        std::list<int> s;
        s = std::move(s) | push_front(
            views::ints|views::take(10)|views::for_each([](int i){return yield_if(i%2==0,i);}));
        ::check_equal(s, {0,2,4,6,8});
        s = std::move(s) | push_front(-2);
        ::check_equal(s, {-2,0,2,4,6,8});
    }

    {
        std::vector<int> v;
        v |= push_front({1,2,3});
        ::check_equal(v, {1,2,3});

        v |= push_front(views::iota(10) | views::take(3));
        ::check_equal(v, {10,11,12,1,2,3});

        v |= push_front(views::iota(10) | views::take(3));
        ::check_equal(v, {10,11,12,10,11,12,1,2,3});

        int rg[] = {9,8,7};
        v |= push_front(rg);
        ::check_equal(v, {9,8,7,10,11,12,10,11,12,1,2,3});
        v |= push_front(rg);
        ::check_equal(v, {9,8,7,9,8,7,10,11,12,10,11,12,1,2,3});

        std::list<int> s;
        s |= push_front(
            views::ints|views::take(10)|views::for_each([](int i){return yield_if(i%2==0,i);}));
        ::check_equal(s, {0,2,4,6,8});
        s |= push_front(-2);
        ::check_equal(s, {-2,0,2,4,6,8});
    }

    return ::test_result();
}