public final class UtlLinkedHashMap.FastIterator extends Object implements ListIterator<Map.Entry<K,V>>
UtlLinkedHashMap
entries. This iterator is bi-directional and can be
directly moved to the first
or last
entry. For example:for (FastIterator i=map.fastIterator().toFirst(); i.hasNext();) { Entry entry = i.nextEntry(); ... }
setting
or adding
new entries is not
supported.Constructor and Description |
---|
UtlLinkedHashMap.FastIterator() |
Modifier and Type | Method and Description |
---|---|
void |
add(Map.Entry<K,V> o) |
boolean |
hasNext() |
boolean |
hasPrevious() |
Map.Entry<K,V> |
next() |
Map.Entry<K,V> |
nextEntry() |
int |
nextIndex() |
Map.Entry<K,V> |
previous() |
Map.Entry<K,V> |
previousEntry() |
int |
previousIndex() |
void |
remove() |
void |
set(Map.Entry<K,V> o) |
UtlLinkedHashMap.FastIterator |
toFirst()
Resets the iterator to the beginning.
|
UtlLinkedHashMap.FastIterator |
toLast()
Resets the iterator to the last element.
|
public UtlLinkedHashMap.FastIterator toFirst()
public UtlLinkedHashMap.FastIterator toLast()
public boolean hasNext()
public boolean hasPrevious()
hasPrevious
in interface ListIterator<Map.Entry<K,V>>
public Map.Entry<K,V> previous()
previous
in interface ListIterator<Map.Entry<K,V>>
public int nextIndex()
nextIndex
in interface ListIterator<Map.Entry<K,V>>
public int previousIndex()
previousIndex
in interface ListIterator<Map.Entry<K,V>>
public void remove()
Copyright © 2019 Neeve Research, LLC. All Rights Reserved.