Class MVRTreeMap.RTreeCursor<V>

java.lang.Object

org.h2.mvstore.rtree.MVRTreeMap.RTreeCursor<V>

All Implemented Interfaces:

Iterator<Spatial>

Direct Known Subclasses:

MVRTreeMap.ContainsRTreeCursor, MVRTreeMap.IntersectsRTreeCursor, MVSpatialIndex.FindBoundsCursor

Enclosing class:

MVRTreeMap<V>

public abstract static class MVRTreeMap.RTreeCursor<V>
extends Object
implements Iterator<Spatial>

A cursor to iterate over a subset of the keys.

Field Summary

Fields

Modifier and Type	Field	Description
private Spatial	current
private final Spatial	filter
private boolean	initialized
private CursorPos<Spatial,V>	pos
private final Page<Spatial,V>	root

Constructor Summary

Constructors

Modifier	Constructor	Description
protected	RTreeCursor(Page<Spatial,V> root, Spatial filter)

Method Summary

Modifier and Type	Method	Description
protected abstract boolean	check(boolean leaf, Spatial key, Spatial test)	Check a given key.
(package private) void	fetchNext()	Fetch the next entry if there is one.
boolean	hasNext()
Spatial	next()
void	skip(long n)	Skip over that many entries.

Methods inherited from class Object

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

Methods inherited from interface Iterator

forEachRemaining, remove

Field Details

filter

private final Spatial filter

pos

private CursorPos<Spatial,V> pos

current

private Spatial current

root

private final Page<Spatial,V> root

initialized

private boolean initialized

Constructor Details

RTreeCursor

protected RTreeCursor(Page<Spatial,V> root,
 Spatial filter)

Method Details

hasNext

public boolean hasNext()

Specified by:

hasNext in interface Iterator<V>

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.

Parameters:

n - the number of entries to skip

next

public Spatial next()

Specified by:

next in interface Iterator<V>

fetchNext

void fetchNext()

Fetch the next entry if there is one.

check

protected abstract boolean check(boolean leaf,
 Spatial key,
 Spatial test)

Check a given key.

Parameters:

leaf - if the key is from a leaf page

key - the stored key

test - the user-supplied test key

Returns:

true if there is a match