The base class for nodes in a Bintree.
More...
#include <NodeBase.h>
|
virtual std::vector< void * > * | getItems () |
|
virtual void | add (void *item) |
|
virtual std::vector< void * > * | addAllItems (std::vector< void * > *newItems) |
|
virtual std::vector< void * > * | addAllItemsFromOverlapping (Interval *interval, std::vector< void * > *resultItems) |
|
virtual int | depth () |
|
virtual int | size () |
|
virtual int | nodeSize () |
|
|
static int | getSubnodeIndex (Interval *interval, double centre) |
|
|
virtual bool | isSearchMatch (Interval *interval)=0 |
|
The base class for nodes in a Bintree.
◆ subnode
Node* geos::index::bintree::NodeBase::subnode[2] |
|
protected |
subnodes are numbered as follows:
0 | 1
The documentation for this class was generated from the following file: