|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface OrderedBidiMap<K,V>
Defines a map that allows bidirectional lookup between key and values and retains and provides access to an ordering.
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.
Nested Class Summary |
---|
Nested classes/interfaces inherited from interface java.util.Map |
---|
java.util.Map.Entry<K,V> |
Nested classes/interfaces inherited from interface java.util.Map |
---|
java.util.Map.Entry<K,V> |
Method Summary | |
---|---|
BidiMap<V,K> |
inverseBidiMap()
Gets a view of this map where the keys and values are reversed. |
OrderedBidiMap<V,K> |
inverseOrderedBidiMap()
Gets a view of this map where the keys and values are reversed. |
Methods inherited from interface net.sf.collections15.BidiMap |
---|
getKey, mapIterator, put, removeValue |
Methods inherited from interface java.util.Map |
---|
clear, containsKey, containsValue, entrySet, equals, get, hashCode, isEmpty, keySet, putAll, remove, size, values |
Methods inherited from interface net.sf.collections15.OrderedMap |
---|
firstKey, lastKey, nextKey, orderedMapIterator, previousKey |
Methods inherited from interface java.util.Map |
---|
clear, containsKey, containsValue, entrySet, equals, get, hashCode, isEmpty, keySet, putAll, remove, size, values |
Method Detail |
---|
BidiMap<V,K> inverseBidiMap()
AbstractMap.values()
etc. Calling
this method on the inverse map should return the original.
Implementations must return an OrderedBidiMap
instance,
usually by forwarding to inverseOrderedBidiMap()
.
inverseBidiMap
in interface BidiMap<K,V>
OrderedBidiMap<V,K> inverseOrderedBidiMap()
AbstractMap.values()
etc. Calling
this method on the inverse map should return the original.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |