## 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.root`
`private RBTreeMap.Entry` `RBTreeMap.Iterator.lastReturned`
`private RBTreeMap.Entry` `RBTreeMap.Iterator.next`
`private RBTreeMap.Entry` `RBTreeMap.Iterator.firstExcluded`
`(package private) RBTreeMap.Entry` `RBTreeMap.Entry.left`
`(package private) RBTreeMap.Entry` `RBTreeMap.Entry.right`
`(package private) RBTreeMap.Entry` `RBTreeMap.Entry.parent`

Methods in gate.util that return RBTreeMap.Entry
`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.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.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.firstEntry()` Returns the first Entry in the RBTreeMap (according to the RBTreeMap's key-sort function).
`private RBTreeMap.Entry` `RBTreeMap.lastEntry()` Returns the last Entry in the RBTreeMap (according to the RBTreeMap's key-sort function).
`private RBTreeMap.Entry` `RBTreeMap.successor(RBTreeMap.Entry t)` Returns the successor of the specified Entry, or null if no such.
`private static RBTreeMap.Entry` `RBTreeMap.parentOf(RBTreeMap.Entry p)`
`private static RBTreeMap.Entry` `RBTreeMap.leftOf(RBTreeMap.Entry p)`
`private static RBTreeMap.Entry` `RBTreeMap.rightOf(RBTreeMap.Entry p)`
`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.

Methods in gate.util with parameters of type RBTreeMap.Entry
`private boolean` `RBTreeMap.valueSearchNull(RBTreeMap.Entry n)`
`private boolean` `RBTreeMap.valueSearchNonNull(RBTreeMap.Entry n, Object value)`
`private static Object` `RBTreeMap.key(RBTreeMap.Entry e)` Returns the key corresonding to the specified Entry.
`private RBTreeMap.Entry` `RBTreeMap.successor(RBTreeMap.Entry t)` Returns the successor of the specified Entry, or null if no such.
`private static boolean` `RBTreeMap.colorOf(RBTreeMap.Entry p)` Balancing operations.
`private static RBTreeMap.Entry` `RBTreeMap.parentOf(RBTreeMap.Entry p)`
`private static void` `RBTreeMap.setColor(RBTreeMap.Entry p, boolean c)`
`private static RBTreeMap.Entry` `RBTreeMap.leftOf(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 void` `RBTreeMap.fixAfterInsertion(RBTreeMap.Entry x)` From CLR
`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.swapPosition(RBTreeMap.Entry x, RBTreeMap.Entry y)` Swap the linkages of two nodes in a tree.

Constructors in gate.util with parameters of type RBTreeMap.Entry
`RBTreeMap.Iterator(RBTreeMap.Entry first, RBTreeMap.Entry firstExcluded)`
`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.