org.isarnproject.collections.mixmaps.prefixsum
Instantiate an internal node.
Instantiate an internal node.
The ordering that is applied to key values
The ordering that is applied to key values
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
Aggregator that defines semantics of prefix sum
Aggregator that defines semantics of prefix sum
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
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
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
Obtain the prefix (cumulative) sum of values <= a given key 'k'.
Obtain the prefix (cumulative) sum of values <= a given key 'k'. If 'open' is true, sums the open interval for keys strictly < k. If 'k' is not present in the map, then the sum for keys < k is returned.
A container of all prefix sums over the stored values.
A container of all prefix sums over the stored values. If 'open' is true, the sums will be for strictly < each key.
Iterate over prefix sums for stored values.
Iterate over prefix sums for stored values. If 'open' is true, the sums will be for strictly < each key.
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.
equivalent to prefixSum of the right-most key
Container of values, in key order
Container of values, in key order
Iterator over values, in key order
Iterator over values, in key order
An inheritable and mixable trait for adding prefix sum query to ordered maps
The key type
The value type
The prefix sum type
The node type of the concrete internal R/B tree subclass
The map self-type of the concrete map subclass