Package org.docx4j.com.google.common.collect

Class HashBiMap.Inverse

java.lang.Object

java.util.AbstractMap<K,V>

org.docx4j.com.google.common.collect.Maps.IteratorBasedAbstractMap<V,K>

org.docx4j.com.google.common.collect.HashBiMap.Inverse

All Implemented Interfaces:

Serializable, Map<V,K>, BiMap<V,K>

Enclosing class:

HashBiMap<K,V>

private final class HashBiMap.Inverse
extends Maps.IteratorBasedAbstractMap<V,K>
implements BiMap<V,K>, Serializable

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
private final class	HashBiMap.Inverse.InverseKeySet

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>

Nested classes/interfaces inherited from interface java.util.Map

Map.Entry<K extends Object,V extends Object>

Constructor Summary

Constructors

Modifier	Constructor	Description
private	Inverse()

Method Summary

Modifier and Type	Method	Description
void	clear()
boolean	containsKey(@Nullable Object value)
(package private) Iterator<Map.Entry<V,K>>	entryIterator()
@Nullable K	forcePut(@Nullable V value, @Nullable 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(BiConsumer<? super V,? super K> action)
(package private) BiMap<K,V>	forward()
K	get(@Nullable 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.
Set<V>	keySet()
@Nullable K	put(@Nullable V value, @Nullable K key)
@Nullable K	remove(@Nullable Object value)
void	replaceAll(BiFunction<? super V,? super K,? extends K> function)
int	size()
Set<K>	values()
(package private) Object	writeReplace()

Methods inherited from class org.docx4j.com.google.common.collect.Maps.IteratorBasedAbstractMap

entrySet, entrySpliterator, forEachEntry

Methods inherited from class java.util.AbstractMap

clone, containsValue, equals, hashCode, isEmpty, putAll, toString

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface org.docx4j.com.google.common.collect.BiMap

putAll

Methods inherited from interface java.util.Map

compute, computeIfAbsent, computeIfPresent, containsValue, entrySet, equals, getOrDefault, hashCode, isEmpty, merge, putIfAbsent, remove, replace, replace

Constructor Details

Inverse

private Inverse()

Method Details

forward

BiMap<K,V> forward()

size

public int size()

Specified by:

size in interface Map<V,K>

Specified by:

size in class Maps.IteratorBasedAbstractMap<V,K>

clear

public void clear()

Specified by:

clear in interface Map<V,K>

Overrides:

clear in class Maps.IteratorBasedAbstractMap<V,K>

containsKey

public boolean containsKey(@Nullable Object value)

Specified by:

containsKey in interface Map<V,K>

Overrides:

containsKey in class AbstractMap<V,K>

get

public K get(@Nullable Object value)

Specified by:

get in interface Map<V,K>

Overrides:

get in class AbstractMap<V,K>

put

@CanIgnoreReturnValue
public @Nullable K put(@Nullable V value,
 @Nullable K key)

Description copied from interface: BiMap

Specified by:

put in interface BiMap<V,K>

Specified by:

put in interface Map<V,K>

Overrides:

put in class AbstractMap<V,K>

forcePut

public @Nullable K forcePut(@Nullable V value,
 @Nullable K key)

Description copied from interface: BiMap

An alternate form of 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.

Specified by:

forcePut in interface BiMap<V,K>

Parameters:

value - the key with which the specified value is to be associated

key - the value to be associated with the specified key

Returns:

the value which was previously associated with the key, which may be null, or null if there was no previous entry

remove

public @Nullable K remove(@Nullable Object value)

Specified by:

remove in interface Map<V,K>

Overrides:

remove in class AbstractMap<V,K>

inverse

public BiMap<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.

Specified by:

inverse in interface BiMap<V,K>

Returns:

the inverse view of this bimap

keySet

public Set<V> keySet()

Specified by:

keySet in interface Map<V,K>

Overrides:

keySet in class AbstractMap<V,K>

values

public Set<K> values()

Description copied from interface: BiMap

Because a bimap has unique values, this method returns a Set, instead of the Collection specified in the Map interface.

Specified by:

values in interface BiMap<V,K>

Specified by:

values in interface Map<V,K>

Overrides:

values in class AbstractMap<V,K>

entryIterator

Iterator<Map.Entry<V,K>> entryIterator()

Specified by:

entryIterator in class Maps.IteratorBasedAbstractMap<V,K>

forEach

public void forEach(BiConsumer<? super V,? super K> action)

Specified by:

forEach in interface Map<V,K>

replaceAll

public void replaceAll(BiFunction<? super V,? super K,? extends K> function)

Specified by:

replaceAll in interface Map<V,K>

writeReplace

Object writeReplace()