Lines Matching refs:state
230 * The state number of the starting state
235 * The state-transition value indicating "stop"
270 * The table of state transitions used for forward iteration
275 * The table of state transitions used to sync up the iterator with the
281 * A list of flags indicating which states in the state table are accepting
287 * A list of flags indicating which states in the state table are
300 * the state tables)
847 * Changing the state of this iterator can have undefined consequences. If
853 // function is called while we're in that state, we have to fudge an
900 * vectors through here. This method initializes the state machine to state 1
902 * of the text or the state machine transitions to state 0. We update our return
903 * value every time the state machine passes through a possible end state.
916 // begin in state 1
917 int state = START_STATE;
921 // loop until we reach the end of the text or transition to state 0
922 while (c != CharacterIterator.DONE && state != STOP_STATE) {
925 // which column in the state table to look at)
928 // if the character isn't an ignore character, look up a state
929 // transition in the state table
931 state = lookupState(state, category);
934 // if the state we've just transitioned to is a lookahead state,
935 // (but not also an end state), save its position. If it's
936 // both a lookahead state and an end state, update the break position
937 // to the last saved lookup-state position
938 if (lookaheadStates[state]) {
939 if (endStates[state]) {
947 // otherwise, if the state we've just transitioned to is an accepting
948 // state, update the break position to be the current iteration position
950 if (endStates[state]) {
959 // a lookahead state, advance the break position to the lookahead position
979 int state = START_STATE;
984 // loop until we reach the beginning of the text or transition to state 0
985 while (c != CharacterIterator.DONE && state != STOP_STATE) {
993 // state transition in the backwards state table
995 state = lookupBackwardState(state, category);
1005 // that takes us into the stop state will always be the character BEFORE
1032 * Given a current state and a character category, looks up the
1033 * next state to transition to in the state table.
1035 protected int lookupState(int state, int category) {
1036 return stateTable[state * numCategories + category];
1040 * Given a current state and a character category, looks up the
1041 * next state to transition to in the backwards state table.
1043 protected int lookupBackwardState(int state, int category) {
1044 return backwardsStateTable[state * numCategories + category];