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

📄 pierosltokenmanager.java

📁 High performance DB query
💻 JAVA
📖 第 1 页 / 共 5 页
字号:
                  if (curChar == 84 && kind > 21)                     kind = 21;                  break;               case 121:                  if (curChar == 67)                     jjstateSet[jjnewStateCnt++] = 120;                  break;               case 122:                  if (curChar == 69)                     jjstateSet[jjnewStateCnt++] = 121;                  break;               case 123:                  if (curChar == 76)                     jjstateSet[jjnewStateCnt++] = 122;                  break;               case 124:                  if (curChar == 69)                     jjstateSet[jjnewStateCnt++] = 123;                  break;               case 125:                  if (curChar == 78 && kind > 25)                     kind = 25;                  break;               case 126:                  if (curChar == 65)                     jjstateSet[jjnewStateCnt++] = 125;                  break;               case 127:                  if (curChar == 67)                     jjstateSet[jjnewStateCnt++] = 126;                  break;               case 128:                  if (curChar == 78 && kind > 26)                     kind = 26;                  break;               case 129:                  if (curChar == 79)                     jjstateSet[jjnewStateCnt++] = 128;                  break;               case 130:                  if (curChar == 73)                     jjstateSet[jjnewStateCnt++] = 129;                  break;               case 131:                  if (curChar == 84)                     jjstateSet[jjnewStateCnt++] = 130;                  break;               case 132:                  if (curChar == 67)                     jjstateSet[jjnewStateCnt++] = 131;                  break;               case 133:                  if (curChar == 69)                     jjstateSet[jjnewStateCnt++] = 132;                  break;               case 134:                  if (curChar == 76)                     jjstateSet[jjnewStateCnt++] = 133;                  break;               case 135:                  if (curChar == 69)                     jjstateSet[jjnewStateCnt++] = 134;                  break;               case 136:                  if (curChar == 82)                     jjAddStates(0, 1);                  break;               case 137:                  if (curChar == 72 && kind > 23)                     kind = 23;                  break;               case 138:                  if (curChar == 83)                     jjstateSet[jjnewStateCnt++] = 137;                  break;               case 139:                  if (curChar == 65)                     jjstateSet[jjnewStateCnt++] = 138;                  break;               case 140:                  if (curChar == 72)                     jjstateSet[jjnewStateCnt++] = 139;                  break;               case 141:                  if (curChar == 69)                     jjstateSet[jjnewStateCnt++] = 140;                  break;               case 142:                  if (curChar == 84 && kind > 24)                     kind = 24;                  break;               case 143:                  if (curChar == 76)                     jjstateSet[jjnewStateCnt++] = 142;                  break;               case 144:                  if (curChar == 85)                     jjstateSet[jjnewStateCnt++] = 143;                  break;               case 145:                  if (curChar == 83)                     jjstateSet[jjnewStateCnt++] = 144;                  break;               case 146:                  if (curChar == 69)                     jjstateSet[jjnewStateCnt++] = 145;                  break;               default : break;            }         } while(i != startsAt);      }      else      {         int i2 = (curChar & 0xff) >> 6;         long l2 = 1L << (curChar & 077);         MatchLoop: do         {            switch(jjstateSet[--i])            {               case 0:                  if ((jjbitVec0[i2] & l2) != 0L && kind > 69)                     kind = 69;                  break;               default : break;            }         } while(i != startsAt);      }      if (kind != 0x7fffffff)      {         jjmatchedKind = kind;         jjmatchedPos = curPos;         kind = 0x7fffffff;      }      ++curPos;      if ((i = jjnewStateCnt) == (startsAt = 147 - (jjnewStateCnt = startsAt)))         return curPos;      try { curChar = input_stream.readChar(); }      catch(java.io.IOException e) { return curPos; }   }}private final int jjStopStringLiteralDfa_11(int pos, long active0, long active1){   switch (pos)   {      default :         return -1;   }}private final int jjStartNfa_11(int pos, long active0, long active1){   return jjMoveNfa_11(jjStopStringLiteralDfa_11(pos, active0, active1), pos + 1);}private final int jjStartNfaWithStates_11(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_11(state, pos + 1);}private final int jjMoveStringLiteralDfa0_11(){   switch(curChar)   {      case 34:         jjmatchedKind = 68;         return jjMoveStringLiteralDfa1_11(0x2L);      default :         return jjMoveNfa_11(0, 0);   }}private final int jjMoveStringLiteralDfa1_11(long active1){   try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {      jjStopStringLiteralDfa_11(0, 0L, active1);      return 1;   }   switch(curChar)   {      case 36:         if ((active1 & 0x2L) != 0L)            return jjStopAtPos(1, 65);         break;      default :         break;   }   return jjStartNfa_11(0, 0L, active1);}private final int jjMoveNfa_11(int startState, int curPos){   int[] nextStates;   int startsAt = 0;   jjnewStateCnt = 19;   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 ((0xfffffffeffffffffL & l) != 0L)                  {                     if (kind > 69)                        kind = 69;                  }                  if ((0x3ffe40000000000L & l) != 0L)                  {                     if (kind > 67)                        kind = 67;                     jjCheckNAdd(10);                  }                  break;               case 1:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 2;                  break;               case 2:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 3;                  break;               case 3:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 4;                  break;               case 4:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 60)                     kind = 60;                  jjstateSet[jjnewStateCnt++] = 5;                  break;               case 5:                  if (curChar == 36 && kind > 60)                     kind = 60;                  break;               case 7:                  if (curChar == 36 && kind > 64)                     kind = 64;                  break;               case 9:                  if (curChar == 36 && kind > 66)                     kind = 66;                  break;               case 10:                  if ((0x3ffe40000000000L & l) == 0L)                     break;                  if (kind > 67)                     kind = 67;                  jjCheckNAdd(10);                  break;               case 11:                  if ((0xfffffffeffffffffL & l) != 0L && kind > 69)                     kind = 69;                  break;               case 14:                  if (curChar == 36 && kind > 61)                     kind = 61;                  break;               case 16:                  if (curChar == 36 && kind > 62)                     kind = 62;                  break;               case 18:                  if (curChar == 36 && kind > 63)                     kind = 63;                  break;               default : break;            }         } while(i != startsAt);      }      else if (curChar < 128)      {         long l = 1L << (curChar & 077);         MatchLoop: do         {            switch(jjstateSet[--i])            {               case 0:                  if (kind > 69)                     kind = 69;                  if ((0x7fffffe87fffffeL & l) != 0L)                  {                     if (kind > 67)                        kind = 67;                     jjCheckNAdd(10);                  }                  else if (curChar == 92)                  {                     if (kind > 64)                        kind = 64;                     jjstateSet[jjnewStateCnt++] = 7;                  }                  if (curChar == 113)                     jjAddStates(16, 18);                  else if (curChar == 110)                  {                     if (kind > 66)                        kind = 66;                     jjstateSet[jjnewStateCnt++] = 9;                  }                  else if (curChar == 117)                     jjstateSet[jjnewStateCnt++] = 1;                  break;               case 1:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 2;                  break;               case 2:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 3;                  break;               case 3:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 4;                  break;               case 4:                  if ((0x7e0000007eL & l) == 0L)                     break;                  if (kind > 60)                     kind = 60;                  jjstateSet[jjnewStateCnt++] = 5;                  break;               case 6:                  if (curChar != 92)                     break;                  if (kind > 64)                     kind = 64;                  jjstateSet[jjnewStateCnt++] = 7;                  break;               case 8:                  if (curChar != 110)                     break;                  if (kind > 66)                     kind = 66;                  jjstateSet[jjnewStateCnt++] = 9;                  break;               case 10:                  if ((0x7fffffe87fffffeL & l) == 0L)                     break;                  if (kind > 67)                     kind = 67;                  jjCheckNAdd(10);                  break;               case 11:                  if (kind > 69)                     kind = 69;                  break;               case 12:                  if (curChar == 113)                     jjAddStates(16, 18);                  break;               case 13:                  if (curChar != 105)                     break;                  if (kind > 61)                     kind = 61;                  jjstateSet[jjnewStateCnt++] = 14;                  break;               case 15:                  if (curChar != 116)                     break;                  if (kind > 62)                     kind = 62;                  jjstateSet[jjnewStateCnt++] = 16;                  break;               case 17:                  if (curChar != 97)                     break;                  if (kind > 63)                     kind = 63;                  jjstateSet[jjnewStateCnt++] = 18;                  break;               default : break;            }         } while(i != startsAt);      }      else      {         int i2 = (curChar & 0xff) >> 6;         long l2 = 1L << (curChar & 077);         MatchLoop: do         {            switch(jjstateSet[--i])            {               case 0:                  if ((jjbitVec0[i2] & l2) != 0L && kind > 69)                     kind = 69;                  break;               default : break;            }         } while(i != startsAt);      }      if (kind != 0x7fffffff)      {         jjmatchedKind = kind;         jjmatchedPos = curPos;         kind = 0x7fffffff;      }      ++curPos;      if ((i = jjnewStateCnt) == (startsAt = 19 - (jjnewStateCnt = startsAt)))         return curPos;      try { curChar = input_stream.readChar(); }      catch(java.io.IOException e) { return curPos; }   }}private final int jjStopStringLiteralDfa_9(int pos, long active0, long active1){   switch (pos)   {      default :         return -1;   }}private final int jjStartNfa_9(int pos, long active0, long active1){   return jjMoveNfa_9(jjStopStringLiteralDfa_9(pos, active0, active1), pos + 1);}private final int jjStartNfaWithStates_9(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_

⌨️ 快捷键说明

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