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
|
#include <catch.hpp>
#include <iostream>
#include "../lib/union_find.hpp"
namespace terraces {
namespace tests {
TEST_CASE("union_find1", "[union_find]") {
auto fl = utils::free_list{};
auto alloc = utils::stack_allocator<index_t>{fl, 3};
union_find leaves(3, alloc);
leaves.merge(0, 1);
CHECK(leaves.find(0) == leaves.find(1));
CHECK(leaves.find(2) == 2);
}
TEST_CASE("union_find2", "[union_find]") {
auto fl = utils::free_list{};
auto alloc = utils::stack_allocator<index_t>{fl, 5};
union_find leaves(5, alloc);
leaves.merge(0, 1);
leaves.merge(1, 4);
CHECK(leaves.find(0) == leaves.find(1));
CHECK(leaves.find(1) == leaves.find(4));
CHECK(leaves.find(2) == 2);
CHECK(leaves.find(3) == 3);
}
TEST_CASE("union_find::make_bipartition", "[union_find]") {
auto fl = utils::free_list{};
auto alloc = utils::stack_allocator<index_t>{fl, 8};
std::vector<bool> b1{1, 0, 1, 1, 0, 1, 0, 0};
std::vector<bool> b2{0, 1, 1, 1, 0, 0, 0, 0};
std::vector<bool> b3{1, 1, 1, 1, 1, 1, 1, 1};
auto check = [&](const std::vector<bool>& vec) {
auto uf = union_find::make_bipartition(vec, alloc);
auto i0 = std::distance(vec.begin(), std::find(vec.begin(), vec.end(), 0));
auto i1 = std::distance(vec.begin(), std::find(vec.begin(), vec.end(), 1));
for (index_t i = 0; i < uf.size(); ++i) {
CHECK(uf.find(i) == uf.find(vec[i] ? i1 : i0));
}
};
check(b1);
check(b2);
check(b3);
}
} // namespace tests
} // namespace terraces
|
