📄 queryparsertokenmanager.java
字号:
/* Generated By:JavaCC: Do not edit this line. QueryParserTokenManager.java */
package org.apache.lucene.queryParser;
import java.util.Vector;
import java.io.*;
import org.apache.lucene.index.Term;
import org.apache.lucene.analysis.*;
import org.apache.lucene.search.*;
public class QueryParserTokenManager implements QueryParserConstants
{
public java.io.PrintStream debugStream = System.out;
public void setDebugStream(java.io.PrintStream ds) { debugStream = ds; }
private final int jjStopStringLiteralDfa_1(int pos, long active0){
switch (pos) {
default :
return -1;
}
}
private final int jjStartNfa_1(int pos, long active0){
return jjMoveNfa_1(jjStopStringLiteralDfa_1(pos, active0), pos + 1);
}
private final int jjStopAtPos(int pos, int kind)
{
jjmatchedKind = kind;
jjmatchedPos = pos;
return pos + 1;
}
private final int jjStartNfaWithStates_1(int pos, int kind, int state)
{
jjmatchedKind = kind;
jjmatchedPos = pos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return pos + 1; }
return jjMoveNfa_1(state, pos + 1);
}
private final int jjMoveStringLiteralDfa0_1()
{
switch(curChar)
{
case 40:
return jjStopAtPos(0, 12);
case 41:
return jjStopAtPos(0, 13);
case 43:
return jjStopAtPos(0, 10);
case 45:
return jjStopAtPos(0, 11);
case 58:
return jjStopAtPos(0, 14);
case 94:
return jjStopAtPos(0, 15);
case 126:
return jjStartNfaWithStates_1(0, 18, 18);
default :
return jjMoveNfa_1(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 = { 0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL};
static final long[] jjbitVec2 = { 0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL};
private final int jjMoveNfa_1(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 37;
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 ((0x7bffd0f8fffffdffL & l) != 0L)
{
if (kind > 17)
kind = 17;
jjCheckNAddStates(0, 6);
}
else if ((0x100000200L & l) != 0L)
{
if (kind > 6)
kind = 6;
}
else if (curChar == 34)
jjCheckNAdd(15);
else if (curChar == 33)
{
if (kind > 9)
kind = 9;
}
if (curChar == 38)
jjstateSet[jjnewStateCnt++] = 4;
break;
case 4:
if (curChar == 38 && kind > 7)
kind = 7;
break;
case 5:
if (curChar == 38)
jjstateSet[jjnewStateCnt++] = 4;
break;
case 13:
if (curChar == 33 && kind > 9)
kind = 9;
break;
case 14:
if (curChar == 34)
jjCheckNAdd(15);
break;
case 15:
if ((0xfffffffbffffffffL & l) != 0L)
jjCheckNAddTwoStates(15, 16);
break;
case 16:
if (curChar == 34 && kind > 16)
kind = 16;
break;
case 18:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 19)
kind = 19;
jjstateSet[jjnewStateCnt++] = 18;
break;
case 20:
jjAddStates(7, 8);
break;
case 23:
jjAddStates(9, 10);
break;
case 25:
if ((0x7bffd0f8fffffdffL & l) == 0L)
break;
if (kind > 17)
kind = 17;
jjCheckNAddStates(0, 6);
break;
case 26:
if ((0x7bffd0f8fffffdffL & l) == 0L)
break;
if (kind > 17)
kind = 17;
jjCheckNAddTwoStates(26, 27);
break;
case 28:
if ((0x84002f0600000000L & l) == 0L)
break;
if (kind > 17)
kind = 17;
jjCheckNAddTwoStates(26, 27);
break;
case 29:
if ((0x7bffd0f8fffffdffL & l) != 0L)
jjCheckNAddStates(11, 13);
break;
case 30:
if (curChar == 42 && kind > 20)
kind = 20;
break;
case 32:
if ((0x84002f0600000000L & l) != 0L)
jjCheckNAddStates(11, 13);
break;
case 33:
if ((0xfbffd4f8fffffdffL & l) == 0L)
break;
if (kind > 21)
kind = 21;
jjCheckNAddTwoStates(33, 34);
break;
case 35:
if ((0x84002f0600000000L & l) == 0L)
break;
if (kind > 21)
kind = 21;
jjCheckNAddTwoStates(33, 34);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 0:
if ((0x97ffffff97ffffffL & l) != 0L)
{
if (kind > 17)
kind = 17;
jjCheckNAddStates(0, 6);
}
else if (curChar == 123)
jjCheckNAdd(23);
else if (curChar == 91)
jjCheckNAdd(20);
else if (curChar == 126)
jjstateSet[jjnewStateCnt++] = 18;
if (curChar == 92)
jjCheckNAddStates(14, 16);
else if (curChar == 78)
jjstateSet[jjnewStateCnt++] = 11;
else if (curChar == 124)
jjstateSet[jjnewStateCnt++] = 8;
else if (curChar == 79)
jjstateSet[jjnewStateCnt++] = 6;
else if (curChar == 65)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 1:
if (curChar == 68 && kind > 7)
kind = 7;
break;
case 2:
if (curChar == 78)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 3:
if (curChar == 65)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 6:
if (curChar == 82 && kind > 8)
kind = 8;
break;
case 7:
if (curChar == 79)
jjstateSet[jjnewStateCnt++] = 6;
break;
case 8:
if (curChar == 124 && kind > 8)
kind = 8;
break;
case 9:
if (curChar == 124)
jjstateSet[jjnewStateCnt++] = 8;
break;
case 10:
if (curChar == 84 && kind > 9)
kind = 9;
break;
case 11:
if (curChar == 79)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 12:
if (curChar == 78)
jjstateSet[jjnewStateCnt++] = 11;
break;
case 15:
jjAddStates(17, 18);
break;
case 17:
if (curChar == 126)
jjstateSet[jjnewStateCnt++] = 18;
break;
case 19:
if (curChar == 91)
jjCheckNAdd(20);
break;
case 20:
if ((0xffffffffdfffffffL & l) != 0L)
jjCheckNAddTwoStates(20, 21);
break;
case 21:
if (curChar == 93 && kind > 22)
kind = 22;
break;
case 22:
if (curChar == 123)
jjCheckNAdd(23);
break;
case 23:
if ((0xdfffffffffffffffL & l) != 0L)
jjCheckNAddTwoStates(23, 24);
break;
case 24:
if (curChar == 125 && kind > 23)
kind = 23;
break;
case 25:
if ((0x97ffffff97ffffffL & l) == 0L)
break;
if (kind > 17)
kind = 17;
jjCheckNAddStates(0, 6);
break;
case 26:
if ((0x97ffffff97ffffffL & l) == 0L)
break;
if (kind > 17)
kind = 17;
jjCheckNAddTwoStates(26, 27);
break;
case 27:
if (curChar == 92)
jjCheckNAddTwoStates(28, 28);
break;
case 28:
if ((0x6800000078000000L & l) == 0L)
break;
if (kind > 17)
kind = 17;
jjCheckNAddTwoStates(26, 27);
break;
case 29:
if ((0x97ffffff97ffffffL & l) != 0L)
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -