java.lang.Object
- java.util.AbstractMap<K,V>
- - de.gsi.dataset.utils.trees.IndexedTreeMap.AscendingSubMap<K,V>

Type Parameters:

K - key value type

V - value value type

All Implemented Interfaces:

java.io.Serializable, java.util.Map<K,V>, java.util.NavigableMap<K,V>, java.util.SortedMap<K,V>

Enclosing class:

IndexedTreeMap<K,V>
```
protected static final class IndexedTreeMap.AscendingSubMap<K,V>
extends java.util.AbstractMap<K,V>
```
See Also:

Serialized Form

Nested Class Summary

Nested Classes
Modifier and Type	Class	Description
`protected class`	`IndexedTreeMap.AscendingSubMap.AscendingEntrySetView`
`protected class`	`IndexedTreeMap.NavigableSubMap.DescendingSubMapEntryIterator`
`protected class`	`IndexedTreeMap.NavigableSubMap.DescendingSubMapKeyIterator`
`protected class`	`IndexedTreeMap.NavigableSubMap.EntrySetView`
`protected class`	`IndexedTreeMap.NavigableSubMap.SubMapEntryIterator`
`protected class`	`IndexedTreeMap.NavigableSubMap.SubMapIterator<T>`	Iterators for SubMaps
`protected class`	`IndexedTreeMap.NavigableSubMap.SubMapKeyIterator`

Nested classes/interfaces inherited from class java.util.AbstractMap
java.util.AbstractMap.SimpleEntry<K extends java.lang.Object,V extends java.lang.Object>, java.util.AbstractMap.SimpleImmutableEntry<K extends java.lang.Object,V extends java.lang.Object>

Nested classes/interfaces inherited from interface java.util.Map
java.util.Map.Entry<K extends java.lang.Object,V extends java.lang.Object>

Field Summary

Fields
Modifier and Type	Field	Description
`protected java.util.NavigableMap<K,V>`	`descendingMapView`
`protected IndexedTreeMap.NavigableSubMap.EntrySetView`	`entrySetView`
`protected boolean`	`fromStart`
`protected K`	`hi`	Endpoints are represented as triples (fromStart, lo, loInclusive) and (toEnd, hi, hiInclusive).
`protected boolean`	`hiInclusive`
`protected K`	`lo`	Endpoints are represented as triples (fromStart, lo, loInclusive) and (toEnd, hi, hiInclusive).
`protected boolean`	`loInclusive`
`protected IndexedTreeMap<K,V>`	`m`	The backing map.
`protected de.gsi.dataset.utils.trees.IndexedTreeMap.KeySet<K>`	`navigableKeySetView`
`protected boolean`	`toEnd`

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`IndexedTreeMap.Entry<K,V>`	`absCeiling(K key)`
`IndexedTreeMap.Entry<K,V>`	`absFloor(K key)`
`IndexedTreeMap.Entry<K,V>`	`absHigher(K key)`
`IndexedTreeMap.Entry<K,V>`	`absHighest()`
`IndexedTreeMap.Entry<K,V>`	`absHighFence()`	Returns the absolute high fence for ascending traversal
`IndexedTreeMap.Entry<K,V>`	`absLower(K key)`
`IndexedTreeMap.Entry<K,V>`	`absLowest()`
`IndexedTreeMap.Entry<K,V>`	`absLowFence()`	Return the absolute low fence for descending traversal
`java.util.Map.Entry<K,V>`	`ceilingEntry(K key)`
`K`	`ceilingKey(K key)`
`java.util.Comparator<? super K>`	`comparator()`
`boolean`	`containsKey(java.lang.Object key)`
`java.util.Iterator<K>`	`descendingKeyIterator()`
`java.util.NavigableSet<K>`	`descendingKeySet()`
`java.util.NavigableMap<K,V>`	`descendingMap()`
`java.util.Set<java.util.Map.Entry<K,V>>`	`entrySet()`
`java.util.Map.Entry<K,V>`	`firstEntry()`
`K`	`firstKey()`
`java.util.Map.Entry<K,V>`	`floorEntry(K key)`
`K`	`floorKey(K key)`
`V`	`get(java.lang.Object key)`
`java.util.SortedMap<K,V>`	`headMap(K toKey)`
`java.util.NavigableMap<K,V>`	`headMap(K toKey, boolean inclusive)`
`java.util.Map.Entry<K,V>`	`higherEntry(K key)`
`K`	`higherKey(K key)`
`boolean`	`inClosedRange(java.lang.Object key)`
`boolean`	`inRange(java.lang.Object key)`
`boolean`	`inRange(java.lang.Object key, boolean inclusive)`
`boolean`	`isEmpty()`
`java.util.Iterator<K>`	`keyIterator()`
`java.util.Set<K>`	`keySet()`
`java.util.Map.Entry<K,V>`	`lastEntry()`
`K`	`lastKey()`
`java.util.Map.Entry<K,V>`	`lowerEntry(K key)`
`K`	`lowerKey(K key)`
`java.util.NavigableSet<K>`	`navigableKeySet()`
`java.util.Map.Entry<K,V>`	`pollFirstEntry()`
`java.util.Map.Entry<K,V>`	`pollLastEntry()`
`V`	`put(K key, V value)`
`V`	`remove(java.lang.Object key)`
`int`	`size()`
`IndexedTreeMap.Entry<K,V>`	`subCeiling(K key)`
`IndexedTreeMap.Entry<K,V>`	`subFloor(K key)`
`IndexedTreeMap.Entry<K,V>`	`subHigher(K key)`
`IndexedTreeMap.Entry<K,V>`	`subHighest()`
`IndexedTreeMap.Entry<K,V>`	`subLower(K key)`
`IndexedTreeMap.Entry<K,V>`	`subLowest()`
`java.util.NavigableMap<K,V>`	`subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive)`
`java.util.SortedMap<K,V>`	`subMap(K fromKey, K toKey)`
`java.util.SortedMap<K,V>`	`tailMap(K fromKey)`
`java.util.NavigableMap<K,V>`	`tailMap(K fromKey, boolean inclusive)`
`boolean`	`tooHigh(java.lang.Object key)`
`boolean`	`tooLow(java.lang.Object key)`

