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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
// SPDX-FileCopyrightText: 2021 - 2025 Kohei Yoshida
//
// SPDX-License-Identifier: MIT
#include "test_global.hpp" // This must be the first header to be included.
#include "test_global_rtree.hpp"
using mdds::rtree;
using std::cout;
using std::endl;
void rtree_test_move()
{
MDDS_TEST_FUNC_SCOPE;
using rt_type = rtree<int16_t, std::string, tiny_trait_2d_forced_reinsertion>;
rt_type::integrity_check_properties check_props;
check_props.throw_on_first_error = false;
rt_type tree;
for (int16_t x = 0; x < 5; ++x)
{
for (int16_t y = 0; y < 5; ++y)
{
std::ostringstream os;
int16_t x2 = x * 2;
int16_t y2 = y * 2;
os << "(x=" << x2 << ",y=" << y2 << ")";
std::string v = os.str();
int16_t xe = x2 + 2, ye = y2 + 2;
tree.insert({{x2, y2}, {xe, ye}}, std::move(v));
}
}
tree.check_integrity(check_props);
TEST_ASSERT(tree.size() == 25);
// moved via constructor.
rt_type tree_moved(std::move(tree));
tree.check_integrity(check_props);
tree_moved.check_integrity(check_props);
TEST_ASSERT(tree.empty());
TEST_ASSERT(tree.size() == 0);
TEST_ASSERT(tree_moved.size() == 25);
// moved via assignment operator.
rt_type tree_moved_2;
tree_moved_2.check_integrity(check_props);
tree_moved_2 = std::move(tree_moved);
tree_moved.check_integrity(check_props);
tree_moved_2.check_integrity(check_props);
TEST_ASSERT(tree_moved.empty());
TEST_ASSERT(tree_moved.size() == 0);
TEST_ASSERT(tree_moved_2.size() == 25);
}
/**
* Make sure we can 1) store objects that are only movable but not copyable,
* and 2) the whole tree can still be moved.
*/
void rtree_test_move_custom_type()
{
MDDS_TEST_FUNC_SCOPE;
using rt_type = rtree<double, only_movable, tiny_trait_2d_forced_reinsertion>;
using point_type = rt_type::point_type;
rt_type::integrity_check_properties check_props;
check_props.throw_on_first_error = false;
{
// Make sure you can actually move an object of this type.
only_movable v1(1.5);
only_movable v2(std::move(v1));
}
struct input
{
point_type start;
point_type end;
double value;
};
std::vector<input> inputs = {
{{0.0, 0.0}, {1.0, 1.0}, 1.0}, {{2.0, 2.0}, {2.1, 2.1}, 2.4}, {{100.0, 80.0}, {101.0, 85.0}, 100.0},
{{1.0, 75.0}, {2.0, 78.0}, 65.0}, {{1.0, 80.0}, {2.0, 82.0}, 68.0}, {{1.2, 1.0}, {2.2, 1.5}, 2.1},
{{2.2, 2.2}, {2.3, 2.4}, 3.5}, {{3.0, 3.0}, {3.3, 3.4}, 3.8}, {{4.0, 4.0}, {8.3, 12.4}, 13.8},
{{3.0, 5.0}, {4.3, 11.4}, 13.9},
};
rt_type tree;
for (const input& i : inputs)
tree.insert({i.start, i.end}, only_movable(i.value));
TEST_ASSERT(tree.size() == inputs.size());
tree.check_integrity(check_props);
export_tree(tree, "rtree-test-move-custom-type");
// Now move the tree.
rt_type tree_moved = std::move(tree);
tree.check_integrity(check_props);
tree_moved.check_integrity(check_props);
TEST_ASSERT(tree.empty());
TEST_ASSERT(tree_moved.size() == inputs.size());
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
