Package org.h2.mvstore.rtree
Class MVRTreeMap.RTreeCursor<V>
java.lang.Object
org.h2.mvstore.rtree.MVRTreeMap.RTreeCursor<V>
- Direct Known Subclasses:
MVRTreeMap.ContainsRTreeCursor
,MVRTreeMap.IntersectsRTreeCursor
,MVSpatialIndex.FindBoundsCursor
- Enclosing class:
MVRTreeMap<V>
A cursor to iterate over a subset of the keys.
-
Field Details
-
filter
-
pos
-
current
-
root
-
initialized
private boolean initialized
-
-
Constructor Details
-
RTreeCursor
-
-
Method Details
-
hasNext
public boolean hasNext() -
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
-
fetchNext
void fetchNext()Fetch the next entry if there is one. -
check
Check a given key.- Parameters:
leaf
- if the key is from a leaf pagekey
- the stored keytest
- the user-supplied test key- Returns:
- true if there is a match
-