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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
/**********************************************************************
* $Id: QuadTreeNodeBase.cpp,v 1.10 2004/11/01 16:43:04 strk Exp $
*
* GEOS - Geometry Engine Open Source
* http://geos.refractions.net
*
* Copyright (C) 2001-2002 Vivid Solutions Inc.
*
* This is free software; you can redistribute and/or modify it under
* the terms of the GNU Lesser General Public Licence as published
* by the Free Software Foundation.
* See the COPYING file for more information.
*
**********************************************************************/
#include <geos/indexQuadtree.h>
#ifndef DEBUG
#define DEBUG 0
#endif
namespace geos {
/**
* Returns the index of the subquad that wholly contains the given envelope.
* If none does, returns -1.
*/
int
QuadTreeNodeBase::getSubnodeIndex(const Envelope *env, const Coordinate *centre)
{
int subnodeIndex=-1;
if (env->getMinX()>=centre->x) {
if (env->getMinY()>=centre->y) subnodeIndex=3;
if (env->getMaxY()<=centre->y) subnodeIndex=1;
}
if (env->getMaxX()<=centre->x) {
if (env->getMinY()>=centre->y) subnodeIndex=2;
if (env->getMaxY()<=centre->y) subnodeIndex=0;
}
#if DEBUG
cerr<<"getSubNodeIndex("<<env->toString()<<", "<<centre->toString()<<") returning "<<subnodeIndex<<endl;
#endif
return subnodeIndex;
}
QuadTreeNodeBase::QuadTreeNodeBase() {
items=new vector<void*>();
subnode[0]=NULL;
subnode[1]=NULL;
subnode[2]=NULL;
subnode[3]=NULL;
}
QuadTreeNodeBase::~QuadTreeNodeBase() {
delete subnode[0];
delete subnode[1];
delete subnode[2];
delete subnode[3];
subnode[0]=NULL;
subnode[1]=NULL;
subnode[2]=NULL;
subnode[3]=NULL;
delete items;
}
vector<void*>* QuadTreeNodeBase::getItems() {
return items;
}
void QuadTreeNodeBase::add(void* item) {
items->push_back(item);
//DEBUG itemCount++;
//DEBUG System.out.print(itemCount);
}
vector<void*>*
QuadTreeNodeBase::addAllItems(vector<void*> *resultItems)
{
//<<TODO:ASSERT?>> Can we assert that this node cannot have both items
//and subnodes? [Jon Aquino]
resultItems->insert(resultItems->end(),items->begin(),items->end());
for(int i=0;i<4;i++) {
if (subnode[i]!=NULL) {
subnode[i]->addAllItems(resultItems);
}
}
return resultItems;
}
void
QuadTreeNodeBase::addAllItemsFromOverlapping(const Envelope *searchEnv, vector<void*> *resultItems)
{
if (!isSearchMatch(searchEnv))
return;
//<<TODO:ASSERT?>> Can we assert that this node cannot have both items
//and subnodes? [Jon Aquino]
resultItems->insert(resultItems->end(),items->begin(),items->end());
for(int i=0;i<4;i++) {
if (subnode[i]!=NULL) {
subnode[i]->addAllItemsFromOverlapping(searchEnv,resultItems);
}
}
}
//<<TODO:RENAME?>> In Samet's terminology, I think what we're returning here is
//actually level+1 rather than depth. (See p. 4 of his book) [Jon Aquino]
int QuadTreeNodeBase::depth() {
int maxSubDepth=0;
for(int i=0;i<4;i++) {
if (subnode[i]!=NULL) {
int sqd=subnode[i]->depth();
if (sqd>maxSubDepth)
maxSubDepth=sqd;
}
}
return maxSubDepth+1;
}
//<<TODO:RENAME?>> "size" is a bit generic. How about "itemCount"? [Jon Aquino]
int QuadTreeNodeBase::size() {
int subSize=0;
for(int i=0;i<4;i++) {
if (subnode[i]!=NULL) {
subSize+=subnode[i]->size();
}
}
return subSize+(int)items->size();
}
//<<TODO:RENAME?>> The Java Language Specification recommends that "Methods to
//get and set an attribute that might be thought of as a variable V should be
//named getV and setV" (6.8.3). Perhaps this and other methods should be
//renamed to "get..."? [Jon Aquino]
int QuadTreeNodeBase::nodeCount() {
int subSize=0;
for(int i=0;i<4;i++) {
if (subnode[i]!=NULL) {
subSize+=subnode[i]->size();
}
}
return subSize+1;
}
string
QuadTreeNodeBase::toString() const
{
char buf[10];
sprintf(buf, "%d", items->size());
string tmp = buf;
string ret = "ITEMS:"+tmp+"\n";
for (int i=0; i<4; i++)
{
sprintf(buf, "%d", i);
tmp = buf;
ret += "subnode["+tmp+"]";
if ( subnode[i] == NULL ) ret += "NULL";
else ret += subnode[i]->toString();
ret += "\n";
}
return ret;
}
} // namespace geos
/**********************************************************************
* $Log: QuadTreeNodeBase.cpp,v $
* Revision 1.10 2004/11/01 16:43:04 strk
* Added Profiler code.
* Temporarly patched a bug in DoubleBits (must check drawbacks).
* Various cleanups and speedups.
*
* Revision 1.9 2004/07/27 16:35:46 strk
* Geometry::getEnvelopeInternal() changed to return a const Envelope *.
* This should reduce object copies as once computed the envelope of a
* geometry remains the same.
*
* Revision 1.8 2004/07/02 13:28:27 strk
* Fixed all #include lines to reflect headers layout change.
* Added client application build tips in README.
*
* Revision 1.7 2003/11/07 01:23:42 pramsey
* Add standard CVS headers licence notices and copyrights to all cpp and h
* files.
*
*
**********************************************************************/
|
