?? htmlparsertokenmanager.java

?? BBS-CS 天乙社區(qū) v6.0.1(含源碼) 天乙社區(qū)6.0是一套基于JAVA技術(shù)的網(wǎng)絡(luò)虛擬社區(qū)
?? JAVA
?? 第 1 頁 / 共 3 頁
字號:
    jjnewStateCnt = 2;
    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 ( (0xfffffffbffffffffL & l) != 0L) {
                if (kind > 24) {
                  kind = 24;
                }
                jjCheckNAdd(0);
              }
              else if (curChar == 34) {
                if (kind > 25) {
                  kind = 25;
                }
              }
              break;
            case 0:
              if ( (0xfffffffbffffffffL & l) == 0L) {
                break;
              }
              kind = 24;
              jjCheckNAdd(0);
              break;
            default:
              break;
          }
        }
        while (i != startsAt);
      }
      else if (curChar < 128) {
        long l = 1L << (curChar & 077);
        MatchLoop:do {
          switch (jjstateSet[--i]) {
            case 1:
            case 0:
              kind = 24;
              jjCheckNAdd(0);
              break;
            default:
              break;
          }
        }
        while (i != startsAt);
      }
      else {
        int i2 = (curChar & 0xff) >> 6;
        long l2 = 1L << (curChar & 077);
        MatchLoop:do {
          switch (jjstateSet[--i]) {
            case 1:
            case 0:
              if ( (jjbitVec0[i2] & l2) == 0L) {
                break;
              }
              if (kind > 24) {
                kind = 24;
              }
              jjCheckNAdd(0);
              break;
            default:
              break;
          }
        }
        while (i != startsAt);
      }
      if (kind != 0x7fffffff) {
        jjmatchedKind = kind;
        jjmatchedPos = curPos;
        kind = 0x7fffffff;
      }
      ++curPos;
      if ( (i = jjnewStateCnt) == (startsAt = 2 - (jjnewStateCnt = startsAt))) {
        return curPos;
      }
      try {
        curChar = input_stream.readChar();
      }
      catch (java.io.IOException e) {
        return curPos;
      }
    }
  }

  private final int jjStopStringLiteralDfa_7(int pos, long active0) {
    switch (pos) {
      default:
        return -1;
    }
  }

  private final int jjStartNfa_7(int pos, long active0) {
    return jjMoveNfa_7(jjStopStringLiteralDfa_7(pos, active0), pos + 1);
  }

  private final int jjStartNfaWithStates_7(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_7(state, pos + 1);
  }

  private final int jjMoveStringLiteralDfa0_7() {
    switch (curChar) {
      case 62:
        return jjStopAtPos(0, 29);
      default:
        return jjMoveNfa_7(0, 0);
    }
  }

  private final int jjMoveNfa_7(int startState, int curPos) {
    int[] nextStates;
    int startsAt = 0;
    jjnewStateCnt = 1;
    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 ( (0xbfffffffffffffffL & l) == 0L) {
                break;
              }
              kind = 28;
              jjstateSet[jjnewStateCnt++] = 0;
              break;
            default:
              break;
          }
        }
        while (i != startsAt);
      }
      else if (curChar < 128) {
        long l = 1L << (curChar & 077);
        MatchLoop:do {
          switch (jjstateSet[--i]) {
            case 0:
              kind = 28;
              jjstateSet[jjnewStateCnt++] = 0;
              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) {
                break;
              }
              if (kind > 28) {
                kind = 28;
              }
              jjstateSet[jjnewStateCnt++] = 0;
              break;
            default:
              break;
          }
        }
        while (i != startsAt);
      }
      if (kind != 0x7fffffff) {
        jjmatchedKind = kind;
        jjmatchedPos = curPos;
        kind = 0x7fffffff;
      }
      ++curPos;
      if ( (i = jjnewStateCnt) == (startsAt = 1 - (jjnewStateCnt = startsAt))) {
        return curPos;
      }
      try {
        curChar = input_stream.readChar();
      }
      catch (java.io.IOException e) {
        return curPos;
      }
    }
  }

  private final int jjMoveStringLiteralDfa0_4() {
    return jjMoveNfa_4(1, 0);
  }

  private final int jjMoveNfa_4(int startState, int curPos) {
    int[] nextStates;
    int startsAt = 0;
    jjnewStateCnt = 2;
    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 ( (0xffffff7fffffffffL & l) != 0L) {
                if (kind > 22) {
                  kind = 22;
                }
                jjCheckNAdd(0);
              }
              else if (curChar == 39) {
                if (kind > 23) {
                  kind = 23;
                }
              }
              break;
            case 0:
              if ( (0xffffff7fffffffffL & l) == 0L) {
                break;
              }
              kind = 22;
              jjCheckNAdd(0);
              break;
            default:
              break;
          }
        }
        while (i != startsAt);
      }
      else if (curChar < 128) {
        long l = 1L << (curChar & 077);
        MatchLoop:do {
          switch (jjstateSet[--i]) {
            case 1:
            case 0:
              kind = 22;
              jjCheckNAdd(0);
              break;
            default:
              break;
          }
        }
        while (i != startsAt);
      }
      else {
        int i2 = (curChar & 0xff) >> 6;
        long l2 = 1L << (curChar & 077);
        MatchLoop:do {
          switch (jjstateSet[--i]) {
            case 1:
            case 0:
              if ( (jjbitVec0[i2] & l2) == 0L) {
                break;
              }
              if (kind > 22) {
                kind = 22;
              }
              jjCheckNAdd(0);
              break;
            default:
              break;
          }
        }
        while (i != startsAt);
      }
      if (kind != 0x7fffffff) {
        jjmatchedKind = kind;
        jjmatchedPos = curPos;
        kind = 0x7fffffff;
      }
      ++curPos;
      if ( (i = jjnewStateCnt) == (startsAt = 2 - (jjnewStateCnt = startsAt))) {
        return curPos;
      }
      try {
        curChar = input_stream.readChar();
      }
      catch (java.io.IOException e) {
        return curPos;
      }
    }
  }

  private final int jjStopStringLiteralDfa_3(int pos, long active0) {
    switch (pos) {
      default:
        return -1;
    }
  }

  private final int jjStartNfa_3(int pos, long active0) {
    return jjMoveNfa_3(jjStopStringLiteralDfa_3(pos, active0), pos + 1);
  }

  private final int jjStartNfaWithStates_3(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_3(state, pos + 1);
  }

  private final int jjMoveStringLiteralDfa0_3() {
    switch (curChar) {
      case 34:
        return jjStopAtPos(0, 20);
      case 39:
        return jjStopAtPos(0, 19);
      default:
        return jjMoveNfa_3(0, 0);
    }
  }

  private final int jjMoveNfa_3(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 ( (0x9fffff7affffd9ffL & l) != 0L) {
                if (kind > 18) {
                  kind = 18;
                }
                jjCheckNAdd(1);
              }
              else if ( (0x100002600L & l) != 0L) {
                if (kind > 21) {
                  kind = 21;
                }
                jjCheckNAdd(2);
              }
              break;
            case 1:
              if ( (0xbffffffeffffd9ffL & l) == 0L) {
                break;
              }
              if (kind > 18) {
                kind = 18;
              }
              jjCheckNAdd(1);
              break;
            case 2:
              if ( (0x100002600L & l) == 0L) {
                break;
              }
              kind = 21;
              jjCheckNAdd(2);
              break;
            default:
              break;
          }
        }
        while (i != startsAt);
      }
      else if (curChar < 128) {
        long l = 1L << (curChar & 077);
        MatchLoop:do {
          switch (jjstateSet[--i]) {
            case 0:
            case 1:
              if (kind > 18) {
                kind = 18;
              }
              jjCheckNAdd(1);
              break;
            default:
              break;
          }
        }
        while (i != startsAt);
      }
      else {
        int i2 = (curChar & 0xff) >> 6;
        long l2 = 1L << (curChar & 077);
        MatchLoop:do {
          switch (jjstateSet[--i]) {
            case 0:
            case 1:
              if ( (jjbitVec0[i2] & l2) == 0L) {
                break;
              }
              if (kind > 18) {
                kind = 18;
              }
              jjCheckNAdd(1);
              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_6(int pos, long active0) {
    switch (pos) {
      case 0:
        if ( (active0 & 0x8000000L) != 0L) {
          jjmatchedKind = 26;
          return -1;
        }
        return -1;
      case 1:
        if ( (active0 & 0x8000000L) != 0L) {
          if (jjmatchedPos == 0) {
            jjmatchedKind = 26;
            jjmatchedPos = 0;
          }
          return -1;
        }
        return -1;
      default:
        return -1;
    }
  }

  private final int jjStartNfa_6(int pos, long active0) {
    return jjMoveNfa_6(jjStopStringLiteralDfa_6(pos, active0), pos + 1);
  }

  private final int jjStartNfaWithStates_6(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_6(state, pos + 1);
  }

  private final int jjMoveStringLiteralDfa0_6() {
    switch (curChar) {
      case 45:
        return jjMoveStringLiteralDfa1_6(0x8000000L);
      default:
        return jjMoveNfa_6(1, 0);
    }
  }

  private final int jjMoveStringLiteralDfa1_6(long active0) {
    try {
      curChar = input_stream.readChar();
    }
    catch (java.io.IOException e) {
      jjStopStringLiteralDfa_6(0, active0);
      return 1;
    }
    switch (curChar) {
      case 45:
        return jjMoveStringLiteralDfa2_6(active0, 0x8000000L);
      default:
        break;
    }
    return jjStartNfa_6(0, active0);
  }

  private final int jjMoveStringLiteralDfa2_6(long old0, long active0) {
    if ( ( (active0 &= old0)) == 0L) {
      return jjStartNfa_6(0, old0);
    }
    try {
      curChar = input_stream.readChar();
    }
    catch (java.io.IOException e) {
      jjStopStringLiteralDfa_6(1, active0);
      return 2;
    }
    switch (curChar) {
      case 62:
        if ( (active0 & 0x8000000L) != 0L) {
          return jjStopAtPos(2, 27);
        }
        break;
      default:
        break;
    }
    return jjStartNfa_6(1, active0);
  }

  private final int jjMoveNfa_6(int startState, int curPos) {
    int[] nextStates;
    int startsAt = 0;
    jjnewStateCnt = 2;
    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 ( (0xffffdfffffffffffL & l) != 0L) {
                if (kind > 26) {
                  kind = 26;
                }
                jjCheckNAdd(0);
              }
              else if (curChar == 45) {
                if (kind > 26) {
                  kind = 26;
                }
              }
              break;
            case 0:
              if ( (0xffffdfffffffffffL & l) == 0L) {
                break;
              }
              kind = 26;
              jjCheckNAdd(0);
              break;
            default:
              break;
          }
        }
        while (i != startsAt);
      }
      else if (curChar < 128) {
        long l = 1L << (curChar & 077);
        MatchLoop:do {
          switch (jjstateSet[--i]) {
            case 1:
            case 0:
              kind = 26;
              jjCheckNAdd(0);
?? 文件大小 12116 K
?? 上傳用戶 liyuanhang
?? 所屬分類 Internet/網(wǎng)絡(luò)編程
??? 相關(guān)標(biāo)簽

#BBS-CS #JAVA #6.0 #源碼
?? 快捷鍵說明

復(fù)制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號 Ctrl + =
減小字號 Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

?? htmlparsertokenmanager.java

?? 快捷鍵說明
