TreeMap.BalanceableBinaryTree<K,V>AbstractMap.MapEntry<K,V>| Constructor and Description |
|---|
RBTreeMap()
Constructs an empty map using the natural ordering of keys.
|
RBTreeMap(Comparator<K> comp)
Constructs an empty map using the given comparator to order keys.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
rebalanceDelete(Position<Entry<K,V>> p)
Overrides the TreeMap rebalancing hook that is called after a deletion.
|
protected void |
rebalanceInsert(Position<Entry<K,V>> p)
Overrides the TreeMap rebalancing hook that is called after an insertion.
|
ceilingEntry, dump, entrySet, firstEntry, floorEntry, get, higherEntry, isExternal, isInternal, isRoot, lastEntry, left, lowerEntry, parent, put, rebalanceAccess, remove, remove, restructure, right, root, rotate, set, sibling, size, subMap, treeMax, treeMincheckKey, compare, compare, compare, compareisEmpty, keySet, valuespublic RBTreeMap()
public RBTreeMap(Comparator<K> comp)
comp - comparator defining the order of keys in the map