Package com.google.common.collect
Class HashBiMap<K extends @Nullable Object,V extends @Nullable Object>
- java.lang.Object
-
- java.util.AbstractMap<K,V>
-
- com.google.common.collect.HashBiMap<K,V>
-
- All Implemented Interfaces:
BiMap<K,V>,Serializable,Map<K,V>
@GwtCompatible(emulated=true) public final class HashBiMap<K extends @Nullable Object,V extends @Nullable Object> extends AbstractMap<K,V> implements BiMap<K,V>, Serializable
ABiMapbacked by two hash tables. This implementation allows null keys and values. AHashBiMapand its inverse are both serializable.This implementation guarantees insertion-based iteration order of its keys.
See the Guava User Guide article on
BiMap.- Since:
- 2.0
- Author:
- Louis Wasserman, Mike Bostock
- See Also:
- Serialized Form
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from class java.util.AbstractMap
AbstractMap.SimpleEntry<K extends Object,V extends Object>, AbstractMap.SimpleImmutableEntry<K extends Object,V extends Object>
-
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description voidclear()booleancontainsKey(Object key)booleancontainsValue(Object value)Returnstrueif this BiMap contains an entry whose value is equal tovalue(or, equivalently, if this inverse view contains a key that is equal tovalue).static <K extends @Nullable Object,V extends @Nullable Object>
HashBiMap<K,V>create()Returns a new, emptyHashBiMapwith the default initial capacity (16).static <K extends @Nullable Object,V extends @Nullable Object>
HashBiMap<K,V>create(int expectedSize)Constructs a new, empty bimap with the specified expected size.static <K extends @Nullable Object,V extends @Nullable Object>
HashBiMap<K,V>create(Map<? extends K,? extends V> map)Constructs a new bimap containing initial values frommap.Set<Map.Entry<K,V>>entrySet()VforcePut(K key, V value)An alternate form ofputthat silently removes any existing entry with the valuevaluebefore proceeding with theBiMap.put(K, V)operation.voidforEach(BiConsumer<? super K,? super V> action)Vget(Object key)BiMap<V,K>inverse()Returns the inverse view of this bimap, which maps each of this bimap's values to its associated key.Set<K>keySet()Vput(K key, V value)Vremove(Object key)voidreplaceAll(BiFunction<? super K,? super V,? extends V> function)intsize()Set<V>values()-
Methods inherited from class java.util.AbstractMap
clone, equals, hashCode, isEmpty, putAll, toString
-
Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait
-
Methods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, entrySet, equals, getOrDefault, hashCode, isEmpty, merge, putIfAbsent, remove, replace, replace
-
-
-
-
Method Detail
-
create
public static <K extends @Nullable Object,V extends @Nullable Object> HashBiMap<K,V> create()
Returns a new, emptyHashBiMapwith the default initial capacity (16).
-
create
public static <K extends @Nullable Object,V extends @Nullable Object> HashBiMap<K,V> create(int expectedSize)
Constructs a new, empty bimap with the specified expected size.- Parameters:
expectedSize- the expected number of entries- Throws:
IllegalArgumentException- if the specified expected size is negative
-
create
public static <K extends @Nullable Object,V extends @Nullable Object> HashBiMap<K,V> create(Map<? extends K,? extends V> map)
Constructs a new bimap containing initial values frommap. The bimap is created with an initial capacity sufficient to hold the mappings in the specified map.
-
containsKey
public boolean containsKey(@CheckForNull Object key)
-
containsValue
public boolean containsValue(@CheckForNull Object value)
Returnstrueif this BiMap contains an entry whose value is equal tovalue(or, equivalently, if this inverse view contains a key that is equal tovalue).Due to the property that values in a BiMap are unique, this will tend to execute in faster-than-linear time.
- Specified by:
containsValuein interfaceMap<K extends @Nullable Object,V extends @Nullable Object>- Overrides:
containsValuein classAbstractMap<K extends @Nullable Object,V extends @Nullable Object>- Parameters:
value- the object to search for in the values of this BiMap- Returns:
- true if a mapping exists from a key to the specified value
-
get
@CheckForNull public V get(@CheckForNull Object key)
-
put
@CanIgnoreReturnValue @CheckForNull public V put(K key, V value)
Description copied from interface:BiMap
-
forcePut
@CanIgnoreReturnValue @CheckForNull public V forcePut(K key, V value)
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<K extends @Nullable Object,V extends @Nullable Object>- 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 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
@CanIgnoreReturnValue @CheckForNull public V remove(@CheckForNull Object key)
-
clear
public void clear()
-
size
public int size()
-
values
public Set<V> values()
Description copied from interface:BiMapBecause a bimap has unique values, this method returns a
Set, instead of theCollectionspecified in theMapinterface.
-
forEach
public void forEach(BiConsumer<? super K,? super V> action)
-
replaceAll
public void replaceAll(BiFunction<? super K,? super V,? extends V> function)
-
inverse
public BiMap<V,K> 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.
-
-