- <init>
Constructs a new TreeBidiMap by copying an existing Map.
- entrySet
Returns a set view of the entries contained in this map in key order. For simple
iteration through t
- isEmpty
Checks whether the map is empty or not.
- put
Puts the key-value pair into the map, replacing any previous pair. When adding a
key-value pair, the
- containsKey
Checks whether this map contains the a mapping for the specified key. The key
must implement Compara
- containsValue
Checks whether this map contains the a mapping for the specified value. The
value must implement Com
- getKey
Returns the key to which this map maps the specified value. Returns null if the
map contains no mapp
- inverseBidiMap
Gets the inverse map for comparison.
- keySet
Returns a set view of the keys contained in this map in key order. The set is
backed by the map, so
- lastKey
Gets the last (highest) key currently in this map.
- nextKey
Gets the next key after the one specified. The key must implement Comparable.
- removeValue
Removes the mapping for this value from this map if present. The value must
implement Comparable.