Package org.h2.mvstore.rtree
Class MVRTreeMap.RTreeCursor<V>
- java.lang.Object
-
- org.h2.mvstore.rtree.MVRTreeMap.RTreeCursor<V>
-
- All Implemented Interfaces:
java.util.Iterator<Spatial>
- Direct Known Subclasses:
MVRTreeMap.ContainsRTreeCursor
,MVRTreeMap.IntersectsRTreeCursor
,MVSpatialIndex.FindBoundsCursor
- Enclosing class:
- MVRTreeMap<V>
public abstract static class MVRTreeMap.RTreeCursor<V> extends java.lang.Object implements java.util.Iterator<Spatial>
A cursor to iterate over a subset of the keys.
-
-
Constructor Summary
Constructors Modifier Constructor Description protected
RTreeCursor(Page<Spatial,V> root, Spatial filter)
-
Method Summary
All Methods Instance Methods Abstract Methods Concrete Methods 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.
-
-
-
Method Detail
-
hasNext
public boolean hasNext()
- Specified by:
hasNext
in interfacejava.util.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
-
fetchNext
void fetchNext()
Fetch the next entry if there is one.
-
-