⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 queryparsertokenmanager.java

📁 lucene2.2.0版本
💻 JAVA
📖 第 1 页 / 共 2 页
字号:
/* Generated By:JavaCC: Do not edit this line. QueryParserTokenManager.java */package org.apache.lucene.queryParser.surround.parser;import java.util.ArrayList;import java.util.List;import java.io.StringReader;import org.apache.lucene.analysis.TokenStream;import org.apache.lucene.queryParser.surround.query.SrndQuery;import org.apache.lucene.queryParser.surround.query.FieldsQuery;import org.apache.lucene.queryParser.surround.query.OrQuery;import org.apache.lucene.queryParser.surround.query.AndQuery;import org.apache.lucene.queryParser.surround.query.NotQuery;import org.apache.lucene.queryParser.surround.query.DistanceQuery;import org.apache.lucene.queryParser.surround.query.SrndTermQuery;import org.apache.lucene.queryParser.surround.query.SrndPrefixQuery;import org.apache.lucene.queryParser.surround.query.SrndTruncQuery;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, 13);      case 41:         return jjStopAtPos(0, 14);      case 44:         return jjStopAtPos(0, 15);      case 58:         return jjStopAtPos(0, 16);      case 94:         return jjStopAtPos(0, 17);      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 = 38;   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 ((0x7bffe8faffffd9ffL & l) != 0L)                  {                     if (kind > 22)                        kind = 22;                     jjCheckNAddStates(0, 4);                  }                  else if ((0x100002600L & l) != 0L)                  {                     if (kind > 7)                        kind = 7;                  }                  else if (curChar == 34)                     jjCheckNAddStates(5, 7);                  if ((0x3fc000000000000L & l) != 0L)                     jjCheckNAddStates(8, 11);                  else if (curChar == 49)                     jjCheckNAddTwoStates(20, 21);                  break;               case 19:                  if ((0x3fc000000000000L & l) != 0L)                     jjCheckNAddStates(8, 11);                  break;               case 20:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAdd(17);                  break;               case 21:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAdd(18);                  break;               case 22:                  if (curChar == 49)                     jjCheckNAddTwoStates(20, 21);                  break;               case 23:                  if (curChar == 34)                     jjCheckNAddStates(5, 7);                  break;               case 24:                  if ((0xfffffffbffffffffL & l) != 0L)                     jjCheckNAddTwoStates(24, 25);                  break;               case 25:                  if (curChar == 34)                     jjstateSet[jjnewStateCnt++] = 26;                  break;               case 26:                  if (curChar == 42 && kind > 18)                     kind = 18;                  break;               case 27:                  if ((0xfffffffbffffffffL & l) != 0L)                     jjCheckNAddStates(12, 14);                  break;               case 29:                  if (curChar == 34)                     jjCheckNAddStates(12, 14);                  break;               case 30:                  if (curChar == 34 && kind > 19)                     kind = 19;                  break;               case 31:                  if ((0x7bffe8faffffd9ffL & l) == 0L)                     break;                  if (kind > 22)                     kind = 22;                  jjCheckNAddStates(0, 4);                  break;               case 32:                  if ((0x7bffe8faffffd9ffL & l) != 0L)                     jjCheckNAddTwoStates(32, 33);                  break;               case 33:                  if (curChar == 42 && kind > 20)                     kind = 20;                  break;               case 34:                  if ((0x7bffe8faffffd9ffL & l) != 0L)                     jjCheckNAddTwoStates(34, 35);                  break;               case 35:                  if ((0x8000040000000000L & l) == 0L)                     break;                  if (kind > 21)                     kind = 21;                  jjCheckNAddTwoStates(35, 36);                  break;               case 36:                  if ((0xfbffecfaffffd9ffL & l) == 0L)                     break;                  if (kind > 21)                     kind = 21;                  jjCheckNAdd(36);                  break;               case 37:                  if ((0x7bffe8faffffd9ffL & l) == 0L)                     break;                  if (kind > 22)                     kind = 22;                  jjCheckNAdd(37);                  break;               default : break;            }         } while(i != startsAt);      }      else if (curChar < 128)      {         long l = 1L << (curChar & 077);         MatchLoop: do         {            switch(jjstateSet[--i])            {               case 0:                  if ((0xffffffffbfffffffL & l) != 0L)                  {                     if (kind > 22)                        kind = 22;                     jjCheckNAddStates(0, 4);                  }                  if ((0x400000004000L & l) != 0L)                  {                     if (kind > 12)                        kind = 12;                  }                  else if ((0x80000000800000L & l) != 0L)                  {                     if (kind > 11)                        kind = 11;                  }                  else if (curChar == 97)                     jjstateSet[jjnewStateCnt++] = 9;                  else if (curChar == 65)                     jjstateSet[jjnewStateCnt++] = 6;                  else if (curChar == 111)                     jjstateSet[jjnewStateCnt++] = 3;                  else if (curChar == 79)                     jjstateSet[jjnewStateCnt++] = 1;                  if (curChar == 110)                     jjstateSet[jjnewStateCnt++] = 15;                  else if (curChar == 78)                     jjstateSet[jjnewStateCnt++] = 12;                  break;               case 1:                  if (curChar == 82 && kind > 8)                     kind = 8;                  break;               case 2:                  if (curChar == 79)                     jjstateSet[jjnewStateCnt++] = 1;                  break;               case 3:                  if (curChar == 114 && kind > 8)                     kind = 8;                  break;               case 4:                  if (curChar == 111)                     jjstateSet[jjnewStateCnt++] = 3;                  break;               case 5:                  if (curChar == 68 && kind > 9)                     kind = 9;                  break;               case 6:                  if (curChar == 78)                     jjstateSet[jjnewStateCnt++] = 5;                  break;               case 7:                  if (curChar == 65)                     jjstateSet[jjnewStateCnt++] = 6;                  break;               case 8:                  if (curChar == 100 && kind > 9)                     kind = 9;                  break;               case 9:                  if (curChar == 110)                     jjstateSet[jjnewStateCnt++] = 8;                  break;               case 10:                  if (curChar == 97)                     jjstateSet[jjnewStateCnt++] = 9;                  break;               case 11:                  if (curChar == 84 && kind > 10)                     kind = 10;                  break;               case 12:                  if (curChar == 79)                     jjstateSet[jjnewStateCnt++] = 11;                  break;               case 13:                  if (curChar == 78)                     jjstateSet[jjnewStateCnt++] = 12;                  break;               case 14:                  if (curChar == 116 && kind > 10)                     kind = 10;                  break;               case 15:                  if (curChar == 111)                     jjstateSet[jjnewStateCnt++] = 14;                  break;               case 16:                  if (curChar == 110)                     jjstateSet[jjnewStateCnt++] = 15;                  break;               case 17:                  if ((0x80000000800000L & l) != 0L && kind > 11)                     kind = 11;                  break;               case 18:                  if ((0x400000004000L & l) != 0L && kind > 12)                     kind = 12;                  break;               case 24:                  jjAddStates(15, 16);                  break;               case 27:                  if ((0xffffffffefffffffL & l) != 0L)                     jjCheckNAddStates(12, 14);                  break;               case 28:                  if (curChar == 92)                     jjstateSet[jjnewStateCnt++] = 29;                  break;               case 29:                  if (curChar == 92)                     jjCheckNAddStates(12, 14);                  break;               case 31:

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -