Package com.google.common.collect
Class Maps.FilteredEntryBiMap<K,V>
java.lang.Object
java.util.AbstractMap<K,V>
com.google.common.collect.Maps.ViewCachingAbstractMap<K,V>
com.google.common.collect.Maps.AbstractFilteredMap<K,V>
com.google.common.collect.Maps.FilteredEntryMap<K,V>
com.google.common.collect.Maps.FilteredEntryBiMap<K,V>
- Enclosing class:
Maps
static final class Maps.FilteredEntryBiMap<K,V>
extends Maps.FilteredEntryMap<K,V>
implements BiMap<K,V>
-
Nested Class Summary
Nested classes/interfaces inherited from class com.google.common.collect.Maps.FilteredEntryMap
Maps.FilteredEntryMap.KeySet
Nested classes/interfaces inherited from class java.util.AbstractMap
AbstractMap.SimpleEntry<K,
V>, AbstractMap.SimpleImmutableEntry<K, V> -
Field Summary
FieldsFields inherited from class com.google.common.collect.Maps.FilteredEntryMap
filteredEntrySet
Fields inherited from class com.google.common.collect.Maps.AbstractFilteredMap
predicate, unfiltered
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionAn alternate form ofput
that silently removes any existing entry with the valuevalue
before proceeding with theBiMap.put(K, V)
operation.inverse()
Returns the inverse view of this bimap, which maps each of this bimap's values to its associated key.inversePredicate
(Predicate<? super Map.Entry<K, V>> forwardPredicate) void
replaceAll
(BiFunction<? super K, ? super V, ? extends V> function) values()
Methods inherited from class com.google.common.collect.Maps.FilteredEntryMap
createEntrySet, createKeySet, removeAllKeys, retainAllKeys
Methods inherited from class com.google.common.collect.Maps.AbstractFilteredMap
apply, containsKey, createValues, get, isEmpty, put, putAll, remove
Methods inherited from class com.google.common.collect.Maps.ViewCachingAbstractMap
entrySet, keySet
Methods inherited from class java.util.AbstractMap
clear, clone, containsValue, equals, hashCode, size, toString
Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait
Methods inherited from interface java.util.Map
clear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entrySet, equals, forEach, get, getOrDefault, hashCode, isEmpty, keySet, merge, putIfAbsent, remove, remove, replace, replace, size
-
Field Details
-
inverse
-
-
Constructor Details
-
FilteredEntryBiMap
-
FilteredEntryBiMap
-
-
Method Details
-
inversePredicate
-
unfiltered
-
forcePut
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 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.)
-
replaceAll
- Specified by:
replaceAll
in interfaceMap<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.
-
values
Description copied from interface:BiMap
Because a bimap has unique values, this method returns a
Set
, instead of theCollection
specified in theMap
interface.
-