public final class BinaryTree
extends java.util.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.
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.
Constructor and Description |
---|
BinaryTree()
Construct a new BinaryTree
|
BinaryTree(java.util.Map map)
Constructs a new BinaryTree from an existing Map, with keys and
values sorted
|
Modifier and Type | Method and Description |
---|---|
void |
clear()
Removes all mappings from this map
|
boolean |
containsKey(java.lang.Object key)
Returns true if this map contains a mapping for the specified
key.
|
boolean |
containsValue(java.lang.Object value)
Returns true if this map maps one or more keys to the
specified value.
|
java.util.Set |
entrySet()
Returns a set view of the mappings contained in this map.
|
java.util.Set |
entrySetByValue()
Returns a set view of the mappings contained in this map.
|
java.lang.Object |
get(java.lang.Object key)
Returns the value to which this map maps the specified
key.
|
java.lang.Object |
getKeyForValue(java.lang.Object value)
Returns the key to which this map maps the specified value.
|
java.util.Set |
keySet()
Returns a set view of the keys contained in this map.
|
java.util.Set |
keySetByValue()
Returns a set view of the keys contained in this map.
|
java.lang.Object |
put(java.lang.Object key,
java.lang.Object value)
Associates the specified value with the specified key in this
map.
|
java.lang.Object |
remove(java.lang.Object key)
Removes the mapping for this key from this map if present
|
java.lang.Object |
removeValue(java.lang.Object value)
Removes the mapping for this value from this map if present
|
int |
size()
Returns the number of key-value mappings in this map.
|
java.util.Collection |
values()
Returns a collection view of the values contained in this
map.
|
java.util.Collection |
valuesByValue()
Returns a collection view of the values contained in this
map.
|
public BinaryTree()
public BinaryTree(java.util.Map map) throws java.lang.ClassCastException, java.lang.NullPointerException, java.lang.IllegalArgumentException
map
- the map whose mappings are to be placed in this map.java.lang.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 Comparablejava.lang.NullPointerException
- if any key or value in the map
is nulljava.lang.IllegalArgumentException
- if there are duplicate keys
or duplicate values in the
mappublic java.lang.Object getKeyForValue(java.lang.Object value) throws java.lang.ClassCastException, java.lang.NullPointerException
value
- value whose associated key is to be returned.java.lang.ClassCastException
- if the value is of an
inappropriate type for this map.java.lang.NullPointerException
- if the value is nullpublic java.lang.Object removeValue(java.lang.Object value)
value
- value whose mapping is to be removed from the map.public java.util.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 java.util.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 java.util.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 java.util.Map
size
in class java.util.AbstractMap
public boolean containsKey(java.lang.Object key) throws java.lang.ClassCastException, java.lang.NullPointerException
containsKey
in interface java.util.Map
containsKey
in class java.util.AbstractMap
key
- key whose presence in this map is to be tested.java.lang.ClassCastException
- if the key is of an inappropriate
type for this map.java.lang.NullPointerException
- if the key is nullpublic boolean containsValue(java.lang.Object value)
containsValue
in interface java.util.Map
containsValue
in class java.util.AbstractMap
value
- value whose presence in this map is to be tested.public java.lang.Object get(java.lang.Object key) throws java.lang.ClassCastException, java.lang.NullPointerException
get
in interface java.util.Map
get
in class java.util.AbstractMap
key
- key whose associated value is to be returned.java.lang.ClassCastException
- if the key is of an inappropriate
type for this map.java.lang.NullPointerException
- if the key is nullpublic java.lang.Object put(java.lang.Object key, java.lang.Object value) throws java.lang.ClassCastException, java.lang.NullPointerException, java.lang.IllegalArgumentException
put
in interface java.util.Map
put
in class java.util.AbstractMap
key
- key with which the specified value is to be
associated.value
- value to be associated with the specified key.java.lang.ClassCastException
- if the class of the specified key
or value prevents it from being
stored in this map.java.lang.NullPointerException
- if the specified key or value
is nulljava.lang.IllegalArgumentException
- if the key duplicates an
existing key, or if the
value duplicates an
existing valuepublic java.lang.Object remove(java.lang.Object key)
remove
in interface java.util.Map
remove
in class java.util.AbstractMap
key
- key whose mapping is to be removed from the map.public void clear()
clear
in interface java.util.Map
clear
in class java.util.AbstractMap
public java.util.Set keySet()
keySet
in interface java.util.Map
keySet
in class java.util.AbstractMap
public java.util.Collection values()
values
in interface java.util.Map
values
in class java.util.AbstractMap
public java.util.Set entrySet()
entrySet
in interface java.util.Map
entrySet
in class java.util.AbstractMap
Copyright © 2014 Open Microscopy Environment