org.bitlap.roaringbitmap.art

类 LeafNodeIterator

java.lang.Object

org.bitlap.roaringbitmap.art.LeafNodeIterator

所有已实现的接口:

java.util.Iterator<LeafNode>

public class LeafNodeIterator
extends java.lang.Object
implements java.util.Iterator<LeafNode>

构造器概要

构造器

构造器和说明
LeafNodeIterator(Art art, boolean reverse, Containers containers) constructor
LeafNodeIterator(Art art, boolean reverse, Containers containers, long from) constructor
LeafNodeIterator(Art art, Containers containers) constructor

方法概要

限定符和类型	方法和说明
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`.

从类继承的方法 java.lang.Object

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

从接口继承的方法 java.util.Iterator

forEachRemaining

构造器详细资料

LeafNodeIterator

public LeafNodeIterator(Art art,
                        Containers containers)

constructor

参数:

art - the ART

containers - the containers

LeafNodeIterator

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

constructor

参数:

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

参数:

art - the ART

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

containers - the containers

from - starting upper/lower bound

方法详细资料

hasNext

public boolean hasNext()

指定者:

hasNext 在接口中 java.util.Iterator<LeafNode>

next

public LeafNode next()

指定者:

next 在接口中 java.util.Iterator<LeafNode>

remove

public void remove()

指定者:

remove 在接口中 java.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.

返回:

the next leaf