org.isarnproject.collections.mixmaps.nearest
Instantiate an internal node.
Instantiate an internal node.
Ordering that also supports linear distance |x-y|
Obtain the node stored at a given key if it exists, None otherwise
Obtain the node stored at a given key if it exists, None otherwise
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
Get the internal node stored at at key, or None if key is not present
Get the internal node stored at at key, or None if key is not present
Maximum key stored in this collection
Minimum key stored in this collection
Obtain the nodes nearest to a key
A container of underlying nodes, in key order
A container of underlying nodes, in key order
A container of nodes, in key order, having key >= k
A container of nodes, in key order, having key >= k
Iterator over nodes, in key order
Iterator over nodes, in key order
Iterator over nodes, in key order, having key >= k
Iterator over nodes, in key order, having key >= k
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
An inheritable and mixable trait for adding nearest-key query to ordered containers
The key type
The node type of the concrete internal R/B tree subclass
The self-type of the concrete container