AscendingSubMap(TreeMap m,
    boolean fromStart,
    K lo,
    boolean loInclusive,
    boolean toEnd,
    K hi,
    boolean hiInclusive) 
{
         
            super(m, fromStart, lo, loInclusive, toEnd, hi, hiInclusive);
}

 public Comparator comparator() 
{
            return m.comparator();
}

 Iterator descendingKeyIterator() 
{
            return new DescendingSubMapKeyIterator(absHighest(), absLowFence());
}

 public NavigableMap descendingMap() 
{
            NavigableMap< K,V > mv = descendingMapView;
            return (mv != null) ? mv :
                (descendingMapView =
                 new DescendingSubMap(m,
                                      fromStart, lo, loInclusive,
                                      toEnd,     hi, hiInclusive));
}

 public Set entrySet() 
{
            EntrySetView es = entrySetView;
            return (es != null) ? es : new AscendingEntrySetView();
}

 public NavigableMap headMap(K toKey,
    boolean inclusive) 
{
            if (!inRange(toKey, inclusive))
                throw new IllegalArgumentException("toKey out of range");
            return new AscendingSubMap(m,
                                       fromStart, lo,    loInclusive,
                                       false,     toKey, inclusive);
}

 Iterator keyIterator() 
{
            return new SubMapKeyIterator(absLowest(), absHighFence());
}

 TreeMap.Entry subCeiling(K key) 
{
 return absCeiling(key);
}

 TreeMap.Entry subFloor(K key) 
{
 return absFloor(key);
}

 TreeMap.Entry subHigher(K key) 
{
 return absHigher(key);
}

 TreeMap.Entry subHighest() 
{
 return absHighest();
}

 TreeMap.Entry subLower(K key) 
{
 return absLower(key);
}

 TreeMap.Entry subLowest() 
{
 return absLowest();
}

 public NavigableMap subMap(K fromKey,
    boolean fromInclusive,
    K toKey,
    boolean toInclusive) 
{
            if (!inRange(fromKey, fromInclusive))
                throw new IllegalArgumentException("fromKey out of range");
            if (!inRange(toKey, toInclusive))
                throw new IllegalArgumentException("toKey out of range");
            return new AscendingSubMap(m,
                                       false, fromKey, fromInclusive,
                                       false, toKey,   toInclusive);
}

 public NavigableMap tailMap(K fromKey,
    boolean inclusive) 
{
            if (!inRange(fromKey, inclusive))
                throw new IllegalArgumentException("fromKey out of range");
            return new AscendingSubMap(m,
                                       false, fromKey, inclusive,
                                       toEnd, hi,      hiInclusive);
}