public final class UnmodifiableBidiMap<K,V> extends AbstractBidiMapDecorator<K,V> implements Unmodifiable
BidiMap
to ensure it can't be altered.
Attempts to modify it will result in an UnsupportedOperationException.
Modifier and Type | Method and Description |
---|---|
void |
clear() |
Set<Map.Entry<K,V>> |
entrySet() |
BidiMap<V,K> |
inverseBidiMap()
Gets a view of this map where the keys and values are reversed.
|
Set<K> |
keySet() |
MapIterator<K,V> |
mapIterator()
Obtains a
MapIterator over the map. |
V |
put(K key,
V value)
Note that the return type is Object, rather than V as in the Map interface.
|
void |
putAll(Map<? extends K,? extends V> mapToCopy) |
V |
remove(Object key) |
K |
removeValue(Object value)
Removes the key-value pair that is currently mapped to the specified
value (optional operation).
|
static <K,V> BidiMap<K,V> |
unmodifiableBidiMap(BidiMap<? extends K,? extends V> map)
Factory method to create an unmodifiable map.
|
Set<V> |
values()
Returns a
Set view of the values contained in this map. |
decorated, getKey
containsKey, containsValue, equals, get, hashCode, isEmpty, size, toString
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
containsKey, containsValue, equals, get, hashCode, isEmpty, size
containsKey, containsValue, get, isEmpty, size
public static <K,V> BidiMap<K,V> unmodifiableBidiMap(BidiMap<? extends K,? extends V> map)
If the map passed in is already unmodifiable, it is returned.
K
- the key typeV
- the value typemap
- the map to decorate, must not be nullIllegalArgumentException
- if map is nullpublic void clear()
public V put(K key, V value)
Put
put
in interface Map<K,V>
put
in interface BidiMap<K,V>
put
in interface Put<K,V>
put
in class AbstractMapDecorator<K,V>
key
- the key to storevalue
- the value to storeMap.put(Object, Object)
public Set<V> values()
BidiMap
Set
view of the values 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,
Collection.remove, removeAll,
retainAll and clear operations. It does not
support the add or addAll operations.public K removeValue(Object value)
BidiMap
If the value is not contained in the map, null
is returned.
Implementations should seek to make this method perform equally as well
as remove(Object)
.
removeValue
in interface BidiMap<K,V>
removeValue
in class AbstractBidiMapDecorator<K,V>
value
- the value to find the key-value pair fornull
if nothing removedpublic MapIterator<K,V> mapIterator()
AbstractIterableMap
MapIterator
over the map.
A map iterator is an efficient way of iterating over maps. There is no need to access the entry set or use Map Entry objects.
IterableMapmap = new HashedMap (); MapIterator it = map.mapIterator(); while (it.hasNext()) { String key = it.next(); Integer value = it.getValue(); it.setValue(value + 1); }
mapIterator
in interface IterableGet<K,V>
mapIterator
in class AbstractBidiMapDecorator<K,V>
public BidiMap<V,K> inverseBidiMap()
BidiMap
Changes to one map will be visible in the other and vice versa.
This enables both directions of the map to be accessed as a Map
.
Implementations should seek to avoid creating a new object every time this
method is called. See AbstractMap.values()
etc. Calling this
method on the inverse map should return the original.
inverseBidiMap
in interface BidiMap<K,V>
inverseBidiMap
in class AbstractBidiMapDecorator<K,V>
Copyright © 2001–2013 The Apache Software Foundation. All rights reserved.