public class BidiMap<K,V> extends Object implements Map<K,V>
LinkedHashMap.
Combinations of key-value must be unique in order to create and
maintain the corresponding inverse map. In addition, null is not accepted
as a valid value, as it is not permitted as a map key.
In these cases IllegalArgumentException is thrown.
The map requires external synchronization.| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
boolean |
containsKey(Object _key) |
boolean |
containsValue(Object _val) |
Set<Map.Entry<K,V>> |
entrySet() |
V |
get(Object _key) |
K |
getKey(V _val) |
boolean |
isEmpty() |
Set<K> |
keySet() |
V |
put(K _key,
V _val) |
void |
putAll(Map<? extends K,? extends V> _map) |
V |
remove(Object _key) |
K |
removeValue(V _val)
Removes the mapping for a value from this map if it is present.
|
int |
size() |
String |
toString() |
Collection<V> |
values() |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitcompute, computeIfAbsent, computeIfPresent, equals, forEach, getOrDefault, hashCode, merge, putIfAbsent, remove, replace, replace, replaceAllpublic boolean containsKey(Object _key)
containsKey in interface Map<K,V>public boolean containsValue(Object _val)
containsValue in interface Map<K,V>public K removeValue(V _val)
_val - value whose mapping is to be removed from the mapCopyright © 2018. All rights reserved.