How to use

fetchNext

method

in

org.h2.mvstore.Cursor

@Override
public boolean hasNext() {
  if (!initialized) {
    min(root, from);
    initialized = true;
    fetchNext();
  }
  return current != null;
}

@Override
public K next() {
  hasNext();
  K c = current;
  last = current;
  lastValue = currentValue;
  lastPage = pos == null ? null : pos.page;
  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) {
  if (!hasNext()) {
    return;
  }
  if (n < 10) {
    while (n-- > 0) {
      fetchNext();
    }
    return;
  }
  long index = map.getKeyIndex(current);
  K k = map.getKey(index + n);
  pos = null;
  min(root, k);
  fetchNext();
}

@Override
public boolean hasNext() {
  if (!initialized) {
    min(root, from);
    initialized = true;
    fetchNext();
  }
  return current != null;
}

@Override
public boolean hasNext() {
  if (!initialized) {
    min(root, from);
    initialized = true;
    fetchNext();
  }
  return current != null;
}

@Override
public K next() {
  hasNext();
  K c = current;
  last = current;
  lastValue = currentValue;
  lastPage = pos == null ? null : pos.page;
  fetchNext();
  return c;
}

@Override
public K next() {
  hasNext();
  K c = current;
  last = current;
  lastValue = currentValue;
  lastPage = pos == null ? null : pos.page;
  fetchNext();
  return c;
}

@Override
public boolean hasNext() {
  if (!initialized) {
    min(root, from);
    initialized = true;
    fetchNext();
  }
  return current != null;
}

@Override
public K next() {
  hasNext();
  K c = current;
  last = current;
  lastValue = currentValue;
  lastPage = pos == null ? null : pos.page;
  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) {
  if (!hasNext()) {
    return;
  }
  if (n < 10) {
    while (n-- > 0) {
      fetchNext();
    }
    return;
  }
  long index = map.getKeyIndex(current);
  K k = map.getKey(index + n);
  pos = null;
  min(root, k);
  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) {
  if (!hasNext()) {
    return;
  }
  if (n < 10) {
    while (n-- > 0) {
      fetchNext();
    }
    return;
  }
  long index = map.getKeyIndex(current);
  K k = map.getKey(index + n);
  pos = null;
  min(root, k);
  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) {
  if (!hasNext()) {
    return;
  }
  if (n < 10) {
    while (n-- > 0) {
      fetchNext();
    }
    return;
  }
  long index = map.getKeyIndex(current);
  K k = map.getKey(index + n);
  pos = null;
  min(root, k);
  fetchNext();
}