📄 queryparsertokenmanager.java
字号:
/* Generated By:JavaCC: Do not edit this line. QueryParserTokenManager.java */package org.apache.lucene.queryParser;import java.io.IOException;import java.io.StringReader;import java.text.DateFormat;import java.text.Collator;import java.util.ArrayList;import java.util.Calendar;import java.util.Date;import java.util.HashMap;import java.util.List;import java.util.Locale;import java.util.Map;import java.util.Vector;import org.apache.lucene.analysis.Analyzer;import org.apache.lucene.analysis.TokenStream;import org.apache.lucene.document.DateField;import org.apache.lucene.document.DateTools;import org.apache.lucene.index.Term;import org.apache.lucene.search.BooleanClause;import org.apache.lucene.search.BooleanQuery;import org.apache.lucene.search.ConstantScoreRangeQuery;import org.apache.lucene.search.FuzzyQuery;import org.apache.lucene.search.MatchAllDocsQuery;import org.apache.lucene.search.MultiPhraseQuery;import org.apache.lucene.search.PhraseQuery;import org.apache.lucene.search.PrefixQuery;import org.apache.lucene.search.Query;import org.apache.lucene.search.RangeQuery;import org.apache.lucene.search.TermQuery;import org.apache.lucene.search.WildcardQuery;import org.apache.lucene.util.Parameter;/** Token Manager. */public class QueryParserTokenManager implements QueryParserConstants{ /** Debug output. */ public java.io.PrintStream debugStream = System.out; /** Set debug output. */ public void setDebugStream(java.io.PrintStream ds) { debugStream = ds; }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 int jjStopAtPos(int pos, int kind){ jjmatchedKind = kind; jjmatchedPos = pos; return pos + 1;}private int jjMoveStringLiteralDfa0_3(){ switch(curChar) { case 40: return jjStopAtPos(0, 13); case 41: return jjStopAtPos(0, 14); case 42: return jjStartNfaWithStates_3(0, 16, 36); case 43: return jjStopAtPos(0, 11); case 45: return jjStopAtPos(0, 12); case 58: return jjStopAtPos(0, 15); case 91: return jjStopAtPos(0, 23); case 94: return jjStopAtPos(0, 17); case 123: return jjStopAtPos(0, 24); default : return jjMoveNfa_3(0, 0); }}private 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);}static final long[] jjbitVec0 = { 0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL};static final long[] jjbitVec2 = { 0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL};private int jjMoveNfa_3(int startState, int curPos){ int startsAt = 0; jjnewStateCnt = 36; int i = 1; jjstateSet[0] = startState; int kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; do { switch(jjstateSet[--i]) { case 36: case 25: if ((0xfbfffcf8ffffd9ffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddTwoStates(25, 26); break; case 0: if ((0xfbffd4f8ffffd9ffL & l) != 0L) { if (kind > 22) kind = 22; jjCheckNAddTwoStates(25, 26); } else if ((0x100002600L & l) != 0L) { if (kind > 7) kind = 7; } else if (curChar == 34) jjCheckNAddStates(0, 2); else if (curChar == 33) { if (kind > 10) kind = 10; } if ((0x7bffd0f8ffffd9ffL & l) != 0L) { if (kind > 19) kind = 19; jjCheckNAddStates(3, 7); } else if (curChar == 42) { if (kind > 21) kind = 21; } if (curChar == 38) jjstateSet[jjnewStateCnt++] = 4; break; case 4: if (curChar == 38 && kind > 8) kind = 8; break; case 5: if (curChar == 38) jjstateSet[jjnewStateCnt++] = 4; break; case 13: if (curChar == 33 && kind > 10) kind = 10; break; case 14: if (curChar == 34) jjCheckNAddStates(0, 2); break; case 15: if ((0xfffffffbffffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 17: jjCheckNAddStates(0, 2); break; case 18: if (curChar == 34 && kind > 18) kind = 18; break; case 20: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 20) kind = 20; jjAddStates(8, 9); break; case 21: if (curChar == 46) jjCheckNAdd(22); break; case 22: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 20) kind = 20; jjCheckNAdd(22); break; case 23: if (curChar == 42 && kind > 21) kind = 21; break; case 24: if ((0xfbffd4f8ffffd9ffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddTwoStates(25, 26); break; case 27: if (kind > 22) kind = 22; jjCheckNAddTwoStates(25, 26); break; case 28: if ((0x7bffd0f8ffffd9ffL & l) == 0L) break; if (kind > 19) kind = 19; jjCheckNAddStates(3, 7); break; case 29: if ((0x7bfff8f8ffffd9ffL & l) == 0L) break; if (kind > 19) kind = 19; jjCheckNAddTwoStates(29, 30); break; case 31: if (kind > 19) kind = 19; jjCheckNAddTwoStates(29, 30); break; case 32: if ((0x7bfff8f8ffffd9ffL & l) != 0L) jjCheckNAddStates(10, 12); break; case 34: jjCheckNAddStates(10, 12); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); do { switch(jjstateSet[--i]) { case 36: if ((0x97ffffff87ffffffL & l) != 0L) { if (kind > 22) kind = 22; jjCheckNAddTwoStates(25, 26); } else if (curChar == 92) jjCheckNAddTwoStates(27, 27); break; case 0: if ((0x97ffffff87ffffffL & l) != 0L) { if (kind > 19) kind = 19; jjCheckNAddStates(3, 7); } else if (curChar == 92) jjCheckNAddStates(13, 15); else if (curChar == 126) { if (kind > 20) kind = 20; jjstateSet[jjnewStateCnt++] = 20; } if ((0x97ffffff87ffffffL & l) != 0L) { if (kind > 22) kind = 22; jjCheckNAddTwoStates(25, 26); } if (curChar == 78) jjstateSet[jjnewStateCnt++] = 11; else if (curChar == 124) jjstateSet[jjnewStateCnt++] = 8; else if (curChar == 79) jjstateSet[jjnewStateCnt++] = 6; else if (curChar == 65) jjstateSet[jjnewStateCnt++] = 2; break; case 1: if (curChar == 68 && kind > 8) kind = 8; break; case 2: if (curChar == 78) jjstateSet[jjnewStateCnt++] = 1; break; case 3: if (curChar == 65) jjstateSet[jjnewStateCnt++] = 2; break; case 6: if (curChar == 82 && kind > 9) kind = 9; break; case 7: if (curChar == 79) jjstateSet[jjnewStateCnt++] = 6; break; case 8: if (curChar == 124 && kind > 9) kind = 9; break; case 9: if (curChar == 124) jjstateSet[jjnewStateCnt++] = 8; break; case 10: if (curChar == 84 && kind > 10) kind = 10; break; case 11: if (curChar == 79) jjstateSet[jjnewStateCnt++] = 10; break; case 12: if (curChar == 78) jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0xffffffffefffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 16: if (curChar == 92) jjstateSet[jjnewStateCnt++] = 17; break; case 17: jjCheckNAddStates(0, 2); break; case 19: if (curChar != 126) break; if (kind > 20) kind = 20; jjstateSet[jjnewStateCnt++] = 20; break; case 24: if ((0x97ffffff87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddTwoStates(25, 26); break; case 25: if ((0x97ffffff87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddTwoStates(25, 26); break; case 26: if (curChar == 92) jjCheckNAddTwoStates(27, 27); break; case 27: if (kind > 22) kind = 22; jjCheckNAddTwoStates(25, 26); break; case 28: if ((0x97ffffff87ffffffL & l) == 0L) break; if (kind > 19) kind = 19; jjCheckNAddStates(3, 7); break; case 29: if ((0x97ffffff87ffffffL & l) == 0L) break; if (kind > 19) kind = 19; jjCheckNAddTwoStates(29, 30); break; case 30: if (curChar == 92) jjCheckNAddTwoStates(31, 31); break;
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -