Class AbstractSortedMapDecorator<K,V> 
java.lang.Object
org.apache.commons.collections4.map.AbstractIterableMap<K,V>
 
org.apache.commons.collections4.map.AbstractMapDecorator<K,V>
 
org.apache.commons.collections4.map.AbstractSortedMapDecorator<K,V> 
- Type Parameters:
- K- the type of the keys in the map
- V- the type of the values in the map
- All Implemented Interfaces:
- Map<K,,- V> - SortedMap<K,,- V> - Get<K,,- V> - IterableGet<K,,- V> - IterableMap<K,,- V> - IterableSortedMap<K,,- V> - OrderedMap<K,,- V> - Put<K,- V> 
- Direct Known Subclasses:
- DualTreeBidiMap.ViewMap,- FixedSizeSortedMap,- UnmodifiableSortedMap
public abstract class AbstractSortedMapDecorator<K,V> 
extends AbstractMapDecorator<K,V>
implements IterableSortedMap<K,V>  
Provides a base decorator that enables additional functionality to be added
 to a Map via decoration.
 
Methods are forwarded directly to the decorated map.
This implementation does not perform any special processing with the map views. Instead it simply returns the set/collection from the wrapped map. This may be undesirable, for example if you are trying to write a validating implementation it would provide a loophole around the validation. But, you might want that loophole, so this class is kept simple.
- Since:
- 3.0
- 
Nested Class SummaryNested ClassesModifier and TypeClassDescriptionprotected static classOrderedMapIterator implementation.
- 
Constructor SummaryConstructorsModifierConstructorDescriptionprotectedConstructor only used in deserialization, do not use otherwise.Constructor that wraps (not copies).
- 
Method SummaryModifier and TypeMethodDescriptionComparator<? super K> Gets the map being decorated.firstKey()Gets the first key currently in this map.lastKey()Gets the last key currently in this map.Obtains aMapIteratorover the map.Gets the next key after the one specified.previousKey(K key) Gets the previous key before the one specified.Methods inherited from class org.apache.commons.collections4.map.AbstractMapDecoratorclear, containsKey, containsValue, entrySet, equals, get, hashCode, isEmpty, keySet, put, putAll, remove, size, toString, valuesMethods inherited from class java.lang.Objectclone, finalize, getClass, notify, notifyAll, wait, wait, waitMethods inherited from interface org.apache.commons.collections4.GetcontainsKey, containsValue, entrySet, get, isEmpty, keySet, remove, size, valuesMethods inherited from interface java.util.Mapclear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size
- 
Constructor Details- 
AbstractSortedMapDecoratorprotected AbstractSortedMapDecorator()Constructor only used in deserialization, do not use otherwise.- Since:
- 3.1
 
- 
AbstractSortedMapDecoratorConstructor that wraps (not copies).- Parameters:
- map- the map to decorate, must not be null
- Throws:
- NullPointerException- if the map is null
 
 
- 
- 
Method Details- 
comparator- Specified by:
- comparatorin interface- SortedMap<K,- V> 
 
- 
decorated
- 
firstKey
- 
headMap
- 
lastKey
- 
mapIteratorObtains aMapIteratorover the map.A map iterator is an efficient way of iterating over maps. There is no need to access the entry set or use Map Entry objects. IterableMap<String,Integer> map = new HashedMap<String,Integer>(); MapIterator<String,Integer> it = map.mapIterator(); while (it.hasNext()) { String key = it.next(); Integer value = it.getValue(); it.setValue(value + 1); }- Specified by:
- mapIteratorin interface- IterableGet<K,- V> 
- Specified by:
- mapIteratorin interface- OrderedMap<K,- V> 
- Overrides:
- mapIteratorin class- AbstractIterableMap<K,- V> 
- Returns:
- a map iterator
 
- 
nextKeyDescription copied from interface:OrderedMapGets the next key after the one specified.- Specified by:
- nextKeyin interface- OrderedMap<K,- V> 
- Parameters:
- key- the key to search for next from
- Returns:
- the next key, null if no match or at end
 
- 
previousKeyDescription copied from interface:OrderedMapGets the previous key before the one specified.- Specified by:
- previousKeyin interface- OrderedMap<K,- V> 
- Parameters:
- key- the key to search for previous from
- Returns:
- the previous key, null if no match or at start
 
- 
subMap
- 
tailMap
 
-