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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
// SPDX-FileCopyrightText: 2020 - 2025 Kohei Yoshida
//
// SPDX-License-Identifier: MIT
#include <mdds/rtree.hpp>
#include <string>
#include <iostream>
int main() try
{
//!code-start: remove-value
using rt_type = mdds::rtree<int, std::string>;
rt_type tree;
// Insert multiple values at the same point.
tree.insert({1, 1}, "A");
tree.insert({1, 1}, "B");
tree.insert({1, 1}, "C");
tree.insert({1, 1}, "D");
tree.insert({1, 1}, "E");
// This should return all five values.
auto results = tree.search({1, 1}, rt_type::search_type::match);
for (const std::string& v : results)
std::cout << v << std::endl;
// Erase "C".
for (auto it = results.begin(); it != results.end(); ++it)
{
if (*it == "C")
{
tree.erase(it);
break; // This invalidates the iterator. Bail out.
}
}
std::cout << "'C' has been erased." << std::endl;
// Now this should only return A, B, D and E.
results = tree.search({1, 1}, rt_type::search_type::match);
for (const std::string& v : results)
std::cout << v << std::endl;
//!code-end: remove-value
return EXIT_SUCCESS;
}
catch (...)
{
return EXIT_FAILURE;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
