IndexedTreeMap.AscendingSubMap (dataset 8.1.1 API)

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:

Serializable, Map<K,V>, NavigableMap<K,V>, SortedMap<K,V>

Enclosing class:

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

Serialized Form

Nested Class Summary

Nested Classes
Modifier and Type Class and Description

protected class IndexedTreeMap.AscendingSubMap.AscendingEntrySetView
- Nested classes/interfaces inherited from class java.util.AbstractMap
  AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>
- Nested classes/interfaces inherited from interface java.util.Map
  Map.Entry<K,V>

Nested Classes
Modifier and Type	Class and Description
`protected class`	`IndexedTreeMap.AscendingSubMap.AscendingEntrySetView`

Field Summary

Fields
Modifier and Type	Field and Description
`protected NavigableMap<K,V>`	`descendingMapView`
`protected de.gsi.dataset.utils.trees.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 and 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
`Map.Entry<K,V>`	`ceilingEntry(K key)`
`K`	`ceilingKey(K key)`
`Comparator<? super K>`	`comparator()`
`boolean`	`containsKey(Object key)`
`Iterator<K>`	`descendingKeyIterator()`
`NavigableSet<K>`	`descendingKeySet()`
`NavigableMap<K,V>`	`descendingMap()`
`Set<Map.Entry<K,V>>`	`entrySet()`
`Map.Entry<K,V>`	`firstEntry()`
`K`	`firstKey()`
`Map.Entry<K,V>`	`floorEntry(K key)`
`K`	`floorKey(K key)`
`V`	`get(Object key)`
`SortedMap<K,V>`	`headMap(K toKey)`
`NavigableMap<K,V>`	`headMap(K toKey, boolean inclusive)`
`Map.Entry<K,V>`	`higherEntry(K key)`
`K`	`higherKey(K key)`
`boolean`	`inClosedRange(Object key)`
`boolean`	`inRange(Object key)`
`boolean`	`inRange(Object key, boolean inclusive)`
`boolean`	`isEmpty()`
`Iterator<K>`	`keyIterator()`
`Set<K>`	`keySet()`
`Map.Entry<K,V>`	`lastEntry()`
`K`	`lastKey()`
`Map.Entry<K,V>`	`lowerEntry(K key)`
`K`	`lowerKey(K key)`
`NavigableSet<K>`	`navigableKeySet()`
`Map.Entry<K,V>`	`pollFirstEntry()`
`Map.Entry<K,V>`	`pollLastEntry()`
`V`	`put(K key, V value)`
`V`	`remove(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()`
`NavigableMap<K,V>`	`subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive)`
`SortedMap<K,V>`	`subMap(K fromKey, K toKey)`
`SortedMap<K,V>`	`tailMap(K fromKey)`
`NavigableMap<K,V>`	`tailMap(K fromKey, boolean inclusive)`
`boolean`	`tooHigh(Object key)`
`boolean`	`tooLow(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.SortedMap
values

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

- 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 NavigableMap<K,V> descendingMapView
```
  - entrySetView
```
protected transient de.gsi.dataset.utils.trees.IndexedTreeMap.NavigableSubMap.EntrySetView entrySetView
```
  - navigableKeySetView
```
protected transient de.gsi.dataset.utils.trees.IndexedTreeMap.KeySet<K> navigableKeySetView
```
- Method Detail
  - comparator
```
public Comparator<? super K> comparator()
```
  - descendingKeyIterator
```
public Iterator<K> descendingKeyIterator()
```
    Returns:
    
    descending iterator from the perspective of this sub-map
  - descendingMap
```
public NavigableMap<K,V> descendingMap()
```
  - entrySet
```
public Set<Map.Entry<K,V>> entrySet()
```
    Specified by:
    
    entrySet in interface Map<K,V>
    
    Specified by:
    
    entrySet in interface SortedMap<K,V>
    
    Specified by:
    
    entrySet in class AbstractMap<K,V>
  - headMap
```
public NavigableMap<K,V> headMap(K toKey,
                                 boolean inclusive)
```
  - keyIterator
```
public 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 NavigableMap<K,V> subMap(K fromKey,
                                boolean fromInclusive,
                                K toKey,
                                boolean toInclusive)
```
  - tailMap
```
public 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 Map.Entry<K,V> ceilingEntry(K key)
```
    Specified by:
    
    ceilingEntry in interface NavigableMap<K,V>
  - ceilingKey
```
public final K ceilingKey(K key)
```
    Specified by:
    
    ceilingKey in interface NavigableMap<K,V>
  - containsKey
```
public final boolean containsKey(Object key)
```
    Specified by:
    
    containsKey in interface Map<K,V>
    
    Overrides:
    
    containsKey in class AbstractMap<K,V>
  - descendingKeySet
```
public NavigableSet<K> descendingKeySet()
```
    Specified by:
    
    descendingKeySet in interface NavigableMap<K,V>
  - firstEntry
```
public final Map.Entry<K,V> firstEntry()
```
    Specified by:
    
    firstEntry in interface NavigableMap<K,V>
  - firstKey
```
public final K firstKey()
```
    Specified by:
    
    firstKey in interface SortedMap<K,V>
  - floorEntry
```
public final Map.Entry<K,V> floorEntry(K key)
```
    Specified by:
    
    floorEntry in interface NavigableMap<K,V>
  - floorKey
```
public final K floorKey(K key)
```
    Specified by:
    
    floorKey in interface NavigableMap<K,V>
  - get
```
public final V get(Object key)
```
    Specified by:
    
    get in interface Map<K,V>
    
    Overrides:
    
    get in class AbstractMap<K,V>
  - headMap
```
public final SortedMap<K,V> headMap(K toKey)
```
    Specified by:
    
    headMap in interface NavigableMap<K,V>
    
    Specified by:
    
    headMap in interface SortedMap<K,V>
  - higherEntry
```
public final Map.Entry<K,V> higherEntry(K key)
```
    Specified by:
    
    higherEntry in interface NavigableMap<K,V>
  - higherKey
```
public final K higherKey(K key)
```
    Specified by:
    
    higherKey in interface NavigableMap<K,V>
  - inClosedRange
```
public final boolean inClosedRange(Object key)
```
  - inRange
```
public final boolean inRange(Object key)
```
  - inRange
```
public final boolean inRange(Object key,
                             boolean inclusive)
```
  - isEmpty
```
public boolean isEmpty()
```
    Specified by:
    
    isEmpty in interface Map<K,V>
    
    Overrides:
    
    isEmpty in class AbstractMap<K,V>
  - keySet
```
public final Set<K> keySet()
```
    Specified by:
    
    keySet in interface Map<K,V>
    
    Specified by:
    
    keySet in interface SortedMap<K,V>
    
    Overrides:
    
    keySet in class AbstractMap<K,V>
  - lastEntry
```
public final Map.Entry<K,V> lastEntry()
```
    Specified by:
    
    lastEntry in interface NavigableMap<K,V>
  - lastKey
```
public final K lastKey()
```
    Specified by:
    
    lastKey in interface SortedMap<K,V>
  - lowerEntry
```
public final Map.Entry<K,V> lowerEntry(K key)
```
    Specified by:
    
    lowerEntry in interface NavigableMap<K,V>
  - lowerKey
```
public final K lowerKey(K key)
```
    Specified by:
    
    lowerKey in interface NavigableMap<K,V>
  - navigableKeySet
```
public final NavigableSet<K> navigableKeySet()
```
    Specified by:
    
    navigableKeySet in interface NavigableMap<K,V>
  - pollFirstEntry
```
public final Map.Entry<K,V> pollFirstEntry()
```
    Specified by:
    
    pollFirstEntry in interface NavigableMap<K,V>
  - pollLastEntry
```
public final Map.Entry<K,V> pollLastEntry()
```
    Specified by:
    
    pollLastEntry in interface NavigableMap<K,V>
  - put
```
public final V put(K key,
                   V value)
```
    Specified by:
    
    put in interface Map<K,V>
    
    Overrides:
    
    put in class AbstractMap<K,V>
  - remove
```
public final V remove(Object key)
```
    Specified by:
    
    remove in interface Map<K,V>
    
    Overrides:
    
    remove in class AbstractMap<K,V>
  - size
```
public int size()
```
    Specified by:
    
    size in interface Map<K,V>
    
    Overrides:
    
    size in class AbstractMap<K,V>
  - subMap
```
public final SortedMap<K,V> subMap(K fromKey,
                                   K toKey)
```
    Specified by:
    
    subMap in interface NavigableMap<K,V>
    
    Specified by:
    
    subMap in interface SortedMap<K,V>
  - tailMap
```
public final SortedMap<K,V> tailMap(K fromKey)
```
    Specified by:
    
    tailMap in interface NavigableMap<K,V>
    
    Specified by:
    
    tailMap in interface SortedMap<K,V>
  - tooHigh
```
public final boolean tooHigh(Object key)
```
  - tooLow
```
public final boolean tooLow(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.SortedMap

Methods inherited from interface java.util.Map

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