Module roaringbitmap

Package org.roaringbitmap.art

Class LeafNodeIterator

java.lang.Object

org.roaringbitmap.art.LeafNodeIterator

All Implemented Interfaces:

Iterator<LeafNode>

public class LeafNodeIterator
extends Object
implements Iterator<LeafNode>

Constructor Summary

Constructors

Constructor	Description
LeafNodeIterator(Art art, boolean reverse, Containers containers)	constructor
LeafNodeIterator(Art art, boolean reverse, Containers containers, long from)	constructor
LeafNodeIterator(Art art, Containers containers)	constructor

Method Summary

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`.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.util.Iterator

forEachRemaining

Constructor Details

LeafNodeIterator

public LeafNodeIterator(Art art,
 Containers containers)

constructor

Parameters:

art - the ART

containers - the containers

LeafNodeIterator

public LeafNodeIterator(Art art,
 boolean reverse,
 Containers containers)

constructor

Parameters:

art - the ART

reverse - false: ascending order,true: the descending order

containers - the containers

LeafNodeIterator

public LeafNodeIterator(Art art,
 boolean reverse,
 Containers containers,
 long from)

constructor

Parameters:

art - the ART

reverse - false: ascending order,true: the descending order

containers - the containers

from - starting upper/lower bound

Method Details

hasNext

public boolean hasNext()

Specified by:

hasNext in interface Iterator<LeafNode>

next

public LeafNode next()

Specified by:

next in interface Iterator<LeafNode>

remove

public void remove()

Specified by:

remove in interface 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