Implementations should allow a value to be looked up from a key and a key to be looked up from a value with equal performance.
| Method Summary | |
|---|---|
| BidiMap |
Gets a view of this map where the keys and values are reversed. |
| SortedBidiMap |
Gets a view of this map where the keys and values are reversed. |
| Methods inherited from org.apache.commons.collectionsBidiMap |
|---|
| Methods inherited from org.apache.commons.collectionsIterableMap |
|---|
| Methods inherited from java.utilMap |
|---|
| Methods inherited from org.apache.commons.collectionsOrderedBidiMap |
|---|
| Methods inherited from org.apache.commons.collectionsOrderedMap |
|---|
| Methods inherited from java.utilSortedMap |
|---|
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 SortedMap.
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.
The inverse map returned by inverseBidiMap() should be the
same object as returned by this method.
Changes to one map will be visible in the other and vice versa. This enables both directions of the map to be accessed equally.
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.Implementations must return a
SortedBidiMapinstance, usually by forwarding toinverseSortedBidiMap().