about summary refs log tree commit diff
path: root/example/array/array.cpp
blob: 43972ad61a2122e6cb858d176b0a9b72fd73a622 (plain) (blame)
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
//
// immer: immutable data structures for C++
// Copyright (C) 2016, 2017, 2018 Juan Pedro Bolivar Puente
//
// This software is distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE or copy at http://boost.org/LICENSE_1_0.txt
//

#include <immer/array.hpp>

#include <cassert>

int main()
{
    {
        // include:push-back/start
        auto v1 = immer::array<int>{1};
        auto v2 = v1.push_back(8);

        assert((v1 == immer::array<int>{1}));
        assert((v2 == immer::array<int>{1, 8}));
        // include:push-back/end
    }

    {
        // include:set/start
        auto v1 = immer::array<int>{1, 2, 3};
        auto v2 = v1.set(0, 5);

        assert((v1 == immer::array<int>{1, 2, 3}));
        assert((v2 == immer::array<int>{5, 2, 3}));
        // include:set/end
    }

    {
        // include:update/start
        auto v1 = immer::array<int>{1, 2, 3, 4};
        auto v2 = v1.update(2, [&](auto l) { return ++l; });

        assert((v1 == immer::array<int>{1, 2, 3, 4}));
        assert((v2 == immer::array<int>{1, 2, 4, 4}));
        // include:update/end
    }

    {
        // include:take/start
        auto v1 = immer::array<int>{1, 2, 3, 4, 5, 6};
        auto v2 = v1.take(3);

        assert((v1 == immer::array<int>{1, 2, 3, 4, 5, 6}));
        assert((v2 == immer::array<int>{1, 2, 3}));
        // include:take/end
    }
}