|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
Defines a map that maintains order and allows both forward and backward iteration through that order.
Method Summary | |
Object |
firstKey()
Gets the first key currently in this map. |
Object |
lastKey()
Gets the last key currently in this map. |
Object |
nextKey(Object key)
Gets the next key after the one specified. |
OrderedMapIterator |
orderedMapIterator()
Obtains an OrderedMapIterator over the map. |
Object |
previousKey(Object key)
Gets the previous key before the one specified. |
Methods inherited from interface org.apache.commons.collections.IterableMap |
mapIterator |
Methods inherited from interface java.util.Map |
clear, containsKey, containsValue, entrySet, equals, get, hashCode, isEmpty, keySet, put, putAll, remove, size, values |
Method Detail |
public OrderedMapIterator orderedMapIterator()
OrderedMapIterator
over the map.
A ordered map iterator is an efficient way of iterating over maps in both directions.
BidiMap map = new TreeBidiMap(); MapIterator it = map.mapIterator(); while (it.hasNext()) { Object key = it.next(); Object value = it.getValue(); it.setValue("newValue"); Object previousKey = it.previous(); }
public Object firstKey()
NoSuchElementException
- if this map is emptypublic Object lastKey()
NoSuchElementException
- if this map is emptypublic Object nextKey(Object key)
key
- the key to search for next from
public Object previousKey(Object key)
key
- the key to search for previous from
|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |