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
|
// Copyright 2015, Tobias Hermann and the FunctionalPlus contributors.
// https://github.com/Dobiasd/FunctionalPlus
// Distributed under 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)
#define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
#include "doctest/doctest.h"
#include <fplus/fplus.hpp>
namespace {
typedef std::pair<int, int> IntPair;
typedef std::vector<int> IntVector;
typedef std::vector<IntPair> IntPairVector;
typedef fplus::tree<IntPair> IntPairTree;
typedef fplus::tree<int> IntTree;
typedef std::vector<IntPairTree> IntPairTreeVector;
}
TEST_CASE("tree_test, are_trees_equal")
{
using namespace fplus;
const IntPairTree a =
{{0, 8}, {
{{0, 4}, {}},
{{5, 7}, {}}}};
const IntPairTree b =
{{0, 8}, {
{{5, 7}, {}},
{{0, 4}, {}}}};
REQUIRE(are_trees_equal(a, b));
}
TEST_CASE("tree_test, sequence_to_tree small")
{
using namespace fplus;
IntPairVector elems = {
{0, 4},
{0, 8},
{5, 7}
};
const auto is_child_of = [](const IntPair& a, const IntPair& b) -> bool
{
return a.first >= b.first && a.second <= b.second;
};
const auto result_1 = trees_from_sequence(is_child_of, elems);
const auto result_2 = trees_from_sequence(is_child_of, fplus::shuffle(0, elems));
const IntPairTreeVector result = {
{{0, 8}, {
{{0, 4}, {}},
{{5, 7}, {}}}}
};
REQUIRE_EQ(result_1.size(), result_2.size());
REQUIRE(all(zip_with(are_trees_equal<IntPair>, result_1, result_2)));
REQUIRE_EQ(result_1.size(), result.size());
REQUIRE(all(zip_with(are_trees_equal<IntPair>, result_1, result)));
}
TEST_CASE("tree_test, sequence_to_tree medium")
{
using namespace fplus;
IntPairVector elems = {
{0, 4},
{0, 8},
{5, 7},
{9, 10},
{12, 13},
{9, 17},
{11, 15},
{13, 14},
{8, 20}
};
const auto is_child_of = [](const IntPair& a, const IntPair& b) -> bool
{
return a.first >= b.first && a.second <= b.second;
};
const auto result_1 = trees_from_sequence(is_child_of, elems);
const auto result_2 = trees_from_sequence(is_child_of, fplus::shuffle(0, elems));
const IntPairTreeVector result = {
{{0, 8}, {
{{0, 4}, {}},
{{5, 7}, {}}
}},
{{8, 20}, {
{{9, 17}, {
{{9, 10}, {}},
{{11, 15}, {
{{12, 13}, {}},
{{13, 14}, {}}
}}
}},
}},
};
REQUIRE_EQ(result_1.size(), result_2.size());
REQUIRE(all(zip_with(are_trees_equal<IntPair>, result_1, result_2)));
REQUIRE_EQ(result_1.size(), result.size());
REQUIRE(all(zip_with(are_trees_equal<IntPair>, result_1, result)));
}
TEST_CASE("tree_test, tree_depth")
{
const IntTree t =
{{0}, {
{{1}, {
{{2}, {
}},
{{3}, {
{{4}, {
}},
{{5}, {
}}
}},
{{6}, {
}}
}},
{{7}, {
}},
{{8}, {
}}
}};
REQUIRE_EQ(tree_depth(t), 4);
}
TEST_CASE("tree_test, flatten_tree_depth_first")
{
const IntTree t =
{{0}, {
{{1}, {
{{2}, {
}},
{{3}, {
{{4}, {
}},
{{5}, {
}}
}},
{{6}, {
}}
}},
{{7}, {
}},
{{8}, {
}}
}};
REQUIRE_EQ(flatten_tree_depth_first(t), IntVector({0,1,2,3,4,5,6,7,8}));
}
TEST_CASE("tree_test, flatten_tree_breadth_first")
{
const IntTree t =
{{0}, {
{{1}, {
{{4}, {
}},
{{5}, {
{{7}, {
}},
{{8}, {
}}
}},
{{6}, {
}}
}},
{{2}, {
}},
{{3}, {
}}
}};
REQUIRE_EQ(flatten_tree_breadth_first(t), IntVector({0,1,2,3,4,5,6,7,8}));
}
|
