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
Obtain a new container with key removed
Obtain a new container with key removed
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
Returns true if key is present in the container, false otherwise
Returns true if key is present in the container, false otherwise
Get the value stored at a key, or None if key is not present
Get the value stored at a key, or None if key is not present
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
Iterator over (key,val) pairs, in key order
Iterator over (key,val) pairs, in key order
Maximum key stored in this collection
Maximum key stored in this collection
Minimum key stored in this collection
Minimum key stored in this collection
A container of keys, in key order
A container of keys, in key order
Iterator over keys, in key order
Iterator over keys, in key order
Return entries nearest to a given key.
Return entries nearest to a given key. The sequence that is returned may have zero, one or two elements. If (k) is at the midpoint between two keys, the two nearest will be returned (in key order). If container is empty, an empty sequence will be returned.
Obtain the nodes nearest to a key
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
(Changed in version 2.9.0) The behavior of scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
Container of values, in key order
Container of values, in key order
Iterator over values, in key order
Iterator over values, in key order