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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
// SPDX-FileCopyrightText: 2018 - 2025 Kohei Yoshida
//
// SPDX-License-Identifier: MIT
#ifndef INCLUDED_MDDS_TEST_GLOBAL_RTREE_HPP
#define INCLUDED_MDDS_TEST_GLOBAL_RTREE_HPP
#define MDDS_RTREE_DEBUG 1
#include <mdds/rtree.hpp>
#include <fstream>
struct tiny_trait_1d
{
constexpr static size_t dimensions = 1;
constexpr static size_t min_node_size = 2;
constexpr static size_t max_node_size = 5;
constexpr static size_t max_tree_depth = 100;
constexpr static bool enable_forced_reinsertion = false;
constexpr static size_t reinsertion_size = 2;
};
struct tiny_trait_2d
{
constexpr static size_t dimensions = 2;
constexpr static size_t min_node_size = 2;
constexpr static size_t max_node_size = 5;
constexpr static size_t max_tree_depth = 100;
constexpr static bool enable_forced_reinsertion = false;
constexpr static size_t reinsertion_size = 2;
};
struct tiny_trait_2d_forced_reinsertion
{
constexpr static size_t dimensions = 2;
constexpr static size_t min_node_size = 2;
constexpr static size_t max_node_size = 5;
constexpr static size_t max_tree_depth = 100;
constexpr static bool enable_forced_reinsertion = true;
constexpr static size_t reinsertion_size = 2;
};
class only_movable
{
double m_value;
public:
only_movable() : m_value(0.0)
{}
only_movable(double v) : m_value(v)
{}
only_movable(const only_movable&) = delete;
only_movable(only_movable&& other) : m_value(other.m_value)
{
other.m_value = 0.0;
}
double get() const
{
return m_value;
}
};
class only_copyable
{
double m_value;
public:
only_copyable() : m_value(0.0)
{}
only_copyable(double v) : m_value(v)
{}
only_copyable(const only_copyable& other) : m_value(other.m_value)
{}
only_copyable(only_copyable&&) = delete;
void set(double v)
{
m_value = v;
}
double get() const
{
return m_value;
}
};
template<typename T>
void export_tree(const T& tree, const std::string& basename)
{
{
std::ofstream fout(basename + ".obj");
fout << tree.export_tree(T::export_tree_type::extent_as_obj);
}
{
std::ofstream fout(basename + ".svg");
fout << tree.export_tree(T::export_tree_type::extent_as_svg);
}
}
void rtree_test_intersection();
void rtree_test_square_distance();
void rtree_test_center_point();
void rtree_test_area_enlargement();
void rtree_test_basic_search();
void rtree_test_basic_erase();
void rtree_test_node_split();
void rtree_test_directory_node_split();
void rtree_test_erase_directories();
void rtree_test_forced_reinsertion();
void rtree_test_move();
void rtree_test_move_custom_type();
void rtree_test_copy();
void rtree_test_point_objects();
void rtree_test_only_copyable();
void rtree_test_exact_search_by_extent();
void rtree_test_exact_search_by_point();
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
