21 #ifndef GF_SPATIAL_DYNAMIC_TREE_H 22 #define GF_SPATIAL_DYNAMIC_TREE_H 27 #include <gf/Handle.h> 28 #include <gf/Portability.h> 31 #include "BlockAllocator.h" 35 #ifndef DOXYGEN_SHOULD_SKIP_THIS 97 std::size_t allocateNode();
98 void disposeNode(std::size_t index);
100 void doInsert(std::size_t leaf);
101 void doRemove(std::size_t leaf);
103 std::size_t balance(std::size_t iA);
114 bool isLeaf()
const {
124 #ifndef DOXYGEN_SHOULD_SKIP_THIS 129 #endif // GF_SPATIAL_DYNAMIC_TREE_H The structure represents an internal node.
An implementation of dynamic tree.
Definition: DynamicTree.h:43
std::function< void(Handle)> SpatialQueryCallback
A callback for spatial query.
Definition: spatial/Types.h:81
SpatialId
A spatial id.
Definition: spatial/Types.h:41
Search for all objects that intersect the given bounds.
The namespace for gf classes.
Definition: Action.h:35
SpatialQuery
A kind of spatial query.
Definition: spatial/Types.h:72
constexpr std::size_t NullIndex
Definition: BlockAllocator.h:32