protected static class DualTreeBidiMap.ViewMap<K,V> extends AbstractSortedMapDecorator<K ,V>
AbstractSortedMapDecorator.SortedMapIterator <K,V> | Modifier | Constructor and Description |
|---|---|
protected |
ViewMap(DualTreeBidiMap
Constructor.
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
|
boolean |
containsValue(Object
|
protected DualTreeBidiMap |
decorated()
Gets the map being decorated.
|
SortedMap |
headMap(K toKey)
|
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 |
subMap(K fromKey, K toKey)
|
SortedMap |
tailMap(K fromKey)
|
comparator, firstKey, lastKey, mapIteratorcontainsKey, entrySet, equals, get, hashCode, isEmpty, keySet, put, putAll, remove, size, toString, valuesclone, finalize, getClass, notify, notifyAll, wait, wait, waitcompute, computeIfAbsent, computeIfPresent, containsKey, equals, forEach, get, getOrDefault, hashCode, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, sizepublic boolean containsValue(Objectvalue)
containsValue in interface
Map<K,V>
containsValue in interface
Get<K,V>
containsValue in class
AbstractMapDecorator<K,V>
Map.containsValue(Object)
public void clear()
protected DualTreeBidiMap<K ,V> decorated()
AbstractSortedMapDecorator
decorated in class
AbstractSortedMapDecorator<K,V>
public K previousKey(K key)
OrderedMap
previousKey in interface
OrderedMap<K,V>
previousKey in class
AbstractSortedMapDecorator<K,V>
key - the key to search for previous from
public K nextKey(K key)
OrderedMap
nextKey in interface
OrderedMap<K,V>
nextKey in class
AbstractSortedMapDecorator<K,V>
key - the key to search for next from