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
|
//
// 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/experimental/dvektor.hpp>
#include <boost/range/adaptors.hpp>
#include <algorithm>
#include <numeric>
#include <vector>
#include <iostream>
#include <doctest.h>
using namespace immer;
TEST_CASE("instantiation")
{
auto v = dvektor<int>{};
CHECK(v.size() == 0u);
}
TEST_CASE("push back one element")
{
SUBCASE("one element")
{
const auto v1 = dvektor<int>{};
auto v2 = v1.push_back(42);
CHECK(v1.size() == 0u);
CHECK(v2.size() == 1u);
CHECK(v2[0] == 42);
}
SUBCASE("many elements")
{
const auto n = 666u;
auto v = dvektor<unsigned>{};
for (auto i = 0u; i < n; ++i) {
v = v.push_back(i * 10);
CHECK(v.size() == i + 1);
for (auto j = 0u; j < v.size(); ++j)
CHECK(i + v[j] == i + j * 10);
}
}
}
TEST_CASE("update")
{
const auto n = 42u;
auto v = dvektor<unsigned>{};
for (auto i = 0u; i < n; ++i)
v = v.push_back(i);
SUBCASE("assoc")
{
const auto u = v.assoc(3u, 13u);
CHECK(u.size() == v.size());
CHECK(u[2u] == 2u);
CHECK(u[3u] == 13u);
CHECK(u[4u] == 4u);
CHECK(u[40u] == 40u);
CHECK(v[3u] == 3u);
}
SUBCASE("assoc further")
{
for (auto i = n; i < 666; ++i)
v = v.push_back(i);
auto u = v.assoc(3u, 13u);
u = u.assoc(200u, 7u);
CHECK(u.size() == v.size());
CHECK(u[2u] == 2u);
CHECK(u[4u] == 4u);
CHECK(u[40u] == 40u);
CHECK(u[600u] == 600u);
CHECK(u[3u] == 13u);
CHECK(u[200u] == 7u);
CHECK(v[3u] == 3u);
CHECK(v[200u] == 200u);
}
SUBCASE("assoc further more")
{
auto v = immer::dvektor<unsigned, 4>{};
for (auto i = n; i < 1000u; ++i)
v = v.push_back(i);
for (auto i = 0u; i < v.size(); ++i) {
v = v.assoc(i, i + 1);
CHECK(v[i] == i + 1);
}
}
SUBCASE("update")
{
const auto u = v.update(10u, [](auto x) { return x + 10; });
CHECK(u.size() == v.size());
CHECK(u[10u] == 20u);
CHECK(v[40u] == 40u);
const auto w = v.update(40u, [](auto x) { return x - 10; });
CHECK(w.size() == v.size());
CHECK(w[40u] == 30u);
CHECK(v[40u] == 40u);
}
}
#if IMMER_SLOW_TESTS
TEST_CASE("big")
{
const auto n = 1000000;
auto v = dvektor<unsigned>{};
for (auto i = 0u; i < n; ++i)
v = v.push_back(i);
SUBCASE("read")
{
for (auto i = 0u; i < n; ++i)
CHECK(v[i] == i);
}
SUBCASE("assoc")
{
for (auto i = 0u; i < n; ++i) {
v = v.assoc(i, i + 1);
CHECK(v[i] == i + 1);
}
}
}
#endif // IMMER_SLOW_TESTS
TEST_CASE("iterator")
{
const auto n = 666u;
auto v = dvektor<unsigned>{};
for (auto i = 0u; i < n; ++i)
v = v.push_back(i);
SUBCASE("works with range loop")
{
auto i = 0u;
for (const auto& x : v)
CHECK(x == i++);
CHECK(i == v.size());
}
SUBCASE("works with standard algorithms")
{
auto s = std::vector<unsigned>(n);
std::iota(s.begin(), s.end(), 0u);
std::equal(v.begin(), v.end(), s.begin(), s.end());
}
SUBCASE("can go back from end") { CHECK(n - 1 == *--v.end()); }
SUBCASE("works with reversed range adaptor")
{
auto r = v | boost::adaptors::reversed;
auto i = n;
for (const auto& x : r)
CHECK(x == --i);
}
SUBCASE("works with strided range adaptor")
{
auto r = v | boost::adaptors::strided(5);
auto i = 0u;
for (const auto& x : r)
CHECK(x == 5 * i++);
}
SUBCASE("works reversed")
{
auto i = n;
for (auto iter = v.rbegin(), last = v.rend(); iter != last; ++iter)
CHECK(*iter == --i);
}
SUBCASE("advance and distance")
{
auto i1 = v.begin();
auto i2 = i1 + 100;
CHECK(*i2 == 100u);
CHECK(i2 - i1 == 100);
CHECK(*(i2 - 50) == 50u);
CHECK((i2 - 30) - i2 == -30);
}
}
|
