java.util.Map<K,V>, Get<K,V>, IterableGet<K,V>, IterableMap<K,V>, OrderedMap<K,V>, Put<K,V>UnmodifiableOrderedMappublic abstract class AbstractOrderedMapDecorator<K,V> extends AbstractMapDecorator<K,V> implements OrderedMap<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 | Constructor | Description |
|---|---|---|
protected |
AbstractOrderedMapDecorator() |
Constructor only used in deserialization, do not use otherwise.
|
|
AbstractOrderedMapDecorator(OrderedMap<K,V> map) |
Constructor that wraps (not copies).
|
| Modifier and Type | Method | Description |
|---|---|---|
protected OrderedMap<K,V> |
decorated() |
Gets the map being decorated.
|
K |
firstKey() |
Gets the first key currently in this map.
|
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.
|
clear, containsKey, containsValue, entrySet, equals, get, hashCode, isEmpty, keySet, put, putAll, remove, size, toString, valuescontainsKey, containsValue, entrySet, get, isEmpty, keySet, remove, size, valuesclear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entry, entrySet, equals, forEach, get, getOrDefault, hashCode, isEmpty, keySet, merge, of, of, of, of, of, of, of, of, of, of, of, ofEntries, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size, valuesprotected AbstractOrderedMapDecorator()
public AbstractOrderedMapDecorator(OrderedMap<K,V> map)
map - the map to decorate, must not be nulljava.lang.NullPointerException - if the map is nullprotected OrderedMap<K,V> decorated()
decorated in class AbstractMapDecorator<K,V>public K firstKey()
OrderedMapfirstKey in interface OrderedMap<K,V>public K lastKey()
OrderedMaplastKey in interface OrderedMap<K,V>public K nextKey(K key)
OrderedMapnextKey in interface OrderedMap<K,V>key - the key to search for next frompublic K previousKey(K key)
OrderedMappreviousKey in interface OrderedMap<K,V>key - the key to search for previous frompublic OrderedMapIterator<K,V> mapIterator()
AbstractIterableMapMapIterator 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.
IterableMapmap = new HashedMap (); MapIterator 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 - Apache Software Foundation