Class MVRTreeMap.RTreeCursor<V>

    • Method Detail

      • hasNext

        public boolean hasNext()
        Specified by:
        hasNext in interface java.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
      • next

        public Spatial next()
        Specified by:
        next in interface java.util.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