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
- All Implemented Interfaces:
BiMap<V,,K> Serializable,Map<V,K>
private final class HashBiMap.Inverse
extends Maps.IteratorBasedAbstractMap<V,K>
implements BiMap<V,K>, Serializable
-
Nested Class Summary
Nested ClassesNested classes/interfaces inherited from class java.util.AbstractMap
AbstractMap.SimpleEntry<K extends Object,V extends Object>, AbstractMap.SimpleImmutableEntry<K extends Object, V extends Object> -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionvoidclear()booleancontainsKey(Object value) An alternate form ofputthat silently removes any existing entry with the valuevaluebefore proceeding with theBiMap.put(K, V)operation.voidforEach(BiConsumer<? super V, ? super K> action) forward()inverse()Returns the inverse view of this bimap, which maps each of this bimap's values to its associated key.keySet()private voidvoidreplaceAll(BiFunction<? super V, ? super K, ? extends K> function) intsize()values()(package private) ObjectMethods inherited from class com.google.common.collect.Maps.IteratorBasedAbstractMap
entrySet, entrySpliterator, forEachEntryMethods inherited from class java.util.AbstractMap
clone, containsValue, equals, hashCode, isEmpty, putAll, toStringMethods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, waitMethods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, containsValue, entrySet, equals, getOrDefault, hashCode, isEmpty, merge, putIfAbsent, remove, replace, replace
-
Constructor Details
-
Inverse
private Inverse()
-
-
Method Details
-
forward
-
size
public int size() -
clear
public void clear() -
containsKey
- Specified by:
containsKeyin interfaceMap<V,K> - Overrides:
containsKeyin classAbstractMap<V,K>
-
get
-
put
Description copied from interface:BiMap -
forcePut
Description copied from interface:BiMapAn alternate form ofputthat silently removes any existing entry with the valuevaluebefore 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:
forcePutin 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
nullif there was no previous entry. (If the bimap contains null values, thenforcePut, likeput, returnsnullboth if the key is absent and if it is present with a null value.)
-
remove
-
inverse
Description copied from interface:BiMapReturns 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
-
values
Description copied from interface:BiMapBecause a bimap has unique values, this method returns a
Set, instead of theCollectionspecified in theMapinterface. -
entryIterator
- Specified by:
entryIteratorin classMaps.IteratorBasedAbstractMap<V,K>
-
forEach
-
replaceAll
- Specified by:
replaceAllin interfaceMap<V,K>
-
writeReplace
Object writeReplace() -
readObject
- Throws:
InvalidObjectException
-