IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.exactEntry(int index) |
|
IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.getCeilingEntry(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.
|
IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.getEntry(K key) |
Returns this map's entry for the given key, or null if the map does not contain an entry for the
key.
|
IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.getEntryUsingComparator(K key) |
Version of getEntry using comparator.
|
IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.getFirstEntry() |
Returns the first Entry in the IndexedTreeMap (according to the IndexedTreeMap's key-sort function).
|
IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.getFloorEntry(K key) |
Gets the entry corresponding to the specified key; if no such entry exists, returns the entry for the greatest
key less than the specified key; if no such entry exists, returns null.
|
IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.getHigherEntry(K key) |
Gets the entry for the least key greater than 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 returns null.
|
IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.getLastEntry() |
Returns the last Entry in the IndexedTreeMap (according to the IndexedTreeMap's key-sort function).
|
IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.getLowerEntry(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.
|
IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.PrivateEntryIterator.nextEntry() |
|
static <K,V> IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.predecessor(IndexedTreeMap.Entry<K,V> t) |
Returns the predecessor of the specified Entry, or null if no such.
|
IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.PrivateEntryIterator.prevEntry() |
|
IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.AscendingSubMap.subCeiling(K key) |
|
IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.AscendingSubMap.subFloor(K key) |
|
IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.AscendingSubMap.subHigher(K key) |
|
IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.AscendingSubMap.subHighest() |
|
IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.AscendingSubMap.subLower(K key) |
|
IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.AscendingSubMap.subLowest() |
|
static <K,V> IndexedTreeMap.Entry<K,V> |
IndexedTreeMap.successor(IndexedTreeMap.Entry<K,V> t) |
Returns the successor of the specified Entry, or null if no such.
|