|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectcom.google.common.collect.ForwardingObject
com.google.common.collect.ForwardingMap<K,V>
com.google.common.collect.HashBiMap<K,V>
@GwtCompatible(emulated=true) public final class HashBiMap<K,V>
A BiMap backed by two HashMap instances. This implementation
allows null keys and values. A HashBiMap and its inverse are both
serializable.
| Nested Class Summary |
|---|
| Nested classes/interfaces inherited from interface java.util.Map |
|---|
Map.Entry<K,V> |
| Method Summary | ||
|---|---|---|
void |
clear()
Removes all of the mappings from this map (optional operation). |
|
boolean |
containsValue(Object value)
Returns true if this map maps one or more keys to the specified value. |
|
static
|
create()
Returns a new, empty HashBiMap with the default initial capacity
(16). |
|
static
|
create(int expectedSize)
Constructs a new, empty bimap with the specified expected size. |
|
static
|
create(Map<? extends K,? extends V> map)
Constructs a new bimap containing initial values from map. |
|
protected Map<K,V> |
delegate()
Returns the backing delegate instance that methods are forwarded to. |
|
Set<Map.Entry<K,V>> |
entrySet()
Returns a Set view of the mappings contained in this map. |
|
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 BiMap.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. |
|
Set<K> |
keySet()
Returns a Set view of the keys contained in this map. |
|
V |
put(K key,
V value)
Associates the specified value with the specified key in this map (optional operation). |
|
void |
putAll(Map<? extends K,? extends V> map)
Copies all of the mappings from the specified map to this map (optional operation). |
|
V |
remove(Object key)
Removes the mapping for a key from this map if it is present (optional operation). |
|
Set<V> |
values()
Returns a Collection view of the values contained in this map. |
|
| Methods inherited from class com.google.common.collect.ForwardingMap |
|---|
containsKey, equals, get, hashCode, isEmpty, size, standardClear, standardContainsKey, standardContainsValue, standardEntrySet, standardEquals, standardHashCode, standardIsEmpty, standardKeySet, standardPutAll, standardRemove, standardToString, standardValues |
| Methods inherited from class com.google.common.collect.ForwardingObject |
|---|
toString |
| Methods inherited from class java.lang.Object |
|---|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface java.util.Map |
|---|
containsKey, equals, get, hashCode, isEmpty, size |
| Method Detail |
|---|
public static <K,V> HashBiMap<K,V> create()
HashBiMap with the default initial capacity
(16).
public static <K,V> HashBiMap<K,V> create(int expectedSize)
expectedSize - the expected number of entries
IllegalArgumentException - if the specified expected size is
negativepublic static <K,V> HashBiMap<K,V> create(Map<? extends K,? extends V> map)
map. The
bimap is created with an initial capacity sufficient to hold the mappings
in the specified map.
public V put(@Nullable
K key,
@Nullable
V value)
java.util.Mapm.containsKey(k) would return
true.)
put in interface BiMap<K,V>put in interface Map<K,V>key - key with which the specified value is to be associatedvalue - value to be associated with the specified key
public V forcePut(@Nullable
K key,
@Nullable
V value)
BiMapput 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<K,V>key - the key with which the specified value is to be associatedvalue - the value to be associated with the specified key
null, or null if there was no previous entryprotected Map<K,V> delegate()
ForwardingObjectForwardingSet.delegate(). Concrete subclasses override this method to supply
the instance being decorated.
delegate in class ForwardingMap<K,V>public boolean containsValue(Object value)
java.util.Map
containsValue in interface Map<K,V>containsValue in class ForwardingMap<K,V>value - value whose presence in this map is to be tested
public V remove(Object key)
java.util.Map(key==null ? k==null : key.equals(k)), that mapping
is removed. (The map can contain at most one such mapping.)
Returns the value to which this map previously associated the key, or null if the map contained no mapping for the key.
If this map permits null values, then a return value of null does not necessarily indicate that the map contained no mapping for the key; it's also possible that the map explicitly mapped the key to null.
The map will not contain a mapping for the specified key once the call returns.
remove in interface Map<K,V>remove in class ForwardingMap<K,V>key - key whose mapping is to be removed from the map
public void putAll(Map<? extends K,? extends V> map)
java.util.Mapput(k, v) on this map once
for each mapping from key k to value v in the
specified map. The behavior of this operation is undefined if the
specified map is modified while the operation is in progress.
putAll in interface BiMap<K,V>putAll in interface Map<K,V>putAll in class ForwardingMap<K,V>map - mappings to be stored in this mappublic void clear()
java.util.Map
clear in interface Map<K,V>clear in class ForwardingMap<K,V>public BiMap<V,K> inverse()
BiMapNote:There is no guaranteed correspondence between the iteration order of a bimap and that of its inverse.
inverse in interface BiMap<K,V>public Set<K> keySet()
java.util.MapSet view of the keys contained in this map.
The set is backed by the map, so changes to the map are
reflected in the set, and vice-versa. If the map is modified
while an iteration over the set is in progress (except through
the iterator's own remove operation), the results of
the iteration are undefined. The set supports element removal,
which removes the corresponding mapping from the map, via the
Iterator.remove, Set.remove,
removeAll, retainAll, and clear
operations. It does not support the add or addAll
operations.
keySet in interface Map<K,V>keySet in class ForwardingMap<K,V>public Set<V> values()
java.util.MapCollection view of the values contained in this map.
The collection is backed by the map, so changes to the map are
reflected in the collection, and vice-versa. If the map is
modified while an iteration over the collection is in progress
(except through the iterator's own remove operation),
the results of the iteration are undefined. The collection
supports element removal, which removes the corresponding
mapping from the map, via the Iterator.remove,
Collection.remove, removeAll,
retainAll and clear operations. It does not
support the add or addAll operations.
values in interface BiMap<K,V>values in interface Map<K,V>values in class ForwardingMap<K,V>public Set<Map.Entry<K,V>> entrySet()
java.util.MapSet view of the mappings contained in this map.
The set is backed by the map, so changes to the map are
reflected in the set, and vice-versa. If the map is modified
while an iteration over the set is in progress (except through
the iterator's own remove operation, or through the
setValue operation on a map entry returned by the
iterator) the results of the iteration are undefined. The set
supports element removal, which removes the corresponding
mapping from the map, via the Iterator.remove,
Set.remove, removeAll, retainAll and
clear operations. It does not support the
add or addAll operations.
entrySet in interface Map<K,V>entrySet in class ForwardingMap<K,V>
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||