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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
|
#pragma once
/*
copyright 2009
"James Michael Dupont (H4ck3rm1k3)" <jamesmikedupont@gmail.com>
http://www.fsf.org/licensing/licenses/agpl-3.0.html
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <sdbx/RTree.h>
#include <sdbx/MemoryTreeBackend.h>
#include "RTreeWorld.hpp"
BoundingBox bounds(BBox b)
{
BoundingBox bb;
// 0 is the lat axis
bb.edges[0].first = b.min.lat();
bb.edges[0].second = b.max.lat();
// 1 is the lon axist
bb.edges[1].first = b.min.lon();
bb.edges[1].second = b.max.lon();
// cerr << "adding bbox " << b << endl;
// cerr << "adding bbox " << bb << endl;
return bb;
}
class BBOXRTreeWayProcessor : public WayProcessor<RTreeWorld>
{
public:
// the bounding box of the current object
// the number of nds in the current way
int ndcount;
char output_way;
char output_refs;
char report_other_ways;
BBox box;
BBOXRTreeWayProcessor( RTreeWorld & rWorld)
:WayProcessor<RTreeWorld> (rWorld),
output_way(0),
ndcount(0),
output_refs(0),
report_other_ways(0)
{}
void startElement(const XMLCh* const uri, const XMLCh* const localnameXML, const XMLCh* const qname, const Attributes& attrs)
{
Processor<RTreeWorld>::startElement(uri,localnameXML, qname, attrs);
// cerr << "localname" << ;
Processor<RTreeWorld>::current_id = getId(attrs);
// current_type = 'w'; // way
// now we want the counties
// string name = getAttrStr(attrs,szNAME);
// string admin_level = getAttrStr(attrs,OSM::szADMIN_LEVEL);
// name << ", admin_level:"<< admin_level
//start(current_id);
ndcount=0;
if (output_way)
cout << "way: " << current_id << endl;
current_interesting=1;// all ways are interesting
}
void endElement( const XMLCh * const uri,const XMLCh * const localName,const XMLCh * const qname )
{
if (current_interesting)
{
// cout << "end element";
if (XMLString::equals(localName,OSM::szWAY))
{
cout << "type:" << getCurrentType() << " current_id :" << current_id << " name: " << current_name;
if (ndcount)
{
cout << " ndcount:" << ndcount;
cout << " box :" << box;
int ok = world.tree.Insert( bounds( box ), current_id);
if (!ok)
{
cerr << "Insert failed!" <<endl;
}
ndcount=0;
box.reset();
current_interesting=0;
}
cout << endl;
}
else
{
if (report_other_ways)
{
cout << "ERRORnot interesting type:WAY" << " current_id :" << current_id << " name: " << current_name;
cout << endl;
}
}
}
}
void startND(const XMLCh* const uri, const XMLCh* const localnameXML, const XMLCh* const qname, const Attributes& attrs)
{
// WE SHOULD MOVE this into the Way::Nd::Process function
// attribute ref
int ref = getAttrInt(attrs,OSM::szREF);
RTreeWorld::TMapIDCoord::iterator i = world.node_id_coord.lower_bound(ref);
if ((i != world.node_id_coord.end() ) && ( i->first == ref))
{
add_nd(i->first,i->second);
}
else
{
if (output_missing)
cerr << "MISSING: " << ref << endl;
}
}
void add_nd(int ref,const RTreeWorld::TCoordData & data)
{
ndcount++;
box.add(data);
// if(ndcount==1)
// {
// cout << "ref: " << ref << " -> " << data << endl ;
// }
if (output_refs)
{
cout << "ref: " << ref << " -> " << data << endl ;
}
}
};
|