You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
101 lines
3.3 KiB
Plaintext
101 lines
3.3 KiB
Plaintext
2 years ago
|
/***************************************************************************
|
||
|
|
* Copyright (C) gempa GmbH *
|
||
|
|
* All rights reserved. *
|
||
|
|
* Contact: gempa GmbH (seiscomp-dev@gempa.de) *
|
||
|
|
* *
|
||
|
|
* GNU Affero General Public License Usage *
|
||
|
|
* This file may be used under the terms of the GNU Affero *
|
||
|
|
* Public License version 3.0 as published by the Free Software Foundation *
|
||
|
|
* and appearing in the file LICENSE included in the packaging of this *
|
||
|
|
* file. Please review the following information to ensure the GNU Affero *
|
||
|
|
* Public License version 3.0 requirements will be met: *
|
||
|
|
* https://www.gnu.org/licenses/agpl-3.0.html. *
|
||
|
|
* *
|
||
|
|
* Other Usage *
|
||
|
|
* Alternatively, this file may be used in accordance with the terms and *
|
||
|
|
* conditions contained in a signed written agreement between you and *
|
||
|
|
* gempa GmbH. *
|
||
|
|
***************************************************************************/
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
// >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
|
||
|
|
inline QuadTree::Node::Node() : isLeaf(true) {}
|
||
|
|
// <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
// >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
|
||
|
|
inline const GeoBoundingBox &QuadTree::bbox() const {
|
||
|
|
return _root.bbox;
|
||
|
|
}
|
||
|
|
// <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
// >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
|
||
|
|
template <typename VISITOR>
|
||
|
|
inline void QuadTree::accept(const VISITOR &visitor, bool topDown) {
|
||
|
|
if ( topDown )
|
||
|
|
_root.acceptTopDown(visitor);
|
||
|
|
else
|
||
|
|
_root.acceptButtomUp(visitor);
|
||
|
|
}
|
||
|
|
// <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
// >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
|
||
|
|
template <typename VISITOR>
|
||
|
|
inline bool QuadTree::Node::acceptTopDown(const VISITOR &visitor) {
|
||
|
|
if ( !visitor.accept(bbox) ) return true;
|
||
|
|
|
||
|
|
for ( size_t i = 0; i < features.size(); ++i ) {
|
||
|
|
if ( !visitor.visit(features[i]) )
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
for ( size_t i = 0; i < 4; ++i ) {
|
||
|
|
if ( children[i] ) {
|
||
|
|
if ( !children[i]->acceptTopDown(visitor) )
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
// <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
// >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
|
||
|
|
template <typename VISITOR>
|
||
|
|
inline bool QuadTree::Node::acceptButtomUp(const VISITOR &visitor) {
|
||
|
|
if ( !visitor.accept(bbox) ) return true;
|
||
|
|
|
||
|
|
for ( size_t i = 0; i < 4; ++i ) {
|
||
|
|
if ( children[i] ) {
|
||
|
|
if ( !children[i]->acceptButtomUp(visitor) )
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
for ( size_t i = features.size(); i > 0; --i ) {
|
||
|
|
if ( !visitor.visit(features[i-1]) )
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
// <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
// >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
|