Package com.google.common.collect
Class Synchronized.SynchronizedBiMap<K,V>
- java.lang.Object
-
- com.google.common.collect.Synchronized.SynchronizedObject
-
- com.google.common.collect.Synchronized.SynchronizedMap<K,V>
-
- com.google.common.collect.Synchronized.SynchronizedBiMap<K,V>
-
- All Implemented Interfaces:
BiMap<K,V>
,java.io.Serializable
,java.util.Map<K,V>
- Enclosing class:
- Synchronized
static class Synchronized.SynchronizedBiMap<K,V> extends Synchronized.SynchronizedMap<K,V> implements BiMap<K,V>, java.io.Serializable
-
-
Field Summary
Fields Modifier and Type Field Description private BiMap<V,K>
inverse
private static long
serialVersionUID
private java.util.Set<V>
valueSet
-
Fields inherited from class com.google.common.collect.Synchronized.SynchronizedMap
entrySet, keySet, values
-
Fields inherited from class com.google.common.collect.Synchronized.SynchronizedObject
delegate, mutex
-
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description (package private) BiMap<K,V>
delegate()
V
forcePut(K key, V value)
An alternate form ofput
that silently removes any existing entry with the valuevalue
before proceeding with theBiMap.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()
-
Methods inherited from class com.google.common.collect.Synchronized.SynchronizedMap
clear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entrySet, equals, forEach, get, getOrDefault, hashCode, isEmpty, keySet, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size
-
Methods inherited from class com.google.common.collect.Synchronized.SynchronizedObject
toString
-
-
-
-
Field Detail
-
valueSet
private transient java.util.Set<V> valueSet
-
serialVersionUID
private static final long serialVersionUID
- See Also:
- Constant Field Values
-
-
Method Detail
-
values
public java.util.Set<V> values()
Description copied from interface:BiMap
Because a bimap has unique values, this method returns a
Set
, instead of theCollection
specified in theMap
interface.
-
forcePut
public V forcePut(K key, V value)
Description copied from interface:BiMap
An alternate form ofput
that silently removes any existing entry with the valuevalue
before proceeding with theBiMap.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.
- Specified by:
forcePut
in interfaceBiMap<K,V>
- Parameters:
key
- the key with which the specified value is to be associatedvalue
- the value to be associated with the specified key- Returns:
- the value which was previously associated with the key, which may be
null
, ornull
if there was no previous entry
-
inverse
public BiMap<V,K> inverse()
Description copied from interface:BiMap
Returns the inverse view of this bimap, which maps each of this bimap's values to its associated key. The two bimaps are backed by the same data; any changes to one will appear in the other.Note:There is no guaranteed correspondence between the iteration order of a bimap and that of its inverse.
-
-