private int getState() { int state = currentFrame.state; for(int idx=0;idx<currentFrame.suffix;idx++) { state = runAutomaton.step(state, currentFrame.suffixBytes[currentFrame.startBytePos+idx] & 0xff); assert state != -1; } return state; }
/** * Returns the state obtained by reading the given char from the given state. * Returns -1 if not obtaining any such state. (If the original * <code>Automaton</code> had no dead states, -1 is returned here if and only * if a dead state is entered in an equivalent automaton with a total * transition function.) */ public final int step(int state, int c) { assert c < alphabetSize; if (c >= classmap.length) { return transitions[state * points.length + getCharClass(c)]; } else { return transitions[state * points.length + classmap[c]]; } }
for (int idx=currentFrame.startBytePos+1;idx<end;idx++) { lastState = state; state = runAutomaton.step(state, suffixBytes[idx] & 0xff); if (state == -1) { } else if (runAutomaton.isAccept(state)) { copyTerm(); assert savedStartTerm == null || term.compareTo(savedStartTerm) > 0: "saveStartTerm=" + savedStartTerm.utf8ToString() + " term=" + term.utf8ToString();
if (ite.runAutomaton.isAccept(state) == false && transitionCount != 0) {
f.fp = f.fpOrig = fr.rootBlockFP; f.prefix = 0; f.setState(runAutomaton.getInitialState()); f.arc = arc; f.outputPrefix = arc.output;
if (runAutomaton.isAccept(states[0].state)) { scratch.bytes = termBytes; scratch.offset = 0; int nextState = runAutomaton.step(states[stateUpto].state, label); if (runAutomaton.isAccept(nextState)) { nextState = runAutomaton.step(nextState, termBytes[termOffset+upto] & 0xFF); if (nextState == -1) { termOrd++; if (runAutomaton.isAccept(nextState)) { scratch.bytes = termBytes; scratch.offset = termOffsets[termOrd];
if (!ite.runAutomaton.isAccept(state)) {
f.fp = f.fpOrig = fr.rootBlockFP; f.prefix = 0; f.setState(runAutomaton.getInitialState()); f.arc = arc; f.outputPrefix = arc.output;
private int getState() { int state = currentFrame.state; for(int idx=0;idx<currentFrame.suffix;idx++) { state = runAutomaton.step(state, currentFrame.suffixBytes[currentFrame.startBytePos+idx] & 0xff); assert state != -1; } return state; }
if (!ite.runAutomaton.isAccept(state)) {
/** * Returns the state obtained by reading the given char from the given state. * Returns -1 if not obtaining any such state. (If the original * <code>Automaton</code> had no dead states, -1 is returned here if and only * if a dead state is entered in an equivalent automaton with a total * transition function.) */ public final int step(int state, int c) { if (classmap == null) { return transitions[state * points.length + getCharClass(c)]; } else { return transitions[state * points.length + classmap[c]]; } }
f.fp = f.fpOrig = fr.rootBlockFP; f.prefix = 0; f.setState(runAutomaton.getInitialState()); f.arc = arc; f.outputPrefix = arc.output;
private int getState() { int state = currentFrame.state; for(int idx=0;idx<currentFrame.suffix;idx++) { state = runAutomaton.step(state, currentFrame.suffixBytes[currentFrame.startBytePos+idx] & 0xff); assert state != -1; } return state; }
if (ite.runAutomaton.isAccept(state) == false && transitionCount != 0) {
/** * Returns the state obtained by reading the given char from the given state. * Returns -1 if not obtaining any such state. (If the original * <code>Automaton</code> had no dead states, -1 is returned here if and only * if a dead state is entered in an equivalent automaton with a total * transition function.) */ public final int step(int state, int c) { if (classmap == null) { return transitions[state * points.length + getCharClass(c)]; } else { return transitions[state * points.length + classmap[c]]; } }
private int getState() { int state = currentFrame.state; for(int idx=0;idx<currentFrame.suffix;idx++) { state = runAutomaton.step(state, currentFrame.suffixBytes[currentFrame.startBytePos+idx] & 0xff); assert state != -1; } return state; }
if (ite.runAutomaton.isAccept(state) == false && transitionCount != 0) {