A node of a Bintree.
More...
#include <Node.h>
|
| 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 () |
◆ isSearchMatch()
bool geos::index::bintree::Node::isSearchMatch |
( |
Interval * | itemInterval | ) |
|
|
overrideprotectedvirtual |
The documentation for this class was generated from the following file: