AbstractNode
A node of an {link AbstractSTRtree}. A node is one of:
-
empty
-
an <i>interior node</i> containing child {link AbstractNode}s
-
a <i>leaf node</i> containing data items ({link ItemBoundable}s).
A node stores the bounds of its children, and its level within the index tree.
- Version
1.7
Value members
Concrete methods
Adds either an AbstractNode, or if this is a leaf node, a data object (wrapped in an ItemBoundable)
Adds either an AbstractNode, or if this is a leaf node, a data object (wrapped in an ItemBoundable)
- Value Params
- childBoundable
the child to add
Gets the bounds of this node
Gets the bounds of this node
return the object representing bounds in this index
- Definition Classes
Returns either child {link AbstractNode}s, or if this is a leaf node, real data (wrapped in {link ItemBoundable}s).
Returns either child {link AbstractNode}s, or if this is a leaf node, real data (wrapped in {link ItemBoundable}s).
return a list of the children
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
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
return the node level
Tests whether there are any {link Boundable}s at this node.
Tests whether there are any {link Boundable}s at this node.
return true if there are boundables at this node