How to use

hasNext

method

in

org.h2.mvstore.rtree.MVRTreeMap$RTreeCursor

@Override
public SpatialKey next() {
  if (!hasNext()) {
    return null;
  }
  SpatialKey c = current;
  fetchNext();
  return c;
}

/**
 * Skip over that many entries. This method is relatively fast (for this
 * map implementation) even if many entries need to be skipped.
 *
 * @param n the number of entries to skip
 */
public void skip(long n) {
  while (hasNext() && n-- > 0) {
    fetchNext();
  }
}

@Override
public SpatialKey next() {
  if (!hasNext()) {
    return null;
  }
  SpatialKey c = current;
  fetchNext();
  return c;
}

/**
 * Skip over that many entries. This method is relatively fast (for this
 * map implementation) even if many entries need to be skipped.
 *
 * @param n the number of entries to skip
 */
public void skip(long n) {
  while (hasNext() && n-- > 0) {
    fetchNext();
  }
}

/**
 * Skip over that many entries. This method is relatively fast (for this
 * map implementation) even if many entries need to be skipped.
 *
 * @param n the number of entries to skip
 */
public void skip(long n) {
  while (hasNext() && n-- > 0) {
    fetchNext();
  }
}

@Override
public SpatialKey next() {
  if (!hasNext()) {
    return null;
  }
  SpatialKey c = current;
  fetchNext();
  return c;
}

/**
 * Skip over that many entries. This method is relatively fast (for this
 * map implementation) even if many entries need to be skipped.
 *
 * @param n the number of entries to skip
 */
public void skip(long n) {
  while (hasNext() && n-- > 0) {
    fetchNext();
  }
}

@Override
public SpatialKey next() {
  if (!hasNext()) {
    return null;
  }
  SpatialKey c = current;
  fetchNext();
  return c;
}