org.isarnproject.collections.mixmaps.nearest.tree
The Red/Black color of this node
The Red/Black color of this node
Including, but not limited to, the key
Including, but not limited to, the key
Instantiate an internal node.
Instantiate an internal node.
Ordering that also supports linear distance |x-y|
The left sub-tree
The right sub-tree
create a new Black node from a key, value, left subtree and right subtree
create a new Black node from a key, value, left subtree and right subtree
Obtain the nearest nodes to a given key
Obtain the node stored at a given key if it exists, None otherwise
create a new Red node from a key, value, left subtree and right subtree
create a new Red node from a key, value, left subtree and right subtree
Internal R/B tree nodes supporting nearest-key query