- class RBPair(K, T) : RBCell!(T) ¶#
-
RBPairs are RBCells with keys.
Doug Lea
@version 0.93
For an introduction to this package see Overview .
- this(K k, T v) [public] ¶#
-
Make a cell with given key and element values, and null links
- RBPair duplicate() [protected, final] ¶#
-
Make a new node with same key and element values, but null links
- K key() [public, final] ¶#
-
return the key
- void key(K k) [public, final] ¶#
-
set the key
- RBCell!(T) find(T element, Comparator!(T) cmp) [public, override, final] ¶#
-
Implements RBCell.find.
Override RBCell version since we are ordered on keys, not elements, so
element find has to search whole tree.
comparator argument not actually used.
RBCell.find
- int count(T element, Comparator!(T) cmp) [public, override, final] ¶#
-
Implements RBCell.count.
RBCell.count
- RBPair findKey(K key, Comparator!(K) cmp) [public, final] ¶#
-
find and return a cell holding key, or null if no such
- RBPair find(K key, T element, Comparator!(K) cmp) [public, final] ¶#
-
find and return a cell holding (key, element), or null if no such
- int countKey(K key, Comparator!(K) cmp) [public, final] ¶#
-
return number of nodes of subtree holding key
- int count(K key, T element, Comparator!(K) cmp) [public, final] ¶#
-
return number of nodes of subtree holding (key, element)