public final class DoubleOrderedMap extends AbstractMap
This Map is intended for applications that need to be able to look up a key-value pairing by either key or value, and need to do so with equal efficiency.
While that goal could be accomplished by taking a pair of TreeMaps
and redirecting requests to the appropriate TreeMap (e.g.,
containsKey would be directed to the TreeMap that maps values to
keys, containsValue would be directed to the TreeMap that maps keys
to values), there are problems with that implementation,
particularly when trying to keep the two TreeMaps synchronized with
each other. And if the data contained in the TreeMaps is large, the
cost of redundant storage becomes significant. (See also the new
DualTreeBidiMap
and
DualHashBidiMap
implementations.)
This solution keeps the data properly synchronized and minimizes the data storage. The red-black algorithm is based on TreeMap's, but has been modified to simultaneously map a tree node by key and by value. This doubles the cost of put operations (but so does using two TreeMaps), and nearly doubles the cost of remove operations (there is a savings in that the lookup of the node to be removed only has to be performed once). And since only one node contains the key and value, storage is significantly less than that required by two TreeMaps.
There are some limitations placed on data kept in this Map. The biggest one is this:
When performing a put operation, neither the key nor the value may already exist in the Map. In the java.util Map implementations (HashMap, TreeMap), you can perform a put with an already mapped key, and neither cares about duplicate values at all ... but this implementation's put method with throw an IllegalArgumentException if either the key or the value is already in the Map.
Obviously, that same restriction (and consequence of failing to heed that restriction) applies to the putAll method.
The Map.Entry instances returned by the appropriate methods will not allow setValue() and will throw an UnsupportedOperationException on attempts to call that method.
New methods are added to take advantage of the fact that values are kept sorted independently of their keys:
Object getKeyForValue(Object value) is the opposite of get; it takes a value and returns its key, if any.
Object removeValue(Object value) finds and removes the specified value and returns the now un-used key.
Set entrySetByValue() returns the Map.Entry's in a Set whose iterator will iterate over the Map.Entry's in ascending order by their corresponding values.
Set keySetByValue() returns the keys in a Set whose iterator will iterate over the keys in ascending order by their corresponding values.
Collection valuesByValue() returns the values in a Collection whose iterator will iterate over the values in ascending order.
BidiMap
,
DualTreeBidiMap
,
DualHashBidiMap
AbstractMap.SimpleEntry, AbstractMap.SimpleImmutableEntry
Constructor and Description |
---|
DoubleOrderedMap()
Deprecated.
Construct a new DoubleOrderedMap
|
DoubleOrderedMap(Map map)
Deprecated.
Constructs a new DoubleOrderedMap from an existing Map, with keys and
values sorted
|
Modifier and Type | Method and Description |
---|---|
void |
clear()
Deprecated.
Removes all mappings from this map
|
boolean |
containsKey(Object key)
Deprecated.
Returns true if this map contains a mapping for the specified
key.
|
boolean |
containsValue(Object value)
Deprecated.
Returns true if this map maps one or more keys to the
specified value.
|
Set |
entrySet()
Deprecated.
Returns a set view of the mappings contained in this map.
|
Set |
entrySetByValue()
Deprecated.
Returns a set view of the mappings contained in this map.
|
Object |
get(Object key)
Deprecated.
Returns the value to which this map maps the specified
key.
|
Object |
getKeyForValue(Object value)
Deprecated.
Returns the key to which this map maps the specified value.
|
Set |
keySet()
Deprecated.
Returns a set view of the keys contained in this map.
|
Set |
keySetByValue()
Deprecated.
Returns a set view of the keys contained in this map.
|
Object |
put(Object key,
Object value)
Deprecated.
Associates the specified value with the specified key in this
map.
|
Object |
remove(Object key)
Deprecated.
Removes the mapping for this key from this map if present
|
Object |
removeValue(Object value)
Deprecated.
Removes the mapping for this value from this map if present
|
int |
size()
Deprecated.
Returns the number of key-value mappings in this map.
|
Collection |
values()
Deprecated.
Returns a collection view of the values contained in this
map.
|
Collection |
valuesByValue()
Deprecated.
Returns a collection view of the values contained in this
map.
|
public DoubleOrderedMap()
public DoubleOrderedMap(Map map) throws ClassCastException, NullPointerException, IllegalArgumentException
map
- the map whose mappings are to be placed in this map.ClassCastException
- if the keys in the map are not
Comparable, or are not mutually
comparable; also if the values in
the map are not Comparable, or
are not mutually ComparableNullPointerException
- if any key or value in the map
is nullIllegalArgumentException
- if there are duplicate keys
or duplicate values in the
mappublic Object getKeyForValue(Object value) throws ClassCastException, NullPointerException
value
- value whose associated key is to be returned.ClassCastException
- if the value is of an
inappropriate type for this map.NullPointerException
- if the value is nullpublic Object removeValue(Object value)
value
- value whose mapping is to be removed from the map.public Set entrySetByValue()
The difference between this method and entrySet is that entrySet's iterator() method returns an iterator that iterates over the mappings in ascending order by key. This method's iterator method iterates over the mappings in ascending order by value.
public Set keySetByValue()
The difference between this method and keySet is that keySet's iterator() method returns an iterator that iterates over the keys in ascending order by key. This method's iterator method iterates over the keys in ascending order by value.
public Collection valuesByValue()
The difference between this method and values is that values's iterator() method returns an iterator that iterates over the values in ascending order by key. This method's iterator method iterates over the values in ascending order by key.
public int size()
size
in interface Map
size
in class AbstractMap
public boolean containsKey(Object key) throws ClassCastException, NullPointerException
containsKey
in interface Map
containsKey
in class AbstractMap
key
- key whose presence in this map is to be tested.ClassCastException
- if the key is of an inappropriate
type for this map.NullPointerException
- if the key is nullpublic boolean containsValue(Object value)
containsValue
in interface Map
containsValue
in class AbstractMap
value
- value whose presence in this map is to be tested.public Object get(Object key) throws ClassCastException, NullPointerException
get
in interface Map
get
in class AbstractMap
key
- key whose associated value is to be returned.ClassCastException
- if the key is of an inappropriate
type for this map.NullPointerException
- if the key is nullpublic Object put(Object key, Object value) throws ClassCastException, NullPointerException, IllegalArgumentException
put
in interface Map
put
in class AbstractMap
key
- key with which the specified value is to be
associated.value
- value to be associated with the specified key.ClassCastException
- if the class of the specified key
or value prevents it from being
stored in this map.NullPointerException
- if the specified key or value
is nullIllegalArgumentException
- if the key duplicates an
existing key, or if the
value duplicates an
existing valuepublic Object remove(Object key)
remove
in interface Map
remove
in class AbstractMap
key
- key whose mapping is to be removed from the map.public void clear()
clear
in interface Map
clear
in class AbstractMap
public Set keySet()
keySet
in interface Map
keySet
in class AbstractMap
public Collection values()
values
in interface Map
values
in class AbstractMap
public Set entrySet()
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. The setValue method is not supported on the Map Entry.
entrySet
in interface Map
entrySet
in class AbstractMap
Copyright © 2001–2015 The Apache Software Foundation. All rights reserved.