Overview  Package  Class   Use  Tree  Deprecated  Index  Help 
 PREV   NEXT FRAMES    NO FRAMES    

Uses of Class
net.sf.beanlib.utils.range.ExtensibleTreeMap.NodeEntry

Packages that use ExtensibleTreeMap.NodeEntry
net.sf.beanlib.utils.range Range related utilities 
 

Uses of ExtensibleTreeMap.NodeEntry in net.sf.beanlib.utils.range
 

Fields in net.sf.beanlib.utils.range declared as ExtensibleTreeMap.NodeEntry
private  ExtensibleTreeMap.NodeEntry<K,V> ExtensibleTreeMap.PrivateEntryIterator.lastReturned
           
(package private)  ExtensibleTreeMap.NodeEntry<K,V> ExtensibleTreeMap.NodeEntry.left
           
(package private)  ExtensibleTreeMap.NodeEntry<K,V> ExtensibleTreeMap.PrivateEntryIterator.next
           
(package private)  ExtensibleTreeMap.NodeEntry<K,V> ExtensibleTreeMap.NodeEntry.parent
           
(package private)  ExtensibleTreeMap.NodeEntry<K,V> ExtensibleTreeMap.NodeEntry.right
           
protected  ExtensibleTreeMap.NodeEntry<K,V> ExtensibleTreeMap.root
           
 

Methods in net.sf.beanlib.utils.range that return ExtensibleTreeMap.NodeEntry
private  ExtensibleTreeMap.NodeEntry<K,V> ExtensibleTreeMap.buildFromSorted(int level, int lo, int hi, int redLevel, Iterator it, ObjectInputStream str, V defaultVal)
          Recursive "helper method" that does the real work of the of the previous method.
private  ExtensibleTreeMap.NodeEntry<K,V> ExtensibleTreeMap.firstEntry()
          Returns the first Entry in the TreeMap (according to the TreeMap's key-sort function).
private  ExtensibleTreeMap.NodeEntry<K,V> ExtensibleTreeMap.getCeilEntry(K 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  ExtensibleTreeMap.NodeEntry<K,V> ExtensibleTreeMap.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  ExtensibleTreeMap.NodeEntry<K,V> RangeTreeMap.getEntryByPoint(Comparable<T> point)
           
private  ExtensibleTreeMap.NodeEntry<K,V> ExtensibleTreeMap.getPrecedingEntry(K 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  ExtensibleTreeMap.NodeEntry<K,V> ExtensibleTreeMap.lastEntry()
          Returns the last Entry in the TreeMap (according to the TreeMap's key-sort function).
private static
<K,V> ExtensibleTreeMap.NodeEntry<K,V>
ExtensibleTreeMap.leftOf(ExtensibleTreeMap.NodeEntry<K,V> p)
           
(package private)  ExtensibleTreeMap.NodeEntry<K,V> ExtensibleTreeMap.PrivateEntryIterator.nextEntry()
           
private static
<K,V> ExtensibleTreeMap.NodeEntry<K,V>
ExtensibleTreeMap.parentOf(ExtensibleTreeMap.NodeEntry<K,V> p)
           
private static
<K,V> ExtensibleTreeMap.NodeEntry<K,V>
ExtensibleTreeMap.rightOf(ExtensibleTreeMap.NodeEntry<K,V> p)
           
private  ExtensibleTreeMap.NodeEntry<K,V> ExtensibleTreeMap.successor(ExtensibleTreeMap.NodeEntry<K,V> t)
          Returns the successor of the specified Entry, or null if no such.
 

Methods in net.sf.beanlib.utils.range with parameters of type ExtensibleTreeMap.NodeEntry
private static
<K,V> boolean
ExtensibleTreeMap.colorOf(ExtensibleTreeMap.NodeEntry<K,V> p)
          Balancing operations.
private  void ExtensibleTreeMap.deleteEntry(ExtensibleTreeMap.NodeEntry<K,V> p)
          Delete node p, and then rebalance the tree.
private  void ExtensibleTreeMap.fixAfterDeletion(ExtensibleTreeMap.NodeEntry<K,V> x)
          From CLR *
private  void ExtensibleTreeMap.fixAfterInsertion(ExtensibleTreeMap.NodeEntry<K,V> x)
          From CLR *
private static
<K> K
ExtensibleTreeMap.key(ExtensibleTreeMap.NodeEntry<K,?> e)
          Returns the key corresponding to the specified Entry.
private static
<K,V> ExtensibleTreeMap.NodeEntry<K,V>
ExtensibleTreeMap.leftOf(ExtensibleTreeMap.NodeEntry<K,V> p)
           
private static
<K,V> ExtensibleTreeMap.NodeEntry<K,V>
ExtensibleTreeMap.parentOf(ExtensibleTreeMap.NodeEntry<K,V> p)
           
private static
<K,V> ExtensibleTreeMap.NodeEntry<K,V>
ExtensibleTreeMap.rightOf(ExtensibleTreeMap.NodeEntry<K,V> p)
           
private  void ExtensibleTreeMap.rotateLeft(ExtensibleTreeMap.NodeEntry<K,V> p)
          From CLR *
private  void ExtensibleTreeMap.rotateRight(ExtensibleTreeMap.NodeEntry<K,V> p)
          From CLR *
private static
<K,V> void
ExtensibleTreeMap.setColor(ExtensibleTreeMap.NodeEntry<K,V> p, boolean c)
           
private  ExtensibleTreeMap.NodeEntry<K,V> ExtensibleTreeMap.successor(ExtensibleTreeMap.NodeEntry<K,V> t)
          Returns the successor of the specified Entry, or null if no such.
private  boolean ExtensibleTreeMap.valueSearchNonNull(ExtensibleTreeMap.NodeEntry n, Object value)
           
private  boolean ExtensibleTreeMap.valueSearchNull(ExtensibleTreeMap.NodeEntry n)
           
 

Constructors in net.sf.beanlib.utils.range with parameters of type ExtensibleTreeMap.NodeEntry
ExtensibleTreeMap.NodeEntry(K key, V value, ExtensibleTreeMap.NodeEntry<K,V> parent)
          Make a new cell with given key, value, and parent, and with null child links, and BLACK color.
ExtensibleTreeMap.PrivateEntryIterator(ExtensibleTreeMap.NodeEntry<K,V> first)
           
ExtensibleTreeMap.SubMapEntryIterator(ExtensibleTreeMap.NodeEntry<K,V> first, ExtensibleTreeMap.NodeEntry<K,V> firstExcluded)
           
ExtensibleTreeMap.SubMapEntryIterator(ExtensibleTreeMap.NodeEntry<K,V> first, ExtensibleTreeMap.NodeEntry<K,V> firstExcluded)
           
 

Overview  Package  Class   Use  Tree  Deprecated  Index  Help 
 PREV   NEXT FRAMES    NO FRAMES