Modifier and Type | Class and Description |
---|---|
private class |
HashBiMap.Inverse.InverseKeySet |
Modifier | Constructor and Description |
---|---|
private |
Inverse() |
Modifier and Type | Method and Description |
---|---|
void |
clear() |
boolean |
containsKey(java.lang.Object value) |
(package private) java.util.Iterator<java.util.Map.Entry<V,K>> |
entryIterator() |
K |
forcePut(V value,
K key)
An alternate form of
put that silently removes any existing entry with the value value before proceeding with the BiMap.put(K, V) operation. |
void |
forEach(java.util.function.BiConsumer<? super V,? super K> action) |
(package private) BiMap<K,V> |
forward() |
K |
get(java.lang.Object value) |
BiMap<K,V> |
inverse()
Returns the inverse view of this bimap, which maps each of this bimap's values to its
associated key.
|
java.util.Set<V> |
keySet() |
K |
put(V value,
K key) |
K |
remove(java.lang.Object value) |
void |
replaceAll(java.util.function.BiFunction<? super V,? super K,? extends K> function) |
int |
size() |
java.util.Set<K> |
values() |
(package private) java.lang.Object |
writeReplace() |
entrySet, entrySpliterator, forEachEntry
clone, containsValue, equals, hashCode, isEmpty, putAll, toString
public int size()
public void clear()
public boolean containsKey(@CheckForNull java.lang.Object value)
@CheckForNull public K get(@CheckForNull java.lang.Object value)
@CheckForNull public K forcePut(V value, K key)
BiMap
put
that silently removes any existing entry with the value value
before proceeding with the BiMap.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.
forcePut
in interface BiMap<V,K>
value
- the key with which the specified value is to be associatedkey
- the value to be associated with the specified keynull
if there was no
previous entry. (If the bimap contains null values, then forcePut
, like put
, returns null
both if the key is absent and if it is present with a null
value.)@CheckForNull public K remove(@CheckForNull java.lang.Object value)
public BiMap<K,V> inverse()
BiMap
Note:There is no guaranteed correspondence between the iteration order of a bimap and that of its inverse.
public java.util.Set<V> keySet()
public java.util.Set<K> values()
BiMap
Because a bimap has unique values, this method returns a Set
, instead of the Collection
specified in the Map
interface.
java.util.Iterator<java.util.Map.Entry<V,K>> entryIterator()
entryIterator
in class Maps.IteratorBasedAbstractMap<V,K>
public void replaceAll(java.util.function.BiFunction<? super V,? super K,? extends K> function)
java.lang.Object writeReplace()