Methods inherited from class java.util.AbstractMap
clear, clone, containsValue, equals, hashCode, putAll, toString, values

Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Map
clear, compute, computeIfAbsent, computeIfPresent, containsValue, equals, forEach, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAll

Methods inherited from interface java.util.SortedMap
values

- Field Detail
  - m
```
protected final IndexedTreeMap<K,V> m
```
    The backing map.
  - lo
```
protected final K lo
```
    Endpoints are represented as triples (fromStart, lo, loInclusive) and (toEnd, hi, hiInclusive). If fromStart is true, then the low (absolute) bound is the start of the backing map, and the other values are ignored. Otherwise, if loInclusive is true, lo is the inclusive bound, else lo is the exclusive bound. Similarly for the upper bound.
  - hi
```
protected final K hi
```
    Endpoints are represented as triples (fromStart, lo, loInclusive) and (toEnd, hi, hiInclusive). If fromStart is true, then the low (absolute) bound is the start of the backing map, and the other values are ignored. Otherwise, if loInclusive is true, lo is the inclusive bound, else lo is the exclusive bound. Similarly for the upper bound.
  - fromStart
```
protected final boolean fromStart
```
  - toEnd
```
protected final boolean toEnd
```
  - loInclusive
```
protected final boolean loInclusive
```
  - hiInclusive
```
protected final boolean hiInclusive
```
  - descendingMapView
```
protected transient java.util.NavigableMap<K,V> descendingMapView
```
  - entrySetView
```
protected transient IndexedTreeMap.NavigableSubMap.EntrySetView entrySetView
```
  - navigableKeySetView
```
protected transient de.gsi.dataset.utils.trees.IndexedTreeMap.KeySet<K> navigableKeySetView
```
- Method Detail
  - comparator
```
public java.util.Comparator<? super K> comparator()
```
  - descendingKeyIterator
```
public java.util.Iterator<K> descendingKeyIterator()
```
    Returns:
    
    descending iterator from the perspective of this sub-map
  - descendingMap
```
public java.util.NavigableMap<K,V> descendingMap()
```
  - entrySet
```
public java.util.Set<java.util.Map.Entry<K,V>> entrySet()
```
    Specified by:
    
    entrySet in interface java.util.Map<K,V>
    
    Specified by:
    
    entrySet in interface java.util.SortedMap<K,V>
    
    Specified by:
    
    entrySet in class java.util.AbstractMap<K,V>
  - headMap
```
public java.util.NavigableMap<K,V> headMap(K toKey,
                                                 boolean inclusive)
```
  - keyIterator
