Searched refs:fLookAhead (Results 1 – 8 of 8) sorted by relevance
43 int fLookAhead; field in RBBITableBuilder.RBBIStateDescriptor664 sd.fLookAhead = sd.fAccepting; in flagAcceptingStates()690 sd.fLookAhead = lookAheadNode.fVal; in flagLookAheadStates()904 firstSD.fLookAhead != duplSD.fLookAhead ||994 if (sd.fLookAhead == duplState) {995 sd.fLookAhead = keepState;996 } else if (sd.fLookAhead > duplState) {997 sd.fLookAhead--;1109 Assert.assrt (-32768 < sd.fLookAhead && sd.fLookAhead <= 32767);1111 table.fTable[row + RBBIDataWrapper.LOOKAHEAD] = (short)sd.fLookAhead;[all …]
44 int fLookAhead; field in RBBITableBuilder.RBBIStateDescriptor665 sd.fLookAhead = sd.fAccepting; in flagAcceptingStates()691 sd.fLookAhead = lookAheadNode.fVal; in flagLookAheadStates()905 firstSD.fLookAhead != duplSD.fLookAhead ||995 if (sd.fLookAhead == duplState) {996 sd.fLookAhead = keepState;997 } else if (sd.fLookAhead > duplState) {998 sd.fLookAhead--;1110 Assert.assrt (-32768 < sd.fLookAhead && sd.fLookAhead <= 32767);1112 table.fTable[row + RBBIDataWrapper.LOOKAHEAD] = (short)sd.fLookAhead;[all …]
767 sd->fLookAhead = sd->fAccepting; in flagAcceptingStates()799 sd->fLookAhead = lookAheadNode->fVal; in flagLookAheadStates()1131 firstSD->fLookAhead != duplSD->fLookAhead || in findDuplicateState()1212 if (sd->fLookAhead == duplState) { in removeState()1213 sd->fLookAhead = keepState; in removeState()1214 } else if (sd->fLookAhead > duplState) { in removeState()1215 sd->fLookAhead--; in removeState()1327 U_ASSERT (-32768 < sd->fLookAhead && sd->fLookAhead <= 32767); in exportTable()1329 row->fLookAhead = (int16_t)sd->fLookAhead; in exportTable()1506 row->fLookAhead = 0; in exportSafeTable()[all …]
105 int16_t fLookAhead; /* Non-zero if this row is for a state that */ member
190 int32_t fLookAhead; variable
242 RBBIDebugPrintf("%4d | %3d %3d %3d ", s, row->fAccepting, row->fLookAhead, row->fTagIdx); in printTable()
892 int16_t rule = row->fLookAhead; in handleNext()
4455 s.append(row->fLookAhead); in TestTableRedundancies()