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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* Copyright (c) 2020 Kohei Yoshida
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights to use,
* copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following
* conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*
************************************************************************/
#include <mdds/rtree.hpp>
#include <string>
#include <iostream>
int main() try
{
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;
return EXIT_SUCCESS;
}
catch (...)
{
return EXIT_FAILURE;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