```
public java.util.Iterator<K> keyIterator()
```
    Returns:
    
    ascending iterator from the perspective of this sub-map
  - subCeiling
```
public IndexedTreeMap.Entry<K,V> subCeiling(K key)
```
  - subFloor
```
public IndexedTreeMap.Entry<K,V> subFloor(K key)
```
  - subHigher
```
public IndexedTreeMap.Entry<K,V> subHigher(K key)
```
  - subHighest
```
public IndexedTreeMap.Entry<K,V> subHighest()
```
  - subLower
```
public IndexedTreeMap.Entry<K,V> subLower(K key)
```
  - subLowest
```
public IndexedTreeMap.Entry<K,V> subLowest()
```
  - subMap
```
public java.util.NavigableMap<K,V> subMap(K fromKey,
                                                boolean fromInclusive,
                                                K toKey,
                                                boolean toInclusive)
```
  - tailMap
```
public java.util.NavigableMap<K,V> tailMap(K fromKey,
                                                 boolean inclusive)
```
  - absCeiling
```
public final IndexedTreeMap.Entry<K,V> absCeiling(K key)
```
  - absFloor
```
public final IndexedTreeMap.Entry<K,V> absFloor(K key)
```
  - absHigher
```
public final IndexedTreeMap.Entry<K,V> absHigher(K key)
```
  - absHighest
```
public final IndexedTreeMap.Entry<K,V> absHighest()
```
  - absHighFence
```
public final IndexedTreeMap.Entry<K,V> absHighFence()
```
    Returns the absolute high fence for ascending traversal
    
    Returns:
    
    entry
  - absLower
```
public final IndexedTreeMap.Entry<K,V> absLower(K key)
```
  - absLowest
```
public final IndexedTreeMap.Entry<K,V> absLowest()
```
  - absLowFence
```
public final IndexedTreeMap.Entry<K,V> absLowFence()
```
    Return the absolute low fence for descending traversal
    
    Returns:
    
    entry
  - ceilingEntry
```
public final java.util.Map.Entry<K,V> ceilingEntry(K key)
```
    Specified by:
    
    ceilingEntry in interface java.util.NavigableMap<K,V>
  - ceilingKey
```
public final K ceilingKey(K key)
```
    Specified by:
    
    ceilingKey in interface java.util.NavigableMap<K,V>
  - containsKey
```
public final boolean containsKey(java.lang.Object key)
```
    Specified by:
    
    containsKey in interface java.util.Map<K,V>
    
    Overrides:
    
    containsKey in class java.util.AbstractMap<K,V>
  - descendingKeySet
```
public java.util.NavigableSet<K> descendingKeySet()
```
    Specified by:
    
    descendingKeySet in interface java.util.NavigableMap<K,V>
  - firstEntry
```
public final java.util.Map.Entry<K,V> firstEntry()
```
    Specified by:
    
    firstEntry in interface java.util.NavigableMap<K,V>
  - firstKey
```
public final K firstKey()
```
    Specified by:
    
    firstKey in interface java.util.SortedMap<K,V>
  - floorEntry
```
public final java.util.Map.Entry<K,V> floorEntry(K key)
```
    Specified by:
    
    floorEntry in interface java.util.NavigableMap<K,V>
  - floorKey
```
public final K floorKey(K key)
```
    Specified by:
    
    floorKey in interface java.util.NavigableMap<K,V>
  - get
```
public final V get(java.lang.Object key)
```
    Specified by:
    
    get in interface java.util.Map<K,V>
    
    Overrides:
    
    get in class java.util.AbstractMap<K,V>
  - headMap
```
public final java.util.SortedMap<K,V> headMap(K toKey)
```
    Specified by:
    
    headMap in interface java.util.NavigableMap<K,V>
    
    Specified by:
    
    headMap in interface java.util.SortedMap<K,V>
  - higherEntry
```
public final java.util.Map.Entry<K,V> higherEntry(K key)
```
    Specified by:
    
    higherEntry in interface java.util.NavigableMap<K,V>
  - higherKey
```
public final K higherKey(K key)
```
    Specified by:
    
    higherKey in interface java.util.NavigableMap<K,V>
  - inClosedRange
```
public final boolean inClosedRange(java.lang.Object key)
```
  - inRange
```
public final boolean inRange(java.lang.Object key)
```
  - inRange
```
public final boolean inRange(java.lang.Object key,
                             boolean inclusive)
```
  - isEmpty
