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>
-
- All Implemented Interfaces:
BiMap<K,V>
,java.util.Map<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
-
-
Field Summary
Fields Modifier and Type Field Description private BiMap<V,K>
inverse
-
Fields 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 Modifier Constructor Description (package private)
FilteredEntryBiMap(BiMap<K,V> delegate, Predicate<? super java.util.Map.Entry<K,V>> predicate)
private
FilteredEntryBiMap(BiMap<K,V> delegate, Predicate<? super java.util.Map.Entry<K,V>> predicate, BiMap<V,K> inverse)
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description V
forcePut(K key, V value)
An alternate form ofput
that silently removes any existing entry with the valuevalue
before proceeding with theBiMap.put(K, V)
operation.BiMap<V,K>
inverse()
Returns the inverse view of this bimap, which maps each of this bimap's values to its associated key.private static <K,V>
Predicate<java.util.Map.Entry<V,K>>inversePredicate(Predicate<? super java.util.Map.Entry<K,V>> forwardPredicate)
(package private) BiMap<K,V>
unfiltered()
java.util.Set<V>
values()
-
Methods inherited from class com.google.common.collect.Maps.FilteredEntryMap
createEntrySet, createKeySet
-
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
-
-
-
-
Method Detail
-
inversePredicate
private static <K,V> Predicate<java.util.Map.Entry<V,K>> inversePredicate(Predicate<? super java.util.Map.Entry<K,V>> forwardPredicate)
-
forcePut
public V forcePut(@Nullable K key, @Nullable V value)
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 which was previously associated with the key, which may
be
null
, ornull
if there was no previous entry
-
inverse
public BiMap<V,K> 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.
-
-