📄 standardtokenizertokenmanager.java
字号:
/* Generated By:JavaCC: Do not edit this line. StandardTokenizerTokenManager.java */package org.apache.lucene.analysis.standard;public class StandardTokenizerTokenManager implements StandardTokenizerConstants{ public java.io.PrintStream debugStream = System.out; public void setDebugStream(java.io.PrintStream ds) { debugStream = ds; }private final int jjMoveStringLiteralDfa0_0(){ return jjMoveNfa_0(0, 0);}private final void jjCheckNAdd(int state){ if (jjrounds[state] != jjround) { jjstateSet[jjnewStateCnt++] = state; jjrounds[state] = jjround; }}private final void jjAddStates(int start, int end){ do { jjstateSet[jjnewStateCnt++] = jjnextStates[start]; } while (start++ != end);}private final void jjCheckNAddTwoStates(int state1, int state2){ jjCheckNAdd(state1); jjCheckNAdd(state2);}private final void jjCheckNAddStates(int start, int end){ do { jjCheckNAdd(jjnextStates[start]); } while (start++ != end);}private final void jjCheckNAddStates(int start){ jjCheckNAdd(jjnextStates[start]); jjCheckNAdd(jjnextStates[start + 1]);}static final long[] jjbitVec0 = { 0x1ff0000000000000L, 0xffffffffffffc000L, 0xffffffffL, 0x600000000000000L};static final long[] jjbitVec2 = { 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL};static final long[] jjbitVec3 = { 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffL, 0x0L};static final long[] jjbitVec4 = { 0xffffffffffffffffL, 0xffffffffffffffffL, 0x0L, 0x0L};static final long[] jjbitVec5 = { 0x3fffffffffffL, 0x0L, 0x0L, 0x0L};static final long[] jjbitVec6 = { 0x1600L, 0x0L, 0x0L, 0x0L};static final long[] jjbitVec7 = { 0x0L, 0xffc000000000L, 0x0L, 0xffc000000000L};static final long[] jjbitVec8 = { 0x0L, 0x3ff00000000L, 0x0L, 0x3ff000000000000L};static final long[] jjbitVec9 = { 0x0L, 0xffc000000000L, 0x0L, 0xff8000000000L};static final long[] jjbitVec10 = { 0x0L, 0xffc000000000L, 0x0L, 0x0L};static final long[] jjbitVec11 = { 0x0L, 0x3ff0000L, 0x0L, 0x3ff0000L};static final long[] jjbitVec12 = { 0x0L, 0x3ffL, 0x0L, 0x0L};static final long[] jjbitVec13 = { 0xfffffffeL, 0x0L, 0x0L, 0x0L};static final long[] jjbitVec14 = { 0x0L, 0x0L, 0x0L, 0xff7fffffff7fffffL};private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 73; 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 0: if ((0x3ff000000000000L & l) != 0L) { if (kind > 1) kind = 1; jjCheckNAddStates(0, 17); } if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(18, 23); break; case 1: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(18, 23); break; case 2: case 39: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(2, 3); break; case 3: if ((0xf00000000000L & l) != 0L) jjCheckNAdd(4); break; case 4: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 7) kind = 7; jjCheckNAdd(4); break; case 5: case 48: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(5, 6); break; case 6: if ((0xf00000000000L & l) != 0L) jjCheckNAdd(7); break; case 7: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(7, 8); break; case 8: if ((0xf00000000000L & l) != 0L) jjCheckNAddTwoStates(9, 10); break; case 9: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(9, 10); break; case 10: case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 7) kind = 7; jjCheckNAddTwoStates(6, 11); break; case 12: case 61: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(12, 13); break; case 13: if ((0xf00000000000L & l) != 0L) jjCheckNAdd(14); break; case 14: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(14, 15); break; case 15: if ((0xf00000000000L & l) != 0L) jjCheckNAddTwoStates(16, 17); break; case 16: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(16, 17); break; case 17: case 18: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(18, 19); break; case 19: if ((0xf00000000000L & l) != 0L) jjCheckNAdd(20); break; case 20: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 7) kind = 7; jjCheckNAddTwoStates(15, 20); break; case 21: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 1) kind = 1; jjCheckNAddStates(0, 17); break; case 22: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 1) kind = 1; jjCheckNAdd(22); break; case 23: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(24, 26); break; case 24: if ((0x600000000000L & l) != 0L) jjCheckNAdd(25); break; case 25: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(27, 29); break; case 27: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(27, 28); break; case 28: if ((0x600000000000L & l) != 0L) jjCheckNAdd(29); break; case 29: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 5) kind = 5; jjCheckNAddTwoStates(28, 29); break; case 30: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(30, 31); break; case 31: if (curChar == 46) jjCheckNAdd(32); break; case 32: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 6) kind = 6; jjCheckNAddTwoStates(31, 32); break; case 33: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(33, 34); break; case 34: if ((0xf00000000000L & l) != 0L) jjCheckNAddTwoStates(35, 36); break; case 35: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(35, 36); break; case 36: case 37: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 7) kind = 7; jjCheckNAdd(37); break; case 38: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(38, 39); break; case 40: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if ((0xf00000000000L & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 42: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: case 44: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(44, 45); break; case 45: if ((0xf00000000000L & l) != 0L) jjCheckNAdd(46); break; case 46: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 7) kind = 7; jjCheckNAddTwoStates(41, 46); break; case 47: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(47, 48); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0xf00000000000L & l) != 0L) jjCheckNAddTwoStates(51, 52); break; case 51: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(51, 52); break; case 52: case 53: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(53, 54); break; case 54: if ((0xf00000000000L & l) != 0L) jjCheckNAdd(55); break; case 55: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(55, 56); break; case 56: if ((0xf00000000000L & l) != 0L) jjCheckNAddTwoStates(57, 58); break; case 57: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(57, 58); break; case 58: case 59: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 7) kind = 7; jjCheckNAddTwoStates(54, 59); break; case 60: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(60, 61); break; case 64: if (curChar == 39) jjstateSet[jjnewStateCnt++] = 65; break; case 67: if (curChar == 46) jjCheckNAdd(68); break; case 69: if (curChar != 46) break; if (kind > 3) kind = 3; jjCheckNAdd(68); break; case 71: if (curChar == 38) jjstateSet[jjnewStateCnt++] = 72; 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)
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -