Home » openjdk-7 » java » util » [javadoc | source]
abstract static class: TreeMap.NavigableSubMap [javadoc | source]
   java.util.AbstractMap<K, V>

All Implemented Interfaces:
    NavigableMap, Serializable, Map

Direct Known Subclasses:
    DescendingSubMap, AscendingSubMap

Nested Class Summary:
abstract class  NavigableSubMap.EntrySetView   
abstract class  NavigableSubMap.SubMapIterator  Iterators for SubMaps 
final class  NavigableSubMap.SubMapEntryIterator   
final class  NavigableSubMap.SubMapKeyIterator   
final class  NavigableSubMap.DescendingSubMapEntryIterator   
final class  NavigableSubMap.DescendingSubMapKeyIterator   
Field Summary
final  TreeMap<K, V> m    The backing map. 
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. 
final  K hi     
final  boolean fromStart     
final  boolean toEnd     
final  boolean loInclusive     
final  boolean hiInclusive     
transient  NavigableMap<K, V> descendingMapView     
transient  EntrySetView entrySetView     
transient  KeySet<K> navigableKeySetView     
Fields inherited from java.util.AbstractMap:
keySet,  values
 NavigableSubMap(TreeMap<K, V> m,
    boolean fromStart,
    K lo,
    boolean loInclusive,
    boolean toEnd,
    K hi,
    boolean hiInclusive) 
Method from java.util.TreeMap$NavigableSubMap Summary:
absCeiling,   absFloor,   absHighFence,   absHigher,   absHighest,   absLowFence,   absLower,   absLowest,   ceilingEntry,   ceilingKey,   containsKey,   descendingKeyIterator,   descendingKeySet,   firstEntry,   firstKey,   floorEntry,   floorKey,   get,   headMap,   higherEntry,   higherKey,   inClosedRange,   inRange,   inRange,   isEmpty,   keyIterator,   keySet,   lastEntry,   lastKey,   lowerEntry,   lowerKey,   navigableKeySet,   pollFirstEntry,   pollLastEntry,   put,   remove,   size,   subCeiling,   subFloor,   subHigher,   subHighest,   subLower,   subLowest,   subMap,   tailMap,   tooHigh,   tooLow
Methods from java.util.AbstractMap:
clear,   clone,   containsKey,   containsValue,   entrySet,   equals,   get,   hashCode,   isEmpty,   keySet,   put,   putAll,   remove,   size,   toString,   values
Methods from java.lang.Object:
clone,   equals,   finalize,   getClass,   hashCode,   notify,   notifyAll,   toString,   wait,   wait,   wait
Method from java.util.TreeMap$NavigableSubMap Detail:
 final Entry<K, V> absCeiling(K key) 
 final Entry<K, V> absFloor(K key) 
 final Entry<K, V> absHighFence() 
    Returns the absolute high fence for ascending traversal
 final Entry<K, V> absHigher(K key) 
 final Entry<K, V> absHighest() 
 final Entry<K, V> absLowFence() 
    Return the absolute low fence for descending traversal
 final Entry<K, V> absLower(K key) 
 final Entry<K, V> absLowest() 
 public final Entry<K, V> ceilingEntry(K key) 
 public final K ceilingKey(K key) 
 public final boolean containsKey(Object key) 
 abstract Iterator<K> descendingKeyIterator()
    Returns descending iterator from the perspective of this submap
 public NavigableSet<K> descendingKeySet() 
 public final Entry<K, V> firstEntry() 
 public final K firstKey() 
 public final Entry<K, V> floorEntry(K key) 
 public final K floorKey(K key) 
 public final V get(Object key) 
 public final SortedMap<K, V> headMap(K toKey) 
 public final Entry<K, V> higherEntry(K key) 
 public final K higherKey(K key) 
 final boolean inClosedRange(Object key) 
 final boolean inRange(Object key) 
 final boolean inRange(Object key,
    boolean inclusive) 
 public boolean isEmpty() 
 abstract Iterator<K> keyIterator()
    Returns ascending iterator from the perspective of this submap
 public final Set<K> keySet() 
 public final Entry<K, V> lastEntry() 
 public final K lastKey() 
 public final Entry<K, V> lowerEntry(K key) 
 public final K lowerKey(K key) 
 public final NavigableSet<K> navigableKeySet() 
 public final Entry<K, V> pollFirstEntry() 
 public final Entry<K, V> pollLastEntry() 
 public final V put(K key,
    V value) 
 public final V remove(Object key) 
 public int size() 
 abstract Entry<K, V> subCeiling(K key)
 abstract Entry<K, V> subFloor(K key)
 abstract Entry<K, V> subHigher(K key)
 abstract Entry<K, V> subHighest()
 abstract Entry<K, V> subLower(K key)
 abstract Entry<K, V> subLowest()
 public final SortedMap<K, V> subMap(K fromKey,
    K toKey) 
 public final SortedMap<K, V> tailMap(K fromKey) 
 final boolean tooHigh(Object key) 
 final boolean tooLow(Object key)