1 | // License: GPL. For details, see LICENSE file.
|
---|
2 | package org.openstreetmap.josm.data.osm;
|
---|
3 |
|
---|
4 | import java.util.ArrayList;
|
---|
5 | import java.util.Arrays;
|
---|
6 | import java.util.Collection;
|
---|
7 | import java.util.Iterator;
|
---|
8 | import java.util.List;
|
---|
9 |
|
---|
10 | import org.openstreetmap.josm.Main;
|
---|
11 | import org.openstreetmap.josm.data.coor.LatLon;
|
---|
12 | import org.openstreetmap.josm.data.coor.QuadTiling;
|
---|
13 |
|
---|
14 | /**
|
---|
15 | * Note: bbox of primitives added to QuadBuckets has to stay the same. In case of coordinate change, primitive must
|
---|
16 | * be removed and readded.
|
---|
17 | *
|
---|
18 | * This class is (no longer) thread safe.
|
---|
19 | *
|
---|
20 | */
|
---|
21 | public class QuadBuckets<T extends OsmPrimitive> implements Collection<T> {
|
---|
22 | private static final boolean consistency_testing = false;
|
---|
23 | private static final int NW_INDEX = 1;
|
---|
24 | private static final int NE_INDEX = 3;
|
---|
25 | private static final int SE_INDEX = 2;
|
---|
26 | private static final int SW_INDEX = 0;
|
---|
27 |
|
---|
28 | static void abort(String s) {
|
---|
29 | throw new AssertionError(s);
|
---|
30 | }
|
---|
31 |
|
---|
32 | public static final int MAX_OBJECTS_PER_LEVEL = 16;
|
---|
33 |
|
---|
34 | static class QBLevel<T extends OsmPrimitive> {
|
---|
35 | private final int level;
|
---|
36 | private final int index;
|
---|
37 | private final BBox bbox;
|
---|
38 | private final long quad;
|
---|
39 | private final QBLevel<T> parent;
|
---|
40 | private boolean isLeaf = true;
|
---|
41 |
|
---|
42 | private List<T> content;
|
---|
43 | // child order by index is sw, nw, se, ne
|
---|
44 | private QBLevel<T> nw, ne, sw, se;
|
---|
45 |
|
---|
46 | private final QuadBuckets<T> buckets;
|
---|
47 |
|
---|
48 | private QBLevel<T> getChild(int index) {
|
---|
49 | switch (index) {
|
---|
50 | case NE_INDEX:
|
---|
51 | if (ne == null) {
|
---|
52 | ne = new QBLevel<>(this, index, buckets);
|
---|
53 | }
|
---|
54 | return ne;
|
---|
55 | case NW_INDEX:
|
---|
56 | if (nw == null) {
|
---|
57 | nw = new QBLevel<>(this, index, buckets);
|
---|
58 | }
|
---|
59 | return nw;
|
---|
60 | case SE_INDEX:
|
---|
61 | if (se == null) {
|
---|
62 | se = new QBLevel<>(this, index, buckets);
|
---|
63 | }
|
---|
64 | return se;
|
---|
65 | case SW_INDEX:
|
---|
66 | if (sw == null) {
|
---|
67 | sw = new QBLevel<>(this, index, buckets);
|
---|
68 | }
|
---|
69 | return sw;
|
---|
70 | default:
|
---|
71 | return null;
|
---|
72 | }
|
---|
73 | }
|
---|
74 |
|
---|
75 | @SuppressWarnings("unchecked")
|
---|
76 | private QBLevel<T>[] getChildren() {
|
---|
77 | return new QBLevel[] {sw, nw, se, ne};
|
---|
78 | }
|
---|
79 |
|
---|
80 | @Override
|
---|
81 | public String toString() {
|
---|
82 | return super.toString() + "[" + level + "]: " + bbox();
|
---|
83 | }
|
---|
84 |
|
---|
85 | /**
|
---|
86 | * Constructor for root node
|
---|
87 | */
|
---|
88 | public QBLevel(final QuadBuckets<T> buckets) {
|
---|
89 | level = 0;
|
---|
90 | index = 0;
|
---|
91 | quad = 0;
|
---|
92 | parent = null;
|
---|
93 | bbox = new BBox(-180, 90, 180, -90);
|
---|
94 | this.buckets = buckets;
|
---|
95 | }
|
---|
96 |
|
---|
97 | public QBLevel(QBLevel<T> parent, int parent_index, final QuadBuckets<T> buckets) {
|
---|
98 | this.parent = parent;
|
---|
99 | this.level = parent.level + 1;
|
---|
100 | this.index = parent_index;
|
---|
101 | this.buckets = buckets;
|
---|
102 |
|
---|
103 | int shift = (QuadTiling.NR_LEVELS - level) * 2;
|
---|
104 | long mult = 1;
|
---|
105 | // Java blows the big one. It seems to wrap when you shift by > 31
|
---|
106 | if (shift >= 30) {
|
---|
107 | shift -= 30;
|
---|
108 | mult = 1 << 30;
|
---|
109 | }
|
---|
110 | long this_quadpart = mult * (parent_index << shift);
|
---|
111 | this.quad = parent.quad | this_quadpart;
|
---|
112 | this.bbox = calculateBBox(); // calculateBBox reference quad
|
---|
113 | }
|
---|
114 |
|
---|
115 | private BBox calculateBBox() {
|
---|
116 | LatLon bottom_left = this.coor();
|
---|
117 | double lat = bottom_left.lat() + parent.height() / 2;
|
---|
118 | double lon = bottom_left.lon() + parent.width() / 2;
|
---|
119 | return new BBox(bottom_left.lon(), bottom_left.lat(), lon, lat);
|
---|
120 | }
|
---|
121 |
|
---|
122 | QBLevel<T> findBucket(BBox bbox) {
|
---|
123 | if (!hasChildren())
|
---|
124 | return this;
|
---|
125 | else {
|
---|
126 | int idx = bbox.getIndex(level);
|
---|
127 | if (idx == -1)
|
---|
128 | return this;
|
---|
129 | return getChild(idx).findBucket(bbox);
|
---|
130 | }
|
---|
131 | }
|
---|
132 |
|
---|
133 | boolean remove_content(T o) {
|
---|
134 | // If two threads try to remove item at the same time from different buckets of this QBLevel,
|
---|
135 | // it might happen that one thread removes bucket but don't remove parent because it still sees
|
---|
136 | // another bucket set. Second thread do the same. Due to thread memory caching, it's possible that
|
---|
137 | // changes made by threads will show up in children array too late, leading to QBLevel with all children
|
---|
138 | // set to null
|
---|
139 | if (content == null)
|
---|
140 | return false;
|
---|
141 | boolean ret = this.content.remove(o);
|
---|
142 | if (this.content.isEmpty()) {
|
---|
143 | this.content = null;
|
---|
144 | }
|
---|
145 | if (this.canRemove()) {
|
---|
146 | this.remove_from_parent();
|
---|
147 | }
|
---|
148 | return ret;
|
---|
149 | }
|
---|
150 |
|
---|
151 | /*
|
---|
152 | * There is a race between this and qb.nextContentNode().
|
---|
153 | * If nextContentNode() runs into this bucket, it may
|
---|
154 | * attempt to null out 'children' because it thinks this
|
---|
155 | * is a dead end.
|
---|
156 | */
|
---|
157 | void __split() {
|
---|
158 | List<T> tmpcontent = content;
|
---|
159 | content = null;
|
---|
160 |
|
---|
161 | for (T o : tmpcontent) {
|
---|
162 | int idx = o.getBBox().getIndex(level);
|
---|
163 | if (idx == -1) {
|
---|
164 | __add_content(o);
|
---|
165 | } else {
|
---|
166 | getChild(idx).doAdd(o);
|
---|
167 | }
|
---|
168 | }
|
---|
169 | isLeaf = false; // It's not enough to check children because all items could end up in this level (index == -1)
|
---|
170 | }
|
---|
171 |
|
---|
172 | boolean __add_content(T o) {
|
---|
173 | boolean ret = false;
|
---|
174 | // The split_lock will keep two concurrent calls from overwriting content
|
---|
175 | if (content == null) {
|
---|
176 | content = new ArrayList<>();
|
---|
177 | }
|
---|
178 | ret = content.add(o);
|
---|
179 | return ret;
|
---|
180 | }
|
---|
181 |
|
---|
182 | boolean matches(final T o, final BBox search_bbox) {
|
---|
183 | if (o instanceof Node){
|
---|
184 | final LatLon latLon = ((Node)o).getCoor();
|
---|
185 | // node without coords -> bbox[0,0,0,0]
|
---|
186 | return search_bbox.bounds(latLon != null ? latLon : LatLon.ZERO);
|
---|
187 | }
|
---|
188 | return o.getBBox().intersects(search_bbox);
|
---|
189 | }
|
---|
190 |
|
---|
191 | private void search_contents(BBox search_bbox, List<T> result) {
|
---|
192 | /*
|
---|
193 | * It is possible that this was created in a split
|
---|
194 | * but never got any content populated.
|
---|
195 | */
|
---|
196 | if (content == null)
|
---|
197 | return;
|
---|
198 |
|
---|
199 | for (T o : content) {
|
---|
200 | if (matches(o, search_bbox)) {
|
---|
201 | result.add(o);
|
---|
202 | }
|
---|
203 | }
|
---|
204 | }
|
---|
205 |
|
---|
206 | /*
|
---|
207 | * This is stupid. I tried to have a QBLeaf and QBBranch
|
---|
208 | * class descending from a QBLevel. It's more than twice
|
---|
209 | * as slow. So, this throws OO out the window, but it
|
---|
210 | * is fast. Runtime type determination must be slow.
|
---|
211 | */
|
---|
212 | boolean isLeaf() {
|
---|
213 | return isLeaf;
|
---|
214 | }
|
---|
215 |
|
---|
216 | boolean hasChildren() {
|
---|
217 | return nw != null || ne != null || sw != null || se != null;
|
---|
218 | }
|
---|
219 |
|
---|
220 | QBLevel<T> next_sibling() {
|
---|
221 | return (parent == null) ? null : parent.firstSiblingOf(this);
|
---|
222 | }
|
---|
223 |
|
---|
224 | boolean hasContent() {
|
---|
225 | return content != null;
|
---|
226 | }
|
---|
227 |
|
---|
228 | QBLevel<T> nextSibling() {
|
---|
229 | QBLevel<T> next = this;
|
---|
230 | QBLevel<T> sibling = next.next_sibling();
|
---|
231 | // Walk back up the tree to find the
|
---|
232 | // next sibling node. It may be either
|
---|
233 | // a leaf or branch.
|
---|
234 | while (sibling == null) {
|
---|
235 | next = next.parent;
|
---|
236 | if (next == null) {
|
---|
237 | break;
|
---|
238 | }
|
---|
239 | sibling = next.next_sibling();
|
---|
240 | }
|
---|
241 | next = sibling;
|
---|
242 | return next;
|
---|
243 | }
|
---|
244 |
|
---|
245 | QBLevel<T> firstChild() {
|
---|
246 | if (sw != null)
|
---|
247 | return sw;
|
---|
248 | if (nw != null)
|
---|
249 | return nw;
|
---|
250 | if (se != null)
|
---|
251 | return se;
|
---|
252 | return ne;
|
---|
253 | }
|
---|
254 |
|
---|
255 | QBLevel<T> firstSiblingOf(final QBLevel<T> child) {
|
---|
256 | switch (child.index) {
|
---|
257 | case SW_INDEX:
|
---|
258 | if (nw != null)
|
---|
259 | return nw;
|
---|
260 | case NW_INDEX:
|
---|
261 | if (se != null)
|
---|
262 | return se;
|
---|
263 | case SE_INDEX:
|
---|
264 | return ne;
|
---|
265 | }
|
---|
266 | return null;
|
---|
267 | }
|
---|
268 |
|
---|
269 | QBLevel<T> nextNode() {
|
---|
270 | if (!this.hasChildren())
|
---|
271 | return this.nextSibling();
|
---|
272 | return this.firstChild();
|
---|
273 | }
|
---|
274 |
|
---|
275 | QBLevel<T> nextContentNode() {
|
---|
276 | QBLevel<T> next = this.nextNode();
|
---|
277 | if (next == null)
|
---|
278 | return next;
|
---|
279 | if (next.hasContent())
|
---|
280 | return next;
|
---|
281 | return next.nextContentNode();
|
---|
282 | }
|
---|
283 |
|
---|
284 | void doAdd(T o) {
|
---|
285 | if (consistency_testing) {
|
---|
286 | if (!matches(o, this.bbox())) {
|
---|
287 | o.getBBox().getIndex(level);
|
---|
288 | o.getBBox().getIndex(level - 1);
|
---|
289 | abort("\nobject " + o + " does not belong in node at level: " + level + " bbox: " + this.bbox());
|
---|
290 | }
|
---|
291 | }
|
---|
292 | __add_content(o);
|
---|
293 | if (isLeaf() && content.size() > MAX_OBJECTS_PER_LEVEL && level < QuadTiling.NR_LEVELS) {
|
---|
294 | __split();
|
---|
295 | }
|
---|
296 | }
|
---|
297 |
|
---|
298 | void add(T o) {
|
---|
299 | findBucket(o.getBBox()).doAdd(o);
|
---|
300 | }
|
---|
301 |
|
---|
302 | private void search(BBox search_bbox, List<T> result) {
|
---|
303 | if (!this.bbox().intersects(search_bbox))
|
---|
304 | return;
|
---|
305 | else if (bbox().bounds(search_bbox)) {
|
---|
306 | buckets.searchCache = this;
|
---|
307 | }
|
---|
308 |
|
---|
309 | if (this.hasContent()) {
|
---|
310 | search_contents(search_bbox, result);
|
---|
311 | }
|
---|
312 |
|
---|
313 | //TODO Coincidence vector should be calculated here and only buckets that match search_bbox should be checked
|
---|
314 |
|
---|
315 | if (nw != null) {
|
---|
316 | nw.search(search_bbox, result);
|
---|
317 | }
|
---|
318 | if (ne != null) {
|
---|
319 | ne.search(search_bbox, result);
|
---|
320 | }
|
---|
321 | if (se != null) {
|
---|
322 | se.search(search_bbox, result);
|
---|
323 | }
|
---|
324 | if (sw != null) {
|
---|
325 | sw.search(search_bbox, result);
|
---|
326 | }
|
---|
327 | }
|
---|
328 |
|
---|
329 | public String quads() {
|
---|
330 | return Long.toHexString(quad);
|
---|
331 | }
|
---|
332 |
|
---|
333 | int index_of(QBLevel<T> find_this) {
|
---|
334 | QBLevel<T>[] children = getChildren();
|
---|
335 | for (int i = 0; i < QuadTiling.TILES_PER_LEVEL; i++) {
|
---|
336 | if (children[i] == find_this)
|
---|
337 | return i;
|
---|
338 | }
|
---|
339 | return -1;
|
---|
340 | }
|
---|
341 |
|
---|
342 | double width() {
|
---|
343 | return bbox.width();
|
---|
344 | }
|
---|
345 |
|
---|
346 | double height() {
|
---|
347 | return bbox.height();
|
---|
348 | }
|
---|
349 |
|
---|
350 | public BBox bbox() {
|
---|
351 | return bbox;
|
---|
352 | }
|
---|
353 |
|
---|
354 | /*
|
---|
355 | * This gives the coordinate of the bottom-left
|
---|
356 | * corner of the box
|
---|
357 | */
|
---|
358 | final LatLon coor() {
|
---|
359 | return QuadTiling.tile2LatLon(this.quad);
|
---|
360 | }
|
---|
361 |
|
---|
362 | void remove_from_parent() {
|
---|
363 | if (parent == null)
|
---|
364 | return;
|
---|
365 |
|
---|
366 | if (!canRemove()) {
|
---|
367 | abort("attempt to remove non-empty child: " + this.content + " " + Arrays.toString(this.getChildren()));
|
---|
368 | }
|
---|
369 |
|
---|
370 | if (parent.nw == this) {
|
---|
371 | parent.nw = null;
|
---|
372 | } else if (parent.ne == this) {
|
---|
373 | parent.ne = null;
|
---|
374 | } else if (parent.sw == this) {
|
---|
375 | parent.sw = null;
|
---|
376 | } else if (parent.se == this) {
|
---|
377 | parent.se = null;
|
---|
378 | }
|
---|
379 |
|
---|
380 | if (parent.canRemove()) {
|
---|
381 | parent.remove_from_parent();
|
---|
382 | }
|
---|
383 | }
|
---|
384 |
|
---|
385 | boolean canRemove() {
|
---|
386 | if (content != null && !content.isEmpty())
|
---|
387 | return false;
|
---|
388 | if (this.hasChildren())
|
---|
389 | return false;
|
---|
390 | return true;
|
---|
391 | }
|
---|
392 | }
|
---|
393 |
|
---|
394 | private QBLevel<T> root;
|
---|
395 | private QBLevel<T> searchCache;
|
---|
396 | private int size;
|
---|
397 |
|
---|
398 | /**
|
---|
399 | * Constructs a new {@code QuadBuckets}.
|
---|
400 | */
|
---|
401 | public QuadBuckets() {
|
---|
402 | clear();
|
---|
403 | }
|
---|
404 |
|
---|
405 | @Override
|
---|
406 | public final void clear() {
|
---|
407 | root = new QBLevel<>(this);
|
---|
408 | searchCache = null;
|
---|
409 | size = 0;
|
---|
410 | }
|
---|
411 |
|
---|
412 | @Override
|
---|
413 | public boolean add(T n) {
|
---|
414 | root.add(n);
|
---|
415 | size++;
|
---|
416 | return true;
|
---|
417 | }
|
---|
418 |
|
---|
419 | @Override
|
---|
420 | public boolean retainAll(Collection<?> objects) {
|
---|
421 | for (T o : this) {
|
---|
422 | if (objects.contains(o)) {
|
---|
423 | continue;
|
---|
424 | }
|
---|
425 | if (!this.remove(o))
|
---|
426 | return false;
|
---|
427 | }
|
---|
428 | return true;
|
---|
429 | }
|
---|
430 |
|
---|
431 | @Override
|
---|
432 | public boolean removeAll(Collection<?> objects) {
|
---|
433 | boolean changed = false;
|
---|
434 | for (Object o : objects) {
|
---|
435 | changed = changed | remove(o);
|
---|
436 | }
|
---|
437 | return changed;
|
---|
438 | }
|
---|
439 |
|
---|
440 | @Override
|
---|
441 | public boolean addAll(Collection<? extends T> objects) {
|
---|
442 | boolean changed = false;
|
---|
443 | for (T o : objects) {
|
---|
444 | changed = changed | this.add(o);
|
---|
445 | }
|
---|
446 | return changed;
|
---|
447 | }
|
---|
448 |
|
---|
449 | @Override
|
---|
450 | public boolean containsAll(Collection<?> objects) {
|
---|
451 | for (Object o : objects) {
|
---|
452 | if (!this.contains(o))
|
---|
453 | return false;
|
---|
454 | }
|
---|
455 | return true;
|
---|
456 | }
|
---|
457 |
|
---|
458 | @Override
|
---|
459 | public boolean remove(Object o) {
|
---|
460 | @SuppressWarnings("unchecked")
|
---|
461 | T t = (T) o;
|
---|
462 | searchCache = null; // Search cache might point to one of removed buckets
|
---|
463 | QBLevel<T> bucket = root.findBucket(t.getBBox());
|
---|
464 | if (bucket.remove_content(t)) {
|
---|
465 | size--;
|
---|
466 | return true;
|
---|
467 | } else
|
---|
468 | return false;
|
---|
469 | }
|
---|
470 |
|
---|
471 | @Override
|
---|
472 | public boolean contains(Object o) {
|
---|
473 | @SuppressWarnings("unchecked")
|
---|
474 | T t = (T) o;
|
---|
475 | QBLevel<T> bucket = root.findBucket(t.getBBox());
|
---|
476 | return bucket != null && bucket.content != null && bucket.content.contains(t);
|
---|
477 | }
|
---|
478 |
|
---|
479 | public List<T> toList() {
|
---|
480 | List<T> a = new ArrayList<>();
|
---|
481 | for (T n : this) {
|
---|
482 | a.add(n);
|
---|
483 | }
|
---|
484 | return a;
|
---|
485 | }
|
---|
486 |
|
---|
487 | @Override
|
---|
488 | public Object[] toArray() {
|
---|
489 | return this.toList().toArray();
|
---|
490 | }
|
---|
491 |
|
---|
492 | @Override
|
---|
493 | public <A> A[] toArray(A[] template) {
|
---|
494 | return this.toList().toArray(template);
|
---|
495 | }
|
---|
496 |
|
---|
497 | class QuadBucketIterator implements Iterator<T> {
|
---|
498 | private QBLevel<T> currentNode;
|
---|
499 | private int contentIndex;
|
---|
500 | private int iteratedOver;
|
---|
501 |
|
---|
502 | final QBLevel<T> next_content_node(QBLevel<T> q) {
|
---|
503 | if (q == null)
|
---|
504 | return null;
|
---|
505 | QBLevel<T> orig = q;
|
---|
506 | QBLevel<T> next;
|
---|
507 | next = q.nextContentNode();
|
---|
508 | if (orig == next) {
|
---|
509 | abort("got same leaf back leaf: " + q.isLeaf());
|
---|
510 | }
|
---|
511 | return next;
|
---|
512 | }
|
---|
513 |
|
---|
514 | public QuadBucketIterator(QuadBuckets<T> qb) {
|
---|
515 | if (!qb.root.hasChildren() || qb.root.hasContent()) {
|
---|
516 | currentNode = qb.root;
|
---|
517 | } else {
|
---|
518 | currentNode = next_content_node(qb.root);
|
---|
519 | }
|
---|
520 | iteratedOver = 0;
|
---|
521 | }
|
---|
522 |
|
---|
523 | @Override
|
---|
524 | public boolean hasNext() {
|
---|
525 | if (this.peek() == null)
|
---|
526 | return false;
|
---|
527 | return true;
|
---|
528 | }
|
---|
529 |
|
---|
530 | T peek() {
|
---|
531 | if (currentNode == null)
|
---|
532 | return null;
|
---|
533 | while ((currentNode.content == null) || (contentIndex >= currentNode.content.size())) {
|
---|
534 | contentIndex = 0;
|
---|
535 | currentNode = next_content_node(currentNode);
|
---|
536 | if (currentNode == null) {
|
---|
537 | break;
|
---|
538 | }
|
---|
539 | }
|
---|
540 | if (currentNode == null || currentNode.content == null)
|
---|
541 | return null;
|
---|
542 | return currentNode.content.get(contentIndex);
|
---|
543 | }
|
---|
544 |
|
---|
545 | @Override
|
---|
546 | public T next() {
|
---|
547 | T ret = peek();
|
---|
548 | contentIndex++;
|
---|
549 | iteratedOver++;
|
---|
550 | return ret;
|
---|
551 | }
|
---|
552 |
|
---|
553 | @Override
|
---|
554 | public void remove() {
|
---|
555 | // two uses
|
---|
556 | // 1. Back up to the thing we just returned
|
---|
557 | // 2. move the index back since we removed
|
---|
558 | // an element
|
---|
559 | contentIndex--;
|
---|
560 | T object = peek();
|
---|
561 | currentNode.remove_content(object);
|
---|
562 | }
|
---|
563 | }
|
---|
564 |
|
---|
565 | @Override
|
---|
566 | public Iterator<T> iterator() {
|
---|
567 | return new QuadBucketIterator(this);
|
---|
568 | }
|
---|
569 |
|
---|
570 | @Override
|
---|
571 | public int size() {
|
---|
572 | return size;
|
---|
573 | }
|
---|
574 |
|
---|
575 | @Override
|
---|
576 | public boolean isEmpty() {
|
---|
577 | return size == 0;
|
---|
578 | }
|
---|
579 |
|
---|
580 | public List<T> search(BBox search_bbox) {
|
---|
581 | List<T> ret = new ArrayList<>();
|
---|
582 | // Doing this cuts down search cost on a real-life data set by about 25%
|
---|
583 | if (searchCache == null) {
|
---|
584 | searchCache = root;
|
---|
585 | }
|
---|
586 | // Walk back up the tree when the last search spot can not cover the current search
|
---|
587 | while (searchCache != null && !searchCache.bbox().bounds(search_bbox)) {
|
---|
588 | searchCache = searchCache.parent;
|
---|
589 | }
|
---|
590 |
|
---|
591 | if (searchCache == null) {
|
---|
592 | searchCache = root;
|
---|
593 | Main.info("bbox: " + search_bbox + " is out of the world");
|
---|
594 | }
|
---|
595 |
|
---|
596 | // Save parent because searchCache might change during search call
|
---|
597 | QBLevel<T> tmp = searchCache.parent;
|
---|
598 |
|
---|
599 | searchCache.search(search_bbox, ret);
|
---|
600 |
|
---|
601 | // A way that spans this bucket may be stored in one
|
---|
602 | // of the nodes which is a parent of the search cache
|
---|
603 | while (tmp != null) {
|
---|
604 | tmp.search_contents(search_bbox, ret);
|
---|
605 | tmp = tmp.parent;
|
---|
606 | }
|
---|
607 | return ret;
|
---|
608 | }
|
---|
609 | }
|
---|