📄 serqlparsertokenmanager.java
字号:
if (curChar == 13) jjstateSet[jjnewStateCnt++] = 3; break; case 5: case 30: if (curChar == 34) jjCheckNAddStates(3, 5); break; case 6: if ((0xfffffffbffffffffL & l) != 0L) jjCheckNAddStates(3, 5); break; case 7: if (curChar != 34) break; if (kind > 56) kind = 56; jjAddStates(9, 10); break; case 10: if (curChar == 45) jjstateSet[jjnewStateCnt++] = 11; break; case 13: if (curChar == 60) jjstateSet[jjnewStateCnt++] = 14; break; case 15: if ((0x3ff680000000000L & l) != 0L) jjAddStates(11, 12); break; case 16: if (curChar == 58) jjCheckNAdd(17); break; case 17: if ((0xbfffffffffffffffL & l) != 0L) jjCheckNAddTwoStates(17, 18); break; case 18: if (curChar == 62 && kind > 56) kind = 56; break; case 20: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(20, 21); break; case 21: if (curChar != 58) break; if (kind > 56) kind = 56; jjCheckNAdd(22); break; case 22: if ((0x3ff600000000000L & l) == 0L) break; if (kind > 56) kind = 56; jjCheckNAdd(22); break; case 24: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(24, 21); break; case 27: if (curChar == 9) jjCheckNAddStates(3, 5); break; case 28: if (curChar == 13) jjCheckNAddStates(3, 5); break; case 29: if (curChar == 10) jjCheckNAddStates(3, 5); break; case 33: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 34; break; case 34: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 35; break; case 35: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 36; break; case 36: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 37; break; case 37: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 39; break; case 39: case 44: if ((0x3ff000000000000L & l) != 0L) jjCheckNAdd(40); break; case 40: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 5); break; case 42: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 43; break; case 43: if ((0x3ff000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 44; break; case 45: if (curChar == 60) jjstateSet[jjnewStateCnt++] = 46; break; case 47: if ((0x3ff680000000000L & l) != 0L) jjAddStates(13, 14); break; case 48: if (curChar == 58) jjCheckNAdd(49); break; case 49: if ((0xbfffffffffffffffL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if (curChar == 62 && kind > 68) kind = 68; break; case 53: if ((0x3ff600000000000L & l) == 0L) break; if (kind > 70) kind = 70; jjstateSet[jjnewStateCnt++] = 53; break; case 55: if (curChar == 43) jjCheckNAdd(56); break; case 56: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 81) kind = 81; jjCheckNAdd(56); break; case 57: if (curChar == 45) jjCheckNAdd(58); break; case 58: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 82) kind = 82; jjCheckNAdd(58); break; case 59: if ((0x280000000000L & l) != 0L) jjCheckNAddTwoStates(60, 61); break; case 60: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(60, 61); break; case 61: if (curChar == 46) jjCheckNAdd(62); break; case 62: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 83) kind = 83; jjCheckNAdd(62); break; case 64: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(64, 65); break; case 65: if (curChar != 58) break; if (kind > 71) kind = 71; jjCheckNAdd(66); break; case 66: if ((0x3ff600000000000L & l) == 0L) break; if (kind > 71) kind = 71; jjCheckNAdd(66); break; case 67: if ((0x3ff600000000000L & l) == 0L) break; if (kind > 72) kind = 72; jjCheckNAdd(67); break; case 69: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(69, 65); break; case 70: if ((0x3ff600000000000L & l) == 0L) break; if (kind > 72) kind = 72; jjCheckNAdd(70); break; case 71: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 81) kind = 81; jjCheckNAddStates(0, 2); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 0: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 72) kind = 72; jjCheckNAddStates(15, 17); } else if (curChar == 95) jjCheckNAddTwoStates(69, 70); if (curChar == 95) jjstateSet[jjnewStateCnt++] = 51; break; case 72: if ((0x7fffffe87fffffeL & l) != 0L) { if (kind > 72) kind = 72; jjCheckNAdd(67); } if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(64, 65); break; case 51: if ((0x7fffffe87fffffeL & l) != 0L) { if (kind > 72) kind = 72; jjCheckNAdd(70); } if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(69, 65); break; case 1: if (kind > 5) kind = 5; jjAddStates(6, 8); break; case 6: if ((0xffffffffefffffffL & l) != 0L) jjCheckNAddStates(3, 5); break; case 8: if (curChar == 64) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 56) kind = 56; jjCheckNAddTwoStates(9, 10); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 56) kind = 56; jjCheckNAddTwoStates(10, 11); break; case 12: if (curChar == 94) jjAddStates(18, 20); break; case 14: case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: jjAddStates(21, 22); break; case 19: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(20, 21); break; case 20: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(20, 21); break; case 22: if ((0x7fffffe87fffffeL & l) == 0L) break; if (kind > 56) kind = 56; jjstateSet[jjnewStateCnt++] = 22; break; case 23: if (curChar == 95) jjCheckNAdd(24); break; case 24: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(24, 21); break; case 25: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 12; break; case 26: if (curChar == 92) jjAddStates(23, 29); break; case 31: if (curChar == 92) jjCheckNAddStates(3, 5); break; case 32: if ((0x20000000200000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 33; break; case 33: if ((0x7e0000007eL & l) != 0L) jjstateSet[jjnewStateCnt++] = 34; break; case 34: if ((0x7e0000007eL & l) != 0L) jjstateSet[jjnewStateCnt++] = 35; break; case 35: if ((0x7e0000007eL & l) != 0L) jjstateSet[jjnewStateCnt++] = 36; break; case 36: if ((0x7e0000007eL & l) != 0L) jjstateSet[jjnewStateCnt++] = 37; break; case 37: if ((0x7e0000007eL & l) != 0L) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0x7e0000007eL & l) != 0L) jjstateSet[jjnewStateCnt++] = 39; break; case 39: case 44: if ((0x7e0000007eL & l) != 0L) jjCheckNAdd(40); break; case 40: if ((0x7e0000007eL & l) != 0L) jjCheckNAddStates(3, 5); break; case 41: if ((0x20000000200000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 42; break; case 42: if ((0x7e0000007eL & l) != 0L) jjstateSet[jjnewStateCnt++] = 43; break; case 43: if ((0x7e0000007eL & l) != 0L) jjstateSet[jjnewStateCnt++] = 44; break; case 46: case 47: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(47, 48); break; case 49: jjAddStates(30, 31); break; case 52: case 53: if ((0x7fffffe87fffffeL & l) == 0L) break; if (kind > 70) kind = 70; jjCheckNAdd(53); break; case 54: if (curChar == 95) jjstateSet[jjnewStateCnt++] = 51; break; case 63: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 72) kind = 72; jjCheckNAddStates(15, 17); break; case 64: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(64, 65); break; case 66: if ((0x7fffffe87fffffeL & l) == 0L) break; if (kind > 71) kind = 71; jjstateSet[jjnewStateCnt++] = 66; break; case 67: if ((0x7fffffe87fffffeL & l) == 0L) break; if (kind > 72) kind = 72; jjCheckNAdd(67); break; case 68: if (curChar == 95) jjCheckNAddTwoStates(69, 70); break; case 69: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(69, 65); break; case 70: if ((0x7fffffe87fffffeL & l) == 0L) break; if (kind > 72) kind = 72; jjCheckNAdd(70); break; default : break; } } while(i != startsAt); } else {
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -