How to use

MVRTreeMap$RTreeCursor

in

org.h2.mvstore.rtree

while (pos.index < p.getKeyCount()) {
  SpatialKey c = (SpatialKey) p.getKey(pos.index++);
  if (filter == null || check(true, c, filter)) {
    current = c;
    return;
  int index = pos.index++;
  SpatialKey c = (SpatialKey) p.getKey(index);
  if (filter == null || check(false, c, filter)) {
    Page child = pos.page.getChildPage(index);
    pos = new CursorPos(child, 0, pos);

@Override
public boolean hasNext() {
  if (!initialized) {
    // init
    pos = new CursorPos(root, 0, null);
    fetchNext();
    initialized = true;
  }
  return current != null;
}

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

while (pos.index < p.getKeyCount()) {
  SpatialKey c = (SpatialKey) p.getKey(pos.index++);
  if (filter == null || check(true, c, filter)) {
    current = c;
    return;
  int index = pos.index++;
  SpatialKey c = (SpatialKey) p.getKey(index);
  if (filter == null || check(false, c, filter)) {
    Page child = pos.page.getChildPage(index);
    pos = new CursorPos(child, 0, pos);

while (pos.index < p.getKeyCount()) {
  SpatialKey c = (SpatialKey) p.getKey(pos.index++);
  if (filter == null || check(true, c, filter)) {
    current = c;
    return;
  int index = pos.index++;
  SpatialKey c = (SpatialKey) p.getKey(index);
  if (filter == null || check(false, c, filter)) {
    Page child = pos.page.getChildPage(index);
    pos = new CursorPos(child, 0, pos);

/**
 * 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 boolean hasNext() {
  if (!initialized) {
    // init
    pos = new CursorPos(root, 0, null);
    fetchNext();
    initialized = true;
  }
  return current != null;
}

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

@Override
public boolean hasNext() {
  if (!initialized) {
    // init
    pos = new CursorPos(root, 0, null);
    fetchNext();
    initialized = true;
  }
  return current != null;
}

while (pos.index < p.getKeyCount()) {
  SpatialKey c = (SpatialKey) p.getKey(pos.index++);
  if (filter == null || check(true, c, filter)) {
    current = c;
    return;
  int index = pos.index++;
  SpatialKey c = (SpatialKey) p.getKey(index);
  if (filter == null || check(false, c, filter)) {
    Page child = pos.page.getChildPage(index);
    pos = new CursorPos(child, 0, pos);

@Override
public boolean hasNext() {
  if (!initialized) {
    // init
    pos = new CursorPos(root, 0, null);
    fetchNext();
    initialized = true;
  }
  return current != null;
}

/**
 * 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;
}