Package com.google.common.collect
Class HashBiMap.Inverse
- java.lang.Object
-
- java.util.AbstractMap<K,V>
-
- com.google.common.collect.Maps.IteratorBasedAbstractMap<V,K>
-
- com.google.common.collect.HashBiMap.Inverse
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description private class
HashBiMap.Inverse.InverseKeySet
-
Constructor Summary
Constructors Modifier Constructor Description private
Inverse()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
clear()
boolean
containsKey(java.lang.Object value)
(package private) java.util.Iterator<java.util.Map.Entry<V,K>>
entryIterator()
K
forcePut(V value, K key)
An alternate form ofput
that silently removes any existing entry with the valuevalue
before proceeding with theBiMap.put(K, V)
operation.void
forEach(java.util.function.BiConsumer<? super V,? super K> action)
(package private) BiMap<K,V>
forward()
K
get(java.lang.Object value)
BiMap<K,V>
inverse()
Returns the inverse view of this bimap, which maps each of this bimap's values to its associated key.java.util.Set<V>
keySet()
K
put(V value, K key)
K
remove(java.lang.Object value)
void
replaceAll(java.util.function.BiFunction<? super V,? super K,? extends K> function)
int
size()
java.util.Set<K>
values()
(package private) java.lang.Object
writeReplace()
-
Methods inherited from class com.google.common.collect.Maps.IteratorBasedAbstractMap
entrySet, entrySpliterator, forEachEntry
-
Methods inherited from class java.util.AbstractMap
clone, containsValue, equals, hashCode, isEmpty, putAll, toString
-
-
-
-
Method Detail
-
size
public int size()
-
clear
public void clear()
-
containsKey
public boolean containsKey(@CheckForNull java.lang.Object value)
-
get
@CheckForNull public K get(@CheckForNull java.lang.Object value)
-
forcePut
@CheckForNull public K forcePut(V value, K key)
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<V,K>
- Parameters:
value
- the key with which the specified value is to be associatedkey
- the value to be associated with the specified key- Returns:
- the value that was previously associated with the key, or
null
if there was no previous entry. (If the bimap contains null values, thenforcePut
, likeput
, returnsnull
both if the key is absent and if it is present with a null value.)
-
remove
@CheckForNull public K remove(@CheckForNull java.lang.Object value)
-
inverse
public BiMap<K,V> 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.
-
keySet
public java.util.Set<V> keySet()
-
values
public java.util.Set<K> values()
Description copied from interface:BiMap
Because a bimap has unique values, this method returns a
Set
, instead of theCollection
specified in theMap
interface.
-
entryIterator
java.util.Iterator<java.util.Map.Entry<V,K>> entryIterator()
- Specified by:
entryIterator
in classMaps.IteratorBasedAbstractMap<V,K>
-
replaceAll
public void replaceAll(java.util.function.BiFunction<? super V,? super K,? extends K> function)
-
writeReplace
java.lang.Object writeReplace()
-
-