Uses of Class
gate.util.RBTreeMap.Entry

Packages that use RBTreeMap.Entry

gate.util

Uses of RBTreeMap.Entry in gate.util

Fields in gate.util declared as RBTreeMap.Entry

private RBTreeMap.Entry	RBTreeMap.Iterator.firstExcluded
private RBTreeMap.Entry	RBTreeMap.Iterator.lastReturned
(package private) RBTreeMap.Entry	RBTreeMap.Entry.left
private RBTreeMap.Entry	RBTreeMap.Iterator.next
(package private) RBTreeMap.Entry	RBTreeMap.Entry.parent
(package private) RBTreeMap.Entry	RBTreeMap.Entry.right
private RBTreeMap.Entry	RBTreeMap.root

Methods in gate.util that return RBTreeMap.Entry

private static RBTreeMap.Entry	RBTreeMap.buildFromSorted(int level, int lo, int hi, int redLevel, Iterator it, ObjectInputStream str, Object defaultVal) Recursive "helper method" that does the real work of the of the previous method.
private RBTreeMap.Entry	RBTreeMap.firstEntry() Returns the first Entry in the RBTreeMap (according to the RBTreeMap's key-sort function).
private RBTreeMap.Entry	RBTreeMap.getCeilEntry(Object key) Gets the entry corresponding to the specified key; if no such entry exists, returns the entry for the least key greater than the specified key; if no such entry exists (i.e., the greatest key in the Tree is less than the specified key), returns null.
private RBTreeMap.Entry	RBTreeMap.getEntry(Object key) Returns this map's entry for the given key, or null if the map does not contain an entry for the key.
private RBTreeMap.Entry	RBTreeMap.getPrecedingEntry(Object key) Returns the entry for the greatest key less than the specified key; if no such entry exists (i.e., the least key in the Tree is greater than the specified key), returns null.
private RBTreeMap.Entry	RBTreeMap.lastEntry() Returns the last Entry in the RBTreeMap (according to the RBTreeMap's key-sort function).
private static RBTreeMap.Entry	RBTreeMap.leftOf(RBTreeMap.Entry p)
private static RBTreeMap.Entry	RBTreeMap.parentOf(RBTreeMap.Entry p)
private static RBTreeMap.Entry	RBTreeMap.rightOf(RBTreeMap.Entry p)
private RBTreeMap.Entry	RBTreeMap.successor(RBTreeMap.Entry t) Returns the successor of the specified Entry, or null if no such.

Methods in gate.util with parameters of type RBTreeMap.Entry

private static boolean	RBTreeMap.colorOf(RBTreeMap.Entry p) Balancing operations.
private void	RBTreeMap.deleteEntry(RBTreeMap.Entry p) Delete node p, and then rebalance the tree.
private void	RBTreeMap.fixAfterDeletion(RBTreeMap.Entry x) From CLR
private void	RBTreeMap.fixAfterInsertion(RBTreeMap.Entry x) From CLR
private static Object	RBTreeMap.key(RBTreeMap.Entry e) Returns the key corresonding to the specified Entry.
private static RBTreeMap.Entry	RBTreeMap.leftOf(RBTreeMap.Entry p)
private static RBTreeMap.Entry	RBTreeMap.parentOf(RBTreeMap.Entry p)
private static RBTreeMap.Entry	RBTreeMap.rightOf(RBTreeMap.Entry p)
private void	RBTreeMap.rotateLeft(RBTreeMap.Entry p) From CLR
private void	RBTreeMap.rotateRight(RBTreeMap.Entry p) From CLR
private static void	RBTreeMap.setColor(RBTreeMap.Entry p, boolean c)
private RBTreeMap.Entry	RBTreeMap.successor(RBTreeMap.Entry t) Returns the successor of the specified Entry, or null if no such.
private void	RBTreeMap.swapPosition(RBTreeMap.Entry x, RBTreeMap.Entry y) Swap the linkages of two nodes in a tree.
private boolean	RBTreeMap.valueSearchNonNull(RBTreeMap.Entry n, Object value)
private boolean	RBTreeMap.valueSearchNull(RBTreeMap.Entry n)

Constructors in gate.util with parameters of type RBTreeMap.Entry

RBTreeMap.Entry(Object key, Object value, RBTreeMap.Entry parent)
Make a new cell with given key, value, and parent, and with null child links, and BLACK color.

RBTreeMap.Iterator(RBTreeMap.Entry first, RBTreeMap.Entry firstExcluded)