K - the type of the keys in the mapV - the type of the values in the mappublic abstract class AbstractSortedMapDecorator<K,V> extends AbstractMapDecorator<K,V> implements IterableSortedMap<K,V>
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.
| Modifier and Type | Class and Description |
|---|---|
protected static class |
AbstractSortedMapDecorator.SortedMapIterator<K,V>
OrderedMapIterator implementation.
|
| Modifier | Constructor and Description |
|---|---|
protected |
AbstractSortedMapDecorator()
Constructor only used in deserialization, do not use otherwise.
|
|
AbstractSortedMapDecorator(SortedMap<K,V> map)
Constructor that wraps (not copies).
|
| Modifier and Type | Method and Description |
|---|---|
Comparator<? super K> |
comparator() |
protected SortedMap<K,V> |
decorated()
Gets the map being decorated.
|
K |
firstKey()
Gets the first key currently in this map.
|
SortedMap<K,V> |
headMap(K toKey) |
K |
lastKey()
Gets the last key currently in this map.
|
OrderedMapIterator<K,V> |
mapIterator()
Obtains a
MapIterator over the map. |
K |
nextKey(K key)
Gets the next key after the one specified.
|
K |
previousKey(K key)
Gets the previous key before the one specified.
|
SortedMap<K,V> |
subMap(K fromKey,
K toKey) |
SortedMap<K,V> |
tailMap(K fromKey) |
clear, containsKey, containsValue, entrySet, equals, get, hashCode, isEmpty, keySet, put, putAll, remove, size, toString, valuesclone, finalize, getClass, notify, notifyAll, wait, wait, waitclear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, sizecontainsKey, containsValue, entrySet, get, isEmpty, keySet, remove, size, valuesprotected AbstractSortedMapDecorator()
public AbstractSortedMapDecorator(SortedMap<K,V> map)
map - the map to decorate, must not be nullNullPointerException - if the map is nullprotected SortedMap<K,V> decorated()
decorated in class AbstractMapDecorator<K,V>public Comparator<? super K> comparator()
comparator in interface SortedMap<K,V>public K firstKey()
OrderedMappublic K lastKey()
OrderedMappublic K previousKey(K key)
OrderedMappreviousKey in interface OrderedMap<K,V>key - the key to search for previous frompublic K nextKey(K key)
OrderedMapnextKey in interface OrderedMap<K,V>key - the key to search for next frompublic OrderedMapIterator<K,V> mapIterator()
MapIterator over 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);
}
mapIterator in interface IterableGet<K,V>mapIterator in interface OrderedMap<K,V>mapIterator in class AbstractIterableMap<K,V>Copyright © 2001–2019 The Apache Software Foundation. All rights reserved.