RTreeNode<T> class

An R-Tree node, which is a container for R-Tree entries. The node is a leaf node if its entries contain data; otherwise, if it is a non-leaf node, then its entries contain pointers to children nodes.

Constructors

RTreeNode.new(RTree<T> tree, {RTreeNode<T>? parent, bool isLeaf = false, List<RTreeEntry<T>>? entries})

Properties

bounds → Bounds
no setter
entries ↔ List<RTreeEntry<T>>
getter/setter pair
hashCode → int
The hash code for this object.
no setterinherited
isLeaf ↔ bool
getter/setter pair
isRoot → bool
no setter
parent ↔ RTreeNode<T>?
getter/setter pair
parentEntry → RTreeEntry<T>?
no setter
runtimeType → Type
A representation of the runtime type of the object.
no setterinherited
siblingEntries → Iterable<RTreeEntry<T>>
no setter
tree → RTree<T>
final

Methods

fixChildren() → void
noSuchMethod(Invocation invocation) → dynamic
Invoked when a nonexistent method or property is accessed.
inherited
toString() → String
A string representation of this object.
inherited
traverse<R>(Map1<RTreeNode<T>, Iterable<R>> callback, {Predicate1<RTreeNode<T>>? condition}) → Iterable<R>
Traverses the tree starting from a given node in depth-first order, calling the given function on each node. A condition function may optionally be passed to filter which nodes get traversed. If condition returns False, then neither the node nor any of its descendants will be traversed.

Operators

operator ==(Object other) → bool
The equality operator.
inherited