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
|
//
// 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/algorithm.hpp>
#include <immer/box.hpp>
#include <immer/flex_vector.hpp>
#include <immer/map.hpp>
#include <immer/set.hpp>
#include <immer/vector.hpp>
#include <boost/optional.hpp>
#include <boost/variant.hpp>
#include <catch2/catch_test_macros.hpp>
struct rec_vec
{
int data;
immer::vector<immer::box<rec_vec>> children;
};
TEST_CASE("recursive vector")
{
auto v1 = rec_vec{42,
{rec_vec{12, {}},
rec_vec{13, {rec_vec{5, {}}, rec_vec{7, {}}}},
rec_vec{15, {}}}};
CHECK(v1.data == 42);
CHECK(v1.children[0]->data == 12);
CHECK(v1.children[1]->children[0]->data == 5);
}
struct rec_fvec
{
int data;
immer::flex_vector<immer::box<rec_fvec>> children;
};
TEST_CASE("recursive flex_vector")
{
auto v1 = rec_fvec{42,
{rec_fvec{12, {}},
rec_fvec{13, {rec_fvec{5, {}}, rec_fvec{7, {}}}},
rec_fvec{15, {}}}};
CHECK(v1.data == 42);
CHECK(v1.children[0]->data == 12);
CHECK(v1.children[1]->children[0]->data == 5);
}
struct rec_map
{
int data;
immer::map<std::string, immer::box<rec_map>> children;
};
TEST_CASE("recursive map")
{
auto v1 = rec_map{42, {}};
auto v2 = rec_map{43, v1.children.set("hello", rec_map{12, {}})};
auto v3 = rec_map{44, v2.children.set("world", rec_map{13, {}})};
CHECK(v3.data == 44);
CHECK(v3.children["hello"]->data == 12);
CHECK(v3.children["world"]->data == 13);
}
struct rec_set
{
int data;
immer::set<immer::box<rec_set>> children;
bool operator==(const rec_set& other) const
{
return data == other.data && children == other.children;
}
bool operator!=(const rec_set& other) const { return !(*this == other); }
};
namespace std {
template <>
struct hash<rec_set>
{
auto operator()(const rec_set& s)
{
return std::hash<decltype(s.data)>{}(s.data) ^
immer::accumulate(
s.children, std::size_t{}, [](auto ac, auto v) {
return std::hash<decltype(v)>{}(v);
});
}
};
} // namespace std
TEST_CASE("recursive set")
{
auto v1 = rec_set{42, {}};
auto v2 = rec_set{43, v1.children.insert(rec_set{12, {}})};
auto v3 = rec_set{44, v2.children.insert(rec_set{13, {}})};
CHECK(v3.data == 44);
CHECK(v3.children.count(rec_set{12, {}}) == 1);
CHECK(v3.children.count(rec_set{13, {}}) == 1);
CHECK(v3.children.count(rec_set{14, {}}) == 0);
}
namespace example1 {
struct a_type;
struct b_type
{
b_type(int a, immer::box<a_type> val);
int a;
immer::box<a_type> val;
};
struct a_type
{
a_type();
// this does not work with std::optional, because it seems like
// `immer::box<b_type>` is still not considered complete at this point...
boost::optional<immer::box<b_type>> b;
};
b_type::b_type(int a, immer::box<a_type> val)
: a(a)
, val(val)
{
}
a_type::a_type()
: b{}
{
}
} // namespace example1
TEST_CASE("recursive optional")
{
auto x = example1::a_type{};
auto y = example1::b_type{42, x};
CHECK(y.a == 42);
}
namespace example2 {
struct empty_t
{};
struct a_type;
struct b_type
{
b_type(int a, immer::box<a_type> val);
int a;
immer::box<a_type> val;
};
struct a_type
{
a_type();
// this does not work with std::variant, because it seems like
// `immer::box<b_type>` is still not considered complete at this point...
boost::variant<empty_t, b_type> b;
};
b_type::b_type(int a, immer::box<a_type> val)
: a(a)
, val(val)
{
}
a_type::a_type()
: b{}
{
}
} // namespace example2
TEST_CASE("recursive variant")
{
auto x = example2::a_type{};
auto y = example2::b_type{42, x};
CHECK(y.a == 42);
}
|
