132 lines
3.4 KiB
C
132 lines
3.4 KiB
C
|
/**********************************************************************
|
||
|
*
|
||
|
* GEOS - Geometry Engine Open Source
|
||
|
* http://geos.osgeo.org
|
||
|
*
|
||
|
* Copyright (C) 2006 Refractions Research 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.
|
||
|
*
|
||
|
**********************************************************************/
|
||
|
|
||
|
#pragma once
|
||
|
|
||
|
#include <cassert>
|
||
|
#include <cstddef>
|
||
|
#include <geos/export.h>
|
||
|
#include <geos/index/strtree/Boundable.h> // for inheritance
|
||
|
|
||
|
#include <vector>
|
||
|
|
||
|
#ifdef _MSC_VER
|
||
|
#pragma warning(push)
|
||
|
#pragma warning(disable: 4251) // warning C4251: needs to have dll-interface to be used by clients of class
|
||
|
#endif
|
||
|
|
||
|
namespace geos {
|
||
|
namespace index { // geos::index
|
||
|
namespace strtree { // geos::index::strtree
|
||
|
|
||
|
/** \brief
|
||
|
* A node of the STR tree.
|
||
|
*
|
||
|
* The children of this node are either more nodes
|
||
|
* (AbstractNodes) or real data (ItemBoundables).
|
||
|
*
|
||
|
* If this node contains real data (rather than nodes),
|
||
|
* then we say that this node is a "leaf node".
|
||
|
*
|
||
|
*/
|
||
|
class GEOS_DLL AbstractNode: public Boundable {
|
||
|
private:
|
||
|
std::vector<Boundable*> childBoundables;
|
||
|
int level;
|
||
|
public:
|
||
|
|
||
|
/*
|
||
|
* Constructs an AbstractNode at the given level in the tree
|
||
|
* @param level 0 if this node is a leaf, 1 if a parent of a leaf, and so on;
|
||
|
* the root node will have the highest level
|
||
|
*/
|
||
|
AbstractNode(int newLevel, std::size_t capacity = 10) : level(newLevel), bounds(nullptr) {
|
||
|
childBoundables.reserve(capacity);
|
||
|
}
|
||
|
|
||
|
~AbstractNode() override = default;
|
||
|
|
||
|
// TODO: change signature to return by ref,
|
||
|
// document ownership of the return
|
||
|
inline std::vector<Boundable*>*
|
||
|
getChildBoundables()
|
||
|
{
|
||
|
return &childBoundables;
|
||
|
}
|
||
|
|
||
|
// TODO: change signature to return by ref,
|
||
|
// document ownership of the return
|
||
|
inline const std::vector<Boundable*>*
|
||
|
getChildBoundables() const
|
||
|
{
|
||
|
return &childBoundables;
|
||
|
}
|
||
|
|
||
|
/**
|
||
|
* Returns a representation of space that encloses this Boundable,
|
||
|
* preferably not much bigger than this Boundable's boundary yet fast to
|
||
|
* test for intersection with the bounds of other Boundables.
|
||
|
* The class of object returned depends on the subclass of
|
||
|
* AbstractSTRtree.
|
||
|
*
|
||
|
* @return an Envelope (for STRtrees), an Interval (for SIRtrees),
|
||
|
* or other object (for other subclasses of AbstractSTRtree)
|
||
|
*
|
||
|
* @see AbstractSTRtree::IntersectsOp
|
||
|
*/
|
||
|
const void* getBounds() const override {
|
||
|
if(bounds == nullptr) {
|
||
|
bounds = computeBounds();
|
||
|
}
|
||
|
return bounds;
|
||
|
}
|
||
|
|
||
|
/**
|
||
|
* Returns 0 if this node is a leaf, 1 if a parent of a leaf, and so on; the
|
||
|
* root node will have the highest level
|
||
|
*/
|
||
|
int getLevel() {
|
||
|
return level;
|
||
|
}
|
||
|
|
||
|
/**
|
||
|
* Adds either an AbstractNode, or if this is a leaf node, a data object
|
||
|
* (wrapped in an ItemBoundable)
|
||
|
*/
|
||
|
void addChildBoundable(Boundable* childBoundable) {
|
||
|
assert(bounds == nullptr);
|
||
|
childBoundables.push_back(childBoundable);
|
||
|
}
|
||
|
|
||
|
bool isLeaf() const override {
|
||
|
return false;
|
||
|
}
|
||
|
|
||
|
protected:
|
||
|
|
||
|
virtual void* computeBounds() const = 0;
|
||
|
|
||
|
mutable void* bounds;
|
||
|
};
|
||
|
|
||
|
|
||
|
} // namespace geos::index::strtree
|
||
|
} // namespace geos::index
|
||
|
} // namespace geos
|
||
|
|
||
|
#ifdef _MSC_VER
|
||
|
#pragma warning(pop)
|
||
|
#endif
|
||
|
|