public boolean isPayloadAvailable() { SpansCell pointer = min(); while (pointer != null) { if (pointer.isPayloadAvailable()) { return true; } pointer = pointer.next; } return false; }
public boolean isPayloadAvailable() { SpansCell pointer = min(); while (pointer != null) { if (pointer.isPayloadAvailable()) { return true; } pointer = pointer.next; } return false; }
public int doc() { return min().doc(); } public int start() { return min().start(); }
public int start() { return min().start(); } public int end() { return max.end(); }
public int doc() { return min().doc(); } public int start() { return min().start(); }
public int start() { return min().start(); } public int end() { return max.end(); }
public boolean skipTo(int target) throws IOException { if (firstTime) { // initialize initList(false); for (SpansCell cell = first; more && cell!=null; cell=cell.next) { more = cell.skipTo(target); // skip all } if (more) { listToQueue(); } firstTime = false; } else { // normal case while (more && min().doc() < target) { // skip as needed if (min().skipTo(target)) { queue.adjustTop(); } else { more = false; } } } return more && (atMatch() || next()); }
public boolean skipTo(int target) throws IOException { if (firstTime) { // initialize initList(false); for (SpansCell cell = first; more && cell!=null; cell=cell.next) { more = cell.skipTo(target); // skip all } if (more) { listToQueue(); } firstTime = false; } else { // normal case while (more && min().doc() < target) { // skip as needed if (min().skipTo(target)) { queue.adjustTop(); } else { more = false; } } } return more && (atMatch() || next()); }