javadoc.com.google.common.collect.BiMap.html Maven / Gradle / Ivy
BiMap (Guava: Google Core Libraries for Java 11.0.1 API)
Overview
Package
Class
Use
Tree
Deprecated
Index
Help
PREV CLASS
NEXT CLASS
FRAMES
NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD
DETAIL: FIELD | CONSTR | METHOD
com.google.common.collect
Interface BiMap<K,V>
- All Superinterfaces:
- Map<K,V>
- All Known Implementing Classes:
- EnumBiMap, EnumHashBiMap, HashBiMap, ImmutableBiMap
@GwtCompatible
public interface BiMap<K,V>
- extends Map<K,V>
A bimap (or "bidirectional map") is a map that preserves the uniqueness of its values as well as that of its keys. This constraint enables bimaps to support an "inverse view", which is another bimap containing the same entries as this bimap but with reversed keys and values.
- Since:
- 2.0 (imported from Google Collections Library)
- Author:
- Kevin Bourrillion
| Nested Class Summary |
|---|
| Nested classes/interfaces inherited from interface java.util.Map |
|---|
Map.Entry<K,V> |
| Method Summary | |
|---|---|
V |
forcePut(K key,
V value)
An alternate form of put that silently removes any existing entry
with the value value before proceeding with the 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. |
V |
put(K key,
V value)
|
void |
putAll(Map<? extends K,? extends V> map)
|
Set<V> |
values()
|
| Methods inherited from interface java.util.Map |
|---|
clear, containsKey, containsValue, entrySet, equals, get, hashCode, isEmpty, keySet, remove, size |
| Method Detail |
|---|
put
V put(@Nullable K key, @Nullable V value)
-
- Throws:
IllegalArgumentException- if the given value is already bound to a different key in this bimap. The bimap will remain unmodified in this event. To avoid this exception, callforcePut(K, V)instead.
forcePut
V forcePut(@Nullable K key, @Nullable V value)
- An alternate form of
putthat silently removes any existing entry with the valuevaluebefore proceeding with theput(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.
- 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
putAll
void putAll(Map<? extends K,? extends V> map)
-
Warning: the results of calling this method may vary depending on the iteration order of
map.- Throws:
IllegalArgumentException- if an attempt toputany entry fails. Note that some map entries may have been added to the bimap before the exception was thrown.
values
Set<V> values()
-
Because a bimap has unique values, this method returns a
Set, instead of theCollectionspecified in theMapinterface.
inverse
BiMap<V,K> inverse()
- 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.
- Returns:
- the inverse view of this bimap
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
Copyright © 2010-2012. All Rights Reserved.