bugged
stringlengths 6
599k
| fixed
stringlengths 6
40.8M
| __index_level_0__
int64 0
3.24M
|
|---|---|---|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(19, 21); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 58: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(19, 21); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(19, 21); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 58: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(19, 21); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(19, 21); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 58: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(19, 21); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(19, 21); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 58: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(19, 21); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(19, 21); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 58: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(19, 21); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(19, 21); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 58: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(19, 21); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(19, 21); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 58: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(19, 21); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,485
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(19, 21); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(19, 21); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(19, 21); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(19, 21); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(19, 21); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(19, 21); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(19, 21); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,486
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(22, 24); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(22, 24); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(22, 24); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,487
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(25, 28); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(25, 28); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(25, 28); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,488
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,489
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,490
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,491
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,492
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,493
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,494
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,495
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAdd(44); break; case 45: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(45, 46); break; case 47: jjAddStates(51, 52); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAdd(44); break; case 45: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(45, 46); break; case 47: jjAddStates(51, 52); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,496
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,497
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,498
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(47, 50); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(47, 50); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,499
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 36) kind = 36; break; case 59: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 36) kind = 36; break; case 59: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 36) kind = 36; break; case 59: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,500
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,501
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(19, 21); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(19, 21); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(19, 21); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(19, 21); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(19, 21); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(19, 21); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(19, 21); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,502
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(22, 24); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(22, 24); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(22, 24); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,503
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,504
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(51, 52); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(51, 52); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,505
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
|
private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 58 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}
| 3,236,506
|
private final int jjMoveStringLiteralDfa0_0(){ switch(curChar) { case 42: jjmatchedKind = 11; return jjMoveStringLiteralDfa1_0(0x40000000L); case 45: return jjMoveStringLiteralDfa1_0(0x100000L); case 60: return jjStopAtPos(0, 14); case 62: return jjStopAtPos(0, 15); case 91: return jjMoveStringLiteralDfa1_0(0x200000000L); case 94: jjmatchedKind = 19; return jjMoveStringLiteralDfa1_0(0x100000000L); case 95: jjmatchedKind = 12; return jjMoveStringLiteralDfa1_0(0x80000000L); case 126: return jjStopAtPos(0, 13); default : return jjMoveNfa_0(7, 0); }}
|
private final int jjMoveStringLiteralDfa0_0(){ switch(curChar) { case 42: jjmatchedKind = 11; return jjMoveStringLiteralDfa1_0(0x100000000L); case 45: return jjMoveStringLiteralDfa1_0(0x100000L); case 60: return jjStopAtPos(0, 14); case 62: return jjStopAtPos(0, 15); case 91: return jjMoveStringLiteralDfa1_0(0x200000000L); case 94: jjmatchedKind = 19; return jjMoveStringLiteralDfa1_0(0x100000000L); case 95: jjmatchedKind = 12; return jjMoveStringLiteralDfa1_0(0x80000000L); case 126: return jjStopAtPos(0, 13); default : return jjMoveNfa_0(7, 0); }}
| 3,236,507
|
private final int jjMoveStringLiteralDfa0_0(){ switch(curChar) { case 42: jjmatchedKind = 11; return jjMoveStringLiteralDfa1_0(0x40000000L); case 45: return jjMoveStringLiteralDfa1_0(0x100000L); case 60: return jjStopAtPos(0, 14); case 62: return jjStopAtPos(0, 15); case 91: return jjMoveStringLiteralDfa1_0(0x200000000L); case 94: jjmatchedKind = 19; return jjMoveStringLiteralDfa1_0(0x100000000L); case 95: jjmatchedKind = 12; return jjMoveStringLiteralDfa1_0(0x80000000L); case 126: return jjStopAtPos(0, 13); default : return jjMoveNfa_0(7, 0); }}
|
private final int jjMoveStringLiteralDfa0_0(){ switch(curChar) { case 42: jjmatchedKind = 11; return jjMoveStringLiteralDfa1_0(0x40000000L); case 45: return jjMoveStringLiteralDfa1_0(0x200000L); case 60: return jjStopAtPos(0, 14); case 62: return jjStopAtPos(0, 15); case 91: return jjMoveStringLiteralDfa1_0(0x200000000L); case 94: jjmatchedKind = 19; return jjMoveStringLiteralDfa1_0(0x100000000L); case 95: jjmatchedKind = 12; return jjMoveStringLiteralDfa1_0(0x80000000L); case 126: return jjStopAtPos(0, 13); default : return jjMoveNfa_0(7, 0); }}
| 3,236,508
|
private final int jjMoveStringLiteralDfa0_0(){ switch(curChar) { case 42: jjmatchedKind = 11; return jjMoveStringLiteralDfa1_0(0x40000000L); case 45: return jjMoveStringLiteralDfa1_0(0x100000L); case 60: return jjStopAtPos(0, 14); case 62: return jjStopAtPos(0, 15); case 91: return jjMoveStringLiteralDfa1_0(0x200000000L); case 94: jjmatchedKind = 19; return jjMoveStringLiteralDfa1_0(0x100000000L); case 95: jjmatchedKind = 12; return jjMoveStringLiteralDfa1_0(0x80000000L); case 126: return jjStopAtPos(0, 13); default : return jjMoveNfa_0(7, 0); }}
|
private final int jjMoveStringLiteralDfa0_0(){ switch(curChar) { case 42: jjmatchedKind = 11; return jjMoveStringLiteralDfa1_0(0x40000000L); case 45: return jjMoveStringLiteralDfa1_0(0x100000L); case 60: return jjStopAtPos(0, 14); case 62: return jjStopAtPos(0, 15); case 91: return jjMoveStringLiteralDfa1_0(0x800000000L); case 94: jjmatchedKind = 19; return jjMoveStringLiteralDfa1_0(0x100000000L); case 95: jjmatchedKind = 12; return jjMoveStringLiteralDfa1_0(0x80000000L); case 126: return jjStopAtPos(0, 13); default : return jjMoveNfa_0(7, 0); }}
| 3,236,509
|
private final int jjMoveStringLiteralDfa0_0(){ switch(curChar) { case 42: jjmatchedKind = 11; return jjMoveStringLiteralDfa1_0(0x40000000L); case 45: return jjMoveStringLiteralDfa1_0(0x100000L); case 60: return jjStopAtPos(0, 14); case 62: return jjStopAtPos(0, 15); case 91: return jjMoveStringLiteralDfa1_0(0x200000000L); case 94: jjmatchedKind = 19; return jjMoveStringLiteralDfa1_0(0x100000000L); case 95: jjmatchedKind = 12; return jjMoveStringLiteralDfa1_0(0x80000000L); case 126: return jjStopAtPos(0, 13); default : return jjMoveNfa_0(7, 0); }}
|
private final int jjMoveStringLiteralDfa0_0(){ switch(curChar) { case 42: jjmatchedKind = 11; return jjMoveStringLiteralDfa1_0(0x40000000L); case 45: return jjMoveStringLiteralDfa1_0(0x100000L); case 60: return jjStopAtPos(0, 14); case 62: return jjStopAtPos(0, 15); case 91: return jjMoveStringLiteralDfa1_0(0x200000000L); case 94: jjmatchedKind = 19; return jjMoveStringLiteralDfa1_0(0x100000000L); case 95: jjmatchedKind = 12; return jjMoveStringLiteralDfa1_0(0x80000000L); case 126: return jjStopAtPos(0, 13); default : return jjMoveNfa_0(7, 0); }}
| 3,236,510
|
private final int jjMoveStringLiteralDfa0_0(){ switch(curChar) { case 42: jjmatchedKind = 11; return jjMoveStringLiteralDfa1_0(0x40000000L); case 45: return jjMoveStringLiteralDfa1_0(0x100000L); case 60: return jjStopAtPos(0, 14); case 62: return jjStopAtPos(0, 15); case 91: return jjMoveStringLiteralDfa1_0(0x200000000L); case 94: jjmatchedKind = 19; return jjMoveStringLiteralDfa1_0(0x100000000L); case 95: jjmatchedKind = 12; return jjMoveStringLiteralDfa1_0(0x80000000L); case 126: return jjStopAtPos(0, 13); default : return jjMoveNfa_0(7, 0); }}
|
private final int jjMoveStringLiteralDfa0_0(){ switch(curChar) { case 42: jjmatchedKind = 11; return jjMoveStringLiteralDfa1_0(0x40000000L); case 45: return jjMoveStringLiteralDfa1_0(0x100000L); case 60: return jjStopAtPos(0, 14); case 62: return jjStopAtPos(0, 15); case 91: return jjMoveStringLiteralDfa1_0(0x200000000L); case 94: jjmatchedKind = 19; return jjMoveStringLiteralDfa1_0(0x100000000L); case 95: jjmatchedKind = 12; return jjMoveStringLiteralDfa1_0(0x80000000L); case 126: return jjStopAtPos(0, 13); default : return jjMoveNfa_0(7, 0); }}
| 3,236,511
|
private final int jjMoveStringLiteralDfa1_0(long active0){ try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(0, active0); return 1; } switch(curChar) { case 42: if ((active0 & 0x40000000L) != 0L) return jjStopAtPos(1, 30); break; case 45: return jjMoveStringLiteralDfa2_0(active0, 0x100000L); case 91: return jjMoveStringLiteralDfa2_0(active0, 0x200000000L); case 94: if ((active0 & 0x100000000L) != 0L) return jjStopAtPos(1, 32); break; case 95: if ((active0 & 0x80000000L) != 0L) return jjStartNfaWithStates_0(1, 31, 14); break; default : break; } return jjStartNfa_0(0, active0);}
|
private final int jjMoveStringLiteralDfa1_0(long active0){ try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(0, active0); return 1; } switch(curChar) { case 42: if ((active0 & 0x40000000L) != 0L) return jjStopAtPos(1, 30); break; case 45: return jjMoveStringLiteralDfa2_0(active0, 0x100000L); case 91: return jjMoveStringLiteralDfa2_0(active0, 0x200000000L); case 94: if ((active0 & 0x100000000L) != 0L) return jjStopAtPos(1, 32); break; case 95: if ((active0 & 0x80000000L) != 0L) return jjStartNfaWithStates_0(1, 31, 14); break; default : break; } return jjStartNfa_0(0, active0);}
| 3,236,512
|
private final int jjMoveStringLiteralDfa1_0(long active0){ try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(0, active0); return 1; } switch(curChar) { case 42: if ((active0 & 0x40000000L) != 0L) return jjStopAtPos(1, 30); break; case 45: return jjMoveStringLiteralDfa2_0(active0, 0x100000L); case 91: return jjMoveStringLiteralDfa2_0(active0, 0x200000000L); case 94: if ((active0 & 0x100000000L) != 0L) return jjStopAtPos(1, 32); break; case 95: if ((active0 & 0x80000000L) != 0L) return jjStartNfaWithStates_0(1, 31, 14); break; default : break; } return jjStartNfa_0(0, active0);}
|
private final int jjMoveStringLiteralDfa1_0(long active0){ try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(0, active0); return 1; } switch(curChar) { case 42: if ((active0 & 0x40000000L) != 0L) return jjStopAtPos(1, 30); break; case 45: return jjMoveStringLiteralDfa2_0(active0, 0x100000L); case 91: return jjMoveStringLiteralDfa2_0(active0, 0x200000000L); case 94: if ((active0 & 0x100000000L) != 0L) return jjStopAtPos(1, 32); break; case 95: if ((active0 & 0x80000000L) != 0L) return jjStopAtPos(1, 31); break; default : break; } return jjStartNfa_0(0, active0);}
| 3,236,513
|
private final int jjMoveStringLiteralDfa2_0(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_0(0, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(1, active0); return 2; } switch(curChar) { case 45: return jjMoveStringLiteralDfa3_0(active0, 0x100000L); case 91: return jjMoveStringLiteralDfa3_0(active0, 0x200000000L); default : break; } return jjStartNfa_0(1, active0);}
|
private final int jjMoveStringLiteralDfa2_0(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_0(0, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(1, active0); return 2; } switch(curChar) { case 45: return jjMoveStringLiteralDfa3_0(active0, 0x200000L); case 91: return jjMoveStringLiteralDfa3_0(active0, 0x200000000L); default : break; } return jjStartNfa_0(1, active0);}
| 3,236,514
|
private final int jjMoveStringLiteralDfa2_0(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_0(0, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(1, active0); return 2; } switch(curChar) { case 45: return jjMoveStringLiteralDfa3_0(active0, 0x100000L); case 91: return jjMoveStringLiteralDfa3_0(active0, 0x200000000L); default : break; } return jjStartNfa_0(1, active0);}
|
private final int jjMoveStringLiteralDfa2_0(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_0(0, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(1, active0); return 2; } switch(curChar) { case 45: return jjMoveStringLiteralDfa3_0(active0, 0x100000L); case 91: return jjMoveStringLiteralDfa3_0(active0, 0x800000000L); default : break; } return jjStartNfa_0(1, active0);}
| 3,236,515
|
private final int jjMoveStringLiteralDfa3_0(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_0(1, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(2, active0); return 3; } switch(curChar) { case 45: return jjMoveStringLiteralDfa4_0(active0, 0x100000L); case 91: if ((active0 & 0x200000000L) != 0L) return jjStartNfaWithStates_0(3, 33, 54); break; default : break; } return jjStartNfa_0(2, active0);}
|
private final int jjMoveStringLiteralDfa3_0(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_0(1, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(2, active0); return 3; } switch(curChar) { case 45: return jjMoveStringLiteralDfa4_0(active0, 0x200000L); case 91: if ((active0 & 0x200000000L) != 0L) return jjStartNfaWithStates_0(3, 33, 54); break; default : break; } return jjStartNfa_0(2, active0);}
| 3,236,516
|
private final int jjMoveStringLiteralDfa3_0(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_0(1, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(2, active0); return 3; } switch(curChar) { case 45: return jjMoveStringLiteralDfa4_0(active0, 0x100000L); case 91: if ((active0 & 0x200000000L) != 0L) return jjStartNfaWithStates_0(3, 33, 54); break; default : break; } return jjStartNfa_0(2, active0);}
|
private final int jjMoveStringLiteralDfa3_0(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_0(1, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(2, active0); return 3; } switch(curChar) { case 45: return jjMoveStringLiteralDfa4_0(active0, 0x100000L); case 91: if ((active0 & 0x200000000L) != 0L) return jjStartNfaWithStates_0(3, 33, 54); break; default : break; } return jjStartNfa_0(2, active0);}
| 3,236,517
|
private final int jjMoveStringLiteralDfa4_0(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_0(2, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(3, active0); return 4; } switch(curChar) { case 45: if ((active0 & 0x100000L) != 0L) return jjStartNfaWithStates_0(4, 20, 14); break; default : break; } return jjStartNfa_0(3, active0);}
|
private final int jjMoveStringLiteralDfa4_0(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_0(2, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(3, active0); return 4; } switch(curChar) { case 45: if ((active0 & 0x100000L) != 0L) return jjStartNfaWithStates_0(4, 20, 14); break; default : break; } return jjStartNfa_0(3, active0);}
| 3,236,518
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x800000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x800000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x800000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x800000000L) != 0L) return 54; return -1; default : return -1; }}
| 3,236,519
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 36; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 36; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
| 3,236,520
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x400100000L) != 0L) return 10; if ((active0 & 0x200000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x400100000L) != 0L) return 10; if ((active0 & 0x200000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x400100000L) != 0L) return 10; if ((active0 & 0x200000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x400100000L) != 0L) return 10; if ((active0 & 0x200000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
| 3,236,521
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 36; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 36; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
| 3,236,522
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
| 3,236,523
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x800000000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x800000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x800000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x800000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
| 3,236,524
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 36; jjmatchedPos = 0; } return 58; } if ((active0 & 0x200000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 36; jjmatchedPos = 0; } return 58; } if ((active0 & 0x200000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 58; } if ((active0 & 0x200000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 58; } if ((active0 & 0x200000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 58; } if ((active0 & 0x200000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 58; } if ((active0 & 0x200000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 58; } if ((active0 & 0x200000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
| 3,236,525
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 36; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 36; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
| 3,236,526
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 59; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
| 3,236,527
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
| 3,236,528
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
| 3,236,529
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x800000000L) != 0L) return 59; if ((active0 & 0x200000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x800000000L) != 0L) return 59; if ((active0 & 0x200000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x800000000L) != 0L) return 59; if ((active0 & 0x200000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x800000000L) != 0L) return 59; if ((active0 & 0x200000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
| 3,236,530
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 36; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 36; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
| 3,236,531
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
|
private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}
| 3,236,532
|
public static RubyObject backquote(Ruby ruby, RubyObject recv, RubyString aString) { // XXX use other methods try { Process aProcess = Runtime.getRuntime().exec(new String[] { System.getProperty("jruby.shell"), "-c", aString.toString()}); final BufferedInputStream bin = new BufferedInputStream(aProcess.getInputStream()); final StringBuffer sb = new StringBuffer(); new Thread(new Runnable() { /** * @see Runnable#run() */ public void run() { try { synchronized (sb) { int next = bin.read(); while (next != -1) { sb.append((char) next); next = bin.read(); } } } catch (IOException ioExcptn) { } } }).start(); aProcess.waitFor(); synchronized (sb) { return RubyString.newString(ruby, sb.toString()); } } catch (Exception excptn) { excptn.printStackTrace(); return RubyString.newString(ruby, ""); } }
|
public static RubyObject backquote(Ruby ruby, RubyObject recv, RubyString aString) { // XXX use other methods try { String lShellProp = System.getProperty("jruby.shell"); Process aProcess; if (lShellProp != null) aProcess = Runtime.getRuntime().exec(new String[] { System.getProperty("jruby.shell"), "-c", aString.toString()}); else aProcess = Runtime.getRuntime().exec(aString.toString()); final BufferedInputStream bin = new BufferedInputStream(aProcess.getInputStream()); final StringBuffer sb = new StringBuffer(); new Thread(new Runnable() { /** * @see Runnable#run() */ public void run() { try { synchronized (sb) { int next = bin.read(); while (next != -1) { sb.append((char) next); next = bin.read(); } } } catch (IOException ioExcptn) { } } }).start(); aProcess.waitFor(); synchronized (sb) { return RubyString.newString(ruby, sb.toString()); } } catch (Exception excptn) { excptn.printStackTrace(); return RubyString.newString(ruby, ""); } }
| 3,236,534
|
public static RubyObject backquote(Ruby ruby, RubyObject recv, RubyString aString) { // XXX use other methods try { Process aProcess = Runtime.getRuntime().exec(new String[] { System.getProperty("jruby.shell"), "-c", aString.toString()}); final BufferedInputStream bin = new BufferedInputStream(aProcess.getInputStream()); final StringBuffer sb = new StringBuffer(); new Thread(new Runnable() { /** * @see Runnable#run() */ public void run() { try { synchronized (sb) { int next = bin.read(); while (next != -1) { sb.append((char) next); next = bin.read(); } } } catch (IOException ioExcptn) { } } }).start(); aProcess.waitFor(); synchronized (sb) { return RubyString.newString(ruby, sb.toString()); } } catch (Exception excptn) { excptn.printStackTrace(); return RubyString.newString(ruby, ""); } }
|
public static RubyObject backquote(Ruby ruby, RubyObject recv, RubyString aString) { // XXX use other methods try { Process aProcess = Runtime.getRuntime().exec(new String[] { System.getProperty("jruby.shell"), "-c", aString.toString()}); final StringBuffer sb = new StringBuffer(); new Thread(new Runnable() { /** * @see Runnable#run() */ public void run() { try { synchronized (sb) { int next = bin.read(); while (next != -1) { sb.append((char) next); next = bin.read(); } } } catch (IOException ioExcptn) { } } }).start(); aProcess.waitFor(); synchronized (sb) { return RubyString.newString(ruby, sb.toString()); } } catch (Exception excptn) { excptn.printStackTrace(); return RubyString.newString(ruby, ""); } }
| 3,236,535
|
public RubyString ftype() { if (!file.exists()) { throw getRuntime().newErrnoENOENTError("No such file or directory: " + file.toString()); } else if (file.isDirectory()) { return getRuntime().newString("directory"); } else if (file.isDirectory()) { return getRuntime().newString("file"); } else { // possible? assert false: "Not a directory and not a file: " + file; return null; } }
|
public RubyString ftype() { if (!file.exists()) { throw getRuntime().newErrnoENOENTError("No such file or directory: " + file.toString()); } else if (file.isFile()) { return getRuntime().newString("directory"); } else if (file.isFile()) { return getRuntime().newString("file"); } else { // possible? assert false: "Not a directory and not a file: " + file; return null; } }
| 3,236,539
|
public Map findAnnotations( Class rootNodeType, Set rootNodeIds, Set annotatorIds, Map options) { if (rootNodeIds.size()==0) return new HashMap(); PojoOptions po = new PojoOptions(options); Query<List<IObject>> q = getQueryFactory().lookup( PojosFindAnnotationsQueryDefinition.class.getName(), new Parameters() .addIds(rootNodeIds) .addClass(rootNodeType) .addSet("annotatorIds",annotatorIds) .addOptions(po.map())); List<IObject> l = iQuery.execute(q); // no count collection // // Destructive changes below this point. // for (Object object : l) { iQuery.evict(object); } // TODO these here or in Query Definition? // Does it belong to API or to query? if (Dataset.class.equals(rootNodeType)){ return AnnotationTransformations.sortDatasetAnnotatiosn( new HashSet<IObject>(l)); } else if (Image.class.equals(rootNodeType)){ return AnnotationTransformations.sortImageAnnotatiosn( new HashSet<IObject>(l)); } else { throw new IllegalArgumentException( "Class parameter for findAnnotation() must be in " + "{Dataset,Image}, not "+ rootNodeType); } }
|
public Map findAnnotations( Class rootNodeType, Set rootNodeIds, Set annotatorIds, Map options) { if (rootNodeIds.size()==0) return new HashMap(); PojoOptions po = new PojoOptions(options); Query<List<IObject>> q = getQueryFactory().lookup( PojosFindAnnotationsQueryDefinition.class.getName(), new Parameters() .addIds(rootNodeIds) .addClass(rootNodeType) .addSet("annotatorIds",annotatorIds) .addOptions(po.map())); List<IObject> l = iQuery.execute(q); // no count collection // // Destructive changes below this point. // for (Object object : l) { iQuery.evict(object); } // TODO these here or in Query Definition? // Does it belong to API or to query? if (Dataset.class.equals(rootNodeType)){ return AnnotationTransformations.sortDatasetAnnotatiosn( new HashSet<IObject>(l)); } else if (Image.class.equals(rootNodeType)){ return AnnotationTransformations.sortImageAnnotatiosn( new HashSet<IObject>(l)); } else { throw new IllegalArgumentException( "Class parameter for findAnnotation() must be in " + "{Dataset,Image}, not "+ rootNodeType); } }
| 3,236,541
|
private void onClick(MouseEvent me, boolean released) { Point p = me.getPoint(); int row = treeDisplay.getRowForLocation(p.x, p.y); if (row != -1) { //treeDisplay.setSelectionRow(row); model.setClickPoint(p); if (me.getClickCount() == 1) { if (me.isPopupTrigger()) controller.showPopupMenu(); if (!released) controller.onClick(); } else if (me.getClickCount() == 2) { model.viewDataObject(); } } }
|
private void onClick(MouseEvent me, boolean released) { Point p = me.getPoint(); int row = treeDisplay.getRowForLocation(p.x, p.y); if (row != -1) { //treeDisplay.setSelectionRow(row); model.setClickPoint(p); if (me.getClickCount() == 1) { if (me.isPopupTrigger()) controller.showPopupMenu(); if (!released) controller.onClick(); } else if (me.getClickCount() == 2 && released) { model.viewDataObject(); } } }
| 3,236,542
|
public static Criteria buildProjectsTreeCriteria(List projectIDs) { Criteria c = buildBasicCriteria(); //Specify which fields we want for the datasets. c.addWantedField("datasets", "images"); //Specify which fields we want for the images. c.addWantedField("datasets.images", "name"); c.addWantedField("datasets.images", "created"); c.addWantedField("datasets.images", "default_pixels"); //Specify which fields we want for the pixels. c.addWantedField("datasets.images.default_pixels", "ImageServerID"); c.addWantedField("datasets.images.default_pixels", "Repository"); c.addWantedField("datasets.images.default_pixels.Repository", "ImageServerURL"); if (projectIDs != null) c.addFilter("id", "IN", projectIDs); return c; }
|
public static Criteria buildProjectsTreeCriteria(List projectIDs) { Criteria c = buildBasicCriteria(); //Specify which fields we want for the datasets. c.addWantedField("datasets", "images"); //Specify which fields we want for the images. c.addWantedField("datasets.images", "name"); c.addWantedField("datasets.images", "created"); c.addWantedField("datasets.images", "default_pixels"); //Specify which fields we want for the pixels. c.addWantedField("datasets.images.default_pixels", "ImageServerID"); c.addWantedField("datasets.images.default_pixels", "Repository"); c.addWantedField("datasets.images.default_pixels.Repository", "ImageServerURL"); if (projectIDs != null) c.addFilter("id", "IN", projectIDs); return c; }
| 3,236,543
|
public static void fillProjectsTree(List projects, List results, List projectIDs) { Iterator i = projects.iterator(), j, k; Map datasetsMap = new HashMap(), imagesMap = new HashMap(); Project p; List datasets, images; ProjectSummary ps; Dataset d; DatasetSummaryLinked ds; ImageSummary is; Image img; Integer id, idImg; while (i.hasNext()) { p = (Project) i.next(); if (projectIDs.contains(new Integer(p.getID()))) { ps = new ProjectSummary(p.getID(), p.getName()); datasets = new ArrayList(); j = p.getDatasets().iterator(); while (j.hasNext()) { d = (Dataset) j.next(); id = new Integer(d.getID()); ds = (DatasetSummaryLinked) datasetsMap.get(id); if (ds == null) { //Make a new DataObject and fill it up. ds = new DatasetSummaryLinked(); ds.setID(d.getID()); ds.setName(d.getName()); datasetsMap.put(id, ds); } //object already created this object. //Add the dataset to this project's list. datasets.add(ds); //Add images to the dataset images = new ArrayList(); k = d.getImages().iterator(); while (k.hasNext()) { img = (Image) k.next(); idImg = new Integer(img.getID()); is = (ImageSummary) imagesMap.get(idImg); if (is == null) { is = DatasetMapper.fillImageSummary(img); imagesMap.put(idImg, is); } images.add(is); } ds.setImages(images); } //Link the datasets to this project. ps.setDatasets(datasets); results.add(ps); } } }
|
public static void fillProjectsTree(List projects, List results, List projectIDs, List dsAnnotations, List isAnnotations) { Iterator i = projects.iterator(), j, k; Map datasetsMap = new HashMap(), imagesMap = new HashMap(); Project p; List datasets, images; ProjectSummary ps; Dataset d; DatasetSummaryLinked ds; ImageSummary is; Image img; Integer id, idImg; while (i.hasNext()) { p = (Project) i.next(); if (projectIDs.contains(new Integer(p.getID()))) { ps = new ProjectSummary(p.getID(), p.getName()); datasets = new ArrayList(); j = p.getDatasets().iterator(); while (j.hasNext()) { d = (Dataset) j.next(); id = new Integer(d.getID()); ds = (DatasetSummaryLinked) datasetsMap.get(id); if (ds == null) { //Make a new DataObject and fill it up. ds = new DatasetSummaryLinked(); ds.setID(d.getID()); ds.setName(d.getName()); datasetsMap.put(id, ds); } //object already created this object. //Add the dataset to this project's list. datasets.add(ds); //Add images to the dataset images = new ArrayList(); k = d.getImages().iterator(); while (k.hasNext()) { img = (Image) k.next(); idImg = new Integer(img.getID()); is = (ImageSummary) imagesMap.get(idImg); if (is == null) { is = DatasetMapper.fillImageSummary(img); imagesMap.put(idImg, is); } images.add(is); } ds.setImages(images); } //Link the datasets to this project. ps.setDatasets(datasets); results.add(ps); } } }
| 3,236,544
|
public static void fillProjectsTree(List projects, List results, List projectIDs) { Iterator i = projects.iterator(), j, k; Map datasetsMap = new HashMap(), imagesMap = new HashMap(); Project p; List datasets, images; ProjectSummary ps; Dataset d; DatasetSummaryLinked ds; ImageSummary is; Image img; Integer id, idImg; while (i.hasNext()) { p = (Project) i.next(); if (projectIDs.contains(new Integer(p.getID()))) { ps = new ProjectSummary(p.getID(), p.getName()); datasets = new ArrayList(); j = p.getDatasets().iterator(); while (j.hasNext()) { d = (Dataset) j.next(); id = new Integer(d.getID()); ds = (DatasetSummaryLinked) datasetsMap.get(id); if (ds == null) { //Make a new DataObject and fill it up. ds = new DatasetSummaryLinked(); ds.setID(d.getID()); ds.setName(d.getName()); datasetsMap.put(id, ds); } //object already created this object. //Add the dataset to this project's list. datasets.add(ds); //Add images to the dataset images = new ArrayList(); k = d.getImages().iterator(); while (k.hasNext()) { img = (Image) k.next(); idImg = new Integer(img.getID()); is = (ImageSummary) imagesMap.get(idImg); if (is == null) { is = DatasetMapper.fillImageSummary(img); imagesMap.put(idImg, is); } images.add(is); } ds.setImages(images); } //Link the datasets to this project. ps.setDatasets(datasets); results.add(ps); } } }
|
public static void fillProjectsTree(List projects, List results, List projectIDs) { Iterator i = projects.iterator(), j, k; Map datasetsMap = new HashMap(), imagesMap = new HashMap(); Project p; List datasets, images; ProjectSummary ps; Dataset d; DatasetSummaryLinked ds; ImageSummary is; Image img; Integer id, idImg; while (i.hasNext()) { p = (Project) i.next(); if (projectIDs.contains(new Integer(p.getID()))) { ps = new ProjectSummary(p.getID(), p.getName()); datasets = new ArrayList(); j = p.getDatasets().iterator(); while (j.hasNext()) { d = (Dataset) j.next(); id = new Integer(d.getID()); ds = (DatasetSummaryLinked) datasetsMap.get(id); if (ds == null) { //Make a new DataObject and fill it up. ds = new DatasetSummaryLinked(); ds.setID(d.getID()); ds.setName(d.getName()); datasetsMap.put(id, ds); } //object already created this object. //Add the dataset to this project's list. datasets.add(ds); //Add images to the dataset images = new ArrayList(); k = d.getImages().iterator(); while (k.hasNext()) { img = (Image) k.next(); idImg = new Integer(img.getID()); is = (ImageSummary) imagesMap.get(idImg); if (is == null) { is = ImageMapper.buildImageSummary(img, null); is.setAnnotation( AnnotationMapper.fillImageAnnotation( (ImageAnnotation) imgAnnotated.get(idImg))); imagesMap.put(idImg, is); } images.add(is); } ds.setImages(images); } //Link the datasets to this project. ps.setDatasets(datasets); results.add(ps); } } }
| 3,236,545
|
static ImageSummary buildImageSummary(Image img, ImageSummary is) { Pixels px; px = img.getDefaultPixels(); is.setID(img.getID()); is.setName(img.getName()); is.setPixelsIDs(fillListPixelsID(px)); is.setDate(Timestamp.valueOf(img.getCreated())); //is.setImageServerPixelsID(fillListPixelsID(px)); return is; }
|
static ImageSummary buildImageSummary(Image img, ImageSummary is) { Pixels px; px = img.getDefaultPixels(); is.setID(img.getID()); is.setName(img.getName()); is.setPixelsIDs(fillListPixelsID(px)); is.setDate(PrimitiveTypesMapper.getTimestamp(img.getCreated())); //is.setImageServerPixelsID(fillListPixelsID(px)); return is; }
| 3,236,546
|
private void attachListeners() { JMenu menu = view.getWindowsMenu(); menu.addMenuListener(new MenuListener() { public void menuSelected(MenuEvent e) { createWindowsMenuItems(); } /** * Required by I/F but not actually needed in our case, * no op implementation. * @see MenuListener#menuCanceled(MenuEvent) */ public void menuCanceled(MenuEvent e) {} /** * Required by I/F but not actually needed in our case, * no op implementation. * @see MenuListener#menuDeselected(MenuEvent) */ public void menuDeselected(MenuEvent e) {} }); //Listen to keyboard selection menu.addMenuKeyListener(new MenuKeyListener() { public void menuKeyReleased(MenuKeyEvent e) { createWindowsMenuItems(); } /** * Required by I/F but not actually needed in our case, * no op implementation. * @see MenuKeyListener#menuKeyPressed(MenuKeyEvent) */ public void menuKeyPressed(MenuKeyEvent e) {} /** * Required by I/F but not actually needed in our case, * no op implementation. * @see MenuKeyListener#menuKeyTyped(MenuKeyEvent) */ public void menuKeyTyped(MenuKeyEvent e) {} }); view.setDefaultCloseOperation(WindowConstants.DO_NOTHING_ON_CLOSE); view.addWindowListener(new WindowAdapter() { public void windowClosing(WindowEvent e) { model.discard(); } }); }
|
private void attachListeners() { JMenu menu = HiViewerFactory.getWindowsMenu(); menu.addMenuListener(new MenuListener() { public void menuSelected(MenuEvent e) { createWindowsMenuItems(); } /** * Required by I/F but not actually needed in our case, * no op implementation. * @see MenuListener#menuCanceled(MenuEvent) */ public void menuCanceled(MenuEvent e) {} /** * Required by I/F but not actually needed in our case, * no op implementation. * @see MenuListener#menuDeselected(MenuEvent) */ public void menuDeselected(MenuEvent e) {} }); //Listen to keyboard selection menu.addMenuKeyListener(new MenuKeyListener() { public void menuKeyReleased(MenuKeyEvent e) { createWindowsMenuItems(); } /** * Required by I/F but not actually needed in our case, * no op implementation. * @see MenuKeyListener#menuKeyPressed(MenuKeyEvent) */ public void menuKeyPressed(MenuKeyEvent e) {} /** * Required by I/F but not actually needed in our case, * no op implementation. * @see MenuKeyListener#menuKeyTyped(MenuKeyEvent) */ public void menuKeyTyped(MenuKeyEvent e) {} }); view.setDefaultCloseOperation(WindowConstants.DO_NOTHING_ON_CLOSE); view.addWindowListener(new WindowAdapter() { public void windowClosing(WindowEvent e) { model.discard(); } }); }
| 3,236,547
|
private void createWindowsMenuItems() { Set viewers = HiViewerFactory.getViewers(); Iterator i = viewers.iterator(); JMenu menu = view.getWindowsMenu(); menu.removeAll(); HiViewer viewer; while (i.hasNext()) { viewer = (HiViewer) i.next(); //if (!(viewer == model)) menu.add(new JMenuItem(new ActivationAction(viewer))); } }
|
private void createWindowsMenuItems() { Set viewers = HiViewerFactory.getViewers(); Iterator i = viewers.iterator(); JMenu menu = HiViewerFactory.getWindowsMenu(); menu.removeAll(); HiViewer viewer; while (i.hasNext()) { viewer = (HiViewer) i.next(); //if (!(viewer == model)) menu.add(new JMenuItem(new ActivationAction(viewer))); } }
| 3,236,548
|
public void javaToNative(Object object, TransferData transferData) { // If null Object or unsupported TransferData, return. if (object == null || !(object instanceof Note[])) return; if (!isSupportedType(transferData)) return; // Write data to a byte[]. List<Note> notes = (List<Note>) object; org.jdom.Document jdomDocument = XMLNoteSerializer.createJDOMDocumentFromNotes(notes); ByteArrayOutputStream bytesOut = new ByteArrayOutputStream(); XMLOutputter xmlOut = new XMLOutputter(Format.getPrettyFormat()); try { xmlOut.output(jdomDocument, bytesOut); } catch (IOException ioe) { throw new KoalaException(ERROR_TEXT, ioe); } byte[] buffer = bytesOut.toByteArray(); // Super converts byte[] to native. super.javaToNative(buffer, transferData); }
|
public void javaToNative(Object object, TransferData transferData) { // If null Object or unsupported TransferData, return. if (object == null || !(object instanceof Note[])) return; if (!isSupportedType(transferData)) return; // Write data to a byte[]. List<Note> notes = (List<Note>) object; org.jdom.Document jdomDocument = XMLNoteSerializer.createJDOMDocumentFromNotes(notes); ByteArrayOutputStream bytesOut = new ByteArrayOutputStream(); XMLOutputter xmlOut = new XMLOutputter(Format.getPrettyFormat()); try { xmlOut.output(jdomDocument, bytesOut); } catch (IOException ioe) { throw new KoalaException(ERROR_TEXT, ioe); } byte[] buffer = bytesOut.toByteArray(); // Super converts byte[] to native. super.javaToNative(buffer, transferData); }
| 3,236,549
|
public static List fillICGHierarchyAvailable(List categories, int imgID, int userID) { ArrayList results = new ArrayList(), finalResults = new ArrayList(); Iterator i = categories.iterator(), j; Category category; CategoryGroup group; CategoryGroupData groupData = null; CategoryData catData; Classification classif; Integer groupID; HashMap groupsMap = new HashMap(), categoriesMap = new HashMap(); HashMap usedGroups = new HashMap(); boolean in; while (i.hasNext()) { in = false; category = (Category) i.next(); group = category.getCategoryGroup(); j = category.getClassificationList().iterator(); while (j.hasNext()) { classif = (Classification) j.next(); if (classif.isValid().equals(Boolean.TRUE) && classif.getModuleExecution().getExperimenter().getID() == userID && classif.getImage().getID() == imgID) { in = true; if (group != null) usedGroups.put(new Integer(group.getID()), group); } } if (!in) { //the image has been classified in the category. if (group != null && !usedGroups.containsKey(new Integer(group.getID()))) { groupID = new Integer(group.getID()); groupData = (CategoryGroupData) groupsMap.get(groupID); if (groupData == null) { groupData = createCategoryGroupData(group); groupsMap.put(groupID, groupData); } //Create the category catData = createCategoryData(category, categoriesMap); catData.setCategoryGroup(groupData); groupData.getCategories().add(catData); results.add(groupData); } else { //orphan category, shouldn't happen catData = createCategoryData(category, categoriesMap); results.add(catData); } } } //Copy all elements of results into finalResults finalResults.addAll(results); i = results.iterator(); Object userObject; while (i.hasNext()) { userObject = i.next(); if (userObject instanceof CategoryGroupData) { groupData = (CategoryGroupData) userObject; if (usedGroups.containsKey(new Integer(groupData.getID()))) finalResults.remove(groupData); } } return finalResults; }
|
public static List fillICGHierarchyAvailable(List categories, int imgID, int userID) { ArrayList results = new ArrayList(), finalResults = new ArrayList(); Iterator i = categories.iterator(), j; Category category; CategoryGroup group; CategoryGroupData groupData = null; CategoryData catData; Classification classif; Integer groupID; HashMap groupsMap = new HashMap(), categoriesMap = new HashMap(); HashMap usedGroups = new HashMap(); boolean in; while (i.hasNext()) { in = false; category = (Category) i.next(); group = category.getCategoryGroup(); j = category.getClassificationList().iterator(); while (j.hasNext()) { classif = (Classification) j.next(); if (classif.isValid().equals(Boolean.TRUE) && classif.getModuleExecution().getExperimenter().getID() == userID && classif.getImage().getID() == imgID) { in = true; if (group != null) usedGroups.put(new Integer(group.getID()), group); } } if (!in) { //the image has been classified in the category. if (group != null && !usedGroups.containsKey(new Integer(group.getID()))) { groupID = new Integer(group.getID()); groupData = (CategoryGroupData) groupsMap.get(groupID); if (groupData == null) { groupData = createCategoryGroupData(group); groupsMap.put(groupID, groupData); } //Create the category catData = createCategoryData(category, categoriesMap); catData.setCategoryGroup(groupData); groupData.getCategories().add(catData); results.add(groupData); } else { //orphan category, shouldn't happen catData = createCategoryData(category, categoriesMap); results.add(catData); } } } //Copy all elements of results into finalResults finalResults.addAll(results); i = results.iterator(); Object userObject; while (i.hasNext()) { userObject = i.next(); if (userObject instanceof CategoryGroupData) { groupData = (CategoryGroupData) userObject; if (usedGroups.containsKey(new Integer(groupData.getID()))) finalResults.remove(groupData); } } return finalResults; }
| 3,236,550
|
public static void moveFile(File sourceFile, File destinationFile) throws IOException { logger.debug("Moving " + sourceFile.getAbsolutePath() + " to " + destinationFile.getAbsolutePath()); if (destinationFile.exists()) { destinationFile.delete(); } // Move file using File method if possible boolean succesfulMove = sourceFile.renameTo(destinationFile); if (succesfulMove) return; // Copy file from source to destination logger.debug("Using copy and delete method"); InputStream in = null; OutputStream out = null; try { in = new FileInputStream(sourceFile); out = new FileOutputStream(destinationFile); copyStream(in, out); } finally { if (in != null) { try { in.close(); } catch (IOException e) { } } if (out != null) { try { out.close(); } catch (IOException e) { } } } // Remove source file sourceFile.delete(); }
|
public static void moveFile(File sourceFile, File destinationFile) throws IOException { logger.debug("Moving " + sourceFile.getAbsolutePath() + " to " + destinationFile.getAbsolutePath()); if (destinationFile.exists()) { destinationFile.delete(); } // Move file using File method if possible boolean succesfulMove = sourceFile.renameTo(destinationFile); if (succesfulMove) return; // Copy file from source to destination logger.debug("Using copy and delete method"); InputStream in = null; OutputStream out = null; try { in = new FileInputStream(sourceFile); out = new FileOutputStream(destinationFile); copyStream(in, out); } finally { if (in != null) { try { in.close(); } catch (IOException e) { } } if (out != null) { try { out.close(); } catch (IOException e) { } } } // Remove source file sourceFile.delete(); }
| 3,236,551
|
public static void moveFile(File sourceFile, File destinationFile) throws IOException { logger.debug("Moving " + sourceFile.getAbsolutePath() + " to " + destinationFile.getAbsolutePath()); if (destinationFile.exists()) { destinationFile.delete(); } // Move file using File method if possible boolean succesfulMove = sourceFile.renameTo(destinationFile); if (succesfulMove) return; // Copy file from source to destination logger.debug("Using copy and delete method"); InputStream in = null; OutputStream out = null; try { in = new FileInputStream(sourceFile); out = new FileOutputStream(destinationFile); copyStream(in, out); } finally { if (in != null) { try { in.close(); } catch (IOException e) { } } if (out != null) { try { out.close(); } catch (IOException e) { } } } // Remove source file sourceFile.delete(); }
|
public static void moveFile(File sourceFile, File destinationFile) throws IOException { logger.debug("Moving " + sourceFile.getAbsolutePath() + " to " + destinationFile.getAbsolutePath()); if (destinationFile.exists()) { destinationFile.delete(); } // Move file using File method if possible boolean succesfulMove = sourceFile.renameTo(destinationFile); if (succesfulMove) return; // Copy file from source to destination logger.debug("Using copy and delete method"); InputStream in = null; OutputStream out = null; try { in = new FileInputStream(sourceFile); out = new FileOutputStream(destinationFile); copyStream(in, out); } finally { if (in != null) { try { in.close(); } catch (IOException e) { } } if (out != null) { try { out.close(); } catch (IOException e) { } } } // Remove source file sourceFile.delete(); }
| 3,236,552
|
public static void moveFile(File sourceFile, File destinationFile) throws IOException { logger.debug("Moving " + sourceFile.getAbsolutePath() + " to " + destinationFile.getAbsolutePath()); if (destinationFile.exists()) { destinationFile.delete(); } // Move file using File method if possible boolean succesfulMove = sourceFile.renameTo(destinationFile); if (succesfulMove) return; // Copy file from source to destination logger.debug("Using copy and delete method"); InputStream in = null; OutputStream out = null; try { in = new FileInputStream(sourceFile); out = new FileOutputStream(destinationFile); copyStream(in, out); } finally { if (in != null) { try { in.close(); } catch (IOException e) { } } if (out != null) { try { out.close(); } catch (IOException e) { } } } // Remove source file sourceFile.delete(); }
|
public static void moveFile(File sourceFile, File destinationFile) throws IOException { logger.debug("Moving " + sourceFile.getAbsolutePath() + " to " + destinationFile.getAbsolutePath()); if (destinationFile.exists()) { destinationFile.delete(); } // Move file using File method if possible boolean succesfulMove = sourceFile.renameTo(destinationFile); if (succesfulMove) return; // Copy file from source to destination logger.debug("Using copy and delete method"); InputStream in = null; OutputStream out = null; try { in = new FileInputStream(sourceFile); out = new FileOutputStream(destinationFile); copyStream(in, out); } finally { if (in != null) { try { in.close(); } catch (IOException e) { } } if (out != null) { try { out.close(); } catch (IOException e) { } } } // Remove source file sourceFile.delete(); }
| 3,236,553
|
public void setModel(int model) { RenderingDef rd = renderer.getRenderingDef(); rd.setModel(model); }
|
public void setModel(int model) { RenderingDef rd = renderer.getRenderingDef(); rd.setModel(model); }
| 3,236,554
|
private int yylex() { char c; boolean spaceSeen = false; boolean commandState; if (lex_strterm != null) { int tok = lex_strterm.parseString(this, src); if (tok == Tokens.tSTRING_END || tok == Tokens.tREGEXP_END) { lex_strterm = null; lex_state = LexState.EXPR_END; } return tok; } currentPos = src.getPosition(); commandState = commandStart; commandStart = false; retry: for(;;) { c = src.read(); switch(c) { case '\004': /* ^D */ case '\032': /* ^Z */ case 0: /* end of script. */ return 0; /* white spaces */ case ' ': case '\t': case '\f': case '\r': case '\13': /* '\v' */ getPosition(null, false); spaceSeen = true; continue retry; case '#': /* it's a comment */ while ((c = src.read()) != '\n') { if (c == EOF) { return 0; } } /* fall through */ case '\n': // Replace a string of newlines with a single one while((c = src.read()) == '\n') { currentPos = src.getPosition(); } src.unread( c ); if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT || lex_state == LexState.EXPR_CLASS) { continue retry; } commandStart = true; lex_state = LexState.EXPR_BEG; return '\n'; case '*': if ((c = src.read()) == '*') { if ((c = src.read()) == '=') { yaccValue = new Token("**", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } src.unread(c); yaccValue = new Token("**", getPosition(null, false)); c = Tokens.tPOW; } else { if (c == '=') { yaccValue = new Token("*", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } src.unread(c); if (lex_state.isArgument() && spaceSeen && !Character.isWhitespace(c)) { warnings.warning(src.getPosition(), "`*' interpreted as argument prefix"); c = Tokens.tSTAR; } else if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID) { c = Tokens.tSTAR; } else { c = Tokens.tSTAR2; } } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } yaccValue = new Token("*", getPosition(null, false)); return c; case '!': lex_state = LexState.EXPR_BEG; if ((c = src.read()) == '=') { return Tokens.tNEQ; } if (c == '~') { return Tokens.tNMATCH; } src.unread(c); return Tokens.tBANG; case '=': // Skip documentation nodes if (src.wasBeginOfLine()) { /* skip embedded rd document */ if (isNextNoCase("begin")) { c = src.read(); if (Character.isWhitespace(c)) { // In case last next was the newline. src.unread(c); for (;;) { c = src.read(); // If a line is followed by a blank line put // it back. while (c == '\n') { c = src.read(); } if (c == EOF) { throw new SyntaxException(src.getPosition(), "embedded document meets end of file"); } if (c != '=') continue; if (src.wasBeginOfLine() && isNextNoCase("end")) { //if (src.peek('\n')) { // break; //} //c = src.read(); //if (Character.isWhitespace(c)) { src.readLine(); break; //} //src.unread(c); } } continue retry; } src.unread(c); } } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } c = src.read(); if (c == '=') { c = src.read(); if (c == '=') { yaccValue = new Token("===", getPosition(null, false)); return Tokens.tEQQ; } src.unread(c); yaccValue = new Token("==", getPosition(null, false)); return Tokens.tEQ; } if (c == '~') { yaccValue = new Token("=~", getPosition(null, false)); return Tokens.tMATCH; } else if (c == '>') { yaccValue = new Token("=>", getPosition(null, false)); return Tokens.tASSOC; } src.unread(c); yaccValue = new Token("=", getPosition(null, false)); return '='; case '<': c = src.read(); if (c == '<' && lex_state != LexState.EXPR_END && lex_state != LexState.EXPR_DOT && lex_state != LexState.EXPR_ENDARG && lex_state != LexState.EXPR_CLASS && (!lex_state.isArgument() || spaceSeen)) { int tok = hereDocumentIdentifier(); if (tok != 0) return tok; } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } if (c == '=') { if ((c = src.read()) == '>') { yaccValue = new Token("<=>", getPosition(null, false)); return Tokens.tCMP; } src.unread(c); yaccValue = new Token("<=", getPosition(null, false)); return Tokens.tLEQ; } if (c == '<') { if ((c = src.read()) == '=') { lex_state = LexState.EXPR_BEG; yaccValue = new Token("<<", getPosition(null, false)); return Tokens.tOP_ASGN; } src.unread(c); yaccValue = new Token("<<", getPosition(null, false)); return Tokens.tLSHFT; } yaccValue = new Token("<", getPosition(null, false)); src.unread(c); return Tokens.tLT; case '>': if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } if ((c = src.read()) == '=') { yaccValue = new Token(">=", getPosition(null, false)); return Tokens.tGEQ; } if (c == '>') { if ((c = src.read()) == '=') { lex_state = LexState.EXPR_BEG; yaccValue = new Token(">>", getPosition(null, false)); return Tokens.tOP_ASGN; } src.unread(c); yaccValue = new Token(">>", getPosition(null, false)); return Tokens.tRSHFT; } src.unread(c); yaccValue = new Token(">", getPosition(null, false)); return Tokens.tGT; case '"': lex_strterm = new StringTerm(str_dquote, '"', '\0'); return Tokens.tSTRING_BEG; case '`': yaccValue = new Token("`", getPosition(null, false)); if (lex_state == LexState.EXPR_FNAME) { lex_state = LexState.EXPR_END; return Tokens.tBACK_REF2; } if (lex_state == LexState.EXPR_DOT) { if (commandState) { lex_state = LexState.EXPR_CMDARG; } else { lex_state = LexState.EXPR_ARG; } return Tokens.tBACK_REF2; } lex_strterm = new StringTerm(str_xquote, '`', '\0'); return Tokens.tXSTRING_BEG; case '\'': lex_strterm = new StringTerm(str_squote, '\'', '\0'); return Tokens.tSTRING_BEG; case '?': if (lex_state == LexState.EXPR_END || lex_state == LexState.EXPR_ENDARG) { lex_state = LexState.EXPR_BEG; return '?'; } c = src.read(); if (c == EOF) { throw new SyntaxException(src.getPosition(), "incomplete character syntax"); } if (Character.isWhitespace(c)){ if (!lex_state.isArgument()){ int c2 = 0; switch (c) { case ' ': c2 = 's'; break; case '\n': c2 = 'n'; break; case '\t': c2 = 't'; break; /* What is \v in C? case '\v': c2 = 'v'; break; */ case '\r': c2 = 'r'; break; case '\f': c2 = 'f'; break; } if (c2 != 0) { warnings.warn(src.getPosition(), "invalid character syntax; use ?\\" + c2); } } src.unread(c); lex_state = LexState.EXPR_BEG; yaccValue = new Token("?", getPosition(null, false)); return '?'; /*} else if (ismbchar(c)) { // ruby - we don't support them either? rb_warn("multibyte character literal not supported yet; use ?\\" + c); support.unread(c); lexState = LexState.EXPR_BEG; return '?';*/ } else if ((Character.isLetterOrDigit(c) || c == '_') && !src.peek('\n') && isNext_identchar()) { src.unread(c); lex_state = LexState.EXPR_BEG; yaccValue = new Token("?", getPosition(null, false)); return '?'; } else if (c == '\\') { c = src.readEscape(); } c &= 0xff; lex_state = LexState.EXPR_END; yaccValue = new Token(new Long(c), getPosition(null, false)); return Tokens.tINTEGER; case '&': if ((c = src.read()) == '&') { lex_state = LexState.EXPR_BEG; if ((c = src.read()) == '=') { yaccValue = new Token("&&", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } src.unread(c); yaccValue = new Token("&&", getPosition(null, false)); return Tokens.tANDOP; } else if (c == '=') { yaccValue = new Token("&", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } src.unread(c); if (lex_state.isArgument() && spaceSeen && !Character.isWhitespace(c)){ warnings.warning(src.getPosition(), "`&' interpreted as argument prefix"); c = Tokens.tAMPER; } else if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID) { c = Tokens.tAMPER; } else { c = Tokens.tAMPER2; } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } yaccValue = new Token("&", getPosition(null, false)); return c; case '|': if ((c = src.read()) == '|') { lex_state = LexState.EXPR_BEG; if ((c = src.read()) == '=') { yaccValue = new Token("||", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } src.unread(c); yaccValue = new Token("||", getPosition(null, false)); return Tokens.tOROP; } if (c == '=') { yaccValue = new Token("|", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } src.unread(c); yaccValue = new Token("|", getPosition(null, false)); return Tokens.tPIPE; case '+': c = src.read(); if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; if (c == '@') { yaccValue = new Token("@+", getPosition(null, false)); return Tokens.tUPLUS; } src.unread(c); yaccValue = new Token("+", getPosition(null, false)); return Tokens.tPLUS; } if (c == '=') { yaccValue = new Token("+", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID || (lex_state.isArgument() && spaceSeen && !Character.isWhitespace(c))) { if (lex_state.isArgument()) arg_ambiguous(); lex_state = LexState.EXPR_BEG; src.unread(c); if (Character.isDigit(c)) { c = '+'; return parseNumber(c); } yaccValue = new Token("+", getPosition(null, false)); return Tokens.tUPLUS; } lex_state = LexState.EXPR_BEG; src.unread(c); yaccValue = new Token("+", getPosition(null, false)); return Tokens.tPLUS; case '-': c = src.read(); if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; if (c == '@') { yaccValue = new Token("@-", getPosition(null, false)); return Tokens.tUMINUS; } src.unread(c); yaccValue = new Token("-", getPosition(null, false)); return Tokens.tMINUS; } if (c == '=') { yaccValue = new Token("-", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID || (lex_state.isArgument() && spaceSeen && !Character.isWhitespace(c))) { if (lex_state.isArgument()) arg_ambiguous(); lex_state = LexState.EXPR_BEG; src.unread(c); yaccValue = new Token("-", getPosition(null, false)); if (Character.isDigit(c)) { return Tokens.tUMINUS_NUM; } return Tokens.tUMINUS; } lex_state = LexState.EXPR_BEG; src.unread(c); yaccValue = new Token("-", getPosition(null, false)); return Tokens.tMINUS; case '.': lex_state = LexState.EXPR_BEG; if ((c = src.read()) == '.') { if ((c = src.read()) == '.') { yaccValue = new Token("...", getPosition(null, false)); return Tokens.tDOT3; } src.unread(c); yaccValue = new Token("..", getPosition(null, false)); return Tokens.tDOT2; } src.unread(c); if (Character.isDigit(c)) { throw new SyntaxException(src.getPosition(), "no .<digit> floating literal anymore; put 0 before dot"); } lex_state = LexState.EXPR_DOT; yaccValue = new Token(".", getPosition(null, false)); return Tokens.tDOT; case '0' : case '1' : case '2' : case '3' : case '4' : case '5' : case '6' : case '7' : case '8' : case '9' : return parseNumber(c); case ']': case '}': case ')': conditionState.restart(); cmdArgumentState.restart(); lex_state = LexState.EXPR_END; return c; case ':': c = src.read(); if (c == ':') { if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID || lex_state == LexState.EXPR_CLASS || (lex_state.isArgument() && spaceSeen)) { lex_state = LexState.EXPR_BEG; yaccValue = new Token("::", getPosition(null, false)); return Tokens.tCOLON3; } lex_state = LexState.EXPR_DOT; return Tokens.tCOLON2; } if (lex_state == LexState.EXPR_END || lex_state == LexState.EXPR_ENDARG || Character.isWhitespace(c)) { src.unread(c); lex_state = LexState.EXPR_BEG; return ':'; } switch (c) { case '\'': lex_strterm = new StringTerm(str_ssym, c, '\0'); break; case '"': lex_strterm = new StringTerm(str_dsym, c, '\0'); break; default: src.unread(c); break; } lex_state = LexState.EXPR_FNAME; yaccValue = new Token(":", getPositionMinusOne()); return Tokens.tSYMBEG; case '/': if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID) { lex_strterm = new StringTerm(str_regexp, '/', '\0'); return Tokens.tREGEXP_BEG; } if ((c = src.read()) == '=') { yaccValue = "/"; lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } src.unread(c); if (lex_state.isArgument() && spaceSeen) { if (!Character.isWhitespace(c)) { arg_ambiguous(); lex_strterm = new StringTerm(str_regexp, '/', '\0'); return Tokens.tREGEXP_BEG; } } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } yaccValue = new Token("/", getPosition(null, false)); return Tokens.tDIVIDE; case '^': if ((c = src.read()) == '=') { lex_state = LexState.EXPR_BEG; yaccValue = new Token("^", getPosition(null, false)); return Tokens.tOP_ASGN; } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } src.unread(c); yaccValue = new Token("^", getPosition(null, false)); return Tokens.tCARET; case ';': commandStart = true; case ',': lex_state = LexState.EXPR_BEG; return c; case '~': if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { if ((c = src.read()) != '@') { src.unread(c); } } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } yaccValue = new Token("~", getPosition(null, false)); return Tokens.tTILDE; case '(': c = Tokens.tLPAREN2; commandStart = true; if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID) { c = Tokens.tLPAREN; } else if (spaceSeen) { if (lex_state == LexState.EXPR_CMDARG) { c = Tokens.tLPAREN_ARG; } else if (lex_state == LexState.EXPR_ARG) { warnings.warn(src.getPosition(), "don't put space before argument parentheses"); c = Tokens.tLPAREN2; } } conditionState.stop(); cmdArgumentState.stop(); lex_state = LexState.EXPR_BEG; yaccValue = new Token("(", getPosition(null, false)); return c; case '[': if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; if ((c = src.read()) == ']') { if ((c = src.read()) == '=') { yaccValue = new Token("[]=", getPosition(null, false)); return Tokens.tASET; } yaccValue = new Token("[]", getPosition(null, false)); src.unread(c); return Tokens.tAREF; } src.unread(c); yaccValue = new Token("[", getPosition(null, false)); return '['; } else if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID) { c = Tokens.tLBRACK; } else if (lex_state.isArgument() && spaceSeen) { c = Tokens.tLBRACK; } lex_state = LexState.EXPR_BEG; conditionState.stop(); cmdArgumentState.stop(); yaccValue = new Token("[", getPosition(null, false)); return c; case '{': c = Tokens.tLCURLY; if (lex_state.isArgument() || lex_state == LexState.EXPR_END) { c = Tokens.tLCURLY; /* block (primary) */ } else if (lex_state == LexState.EXPR_ENDARG) { c = Tokens.tLBRACE_ARG; /* block (expr) */ } else { c = Tokens.tLBRACE; /* hash */ } conditionState.stop(); cmdArgumentState.stop(); lex_state = LexState.EXPR_BEG; yaccValue = new Token("{", getPosition(null, false)); return c; case '\\': c = src.read(); if (c == '\n') { spaceSeen = true; continue retry; /* skip \\n */ } src.unread(c); yaccValue = new Token("\\", getPosition(null, false)); return '\\'; case '%': if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID) { return parseQuote(src.read()); } if ((c = src.read()) == '=') { yaccValue = new Token("%", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } if (lex_state.isArgument() && spaceSeen && !Character.isWhitespace(c)) { return parseQuote(c); } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } src.unread(c); yaccValue = new Token("%", getPosition(null, false)); return Tokens.tPERCENT; case '$': lex_state = LexState.EXPR_END; tokenBuffer.setLength(0); c = src.read(); switch (c) { case '_': /* $_: last read line string */ c = src.read(); if (isIdentifierChar(c)) { tokenBuffer.append('$'); tokenBuffer.append('_'); break; } src.unread(c); c = '_'; /* fall through */ case '*': /* $*: argv */ case '$': /* $$: pid */ case '?': /* $?: last status */ case '!': /* $!: error string */ case '@': /* $@: error position */ case '/': /* $/: input record separator */ case '\\': /* $\: output record separator */ case ';': /* $;: field separator */ case ',': /* $,: output field separator */ case '.': /* $.: last read line number */ case '=': /* $=: ignorecase */ case ':': /* $:: load path */ case '<': /* $<: reading filename */ case '>': /* $>: default output handle */ case '\"': /* $": already loaded files */ tokenBuffer.append('$'); tokenBuffer.append(c); yaccValue = new Token(tokenBuffer.toString(), getPosition(null, false)); return Tokens.tGVAR; case '-': tokenBuffer.append('$'); tokenBuffer.append(c); c = src.read(); tokenBuffer.append(c); yaccValue = new Token(tokenBuffer.toString(), getPosition(null, false)); /* xxx shouldn't check if valid option variable */ return Tokens.tGVAR; case '~': /* $~: match-data */ case '&': /* $&: last match */ case '`': /* $`: string before last match */ case '\'': /* $': string after last match */ case '+': /* $+: string matches last paren. */ yaccValue = new BackRefNode(src.getPosition(), c); return Tokens.tBACK_REF; case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': tokenBuffer.append('$'); do { tokenBuffer.append(c); c = src.read(); } while (Character.isDigit(c)); src.unread(c); yaccValue = new NthRefNode(src.getPosition(), Integer.parseInt(tokenBuffer.substring(1))); return Tokens.tNTH_REF; default: if (!isIdentifierChar(c)) { src.unread(c); yaccValue = new Token("$", getPosition(null, false)); return '$'; } case '0': tokenBuffer.append('$'); } break; case '@': c = src.read(); tokenBuffer.setLength(0); tokenBuffer.append('@'); if (c == '@') { tokenBuffer.append('@'); c = src.read(); } if (Character.isDigit(c)) { if (tokenBuffer.length() == 1) { throw new SyntaxException(src.getPosition(), "`@" + c + "' is not allowed as an instance variable name"); } throw new SyntaxException(src.getPosition(), "`@@" + c + "' is not allowed as a class variable name"); } if (!isIdentifierChar(c)) { src.unread(c); yaccValue = new Token("@", getPosition(null, false)); return '@'; } break; case '_': if (src.wasBeginOfLine() && src.matchString("_END__\n", false)) { parserSupport.getResult().setEndSeen(true); return 0; } tokenBuffer.setLength(0); break; default: if (!isIdentifierChar(c)) { throw new SyntaxException(src.getPosition(), "Invalid char `\\" + new PrintfFormat("%.3o").sprintf(c) + "' in expression"); } tokenBuffer.setLength(0); break; } do { tokenBuffer.append(c); /* no special multibyte character handling is needed in Java * if (ismbchar(c)) { int i, len = mbclen(c)-1; for (i = 0; i < len; i++) { c = src.read(); tokenBuffer.append(c); } }*/ c = src.read(); } while (isIdentifierChar(c)); char peek = src.read(); if ((c == '!' || c == '?') && isIdentifierChar(tokenBuffer.charAt(0)) && peek != '=') { src.unread(peek); tokenBuffer.append(c); } else { src.unread(peek); src.unread(c); } int result = 0; switch (tokenBuffer.charAt(0)) { case '$': lex_state = LexState.EXPR_END; result = Tokens.tGVAR; break; case '@': lex_state = LexState.EXPR_END; if (tokenBuffer.charAt(1) == '@') { result = Tokens.tCVAR; } else { result = Tokens.tIVAR; } break; default: char last = tokenBuffer.charAt(tokenBuffer.length() - 1); if (last == '!' || last == '?') { result = Tokens.tFID; } else { if (lex_state == LexState.EXPR_FNAME) { /* // Enebo: This should be equivalent to below without // so much read/unread action. if ((c = src.read()) == '=') { char c2 = src.read(); if (c2 != '~' && c2 != '>' && (c2 != '=' || (c2 == '\n' && src.peek('>')))) { result = Token.tIDENTIFIER; tokenBuffer.append(c); } else { src.unread(c2); src.unread(c); } } else { src.unread(c); } */ if ((c = src.read()) == '=' && !src.peek('~') && !src.peek('>') && (!src.peek('=') || (src.peek('\n') && src.getCharAt(1) == '>'))) { result = Tokens.tIDENTIFIER; tokenBuffer.append(c); } else { src.unread(c); } } if (result == 0 && ISUPPER(tokenBuffer.charAt(0))) { result = Tokens.tCONSTANT; } else { result = Tokens.tIDENTIFIER; } } if (lex_state != LexState.EXPR_DOT) { /* See if it is a reserved word. */ Keyword keyword = Keyword.getKeyword(tokenBuffer.toString(), tokenBuffer.length()); if (keyword != null) { // enum lex_state LexState state = lex_state; lex_state = keyword.state; if (state.isExprFName()) { yaccValue = new Token(keyword.name, getPositionMinusOne()); } else { yaccValue = new Token(tokenBuffer.toString(), getPositionMinusOne()); } if (keyword.id0 == Tokens.kDO) { if (conditionState.isInState()) { return Tokens.kDO_COND; } if (cmdArgumentState.isInState() && state != LexState.EXPR_CMDARG) { return Tokens.kDO_BLOCK; } if (state == LexState.EXPR_ENDARG) { return Tokens.kDO_BLOCK; } return Tokens.kDO; } if (state == LexState.EXPR_BEG) { return keyword.id0; } if (keyword.id0 != keyword.id1) { lex_state = LexState.EXPR_BEG; } return keyword.id1; } } if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID || lex_state == LexState.EXPR_DOT || lex_state == LexState.EXPR_ARG || lex_state == LexState.EXPR_CMDARG) { if (commandState) { lex_state = LexState.EXPR_CMDARG; } else { lex_state = LexState.EXPR_ARG; } } else { lex_state = LexState.EXPR_END; } } yaccValue = tokenBuffer.toString(); // Lame: parsing logic made it into lexer in ruby...So we // are emulating if (IdUtil.isLocal((String)yaccValue) && ((((LocalNamesElement) parserSupport.getLocalNames().peek()).isInBlock() && ((BlockNamesElement) parserSupport.getBlockNames().peek()).isDefined((String) yaccValue)) || ((LocalNamesElement) parserSupport.getLocalNames().peek()).isLocalRegistered((String) yaccValue))) { lex_state = LexState.EXPR_END; } yaccValue = new Token(yaccValue, getPositionMinusOne()); return result; } }
|
private int yylex() { char c; boolean spaceSeen = false; boolean commandState; if (lex_strterm != null) { int tok = lex_strterm.parseString(this, src); if (tok == Tokens.tSTRING_END || tok == Tokens.tREGEXP_END) { lex_strterm = null; lex_state = LexState.EXPR_END; } return tok; } currentPos = src.getPosition(); commandState = commandStart; commandStart = false; retry: for(;;) { c = src.read(); switch(c) { case '\004': /* ^D */ case '\032': /* ^Z */ case 0: /* end of script. */ return 0; /* white spaces */ case ' ': case '\t': case '\f': case '\r': case '\13': /* '\v' */ getPosition(null, false); spaceSeen = true; continue retry; case '#': /* it's a comment */ while ((c = src.read()) != '\n') { if (c == EOF) { return 0; } } /* fall through */ case '\n': // Replace a string of newlines with a single one while((c = src.read()) == '\n') { currentPos = src.getPosition(); } src.unread( c ); if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT || lex_state == LexState.EXPR_CLASS) { continue retry; } commandStart = true; lex_state = LexState.EXPR_BEG; return '\n'; case '*': if ((c = src.read()) == '*') { if ((c = src.read()) == '=') { yaccValue = new Token("**", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } src.unread(c); yaccValue = new Token("**", getPosition(null, false)); c = Tokens.tPOW; } else { if (c == '=') { yaccValue = new Token("*", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } src.unread(c); if (lex_state.isArgument() && spaceSeen && !Character.isWhitespace(c)) { warnings.warning(src.getPosition(), "`*' interpreted as argument prefix"); c = Tokens.tSTAR; } else if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID) { c = Tokens.tSTAR; } else { c = Tokens.tSTAR2; } } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } yaccValue = new Token("*", getPosition(null, false)); return c; case '!': lex_state = LexState.EXPR_BEG; if ((c = src.read()) == '=') { return Tokens.tNEQ; } if (c == '~') { return Tokens.tNMATCH; } src.unread(c); return Tokens.tBANG; case '=': // Skip documentation nodes if (src.wasBeginOfLine()) { /* skip embedded rd document */ if (isNextNoCase("begin")) { c = src.read(); if (Character.isWhitespace(c)) { // In case last next was the newline. src.unread(c); for (;;) { c = src.read(); // If a line is followed by a blank line put // it back. while (c == '\n') { c = src.read(); } if (c == EOF) { throw new SyntaxException(src.getPosition(), "embedded document meets end of file"); } if (c != '=') continue; if (src.wasBeginOfLine() && isNextNoCase("end")) { //if (src.peek('\n')) { // break; //} //c = src.read(); //if (Character.isWhitespace(c)) { src.readLine(); break; //} //src.unread(c); } } continue retry; } src.unread(c); } } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } c = src.read(); if (c == '=') { c = src.read(); if (c == '=') { yaccValue = new Token("===", getPosition(null, false)); return Tokens.tEQQ; } src.unread(c); yaccValue = new Token("==", getPosition(null, false)); return Tokens.tEQ; } if (c == '~') { yaccValue = new Token("=~", getPosition(null, false)); return Tokens.tMATCH; } else if (c == '>') { yaccValue = new Token("=>", getPosition(null, false)); return Tokens.tASSOC; } src.unread(c); yaccValue = new Token("=", getPosition(null, false)); return '='; case '<': c = src.read(); if (c == '<' && lex_state != LexState.EXPR_END && lex_state != LexState.EXPR_DOT && lex_state != LexState.EXPR_ENDARG && lex_state != LexState.EXPR_CLASS && (!lex_state.isArgument() || spaceSeen)) { int tok = hereDocumentIdentifier(); if (tok != 0) return tok; } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } if (c == '=') { if ((c = src.read()) == '>') { yaccValue = new Token("<=>", getPosition(null, false)); return Tokens.tCMP; } src.unread(c); yaccValue = new Token("<=", getPosition(null, false)); return Tokens.tLEQ; } if (c == '<') { if ((c = src.read()) == '=') { lex_state = LexState.EXPR_BEG; yaccValue = new Token("<<", getPosition(null, false)); return Tokens.tOP_ASGN; } src.unread(c); yaccValue = new Token("<<", getPosition(null, false)); return Tokens.tLSHFT; } yaccValue = new Token("<", getPosition(null, false)); src.unread(c); return Tokens.tLT; case '>': if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } if ((c = src.read()) == '=') { yaccValue = new Token(">=", getPosition(null, false)); return Tokens.tGEQ; } if (c == '>') { if ((c = src.read()) == '=') { lex_state = LexState.EXPR_BEG; yaccValue = new Token(">>", getPosition(null, false)); return Tokens.tOP_ASGN; } src.unread(c); yaccValue = new Token(">>", getPosition(null, false)); return Tokens.tRSHFT; } src.unread(c); yaccValue = new Token(">", getPosition(null, false)); return Tokens.tGT; case '"': lex_strterm = new StringTerm(str_dquote, '"', '\0'); return Tokens.tSTRING_BEG; case '`': yaccValue = new Token("`", getPosition(null, false)); if (lex_state == LexState.EXPR_FNAME) { lex_state = LexState.EXPR_END; return Tokens.tBACK_REF2; } if (lex_state == LexState.EXPR_DOT) { if (commandState) { lex_state = LexState.EXPR_CMDARG; } else { lex_state = LexState.EXPR_ARG; } return Tokens.tBACK_REF2; } lex_strterm = new StringTerm(str_xquote, '`', '\0'); return Tokens.tXSTRING_BEG; case '\'': lex_strterm = new StringTerm(str_squote, '\'', '\0'); return Tokens.tSTRING_BEG; case '?': if (lex_state == LexState.EXPR_END || lex_state == LexState.EXPR_ENDARG) { lex_state = LexState.EXPR_BEG; return '?'; } c = src.read(); if (c == EOF) { throw new SyntaxException(src.getPosition(), "incomplete character syntax"); } if (Character.isWhitespace(c)){ if (!lex_state.isArgument()){ int c2 = 0; switch (c) { case ' ': c2 = 's'; break; case '\n': c2 = 'n'; break; case '\t': c2 = 't'; break; /* What is \v in C? case '\v': c2 = 'v'; break; */ case '\r': c2 = 'r'; break; case '\f': c2 = 'f'; break; } if (c2 != 0) { warnings.warn(src.getPosition(), "invalid character syntax; use ?\\" + c2); } } src.unread(c); lex_state = LexState.EXPR_BEG; yaccValue = new Token("?", getPosition(null, false)); return '?'; /*} else if (ismbchar(c)) { // ruby - we don't support them either? rb_warn("multibyte character literal not supported yet; use ?\\" + c); support.unread(c); lexState = LexState.EXPR_BEG; return '?';*/ } else if ((Character.isLetterOrDigit(c) || c == '_') && !src.peek('\n') && isNext_identchar()) { src.unread(c); lex_state = LexState.EXPR_BEG; yaccValue = new Token("?", getPosition(null, false)); return '?'; } else if (c == '\\') { c = src.readEscape(); } c &= 0xff; lex_state = LexState.EXPR_END; yaccValue = new Token(new Long(c), getPosition(null, false)); return Tokens.tINTEGER; case '&': if ((c = src.read()) == '&') { lex_state = LexState.EXPR_BEG; if ((c = src.read()) == '=') { yaccValue = new Token("&&", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } src.unread(c); yaccValue = new Token("&&", getPosition(null, false)); return Tokens.tANDOP; } else if (c == '=') { yaccValue = new Token("&", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } src.unread(c); if (lex_state.isArgument() && spaceSeen && !Character.isWhitespace(c)){ warnings.warning(src.getPosition(), "`&' interpreted as argument prefix"); c = Tokens.tAMPER; } else if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID) { c = Tokens.tAMPER; } else { c = Tokens.tAMPER2; } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } yaccValue = new Token("&", getPosition(null, false)); return c; case '|': if ((c = src.read()) == '|') { lex_state = LexState.EXPR_BEG; if ((c = src.read()) == '=') { yaccValue = new Token("||", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } src.unread(c); yaccValue = new Token("||", getPosition(null, false)); return Tokens.tOROP; } if (c == '=') { yaccValue = new Token("|", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } src.unread(c); yaccValue = new Token("|", getPosition(null, false)); return Tokens.tPIPE; case '+': c = src.read(); if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; if (c == '@') { yaccValue = new Token("@+", getPosition(null, false)); return Tokens.tUPLUS; } src.unread(c); yaccValue = new Token("+", getPosition(null, false)); return Tokens.tPLUS; } if (c == '=') { yaccValue = new Token("+", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID || (lex_state.isArgument() && spaceSeen && !Character.isWhitespace(c))) { if (lex_state.isArgument()) arg_ambiguous(); lex_state = LexState.EXPR_BEG; src.unread(c); if (Character.isDigit(c)) { c = '+'; return parseNumber(c); } yaccValue = new Token("+", getPosition(null, false)); return Tokens.tUPLUS; } lex_state = LexState.EXPR_BEG; src.unread(c); yaccValue = new Token("+", getPosition(null, false)); return Tokens.tPLUS; case '-': c = src.read(); if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; if (c == '@') { yaccValue = new Token("@-", getPosition(null, false)); return Tokens.tUMINUS; } src.unread(c); yaccValue = new Token("-", getPosition(null, false)); return Tokens.tMINUS; } if (c == '=') { yaccValue = new Token("-", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID || (lex_state.isArgument() && spaceSeen && !Character.isWhitespace(c))) { if (lex_state.isArgument()) arg_ambiguous(); lex_state = LexState.EXPR_BEG; src.unread(c); yaccValue = new Token("-", getPosition(null, false)); if (Character.isDigit(c)) { return Tokens.tUMINUS_NUM; } return Tokens.tUMINUS; } lex_state = LexState.EXPR_BEG; src.unread(c); yaccValue = new Token("-", getPosition(null, false)); return Tokens.tMINUS; case '.': lex_state = LexState.EXPR_BEG; if ((c = src.read()) == '.') { if ((c = src.read()) == '.') { yaccValue = new Token("...", getPosition(null, false)); return Tokens.tDOT3; } src.unread(c); yaccValue = new Token("..", getPosition(null, false)); return Tokens.tDOT2; } src.unread(c); if (Character.isDigit(c)) { throw new SyntaxException(src.getPosition(), "no .<digit> floating literal anymore; put 0 before dot"); } lex_state = LexState.EXPR_DOT; yaccValue = new Token(".", getPosition(null, false)); return Tokens.tDOT; case '0' : case '1' : case '2' : case '3' : case '4' : case '5' : case '6' : case '7' : case '8' : case '9' : return parseNumber(c); case ']': case '}': case ')': conditionState.restart(); cmdArgumentState.restart(); lex_state = LexState.EXPR_END; return c; case ':': c = src.read(); if (c == ':') { if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID || lex_state == LexState.EXPR_CLASS || (lex_state.isArgument() && spaceSeen)) { lex_state = LexState.EXPR_BEG; yaccValue = new Token("::", getPosition(null, false)); return Tokens.tCOLON3; } lex_state = LexState.EXPR_DOT; return Tokens.tCOLON2; } if (lex_state == LexState.EXPR_END || lex_state == LexState.EXPR_ENDARG || Character.isWhitespace(c)) { src.unread(c); lex_state = LexState.EXPR_BEG; return ':'; } switch (c) { case '\'': lex_strterm = new StringTerm(str_ssym, c, '\0'); break; case '"': lex_strterm = new StringTerm(str_dsym, c, '\0'); break; default: src.unread(c); break; } lex_state = LexState.EXPR_FNAME; yaccValue = new Token(":", getPositionMinusOne()); return Tokens.tSYMBEG; case '/': if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID) { lex_strterm = new StringTerm(str_regexp, '/', '\0'); return Tokens.tREGEXP_BEG; } if ((c = src.read()) == '=') { yaccValue = new Token("/", getPositionMinusOne()); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } src.unread(c); if (lex_state.isArgument() && spaceSeen) { if (!Character.isWhitespace(c)) { arg_ambiguous(); lex_strterm = new StringTerm(str_regexp, '/', '\0'); return Tokens.tREGEXP_BEG; } } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } yaccValue = new Token("/", getPosition(null, false)); return Tokens.tDIVIDE; case '^': if ((c = src.read()) == '=') { lex_state = LexState.EXPR_BEG; yaccValue = new Token("^", getPosition(null, false)); return Tokens.tOP_ASGN; } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } src.unread(c); yaccValue = new Token("^", getPosition(null, false)); return Tokens.tCARET; case ';': commandStart = true; case ',': lex_state = LexState.EXPR_BEG; return c; case '~': if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { if ((c = src.read()) != '@') { src.unread(c); } } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } yaccValue = new Token("~", getPosition(null, false)); return Tokens.tTILDE; case '(': c = Tokens.tLPAREN2; commandStart = true; if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID) { c = Tokens.tLPAREN; } else if (spaceSeen) { if (lex_state == LexState.EXPR_CMDARG) { c = Tokens.tLPAREN_ARG; } else if (lex_state == LexState.EXPR_ARG) { warnings.warn(src.getPosition(), "don't put space before argument parentheses"); c = Tokens.tLPAREN2; } } conditionState.stop(); cmdArgumentState.stop(); lex_state = LexState.EXPR_BEG; yaccValue = new Token("(", getPosition(null, false)); return c; case '[': if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; if ((c = src.read()) == ']') { if ((c = src.read()) == '=') { yaccValue = new Token("[]=", getPosition(null, false)); return Tokens.tASET; } yaccValue = new Token("[]", getPosition(null, false)); src.unread(c); return Tokens.tAREF; } src.unread(c); yaccValue = new Token("[", getPosition(null, false)); return '['; } else if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID) { c = Tokens.tLBRACK; } else if (lex_state.isArgument() && spaceSeen) { c = Tokens.tLBRACK; } lex_state = LexState.EXPR_BEG; conditionState.stop(); cmdArgumentState.stop(); yaccValue = new Token("[", getPosition(null, false)); return c; case '{': c = Tokens.tLCURLY; if (lex_state.isArgument() || lex_state == LexState.EXPR_END) { c = Tokens.tLCURLY; /* block (primary) */ } else if (lex_state == LexState.EXPR_ENDARG) { c = Tokens.tLBRACE_ARG; /* block (expr) */ } else { c = Tokens.tLBRACE; /* hash */ } conditionState.stop(); cmdArgumentState.stop(); lex_state = LexState.EXPR_BEG; yaccValue = new Token("{", getPosition(null, false)); return c; case '\\': c = src.read(); if (c == '\n') { spaceSeen = true; continue retry; /* skip \\n */ } src.unread(c); yaccValue = new Token("\\", getPosition(null, false)); return '\\'; case '%': if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID) { return parseQuote(src.read()); } if ((c = src.read()) == '=') { yaccValue = new Token("%", getPosition(null, false)); lex_state = LexState.EXPR_BEG; return Tokens.tOP_ASGN; } if (lex_state.isArgument() && spaceSeen && !Character.isWhitespace(c)) { return parseQuote(c); } if (lex_state == LexState.EXPR_FNAME || lex_state == LexState.EXPR_DOT) { lex_state = LexState.EXPR_ARG; } else { lex_state = LexState.EXPR_BEG; } src.unread(c); yaccValue = new Token("%", getPosition(null, false)); return Tokens.tPERCENT; case '$': lex_state = LexState.EXPR_END; tokenBuffer.setLength(0); c = src.read(); switch (c) { case '_': /* $_: last read line string */ c = src.read(); if (isIdentifierChar(c)) { tokenBuffer.append('$'); tokenBuffer.append('_'); break; } src.unread(c); c = '_'; /* fall through */ case '*': /* $*: argv */ case '$': /* $$: pid */ case '?': /* $?: last status */ case '!': /* $!: error string */ case '@': /* $@: error position */ case '/': /* $/: input record separator */ case '\\': /* $\: output record separator */ case ';': /* $;: field separator */ case ',': /* $,: output field separator */ case '.': /* $.: last read line number */ case '=': /* $=: ignorecase */ case ':': /* $:: load path */ case '<': /* $<: reading filename */ case '>': /* $>: default output handle */ case '\"': /* $": already loaded files */ tokenBuffer.append('$'); tokenBuffer.append(c); yaccValue = new Token(tokenBuffer.toString(), getPosition(null, false)); return Tokens.tGVAR; case '-': tokenBuffer.append('$'); tokenBuffer.append(c); c = src.read(); tokenBuffer.append(c); yaccValue = new Token(tokenBuffer.toString(), getPosition(null, false)); /* xxx shouldn't check if valid option variable */ return Tokens.tGVAR; case '~': /* $~: match-data */ case '&': /* $&: last match */ case '`': /* $`: string before last match */ case '\'': /* $': string after last match */ case '+': /* $+: string matches last paren. */ yaccValue = new BackRefNode(src.getPosition(), c); return Tokens.tBACK_REF; case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': tokenBuffer.append('$'); do { tokenBuffer.append(c); c = src.read(); } while (Character.isDigit(c)); src.unread(c); yaccValue = new NthRefNode(src.getPosition(), Integer.parseInt(tokenBuffer.substring(1))); return Tokens.tNTH_REF; default: if (!isIdentifierChar(c)) { src.unread(c); yaccValue = new Token("$", getPosition(null, false)); return '$'; } case '0': tokenBuffer.append('$'); } break; case '@': c = src.read(); tokenBuffer.setLength(0); tokenBuffer.append('@'); if (c == '@') { tokenBuffer.append('@'); c = src.read(); } if (Character.isDigit(c)) { if (tokenBuffer.length() == 1) { throw new SyntaxException(src.getPosition(), "`@" + c + "' is not allowed as an instance variable name"); } throw new SyntaxException(src.getPosition(), "`@@" + c + "' is not allowed as a class variable name"); } if (!isIdentifierChar(c)) { src.unread(c); yaccValue = new Token("@", getPosition(null, false)); return '@'; } break; case '_': if (src.wasBeginOfLine() && src.matchString("_END__\n", false)) { parserSupport.getResult().setEndSeen(true); return 0; } tokenBuffer.setLength(0); break; default: if (!isIdentifierChar(c)) { throw new SyntaxException(src.getPosition(), "Invalid char `\\" + new PrintfFormat("%.3o").sprintf(c) + "' in expression"); } tokenBuffer.setLength(0); break; } do { tokenBuffer.append(c); /* no special multibyte character handling is needed in Java * if (ismbchar(c)) { int i, len = mbclen(c)-1; for (i = 0; i < len; i++) { c = src.read(); tokenBuffer.append(c); } }*/ c = src.read(); } while (isIdentifierChar(c)); char peek = src.read(); if ((c == '!' || c == '?') && isIdentifierChar(tokenBuffer.charAt(0)) && peek != '=') { src.unread(peek); tokenBuffer.append(c); } else { src.unread(peek); src.unread(c); } int result = 0; switch (tokenBuffer.charAt(0)) { case '$': lex_state = LexState.EXPR_END; result = Tokens.tGVAR; break; case '@': lex_state = LexState.EXPR_END; if (tokenBuffer.charAt(1) == '@') { result = Tokens.tCVAR; } else { result = Tokens.tIVAR; } break; default: char last = tokenBuffer.charAt(tokenBuffer.length() - 1); if (last == '!' || last == '?') { result = Tokens.tFID; } else { if (lex_state == LexState.EXPR_FNAME) { /* // Enebo: This should be equivalent to below without // so much read/unread action. if ((c = src.read()) == '=') { char c2 = src.read(); if (c2 != '~' && c2 != '>' && (c2 != '=' || (c2 == '\n' && src.peek('>')))) { result = Token.tIDENTIFIER; tokenBuffer.append(c); } else { src.unread(c2); src.unread(c); } } else { src.unread(c); } */ if ((c = src.read()) == '=' && !src.peek('~') && !src.peek('>') && (!src.peek('=') || (src.peek('\n') && src.getCharAt(1) == '>'))) { result = Tokens.tIDENTIFIER; tokenBuffer.append(c); } else { src.unread(c); } } if (result == 0 && ISUPPER(tokenBuffer.charAt(0))) { result = Tokens.tCONSTANT; } else { result = Tokens.tIDENTIFIER; } } if (lex_state != LexState.EXPR_DOT) { /* See if it is a reserved word. */ Keyword keyword = Keyword.getKeyword(tokenBuffer.toString(), tokenBuffer.length()); if (keyword != null) { // enum lex_state LexState state = lex_state; lex_state = keyword.state; if (state.isExprFName()) { yaccValue = new Token(keyword.name, getPositionMinusOne()); } else { yaccValue = new Token(tokenBuffer.toString(), getPositionMinusOne()); } if (keyword.id0 == Tokens.kDO) { if (conditionState.isInState()) { return Tokens.kDO_COND; } if (cmdArgumentState.isInState() && state != LexState.EXPR_CMDARG) { return Tokens.kDO_BLOCK; } if (state == LexState.EXPR_ENDARG) { return Tokens.kDO_BLOCK; } return Tokens.kDO; } if (state == LexState.EXPR_BEG) { return keyword.id0; } if (keyword.id0 != keyword.id1) { lex_state = LexState.EXPR_BEG; } return keyword.id1; } } if (lex_state == LexState.EXPR_BEG || lex_state == LexState.EXPR_MID || lex_state == LexState.EXPR_DOT || lex_state == LexState.EXPR_ARG || lex_state == LexState.EXPR_CMDARG) { if (commandState) { lex_state = LexState.EXPR_CMDARG; } else { lex_state = LexState.EXPR_ARG; } } else { lex_state = LexState.EXPR_END; } } yaccValue = tokenBuffer.toString(); // Lame: parsing logic made it into lexer in ruby...So we // are emulating if (IdUtil.isLocal((String)yaccValue) && ((((LocalNamesElement) parserSupport.getLocalNames().peek()).isInBlock() && ((BlockNamesElement) parserSupport.getBlockNames().peek()).isDefined((String) yaccValue)) || ((LocalNamesElement) parserSupport.getLocalNames().peek()).isLocalRegistered((String) yaccValue))) { lex_state = LexState.EXPR_END; } yaccValue = new Token(yaccValue, getPositionMinusOne()); return result; } }
| 3,236,555
|
public IRubyObject match(IRubyObject target) { if (target.isNil()) { return getRuntime().getFalse(); } // FIXME: I think all String expecting functions has this magic via RSTRING if (target instanceof RubySymbol) { target = ((RubySymbol) target).to_s(); } int result = search(target, 0); return result < 0 ? getRuntime().getNil() : getRuntime().newFixnum(result); }
|
public IRubyObject match(IRubyObject target) { if (target.isNil()) { return getRuntime().getFalse(); } // FIXME: I think all String expecting functions has this magic via RSTRING if (target instanceof RubySymbol) { target = ((RubySymbol) target).to_s(); } int result = search(target, 0); return result < 0 ? getRuntime().getNil() : getRuntime().newFixnum(result); }
| 3,236,556
|
public UIComponent getEditContainer() { WFResourceUtil localizer = WFResourceUtil.getResourceUtilArticle(); String ref = ARTICLE_ITEM_BEAN_ID + ".";// String bref = WFPage.CONTENT_BUNDLE + "."; WFContainer mainContainer = new WFContainer(); mainContainer.setId(ARTICLE_EDITOR_ID); WFErrorMessages em = new WFErrorMessages(); em.addErrorMessage(HEADLINE_ID); em.addErrorMessage(TEASER_ID);// em.addErrorMessage(PUBLISHED_FROM_DATE_ID);// em.addErrorMessage(PUBLISHED_TO_DATE_ID); em.addErrorMessage(SAVE_ID); mainContainer.add(em); HtmlPanelGrid p = WFPanelUtil.getPlainFormPanel(2); p.getChildren().add(WFUtil.group(localizer.getTextVB("headline"), WFUtil.getText(":")));// p.getChildren().add(WFUtil.group(WFUtil.getTextVB(bref + "language"), WFUtil.getText(":"))); HtmlInputText headlineInput = WFUtil.getInputText(HEADLINE_ID, ref + "headline"); headlineInput.setSize(40); p.getChildren().add(headlineInput); //HtmlSelectOneMenu localeMenu = WFUtil.getSelectOneMenu(LOCALE_ID, ref + "allLocales", ref + "pendingLocaleId"); //localeMenu.setOnchange("document.forms[0].submit();"); //p.getChildren().add(localeMenu); p.getChildren().add(WFUtil.group(localizer.getTextVB("teaser"), WFUtil.getText(":"))); HtmlInputTextarea teaserArea = WFUtil.getTextArea(TEASER_ID, ref + "teaser", "440px", "30px"); p.getChildren().add(teaserArea); p.getChildren().add(WFUtil.group(localizer.getTextVB("author"), WFUtil.getText(":"))); HtmlInputText authorInput = WFUtil.getInputText(AUTHOR_ID, ref + "author"); authorInput.setSize(22); p.getChildren().add(authorInput); p.getChildren().add(WFUtil.group(localizer.getTextVB("body"), WFUtil.getText(":"))); HTMLArea bodyArea = WFUtil.getHtmlAreaTextArea(BODY_ID, ref + "body", "100%", "400px"); bodyArea.addPlugin(HTMLArea.PLUGIN_TABLE_OPERATIONS); bodyArea.addPlugin(HTMLArea.PLUGIN_DYNAMIC_CSS, "3"); bodyArea.addPlugin(HTMLArea.PLUGIN_CSS, "3"); bodyArea.addPlugin(HTMLArea.PLUGIN_CONTEXT_MENU); bodyArea.addPlugin(HTMLArea.PLUGIN_LIST_TYPE); bodyArea.addPlugin(HTMLArea.PLUGIN_CHARACTER_MAP); bodyArea.setAllowFontSelection(false); HtmlCommandButton editButton = localizer.getButtonVB(EDIT_HTML_ID, "edit", this); editButton.setOnclick("wurl='htmlarea/webface/htmledit.jsp?" + PREVIEW_ARTICLE_ITEM_ID + "='+this.tabindex;window.open(wurl,'Edit','height=450,width=600,resizable=yes,status=no,toolbar=no,menubar=no,location=no,scrollbars=no');return false;"); p.getChildren().add(WFUtil.group(WFUtil.group(bodyArea, WFUtil.getBreak()), editButton));/* WFContainer imageContainer = new WFContainer(); imageContainer.add(WFUtil.getButtonVB(ADD_IMAGE_ID, bref + "add_image", this)); imageContainer.add(WFUtil.getBreak()); imageContainer.add(getImageList()); p.getChildren().add(imageContainer); p.getChildren().add(WFUtil.group(WFUtil.getTextVB(bref + "source"), WFUtil.getText(":"))); p.getChildren().add(WFUtil.group(WFUtil.getTextVB(bref + "main_category"), WFUtil.getText(":"))); HtmlInputTextarea sourceArea = WFUtil.getTextArea(SOURCE_ID, ref + "source", "440px", "30px"); p.getChildren().add(sourceArea); HtmlSelectOneMenu mainCategoryMenu = WFUtil.getSelectOneMenu(MAIN_CATEGORY_ID, ref + "categories", ref + "mainCategoryId"); p.getChildren().add(mainCategoryMenu); */// mainContainer.add(p);// mainContainer.add(WFUtil.getBreak()); p.getChildren().add(WFUtil.getBreak()); p.getChildren().add(WFUtil.getBreak()); // p = WFPanelUtil.getPlainFormPanel(1);/* p.getChildren().add(WFUtil.group(WFUtil.getHeaderTextVB(bref + "created"), WFUtil.getTextVB(ref + "creationDate") ));*/// p.getChildren().add(WFUtil.getText(" "));// UIComponent t = WFUtil.group(localizer.getHeaderTextVB("status"), WFUtil.getText(": "));// t.getChildren().add(WFUtil.getTextVB(ref + "status"));// p.getChildren().add(t); p.getChildren().add(WFUtil.group(localizer.getTextVB("status"), WFUtil.getText(":"))); p.getChildren().add(WFUtil.getTextVB(ref + "status")); p.getChildren().add(WFUtil.group(localizer.getTextVB("current_version"), WFUtil.getText(":"))); p.getChildren().add(WFUtil.getTextVB(ref + "versionId"));// p.getChildren().add(WFUtil.getText(" "));// p.getChildren().add(WFUtil.group(localizer.getHeaderTextVB("current_version"), // WFUtil.getTextVB(ref + "versionId")// )); // mainContainer.add(p); p.getChildren().add(WFUtil.getBreak()); p.getChildren().add(WFUtil.getBreak()); // p = WFPanelUtil.getFormPanel(2); p.getChildren().add(WFUtil.group(localizer.getTextVB("comment"), WFUtil.getText(":")));// p.getChildren().add(WFUtil.group(WFUtil.getTextVB(bref + "attachments"), WFUtil.getText(":"))); HtmlInputTextarea commentArea = WFUtil.getTextArea(COMMENT_ID, ref + "comment", "400px", "60px"); p.getChildren().add(commentArea);// WFContainer attachmentContainer = new WFContainer();// attachmentContainer.add(WFUtil.getButtonVB(ADD_ATTACHMENT_ID, bref + "add_attachment", this));// attachmentContainer.add(WFUtil.getBreak());// attachmentContainer.add(getAttachmentList());// p.getChildren().add(attachmentContainer); // mainContainer.add(p); // p = WFPanelUtil.getFormPanel(1);// p.getChildren().add(WFUtil.group(WFUtil.getTextVB(bref + "related_content_items"), WFUtil.getText(":"))); // WFContainer contentItemContainer = new WFContainer(); // contentItemContainer.add(WFUtil.getButtonVB(ADD_RELATED_CONTENT_ITEM_ID, bref + "add_content_item", this));// contentItemContainer.add(WFUtil.getBreak());// contentItemContainer.add(getRelatedContentItemsList());// p.getChildren().add(contentItemContainer);// p.getChildren().add(WFUtil.group(WFUtil.getTextVB(bref + "publishing_date"), WFUtil.getText(":"))); // WFDateInput publishedFromInput = WFUtil.getDateInput(PUBLISHED_FROM_DATE_ID, ref + "case.publishedFromDate");// publishedFromInput.setShowTime(true);// p.getChildren().add(publishedFromInput);// p.getChildren().add(WFUtil.group(WFUtil.getTextVB(bref + "expiration_date"), WFUtil.getText(":"))); // WFDateInput publishedToInput = WFUtil.getDateInput(PUBLISHED_TO_DATE_ID, ref + "case.publishedToDate");// publishedToInput.setShowTime(true);// p.getChildren().add(publishedToInput); // mainContainer.add(p); p.getChildren().add(WFUtil.getBreak()); p.getChildren().add(WFUtil.getBreak());// mainContainer.add(WFUtil.getBreak());// p = WFPanelUtil.getPlainFormPanel(1);// HtmlCommandButton editCategoriesButton = WFUtil.getButtonVB(EDIT_CATEGORIES_ID, bref + "edit_categories", this);// p.getChildren().add(editCategoriesButton); p.getChildren().add(WFUtil.group(localizer.getTextVB("folder"), WFUtil.getText(":"))); HtmlInputText folderInput = WFUtil.getInputText(FOLDER_ID, ref + "folderLocation"); String folder = folderInput.getValue().toString(); if(null==folderInput.getValue() || "".equals(folderInput.getValue())) { folderInput.setValue(ContentUtil.ARTICLE_PATH); } folderInput.setSize(40); p.getChildren().add(folderInput); p.getChildren().add(WFUtil.getBreak()); p.getChildren().add(WFUtil.getBreak()); p.getChildren().add(WFUtil.getBreak());// WFComponentSelector cs = new WFComponentSelector();// cs.setId(BUTTON_SELECTOR_ID);// cs.setDividerText(" "); HtmlCommandButton saveButton = localizer.getButtonVB(SAVE_ID, "save", this);// HtmlCommandButton saveButton = WFUtil.getButtonVB(SAVE_ID, WFPage.CONTENT_BUNDLE + "save", this);// cs.add(saveButton);// cs.add(WFUtil.getButtonVB(FOR_REVIEW_ID, bref + "for_review", this));// cs.add(WFUtil.getButtonVB(PUBLISH_ID, bref + "publish", this));// cs.add(WFUtil.getButtonVB(REWRITE_ID, bref + "rewrite", this));// cs.add(WFUtil.getButtonVB(REJECT_ID, bref + "reject", this));// cs.add(WFUtil.getButtonVB(DELETE_ID, bref + "delete", this));// cs.add(WFUtil.getButtonVB(CANCEL_ID, bref + "cancel", this));// cs.setSelectedId(CANCEL_ID, true);// p.getChildren().add(cs); p.getChildren().add(saveButton); mainContainer.add(p); WFComponentSelector editorSelector = new WFComponentSelector(); editorSelector.setId(EDITOR_SELECTOR_ID); editorSelector.add(mainContainer); editorSelector.add(getCategoryEditContainer());// FileUploadForm f = new FileUploadForm(this, FILE_UPLOAD_ID, FILE_UPLOAD_CANCEL_ID); FileUploadForm f = new FileUploadForm(); f.setId(FILE_UPLOAD_FORM_ID); editorSelector.add(f); editorSelector.add(getRelatedContentItemsContainer()); editorSelector.setSelectedId(ARTICLE_EDITOR_ID, true); return editorSelector; }
|
public UIComponent getEditContainer() { WFResourceUtil localizer = WFResourceUtil.getResourceUtilArticle(); String ref = ARTICLE_ITEM_BEAN_ID + ".";// String bref = WFPage.CONTENT_BUNDLE + "."; WFContainer mainContainer = new WFContainer(); mainContainer.setId(ARTICLE_EDITOR_ID); WFErrorMessages em = new WFErrorMessages(); em.addErrorMessage(HEADLINE_ID); em.addErrorMessage(TEASER_ID);// em.addErrorMessage(PUBLISHED_FROM_DATE_ID);// em.addErrorMessage(PUBLISHED_TO_DATE_ID); em.addErrorMessage(SAVE_ID); mainContainer.add(em); HtmlPanelGrid p = WFPanelUtil.getPlainFormPanel(2); p.getChildren().add(WFUtil.group(localizer.getTextVB("headline"), WFUtil.getText(":")));// p.getChildren().add(WFUtil.group(WFUtil.getTextVB(bref + "language"), WFUtil.getText(":"))); HtmlInputText headlineInput = WFUtil.getInputText(HEADLINE_ID, ref + "headline"); headlineInput.setSize(40); p.getChildren().add(headlineInput); //HtmlSelectOneMenu localeMenu = WFUtil.getSelectOneMenu(LOCALE_ID, ref + "allLocales", ref + "pendingLocaleId"); //localeMenu.setOnchange("document.forms[0].submit();"); //p.getChildren().add(localeMenu); p.getChildren().add(WFUtil.group(localizer.getTextVB("teaser"), WFUtil.getText(":"))); HtmlInputTextarea teaserArea = WFUtil.getTextArea(TEASER_ID, ref + "teaser", "440px", "30px"); p.getChildren().add(teaserArea); p.getChildren().add(WFUtil.group(localizer.getTextVB("author"), WFUtil.getText(":"))); HtmlInputText authorInput = WFUtil.getInputText(AUTHOR_ID, ref + "author"); authorInput.setSize(22); p.getChildren().add(authorInput); p.getChildren().add(WFUtil.group(localizer.getTextVB("body"), WFUtil.getText(":"))); HTMLArea bodyArea = WFUtil.getHtmlAreaTextArea(BODY_ID, ref + "body", "100%", "400px"); bodyArea.addPlugin(HTMLArea.PLUGIN_TABLE_OPERATIONS); bodyArea.addPlugin(HTMLArea.PLUGIN_DYNAMIC_CSS, "3"); bodyArea.addPlugin(HTMLArea.PLUGIN_CSS, "3"); bodyArea.addPlugin(HTMLArea.PLUGIN_CONTEXT_MENU); bodyArea.addPlugin(HTMLArea.PLUGIN_LIST_TYPE); bodyArea.addPlugin(HTMLArea.PLUGIN_CHARACTER_MAP); bodyArea.setAllowFontSelection(false); HtmlCommandButton editButton = localizer.getButtonVB(EDIT_HTML_ID, "edit", this); editButton.setOnclick("wurl='htmlarea/webface/htmledit.jsp?" + PREVIEW_ARTICLE_ITEM_ID + "='+this.tabindex;window.open(wurl,'Edit','height=450,width=600,resizable=yes,status=no,toolbar=no,menubar=no,location=no,scrollbars=no');return false;"); p.getChildren().add(WFUtil.group(WFUtil.group(bodyArea, WFUtil.getBreak()), editButton));/* WFContainer imageContainer = new WFContainer(); imageContainer.add(WFUtil.getButtonVB(ADD_IMAGE_ID, bref + "add_image", this)); imageContainer.add(WFUtil.getBreak()); imageContainer.add(getImageList()); p.getChildren().add(imageContainer); p.getChildren().add(WFUtil.group(WFUtil.getTextVB(bref + "source"), WFUtil.getText(":"))); p.getChildren().add(WFUtil.group(WFUtil.getTextVB(bref + "main_category"), WFUtil.getText(":"))); HtmlInputTextarea sourceArea = WFUtil.getTextArea(SOURCE_ID, ref + "source", "440px", "30px"); p.getChildren().add(sourceArea); HtmlSelectOneMenu mainCategoryMenu = WFUtil.getSelectOneMenu(MAIN_CATEGORY_ID, ref + "categories", ref + "mainCategoryId"); p.getChildren().add(mainCategoryMenu); */// mainContainer.add(p);// mainContainer.add(WFUtil.getBreak()); p.getChildren().add(WFUtil.getBreak()); p.getChildren().add(WFUtil.getBreak()); // p = WFPanelUtil.getPlainFormPanel(1);/* p.getChildren().add(WFUtil.group(WFUtil.getHeaderTextVB(bref + "created"), WFUtil.getTextVB(ref + "creationDate") ));*/// p.getChildren().add(WFUtil.getText(" "));// UIComponent t = WFUtil.group(localizer.getHeaderTextVB("status"), WFUtil.getText(": "));// t.getChildren().add(WFUtil.getTextVB(ref + "status"));// p.getChildren().add(t); p.getChildren().add(WFUtil.group(localizer.getTextVB("status"), WFUtil.getText(":"))); p.getChildren().add(WFUtil.getTextVB(ref + "status")); p.getChildren().add(WFUtil.group(localizer.getTextVB("current_version"), WFUtil.getText(":"))); p.getChildren().add(WFUtil.getTextVB(ref + "versionId"));// p.getChildren().add(WFUtil.getText(" "));// p.getChildren().add(WFUtil.group(localizer.getHeaderTextVB("current_version"), // WFUtil.getTextVB(ref + "versionId")// )); // mainContainer.add(p); p.getChildren().add(WFUtil.getBreak()); p.getChildren().add(WFUtil.getBreak()); // p = WFPanelUtil.getFormPanel(2); p.getChildren().add(WFUtil.group(localizer.getTextVB("comment"), WFUtil.getText(":")));// p.getChildren().add(WFUtil.group(WFUtil.getTextVB(bref + "attachments"), WFUtil.getText(":"))); HtmlInputTextarea commentArea = WFUtil.getTextArea(COMMENT_ID, ref + "comment", "400px", "60px"); p.getChildren().add(commentArea);// WFContainer attachmentContainer = new WFContainer();// attachmentContainer.add(WFUtil.getButtonVB(ADD_ATTACHMENT_ID, bref + "add_attachment", this));// attachmentContainer.add(WFUtil.getBreak());// attachmentContainer.add(getAttachmentList());// p.getChildren().add(attachmentContainer); // mainContainer.add(p); // p = WFPanelUtil.getFormPanel(1);// p.getChildren().add(WFUtil.group(WFUtil.getTextVB(bref + "related_content_items"), WFUtil.getText(":"))); // WFContainer contentItemContainer = new WFContainer(); // contentItemContainer.add(WFUtil.getButtonVB(ADD_RELATED_CONTENT_ITEM_ID, bref + "add_content_item", this));// contentItemContainer.add(WFUtil.getBreak());// contentItemContainer.add(getRelatedContentItemsList());// p.getChildren().add(contentItemContainer);// p.getChildren().add(WFUtil.group(WFUtil.getTextVB(bref + "publishing_date"), WFUtil.getText(":"))); // WFDateInput publishedFromInput = WFUtil.getDateInput(PUBLISHED_FROM_DATE_ID, ref + "case.publishedFromDate");// publishedFromInput.setShowTime(true);// p.getChildren().add(publishedFromInput);// p.getChildren().add(WFUtil.group(WFUtil.getTextVB(bref + "expiration_date"), WFUtil.getText(":"))); // WFDateInput publishedToInput = WFUtil.getDateInput(PUBLISHED_TO_DATE_ID, ref + "case.publishedToDate");// publishedToInput.setShowTime(true);// p.getChildren().add(publishedToInput); // mainContainer.add(p); p.getChildren().add(WFUtil.getBreak()); p.getChildren().add(WFUtil.getBreak());// mainContainer.add(WFUtil.getBreak());// p = WFPanelUtil.getPlainFormPanel(1);// HtmlCommandButton editCategoriesButton = WFUtil.getButtonVB(EDIT_CATEGORIES_ID, bref + "edit_categories", this);// p.getChildren().add(editCategoriesButton); p.getChildren().add(WFUtil.group(localizer.getTextVB("folder"), WFUtil.getText(":"))); HtmlInputText folderInput = WFUtil.getInputText(FOLDER_ID, ref + "folderLocation"); String folder = folderInput.getValue().toString(); if(null==folderInput.getValue() || "".equals(folderInput.getValue())) { folderInput.setValue(ContentUtil.ARTICLE_PATH); } folderInput.setSize(40); p.getChildren().add(folderInput); p.getChildren().add(WFUtil.getBreak()); p.getChildren().add(WFUtil.getBreak()); p.getChildren().add(WFUtil.getBreak());// WFComponentSelector cs = new WFComponentSelector();// cs.setId(BUTTON_SELECTOR_ID);// cs.setDividerText(" "); HtmlCommandButton saveButton = localizer.getButtonVB(SAVE_ID, "save", this);// HtmlCommandButton saveButton = WFUtil.getButtonVB(SAVE_ID, WFPage.CONTENT_BUNDLE + "save", this);// cs.add(saveButton);// cs.add(WFUtil.getButtonVB(FOR_REVIEW_ID, bref + "for_review", this));// cs.add(WFUtil.getButtonVB(PUBLISH_ID, bref + "publish", this));// cs.add(WFUtil.getButtonVB(REWRITE_ID, bref + "rewrite", this));// cs.add(WFUtil.getButtonVB(REJECT_ID, bref + "reject", this));// cs.add(WFUtil.getButtonVB(DELETE_ID, bref + "delete", this));// cs.add(WFUtil.getButtonVB(CANCEL_ID, bref + "cancel", this));// cs.setSelectedId(CANCEL_ID, true);// p.getChildren().add(cs); p.getChildren().add(saveButton); mainContainer.add(p); WFComponentSelector editorSelector = new WFComponentSelector(); editorSelector.setId(EDITOR_SELECTOR_ID); editorSelector.add(mainContainer); editorSelector.add(getCategoryEditContainer());// FileUploadForm f = new FileUploadForm(this, FILE_UPLOAD_ID, FILE_UPLOAD_CANCEL_ID); FileUploadForm f = new FileUploadForm(); f.setId(FILE_UPLOAD_FORM_ID); editorSelector.add(f); editorSelector.add(getRelatedContentItemsContainer()); editorSelector.setSelectedId(ARTICLE_EDITOR_ID, true); return editorSelector; }
| 3,236,558
|
public IRubyObject rbClone() { RubyRegexp newObj = new RubyRegexp(getRuntime()); newObj.pattern = pattern; newObj.code = code; initCopy(newObj); return newObj; }
|
public IRubyObject rbClone() { RubyRegexp newObj = new RubyRegexp(getRuntime()); newObj.pattern = pattern; newObj.code = code; newObj.setTaint(isTaint()); newObj.initCopy(this); newObj.setFrozen(isFrozen()); return newObj; }
| 3,236,559
|
public void testObjectNameCreation() { String beanName = "foobar"; assertTrue(factory.containsBeanDefinition(beanName)); BeanDefinition beanDefinition = factory.getBeanDefinition(beanName); assertNotNull(beanDefinition); assertFalse(beanDefinition.getPropertyValues().contains("gbean-objectName")); // convert properties into named constructor args List metadataProviders = new ArrayList(2); metadataProviders.add(new PropertiesMetadataProvider()); MetadataManager metadataManager = new SimpleMetadataManager(metadataProviders); ObjectNameBuilder objectNameBuilder = new ObjectNameBuilder(metadataManager, "domain", "server", "application"); objectNameBuilder.postProcessBeanFactory(factory); ObjectName objectName = ServiceName.createName("domain:J2EEServer=server,J2EEApplication=application,name=" + beanName); objectNameBuilder.postProcessBeanFactory(factory); assertFalse(beanDefinition.getPropertyValues().contains("gbean-objectName")); assertEquals(objectName, objectNameBuilder.getObjectName(beanName)); }
|
public void testObjectNameCreation() { String beanName = "foobar"; assertTrue(factory.containsBeanDefinition(beanName)); BeanDefinition beanDefinition = factory.getBeanDefinition(beanName); assertNotNull(beanDefinition); assertFalse(beanDefinition.getPropertyValues().contains("gbean-objectName")); // convert properties into named constructor args List metadataProviders = new ArrayList(2); metadataProviders.add(new PropertiesMetadataProvider()); MetadataManager metadataManager = new SimpleMetadataManager(metadataProviders); ObjectNameBuilder objectNameBuilder = new ObjectNameBuilder(metadataManager, "domain", "server", "module"); objectNameBuilder.postProcessBeanFactory(factory); ObjectName objectName = ServiceName.createName("domain:J2EEServer=server,J2EEApplication=application,name=" + beanName); objectNameBuilder.postProcessBeanFactory(factory); assertFalse(beanDefinition.getPropertyValues().contains("gbean-objectName")); assertEquals(objectName, objectNameBuilder.getObjectName(beanName)); }
| 3,236,560
|
public void testObjectNameCreation() { String beanName = "foobar"; assertTrue(factory.containsBeanDefinition(beanName)); BeanDefinition beanDefinition = factory.getBeanDefinition(beanName); assertNotNull(beanDefinition); assertFalse(beanDefinition.getPropertyValues().contains("gbean-objectName")); // convert properties into named constructor args List metadataProviders = new ArrayList(2); metadataProviders.add(new PropertiesMetadataProvider()); MetadataManager metadataManager = new SimpleMetadataManager(metadataProviders); ObjectNameBuilder objectNameBuilder = new ObjectNameBuilder(metadataManager, "domain", "server", "application"); objectNameBuilder.postProcessBeanFactory(factory); ObjectName objectName = ServiceName.createName("domain:J2EEServer=server,J2EEApplication=application,name=" + beanName); objectNameBuilder.postProcessBeanFactory(factory); assertFalse(beanDefinition.getPropertyValues().contains("gbean-objectName")); assertEquals(objectName, objectNameBuilder.getObjectName(beanName)); }
|
public void testObjectNameCreation() { String beanName = "foobar"; assertTrue(factory.containsBeanDefinition(beanName)); BeanDefinition beanDefinition = factory.getBeanDefinition(beanName); assertNotNull(beanDefinition); assertFalse(beanDefinition.getPropertyValues().contains("gbean-objectName")); // convert properties into named constructor args List metadataProviders = new ArrayList(2); metadataProviders.add(new PropertiesMetadataProvider()); MetadataManager metadataManager = new SimpleMetadataManager(metadataProviders); ObjectNameBuilder objectNameBuilder = new ObjectNameBuilder(metadataManager, "domain", "server", "application"); objectNameBuilder.postProcessBeanFactory(factory); ObjectName objectName = ServiceName.createName("domain:J2EEServer=server,J2EEApplication=null,J2EEModule=module,name=" + beanName); objectNameBuilder.postProcessBeanFactory(factory); assertFalse(beanDefinition.getPropertyValues().contains("gbean-objectName")); assertEquals(objectName, objectNameBuilder.getObjectName(beanName)); }
| 3,236,561
|
public void pop() { iter = prev.iter; prev = prev.prev; }
|
public void pop() { iter = prev.iter; prev = prev.prev; }
| 3,236,563
|
public void push(int newIter) { prev = new RubyIter(iter, prev); iter = newIter; }
|
public void push(int newIter) { prev = new RubyIter(iter, prev); iter = newIter; }
| 3,236,564
|
public void setIter(int iter) { this.iter = iter; }
|
public void setIter(int iter) { this.iter = iter; }
| 3,236,565
|
public void setLeaves(Set leaves);
|
public void setLeaves(Set leaves);
| 3,236,567
|
public Ignore createIgnore() { ignoreRegex = new Ignore(); return ignoreRegex; }
|
public Ignore createIgnore() { ignoreRegex = new Ignore(); return ignoreRegex; }
| 3,236,568
|
public void execute() throws BuildException { CommandLineBuilder builder = null; try { builder = new CommandLineBuilder(); if (dataFile != null) builder.addArg("--datafile", dataFile); if (toDir != null) builder.addArg("--destination", toDir.getAbsolutePath()); // ignoreRegex.setRegex() is never called, but that's ok // because ant sets it somehow, I think if (ignoreRegex != null) builder.addArg("--ignore", ignoreRegex.getRegex()); createArgumentsForFilesets(builder); builder.saveArgs(); } catch (IOException ioe) { getProject().log("Error creating commands file.", Project.MSG_ERR); throw new BuildException("Unable to create the commands file.", ioe); } // Execute GPL licensed code in separate virtual machine getJava().createArg().setValue("--commandsfile"); getJava().createArg().setValue(builder.getCommandLineFile()); if (getJava().executeJava() != 0) { throw new BuildException( "Error instrumenting classes. See messages above."); } builder.dispose(); }
|
public void execute() throws BuildException { CommandLineBuilder builder = null; try { builder = new CommandLineBuilder(); if (dataFile != null) builder.addArg("--datafile", dataFile); if (toDir != null) builder.addArg("--destination", toDir.getAbsolutePath()); // ignoreRegex.setRegex() is never called, but that's ok // because ant sets it somehow, I think if (ignoreRegex != null) builder.addArg("--ignore", ignoreRegex.getRegex()); createArgumentsForFilesets(builder); builder.saveArgs(); } catch (IOException ioe) { getProject().log("Error creating commands file.", Project.MSG_ERR); throw new BuildException("Unable to create the commands file.", ioe); } // Execute GPL licensed code in separate virtual machine getJava().createArg().setValue("--commandsfile"); getJava().createArg().setValue(builder.getCommandLineFile()); if (getJava().executeJava() != 0) { throw new BuildException( "Error instrumenting classes. See messages above."); } builder.dispose(); }
| 3,236,569
|
private UIComponent getMetadataPanel() { String path = (String)WFUtil.invoke(ARTICLE_ITEM_BEAN_ID, "getFolderLocation"); String fileName = (String)WFUtil.invoke(ARTICLE_ITEM_BEAN_ID, "getHeadline");// System.out.println("path = "+path+"/"+fileName+".xml"); WebDAVMetadata metadataUI = new WebDAVMetadata(path+"/"+fileName+".xml"); return metadataUI; }
|
private UIComponent getMetadataPanel() { String path = (String)WFUtil.invoke(ARTICLE_ITEM_BEAN_ID, "getFolderLocation"); String fileName = (String)WFUtil.invoke(ARTICLE_ITEM_BEAN_ID, "getHeadline");// System.out.println("path = "+path+"/"+fileName+".xml"); WebDAVMetadata metadataUI = new WebDAVMetadata(path+"/"+fileName+".xml"); return metadataUI; }
| 3,236,571
|
private UIComponent getMetadataPanel() { String path = (String)WFUtil.invoke(ARTICLE_ITEM_BEAN_ID, "getFolderLocation"); String fileName = (String)WFUtil.invoke(ARTICLE_ITEM_BEAN_ID, "getHeadline");// System.out.println("path = "+path+"/"+fileName+".xml"); WebDAVMetadata metadataUI = new WebDAVMetadata(path+"/"+fileName+".xml"); return metadataUI; }
|
private UIComponent getMetadataPanel() { String path = (String)WFUtil.invoke(ARTICLE_ITEM_BEAN_ID, "getFolderLocation"); String fileName = (String)WFUtil.invoke(ARTICLE_ITEM_BEAN_ID, "getHeadline");// System.out.println("path = "+path+"/"+fileName+".xml"); WebDAVMetadata metadataUI = new WebDAVMetadata(path+"/"+fileName+".xml"); return metadataUI; }
| 3,236,572
|
public RubyArray(final Ruby ruby, final ArrayList list) { super(ruby, ruby.getClasses().getArrayClass()); this.list = list; }
|
public RubyArray(final Ruby ruby, final ArrayList list) { super(ruby, ruby.getClasses().getArrayClass()); this.list = list; }
| 3,236,573
|
public boolean load(String file) { Library library = null; for (int i = 0; i < suffixes.length; i++) { library = findLibrary(file + suffixes[i]); if (library != null) { break; } } if (library == null) { throw new LoadError(runtime, "No such file to load -- " + file); } try { library.load(runtime); } catch (IOException e) { throw new LoadError(runtime, "IO error -- " + file); } return true; }
|
public void load(String file) { Library library = null; for (int i = 0; i < suffixes.length; i++) { library = findLibrary(file + suffixes[i]); if (library != null) { break; } } if (library == null) { throw new LoadError(runtime, "No such file to load -- " + file); } try { library.load(runtime); } catch (IOException e) { throw new LoadError(runtime, "IO error -- " + file); } return true; }
| 3,236,574
|
public boolean load(String file) { Library library = null; for (int i = 0; i < suffixes.length; i++) { library = findLibrary(file + suffixes[i]); if (library != null) { break; } } if (library == null) { throw new LoadError(runtime, "No such file to load -- " + file); } try { library.load(runtime); } catch (IOException e) { throw new LoadError(runtime, "IO error -- " + file); } return true; }
|
public boolean load(String file) { Library library = null; for (int i = 0; i < suffixes.length; i++) { library = findLibrary(file + suffixes[i]); if (library != null) { break; } } if (library == null) { throw new LoadError(runtime, "No such file to load -- " + file); } try { library.load(runtime); } catch (IOException e) { throw new LoadError(runtime, "IO error -- " + file); } }
| 3,236,575
|
public boolean require(String file) { RubyString name = runtime.newString(file); if (loadedFeatures.contains(name)) { return false; } loadedFeatures.add(name); if (load(file)) { return true; } loadedFeatures.remove(name); return false; }
|
public boolean require(String file) { RubyString name = runtime.newString(file); if (loadedFeatures.contains(name)) { return false; } loadedFeatures.add(name); if (load(file)) { return true; } loadedFeatures.remove(name); return false; }
| 3,236,576
|
public boolean require(String file) { RubyString name = runtime.newString(file); if (loadedFeatures.contains(name)) { return false; } loadedFeatures.add(name); if (load(file)) { return true; } loadedFeatures.remove(name); return false; }
|
public boolean require(String file) { RubyString name = runtime.newString(file); if (loadedFeatures.contains(name)) { return false; } loadedFeatures.add(name); if (load(file)) { return true; } loadedFeatures.remove(name); return false; }
| 3,236,577
|
protected void makeBoundedCameraMotion(PCamera c, double deltaX, double deltaY) { PBounds pBounds = c.getViewBounds(); Rectangle2D rBounds = pBounds.getBounds2D(); double wOffset = activeRegion.getX(); double nOffset = activeRegion.getY(); double eOffset = activeRegion.getX()+activeRegion.getWidth(); double sOffset = activeRegion.getY()+activeRegion.getHeight(); double cWest = rBounds.getX(); double cNorth = rBounds.getY(); double cEast = rBounds.getX()+rBounds.getWidth(); double cSouth = rBounds.getY()+rBounds.getHeight(); double fdX = 0; double fdY = 0; // check horizontal panning bounds if((-deltaX+cWest < wOffset) || (-deltaX+cEast > eOffset)) { fdX = 0; } else { fdX = deltaX; } // check vertical panning bounds if((-deltaY+cNorth < nOffset) || (-deltaY+cSouth > sOffset)) { fdY = 0; } else { fdY = deltaY; } c.translateView(fdX,fdY); c.repaint(); }
|
protected void makeBoundedCameraMotion(PCamera c, double deltaX, double deltaY) { PBounds pBounds = c.getViewBounds(); Rectangle2D rBounds = pBounds.getBounds2D(); double wOffset = activeRegion.getX(); double nOffset = activeRegion.getY(); double eOffset = activeRegion.getX()+activeRegion.getWidth(); double sOffset = activeRegion.getY()+activeRegion.getHeight(); double cWest = rBounds.getX(); double cNorth = rBounds.getY(); double cEast = rBounds.getX()+rBounds.getWidth(); double cSouth = rBounds.getY()+rBounds.getHeight(); double fdX = 0; double fdY = 0; // check horizontal panning bounds if(((-deltaX+cWest < wOffset) || (-deltaX+cEast > eOffset)) { fdX = 0; } else { fdX = deltaX; } // check vertical panning bounds if((-deltaY+cNorth < nOffset) || (-deltaY+cSouth > sOffset)) { fdY = 0; } else { fdY = deltaY; } c.translateView(fdX,fdY); c.repaint(); }
| 3,236,579
|
protected void makeBoundedCameraMotion(PCamera c, double deltaX, double deltaY) { PBounds pBounds = c.getViewBounds(); Rectangle2D rBounds = pBounds.getBounds2D(); double wOffset = activeRegion.getX(); double nOffset = activeRegion.getY(); double eOffset = activeRegion.getX()+activeRegion.getWidth(); double sOffset = activeRegion.getY()+activeRegion.getHeight(); double cWest = rBounds.getX(); double cNorth = rBounds.getY(); double cEast = rBounds.getX()+rBounds.getWidth(); double cSouth = rBounds.getY()+rBounds.getHeight(); double fdX = 0; double fdY = 0; // check horizontal panning bounds if((-deltaX+cWest < wOffset) || (-deltaX+cEast > eOffset)) { fdX = 0; } else { fdX = deltaX; } // check vertical panning bounds if((-deltaY+cNorth < nOffset) || (-deltaY+cSouth > sOffset)) { fdY = 0; } else { fdY = deltaY; } c.translateView(fdX,fdY); c.repaint(); }
|
protected void makeBoundedCameraMotion(PCamera c, double deltaX, double deltaY) { PBounds pBounds = c.getViewBounds(); Rectangle2D rBounds = pBounds.getBounds2D(); double wOffset = activeRegion.getX(); double nOffset = activeRegion.getY(); double eOffset = activeRegion.getX()+activeRegion.getWidth(); double sOffset = activeRegion.getY()+activeRegion.getHeight(); double cWest = rBounds.getX(); double cNorth = rBounds.getY(); double cEast = rBounds.getX()+rBounds.getWidth(); double cSouth = rBounds.getY()+rBounds.getHeight(); double if(-deltaX+cWest < wOffset) { fdX = -wOffset; } else if(-deltaX+cEast > eOffset) { fdX = -(eOffset-cEast); } double fdY = 0; // check horizontal panning bounds if((-deltaX+cWest < wOffset) || (-deltaX+cEast > eOffset)) { if(-deltaX+cWest < wOffset) { fdX = -wOffset; } else if(-deltaX+cEast > eOffset) { fdX = -(eOffset-cEast); } } else { fdX = deltaX; } // check vertical panning bounds if((-deltaY+cNorth < nOffset) || (-deltaY+cSouth > sOffset)) { fdY = 0; } else { fdY = deltaY; } c.translateView(fdX,fdY); c.repaint(); }
| 3,236,580
|
protected void makeBoundedCameraMotion(PCamera c, double deltaX, double deltaY) { PBounds pBounds = c.getViewBounds(); Rectangle2D rBounds = pBounds.getBounds2D(); double wOffset = activeRegion.getX(); double nOffset = activeRegion.getY(); double eOffset = activeRegion.getX()+activeRegion.getWidth(); double sOffset = activeRegion.getY()+activeRegion.getHeight(); double cWest = rBounds.getX(); double cNorth = rBounds.getY(); double cEast = rBounds.getX()+rBounds.getWidth(); double cSouth = rBounds.getY()+rBounds.getHeight(); double fdX = 0; double fdY = 0; // check horizontal panning bounds if((-deltaX+cWest < wOffset) || (-deltaX+cEast > eOffset)) { fdX = 0; } else { fdX = deltaX; } // check vertical panning bounds if((-deltaY+cNorth < nOffset) || (-deltaY+cSouth > sOffset)) { fdY = 0; } else { fdY = deltaY; } c.translateView(fdX,fdY); c.repaint(); }
|
protected void makeBoundedCameraMotion(PCamera c, double deltaX, double deltaY) { PBounds pBounds = c.getViewBounds(); Rectangle2D rBounds = pBounds.getBounds2D(); double wOffset = activeRegion.getX(); double nOffset = activeRegion.getY(); double eOffset = activeRegion.getX()+activeRegion.getWidth(); double sOffset = activeRegion.getY()+activeRegion.getHeight(); double cWest = rBounds.getX(); double cNorth = rBounds.getY(); double cEast = rBounds.getX()+rBounds.getWidth(); double cSouth = rBounds.getY()+rBounds.getHeight(); double fdX = 0; double fdY = 0; // check horizontal panning bounds if((-deltaX+cWest < wOffset) || (-deltaX+cEast > eOffset)) { fdX = 0; } else { fdX = deltaX; } // check vertical panning bounds if(((-deltaY+cNorth < nOffset) || (-deltaY+cSouth > sOffset)) { fdY = 0; } else { fdY = deltaY; } c.translateView(fdX,fdY); c.repaint(); }
| 3,236,581
|
protected void makeBoundedCameraMotion(PCamera c, double deltaX, double deltaY) { PBounds pBounds = c.getViewBounds(); Rectangle2D rBounds = pBounds.getBounds2D(); double wOffset = activeRegion.getX(); double nOffset = activeRegion.getY(); double eOffset = activeRegion.getX()+activeRegion.getWidth(); double sOffset = activeRegion.getY()+activeRegion.getHeight(); double cWest = rBounds.getX(); double cNorth = rBounds.getY(); double cEast = rBounds.getX()+rBounds.getWidth(); double cSouth = rBounds.getY()+rBounds.getHeight(); double fdX = 0; double fdY = 0; // check horizontal panning bounds if((-deltaX+cWest < wOffset) || (-deltaX+cEast > eOffset)) { fdX = 0; } else { fdX = deltaX; } // check vertical panning bounds if((-deltaY+cNorth < nOffset) || (-deltaY+cSouth > sOffset)) { fdY = 0; } else { fdY = deltaY; } c.translateView(fdX,fdY); c.repaint(); }
|
protected void makeBoundedCameraMotion(PCamera c, double deltaX, double deltaY) { PBounds pBounds = c.getViewBounds(); Rectangle2D rBounds = pBounds.getBounds2D(); double wOffset = activeRegion.getX(); double nOffset = activeRegion.getY(); double eOffset = activeRegion.getX()+activeRegion.getWidth(); double sOffset = activeRegion.getY()+activeRegion.getHeight(); double cWest = rBounds.getX(); double cNorth = rBounds.getY(); double cEast = rBounds.getX()+rBounds.getWidth(); double cSouth = rBounds.getY()+rBounds.getHeight(); double fdX = 0; double if(-deltaY+cNorth < nOffset) { fdY = nOffset; } else if(-deltaY+cSouth > sOffset) { if(nOffset > 0) { fdY = -(sOffset-cSouth); } } // check horizontal panning bounds if((-deltaX+cWest < wOffset) || (-deltaX+cEast > eOffset)) { fdX = 0; } else { fdX = deltaX; } // check vertical panning bounds if((-deltaY+cNorth < nOffset) || (-deltaY+cSouth > sOffset)) { if(-deltaY+cNorth < nOffset) { fdY = nOffset; } else if(-deltaY+cSouth > sOffset) { if(nOffset > 0) { fdY = -(sOffset-cSouth); } } } else { fdY = deltaY; } c.translateView(fdX,fdY); c.repaint(); }
| 3,236,582
|
protected void makeBoundedCameraMotion(PCamera c, double deltaX, double deltaY) { PBounds pBounds = c.getViewBounds(); Rectangle2D rBounds = pBounds.getBounds2D(); double wOffset = activeRegion.getX(); double nOffset = activeRegion.getY(); double eOffset = activeRegion.getX()+activeRegion.getWidth(); double sOffset = activeRegion.getY()+activeRegion.getHeight(); double cWest = rBounds.getX(); double cNorth = rBounds.getY(); double cEast = rBounds.getX()+rBounds.getWidth(); double cSouth = rBounds.getY()+rBounds.getHeight(); double fdX = 0; double fdY = 0; // check horizontal panning bounds if((-deltaX+cWest < wOffset) || (-deltaX+cEast > eOffset)) { fdX = 0; } else { fdX = deltaX; } // check vertical panning bounds if((-deltaY+cNorth < nOffset) || (-deltaY+cSouth > sOffset)) { fdY = 0; } else { fdY = deltaY; } c.translateView(fdX,fdY); c.repaint(); }
|
protected void makeBoundedCameraMotion(PCamera c, double deltaX, double deltaY) { PBounds pBounds = c.getViewBounds(); Rectangle2D rBounds = pBounds.getBounds2D(); double wOffset = activeRegion.getX(); double nOffset = activeRegion.getY(); double eOffset = activeRegion.getX()+activeRegion.getWidth(); double sOffset = activeRegion.getY()+activeRegion.getHeight(); double cWest = rBounds.getX(); double cNorth = rBounds.getY(); double cEast = rBounds.getX()+rBounds.getWidth(); double cSouth = rBounds.getY()+rBounds.getHeight(); double fdX = 0; double fdY = 0; // check horizontal panning bounds if((-deltaX+cWest < wOffset) || (-deltaX+cEast > eOffset)) { fdX = 0; } else { fdX = deltaX; } // check vertical panning bounds if((-deltaY+cNorth < nOffset) || (-deltaY+cSouth > sOffset)) { fdY = 0; } else { fdY = deltaY; } c.translateView(fdX,fdY); c.repaint(); }
| 3,236,583
|
protected void recalculatePanNodes() { for(Iterator iter = panNodeList.iterator(); iter.hasNext();) { camera.removeChild((PanCameraNode)iter.next()); } panNodeList.clear(); double netAmount = camera.localToView(new Point2D.Double(panSpeed,0)).getX(); PanCameraNode nwNode = new PanCameraNode(new Rectangle2D.Double(0,0, edgeDistance, edgeDistance), netAmount, netAmount); // make the happy fun activated arrow. GeneralPath arrow = new GeneralPath(); arrow.moveTo(5,5); arrow.lineTo(35,5); arrow.lineTo(5,35); arrow.closePath(); nwNode.setIndicatorShape(arrow); PanCameraNode nNode = new PanCameraNode(new Rectangle2D.Double( edgeDistance,0, cameraBounds.getWidth()- (edgeDistance*2), edgeDistance), 0, netAmount); arrow = new GeneralPath(); arrow.moveTo((float)cameraBounds.getCenterX(),5); arrow.lineTo((float)cameraBounds.getCenterX()-21,26); arrow.lineTo((float)cameraBounds.getCenterX()+21,26); arrow.closePath(); nNode.setIndicatorShape(arrow); PanCameraNode neNode = new PanCameraNode(new Rectangle2D.Double( (cameraBounds.getWidth()- edgeDistance),0, edgeDistance, edgeDistance), -netAmount, netAmount); arrow = new GeneralPath(); arrow.moveTo((float)cameraBounds.getWidth()-5,5); arrow.lineTo((float)cameraBounds.getWidth()-35,5); arrow.lineTo((float)cameraBounds.getWidth()-5,35); arrow.closePath(); neNode.setIndicatorShape(arrow); PanCameraNode eNode = new PanCameraNode(new Rectangle2D.Double( (cameraBounds.getWidth()- edgeDistance), edgeDistance, edgeDistance, cameraBounds.getHeight()- (edgeDistance*2)), -netAmount, 0); arrow = new GeneralPath(); arrow.moveTo((float)cameraBounds.getWidth()-5, (float)cameraBounds.getCenterY()); arrow.lineTo((float)cameraBounds.getWidth()-26, (float)cameraBounds.getCenterY()-21); arrow.lineTo((float)cameraBounds.getWidth()-26, (float)cameraBounds.getCenterY()+21); arrow.closePath(); eNode.setIndicatorShape(arrow); PanCameraNode seNode = new PanCameraNode(new Rectangle2D.Double( (cameraBounds.getWidth()- edgeDistance), (cameraBounds.getHeight()- edgeDistance), edgeDistance, edgeDistance), -netAmount, -netAmount); arrow = new GeneralPath(); arrow.moveTo((float)cameraBounds.getWidth()-5, (float)cameraBounds.getHeight()-5); arrow.lineTo((float)cameraBounds.getWidth()-35, (float)cameraBounds.getHeight()-5); arrow.lineTo((float)cameraBounds.getWidth()-5, (float)cameraBounds.getHeight()-35); arrow.closePath(); seNode.setIndicatorShape(arrow); PanCameraNode sNode = new PanCameraNode(new Rectangle2D.Double( edgeDistance, (cameraBounds.getHeight()- edgeDistance), (cameraBounds.getWidth()- edgeDistance*2), edgeDistance), 0, -netAmount); arrow = new GeneralPath(); arrow.moveTo((float)cameraBounds.getCenterX(), (float)cameraBounds.getHeight()-5); arrow.lineTo((float)cameraBounds.getCenterX()-21, (float)cameraBounds.getHeight()-26); arrow.lineTo((float)cameraBounds.getCenterX()+21, (float)cameraBounds.getHeight()-26); arrow.closePath(); sNode.setIndicatorShape(arrow); PanCameraNode swNode = new PanCameraNode(new Rectangle2D.Double(0, (cameraBounds.getHeight()- edgeDistance), edgeDistance, edgeDistance), netAmount, -netAmount); arrow = new GeneralPath(); arrow.moveTo(5,(float)cameraBounds.getHeight()-5); arrow.lineTo(5,(float)cameraBounds.getHeight()-35); arrow.lineTo(35,(float)cameraBounds.getHeight()-5); arrow.closePath(); swNode.setIndicatorShape(arrow); PanCameraNode wNode = new PanCameraNode(new Rectangle2D.Double(0, edgeDistance, edgeDistance, (cameraBounds.getHeight()- edgeDistance*2)), netAmount, 0); arrow = new GeneralPath(); arrow.moveTo(5,(float)cameraBounds.getCenterY()); arrow.lineTo(26,(float)cameraBounds.getCenterY()-21); arrow.lineTo(26,(float)cameraBounds.getCenterY()+21); arrow.closePath(); wNode.setIndicatorShape(arrow); panNodeList.add(nwNode); panNodeList.add(nNode); panNodeList.add(neNode); panNodeList.add(eNode); panNodeList.add(seNode); panNodeList.add(sNode); panNodeList.add(swNode); panNodeList.add(wNode); for(Iterator iter = panNodeList.iterator(); iter.hasNext();) { camera.addChild(0,(PanCameraNode)iter.next()); } }
|
protected void recalculatePanNodes() { for(Iterator iter = panNodeList.iterator(); iter.hasNext();) { camera.removeChild((PanCameraNode)iter.next()); } panNodeList.clear(); double netAmount = camera.localToView(new Point2D.Double(panSpeed,0)).getX(); PanCameraNode nwNode = new PanCameraNode(new Rectangle2D.Double(0,0, edgeDistance, edgeDistance), netAmount, netAmount); // make the happy fun activated arrow. GeneralPath arrow = new GeneralPath(); arrow.moveTo(5,5); arrow.lineTo(35,5); arrow.lineTo(5,35); arrow.closePath(); nwNode.setIndicatorShape(arrow); PanCameraNode nNode = new PanCameraNode(new Rectangle2D.Double( edgeDistance,0, cameraBounds.getWidth()- (edgeDistance*2), edgeDistance), 0, netAmount); arrow = new GeneralPath(); arrow.moveTo((float)cameraBounds.getCenterX(),5); arrow.lineTo((float)cameraBounds.getCenterX()-21,26); arrow.lineTo((float)cameraBounds.getCenterX()+21,26); arrow.closePath(); nNode.setIndicatorShape(arrow); PanCameraNode neNode = new PanCameraNode(new Rectangle2D.Double( (cameraBounds.getWidth()- edgeDistance),0, edgeDistance, edgeDistance), -netAmount, netAmount); arrow = new GeneralPath(); arrow.moveTo((float)cameraBounds.getWidth()-5,5); arrow.lineTo((float)cameraBounds.getWidth()-35,5); arrow.lineTo((float)cameraBounds.getWidth()-5,35); arrow.closePath(); neNode.setIndicatorShape(arrow); PanCameraNode eNode = new PanCameraNode(new Rectangle2D.Double( (cameraBounds.getWidth()- edgeDistance), edgeDistance, edgeDistance, cameraBounds.getHeight()- (edgeDistance*2)), -netAmount, 0); arrow = new GeneralPath(); arrow.moveTo((float)cameraBounds.getWidth()-5, (float)cameraBounds.getCenterY()); arrow.lineTo((float)cameraBounds.getWidth()-26, (float)cameraBounds.getCenterY()-21); arrow.lineTo((float)cameraBounds.getWidth()-26, (float)cameraBounds.getCenterY()+21); arrow.closePath(); eNode.setIndicatorShape(arrow); PanCameraNode seNode = new PanCameraNode(new Rectangle2D.Double( (cameraBounds.getWidth()- edgeDistance), (cameraBounds.getHeight()- edgeDistance), edgeDistance, edgeDistance), -netAmount, -netAmount); arrow = new GeneralPath(); arrow.moveTo((float)cameraBounds.getWidth()-5, (float)cameraBounds.getHeight()-5); arrow.lineTo((float)cameraBounds.getWidth()-35, (float)cameraBounds.getHeight()-5); arrow.lineTo((float)cameraBounds.getWidth()-5, (float)cameraBounds.getHeight()-35); arrow.closePath(); seNode.setIndicatorShape(arrow); PanCameraNode sNode = new PanCameraNode(new Rectangle2D.Double( edgeDistance, (cameraBounds.getHeight()- edgeDistance), (cameraBounds.getWidth()- edgeDistance*2), edgeDistance), 0, -netAmount); arrow = new GeneralPath(); arrow.moveTo((float)cameraBounds.getCenterX(), (float)cameraBounds.getHeight()-5); arrow.lineTo((float)cameraBounds.getCenterX()-21, (float)cameraBounds.getHeight()-26); arrow.lineTo((float)cameraBounds.getCenterX()+21, (float)cameraBounds.getHeight()-26); arrow.closePath(); sNode.setIndicatorShape(arrow); PanCameraNode swNode = new PanCameraNode(new Rectangle2D.Double(0, (cameraBounds.getHeight()- edgeDistance), edgeDistance, edgeDistance), netAmount, -netAmount); arrow = new GeneralPath(); arrow.moveTo(5,(float)cameraBounds.getHeight()-5); arrow.lineTo(5,(float)cameraBounds.getHeight()-35); arrow.lineTo(35,(float)cameraBounds.getHeight()-5); arrow.closePath(); swNode.setIndicatorShape(arrow); PanCameraNode wNode = new PanCameraNode(new Rectangle2D.Double(0, edgeDistance, edgeDistance, (cameraBounds.getHeight()- edgeDistance*2)), netAmount, 0); arrow = new GeneralPath(); arrow.moveTo(5,(float)cameraBounds.getCenterY()); arrow.lineTo(26,(float)cameraBounds.getCenterY()-21); arrow.lineTo(26,(float)cameraBounds.getCenterY()+21); arrow.closePath(); wNode.setIndicatorShape(arrow); panNodeList.add(nwNode); panNodeList.add(nNode); panNodeList.add(neNode); panNodeList.add(eNode); panNodeList.add(seNode); panNodeList.add(sNode); panNodeList.add(swNode); panNodeList.add(wNode); for(Iterator iter = panNodeList.iterator(); iter.hasNext();) { camera.addChild(0,(PanCameraNode)iter.next()); } }
| 3,236,584
|
public boolean load(WebdavExtendedResource webdavResource) throws IOException { XMLParser builder = new XMLParser(); XMLDocument bodyDoc = null; try { WebdavResource theArticle = null; if(webdavResource.isCollection()){ IWContext iwc = IWContext.getInstance(); WebdavResources resources = webdavResource.getChildResources(); String userLanguageArticleName = getArticleName(iwc.getCurrentLocale()); String systemLanguageArticleName = getArticleName(iwc.getIWMainApplication().getDefaultLocale()); if(resources.isThereResourceName(userLanguageArticleName)){ //the language that the user has selected theArticle = resources.getResource(userLanguageArticleName); } else if(resources.isThereResourceName(systemLanguageArticleName)){ //the language that is default for the system theArticle = resources.getResource(systemLanguageArticleName); } else { // take the first language Enumeration en = resources.getResources(); if(en.hasMoreElements()){ theArticle = (WebdavResource)en.nextElement(); } } } else { theArticle = webdavResource; } if(theArticle!=null && !theArticle.isCollection()){ setArticleResourcePath(theArticle.getPath()); bodyDoc = builder.parse(new ByteArrayInputStream(theArticle.getMethodDataAsString().getBytes())); } else { bodyDoc = null; } } catch (XMLException e) { e.printStackTrace(); //To change body of catch statement use File | Settings | File Templates. } if(bodyDoc!=null){ XMLElement rootElement = bodyDoc.getRootElement(); try { XMLElement language = rootElement.getChild(FIELDNAME_CONTENT_LANGUAGE,idegaXMLNameSpace); if(language != null){ setContentLanguage(language.getText()); } else { setContentLanguage(null); } }catch(Exception e) { setContentLanguage(null); } try { XMLElement headline = rootElement.getChild(FIELDNAME_HEADLINE,idegaXMLNameSpace); if(headline != null){ setHeadline(headline.getText()); } else { setHeadline(""); } }catch(Exception e) { //Nullpointer could occur if field isn't used e.printStackTrace(); setHeadline(""); } try { XMLElement teaser = rootElement.getChild(FIELDNAME_TEASER,idegaXMLNameSpace); if(teaser != null){ setTeaser(teaser.getText()); } else { setTeaser(""); } }catch(Exception e) { //Nullpointer could occur if field isn't used e.printStackTrace(); setTeaser(""); } try { XMLElement author = rootElement.getChild(FIELDNAME_AUTHOR,idegaXMLNameSpace); if(author != null){ setAuthor(author.getText()); } else { setAuthor(""); } }catch(Exception e) { //Nullpointer could occur if field isn't used e.printStackTrace(); setAuthor(""); } //Parse out the body try { XMLNamespace htmlNamespace = new XMLNamespace("http://www.w3.org/1999/xhtml"); XMLElement bodyElement = rootElement.getChild(FIELDNAME_BODY,idegaXMLNameSpace); XMLElement htmlElement = bodyElement.getChild("html",htmlNamespace); XMLElement htmlBodyElement = htmlElement.getChild("body",htmlNamespace); String bodyValue = new XMLOutput().outputString(htmlBodyElement); // System.out.println("htmlBody value= "+bodyValue); setBody(bodyValue); }catch(Exception e) { //Nullpointer could occur if field isn't used // e.printStackTrace(); Logger log = Logger.getLogger(this.getClass().toString()); log.warning("Body of article is empty"); setBody(""); } try { XMLElement source = rootElement.getChild(FIELDNAME_SOURCE,idegaXMLNameSpace); if(source != null){ setSource(source.getText()); } else { setSource(""); } }catch(Exception e) { //Nullpointer could occur if field isn't used setSource(""); } try { XMLElement comment = rootElement.getChild(FIELDNAME_ARTICLE_COMMENT,idegaXMLNameSpace); if(comment != null){ setComment(comment.getText()); } else { setComment(""); } }catch(Exception e) { //Nullpointer could occur if field isn't used e.printStackTrace(); setComment(""); } } else { //article not found Logger log = Logger.getLogger(this.getClass().toString()); log.warning("Article xml file was not found"); setRendered(false); return false; } return true;// setFilename();// setFolderLocation(bodyElement.getChild(FIELDNAME_FOLDER_LOCATION,idegans).getText()); }
|
public boolean load(WebdavExtendedResource webdavResource) throws IOException { XMLParser builder = new XMLParser(); XMLDocument bodyDoc = null; try { WebdavResource theArticle = null; if(webdavResource.isCollection()){ IWContext iwc = IWContext.getInstance(); WebdavResources resources = webdavResource.getChildResources(); String userLanguageArticleName = getArticleName(iwc.getCurrentLocale()); String systemLanguageArticleName = getArticleName(iwc.getIWMainApplication().getDefaultLocale()); if(resources.isThereResourceName(userLanguageArticleName)){ //the language that the user has selected theArticle = resources.getResource(userLanguageArticleName); } else if(resources.isThereResourceName(systemLanguageArticleName)){ //the language that is default for the system theArticle = resources.getResource(systemLanguageArticleName); } else { // take the first language Enumeration en = resources.getResources(); if(en.hasMoreElements()){ theArticle = (WebdavResource)en.nextElement(); } } } else { theArticle = webdavResource; } if(theArticle!=null && !theArticle.isCollection()){ setArticleResourcePath(theArticle.getPath()); bodyDoc = builder.parse(new ByteArrayInputStream(theArticle.getMethodDataAsString().getBytes())); } else { bodyDoc = null; } } catch (XMLException e) { e.printStackTrace(); //To change body of catch statement use File | Settings | File Templates. } if(bodyDoc!=null){ XMLElement rootElement = bodyDoc.getRootElement(); try { XMLElement language = rootElement.getChild(FIELDNAME_CONTENT_LANGUAGE,idegaXMLNameSpace); if(language != null){ setContentLanguage(language.getText()); } else { setContentLanguage(null); } }catch(Exception e) { setContentLanguage(null); } try { XMLElement headline = rootElement.getChild(FIELDNAME_HEADLINE,idegaXMLNameSpace); if(headline != null){ setHeadline(headline.getText()); } else { setHeadline(""); } }catch(Exception e) { //Nullpointer could occur if field isn't used e.printStackTrace(); setHeadline(""); } try { XMLElement teaser = rootElement.getChild(FIELDNAME_TEASER,idegaXMLNameSpace); if(teaser != null){ setTeaser(teaser.getText()); } else { setTeaser(""); } }catch(Exception e) { //Nullpointer could occur if field isn't used e.printStackTrace(); setTeaser(""); } try { XMLElement author = rootElement.getChild(FIELDNAME_AUTHOR,idegaXMLNameSpace); if(author != null){ setAuthor(author.getText()); } else { setAuthor(""); } }catch(Exception e) { //Nullpointer could occur if field isn't used e.printStackTrace(); setAuthor(""); } //Parse out the body try { XMLNamespace htmlNamespace = new XMLNamespace("http://www.w3.org/1999/xhtml"); XMLElement bodyElement = rootElement.getChild(FIELDNAME_BODY,idegaXMLNameSpace); XMLElement htmlElement = bodyElement.getChild("html",htmlNamespace); XMLElement htmlBodyElement = htmlElement.getChild("body",htmlNamespace); String bodyValue = new XMLOutput().outputString(htmlBodyElement); // System.out.println("htmlBody value= "+bodyValue); setBody(bodyValue); }catch(Exception e) { //Nullpointer could occur if field isn't used // e.printStackTrace(); Logger log = Logger.getLogger(this.getClass().toString()); log.warning("Body of article is empty"); setBody(""); } try { XMLElement source = rootElement.getChild(FIELDNAME_SOURCE,idegaXMLNameSpace); if(source != null){ setSource(source.getText()); } else { setSource(""); } }catch(Exception e) { //Nullpointer could occur if field isn't used setSource(""); } try { XMLElement comment = rootElement.getChild(FIELDNAME_ARTICLE_COMMENT,idegaXMLNameSpace); if(comment != null){ setComment(comment.getText()); } else { setComment(""); } }catch(Exception e) { //Nullpointer could occur if field isn't used e.printStackTrace(); setComment(""); } } else { //article not found Logger log = Logger.getLogger(this.getClass().toString()); log.warning("Article xml file was not found"); setRendered(false); return false; } return true;// setFilename();// setFolderLocation(bodyElement.getChild(FIELDNAME_FOLDER_LOCATION,idegans).getText()); }
| 3,236,586
|
public void store() throws IDOStoreException{ boolean storeOk = true; clearErrorKeys(); if (getHeadline().trim().equals("")) { addErrorKey(KEY_ERROR_HEADLINE_EMPTY); storeOk = false; }// if (getBody().trim().equals("")) {// addErrorKey(KEY_ERROR_BODY_EMPTY);// storeOk = false;// } // if (getRequestedStatus() != null && getRequestedStatus().equals(ContentItemCase.STATUS_PUBLISHED)) {// if (getCase().getPublishedFromDate() == null) {// addErrorKey(KEY_ERROR_PUBLISHED_FROM_DATE_EMPTY);// storeOk = false;// }// } // String filename = getHeadline();// if(null==filename || filename.length()==0) {// filename = "empty";// } if(storeOk){ try { IWUserContext iwuc = IWContext.getInstance(); IWSlideSession session = (IWSlideSession)IBOLookup.getSessionInstance(iwuc,IWSlideSession.class); WebdavRootResource rootResource = session.getWebdavRootResource(); //Setting the path for creating new file/creating localized version/updating existing file String filePath=getResourcePath(); String articleFolderPath=getArticlePath(); if(articleFolderPath!=null) { filePath=articleFolderPath+"/"+getArticleName(); }else { filePath=getArticleResourcePath(); articleFolderPath = getArticlePath(); } boolean hadToCreate = session.createAllFoldersInPath(articleFolderPath); if(hadToCreate){ String fixedFolderURL = session.getURI(articleFolderPath); rootResource.proppatchMethod(fixedFolderURL,PROPERTY_CONTENT_TYPE,"LocalizedFile",true); } else{ rootResource.proppatchMethod(articleFolderPath,PROPERTY_CONTENT_TYPE,"LocalizedFile",true); } String article = getAsXML(); // System.out.println(article); //Conflict fix: uri for creating but path for updating //Note! This is a patch to what seems to be a bug in WebDav //Apparently in verion below works in some cases and the other in other cases. //Seems to be connected to creating files in folders created in same tomcat session or similar //not quite clear... if(rootResource.putMethod(filePath,article)){ rootResource.proppatchMethod(filePath,PROPERTY_CONTENT_TYPE,ARTICLE_FILENAME_SCOPE,true); } else{ String fixedURL = session.getURI(filePath); rootResource.putMethod(fixedURL,article); rootResource.proppatchMethod(fixedURL,PROPERTY_CONTENT_TYPE,ARTICLE_FILENAME_SCOPE,true); } rootResource.close(); try { load(filePath); } catch (Exception e) { e.printStackTrace(); } } catch (IOException e1) { storeOk = false; e1.printStackTrace(); } catch (XMLException e) { storeOk = false; e.printStackTrace(); } } if (storeOk) { if (getRequestedStatus() != null) { setStatus(getRequestedStatus()); setRequestedStatus(null); } }else { throw new ArticleStoreException(); } }
|
public void store() throws IDOStoreException{ boolean storeOk = true; clearErrorKeys(); if (getHeadline().trim().equals("")) { addErrorKey(KEY_ERROR_HEADLINE_EMPTY); storeOk = false; }// if (getBody().trim().equals("")) {// addErrorKey(KEY_ERROR_BODY_EMPTY);// storeOk = false;// } // if (getRequestedStatus() != null && getRequestedStatus().equals(ContentItemCase.STATUS_PUBLISHED)) {// if (getCase().getPublishedFromDate() == null) {// addErrorKey(KEY_ERROR_PUBLISHED_FROM_DATE_EMPTY);// storeOk = false;// }// } // String filename = getHeadline();// if(null==filename || filename.length()==0) {// filename = "empty";// } if(storeOk){ try { IWUserContext iwuc = IWContext.getInstance(); IWSlideSession session = (IWSlideSession)IBOLookup.getSessionInstance(iwuc,IWSlideSession.class); WebdavRootResource rootResource = session.getWebdavRootResource(); //Setting the path for creating new file/creating localized version/updating existing file String filePath=getResourcePath(); String articleFolderPath=getArticlePath(); if(articleFolderPath!=null) { filePath=articleFolderPath+"/"+getArticleName(); }else { filePath=getArticleResourcePath(); articleFolderPath = getArticlePath(); } boolean hadToCreate = session.createAllFoldersInPath(articleFolderPath); if(hadToCreate){ String fixedFolderURL = session.getURI(articleFolderPath); rootResource.proppatchMethod(fixedFolderURL,PROPERTY_CONTENT_TYPE,"LocalizedFile",true); } else{ rootResource.proppatchMethod(articleFolderPath,PROPERTY_CONTENT_TYPE,"LocalizedFile",true); } String article = getAsXML(); // System.out.println(article); //Conflict fix: uri for creating but path for updating //Note! This is a patch to what seems to be a bug in WebDav //Apparently in verion below works in some cases and the other in other cases. //Seems to be connected to creating files in folders created in same tomcat session or similar //not quite clear... if(rootResource.putMethod(filePath,article)){ rootResource.proppatchMethod(filePath,PROPERTY_CONTENT_TYPE,ARTICLE_FILENAME_SCOPE,true); } else{ String fixedURL = session.getURI(filePath); rootResource.putMethod(fixedURL,article); rootResource.proppatchMethod(fixedURL,PROPERTY_CONTENT_TYPE,ARTICLE_FILENAME_SCOPE,true); } rootResource.close(); try { load(filePath); } catch (Exception e) { e.printStackTrace(); } } catch (IOException e1) { storeOk = false; e1.printStackTrace(); } catch (XMLException e) { storeOk = false; e.printStackTrace(); } } if (storeOk) { if (getRequestedStatus() != null) { setStatus(getRequestedStatus()); setRequestedStatus(null); } }else { throw new ArticleStoreException(); } }
| 3,236,587
|
public void store() throws IDOStoreException{ boolean storeOk = true; clearErrorKeys(); if (getHeadline().trim().equals("")) { addErrorKey(KEY_ERROR_HEADLINE_EMPTY); storeOk = false; }// if (getBody().trim().equals("")) {// addErrorKey(KEY_ERROR_BODY_EMPTY);// storeOk = false;// } // if (getRequestedStatus() != null && getRequestedStatus().equals(ContentItemCase.STATUS_PUBLISHED)) {// if (getCase().getPublishedFromDate() == null) {// addErrorKey(KEY_ERROR_PUBLISHED_FROM_DATE_EMPTY);// storeOk = false;// }// } // String filename = getHeadline();// if(null==filename || filename.length()==0) {// filename = "empty";// } if(storeOk){ try { IWUserContext iwuc = IWContext.getInstance(); IWSlideSession session = (IWSlideSession)IBOLookup.getSessionInstance(iwuc,IWSlideSession.class); WebdavRootResource rootResource = session.getWebdavRootResource(); //Setting the path for creating new file/creating localized version/updating existing file String filePath=getResourcePath(); String articleFolderPath=getArticlePath(); if(articleFolderPath!=null) { filePath=articleFolderPath+"/"+getArticleName(); }else { filePath=getArticleResourcePath(); articleFolderPath = getArticlePath(); } boolean hadToCreate = session.createAllFoldersInPath(articleFolderPath); if(hadToCreate){ String fixedFolderURL = session.getURI(articleFolderPath); rootResource.proppatchMethod(fixedFolderURL,PROPERTY_CONTENT_TYPE,"LocalizedFile",true); } else{ rootResource.proppatchMethod(articleFolderPath,PROPERTY_CONTENT_TYPE,"LocalizedFile",true); } String article = getAsXML(); // System.out.println(article); //Conflict fix: uri for creating but path for updating //Note! This is a patch to what seems to be a bug in WebDav //Apparently in verion below works in some cases and the other in other cases. //Seems to be connected to creating files in folders created in same tomcat session or similar //not quite clear... if(rootResource.putMethod(filePath,article)){ rootResource.proppatchMethod(filePath,PROPERTY_CONTENT_TYPE,ARTICLE_FILENAME_SCOPE,true); } else{ String fixedURL = session.getURI(filePath); rootResource.putMethod(fixedURL,article); rootResource.proppatchMethod(fixedURL,PROPERTY_CONTENT_TYPE,ARTICLE_FILENAME_SCOPE,true); } rootResource.close(); try { load(filePath); } catch (Exception e) { e.printStackTrace(); } } catch (IOException e1) { storeOk = false; e1.printStackTrace(); } catch (XMLException e) { storeOk = false; e.printStackTrace(); } } if (storeOk) { if (getRequestedStatus() != null) { setStatus(getRequestedStatus()); setRequestedStatus(null); } }else { throw new ArticleStoreException(); } }
|
public void store() throws IDOStoreException{ boolean storeOk = true; clearErrorKeys(); if (getHeadline().trim().equals("")) { addErrorKey(KEY_ERROR_HEADLINE_EMPTY); storeOk = false; }// if (getBody().trim().equals("")) {// addErrorKey(KEY_ERROR_BODY_EMPTY);// storeOk = false;// } // if (getRequestedStatus() != null && getRequestedStatus().equals(ContentItemCase.STATUS_PUBLISHED)) {// if (getCase().getPublishedFromDate() == null) {// addErrorKey(KEY_ERROR_PUBLISHED_FROM_DATE_EMPTY);// storeOk = false;// }// } // String filename = getHeadline();// if(null==filename || filename.length()==0) {// filename = "empty";// } if(storeOk){ try { IWUserContext iwuc = IWContext.getInstance(); IWSlideSession session = (IWSlideSession)IBOLookup.getSessionInstance(iwuc,IWSlideSession.class); WebdavRootResource rootResource = session.getWebdavRootResource(); //Setting the path for creating new file/creating localized version/updating existing file String filePath=getResourcePath(); String articleFolderPath=getArticlePath(); if(articleFolderPath!=null) { filePath=articleFolderPath+"/"+getArticleName(); }else { filePath=getArticleResourcePath(); articleFolderPath = getArticlePath(); } boolean hadToCreate = session.createAllFoldersInPath(articleFolderPath); if(hadToCreate){ String fixedFolderURL = session.getURI(articleFolderPath); rootResource.proppatchMethod(fixedFolderURL,PROPERTY_CONTENT_TYPE,"LocalizedFile",true); } else{ rootResource.proppatchMethod(articleFolderPath,PROPERTY_CONTENT_TYPE,"LocalizedFile",true); } String article = getAsXML(); // System.out.println(article); //Conflict fix: uri for creating but path for updating //Note! This is a patch to what seems to be a bug in WebDav //Apparently in verion below works in some cases and the other in other cases. //Seems to be connected to creating files in folders created in same tomcat session or similar //not quite clear... if(rootResource.putMethod(filePath,article)){ rootResource.proppatchMethod(filePath,PROPERTY_CONTENT_TYPE,ARTICLE_FILENAME_SCOPE,true); } else{ String fixedURL = session.getURI(filePath); rootResource.putMethod(fixedURL,article); rootResource.proppatchMethod(fixedURL,PROPERTY_CONTENT_TYPE,ARTICLE_FILENAME_SCOPE,true); } rootResource.close(); try { load(filePath); } catch (Exception e) { e.printStackTrace(); } } catch (IOException e1) { storeOk = false; e1.printStackTrace(); } catch (XMLException e) { storeOk = false; e.printStackTrace(); } } if (storeOk) { if (getRequestedStatus() != null) { setStatus(getRequestedStatus()); setRequestedStatus(null); } }else { throw new ArticleStoreException(); } }
| 3,236,588
|
public FlowGraphNode makeAbslocNode(Object ident, Type typ, SootMethod enclosingMethod) { return null; }
|
public FlowGraphNode makeAbslocNode(Object ident, Type typ, SootMethod enclosingMethod) { FlowGraphNode result = (FlowGraphNode)identToAbslocMap.get(ident); if (result == null) { identToAbslocMap.put(ident, result = new AbslocNode(ident.toString(), type)); } return result; }
| 3,236,589
|
public FlowGraphNode makeFieldRefNode(FlowGraphNode base, SootField field, SootMethod method) { return null; }
|
public FlowGraphNode makeFieldRefNode(FlowGraphNode base, SootField field, SootMethod method) { return null; }
| 3,236,590
|
protected PropertyEditor createPropertyEditor(String propertyEditor) { ClassLoader cl = Thread.currentThread().getContextClassLoader(); if( cl==null ) { cl = XBeanXmlBeanDefinitionParser.class.getClassLoader(); } try { return (PropertyEditor)cl.loadClass(propertyEditor).newInstance(); } catch (Throwable e){ throw new IllegalArgumentException("Could not load property editor: "+propertyEditor, e); } }
|
protected PropertyEditor createPropertyEditor(String propertyEditor) { ClassLoader cl = Thread.currentThread().getContextClassLoader(); if( cl==null ) { cl = XBeanXmlBeanDefinitionParser.class.getClassLoader(); } try { return (PropertyEditor)cl.loadClass(propertyEditor).newInstance(); } catch (Throwable e){ throw (IllegalArgumentException)new IllegalArgumentException("Could not load property editor: "+propertyEditor).initCause(e); } }
| 3,236,591
|
private Ruby() { init(); }
|
private Ruby() { init(); }
| 3,236,592
|
public static IRuby getDefaultInstance() { return new Ruby(); }
|
public static IRuby getDefaultInstance() { return new Ruby(System.in, System.out, System.err); }
| 3,236,593
|
public Object getObject() { return object;; }
|
public Object getObject() { return object;; }
| 3,236,594
|
public void addNote(Event e) { NoteTreeNode parentTreeNode = dd.getTree().getSelectedNode(); Note parentNote = parentTreeNode.getDisplayedNote().getNote(); Note newNote = new Note("new", parentNote, ""); parentTreeNode.addChild(newNote); }
|
public void addNote(Event e) { NoteTreeNode parentTreeNode = dd.getTree().getSelectedNode(); Note parentNote = parentTreeNode.getDisplayedNote().getNote(); Note newNote = new Note("new", parentNote, ""); parentTreeNode.addChild(newNote); }
| 3,236,595
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.