abstract class ConcurrentSkipListMap.Iter
extends java.lang.Object
| Modifier and Type | Field and Description |
|---|---|
(package private) ConcurrentSkipListMap.Node<K,V> |
last
the last node returned by next()
|
(package private) ConcurrentSkipListMap.Node<K,V> |
next
the next node to return from next();
|
(package private) java.lang.Object |
nextValue
Cache of next value field to maintain weak consistency
|
| Constructor and Description |
|---|
Iter() |
| Modifier and Type | Method and Description |
|---|---|
(package private) void |
ascend()
advance next to higher entry
|
(package private) void |
ascend(K fence)
Version of ascend for submaps to stop at fence
|
(package private) void |
descend()
advance next to lower entry
|
(package private) void |
descend(K least)
Version of descend for submaps to stop at least
|
boolean |
hasNext() |
(package private) void |
initAscending()
initialize ascending iterator for entire range
|
(package private) void |
initAscending(K least,
K fence)
initialize ascending iterator starting at given least key,
or first node if least is null, but not greater or
equal to fence, or end if fence is null.
|
(package private) void |
initDescending()
initialize descending iterator for entire range
|
(package private) void |
initDescending(K least,
K fence)
initialize descending iterator starting at key less
than or equal to given fence key, or
last node if fence is null, but not less than
least, or beginning if lest is null.
|
void |
remove() |
ConcurrentSkipListMap.Node<K,V> last
ConcurrentSkipListMap.Node<K,V> next
java.lang.Object nextValue
public final boolean hasNext()
final void initAscending()
final void initAscending(K least, K fence)
final void ascend()
final void ascend(K fence)
final void initDescending()
final void initDescending(K least, K fence)
final void descend()
final void descend(K least)
public void remove()