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

📄 standardtokenizertokenmanager.java

📁 一套java版本的搜索引擎源码
💻 JAVA
📖 第 1 页 / 共 3 页
字号:
                     if (kind > 1)                        kind = 1;                     jjCheckNAddStates(0, 11);                  }                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddStates(18, 23);                  break;               case 2:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddStates(18, 23);                  break;               case 3:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(3, 4);                  break;               case 5:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjAddStates(36, 37);                  break;               case 6:                  if (curChar == 95)                     jjCheckNAdd(7);                  break;               case 7:                  if ((0x7fffffe07fffffeL & l) == 0L)                     break;                  if (kind > 7)                     kind = 7;                  jjCheckNAdd(7);                  break;               case 8:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(8, 9);                  break;               case 10:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(10, 11);                  break;               case 11:                  if (curChar == 95)                     jjCheckNAdd(12);                  break;               case 12:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(12, 13);                  break;               case 13:                  if (curChar == 95)                     jjCheckNAddTwoStates(14, 15);                  break;               case 14:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(14, 15);                  break;               case 16:                  if ((0x7fffffe07fffffeL & l) == 0L)                     break;                  if (kind > 7)                     kind = 7;                  jjCheckNAddTwoStates(11, 16);                  break;               case 17:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(17, 18);                  break;               case 19:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjAddStates(38, 39);                  break;               case 20:                  if (curChar == 95)                     jjCheckNAdd(21);                  break;               case 21:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(21, 22);                  break;               case 22:                  if (curChar == 95)                     jjCheckNAddTwoStates(23, 24);                  break;               case 23:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(23, 24);                  break;               case 25:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjAddStates(40, 41);                  break;               case 26:                  if (curChar == 95)                     jjCheckNAdd(27);                  break;               case 27:                  if ((0x7fffffe07fffffeL & l) == 0L)                     break;                  if (kind > 7)                     kind = 7;                  jjCheckNAddTwoStates(22, 27);                  break;               case 29:                  if ((0x7fffffe07fffffeL & l) == 0L)                     break;                  if (kind > 1)                     kind = 1;                  jjCheckNAddStates(0, 11);                  break;               case 30:                  if ((0x7fffffe07fffffeL & l) == 0L)                     break;                  if (kind > 1)                     kind = 1;                  jjCheckNAdd(30);                  break;               case 31:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddStates(24, 26);                  break;               case 32:                  if (curChar == 95)                     jjCheckNAdd(33);                  break;               case 33:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddStates(27, 29);                  break;               case 34:                  if (curChar == 64)                     jjCheckNAdd(35);                  break;               case 35:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(35, 36);                  break;               case 37:                  if ((0x7fffffe07fffffeL & l) == 0L)                     break;                  if (kind > 5)                     kind = 5;                  jjCheckNAddTwoStates(36, 37);                  break;               case 38:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(38, 39);                  break;               case 40:                  if ((0x7fffffe07fffffeL & l) == 0L)                     break;                  if (kind > 6)                     kind = 6;                  jjCheckNAddTwoStates(39, 40);                  break;               case 41:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(41, 42);                  break;               case 42:                  if (curChar == 95)                     jjCheckNAddTwoStates(43, 44);                  break;               case 43:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(43, 44);                  break;               case 45:                  if ((0x7fffffe07fffffeL & l) == 0L)                     break;                  if (kind > 7)                     kind = 7;                  jjstateSet[jjnewStateCnt++] = 45;                  break;               case 46:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(46, 47);                  break;               case 47:                  if (curChar == 95)                     jjCheckNAddTwoStates(48, 49);                  break;               case 48:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(48, 49);                  break;               case 50:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjAddStates(42, 43);                  break;               case 51:                  if (curChar == 95)                     jjCheckNAdd(52);                  break;               case 52:                  if ((0x7fffffe07fffffeL & l) == 0L)                     break;                  if (kind > 7)                     kind = 7;                  jjCheckNAddTwoStates(47, 52);                  break;               case 53:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(53, 54);                  break;               case 54:                  if (curChar == 95)                     jjCheckNAddTwoStates(55, 56);                  break;               case 55:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(55, 56);                  break;               case 57:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(57, 58);                  break;               case 58:                  if (curChar == 95)                     jjCheckNAdd(59);                  break;               case 59:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(59, 60);                  break;               case 60:                  if (curChar == 95)                     jjCheckNAddTwoStates(61, 62);                  break;               case 61:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(61, 62);                  break;               case 63:                  if ((0x7fffffe07fffffeL & l) == 0L)                     break;                  if (kind > 7)                     kind = 7;                  jjCheckNAddTwoStates(58, 63);                  break;               case 64:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddStates(30, 35);                  break;               case 65:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(65, 66);                  break;               case 67:                  if ((0x7fffffe07fffffeL & l) == 0L)                     break;                  if (kind > 2)                     kind = 2;                  jjCheckNAddTwoStates(66, 67);                  break;               case 68:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(68, 69);                  break;               case 70:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjAddStates(44, 45);                  break;               case 72:                  if ((0x7fffffe07fffffeL & l) != 0L)                     jjCheckNAddTwoStates(72, 73);                  break;               case 73:                  if (curChar == 64)                     jjCheckNAdd(74);                  break;               case 74:                  if ((0x7fffffe07fffffeL & l) == 0L)                     break;                  if (kind > 4)                     kind = 4;                  jjCheckNAdd(74);                  break;               default : break;            }         } while(i != startsAt);      }      else      {         int hiByte = (int)(curChar >> 8);         int i1 = hiByte >> 6;         long l1 = 1L << (hiByte & 077);         int i2 = (curChar & 0xff) >> 6;         long l2 = 1L << (curChar & 077);         MatchLoop: do         {            switch(jjstateSet[--i])            {               case 0:                  if (jjCanMove_0(hiByte, i1, i2, l1, l2))                  {                     if (kind > 12)                        kind = 12;                  }                  if (jjCanMove_1(hiByte, i1, i2, l1, l2))                  {                     if (kind > 13)                        kind = 13;                  }                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjCheckNAddStates(18, 23);                  if (jjCanMove_3(hiByte, i1, i2, l1, l2))                     jjCheckNAddStates(12, 17);                  if (jjCanMove_4(hiByte, i1, i2, l1, l2))                  {                     if (kind > 1)                        kind = 1;                     jjCheckNAddStates(0, 11);                  }                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjCheckNAddStates(30, 35);                  break;               case 1:                  if (jjCanMove_1(hiByte, i1, i2, l1, l2) && kind > 13)                     kind = 13;                  break;               case 2:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjCheckNAddStates(18, 23);                  break;               case 3:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(3, 4);                  break;               case 4:                  if (jjCanMove_3(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(5, 6);                  break;               case 5:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(5, 6);                  break;               case 7:                  if (!jjCanMove_4(hiByte, i1, i2, l1, l2))                     break;                  if (kind > 7)                     kind = 7;                  jjstateSet[jjnewStateCnt++] = 7;                  break;               case 8:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(8, 9);                  break;               case 9:                  if (jjCanMove_3(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(10, 11);                  break;               case 10:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(10, 11);                  break;               case 12:                  if (jjCanMove_4(hiByte, i1, i2, l1, l2))                     jjAddStates(46, 47);                  break;               case 14:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjAddStates(48, 49);                  break;               case 15:                  if (!jjCanMove_3(hiByte, i1, i2, l1, l2))                     break;                  if (kind > 7)                     kind = 7;                  jjCheckNAddTwoStates(11, 16);                  break;               case 16:                  if (!jjCanMove_2(hiByte, i1, i2, l1, l2))                     break;                  if (kind > 7)                     kind = 7;                  jjCheckNAddTwoStates(11, 16);                  break;               case 17:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(17, 18);                  break;               case 18:                  if (jjCanMove_3(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(19, 20);                  break;               case 19:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(19, 20);                  break;               case 21:                  if (jjCanMove_4(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(21, 22);                  break;               case 23:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjAddStates(50, 51);                  break;               case 24:                  if (jjCanMove_3(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(25, 26);                  break;               case 25:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(25, 26);                  break;               case 27:                  if (!jjCanMove_4(hiByte, i1, i2, l1, l2))                     break;                  if (kind > 7)                     kind = 7;                  jjCheckNAddTwoStates(22, 27);                  break;               case 28:                  if (jjCanMove_3(hiByte, i1, i2, l1, l2))

⌨️ 快捷键说明

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