```
public boolean isEmpty()
```
    Specified by:
    
    isEmpty in interface java.util.Map<K,V>
    
    Overrides:
    
    isEmpty in class java.util.AbstractMap<K,V>
  - keySet
```
public final java.util.Set<K> keySet()
```
    Specified by:
    
    keySet in interface java.util.Map<K,V>
    
    Specified by:
    
    keySet in interface java.util.SortedMap<K,V>
    
    Overrides:
    
    keySet in class java.util.AbstractMap<K,V>
  - lastEntry
```
public final java.util.Map.Entry<K,V> lastEntry()
```
    Specified by:
    
    lastEntry in interface java.util.NavigableMap<K,V>
  - lastKey
```
public final K lastKey()
```
    Specified by:
    
    lastKey in interface java.util.SortedMap<K,V>
  - lowerEntry
```
public final java.util.Map.Entry<K,V> lowerEntry(K key)
```
    Specified by:
    
    lowerEntry in interface java.util.NavigableMap<K,V>
  - lowerKey
```
public final K lowerKey(K key)
```
    Specified by:
    
    lowerKey in interface java.util.NavigableMap<K,V>
  - navigableKeySet
```
public final java.util.NavigableSet<K> navigableKeySet()
```
    Specified by:
    
    navigableKeySet in interface java.util.NavigableMap<K,V>
  - pollFirstEntry
```
public final java.util.Map.Entry<K,V> pollFirstEntry()
```
    Specified by:
    
    pollFirstEntry in interface java.util.NavigableMap<K,V>
  - pollLastEntry
```
public final java.util.Map.Entry<K,V> pollLastEntry()
```
    Specified by:
    
    pollLastEntry in interface java.util.NavigableMap<K,V>
  - put
```
public final V put(K key,
                   V value)
```
    Specified by:
    
    put in interface java.util.Map<K,V>
    
    Overrides:
    
    put in class java.util.AbstractMap<K,V>
  - remove
```
public final V remove(java.lang.Object key)
```
    Specified by:
    
    remove in interface java.util.Map<K,V>
    
    Overrides:
    
    remove in class java.util.AbstractMap<K,V>
  - size
```
public int size()
```
    Specified by:
    
    size in interface java.util.Map<K,V>
    
    Overrides:
    
    size in class java.util.AbstractMap<K,V>
  - subMap
```
public final java.util.SortedMap<K,V> subMap(K fromKey,
                                                   K toKey)
```
    Specified by:
    
    subMap in interface java.util.NavigableMap<K,V>
    
    Specified by:
    
    subMap in interface java.util.SortedMap<K,V>
  - tailMap
```
public final java.util.SortedMap<K,V> tailMap(K fromKey)
```
    Specified by:
    
    tailMap in interface java.util.NavigableMap<K,V>
    
    Specified by:
    
    tailMap in interface java.util.SortedMap<K,V>
  - tooHigh
```
public final boolean tooHigh(java.lang.Object key)
```
  - tooLow
```
public final boolean tooLow(java.lang.Object key)
```

Class IndexedTreeMap.AscendingSubMap<K,​V>

Nested Class Summary

Nested classes/interfaces inherited from class java.util.AbstractMap

Nested classes/interfaces inherited from interface java.util.Map

Field Summary

Method Summary

Methods inherited from class java.util.AbstractMap

Methods inherited from class java.lang.Object

Methods inherited from interface java.util.Map

Methods inherited from interface java.util.SortedMap

Field Detail

m

lo

hi

fromStart

toEnd

loInclusive

hiInclusive

descendingMapView

entrySetView

navigableKeySetView

Method Detail

comparator

descendingKeyIterator

descendingMap

entrySet

headMap

keyIterator

subCeiling

subFloor

subHigher

subHighest

subLower

subLowest

subMap

tailMap

absCeiling

absFloor

absHigher

absHighest

absHighFence

absLower

absLowest

absLowFence

ceilingEntry

ceilingKey

containsKey

descendingKeySet

firstEntry

firstKey

floorEntry

floorKey

get

headMap

higherEntry

higherKey

inClosedRange

inRange

inRange

isEmpty

keySet

lastEntry

lastKey

lowerEntry

lowerKey

navigableKeySet

pollFirstEntry

pollLastEntry

put

remove

size

subMap

tailMap

tooHigh

tooLow

Class IndexedTreeMap.AscendingSubMap<K,V>