org.h2.mvstore.rtree

类 MVRTreeMap.RTreeCursor

java.lang.Object

org.h2.mvstore.rtree.MVRTreeMap.RTreeCursor

所有已实现的接口:

Iterator<SpatialKey>

封闭类:

MVRTreeMap<V>

public static class MVRTreeMap.RTreeCursor
extends Object
implements Iterator<SpatialKey>

A cursor to iterate over a subset of the keys.

构造器概要

构造器

限定符	构造器和说明
protected	RTreeCursor(Page root, SpatialKey filter)

方法概要

限定符和类型	方法和说明
protected boolean	check(boolean leaf, SpatialKey key, SpatialKey test) Check a given key.
protected void	fetchNext() Fetch the next entry if there is one.
boolean	hasNext()
SpatialKey	next()
void	remove()
void	skip(long n) Skip over that many entries.

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

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

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

forEachRemaining

构造器详细资料

RTreeCursor

protected RTreeCursor(Page root,
                      SpatialKey filter)

方法详细资料

hasNext

public boolean hasNext()

指定者:

hasNext 在接口中 Iterator<SpatialKey>

skip

public void skip(long n)

Skip over that many entries. This method is relatively fast (for this map implementation) even if many entries need to be skipped.

参数:

n - the number of entries to skip

next

public SpatialKey next()

指定者:

next 在接口中 Iterator<SpatialKey>

remove

public void remove()

指定者:

remove 在接口中 Iterator<SpatialKey>

fetchNext

protected void fetchNext()

Fetch the next entry if there is one.

check

protected boolean check(boolean leaf,
                        SpatialKey key,
                        SpatialKey test)

Check a given key.

参数:

leaf - if the key is from a leaf page

key - the stored key

test - the user-supplied test key

返回:

true if there is a match