static class Synchronized.SynchronizedBiMap<K,V> extends Synchronized.SynchronizedMap<K,V> implements BiMap<K,V>, java.io.Serializable
| Modifier and Type | Field and Description |
|---|---|
private BiMap<V,K> |
inverse |
private static long |
serialVersionUID |
private java.util.Set<V> |
valueSet |
entrySet, keySet, valuesdelegate, mutex| Modifier | Constructor and Description |
|---|---|
private |
SynchronizedBiMap(BiMap<K,V> delegate,
java.lang.Object mutex,
BiMap<V,K> inverse) |
| Modifier and Type | Method and Description |
|---|---|
(package private) BiMap<K,V> |
delegate() |
V |
forcePut(K key,
V value)
An alternate form of
put that silently removes any existing entry
with the value value before proceeding with the BiMap.put(K, V)
operation. |
BiMap<V,K> |
inverse()
Returns the inverse view of this bimap, which maps each of this bimap's
values to its associated key.
|
java.util.Set<V> |
values() |
clear, containsKey, containsValue, entrySet, equals, get, hashCode, isEmpty, keySet, put, putAll, remove, sizetoStringprivate transient java.util.Set<V> valueSet
private static final long serialVersionUID
public java.util.Set<V> values()
BiMapBecause a bimap has unique values, this method returns a Set,
instead of the Collection specified in the Map
interface.
public V forcePut(K key, V value)
BiMapput that silently removes any existing entry
with the value value before proceeding with the BiMap.put(K, V)
operation. If the bimap previously contained the provided key-value
mapping, this method has no effect.
Note that a successful call to this method could cause the size of the bimap to increase by one, stay the same, or even decrease by one.
Warning: If an existing entry with this value is removed, the key for that entry is discarded and not returned.
forcePut in interface BiMap<K,V>key - the key with which the specified value is to be associatedvalue - the value to be associated with the specified keynull, or null if there was no previous entrypublic BiMap<V,K> inverse()
BiMapNote:There is no guaranteed correspondence between the iteration order of a bimap and that of its inverse.