@Override public final int endPosition() { return atFirstInCurrentDoc ? -1 : (startPos != NO_MORE_POSITIONS) ? in.endPosition() : NO_MORE_POSITIONS; }
@Override public int endPosition() { return atFirstInCurrentDoc ? -1 : oneExhaustedInCurrentDoc ? NO_MORE_POSITIONS : sourceSpans.endPosition(); }
@Override public int endPosition() { return topPositionSpans == null ? -1 : topPositionSpans.endPosition(); }
protected boolean lessThan(Spans s1, Spans s2) { int start1 = s1.startPosition(); int start2 = s2.startPosition(); return (start1 < start2) ? true : (start1 == start2) ? s1.endPosition() < s2.endPosition() : false; } }
@Override public String toString() { StringBuilder sb = new StringBuilder(); Class<? extends Spans> clazz = getClass(); sb.append(clazz.isAnonymousClass() ? clazz.getName() : clazz.getSimpleName()); sb.append("(doc=").append(docID()); sb.append(",start=").append(startPosition()); sb.append(",end=").append(endPosition()); sb.append(")"); return sb.toString(); }
@Override protected AcceptStatus acceptPosition(Spans spans) throws IOException { assert spans.startPosition() != spans.endPosition(); AcceptStatus res = (spans.startPosition() >= end) ? AcceptStatus.NO_MORE_IN_CURRENT_DOC : (spans.startPosition() >= start && spans.endPosition() <= end) ? AcceptStatus.YES : AcceptStatus.NO; return res; }
protected AcceptStatus acceptPosition(Spans spans) throws IOException { assert spans.startPosition() != spans.endPosition() : "start equals end: " + spans.startPosition(); if (spans.startPosition() >= end) return AcceptStatus.NO_MORE_IN_CURRENT_DOC; else if (spans.endPosition() <= end) return AcceptStatus.YES; else return AcceptStatus.NO; }
boolean nextPosition() throws IOException { Spans topSpans = top(); assert topSpans.startPosition() != NO_MORE_POSITIONS; int spanLength = topSpans.endPosition() - topSpans.startPosition(); int nextStartPos = topSpans.nextStartPosition(); if (nextStartPos == NO_MORE_POSITIONS) { return false; } totalSpanLength -= spanLength; spanLength = topSpans.endPosition() - topSpans.startPosition(); totalSpanLength += spanLength; if (topSpans.endPosition() > maxEndPosition) { maxEndPosition = topSpans.endPosition(); } updateTop(); return true; }
/** * Order the subSpans within the same document by using nextStartPosition on all subSpans * after the first as little as necessary. * Return true when the subSpans could be ordered in this way, * otherwise at least one is exhausted in the current doc. */ private boolean stretchToOrder() throws IOException { Spans prevSpans = subSpans[0]; matchStart = prevSpans.startPosition(); assert prevSpans.startPosition() != NO_MORE_POSITIONS : "prevSpans no start position "+prevSpans; assert prevSpans.endPosition() != NO_MORE_POSITIONS; matchWidth = 0; for (int i = 1; i < subSpans.length; i++) { Spans spans = subSpans[i]; assert spans.startPosition() != NO_MORE_POSITIONS; assert spans.endPosition() != NO_MORE_POSITIONS; if (advancePosition(spans, prevSpans.endPosition()) == NO_MORE_POSITIONS) { oneExhaustedInCurrentDoc = true; return false; } matchWidth += (spans.startPosition() - prevSpans.endPosition()); prevSpans = spans; } matchEnd = subSpans[subSpans.length - 1].endPosition(); return true; // all subSpans ordered and non overlapping }
void startDocument() throws IOException { clear(); totalSpanLength = 0; maxEndPosition = -1; for (Spans spans : subSpans) { assert spans.startPosition() == -1; spans.nextStartPosition(); assert spans.startPosition() != NO_MORE_POSITIONS; add(spans); if (spans.endPosition() > maxEndPosition) { maxEndPosition = spans.endPosition(); } int spanLength = spans.endPosition() - spans.startPosition(); assert spanLength >= 0; totalSpanLength += spanLength; } }
/** Check whether two Spans in the same document are ordered with possible overlap. * @return true iff spans1 starts before spans2 * or the spans start at the same position, * and spans1 ends before spans2. */ static boolean positionsOrdered(Spans spans1, Spans spans2) { assert spans1.docID() == spans2.docID() : "doc1 " + spans1.docID() + " != doc2 " + spans2.docID(); int start1 = spans1.startPosition(); int start2 = spans2.startPosition(); return (start1 == start2) ? (spans1.endPosition() < spans2.endPosition()) : (start1 < start2); }
@Override boolean twoPhaseCurrentDocMatches() throws IOException { oneExhaustedInCurrentDoc = false; assert littleSpans.startPosition() == -1; while (littleSpans.nextStartPosition() != NO_MORE_POSITIONS) { while (bigSpans.endPosition() < littleSpans.endPosition()) { if (bigSpans.nextStartPosition() == NO_MORE_POSITIONS) { oneExhaustedInCurrentDoc = true; return false; } } if (bigSpans.startPosition() <= littleSpans.startPosition()) { atFirstInCurrentDoc = true; return true; } } oneExhaustedInCurrentDoc = true; return false; }
@Override boolean twoPhaseCurrentDocMatches() throws IOException { oneExhaustedInCurrentDoc = false; assert littleSpans.startPosition() == -1; while (bigSpans.nextStartPosition() != NO_MORE_POSITIONS) { while (littleSpans.startPosition() < bigSpans.startPosition()) { if (littleSpans.nextStartPosition() == NO_MORE_POSITIONS) { oneExhaustedInCurrentDoc = true; return false; } } if (bigSpans.endPosition() >= littleSpans.endPosition()) { atFirstInCurrentDoc = true; return true; } } oneExhaustedInCurrentDoc = true; return false; }
@Override public int nextStartPosition() throws IOException { if (atFirstInCurrentDoc) { atFirstInCurrentDoc = false; return bigSpans.startPosition(); } while (bigSpans.nextStartPosition() != NO_MORE_POSITIONS) { while (littleSpans.startPosition() < bigSpans.startPosition()) { if (littleSpans.nextStartPosition() == NO_MORE_POSITIONS) { oneExhaustedInCurrentDoc = true; return NO_MORE_POSITIONS; } } if (bigSpans.endPosition() >= littleSpans.endPosition()) { return bigSpans.startPosition(); } } oneExhaustedInCurrentDoc = true; return NO_MORE_POSITIONS; } };
@Override public int nextStartPosition() throws IOException { if (atFirstInCurrentDoc) { atFirstInCurrentDoc = false; return littleSpans.startPosition(); } while (littleSpans.nextStartPosition() != NO_MORE_POSITIONS) { while (bigSpans.endPosition() < littleSpans.endPosition()) { if (bigSpans.nextStartPosition() == NO_MORE_POSITIONS) { oneExhaustedInCurrentDoc = true; return NO_MORE_POSITIONS; } } if (bigSpans.startPosition() <= littleSpans.startPosition()) { return littleSpans.startPosition(); } } oneExhaustedInCurrentDoc = true; return NO_MORE_POSITIONS; } };
assert spans.endPosition() == -1 : "incorrect initial end position, " + spans; int prevStartPos = -1; int prevEndPos = -1; do { assert startPos >= prevStartPos; int endPos = spans.endPosition(); assert endPos != Spans.NO_MORE_POSITIONS; assert spans.endPosition() == Spans.NO_MORE_POSITIONS : "incorrect final end position, " + spans;
while (excludeSpans.endPosition() <= candidate.startPosition() - pre) { if (excludeSpans.startPosition() - post >= candidate.endPosition()) { return AcceptStatus.YES; } else {
/** Check whether two Spans in the same document are ordered with possible overlap. * @return true iff spans1 starts before spans2 * or the spans start at the same position, * and spans1 ends before spans2. */ static boolean positionsOrdered(Spans spans1, Spans spans2) { assert spans1.docID() == spans2.docID() : "doc1 " + spans1.docID() + " != doc2 " + spans2.docID(); int start1 = spans1.startPosition(); int start2 = spans2.startPosition(); return (start1 == start2) ? (spans1.endPosition() < spans2.endPosition()) : (start1 < start2); }
@Override public void collectLeaf(PostingsEnum postings, int position, Term term) throws IOException { BytesRef payload = postings.getPayload(); if (payload == null) return; float payloadFactor = docScorer.computePayloadFactor(docID(), in.startPosition(), in.endPosition(), payload); payloadScore = function.currentScore(docID(), getField(), in.startPosition(), in.endPosition(), payloadsSeen, payloadScore, payloadFactor); payloadsSeen++; }
@Override public void collectLeaf(PostingsEnum postings, int position, Term term) throws IOException { BytesRef payload = postings.getPayload(); float payloadFactor = decoder.computePayloadFactor(docID(), in.startPosition(), in.endPosition(), payload); payloadScore = function.currentScore(docID(), getField(), in.startPosition(), in.endPosition(), payloadsSeen, payloadScore, payloadFactor); payloadsSeen++; }