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

📄 pierosltokenmanager.java

📁 High performance DB query
💻 JAVA
📖 第 1 页 / 共 5 页
字号:
         return -1;      case 3:         if ((active0 & 0x800000000L) != 0L)         {            jjmatchedKind = 67;            jjmatchedPos = 3;            return 1;         }         return -1;      case 4:         if ((active0 & 0x800000000L) != 0L)         {            jjmatchedKind = 67;            jjmatchedPos = 4;            return 1;         }         return -1;      default :         return -1;   }}private final int jjStartNfa_4(int pos, long active0, long active1){   return jjMoveNfa_4(jjStopStringLiteralDfa_4(pos, active0, active1), pos + 1);}private final int jjStartNfaWithStates_4(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_4(state, pos + 1);}private final int jjMoveStringLiteralDfa0_4(){   switch(curChar)   {      case 34:         return jjStopAtPos(0, 68);      case 44:         return jjStopAtPos(0, 32);      case 65:         return jjMoveStringLiteralDfa1_4(0xa00000000L);      case 79:         return jjMoveStringLiteralDfa1_4(0x400000000L);      case 123:         return jjStopAtPos(0, 30);      case 125:         return jjStopAtPos(0, 31);      default :         return jjMoveNfa_4(0, 0);   }}private final int jjMoveStringLiteralDfa1_4(long active0){   try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {      jjStopStringLiteralDfa_4(0, active0, 0L);      return 1;   }   switch(curChar)   {      case 78:         return jjMoveStringLiteralDfa2_4(active0, 0x200000000L);      case 82:         if ((active0 & 0x400000000L) != 0L)            return jjStartNfaWithStates_4(1, 34, 1);         break;      case 84:         return jjMoveStringLiteralDfa2_4(active0, 0x800000000L);      default :         break;   }   return jjStartNfa_4(0, active0, 0L);}private final int jjMoveStringLiteralDfa2_4(long old0, long active0){   if (((active0 &= old0)) == 0L)      return jjStartNfa_4(0, old0, 0L);   try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {      jjStopStringLiteralDfa_4(1, active0, 0L);      return 2;   }   switch(curChar)   {      case 68:         if ((active0 & 0x200000000L) != 0L)            return jjStartNfaWithStates_4(2, 33, 1);         break;      case 79:         return jjMoveStringLiteralDfa3_4(active0, 0x800000000L);      default :         break;   }   return jjStartNfa_4(1, active0, 0L);}private final int jjMoveStringLiteralDfa3_4(long old0, long active0){   if (((active0 &= old0)) == 0L)      return jjStartNfa_4(1, old0, 0L);   try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {      jjStopStringLiteralDfa_4(2, active0, 0L);      return 3;   }   switch(curChar)   {      case 77:         return jjMoveStringLiteralDfa4_4(active0, 0x800000000L);      default :         break;   }   return jjStartNfa_4(2, active0, 0L);}private final int jjMoveStringLiteralDfa4_4(long old0, long active0){   if (((active0 &= old0)) == 0L)      return jjStartNfa_4(2, old0, 0L);   try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {      jjStopStringLiteralDfa_4(3, active0, 0L);      return 4;   }   switch(curChar)   {      case 73:         return jjMoveStringLiteralDfa5_4(active0, 0x800000000L);      default :         break;   }   return jjStartNfa_4(3, active0, 0L);}private final int jjMoveStringLiteralDfa5_4(long old0, long active0){   if (((active0 &= old0)) == 0L)      return jjStartNfa_4(3, old0, 0L);   try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {      jjStopStringLiteralDfa_4(4, active0, 0L);      return 5;   }   switch(curChar)   {      case 67:         if ((active0 & 0x800000000L) != 0L)            return jjStartNfaWithStates_4(5, 35, 1);         break;      default :         break;   }   return jjStartNfa_4(4, active0, 0L);}private final int jjMoveNfa_4(int startState, int curPos){   int[] nextStates;   int startsAt = 0;   jjnewStateCnt = 3;   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(1);                  }                  else if ((0x100002600L & l) != 0L)                  {                     if (kind > 29)                        kind = 29;                  }                  break;               case 1:                  if ((0x3ffe40000000000L & l) == 0L)                     break;                  if (kind > 67)                     kind = 67;                  jjCheckNAdd(1);                  break;               case 2:                  if ((0xfffffffeffffffffL & l) != 0L && kind > 69)                     kind = 69;                  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(1);                  }                  break;               case 1:                  if ((0x7fffffe87fffffeL & l) == 0L)                     break;                  if (kind > 67)                     kind = 67;                  jjCheckNAdd(1);                  break;               case 2:                  if (kind > 69)                     kind = 69;                  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 = 3 - (jjnewStateCnt = startsAt)))         return curPos;      try { curChar = input_stream.readChar(); }      catch(java.io.IOException e) { return curPos; }   }}private final int jjStopStringLiteralDfa_10(int pos, long active0, long active1){   switch (pos)   {      default :         return -1;   }}private final int jjStartNfa_10(int pos, long active0, long active1){   return jjMoveNfa_10(jjStopStringLiteralDfa_10(pos, active0, active1), pos + 1);}private final int jjStartNfaWithStates_10(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_10(state, pos + 1);}private final int jjMoveStringLiteralDfa0_10(){   switch(curChar)   {      case 34:         return jjStopAtPos(0, 59);      case 92:         return jjStopAtPos(0, 58);      default :         return jjMoveNfa_10(1, 0);   }}private final int jjMoveNfa_10(int startState, int curPos){   int[] nextStates;   int startsAt = 0;   jjnewStateCnt = 4;   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 1:                  if (kind > 59)                     kind = 59;                  if ((0xfffffffeffffffffL & l) != 0L)                  {                     if (kind > 69)                        kind = 69;                  }                  if ((0xfffffffbffffffffL & l) != 0L)                  {                     if (kind > 57)                        kind = 57;                     jjCheckNAdd(0);                  }                  if ((0x3ffe40000000000L & l) != 0L)                  {                     if (kind > 67)                        kind = 67;                     jjCheckNAdd(2);                  }                  break;               case 0:                  if ((0xfffffffbffffffffL & l) == 0L)                     break;                  if (kind > 57)                     kind = 57;                  jjCheckNAdd(0);                  break;               case 2:                  if ((0x3ffe40000000000L & l) == 0L)                     break;                  if (kind > 67)                     kind = 67;                  jjCheckNAdd(2);                  break;               case 3:                  if ((0xfffffffeffffffffL & l) != 0L && kind > 69)                     kind = 69;                  break;               default : break;            }         } while(i != startsAt);      }      else if (curChar < 128)      {         long l = 1L << (curChar & 077);         MatchLoop: do         {            switch(jjstateSet[--i])            {               case 1:                  if (kind > 69)                     kind = 69;                  if ((0xffffffffefffffffL & l) != 0L)                  {                     if (kind > 59)                        kind = 59;                  }                  if ((0xffffffffefffffffL & l) != 0L)                  {                     if (kind > 57)                        kind = 57;                     jjCheckNAdd(0);                  }                  if ((0x7fffffe87fffffeL & l) != 0L)                  {                     if (kind > 67)                        kind = 67;                     jjCheckNAdd(2);                  }                  break;               case 0:                  if ((0xffffffffefffffffL & l) == 0L)                     break;                  if (kind > 57)                     kind = 57;                  jjCheckNAdd(0);                  break;               case 2:                  if ((0x7fffffe87fffffeL & l) == 0L)                     break;                  if (kind > 67)                     kind = 67;                  jjCheckNAdd(2);                  break;               case 3:                  if (kind > 69)                     kind = 69;                  break;               default : break;            }         } while(i != startsAt);      }      else      {         int i2 = (curChar & 0xff) >> 6;         long l2 = 1L << (curChar & 077);         MatchLoop: do         {            switch(jjstateSet[--i])            {               case 1:                  if ((jjbitVec0[i2] & l2) != 0L)                  {                     if (kind > 57)                        kind = 57;                     jjCheckNAdd(0);                  }                  if ((jjbitVec0[i2] & l2) != 0L)                  {                     if (kind > 59)                        kind = 59;                  }                  if ((jjbitVec0[i2] & l2) != 0L)                  {                     if (kind > 69)                        kind = 69;

⌨️ 快捷键说明

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