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
|
/* -*- 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/point_quad_tree.hpp>
#include <string>
#include <iostream>
using std::cout;
using std::endl;
int main() try
{
typedef ::mdds::point_quad_tree<double, std::string> db_type;
db_type db;
std::string chicago("Chicago");
std::string hamburg("Hamburg");
std::string helsinki("Helsinki");
std::string london("London");
std::string paris("Paris");
std::string prague("Prague");
std::string shanghai("Shanghai");
std::string tokyo("Tokyo");
// insert cities by longitude and latitude.
db.insert(-87.755280, 41.784168, chicago);
db.insert(10.000000, 53.633331, hamburg);
db.insert(25.049999, 60.250000, helsinki);
db.insert(-0.450000, 51.483334, london);
db.insert(2.450000, 48.966667, paris);
db.insert(14.250000, 50.099998, prague);
db.insert(121.433334, 31.166668, shanghai);
db.insert(139.850006, 35.633331, tokyo);
// Perform region search.
db_type::search_results results = db.search_region(100, 30, 140, 40);
// Print out the result of the search.
cout << "Cities located between longitudes 100 and 140 east and latitudes 30 and 40 north are:" << endl;
for (const auto& res : results)
{
cout << " " << res.second
<< ": (latitude=" << res.first.x
<< ", longitude=" << res.first.y << ")" << endl;
}
}
catch (...)
{
return EXIT_FAILURE;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
