A node of a Bintree.
More...
#include <Node.h>
Public Member Functions |
| Node (Interval *newInterval, int newLevel) |
Interval * | getInterval () |
Node * | getNode (Interval *searchInterval) |
NodeBase * | find (Interval *searchInterval) |
void | insert (Node *node) |
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 Public Member Functions |
static Node * | createNode (Interval *itemInterval) |
static Node * | createExpanded (Node *node, Interval *addInterval) |
static int | getSubnodeIndex (Interval *interval, double centre) |
Protected Member Functions |
bool | isSearchMatch (Interval *itemInterval) |
Additional Inherited Members |
std::vector< void * > * | items |
Node * | subnode [2] |
Detailed Description
The documentation for this class was generated from the following file: