K
- the type of the keys in the mapV
- the type of the values in the mappublic interface SortedBidiMap<K,V> extends OrderedBidiMap<K,V>, SortedMap<K,V>
Implementations should allow a value to be looked up from a key and a key to be looked up from a value with equal performance.
Modifier and Type | Method and Description |
---|---|
SortedBidiMap<V,K> |
inverseBidiMap()
Gets a view of this map where the keys and values are reversed.
|
Comparator<? super V> |
valueComparator()
Get the comparator used for the values in the value-to-key map aspect.
|
getKey, put, removeValue, values
firstKey, lastKey, mapIterator, nextKey, previousKey
clear, putAll
compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entrySet, equals, forEach, get, getOrDefault, hashCode, isEmpty, keySet, merge, putIfAbsent, remove, remove, replace, replace, replaceAll, size
SortedBidiMap<V,K> inverseBidiMap()
Changes to one map will be visible in the other and vice versa. This enables both directions of the map to be accessed equally.
Implementations should seek to avoid creating a new object every time this
method is called. See AbstractMap.values()
etc. Calling this
method on the inverse map should return the original.
Implementations must return a SortedBidiMap
instance,
usually by forwarding to inverseSortedBidiMap()
.
inverseBidiMap
in interface BidiMap<K,V>
inverseBidiMap
in interface OrderedBidiMap<K,V>
Comparator<? super V> valueComparator()
Copyright © 2006–2022 Apache Software Foundation. All rights reserved.