Package org.jboss.util.collection
Class ConcurrentSkipListMap.Iter
- java.lang.Object
-
- org.jboss.util.collection.ConcurrentSkipListMap.Iter
-
- Direct Known Subclasses:
ConcurrentSkipListMap.DescendingKeyIterator
,ConcurrentSkipListMap.DescendingSubMapKeyIterator
,ConcurrentSkipListMap.EntryIter
,ConcurrentSkipListMap.KeyIterator
,ConcurrentSkipListMap.SubMapKeyIterator
,ConcurrentSkipListMap.SubMapValueIterator
,ConcurrentSkipListMap.ValueIterator
- Enclosing class:
- ConcurrentSkipListMap<K,V>
abstract class ConcurrentSkipListMap.Iter extends java.lang.Object
Base of ten kinds of iterator classes: ascending: {map, submap} X {key, value, entry} descending: {map, submap} X {key, entry}
-
-
Field Summary
Fields Modifier and Type Field 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 Summary
Constructors Constructor Description Iter()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method 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 leastboolean
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()
-
-
-
Field Detail
-
last
ConcurrentSkipListMap.Node<K,V> last
the last node returned by next()
-
next
ConcurrentSkipListMap.Node<K,V> next
the next node to return from next();
-
nextValue
java.lang.Object nextValue
Cache of next value field to maintain weak consistency
-
-
Method Detail
-
hasNext
public final boolean hasNext()
-
initAscending
final void initAscending()
initialize ascending iterator for entire range
-
initAscending
final 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.
-
ascend
final void ascend()
advance next to higher entry
-
ascend
final void ascend(K fence)
Version of ascend for submaps to stop at fence
-
initDescending
final void initDescending()
initialize descending iterator for entire range
-
initDescending
final 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.
-
descend
final void descend()
advance next to lower entry
-
descend
final void descend(K least)
Version of descend for submaps to stop at least
-
remove
public void remove()
-
-