K- the type of the keys in the map
V- the type of the values in the map
public interface OrderedBidiMap<K,V> extends BidiMap<K,V>, OrderedMap<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|
Gets a view of this map where the keys and values are reversed.
getKey, put, removeValue, values
firstKey, lastKey, mapIterator, nextKey, previousKey
clear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entrySet, equals, forEach, get, getOrDefault, hashCode, isEmpty, keySet, merge, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size
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 an
usually by forwarding to
Copyright © 2010 - 2020 Adobe. All Rights Reserved