Package org.roaringbitmap.art
Class LeafNodeIterator
- java.lang.Object
-
- org.roaringbitmap.art.LeafNodeIterator
-
-
Constructor Summary
Constructors Constructor Description LeafNodeIterator(Art art, boolean reverse, Containers containers)
constructorLeafNodeIterator(Art art, boolean reverse, Containers containers, long from)
constructorLeafNodeIterator(Art art, Containers containers)
constructor
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description boolean
hasNext()
LeafNode
next()
LeafNode
peekNext()
Return the next leaf without advancing the iterator.void
remove()
void
seek(long boundval)
Move this iterator to the leaf that contains `boundval`.
-
-
-
Constructor Detail
-
LeafNodeIterator
public LeafNodeIterator(Art art, Containers containers)
constructor- Parameters:
art
- the ARTcontainers
- the containers
-
LeafNodeIterator
public LeafNodeIterator(Art art, boolean reverse, Containers containers)
constructor- Parameters:
art
- the ARTreverse
- false: ascending order,true: the descending ordercontainers
- the containers
-
LeafNodeIterator
public LeafNodeIterator(Art art, boolean reverse, Containers containers, long from)
constructor- Parameters:
art
- the ARTreverse
- false: ascending order,true: the descending ordercontainers
- the containersfrom
- starting upper/lower bound
-
-
Method Detail
-
hasNext
public boolean hasNext()
- Specified by:
hasNext
in interfacejava.util.Iterator<LeafNode>
-
remove
public void remove()
- Specified by:
remove
in interfacejava.util.Iterator<LeafNode>
-
seek
public void seek(long boundval)
Move this iterator to the leaf that contains `boundval`. If no leaf contains `boundval`, then move to the next largest (on forward iterators or next smallest (on backwards iterators).
-
peekNext
public LeafNode peekNext()
Return the next leaf without advancing the iterator.- Returns:
- the next leaf
-
-