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 Details

  • Constructor Details

  • 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