Class DualTreeBidiMap.ViewMap<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>
-
- org.apache.commons.collections4.bidimap.DualTreeBidiMap.ViewMap<K,V>
-
- 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>
- Enclosing class:
- DualTreeBidiMap<K,V>
protected static class DualTreeBidiMap.ViewMap<K,V> extends AbstractSortedMapDecorator<K,V>
Internal sorted map view.
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from class org.apache.commons.collections4.map.AbstractSortedMapDecorator
AbstractSortedMapDecorator.SortedMapIterator<K,V>
-
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
clear()
boolean
containsValue(Object value)
protected DualTreeBidiMap<K,V>
decorated()
Gets the map being decorated.SortedMap<K,V>
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<K,V>
subMap(K fromKey, K toKey)
SortedMap<K,V>
tailMap(K fromKey)
-
Methods inherited from class org.apache.commons.collections4.map.AbstractSortedMapDecorator
comparator, firstKey, lastKey, mapIterator
-
Methods inherited from class org.apache.commons.collections4.map.AbstractMapDecorator
containsKey, entrySet, equals, get, hashCode, isEmpty, keySet, put, putAll, remove, size, toString, values
-
Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
-
Methods inherited from interface org.apache.commons.collections4.Get
containsKey, entrySet, get, isEmpty, keySet, remove, size, values
-
Methods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, containsKey, equals, forEach, get, getOrDefault, hashCode, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size
-
-
-
-
Method Detail
-
containsValue
public boolean containsValue(Object value)
- Specified by:
containsValue
in interfaceGet<K,V>
- Specified by:
containsValue
in interfaceMap<K,V>
- Overrides:
containsValue
in classAbstractMapDecorator<K,V>
- Parameters:
value
- value whose presence in this map is to be tested- Returns:
true
if this map maps one or more keys to the specified value- See Also:
Map.containsValue(Object)
-
clear
public void clear()
-
decorated
protected DualTreeBidiMap<K,V> decorated()
Description copied from class:AbstractSortedMapDecorator
Gets the map being decorated.- Overrides:
decorated
in classAbstractSortedMapDecorator<K,V>
- Returns:
- the decorated map
-
previousKey
public K previousKey(K key)
Description copied from interface:OrderedMap
Gets the previous key before the one specified.- Specified by:
previousKey
in interfaceOrderedMap<K,V>
- Overrides:
previousKey
in classAbstractSortedMapDecorator<K,V>
- Parameters:
key
- the key to search for previous from- Returns:
- the previous key, null if no match or at start
-
nextKey
public K nextKey(K key)
Description copied from interface:OrderedMap
Gets the next key after the one specified.- Specified by:
nextKey
in interfaceOrderedMap<K,V>
- Overrides:
nextKey
in classAbstractSortedMapDecorator<K,V>
- Parameters:
key
- the key to search for next from- Returns:
- the next key, null if no match or at end
-
-