This extended Map represents a mapping where a key may
lookup a value and a value may lookup a key with equal ease.
This interface extends Map and so may be used anywhere a map
is required. The interface provides an inverse map view, enabling
full access to both directions of the BidiMap.
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.
This map enforces the restriction that there is a 1:1 relation between
keys and values, meaning that multiple keys cannot map to the same value.
This is required so that "inverting" the map results in a map without
duplicate keys. See the put method description for more information.
| Modifier and Type | Method and Description |
|---|---|
| public K | |
| public BidiMap | Returns: an inverted bidirectional mapGets a view of this map where the keys and values are reversed. |
| public V | Returns: the previous value mapped to this keythe key to store key, V the value to store value)Redeclares java. |
| public K | Returns: the key that was removed,null if nothing removedthe value to find the key-value pair for value)Removes the key-value pair that is currently mapped to the specified value (optional operation). |
| public Set | Returns: a set view of the values contained in this mapRedeclares java. Set view of the values contained in this map.
|
| getKey | back to summary |
|---|---|
| public K getKey(Object value) Gets the key that is currently mapped to the specified value.
If the value is not contained in the map,
Implementations should seek to make this method perform equally as well
as
| |
| inverseBidiMap | back to summary |
|---|---|
| public BidiMap Gets a view of this map where the keys and values are reversed.
Changes to one map will be visible in the other and vice versa.
This enables both directions of the map to be accessed as a
Implementations should seek to avoid creating a new object every time this
method is called. See
| |
| put | back to summary |
|---|---|
| public V put(K key, V value) Redeclares java. Puts the key-value pair into the map, replacing any previous pair. When adding a key-value pair, the value may already exist in the map against a different key. That mapping is removed, to ensure that the value only occurs once in the inverse map.
BidiMap map1 = new DualHashBidiMap();
map.put("A","B"); // contains A mapped to B, as per Map
map.put("A","C"); // contains A mapped to C, as per Map
BidiMap map2 = new DualHashBidiMap();
map.put("A","B"); // contains A mapped to B, as per Map
map.put("C","B"); // contains C mapped to B, key A is removed
| |
| removeValue | back to summary |
|---|---|
| public K removeValue(Object value) Removes the key-value pair that is currently mapped to the specified value (optional operation).
If the value is not contained in the map,
Implementations should seek to make this method perform equally as well
as
| |
| values | back to summary |
|---|---|
| public Set Redeclares java. Returns a | |