public final class UnmodifiableSortedBidiMap<K,V> extends AbstractSortedBidiMapDecorator<K,V> implements Unmodifiable
SortedBidiMap 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() |
SortedMap<K,V> |
headMap(K toKey) |
SortedBidiMap<V,K> |
inverseBidiMap()
Gets a view of this map where the keys and values are reversed.
|
Set<K> |
keySet() |
OrderedMapIterator<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).
|
SortedMap<K,V> |
subMap(K fromKey,
K toKey) |
SortedMap<K,V> |
tailMap(K fromKey) |
static <K,V> SortedBidiMap<K,V> |
unmodifiableSortedBidiMap(SortedBidiMap<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. |
comparator, decorated, valueComparatorfirstKey, lastKey, nextKey, previousKeygetKeycontainsKey, containsValue, equals, get, hashCode, isEmpty, size, toStringclone, finalize, getClass, notify, notifyAll, wait, wait, waitfirstKey, lastKey, nextKey, previousKeycontainsKey, containsValue, equals, get, hashCode, isEmpty, sizecontainsKey, containsValue, get, isEmpty, sizepublic static <K,V> SortedBidiMap<K,V> unmodifiableSortedBidiMap(SortedBidiMap<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)
Putput 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()
BidiMapSet 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.values in interface Map<K,V>values in interface SortedMap<K,V>values in interface BidiMap<K,V>values in interface Get<K,V>values in class AbstractBidiMapDecorator<K,V>Map.values()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 OrderedMapIterator<K,V> mapIterator()
AbstractIterableMapMapIterator 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.