JoaoJunior/formatted-java-code-APR · Datasets at Hugging Face

public IRubyObject extend(IRubyObject[] args) { checkArgumentCount(args, 1, -1); // Make sure all arguments are modules before calling the callbacks RubyClass module = getRuntime().getClass("Module"); for (int i = 0; i < args.length; i++) { if (!args[i].isKindOf(module)) { throw getRuntime().newTypeError(args[i], module); } } for (int i = 0; i < args.length; i++) { args[i].callMethod(getRuntime().getCurrentContext(), "extend_object", this); args[i].callMethod(getRuntime().getCurrentContext(), "extended", this); } return this; }

3,236,379

public IRubyObject extend(IRubyObject[] args) { checkArgumentCount(args, 1, -1); // Make sure all arguments are modules before calling the callbacks RubyClass module = getRuntime().getClass("Module"); for (int i = 0; i < args.length; i++) { if (!args[i].isKindOf(module)) { throw getRuntime().newTypeError(args[i], module); } } for (int i = 0; i < args.length; i++) { args[i].callMethod(getRuntime().getCurrentContext(), "extend_object", this); args[i].callMethod(getRuntime().getCurrentContext(), "extended", this); } return this; }

3,236,380

public MetaClass getSingletonClass() { RubyClass type = getMetaClass(); if (!type.isSingleton()) { type = makeMetaClass(type, type.getCRef()); } assert type instanceof MetaClass; if (!isNil()) { type.setTaint(isTaint()); type.setFrozen(isFrozen()); } return (MetaClass)type; }

3,236,381

public MetaClass getSingletonClass() { RubyClass type = getMetaClass(); if (!type.isSingleton()) { type = makeMetaClass(type, type.getCRef()); } assert type instanceof MetaClass; if (!isNil()) { type.setTaint(isTaint()); type.setFrozen(isFrozen()); } return (MetaClass)type; }

3,236,382

public RubyFixnum id() { return getRuntime().newFixnum(System.identityHashCode(this)); }

3,236,383

public IRubyObject infectBy(IRubyObject obj) { setTaint(isTaint() || obj.isTaint()); return this; }

3,236,384

public void initCopy(IRubyObject original) { assert original != null; assert !isFrozen() : "frozen object (" + getMetaClass().getName() + ") allocated"; setInstanceVariables(new HashMap(original.getInstanceVariables())); callMethod(getRuntime().getCurrentContext(), "initialize_copy", original); }

3,236,385

public IRubyObject instance_variable_get(IRubyObject var) { String varName = var.asSymbol(); if (!varName.startsWith("@")) { throw getRuntime().newNameError("`" + varName + "' is not allowable as an instance variable name"); } IRubyObject variable = getInstanceVariable(varName); // Pickaxe v2 says no var should show NameError, but ruby only sends back nil.. return variable == null ? getRuntime().getNil() : variable; }

3,236,386

public IRubyObject instance_variable_get(IRubyObject var) { String varName = var.asSymbol(); if (!varName.startsWith("@")) { throw getRuntime().newNameError("`" + varName + "' is not allowable as an instance variable name"); } IRubyObject variable = getInstanceVariable(varName); // Pickaxe v2 says no var should show NameError, but ruby only sends back nil.. return variable == null ? getRuntime().getNil() : variable; }

3,236,387

public IRubyObject instance_variable_get(IRubyObject var) { String varName = var.asSymbol(); if (!varName.startsWith("@")) { throw getRuntime().newNameError("`" + varName + "' is not allowable as an instance variable name"); } IRubyObject variable = getInstanceVariable(varName); // Pickaxe v2 says no var should show NameError, but ruby only sends back nil.. return variable == null ? getRuntime().getNil() : variable; }

3,236,388

public IRubyObject instance_variable_set(IRubyObject var, IRubyObject value) { String varName = var.asSymbol(); if (!varName.startsWith("@")) { throw getRuntime().newNameError("`" + varName + "' is not allowable as an instance variable name"); } return setInstanceVariable(var.asSymbol(), value); }

3,236,389

public IRubyObject instance_variable_set(IRubyObject var, IRubyObject value) { String varName = var.asSymbol(); if (!varName.startsWith("@")) { throw getRuntime().newNameError("`" + varName + "' is not allowable as an instance variable name"); } return setInstanceVariable(var.asSymbol(), value); }

3,236,390

public RubyArray instance_variables() { ArrayList names = new ArrayList(); for(Iterator iter = getInstanceVariablesSnapshot().keySet().iterator();iter.hasNext();) { String name = (String) iter.next(); // Do not include constants which also get stored in instance var list in classes. if (!Character.isUpperCase(name.charAt(0))) { names.add(getRuntime().newString(name)); } } return getRuntime().newArray(names); }

3,236,391

public IRubyObject method_missing(IRubyObject[] args) { if (args.length == 0) { throw getRuntime().newArgumentError("no id given"); } String name = args[0].asSymbol(); String description = callMethod(getRuntime().getCurrentContext(), "inspect").toString(); boolean noClass = description.length() > 0 && description.charAt(0) == '#'; ThreadContext tc = getRuntime().getCurrentContext(); Visibility lastVis = tc.getLastVisibility(); CallType lastCallType = tc.getLastCallType(); String format = lastVis.errorMessageFormat(lastCallType, name); String msg = new PrintfFormat(format).sprintf(new Object[] { name, description, noClass ? "" : ":", noClass ? "" : getType().getName()}); if (lastCallType == CallType.VARIABLE) { throw getRuntime().newNameError(msg); } throw getRuntime().newNoMethodError(msg); }

3,236,392

public IRubyObject methods(IRubyObject[] args) { checkArgumentCount(args, 0, 1); if (args.length == 0) { args = new IRubyObject[] { getRuntime().getTrue() }; } return getMetaClass().instance_methods(args); }

3,236,393

public IRubyObject send(IRubyObject[] args) { if (args.length < 1) { throw getRuntime().newArgumentError("no method name given"); } String name = args[0].asSymbol(); IRubyObject[] newArgs = new IRubyObject[args.length - 1]; System.arraycopy(args, 1, newArgs, 0, newArgs.length); ThreadContext tc = getRuntime().getCurrentContext(); tc.setIfBlockAvailable(); try { return callMethod(getRuntime().getCurrentContext(), name, newArgs, CallType.FUNCTIONAL); } finally { tc.clearIfBlockAvailable(); } }

3,236,394

public IRubyObject send(IRubyObject[] args) { if (args.length < 1) { throw getRuntime().newArgumentError("no method name given"); } String name = args[0].asSymbol(); IRubyObject[] newArgs = new IRubyObject[args.length - 1]; System.arraycopy(args, 1, newArgs, 0, newArgs.length); ThreadContext tc = getRuntime().getCurrentContext(); tc.setIfBlockAvailable(); try { return callMethod(getRuntime().getCurrentContext(), name, newArgs, CallType.FUNCTIONAL); } finally { tc.clearIfBlockAvailable(); } }

3,236,395

public RubyArray singleton_methods() { RubyArray result = getRuntime().newArray(); for (RubyClass type = getMetaClass(); type != null && type instanceof MetaClass; type = type.getSuperClass()) { for (Iterator iter = type.getMethods().entrySet().iterator(); iter.hasNext(); ) { Map.Entry entry = (Map.Entry) iter.next(); ICallable method = (ICallable) entry.getValue(); // We do not want to capture cached methods if (method.getImplementationClass() != type) { continue; } RubyString methodName = getRuntime().newString((String) entry.getKey()); if (method.getVisibility().isPublic() && ! result.includes(methodName)) { result.append(methodName); } } } return result; }

3,236,396

public RubyArray singleton_methods() { RubyArray result = getRuntime().newArray(); for (RubyClass type = getMetaClass(); type != null && type instanceof MetaClass; type = type.getSuperClass()) { for (Iterator iter = type.getMethods().entrySet().iterator(); iter.hasNext(); ) { Map.Entry entry = (Map.Entry) iter.next(); ICallable method = (ICallable) entry.getValue(); // We do not want to capture cached methods if (method.getImplementationClass() != type) { continue; } RubyString methodName = getRuntime().newString((String) entry.getKey()); if (method.getVisibility().isPublic() && ! result.includes(methodName)) { result.append(methodName); } } } return result; }

3,236,397

public IRubyObject specificEval(RubyModule mod, IRubyObject[] args) { ThreadContext tc = getRuntime().getCurrentContext(); if (tc.isBlockGiven()) { if (args.length > 0) { throw getRuntime().newArgumentError(args.length, 0); } return yieldUnder(mod); } if (args.length == 0) { throw getRuntime().newArgumentError("block not supplied"); } else if (args.length > 3) { String lastFuncName = tc.getFrameLastFunc(); throw getRuntime().newArgumentError( "wrong # of arguments: " + lastFuncName + "(src) or " + lastFuncName + "{..}"); } /* if (ruby.getSecurityLevel() >= 4) { Check_Type(argv[0], T_STRING); } else { Check_SafeStr(argv[0]); } */ IRubyObject file = args.length > 1 ? args[1] : getRuntime().newString("(eval)"); IRubyObject line = args.length > 2 ? args[2] : RubyFixnum.one(getRuntime()); Visibility savedVisibility = tc.getCurrentVisibility(); tc.setCurrentVisibility(Visibility.PUBLIC); try { return evalUnder(mod, args[0], file, line); } finally { tc.setCurrentVisibility(savedVisibility); } }

3,236,398

private IRubyObject yieldUnder(RubyModule under) { return under.executeUnder(new Callback() { public IRubyObject execute(IRubyObject self, IRubyObject[] args) { ThreadContext context = getRuntime().getCurrentContext(); Block block = (Block) context.getCurrentBlock(); Visibility savedVisibility = block.getVisibility(); block.setVisibility(Visibility.PUBLIC); try { IRubyObject valueInYield = args[0]; IRubyObject selfInYield = args[0]; return context.yieldCurrentBlock(valueInYield, selfInYield, context.getRubyClass(), false); //TODO: Should next and return also catch here? } catch (JumpException je) { if (je.getJumpType() == JumpException.JumpType.BreakJump) { IRubyObject breakValue = (IRubyObject)je.getPrimaryData(); return breakValue == null ? getRuntime().getNil() : breakValue; } else { throw je; } } finally { block.setVisibility(savedVisibility); } } public Arity getArity() { return Arity.optional(); } }, new IRubyObject[] { this }); }

3,236,399

public IRubyObject execute(IRubyObject self, IRubyObject[] args) { ThreadContext context = getRuntime().getCurrentContext(); Block block = (Block) context.getCurrentBlock(); Visibility savedVisibility = block.getVisibility(); block.setVisibility(Visibility.PUBLIC); try { IRubyObject valueInYield = args[0]; IRubyObject selfInYield = args[0]; return context.yieldCurrentBlock(valueInYield, selfInYield, context.getRubyClass(), false); //TODO: Should next and return also catch here? } catch (JumpException je) { if (je.getJumpType() == JumpException.JumpType.BreakJump) { IRubyObject breakValue = (IRubyObject)je.getPrimaryData(); return breakValue == null ? getRuntime().getNil() : breakValue; } else { throw je; } } finally { block.setVisibility(savedVisibility); } }

3,236,400

public List getImagesDiffInUserDatasetsNotInCategoryGroup(CategoryData data) { return abstraction.retrieveImagesDiffInUserDatasetsNotInCategoryGroup( data); }

public List getImagesDiffInUserDatasetsNotInCategoryGroup(CategoryData data, List datasets) { return abstraction.retrieveImagesDiffInUserDatasetsNotInCategoryGroup( data); }

3,236,401

public List getImagesDiffInUserDatasetsNotInCategoryGroup(CategoryData data) { return abstraction.retrieveImagesDiffInUserDatasetsNotInCategoryGroup( data); }

public List getImagesDiffInUserDatasetsNotInCategoryGroup(CategoryData data) { return abstraction.retrieveImagesDiffInUserDatasetsNotInCategoryGroup( data, datasets); }

3,236,402

public List getImagesInUserDatasetsDiff(DatasetData data) { return abstraction.getImagesInUserDatasetsDiff(data); }

public List getImagesInUserDatasetsDiff(DatasetData data, List datasets) { return abstraction.getImagesInUserDatasetsDiff(data); }

3,236,403

public List getImagesInUserDatasetsDiff(DatasetData data) { return abstraction.getImagesInUserDatasetsDiff(data); }

public List getImagesInUserDatasetsDiff(DatasetData data) { return abstraction.getImagesInUserDatasetsDiff(data, datasets); }

3,236,404

public List getImagesInUserDatasetsNotInCategoryGroup(CategoryGroupData group) { try { return abstraction.retrieveImagesInUserDatasetsNotInCategoryGroup( group); } catch(DSAccessException dsae) { String s = "Can't retrieve the images."; getRegistry().getLogger().error(this, s+" Error: "+dsae); getRegistry().getUserNotifier().notifyError("Data Retrieval " + "Failure", s, dsae); } return new ArrayList(); }

public List getImagesInUserDatasetsNotInCategoryGroup(CategoryGroupData group, List datasets) { try { return abstraction.retrieveImagesInUserDatasetsNotInCategoryGroup( group); } catch(DSAccessException dsae) { String s = "Can't retrieve the images."; getRegistry().getLogger().error(this, s+" Error: "+dsae); getRegistry().getUserNotifier().notifyError("Data Retrieval " + "Failure", s, dsae); } return new ArrayList(); }

3,236,405

public List getImagesInUserDatasetsNotInCategoryGroup(CategoryGroupData group) { try { return abstraction.retrieveImagesInUserDatasetsNotInCategoryGroup( group); } catch(DSAccessException dsae) { String s = "Can't retrieve the images."; getRegistry().getLogger().error(this, s+" Error: "+dsae); getRegistry().getUserNotifier().notifyError("Data Retrieval " + "Failure", s, dsae); } return new ArrayList(); }

public List getImagesInUserDatasetsNotInCategoryGroup(CategoryGroupData group) { try { return abstraction.retrieveImagesInUserDatasetsNotInCategoryGroup( group, datasets); } catch(DSAccessException dsae) { String s = "Can't retrieve the images."; getRegistry().getLogger().error(this, s+" Error: "+dsae); getRegistry().getUserNotifier().notifyError("Data Retrieval " + "Failure", s, dsae); } return new ArrayList(); }

3,236,406

List getUserDatasets() { try { return abstraction.getUserDatasets(); } catch(DSAccessException dsae) { String s = "Can't retrieve user's datasets."; getRegistry().getLogger().error(this, s+" Error: "+dsae); getRegistry().getUserNotifier().notifyError("Data Retrieval " + "Failure", s, dsae); } return null; }

public List getUserDatasets() { try { return abstraction.getUserDatasets(); } catch(DSAccessException dsae) { String s = "Can't retrieve user's datasets."; getRegistry().getLogger().error(this, s+" Error: "+dsae); getRegistry().getUserNotifier().notifyError("Data Retrieval " + "Failure", s, dsae); } return null; }

3,236,407

public String toString(){ return "OmeSession"+(sessionId==null ? ":Hash"+this.hashCode() : ":"+sessionId); }

public String toString(){ return "OmeSession"+(sessionId==null ? ":Hash_"+this.hashCode() : ":Id_"+sessionId); }

3,236,409

public void testAddClass() { ClassData classData; assertEquals(0, packageData.getNumberOfChildren()); classData = new ClassData("com.example.HelloWorld"); classData.setSourceFileName("com/example/HelloWorld.java"); for (int i = 0; i < 10; i++) classData.addLine(i, "test", "(I)B"); packageData.addClassData(classData); assertEquals(1, packageData.getNumberOfChildren()); assertTrue(packageData.contains(classData.getBaseName())); classData = new ClassData("com.example.HelloWorldHelper"); classData.setSourceFileName("com/example/HelloWorldHelper.java"); for (int i = 0; i < 14; i++) classData.addLine(i, "test", "(I)B"); packageData.addClassData(classData); assertEquals(2, packageData.getNumberOfChildren()); assertTrue(packageData.contains(classData.getBaseName())); // See what happens when we try to add the same class twice classData = new ClassData("com.example.HelloWorld"); classData.setSourceFileName("com/example/HelloWorld.java"); for (int i = 0; i < 19; i++) classData.addLine(i, "test", "(I)B"); try { packageData.addClassData(classData); // removed by Jeremy Thomerson when changing PackageData // fail("Expected an IllegalArgumentException but did not receive one!"); } catch (IllegalArgumentException e) { // Good! } assertEquals(2, packageData.getNumberOfChildren()); }

3,236,410

public void testAddClass() { ClassData classData; assertEquals(0, packageData.getNumberOfChildren()); classData = new ClassData("com.example.HelloWorld"); classData.setSourceFileName("com/example/HelloWorld.java"); for (int i = 0; i < 10; i++) classData.addLine(i, "test", "(I)B"); packageData.addClassData(classData); assertEquals(1, packageData.getNumberOfChildren()); assertTrue(packageData.contains(classData.getBaseName())); classData = new ClassData("com.example.HelloWorldHelper"); classData.setSourceFileName("com/example/HelloWorldHelper.java"); for (int i = 0; i < 14; i++) classData.addLine(i, "test", "(I)B"); packageData.addClassData(classData); assertEquals(2, packageData.getNumberOfChildren()); assertTrue(packageData.contains(classData.getBaseName())); // See what happens when we try to add the same class twice classData = new ClassData("com.example.HelloWorld"); classData.setSourceFileName("com/example/HelloWorld.java"); for (int i = 0; i < 19; i++) classData.addLine(i, "test", "(I)B"); try { packageData.addClassData(classData); // removed by Jeremy Thomerson when changing PackageData // fail("Expected an IllegalArgumentException but did not receive one!"); } catch (IllegalArgumentException e) { // Good! } assertEquals(2, packageData.getNumberOfChildren()); }

3,236,411

private void generateSourceFileList(PackageData packageData) throws IOException { String filename; SortedSet sourceFiles; if (packageData == null) { filename = "frame-sourcefiles.html"; sourceFiles = projectData.getSourceFiles(); } else { filename = "frame-sourcefiles-" + packageData.getName() + ".html"; sourceFiles = packageData.getSourceFiles(); } // sourceFiles is sorted, but it's sorted by the full path // to the file, and we only want to sort based on the // file's basename. Vector sortedSourceFiles = new Vector(); sortedSourceFiles.addAll(sourceFiles); Collections.sort(sortedSourceFiles, new SourceFileDataBaseNameComparator()); File file = new File(destinationDir, filename); PrintStream out = null; try { out = new PrintStream(new FileOutputStream(file)); out.println("<html>"); out.println("<head>"); out.println("<title>Coverage Report Classes</title>"); out .println("<link title=\"Style\" type=\"text/css\" rel=\"stylesheet\" href=\"css/main.css\" />"); out.println("</head>"); out.println("<body>"); out.println("<h5>"); out.println(packageData == null ? "All Packages" : generatePackageName(packageData)); out.println("</h5>"); out.println("<h5>Classes</h5>"); out.println("<table width=\"100%\">"); for (Iterator iter = sortedSourceFiles.iterator(); iter .hasNext();) { SourceFileData sourceFileData = (SourceFileData)iter.next(); out.println("<tr>"); String percentCovered; if (sourceFileData.getNumberOfValidLines() > 0) percentCovered = getPercentValue(sourceFileData .getLineCoverageRate()); else percentCovered = "N/A"; out .println("<td nowrap=\"nowrap\"><a target=\"summary\" href=\"" + sourceFileData.getNormalizedName() + ".html\">" + sourceFileData.getBaseName() + "</a> <i>(" + percentCovered + ")</i></td>"); out.println("</tr>"); } out.println("</td>"); out.println("</tr>"); out.println("</table>"); out.println("</body>"); out.println("</html>"); } finally { if (out != null) { out.close(); } } }

3,236,412

private void generateSourceFileList(PackageData packageData) throws IOException { String filename; SortedSet sourceFiles; if (packageData == null) { filename = "frame-sourcefiles.html"; sourceFiles = projectData.getSourceFiles(); } else { filename = "frame-sourcefiles-" + packageData.getName() + ".html"; sourceFiles = packageData.getSourceFiles(); } // sourceFiles is sorted, but it's sorted by the full path // to the file, and we only want to sort based on the // file's basename. Vector sortedSourceFiles = new Vector(); sortedSourceFiles.addAll(sourceFiles); Collections.sort(sortedSourceFiles, new SourceFileDataBaseNameComparator()); File file = new File(destinationDir, filename); PrintStream out = null; try { out = new PrintStream(new FileOutputStream(file)); out.println("<html>"); out.println("<head>"); out.println("<title>Coverage Report Classes</title>"); out .println("<link title=\"Style\" type=\"text/css\" rel=\"stylesheet\" href=\"css/main.css\" />"); out.println("</head>"); out.println("<body>"); out.println("<h5>"); out.println(packageData == null ? "All Packages" : generatePackageName(packageData)); out.println("</h5>"); out.println("<h5>Classes</h5>"); out.println("<table width=\"100%\">"); for (Iterator iter = sortedSourceFiles.iterator(); iter .hasNext();) { SourceFileData sourceFileData = (SourceFileData)iter.next(); out.println("<tr>"); String percentCovered; if (sourceFileData.getNumberOfValidLines() > 0) percentCovered = getPercentValue(sourceFileData .getLineCoverageRate()); else percentCovered = "N/A"; out .println("<td nowrap=\"nowrap\"><a target=\"summary\" href=\"" + sourceFileData.getNormalizedName() + ".html\">" + sourceFileData.getBaseName() + "</a> <i>(" + percentCovered + ")</i></td>"); out.println("</tr>"); } out.println("</td>"); out.println("</tr>"); out.println("</table>"); out.println("</body>"); out.println("</html>"); } finally { if (out != null) { out.close(); } } }

3,236,413

private String generateTableRowForTotal() { StringBuffer ret = new StringBuffer(); double lineCoverage = -1; double branchCoverage = -1; double ccn = Util.getCCN(sourceDir, true); if (projectData.getNumberOfValidLines() > 0) lineCoverage = projectData.getLineCoverageRate(); if (projectData.getNumberOfValidBranches() > 0) branchCoverage = projectData.getBranchCoverageRate(); ret.append(" <tr>"); ret.append("<td class=\"text\"><b>All Packages</b></td>"); ret.append("<td class=\"value\">" + projectData.getNumberOfClasses() + "</td>"); ret.append(generateTableColumnsFromData(lineCoverage, branchCoverage, ccn)); ret.append("</tr>"); return ret.toString(); }

3,236,414

public void propertyChange(PropertyChangeEvent pce) { Browser browser = model.getBrowser(); ImageDisplay d = browser.getSelectedDisplay(); if (Browser.POPUP_POINT_PROPERTY.equals(pce.getPropertyName())) { Point p = browser.getPopupPoint(); if (d != null && p != null) view.showPopup(d, p); } else { //THUMB_SELECTED_PROPERTY ThumbWinManager.display((ImageNode) d); } }

public void propertyChange(PropertyChangeEvent pce) { Browser browser = model.getBrowser(); ImageDisplay d = browser.getSelectedDisplay(); if (Browser.POPUP_POINT_PROPERTY.equals(pce.getPropertyName())) { Point p = browser.getPopupPoint(); if (d != null && p != null) view.showPopup(d, p); } else { //THUMB_SELECTED_PROPERTY ThumbWinManager.display((ImageNode) d, model); } }

3,236,415

private void setIdleListener() throws Exception { final Timer timer = new Timer(); timer.scheduleAtFixedRate(new TimerTask() { public void run() { LocalPreferences localPref = SettingsManager.getLocalPreferences(); int delay = 0; if (localPref.isIdleOn()) { delay = localPref.getIdleTime() * 6000; } else { return; } long idleTime = SystemInfo.getSessionIdleTime(); boolean isLocked = SystemInfo.isSessionLocked(); if (idleTime > delay) { try { // Handle if spark is not connected to the server. if (SparkManager.getConnection() == null || !SparkManager.getConnection().isConnected()) { return; } // Change Status Workspace workspace = SparkManager.getWorkspace(); Presence presence = workspace.getStatusBar().getPresence(); if (workspace != null && presence.getMode() == Presence.Mode.available) { unavaliable = true; StatusItem away = workspace.getStatusBar().getStatusItem("Away"); Presence p = away.getPresence(); if (isLocked) { p.setStatus(Res.getString("message.locked.workstation")); } else { p.setStatus(Res.getString("message.away.idle")); } previousPriority = presence.getPriority(); p.setPriority(0); SparkManager.getSessionManager().changePresence(p); } } catch (Exception e) { Log.error("Error with IDLE status.", e); timer.cancel(); } } else { if (unavaliable) { setAvailableIfActive(); } } } }, 1000, 1000); }

private void setIdleListener() throws Exception { final Timer timer = new Timer(); timer.scheduleAtFixedRate(new TimerTask() { public void run() { LocalPreferences localPref = SettingsManager.getLocalPreferences(); int delay = 0; if (localPref.isIdleOn()) { delay = localPref.getIdleTime() * 60000; } else { return; } long idleTime = SystemInfo.getSessionIdleTime(); boolean isLocked = SystemInfo.isSessionLocked(); if (idleTime > delay) { try { // Handle if spark is not connected to the server. if (SparkManager.getConnection() == null || !SparkManager.getConnection().isConnected()) { return; } // Change Status Workspace workspace = SparkManager.getWorkspace(); Presence presence = workspace.getStatusBar().getPresence(); if (workspace != null && presence.getMode() == Presence.Mode.available) { unavaliable = true; StatusItem away = workspace.getStatusBar().getStatusItem("Away"); Presence p = away.getPresence(); if (isLocked) { p.setStatus(Res.getString("message.locked.workstation")); } else { p.setStatus(Res.getString("message.away.idle")); } previousPriority = presence.getPriority(); p.setPriority(0); SparkManager.getSessionManager().changePresence(p); } } catch (Exception e) { Log.error("Error with IDLE status.", e); timer.cancel(); } } else { if (unavaliable) { setAvailableIfActive(); } } } }, 1000, 1000); }

3,236,416

public void run() { LocalPreferences localPref = SettingsManager.getLocalPreferences(); int delay = 0; if (localPref.isIdleOn()) { delay = localPref.getIdleTime() * 6000; } else { return; } long idleTime = SystemInfo.getSessionIdleTime(); boolean isLocked = SystemInfo.isSessionLocked(); if (idleTime > delay) { try { // Handle if spark is not connected to the server. if (SparkManager.getConnection() == null || !SparkManager.getConnection().isConnected()) { return; } // Change Status Workspace workspace = SparkManager.getWorkspace(); Presence presence = workspace.getStatusBar().getPresence(); if (workspace != null && presence.getMode() == Presence.Mode.available) { unavaliable = true; StatusItem away = workspace.getStatusBar().getStatusItem("Away"); Presence p = away.getPresence(); if (isLocked) { p.setStatus(Res.getString("message.locked.workstation")); } else { p.setStatus(Res.getString("message.away.idle")); } previousPriority = presence.getPriority(); p.setPriority(0); SparkManager.getSessionManager().changePresence(p); } } catch (Exception e) { Log.error("Error with IDLE status.", e); timer.cancel(); } } else { if (unavaliable) { setAvailableIfActive(); } } }

public void run() { LocalPreferences localPref = SettingsManager.getLocalPreferences(); int delay = 0; if (localPref.isIdleOn()) { delay = localPref.getIdleTime() * 60000; } else { return; } long idleTime = SystemInfo.getSessionIdleTime(); boolean isLocked = SystemInfo.isSessionLocked(); if (idleTime > delay) { try { // Handle if spark is not connected to the server. if (SparkManager.getConnection() == null || !SparkManager.getConnection().isConnected()) { return; } // Change Status Workspace workspace = SparkManager.getWorkspace(); Presence presence = workspace.getStatusBar().getPresence(); if (workspace != null && presence.getMode() == Presence.Mode.available) { unavaliable = true; StatusItem away = workspace.getStatusBar().getStatusItem("Away"); Presence p = away.getPresence(); if (isLocked) { p.setStatus(Res.getString("message.locked.workstation")); } else { p.setStatus(Res.getString("message.away.idle")); } previousPriority = presence.getPriority(); p.setPriority(0); SparkManager.getSessionManager().changePresence(p); } } catch (Exception e) { Log.error("Error with IDLE status.", e); timer.cancel(); } } else { if (unavaliable) { setAvailableIfActive(); } } }

3,236,417

public void marshalTo(MarshalStream output) throws java.io.IOException { if (value <= Integer.MAX_VALUE) { output.write('i'); output.dumpInt((int) value); } else { output.dumpObject(RubyBignum.newBignum(runtime, value)); } }

public void marshalTo(MarshalStream output) throws java.io.IOException { if (value <= MAX_MARSHAL_FIXNUM) { output.write('i'); output.dumpInt((int) value); } else { output.dumpObject(RubyBignum.newBignum(runtime, value)); } }

3,236,418

public RubyFixnum size() { return newFixnum(4); }

public RubyFixnum size() { return newFixnum((long) Math.ceil(BIT_SIZE / 8.0)); }

3,236,419

public void perform(WikiSystem wiki, WebContext wc, WikiUser user, WikiPage page) throws PageAction.PageActionException { // nothing to do here String prefix = wc.getForm("PREFIX"); if (prefix != null) user.setAttribute("LastUserListLetter", prefix); }

publicvoidperform(WikiSystemwiki,WebContextwc,WikiUseruser,WikiPagepage)throwsPageAction.PageActionException{//nothingtodohereStringprefix=wc.getForm("PREFIX");if(prefix!=null)user.setAttribute("LastUserListLetter",prefix);}

3,236,421

public List getImageComponents() { switch (model.getState()) { case NEW: case LOADING_RENDERING_CONTROL: case DISCARDED: throw new IllegalStateException( "This method can't be invoked in the DISCARDED, NEW or" + "LOADING_RENDERING_CONTROL state."); } if (model.getColorModel().equals(GREY_SCALE_MODEL)) return null; List l = model.getActiveChannels(); if (l.size() < 2) return null; Iterator i = l.iterator(); int index; ArrayList images = new ArrayList(l.size()); while (i.hasNext()) { index = ((Integer) i.next()).intValue(); for (int j = 0; j < model.getMaxC(); j++) model.setChannelActive(j, j == index); images.add(model.getRenderedImage()); } i = l.iterator(); while (i.hasNext()) { //reset values. index = ((Integer) i.next()).intValue(); model.setChannelActive(index, true); } return images; }

3,236,422

public static String getVersion() { return "2.0.1"; }

public static String getVersion() { return "2.0.1.1"; }

3,236,426

protected InputStream loadResource(String uri) { if (System.getProperty("xbean.dir") != null) { File f = new File(System.getProperty("xbean.dir") + uri); try { return new FileInputStream(f); } catch (FileNotFoundException e) { // Ignore } } // lets try the thread context class loader first InputStream in = Thread.currentThread().getContextClassLoader().getResourceAsStream(uri); if (in == null) { in = getClass().getClassLoader().getResourceAsStream(uri); if (in == null) { logger.debug("Could not find resource: " + uri); } } return in; }

protected InputStream loadResource(String uri) { if (System.getProperty("xbean.dir") != null) { File f = new File(System.getProperty("xbean.dir") + uri); try { return new FileInputStream(f); } catch (FileNotFoundException e) { // Ignore } } // lets try the thread context class loader first InputStream in = Thread.currentThread().getContextClassLoader().getResourceAsStream(uri); if (in == null) { ClassLoader cl = getBeanDefinitionReader().getBeanClassLoader(); if (cl != null) { in = cl.getResourceAsStream(uri); } if (in == null) { logger.debug("Could not find resource: " + uri); } } return in; }

3,236,427

protected InputStream loadResource(String uri) { if (System.getProperty("xbean.dir") != null) { File f = new File(System.getProperty("xbean.dir") + uri); try { return new FileInputStream(f); } catch (FileNotFoundException e) { // Ignore } } // lets try the thread context class loader first InputStream in = Thread.currentThread().getContextClassLoader().getResourceAsStream(uri); if (in == null) { in = getClass().getClassLoader().getResourceAsStream(uri); if (in == null) { logger.debug("Could not find resource: " + uri); } } return in; }

protected InputStream loadResource(String uri) { if (System.getProperty("xbean.dir") != null) { File f = new File(System.getProperty("xbean.dir") + uri); try { return new FileInputStream(f); } catch (FileNotFoundException e) { // Ignore } } // lets try the thread context class loader first InputStream in = Thread.currentThread().getContextClassLoader().getResourceAsStream(uri); if (in == null) { in = getClass().getClassLoader().getResourceAsStream(uri); if (in == null) { in = getClass().getClassLoader().getResourceAsStream(uri); if (in == null) { logger.debug("Could not find resource: " + uri); } } } return in; }

3,236,428

public RubyFixnum hash() { return getRuntime().newFixnum(symbol.hashCode()); }

public RubyFixnum hash() { return getRuntime().newFixnum(hashCode()); }

3,236,429

public Object invoke(Object proxy, Method method, Object[] args) throws Throwable { IRubyObject result = getRuntime().getNil(); RubyHash interfaceProcs = (RubyHash) getInstanceVariable("interfaceProcs"); RubyString methodName = RubyString.newString(getRuntime(), method.getName()); IRubyObject proc; IRubyObject rubyMethod; if (!(proc = interfaceProcs.aref(methodName)).isNil()) { IRubyObject[] rubyArgs = JavaUtil.convertJavaArrayToRuby(getRuntime(), args); result = ((RubyProc) proc).call(rubyArgs).toRubyObject(); } else if (!(rubyMethod = method(methodName)).isNil()) { IRubyObject[] rubyArgs = JavaUtil.convertJavaArrayToRuby(getRuntime(), args); result = ((RubyMethod) rubyMethod).call(rubyArgs); } else { IRubyObject[] rubyArgs = new IRubyObject[args.length + 1]; for (int i = 0; i < args.length; i++) { rubyArgs[i + 1] = JavaUtil.convertJavaToRuby(getRuntime(), args[i]); } result = callMethod("send", rubyArgs); } return JavaUtil.convertRubyToJava(getRuntime(), result, method.getReturnType()); }

public Object invoke(Object proxy, Method method, Object[] args) throws Throwable { IRubyObject result = getRuntime().getNil(); RubyHash interfaceProcs = (RubyHash) getInstanceVariable("interfaceProcs"); RubyString methodName = RubyString.newString(getRuntime(), method.getName()); IRubyObject proc; IRubyObject rubyMethod; if (!(proc = interfaceProcs.aref(methodName)).isNil()) { IRubyObject[] rubyArgs = JavaUtil.convertJavaArrayToRuby(getRuntime(), args); result = ((RubyProc) proc).call(rubyArgs); } else if (!(rubyMethod = method(methodName)).isNil()) { IRubyObject[] rubyArgs = JavaUtil.convertJavaArrayToRuby(getRuntime(), args); result = ((RubyMethod) rubyMethod).call(rubyArgs); } else { IRubyObject[] rubyArgs = new IRubyObject[args.length + 1]; for (int i = 0; i < args.length; i++) { rubyArgs[i + 1] = JavaUtil.convertJavaToRuby(getRuntime(), args[i]); } result = callMethod("send", rubyArgs); } return JavaUtil.convertRubyToJava(getRuntime(), result, method.getReturnType()); }

3,236,430

public ChatRoomImpl(final String participantJID, String participantNickname, String title) { this.participantJID = participantJID; this.participantNickname = participantNickname; AndFilter presenceFilter = new AndFilter(new PacketTypeFilter(Presence.class), new BareAddressFilter(participantJID)); // Register PacketListeners AndFilter messageFilter = new AndFilter(new PacketTypeFilter(Message.class), new BareAddressFilter(participantJID)); SparkManager.getConnection().addPacketListener(this, messageFilter); SparkManager.getConnection().addPacketListener(this, presenceFilter); // The roomname will be the participantJID this.roomname = participantJID; // Use the agents username as the Tab Title this.tabTitle = title; // The name of the room will be the node of the user jid + conversation. final SimpleDateFormat formatter = new SimpleDateFormat("h:mm a"); this.roomTitle = participantNickname; // Add RoomInfo this.getSplitPane().setRightComponent(null); getSplitPane().setDividerSize(0); roster = SparkManager.getConnection().getRoster(); presence = roster.getPresence(participantJID); RosterEntry entry = roster.getEntry(participantJID); tabIcon = SparkManager.getUserManager().getTabIconForPresence(presence); PacketFilter filter = new AndFilter(new PacketTypeFilter(Presence.class), new FromContainsFilter(participantJID)); SparkManager.getConnection().addPacketListener(new PacketListener() { public void processPacket(Packet packet) { presence = (Presence)packet; } }, filter); // Create toolbar buttons. ChatRoomButton infoButton = new ChatRoomButton("", SparkRes.getImageIcon(SparkRes.PROFILE_IMAGE_24x24)); infoButton.setToolTipText(Res.getString("message.view.information.about.this.user")); // Create basic toolbar. getToolBar().addChatRoomButton(infoButton); // If the user is not in the roster, then allow user to add them. if (entry == null && !StringUtils.parseResource(participantJID).equals(participantNickname)) { ChatRoomButton addToRosterButton = new ChatRoomButton("", SparkRes.getImageIcon(SparkRes.ADD_IMAGE_24x24)); addToRosterButton.setToolTipText(Res.getString("message.add.this.user.to.your.roster")); getToolBar().addChatRoomButton(addToRosterButton); addToRosterButton.addActionListener(new ActionListener() { public void actionPerformed(ActionEvent e) { RosterDialog rosterDialog = new RosterDialog(); rosterDialog.setDefaultJID(participantJID); rosterDialog.setDefaultNickname(getParticipantNickname()); rosterDialog.showRosterDialog(SparkManager.getChatManager().getChatContainer().getChatFrame()); } }); } // Show VCard. infoButton.addActionListener(new ActionListener() { public void actionPerformed(ActionEvent e) { VCardManager vcard = SparkManager.getVCardManager(); vcard.viewProfile(participantJID, SparkManager.getChatManager().getChatContainer()); } }); // If this is a private chat from a group chat room, do not show toolbar. if (StringUtils.parseResource(participantJID).equals(participantNickname)) { getToolBar().setVisible(false); } typingTimer = new Timer(2000, new ActionListener() { public void actionPerformed(ActionEvent e) { if(!sendTypingNotification) { return; } long now = System.currentTimeMillis(); if (now - lastTypedCharTime > 2000) { if (!sendNotification) { // send cancel SparkManager.getMessageEventManager().sendCancelledNotification(getParticipantJID(), threadID); sendNotification = true; } } } }); typingTimer.start(); lastActivity = System.currentTimeMillis(); // Add VCard Panel final VCardPanel vcardPanel = new VCardPanel(participantJID); getToolBar().add(vcardPanel, new GridBagConstraints(0, 1, 1, 1, 1.0, 0.0, GridBagConstraints.WEST, GridBagConstraints.HORIZONTAL, new Insets(5, 5, 5, 5), 0, 0)); }

public ChatRoomImpl(final String participantJID, String participantNickname, String title) { this.participantJID = participantJID; this.participantNickname = participantNickname; AndFilter presenceFilter = new AndFilter(new PacketTypeFilter(Presence.class), new FromContainsFilter(participantJID)); // Register PacketListeners AndFilter messageFilter = new AndFilter(new PacketTypeFilter(Message.class), new BareAddressFilter(participantJID)); SparkManager.getConnection().addPacketListener(this, messageFilter); SparkManager.getConnection().addPacketListener(this, presenceFilter); // The roomname will be the participantJID this.roomname = participantJID; // Use the agents username as the Tab Title this.tabTitle = title; // The name of the room will be the node of the user jid + conversation. final SimpleDateFormat formatter = new SimpleDateFormat("h:mm a"); this.roomTitle = participantNickname; // Add RoomInfo this.getSplitPane().setRightComponent(null); getSplitPane().setDividerSize(0); roster = SparkManager.getConnection().getRoster(); presence = roster.getPresence(participantJID); RosterEntry entry = roster.getEntry(participantJID); tabIcon = SparkManager.getUserManager().getTabIconForPresence(presence); PacketFilter filter = new AndFilter(new PacketTypeFilter(Presence.class), new FromContainsFilter(participantJID)); SparkManager.getConnection().addPacketListener(new PacketListener() { public void processPacket(Packet packet) { presence = (Presence)packet; } }, filter); // Create toolbar buttons. ChatRoomButton infoButton = new ChatRoomButton("", SparkRes.getImageIcon(SparkRes.PROFILE_IMAGE_24x24)); infoButton.setToolTipText(Res.getString("message.view.information.about.this.user")); // Create basic toolbar. getToolBar().addChatRoomButton(infoButton); // If the user is not in the roster, then allow user to add them. if (entry == null && !StringUtils.parseResource(participantJID).equals(participantNickname)) { ChatRoomButton addToRosterButton = new ChatRoomButton("", SparkRes.getImageIcon(SparkRes.ADD_IMAGE_24x24)); addToRosterButton.setToolTipText(Res.getString("message.add.this.user.to.your.roster")); getToolBar().addChatRoomButton(addToRosterButton); addToRosterButton.addActionListener(new ActionListener() { public void actionPerformed(ActionEvent e) { RosterDialog rosterDialog = new RosterDialog(); rosterDialog.setDefaultJID(participantJID); rosterDialog.setDefaultNickname(getParticipantNickname()); rosterDialog.showRosterDialog(SparkManager.getChatManager().getChatContainer().getChatFrame()); } }); } // Show VCard. infoButton.addActionListener(new ActionListener() { public void actionPerformed(ActionEvent e) { VCardManager vcard = SparkManager.getVCardManager(); vcard.viewProfile(participantJID, SparkManager.getChatManager().getChatContainer()); } }); // If this is a private chat from a group chat room, do not show toolbar. if (StringUtils.parseResource(participantJID).equals(participantNickname)) { getToolBar().setVisible(false); } typingTimer = new Timer(2000, new ActionListener() { public void actionPerformed(ActionEvent e) { if(!sendTypingNotification) { return; } long now = System.currentTimeMillis(); if (now - lastTypedCharTime > 2000) { if (!sendNotification) { // send cancel SparkManager.getMessageEventManager().sendCancelledNotification(getParticipantJID(), threadID); sendNotification = true; } } } }); typingTimer.start(); lastActivity = System.currentTimeMillis(); // Add VCard Panel final VCardPanel vcardPanel = new VCardPanel(participantJID); getToolBar().add(vcardPanel, new GridBagConstraints(0, 1, 1, 1, 1.0, 0.0, GridBagConstraints.WEST, GridBagConstraints.HORIZONTAL, new Insets(5, 5, 5, 5), 0, 0)); }

3,236,431

public ChatRoomImpl(final String participantJID, String participantNickname, String title) { this.participantJID = participantJID; this.participantNickname = participantNickname; AndFilter presenceFilter = new AndFilter(new PacketTypeFilter(Presence.class), new BareAddressFilter(participantJID)); // Register PacketListeners AndFilter messageFilter = new AndFilter(new PacketTypeFilter(Message.class), new BareAddressFilter(participantJID)); SparkManager.getConnection().addPacketListener(this, messageFilter); SparkManager.getConnection().addPacketListener(this, presenceFilter); // The roomname will be the participantJID this.roomname = participantJID; // Use the agents username as the Tab Title this.tabTitle = title; // The name of the room will be the node of the user jid + conversation. final SimpleDateFormat formatter = new SimpleDateFormat("h:mm a"); this.roomTitle = participantNickname; // Add RoomInfo this.getSplitPane().setRightComponent(null); getSplitPane().setDividerSize(0); roster = SparkManager.getConnection().getRoster(); presence = roster.getPresence(participantJID); RosterEntry entry = roster.getEntry(participantJID); tabIcon = SparkManager.getUserManager().getTabIconForPresence(presence); PacketFilter filter = new AndFilter(new PacketTypeFilter(Presence.class), new FromContainsFilter(participantJID)); SparkManager.getConnection().addPacketListener(new PacketListener() { public void processPacket(Packet packet) { presence = (Presence)packet; } }, filter); // Create toolbar buttons. ChatRoomButton infoButton = new ChatRoomButton("", SparkRes.getImageIcon(SparkRes.PROFILE_IMAGE_24x24)); infoButton.setToolTipText(Res.getString("message.view.information.about.this.user")); // Create basic toolbar. getToolBar().addChatRoomButton(infoButton); // If the user is not in the roster, then allow user to add them. if (entry == null && !StringUtils.parseResource(participantJID).equals(participantNickname)) { ChatRoomButton addToRosterButton = new ChatRoomButton("", SparkRes.getImageIcon(SparkRes.ADD_IMAGE_24x24)); addToRosterButton.setToolTipText(Res.getString("message.add.this.user.to.your.roster")); getToolBar().addChatRoomButton(addToRosterButton); addToRosterButton.addActionListener(new ActionListener() { public void actionPerformed(ActionEvent e) { RosterDialog rosterDialog = new RosterDialog(); rosterDialog.setDefaultJID(participantJID); rosterDialog.setDefaultNickname(getParticipantNickname()); rosterDialog.showRosterDialog(SparkManager.getChatManager().getChatContainer().getChatFrame()); } }); } // Show VCard. infoButton.addActionListener(new ActionListener() { public void actionPerformed(ActionEvent e) { VCardManager vcard = SparkManager.getVCardManager(); vcard.viewProfile(participantJID, SparkManager.getChatManager().getChatContainer()); } }); // If this is a private chat from a group chat room, do not show toolbar. if (StringUtils.parseResource(participantJID).equals(participantNickname)) { getToolBar().setVisible(false); } typingTimer = new Timer(2000, new ActionListener() { public void actionPerformed(ActionEvent e) { if(!sendTypingNotification) { return; } long now = System.currentTimeMillis(); if (now - lastTypedCharTime > 2000) { if (!sendNotification) { // send cancel SparkManager.getMessageEventManager().sendCancelledNotification(getParticipantJID(), threadID); sendNotification = true; } } } }); typingTimer.start(); lastActivity = System.currentTimeMillis(); // Add VCard Panel final VCardPanel vcardPanel = new VCardPanel(participantJID); getToolBar().add(vcardPanel, new GridBagConstraints(0, 1, 1, 1, 1.0, 0.0, GridBagConstraints.WEST, GridBagConstraints.HORIZONTAL, new Insets(5, 5, 5, 5), 0, 0)); }

public ChatRoomImpl(final String participantJID, String participantNickname, String title) { this.participantJID = participantJID; this.participantNickname = participantNickname; AndFilter presenceFilter = new AndFilter(new PacketTypeFilter(Presence.class), new BareAddressFilter(participantJID)); // Register PacketListeners AndFilter messageFilter = new AndFilter(new PacketTypeFilter(Message.class), new FromContainsFilter(participantJID)); SparkManager.getConnection().addPacketListener(this, messageFilter); SparkManager.getConnection().addPacketListener(this, presenceFilter); // The roomname will be the participantJID this.roomname = participantJID; // Use the agents username as the Tab Title this.tabTitle = title; // The name of the room will be the node of the user jid + conversation. final SimpleDateFormat formatter = new SimpleDateFormat("h:mm a"); this.roomTitle = participantNickname; // Add RoomInfo this.getSplitPane().setRightComponent(null); getSplitPane().setDividerSize(0); roster = SparkManager.getConnection().getRoster(); presence = roster.getPresence(participantJID); RosterEntry entry = roster.getEntry(participantJID); tabIcon = SparkManager.getUserManager().getTabIconForPresence(presence); PacketFilter filter = new AndFilter(new PacketTypeFilter(Presence.class), new FromContainsFilter(participantJID)); SparkManager.getConnection().addPacketListener(new PacketListener() { public void processPacket(Packet packet) { presence = (Presence)packet; } }, filter); // Create toolbar buttons. ChatRoomButton infoButton = new ChatRoomButton("", SparkRes.getImageIcon(SparkRes.PROFILE_IMAGE_24x24)); infoButton.setToolTipText(Res.getString("message.view.information.about.this.user")); // Create basic toolbar. getToolBar().addChatRoomButton(infoButton); // If the user is not in the roster, then allow user to add them. if (entry == null && !StringUtils.parseResource(participantJID).equals(participantNickname)) { ChatRoomButton addToRosterButton = new ChatRoomButton("", SparkRes.getImageIcon(SparkRes.ADD_IMAGE_24x24)); addToRosterButton.setToolTipText(Res.getString("message.add.this.user.to.your.roster")); getToolBar().addChatRoomButton(addToRosterButton); addToRosterButton.addActionListener(new ActionListener() { public void actionPerformed(ActionEvent e) { RosterDialog rosterDialog = new RosterDialog(); rosterDialog.setDefaultJID(participantJID); rosterDialog.setDefaultNickname(getParticipantNickname()); rosterDialog.showRosterDialog(SparkManager.getChatManager().getChatContainer().getChatFrame()); } }); } // Show VCard. infoButton.addActionListener(new ActionListener() { public void actionPerformed(ActionEvent e) { VCardManager vcard = SparkManager.getVCardManager(); vcard.viewProfile(participantJID, SparkManager.getChatManager().getChatContainer()); } }); // If this is a private chat from a group chat room, do not show toolbar. if (StringUtils.parseResource(participantJID).equals(participantNickname)) { getToolBar().setVisible(false); } typingTimer = new Timer(2000, new ActionListener() { public void actionPerformed(ActionEvent e) { if(!sendTypingNotification) { return; } long now = System.currentTimeMillis(); if (now - lastTypedCharTime > 2000) { if (!sendNotification) { // send cancel SparkManager.getMessageEventManager().sendCancelledNotification(getParticipantJID(), threadID); sendNotification = true; } } } }); typingTimer.start(); lastActivity = System.currentTimeMillis(); // Add VCard Panel final VCardPanel vcardPanel = new VCardPanel(participantJID); getToolBar().add(vcardPanel, new GridBagConstraints(0, 1, 1, 1, 1.0, 0.0, GridBagConstraints.WEST, GridBagConstraints.HORIZONTAL, new Insets(5, 5, 5, 5), 0, 0)); }

3,236,432

public ChatRoomImpl(final String participantJID, String participantNickname, String title) { this.participantJID = participantJID; this.participantNickname = participantNickname; AndFilter presenceFilter = new AndFilter(new PacketTypeFilter(Presence.class), new BareAddressFilter(participantJID)); // Register PacketListeners AndFilter messageFilter = new AndFilter(new PacketTypeFilter(Message.class), new BareAddressFilter(participantJID)); SparkManager.getConnection().addPacketListener(this, messageFilter); SparkManager.getConnection().addPacketListener(this, presenceFilter); // The roomname will be the participantJID this.roomname = participantJID; // Use the agents username as the Tab Title this.tabTitle = title; // The name of the room will be the node of the user jid + conversation. final SimpleDateFormat formatter = new SimpleDateFormat("h:mm a"); this.roomTitle = participantNickname; // Add RoomInfo this.getSplitPane().setRightComponent(null); getSplitPane().setDividerSize(0); roster = SparkManager.getConnection().getRoster(); presence = roster.getPresence(participantJID); RosterEntry entry = roster.getEntry(participantJID); tabIcon = SparkManager.getUserManager().getTabIconForPresence(presence); PacketFilter filter = new AndFilter(new PacketTypeFilter(Presence.class), new FromContainsFilter(participantJID)); SparkManager.getConnection().addPacketListener(new PacketListener() { public void processPacket(Packet packet) { presence = (Presence)packet; } }, filter); // Create toolbar buttons. ChatRoomButton infoButton = new ChatRoomButton("", SparkRes.getImageIcon(SparkRes.PROFILE_IMAGE_24x24)); infoButton.setToolTipText(Res.getString("message.view.information.about.this.user")); // Create basic toolbar. getToolBar().addChatRoomButton(infoButton); // If the user is not in the roster, then allow user to add them. if (entry == null && !StringUtils.parseResource(participantJID).equals(participantNickname)) { ChatRoomButton addToRosterButton = new ChatRoomButton("", SparkRes.getImageIcon(SparkRes.ADD_IMAGE_24x24)); addToRosterButton.setToolTipText(Res.getString("message.add.this.user.to.your.roster")); getToolBar().addChatRoomButton(addToRosterButton); addToRosterButton.addActionListener(new ActionListener() { public void actionPerformed(ActionEvent e) { RosterDialog rosterDialog = new RosterDialog(); rosterDialog.setDefaultJID(participantJID); rosterDialog.setDefaultNickname(getParticipantNickname()); rosterDialog.showRosterDialog(SparkManager.getChatManager().getChatContainer().getChatFrame()); } }); } // Show VCard. infoButton.addActionListener(new ActionListener() { public void actionPerformed(ActionEvent e) { VCardManager vcard = SparkManager.getVCardManager(); vcard.viewProfile(participantJID, SparkManager.getChatManager().getChatContainer()); } }); // If this is a private chat from a group chat room, do not show toolbar. if (StringUtils.parseResource(participantJID).equals(participantNickname)) { getToolBar().setVisible(false); } typingTimer = new Timer(2000, new ActionListener() { public void actionPerformed(ActionEvent e) { if(!sendTypingNotification) { return; } long now = System.currentTimeMillis(); if (now - lastTypedCharTime > 2000) { if (!sendNotification) { // send cancel SparkManager.getMessageEventManager().sendCancelledNotification(getParticipantJID(), threadID); sendNotification = true; } } } }); typingTimer.start(); lastActivity = System.currentTimeMillis(); // Add VCard Panel final VCardPanel vcardPanel = new VCardPanel(participantJID); getToolBar().add(vcardPanel, new GridBagConstraints(0, 1, 1, 1, 1.0, 0.0, GridBagConstraints.WEST, GridBagConstraints.HORIZONTAL, new Insets(5, 5, 5, 5), 0, 0)); }

public ChatRoomImpl(final String participantJID, String participantNickname, String title) { this.participantJID = participantJID; this.participantNickname = participantNickname; AndFilter presenceFilter = new AndFilter(new PacketTypeFilter(Presence.class), new BareAddressFilter(participantJID)); // Register PacketListeners AndFilter messageFilter = new AndFilter(new PacketTypeFilter(Message.class), new BareAddressFilter(participantJID)); SparkManager.getConnection().addPacketListener(this, messageFilter); SparkManager.getConnection().addPacketListener(this, presenceFilter); // The roomname will be the participantJID this.roomname = participantJID; // Use the agents username as the Tab Title this.tabTitle = title; // The name of the room will be the node of the user jid + conversation. final SimpleDateFormat formatter = new SimpleDateFormat("h:mm a"); this.roomTitle = participantNickname; // Add RoomInfo this.getSplitPane().setRightComponent(null); getSplitPane().setDividerSize(0); roster = SparkManager.getConnection().getRoster(); presence = roster.getPresence(participantJID); RosterEntry entry = roster.getEntry(participantJID); tabIcon = SparkManager.getUserManager().getTabIconForPresence(presence); PacketFilter filter = new AndFilter(new PacketTypeFilter(Presence.class), new FromContainsFilter(participantJID)); SparkManager.getConnection().addPacketListener(new PacketListener() { public void processPacket(Packet packet) { presence = (Presence)packet; } }, filter); // Create toolbar buttons. ChatRoomButton infoButton = new ChatRoomButton("", SparkRes.getImageIcon(SparkRes.PROFILE_IMAGE_24x24)); infoButton.setToolTipText(Res.getString("message.view.information.about.this.user")); // Create basic toolbar. getToolBar().addChatRoomButton(infoButton); // If the user is not in the roster, then allow user to add them. if (entry == null && !StringUtils.parseResource(participantJID).equals(participantNickname)) { ChatRoomButton addToRosterButton = new ChatRoomButton("", SparkRes.getImageIcon(SparkRes.ADD_IMAGE_24x24)); addToRosterButton.setToolTipText(Res.getString("message.add.this.user.to.your.roster")); getToolBar().addChatRoomButton(addToRosterButton); addToRosterButton.addActionListener(new ActionListener() { public void actionPerformed(ActionEvent e) { RosterDialog rosterDialog = new RosterDialog(); rosterDialog.setDefaultJID(participantJID); rosterDialog.setDefaultNickname(getParticipantNickname()); rosterDialog.showRosterDialog(SparkManager.getChatManager().getChatContainer().getChatFrame()); } }); } // Show VCard. infoButton.addActionListener(new ActionListener() { public void actionPerformed(ActionEvent e) { VCardManager vcard = SparkManager.getVCardManager(); vcard.viewProfile(participantJID, SparkManager.getChatManager().getChatContainer()); } }); // If this is a private chat from a group chat room, do not show toolbar. if (StringUtils.parseResource(participantJID).equals(participantNickname)) { getToolBar().setVisible(false); } typingTimer = new Timer(2000, new ActionListener() { public void actionPerformed(ActionEvent e) { if (!sendTypingNotification) { return; } long now = System.currentTimeMillis(); if (now - lastTypedCharTime > 2000) { if (!sendNotification) { // send cancel SparkManager.getMessageEventManager().sendCancelledNotification(getParticipantJID(), threadID); sendNotification = true; } } } }); typingTimer.start(); lastActivity = System.currentTimeMillis(); // Add VCard Panel final VCardPanel vcardPanel = new VCardPanel(participantJID); getToolBar().add(vcardPanel, new GridBagConstraints(0, 1, 1, 1, 1.0, 0.0, GridBagConstraints.WEST, GridBagConstraints.HORIZONTAL, new Insets(5, 5, 5, 5), 0, 0)); }

3,236,433

public void actionPerformed(ActionEvent e) { if(!sendTypingNotification) { return; } long now = System.currentTimeMillis(); if (now - lastTypedCharTime > 2000) { if (!sendNotification) { // send cancel SparkManager.getMessageEventManager().sendCancelledNotification(getParticipantJID(), threadID); sendNotification = true; } } }

public void actionPerformed(ActionEvent e) { if (!sendTypingNotification) { return; } long now = System.currentTimeMillis(); if (now - lastTypedCharTime > 2000) { if (!sendNotification) { // send cancel SparkManager.getMessageEventManager().sendCancelledNotification(getParticipantJID(), threadID); sendNotification = true; } } }

3,236,434

private void checkEvents(String from, String packetID, MessageEvent messageEvent) { if(messageEvent.isDelivered() || messageEvent.isDisplayed()) { // Create the message to send Message msg = new Message(from); // Create a MessageEvent Package and add it to the message MessageEvent event = new MessageEvent(); if (messageEvent.isDelivered()) { event.setDelivered(true); } if (messageEvent.isDisplayed()) { event.setDisplayed(true); } event.setPacketID(packetID); msg.addExtension(event); // Send the packet SparkManager.getConnection().sendPacket(msg); } }

private void checkEvents(String from, String packetID, MessageEvent messageEvent) { if (messageEvent.isDelivered() || messageEvent.isDisplayed()) { // Create the message to send Message msg = new Message(from); // Create a MessageEvent Package and add it to the message MessageEvent event = new MessageEvent(); if (messageEvent.isDelivered()) { event.setDelivered(true); } if (messageEvent.isDisplayed()) { event.setDisplayed(true); } event.setPacketID(packetID); msg.addExtension(event); // Send the packet SparkManager.getConnection().sendPacket(msg); } }

3,236,435

public void insertMessage(Message message) { // Debug info super.insertMessage(message); MessageEvent messageEvent = (MessageEvent) message.getExtension("x", "jabber:x:event"); if(messageEvent != null) { checkEvents(message.getFrom(), message.getPacketID(), messageEvent); } getTranscriptWindow().insertOthersMessage(participantNickname, message); // Set the participant jid to their full JID. participantJID = message.getFrom(); }

3,236,436

public Object getProperty(final Context context, final Object instance, final Object[] names, int start, int end) throws PropertyException { String prop; Object nextProp = null; Accessor acc = null; if (names[start] instanceof String) { prop = (String) names[start]; } else if (names[start] instanceof PropertyMethod) { PropertyMethod pm = (PropertyMethod) names[start]; prop = pm.getName(); acc = (Accessor) _directAccessors.get(prop); Object[] args = pm.getArguments(context); if (acc == null) { if (isMethodRestricted(instance.getClass(), prop)) throw new PropertyException.RestrictedMethodException( pm.toString(), fillInName(names, start), instance.getClass().getName()); throw new PropertyException.NoSuchMethodException( pm.toString(), fillInName(names, start), instance.getClass().getName()); } try { nextProp = acc.get(instance, args); start++; } catch (NoSuchMethodException e) { throw new PropertyException.NoSuchMethodException( pm.toString(), fillInName(names, start), instance.getClass().getName()); } } else { prop = names[start].toString(); } // unary? if (acc == null) { acc = (Accessor) _unaryAccessors.get(prop); if (acc != null) { try { nextProp = acc.get(instance); start++; } catch (NoSuchMethodException e) { acc = null; } } } // binary? if (acc == null) { acc = (Accessor) _binaryAccessors.get(prop); if ((acc != null) && ((start + 1) <= end)) { try { nextProp = acc.get(instance, (String) names[start + 1]); start += 2; } catch (NoSuchMethodException e) { acc = null; } catch (ClassCastException e) { // names[start + 1] was not a String, just move on // this catch is more efficient than using instanceof // since 90% of the time it really will be a string acc = null; } } else { acc = null; } } // hash? if (acc == null) { acc = _hashAccessor; try { if (acc != null) { nextProp = acc.get(instance, prop); start++; } } catch (NoSuchMethodException e) { acc = null; } } if (acc == null) { // user tried to access a property of a property that doesn't exist // ex: $TestObject.FirstName.NotThere // check if object is restricted if (isMethodRestricted(instance.getClass(), "get" + prop) || isMethodRestricted(instance.getClass(), "set" + prop)) throw new PropertyException.RestrictedPropertyException( prop, fillInName(names, start), instance.getClass().getName()); throw new PropertyException.NoSuchPropertyException( prop, fillInName(names, start), instance.getClass().getName()); } if (start <= end) { try { return _cache.getOperator(nextProp) .getProperty(context, nextProp, names, start, end); } catch (NullPointerException e) { // will we ever get here? --eric throw new PropertyException("No way to access property " + fillInName(names, start) + " on object " + instance + " of " + instance.getClass() + "--possibly null?"); } } else { return nextProp; } }

3,236,438

public WeakReferenceListNode(Object ref, ReferenceQueue queue, WeakReferenceListNode next) { super(ref, queue); this.next = next; if (next != null) { next.prev = this; } }

3,236,439

public WeakReferenceListNode(Object ref, ReferenceQueue queue, WeakReferenceListNode next) { super(ref, queue); this.next = next; if (next != null) { next.prev = this; } }

3,236,440

public void remove() { synchronized (ObjectSpace.this) { if (prev != null) { prev.next = next; } if (next != null) { next.prev = prev; } } }

3,236,441

public Map findAnnotations(Class rootNodeType, @NotNull @Validate(Long.class) Set rootNodeIds, @Validate(Long.class) Set annotatorIds, Map options) { if (rootNodeIds.size()==0) return new HashMap(); PojoOptions po = new PojoOptions(options); Query<List<IObject>> q = queryFactory.lookup( PojosFindAnnotationsQueryDefinition.class.getName(), new Parameters() .addIds(rootNodeIds) .addClass(rootNodeType) .addSet("annotatorIds",annotatorIds) .addOptions(po.map())); List<IObject> l = iQuery.execute(q); // no count collection // // Destructive changes below this point. // for (Object object : l) { iQuery.evict(object); } // TODO these here or in Query Definition? // Does it belong to API or to query? if (Dataset.class.equals(rootNodeType)){ return AnnotationTransformations.sortDatasetAnnotatiosn( new HashSet<IObject>(l)); } else if (Image.class.equals(rootNodeType)){ return AnnotationTransformations.sortImageAnnotatiosn( new HashSet<IObject>(l)); } else { throw new IllegalArgumentException( "Class parameter for findAnnotation() must be in " + "{Dataset,Image}, not "+ rootNodeType); } }

public Map findAnnotations( @NotNull Class rootNodeType, @NotNull @Validate(Long.class) Set rootNodeIds, @Validate(Long.class) Set annotatorIds, Map options) { if (rootNodeIds.size()==0) return new HashMap(); PojoOptions po = new PojoOptions(options); Query<List<IObject>> q = queryFactory.lookup( PojosFindAnnotationsQueryDefinition.class.getName(), new Parameters() .addIds(rootNodeIds) .addClass(rootNodeType) .addSet("annotatorIds",annotatorIds) .addOptions(po.map())); List<IObject> l = iQuery.execute(q); // no count collection // // Destructive changes below this point. // for (Object object : l) { iQuery.evict(object); } // TODO these here or in Query Definition? // Does it belong to API or to query? if (Dataset.class.equals(rootNodeType)){ return AnnotationTransformations.sortDatasetAnnotatiosn( new HashSet<IObject>(l)); } else if (Image.class.equals(rootNodeType)){ return AnnotationTransformations.sortImageAnnotatiosn( new HashSet<IObject>(l)); } else { throw new IllegalArgumentException( "Class parameter for findAnnotation() must be in " + "{Dataset,Image}, not "+ rootNodeType); } }

3,236,442

public Set findContainerHierarchies(@NotNull Class rootNodeType, @NotNull @Validate(Long.class) Set imageIds, Map options) { PojoOptions po = new PojoOptions(options); Query<List<IObject>> q = queryFactory.lookup( PojosFindHierarchiesQueryDefinition.class.getName(), new Parameters() .addClass(rootNodeType) .addIds(imageIds) .addOptions(po.map())); List<IObject> l = iQuery.execute(q); collectCounts(l,po); // // Destructive changes below this point. // for (IObject object : l) { iQuery.evict(object); } // TODO; this if-else statement could be removed if Transformations // did their own dispatching // TODO: logging, null checking. daos should never return null // TODO then size! if (Project.class.equals(rootNodeType)) { if (imageIds.size()==0){ return new HashSet(); } return HierarchyTransformations.invertPDI(new HashSet<IObject>(l)); } else if (CategoryGroup.class.equals(rootNodeType)){ if (imageIds.size()==0){ return new HashSet(); } return HierarchyTransformations.invertCGCI(new HashSet<IObject>(l)); } else {throw new IllegalArgumentException( // TODO refactor. move this up. "Class parameter for findContainerHierarchies() must be" + " in {Project,CategoryGroup}, not " + rootNodeType); } }

3,236,443

public Set findContainerHierarchies(@NotNull Class rootNodeType, @NotNull @Validate(Long.class) Set imageIds, Map options) { PojoOptions po = new PojoOptions(options); Query<List<IObject>> q = queryFactory.lookup( PojosFindHierarchiesQueryDefinition.class.getName(), new Parameters() .addClass(rootNodeType) .addIds(imageIds) .addOptions(po.map())); List<IObject> l = iQuery.execute(q); collectCounts(l,po); // // Destructive changes below this point. // for (IObject object : l) { iQuery.evict(object); } // TODO; this if-else statement could be removed if Transformations // did their own dispatching // TODO: logging, null checking. daos should never return null // TODO then size! if (Project.class.equals(rootNodeType)) { if (imageIds.size()==0){ return new HashSet(); } return HierarchyTransformations.invertPDI(new HashSet<IObject>(l)); } else if (CategoryGroup.class.equals(rootNodeType)){ if (imageIds.size()==0){ return new HashSet(); } return HierarchyTransformations.invertCGCI(new HashSet<IObject>(l)); } else {throw new IllegalArgumentException( // TODO refactor. move this up. "Class parameter for findContainerHierarchies() must be" + " in {Project,CategoryGroup}, not " + rootNodeType); } }

3,236,444

public void setAnnotationEdition(DataObject ho) { if (model.getState() == DISCARDED) throw new IllegalStateException( "This method cannot be invoked in the DISCARDED state."); if (ho == null) throw new IllegalArgumentException("No DataObject."); Browser browser = model.getBrowser(); FindAnnotatedVisitor visitor = new FindAnnotatedVisitor(this, ho); if (ho instanceof ImageData) browser.accept(visitor, ImageDisplayVisitor.IMAGE_NODE_ONLY); else browser.accept(visitor, ImageDisplayVisitor.IMAGE_SET_ONLY); model.getTreeView().repaint(); }

public void setAnnotationEdition(DataObject ho) { if (model.getState() == DISCARDED) throw new IllegalStateException( "This method cannot be invoked in the DISCARDED state."); if (ho == null) throw new IllegalArgumentException("No DataObject."); Browser browser = model.getBrowser(); FindAnnotatedVisitor visitor = new FindAnnotatedVisitor(this, ho); if (ho instanceof ImageData) browser.accept(visitor, ImageDisplayVisitor.IMAGE_NODE_ONLY); else browser.accept(visitor, ImageDisplayVisitor.IMAGE_SET_ONLY); if (model.getTreeView() != null) model.getTreeView().repaint(); }

3,236,445

private void scrollOnTimer() { SwingWorker worker = new SwingWorker() { public Object construct() { try { Thread.sleep(500); } catch (InterruptedException e) { e.printStackTrace(); } return true; } public void finished() { scrollToBottom(); } }; worker.start(); }

private void scrollOnTimer() { SwingWorker worker = new SwingWorker() { public Object construct() { try { Thread.sleep(1000); } catch (InterruptedException e) { e.printStackTrace(); } return true; } public void finished() { scrollToBottom(); } }; worker.start(); }

3,236,446

public Object construct() { try { Thread.sleep(500); } catch (InterruptedException e) { e.printStackTrace(); } return true; }

public Object construct() { try { Thread.sleep(1000); } catch (InterruptedException e) { e.printStackTrace(); } return true; }

3,236,447

public void smartLoad(String file) { Library library = null; if (file.endsWith(".rb")) { // .rb specified, try without suffixes library = findLibrary(file); } if (library == null) { // nothing yet, try suffixes for (int i = 0; i < suffixes.length; i++) { library = findLibrary(file + suffixes[i]); if (library != null) { break; } } } if (library == null) { throw runtime.newLoadError("No such file to load -- " + file); } try { library.load(runtime); } catch (IOException e) { throw runtime.newLoadError("IO error -- " + file); } }

public void smartLoad(String file) { Library library = null; if (suffixPattern.matcher(file).matches()) { // .rb specified, try without suffixes library = findLibrary(file); } if (library == null) { // nothing yet, try suffixes for (int i = 0; i < suffixes.length; i++) { library = findLibrary(file + suffixes[i]); if (library != null) { break; } } } if (library == null) { throw runtime.newLoadError("No such file to load -- " + file); } try { library.load(runtime); } catch (IOException e) { throw runtime.newLoadError("IO error -- " + file); } }

3,236,448

public void smartLoad(String file) { Library library = null; if (file.endsWith(".rb")) { // .rb specified, try without suffixes library = findLibrary(file); } if (library == null) { // nothing yet, try suffixes for (int i = 0; i < suffixes.length; i++) { library = findLibrary(file + suffixes[i]); if (library != null) { break; } } } if (library == null) { throw runtime.newLoadError("No such file to load -- " + file); } try { library.load(runtime); } catch (IOException e) { throw runtime.newLoadError("IO error -- " + file); } }

3,236,449

public void smartLoad(String file) { Library library = null; if (file.endsWith(".rb")) { // .rb specified, try without suffixes library = findLibrary(file); } if (library == null) { // nothing yet, try suffixes for (int i = 0; i < suffixes.length; i++) { library = findLibrary(file + suffixes[i]); if (library != null) { break; } } } if (library == null) { throw runtime.newLoadError("No such file to load -- " + file); } try { library.load(runtime); } catch (IOException e) { throw runtime.newLoadError("IO error -- " + file); } }

3,236,450

private final void ReInitRounds(){ int i; jjround = 0x80000001; for (i = 53; i-- > 0;) jjrounds[i] = 0x80000000;}

private final void ReInitRounds(){ int i; jjround = 0x80000001; for (i = 58; i-- > 0;) jjrounds[i] = 0x80000000;}

3,236,451

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 58; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,452

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,453

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 59: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 59: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 59: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,454

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,455

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(22, 24); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(22, 24); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(22, 24); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,456

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(25, 28); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(25, 28); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(25, 28); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,457

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,458

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,459

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,460

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,461

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,462

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,463

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,464

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(32, 34); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,465

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,466

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjCheckNAdd(30); break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,467

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,468

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,469

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,470

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,471

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,472

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,473

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,474

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAdd(44); break; case 45: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(45, 46); break; case 46: if (curChar == 40) jjCheckNAdd(47); break; case 47: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(47, 48); break; case 48: if (curChar == 41 && kind > 23) kind = 23; break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAdd(44); break; case 45: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(45, 46); break; case 46: if (curChar == 40) jjCheckNAdd(47); break; case 47: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(47, 48); break; case 48: if (curChar == 41 && kind > 23) kind = 23; break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,475

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,476

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(0, 3); break; case 51: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(51, 52); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(0, 3); break; case 51: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(51, 52); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,477

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,478

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,479

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,480

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,481

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,482

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(0, 3); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(0, 3); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(0, 3); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(0, 3); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,483

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; 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 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 59: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 59: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); 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 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 59: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

3,236,484