linear = false; for (state = savedStates.intAt(pos); pos < seekBytesRef.length(); pos++) { visited[state] = curGen; int nextState = runAutomaton.step(state, seekBytesRef.byteAt(pos) & 0xff); if ((pos = backtrack(pos)) < 0) /* no more solutions at all */ return false; final int newState = runAutomaton.step(savedStates.intAt(pos), seekBytesRef.byteAt(pos) & 0xff); if (newState >= 0 && runAutomaton.isAccept(newState))
frontier[pos1].inputCount++; if (pos1 >= pos1Stop || lastInput.intAt(pos1) != input.ints[pos2]) { break;
@Override public TermPosition next() { termPosition.position = positions.intAt(pos); termPosition.startOffset = startOffsets.intAt(pos); termPosition.endOffset = endOffsets.intAt(pos); termPosition.payload = payload; payload.bytes = payloads.bytes(); payload.offset = payloadsStarts.intAt(pos); payload.length = payloadsLengths.intAt(pos); pos++; return termPosition; }
@Override public TermPosition next() { termPosition.position = positions.intAt(pos); termPosition.startOffset = startOffsets.intAt(pos); termPosition.endOffset = endOffsets.intAt(pos); termPosition.payload = payload; payload.bytes = payloads.bytes(); payload.offset = payloadsStarts.intAt(pos); payload.length = payloadsLengths.intAt(pos); pos++; return termPosition; }
private void addPayload(int i, BytesRef currPayload) { if (currPayload != null) { payloadsLengths.setIntAt(i, currPayload.length); payloadsStarts.setIntAt(i, i == 0 ? 0 : payloadsStarts.intAt(i - 1) + payloadsLengths.intAt(i - 1)); payloads.grow(payloadsStarts.intAt(i) + currPayload.length); System.arraycopy(currPayload.bytes, currPayload.offset, payloads.bytes(), payloadsStarts.intAt(i), currPayload.length); } else { payloadsLengths.setIntAt(i, 0); payloadsStarts.setIntAt(i, i == 0 ? 0 : payloadsStarts.intAt(i - 1) + payloadsLengths.intAt(i - 1)); } }
private void addPayload(int i, BytesRef currPayload) { if (currPayload != null) { payloadsLengths.setIntAt(i, currPayload.length); payloadsStarts.setIntAt(i, i == 0 ? 0 : payloadsStarts.intAt(i - 1) + payloadsLengths.intAt(i - 1)); payloads.grow(payloadsStarts.intAt(i) + currPayload.length); System.arraycopy(currPayload.bytes, currPayload.offset, payloads.bytes(), payloadsStarts.intAt(i), currPayload.length); } else { payloadsLengths.setIntAt(i, 0); payloadsStarts.setIntAt(i, i == 0 ? 0 : payloadsStarts.intAt(i - 1) + payloadsLengths.intAt(i - 1)); } }
linear = false; for (state = savedStates.intAt(pos); pos < seekBytesRef.length(); pos++) { visited[state] = curGen; int nextState = runAutomaton.step(state, seekBytesRef.byteAt(pos) & 0xff); if ((pos = backtrack(pos)) < 0) /* no more solutions at all */ return false; final int newState = runAutomaton.step(savedStates.intAt(pos), seekBytesRef.byteAt(pos) & 0xff); if (newState >= 0 && runAutomaton.isAccept(newState))
linear = false; for (state = savedStates.intAt(pos); pos < seekBytesRef.length(); pos++) { visited[state] = curGen; int nextState = runAutomaton.step(state, seekBytesRef.byteAt(pos) & 0xff); if ((pos = backtrack(pos)) < 0) /* no more solutions at all */ return false; final int newState = runAutomaton.step(savedStates.intAt(pos), seekBytesRef.byteAt(pos) & 0xff); if (newState >= 0 && runAutomaton.isAccept(newState))
linear = false; for (state = savedStates.intAt(pos); pos < seekBytesRef.length(); pos++) { visited[state] = curGen; int nextState = runAutomaton.step(state, seekBytesRef.byteAt(pos) & 0xff); if ((pos = backtrack(pos)) < 0) /* no more solutions at all */ return false; final int newState = runAutomaton.step(savedStates.intAt(pos), seekBytesRef.byteAt(pos) & 0xff); if (newState >= 0 && runAutomaton.isAccept(newState))
frontier[pos1].inputCount++; if (pos1 >= pos1Stop || lastInput.intAt(pos1) != input.ints[pos2]) { break;
frontier[pos1].inputCount++; if (pos1 >= pos1Stop || lastInput.intAt(pos1) != input.ints[pos2]) { break;
frontier[pos1].inputCount++; if (pos1 >= pos1Stop || lastInput.intAt(pos1) != input.ints[pos2]) { break;