K - the type of the keys in the mapV - the type of the values in the mapGet<K,V>, IterableGet<K,V>, IterableMap<K,V>, java.util.Map<K,V>, Put<K,V>IterableSortedMap<K,V>, OrderedBidiMap<K,V>, SortedBidiMap<K,V>, Trie<K,V>AbstractBitwiseTrie, AbstractLinkedMap, AbstractOrderedBidiMapDecorator, AbstractOrderedMapDecorator, AbstractSortedBidiMapDecorator, AbstractSortedMapDecorator, DualTreeBidiMap, DualTreeBidiMap.ViewMap, FixedSizeSortedMap, LinkedMap, ListOrderedMap, LRUMap, PatriciaTrie, SingletonMap, TreeBidiMap, UnmodifiableOrderedBidiMap, UnmodifiableOrderedMap, UnmodifiableSortedBidiMap, UnmodifiableSortedMap, UnmodifiableTriepublic interface OrderedMap<K,V> extends IterableMap<K,V>
| Modifier and Type | Method | Description |
|---|---|---|
K |
firstKey() |
Gets the first key currently in this map.
|
K |
lastKey() |
Gets the last key currently in this map.
|
OrderedMapIterator<K,V> |
mapIterator() |
Obtains an
OrderedMapIterator over the map. |
K |
nextKey(K key) |
Gets the next key after the one specified.
|
K |
previousKey(K key) |
Gets the previous key before the one specified.
|
containsKey, containsValue, entrySet, get, isEmpty, keySet, remove, size, valuesclear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entry, entrySet, equals, forEach, get, getOrDefault, hashCode, isEmpty, keySet, merge, of, of, of, of, of, of, of, of, of, of, of, ofEntries, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size, valuesOrderedMapIterator<K,V> mapIterator()
OrderedMapIterator over the map.
A ordered map iterator is an efficient way of iterating over maps in both directions.
mapIterator in interface IterableGet<K,V>K firstKey()
java.util.NoSuchElementException - if this map is emptyK lastKey()
java.util.NoSuchElementException - if this map is emptyK nextKey(K key)
key - the key to search for next fromCopyright © 2001-2019 - Apache Software Foundation