ijtokenmanager.java

来自「derby database source code.good for you.」· Java 代码 · 共 2,110 行 · 第 1/5 页

JAVA
2,110
字号
   }   return jjMoveNfa_0(5, 12);}private final int jjMoveStringLiteralDfa13_0(long old0, long active0, long old1, long active1){   if (((active0 &= old0) | (active1 &= old1)) == 0L)      return jjMoveNfa_0(5, 12);   try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {   return jjMoveNfa_0(5, 12);   }   switch(curChar)   {      case 69:      case 101:         return jjMoveStringLiteralDfa14_0(active0, 0x800000000000L, active1, 0L);      case 73:      case 105:         return jjMoveStringLiteralDfa14_0(active0, 0L, active1, 0x1000400000L);      case 76:      case 108:         return jjMoveStringLiteralDfa14_0(active0, 0x40000000000L, active1, 0L);      case 78:      case 110:         return jjMoveStringLiteralDfa14_0(active0, 0x1000000000L, active1, 0L);      case 89:      case 121:         return jjMoveStringLiteralDfa14_0(active0, 0x80000000000L, active1, 0L);      default :         break;   }   return jjMoveNfa_0(5, 13);}private final int jjMoveStringLiteralDfa14_0(long old0, long active0, long old1, long active1){   if (((active0 &= old0) | (active1 &= old1)) == 0L)      return jjMoveNfa_0(5, 13);   try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {   return jjMoveNfa_0(5, 13);   }   switch(curChar)   {      case 65:      case 97:         return jjMoveStringLiteralDfa15_0(active0, 0x40000000000L, active1, 0L);      case 67:      case 99:         return jjMoveStringLiteralDfa15_0(active0, 0x800000000000L, active1, 0L);      case 79:      case 111:         return jjMoveStringLiteralDfa15_0(active0, 0L, active1, 0x1000400000L);      case 85:      case 117:         return jjMoveStringLiteralDfa15_0(active0, 0x1000000000L, active1, 0L);      case 87:      case 119:         return jjMoveStringLiteralDfa15_0(active0, 0x80000000000L, active1, 0L);      default :         break;   }   return jjMoveNfa_0(5, 14);}private final int jjMoveStringLiteralDfa15_0(long old0, long active0, long old1, long active1){   if (((active0 &= old0) | (active1 &= old1)) == 0L)      return jjMoveNfa_0(5, 14);   try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {   return jjMoveNfa_0(5, 14);   }   switch(curChar)   {      case 73:      case 105:         return jjMoveStringLiteralDfa16_0(active0, 0x80000000000L, active1, 0L);      case 77:      case 109:         return jjMoveStringLiteralDfa16_0(active0, 0x1000000000L, active1, 0L);      case 78:      case 110:         if ((active1 & 0x400000L) != 0L)         {            jjmatchedKind = 86;            jjmatchedPos = 15;         }         else if ((active1 & 0x1000000000L) != 0L)         {            jjmatchedKind = 100;            jjmatchedPos = 15;         }         break;      case 84:      case 116:         return jjMoveStringLiteralDfa16_0(active0, 0x800000000000L, active1, 0L);      case 89:      case 121:         if ((active0 & 0x40000000000L) != 0L)         {            jjmatchedKind = 42;            jjmatchedPos = 15;         }         break;      default :         break;   }   return jjMoveNfa_0(5, 15);}private final int jjMoveStringLiteralDfa16_0(long old0, long active0, long old1, long active1){   if (((active0 &= old0) | (active1 &= old1)) == 0L)      return jjMoveNfa_0(5, 15);   try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {   return jjMoveNfa_0(5, 15);   }   switch(curChar)   {      case 66:      case 98:         return jjMoveStringLiteralDfa17_0(active0, 0x1000000000L);      case 68:      case 100:         return jjMoveStringLiteralDfa17_0(active0, 0x80000000000L);      case 73:      case 105:         return jjMoveStringLiteralDfa17_0(active0, 0x800000000000L);      default :         break;   }   return jjMoveNfa_0(5, 16);}private final int jjMoveStringLiteralDfa17_0(long old0, long active0){   if (((active0 &= old0)) == 0L)      return jjMoveNfa_0(5, 16);   try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {   return jjMoveNfa_0(5, 16);   }   switch(curChar)   {      case 69:      case 101:         return jjMoveStringLiteralDfa18_0(active0, 0x1000000000L);      case 79:      case 111:         return jjMoveStringLiteralDfa18_0(active0, 0x800000000000L);      case 84:      case 116:         return jjMoveStringLiteralDfa18_0(active0, 0x80000000000L);      default :         break;   }   return jjMoveNfa_0(5, 17);}private final int jjMoveStringLiteralDfa18_0(long old0, long active0){   if (((active0 &= old0)) == 0L)      return jjMoveNfa_0(5, 17);   try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {   return jjMoveNfa_0(5, 17);   }   switch(curChar)   {      case 72:      case 104:         if ((active0 & 0x80000000000L) != 0L)         {            jjmatchedKind = 43;            jjmatchedPos = 18;         }         break;      case 78:      case 110:         if ((active0 & 0x800000000000L) != 0L)         {            jjmatchedKind = 47;            jjmatchedPos = 18;         }         break;      case 82:      case 114:         if ((active0 & 0x1000000000L) != 0L)         {            jjmatchedKind = 36;            jjmatchedPos = 18;         }         break;      default :         break;   }   return jjMoveNfa_0(5, 18);}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};static final long[] jjbitVec3 = {   0x0L, 0xffffffffffffc000L, 0xfffff0007fffffffL, 0x12000000007fffffL};static final long[] jjbitVec4 = {   0x0L, 0x0L, 0x420040000000000L, 0xff7fffffff7fffffL};static final long[] jjbitVec5 = {   0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xfc3fffffffffffffL};static final long[] jjbitVec6 = {   0xffffffL, 0xffffffffffff0000L, 0xf9ff01ffffffffffL, 0x1f00030003L};static final long[] jjbitVec7 = {   0x0L, 0x400000000000000L, 0xfffffffbffffd740L, 0xffffffc7f7fffL};static final long[] jjbitVec8 = {   0xffffffffffffdffeL, 0xffffffffdffeffffL, 0xffffffffffff0003L, 0x33fcfffffff199fL};static final long[] jjbitVec9 = {   0xfffe000000000000L, 0xfffffffe027fffffL, 0xffL, 0x707ffffff0000L};static final long[] jjbitVec10 = {   0x7fffffe00000000L, 0xfffe0000000007ffL, 0x7cffffffffffffffL, 0x60002f7fffL};static final long[] jjbitVec11 = {   0x23ffffffffffffe0L, 0x3ff000000L, 0x3c5fdfffff99fe0L, 0x30003b0000000L};static final long[] jjbitVec12 = {   0x36dfdfffff987e0L, 0x1c00005e000000L, 0x23edfdfffffbafe0L, 0x100000000L};static final long[] jjbitVec13 = {   0x23cdfdfffff99fe0L, 0x3b0000000L, 0x3bfc718d63dc7e0L, 0x0L};static final long[] jjbitVec14 = {   0x3effdfffffddfe0L, 0x300000000L, 0x3effdfffffddfe0L, 0x340000000L};static final long[] jjbitVec15 = {   0x3fffdfffffddfe0L, 0x300000000L, 0x0L, 0x0L};static final long[] jjbitVec16 = {   0xd7ffffffffffeL, 0x7fL, 0x200d6caefef02596L, 0x3000005fL};static final long[] jjbitVec17 = {   0x0L, 0x3fffffffeffL, 0x0L, 0x0L};static final long[] jjbitVec18 = {   0x0L, 0x0L, 0xffffffff00000000L, 0x7fffffffff003fL};static final long[] jjbitVec19 = {   0xffffffffffffffffL, 0xffffffff83ffffffL, 0xffffff07ffffffffL, 0x3ffffffffffffffL};static final long[] jjbitVec20 = {   0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffff0fffffffL, 0x3ffffffffffffffL};static final long[] jjbitVec21 = {   0xffffffff3f3fffffL, 0x3fffffffaaff3f3fL, 0x5fdfffffffffffffL, 0x1fdc1fff0fcf1fdcL};static final long[] jjbitVec22 = {   0x0L, 0x8000000000000000L, 0x0L, 0x0L};static final long[] jjbitVec23 = {   0x1fbfd503f2ffc84L, 0x0L, 0x0L, 0x0L};static final long[] jjbitVec24 = {   0x3e000000000020L, 0xfffffffffffffffeL, 0xfffffffe781fffffL, 0x77ffffffffffffffL};static final long[] jjbitVec25 = {   0xfffe1fffffffffe0L, 0xffffffffffffffffL, 0x7fffL, 0x0L};static final long[] jjbitVec26 = {   0xffffffffffffffffL, 0xffffffffffffffffL, 0x3fffffffffL, 0x0L};static final long[] jjbitVec27 = {   0xffffffffffffffffL, 0xffffffffffffffffL, 0xfffffffffL, 0x0L};static final long[] jjbitVec28 = {   0x3fffffffffffL, 0x0L, 0x0L, 0x0L};static final long[] jjbitVec29 = {   0x5f7ffdff80f8007fL, 0xffffffffffffffdbL, 0x3ffffffffffffL, 0xfffffffffff80000L};static final long[] jjbitVec30 = {   0x3fffffffffffffffL, 0xffffffffffff0000L, 0xfffffffffffcffffL, 0xfff0000000000ffL};static final long[] jjbitVec31 = {   0x0L, 0xffd7000000000000L, 0xffffffffffffffffL, 0x1fffffffffffffffL};static final long[] jjbitVec32 = {   0x7fffffe00000000L, 0xffffffc007fffffeL, 0x7fffffffffffffffL, 0x1cfcfcfcL};static final long[] jjbitVec33 = {   0x7fffffe00000000L, 0xfffe03ff000007ffL, 0x7cffffffffffffffL, 0x3ff0060002f7fffL};static final long[] jjbitVec34 = {   0x23ffffffffffffe0L, 0xffc3ff000000L, 0x3c5fdfffff99fe0L, 0x3ffc3b0000000L};static final long[] jjbitVec35 = {   0x36dfdfffff987e0L, 0x1cffc05e000000L, 0x23edfdfffffbafe0L, 0xffc100000000L};static final long[] jjbitVec36 = {   0x23cdfdfffff99fe0L, 0xffc3b0000000L, 0x3bfc718d63dc7e0L, 0xff8000000000L};static final long[] jjbitVec37 = {   0x3effdfffffddfe0L, 0xffc300000000L, 0x3effdfffffddfe0L, 0xffc340000000L};static final long[] jjbitVec38 = {   0x3fffdfffffddfe0L, 0xffc300000000L, 0x0L, 0x0L};static final long[] jjbitVec39 = {   0xd7ffffffffffeL, 0x3ff007fL, 0x200d6caefef02596L, 0x33ff005fL};static final long[] jjbitVec40 = {   0x3ff00000000L, 0x3fffffffeffL, 0x0L, 0x0L};static final long[] jjbitVec41 = {   0x7fffffe03ff0000L, 0xffffffc007fffffeL, 0x7fffffffffffffffL, 0x1cfcfcfcL};private final int jjMoveNfa_0(int startState, int curPos){   int strKind = jjmatchedKind;   int strPos = jjmatchedPos;   int seenUpto;   input_stream.backup(seenUpto = curPos + 1);   try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) { throw new Error("Internal Error"); }   curPos = 0;   int[] nextStates;   int startsAt = 0;   jjnewStateCnt = 14;   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 5:                  if ((0x3ff000000000000L & l) != 0L)                  {                     if (kind > 113)                        kind = 113;                     jjCheckNAdd(8);                  }                  else if (curChar == 39)                     jjCheckNAddStates(0, 2);                  else if (curChar == 45)                     jjstateSet[jjnewStateCnt++] = 0;                  break;               case 0:                  if (curChar == 45)                     jjCheckNAddStates(3, 5);                  break;               case 1:                  if ((0xffffffffffffdbffL & l) != 0L)                     jjCheckNAddStates(3, 5);                  break;               case 2:                  if ((0x2400L & l) != 0L && kind > 7)                     kind = 7;                  break;               case 3:                  if (curChar == 10 && kind > 7)                     kind = 7;                  break;               case 4:                  if (curChar == 13)                     jjstateSet[jjnewStateCnt++] = 3;                  break;               case 7:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 110)                     kind = 110;                  jjstateSet[jjnewStateCnt++] = 7;                  break;               case 8:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 113)                     kind = 113;                  jjCheckNAdd(8);                  break;               case 9:               case 10:

⌨️ 快捷键说明

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