Package com.google.common.collect
Class HashBiMap<K,V>
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)
@Deprecated(since="2022-12-01")
public final class HashBiMap<K,V>
extends AbstractMap<K,V>
implements BiMap<K,V>, Serializable
Deprecated.
The Google Guava Core Libraries are deprecated and will not be part of the AEM SDK after April 2023
A
BiMap backed by two hash tables. This implementation allows null keys and values. A
HashBiMap and its inverse are both serializable.
See the Guava User Guide article on BiMap
.
- Since:
- 2.0 (imported from Google Collections Library)
- See Also:
-
Nested Class Summary
Nested classes/interfaces inherited from class java.util.AbstractMap
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K, V> -
Method Summary
Modifier and TypeMethodDescriptionvoidclear()Deprecated.booleancontainsKey(Object key) Deprecated.booleancontainsValue(Object value) Deprecated.static <K,V> HashBiMap <K, V> create()Deprecated.Returns a new, emptyHashBiMapwith the default initial capacity (16).static <K,V> HashBiMap <K, V> create(int expectedSize) Deprecated.Constructs a new, empty bimap with the specified expected size.static <K,V> HashBiMap <K, V> Deprecated.Constructs a new bimap containing initial values frommap.entrySet()Deprecated.Deprecated.An alternate form ofputthat silently removes any existing entry with the valuevaluebefore proceeding with theBiMap.put(K, V)operation.Deprecated.inverse()Deprecated.Returns the inverse view of this bimap, which maps each of this bimap's values to its associated key.keySet()Deprecated.Deprecated.Deprecated.intsize()Deprecated.values()Deprecated.Methods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, equals, forEach, getOrDefault, hashCode, isEmpty, merge, putIfAbsent, remove, replace, replace, replaceAll
-
Method Details
-
create
Deprecated.Returns a new, emptyHashBiMapwith the default initial capacity (16). -
create
Deprecated.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
Deprecated.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
Deprecated.- Specified by:
containsKeyin interfaceMap<K,V> - Overrides:
containsKeyin classAbstractMap<K,V>
-
containsValue
Deprecated.- Specified by:
containsValuein interfaceMap<K,V> - Overrides:
containsValuein classAbstractMap<K,V>
-
get
Deprecated. -
put
Deprecated.Description copied from interface:BiMap -
forcePut
Deprecated.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,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, ornullif there was no previous entry
-
remove
Deprecated. -
clear
public void clear()Deprecated. -
size
public int size()Deprecated. -
keySet
Deprecated. -
values
Deprecated.Description copied from interface:BiMapBecause a bimap has unique values, this method returns a
Set, instead of theCollectionspecified in theMapinterface. -
entrySet
Deprecated. -
inverse
Deprecated.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.
-