;
- sempred(_localctx: RuleContext | undefined, ruleIndex: number, actionIndex: number): boolean;
- precpred(localctx: RuleContext | undefined, precedence: number): boolean;
- action(_localctx: RuleContext | undefined, ruleIndex: number, actionIndex: number): void;
- /** Indicate that the recognizer has changed internal state that is
- * consistent with the ATN state passed in. This way we always know
- * where we are in the ATN as the parser goes along. The rule
- * context objects form a stack that lets us see the stack of
- * invoking rules. Combine this and we have complete ATN
- * configuration information.
- */
- state: number;
- readonly abstract inputStream: IntStream | undefined;
-}
diff --git a/node_modules/antlr4ts/Recognizer.js b/node_modules/antlr4ts/Recognizer.js
deleted file mode 100644
index 0556cfc..0000000
--- a/node_modules/antlr4ts/Recognizer.js
+++ /dev/null
@@ -1,213 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const ConsoleErrorListener_1 = require("./ConsoleErrorListener");
-const ProxyErrorListener_1 = require("./ProxyErrorListener");
-const Decorators_1 = require("./Decorators");
-const Token_1 = require("./Token");
-const Utils = require("./misc/Utils");
-class Recognizer {
- constructor() {
- this._listeners = [ConsoleErrorListener_1.ConsoleErrorListener.INSTANCE];
- this._stateNumber = -1;
- }
- /**
- * Get a map from token names to token types.
- *
- * Used for XPath and tree pattern compilation.
- */
- getTokenTypeMap() {
- let vocabulary = this.vocabulary;
- let result = Recognizer.tokenTypeMapCache.get(vocabulary);
- if (result == null) {
- let intermediateResult = new Map();
- for (let i = 0; i <= this.atn.maxTokenType; i++) {
- let literalName = vocabulary.getLiteralName(i);
- if (literalName != null) {
- intermediateResult.set(literalName, i);
- }
- let symbolicName = vocabulary.getSymbolicName(i);
- if (symbolicName != null) {
- intermediateResult.set(symbolicName, i);
- }
- }
- intermediateResult.set("EOF", Token_1.Token.EOF);
- result = Object.freeze(intermediateResult);
- Recognizer.tokenTypeMapCache.set(vocabulary, result);
- }
- return result;
- }
- /**
- * Get a map from rule names to rule indexes.
- *
- * Used for XPath and tree pattern compilation.
- */
- getRuleIndexMap() {
- let ruleNames = this.ruleNames;
- if (ruleNames == null) {
- throw new Error("The current recognizer does not provide a list of rule names.");
- }
- let result = Recognizer.ruleIndexMapCache.get(ruleNames);
- if (result == null) {
- result = Object.freeze(Utils.toMap(ruleNames));
- Recognizer.ruleIndexMapCache.set(ruleNames, result);
- }
- return result;
- }
- getTokenType(tokenName) {
- let ttype = this.getTokenTypeMap().get(tokenName);
- if (ttype != null)
- return ttype;
- return Token_1.Token.INVALID_TYPE;
- }
- /**
- * If this recognizer was generated, it will have a serialized ATN
- * representation of the grammar.
- *
- * For interpreters, we don't know their serialized ATN despite having
- * created the interpreter from it.
- */
- get serializedATN() {
- throw new Error("there is no serialized ATN");
- }
- /**
- * Get the {@link ATN} used by the recognizer for prediction.
- *
- * @return The {@link ATN} used by the recognizer for prediction.
- */
- get atn() {
- return this._interp.atn;
- }
- /**
- * Get the ATN interpreter used by the recognizer for prediction.
- *
- * @return The ATN interpreter used by the recognizer for prediction.
- */
- get interpreter() {
- return this._interp;
- }
- /** If profiling during the parse/lex, this will return DecisionInfo records
- * for each decision in recognizer in a ParseInfo object.
- *
- * @since 4.3
- */
- get parseInfo() {
- return undefined;
- }
- /**
- * Set the ATN interpreter used by the recognizer for prediction.
- *
- * @param interpreter The ATN interpreter used by the recognizer for
- * prediction.
- */
- set interpreter(interpreter) {
- this._interp = interpreter;
- }
- /** What is the error header, normally line/character position information? */
- getErrorHeader(e) {
- let token = e.getOffendingToken();
- if (!token)
- return "";
- let line = token.line;
- let charPositionInLine = token.charPositionInLine;
- return "line " + line + ":" + charPositionInLine;
- }
- /**
- * @exception NullPointerException if {@code listener} is {@code null}.
- */
- addErrorListener(listener) {
- if (!listener)
- throw new TypeError("listener must not be null");
- this._listeners.push(listener);
- }
- removeErrorListener(listener) {
- let position = this._listeners.indexOf(listener);
- if (position !== -1) {
- this._listeners.splice(position, 1);
- }
- }
- removeErrorListeners() {
- this._listeners.length = 0;
- }
- getErrorListeners() {
- return this._listeners.slice(0);
- }
- getErrorListenerDispatch() {
- return new ProxyErrorListener_1.ProxyErrorListener(this.getErrorListeners());
- }
- // subclass needs to override these if there are sempreds or actions
- // that the ATN interp needs to execute
- sempred(_localctx, ruleIndex, actionIndex) {
- return true;
- }
- precpred(localctx, precedence) {
- return true;
- }
- action(_localctx, ruleIndex, actionIndex) {
- }
- get state() {
- return this._stateNumber;
- }
- /** Indicate that the recognizer has changed internal state that is
- * consistent with the ATN state passed in. This way we always know
- * where we are in the ATN as the parser goes along. The rule
- * context objects form a stack that lets us see the stack of
- * invoking rules. Combine this and we have complete ATN
- * configuration information.
- */
- set state(atnState) {
- // System.err.println("setState "+atnState);
- this._stateNumber = atnState;
- // if ( traceATNStates ) _ctx.trace(atnState);
- }
-}
-Recognizer.EOF = -1;
-Recognizer.tokenTypeMapCache = new WeakMap();
-Recognizer.ruleIndexMapCache = new WeakMap();
-__decorate([
- Decorators_1.SuppressWarnings("serial"),
- Decorators_1.NotNull
-], Recognizer.prototype, "_listeners", void 0);
-__decorate([
- Decorators_1.NotNull
-], Recognizer.prototype, "getTokenTypeMap", null);
-__decorate([
- Decorators_1.NotNull
-], Recognizer.prototype, "getRuleIndexMap", null);
-__decorate([
- Decorators_1.NotNull
-], Recognizer.prototype, "serializedATN", null);
-__decorate([
- Decorators_1.NotNull
-], Recognizer.prototype, "atn", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull)
-], Recognizer.prototype, "interpreter", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull)
-], Recognizer.prototype, "getErrorHeader", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], Recognizer.prototype, "addErrorListener", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], Recognizer.prototype, "removeErrorListener", null);
-__decorate([
- Decorators_1.NotNull
-], Recognizer.prototype, "getErrorListeners", null);
-exports.Recognizer = Recognizer;
-//# sourceMappingURL=Recognizer.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/Recognizer.js.map b/node_modules/antlr4ts/Recognizer.js.map
deleted file mode 100644
index bb6a159..0000000
--- a/node_modules/antlr4ts/Recognizer.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"Recognizer.js","sourceRoot":"","sources":["../../src/Recognizer.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAMH,iEAA8D;AAG9D,6DAA0D;AAG1D,6CAAyD;AACzD,mCAAgC;AAIhC,sCAAsC;AAEtC;IAAA;QAUkB,eAAU,GAAiC,CAAC,2CAAoB,CAAC,QAAQ,CAAC,CAAC;QAIpF,iBAAY,GAAG,CAAC,CAAC,CAAC;IA2M3B,CAAC;IA/LA;;;;OAIG;IAEH,eAAe;QACd,IAAI,UAAU,GAAe,IAAI,CAAC,UAAU,CAAC;QAC7C,IAAI,MAAM,GAAG,UAAU,CAAC,iBAAiB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC1D,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC;YACpB,IAAI,kBAAkB,GAAG,IAAI,GAAG,EAAkB,CAAC;YACnD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,IAAI,WAAW,GAAG,UAAU,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;gBAC/C,EAAE,CAAC,CAAC,WAAW,IAAI,IAAI,CAAC,CAAC,CAAC;oBACzB,kBAAkB,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;gBACxC,CAAC;gBAED,IAAI,YAAY,GAAG,UAAU,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;gBACjD,EAAE,CAAC,CAAC,YAAY,IAAI,IAAI,CAAC,CAAC,CAAC;oBAC1B,kBAAkB,CAAC,GAAG,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;gBACzC,CAAC;YACF,CAAC;YAED,kBAAkB,CAAC,GAAG,CAAC,KAAK,EAAE,aAAK,CAAC,GAAG,CAAC,CAAC;YACzC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;YAC3C,UAAU,CAAC,iBAAiB,CAAC,GAAG,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QACtD,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAED;;;;OAIG;IAEH,eAAe;QACd,IAAI,SAAS,GAAa,IAAI,CAAC,SAAS,CAAC;QACzC,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,+DAA+D,CAAC,CAAC;QAClF,CAAC;QAED,IAAI,MAAM,GAA4C,UAAU,CAAC,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAClG,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC;YACpB,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;YAC/C,UAAU,CAAC,iBAAiB,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QACrD,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAED,YAAY,CAAC,SAAiB;QAC7B,IAAI,KAAK,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAClD,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC;YAAC,MAAM,CAAC,KAAK,CAAC;QAChC,MAAM,CAAC,aAAK,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;;;;;OAMG;IAEH,IAAI,aAAa;QAChB,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;IAC/C,CAAC;IAOD;;;;OAIG;IAEH,IAAI,GAAG;QACN,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC;IACzB,CAAC;IAED;;;;OAIG;IAEH,IAAI,WAAW;QACd,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACH,IAAI,SAAS;QACZ,MAAM,CAAC,SAAS,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACH,IAAI,WAAW,CAAU,WAA2B;QACnD,IAAI,CAAC,OAAO,GAAG,WAAW,CAAC;IAC5B,CAAC;IAED,8EAA8E;IAE9E,cAAc,CAAU,CAAuB;QAC9C,IAAI,KAAK,GAAG,CAAC,CAAC,iBAAiB,EAAE,CAAA;QACjC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;YAAC,MAAM,CAAC,EAAE,CAAA;QACrB,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;QACtB,IAAI,kBAAkB,GAAW,KAAK,CAAC,kBAAkB,CAAC;QAC1D,MAAM,CAAC,OAAO,GAAG,IAAI,GAAG,GAAG,GAAG,kBAAkB,CAAC;IAClD,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAU,QAAoC;QAC7D,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;YAAC,MAAM,IAAI,SAAS,CAAC,2BAA2B,CAAC,CAAC;QAChE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IAED,mBAAmB,CAAU,QAAoC;QAChE,IAAI,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACjD,EAAE,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACrC,CAAC;IACF,CAAC;IAED,oBAAoB;QACnB,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;IAC5B,CAAC;IAGD,iBAAiB;QAChB,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IAED,wBAAwB;QACvB,MAAM,CAAC,IAAI,uCAAkB,CAAqC,IAAI,CAAC,iBAAiB,EAAE,CAAC,CAAC;IAC7F,CAAC;IAED,oEAAoE;IACpE,uCAAuC;IACvC,OAAO,CACN,SAAkC,EAClC,SAAiB,EACjB,WAAmB;QACnB,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAED,QAAQ,CACP,QAAiC,EACjC,UAAkB;QAClB,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAED,MAAM,CACL,SAAkC,EAClC,SAAiB,EACjB,WAAmB;IACpB,CAAC;IAED,IAAI,KAAK;QACR,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC;IAC1B,CAAC;IAED;;;;;;OAMG;IACH,IAAI,KAAK,CAAC,QAAgB;QAC3B,6CAA6C;QAC3C,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC;QAC/B,+CAA+C;IAC9C,CAAC;;AArNe,cAAG,GAAW,CAAC,CAAC,CAAC;AAElB,4BAAiB,GAC9B,IAAI,OAAO,EAA2C,CAAC;AAC1C,4BAAiB,GAC9B,IAAI,OAAO,EAAyC,CAAC;AAIvD;IAFC,6BAAgB,CAAC,QAAQ,CAAC;IAC1B,oBAAO;8CACoF;AAsB5F;IADC,oBAAO;iDAwBP;AAQD;IADC,oBAAO;iDAcP;AAgBD;IADC,oBAAO;+CAGP;AAaD;IADC,oBAAO;qCAGP;AAQD;IADC,oBAAO;IAoBS,WAAA,oBAAO,CAAA;6CAjBvB;AAuBD;IADC,oBAAO;IACQ,WAAA,oBAAO,CAAA;gDAMtB;AAKD;IAAkB,WAAA,oBAAO,CAAA;kDAGxB;AAED;IAAqB,WAAA,oBAAO,CAAA;qDAK3B;AAOD;IADC,oBAAO;mDAGP;AA5KF,gCAyNC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/RuleContext.d.ts b/node_modules/antlr4ts/RuleContext.d.ts
deleted file mode 100644
index 4af558e..0000000
--- a/node_modules/antlr4ts/RuleContext.d.ts
+++ /dev/null
@@ -1,71 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Parser } from './Parser';
-import { Recognizer } from './Recognizer';
-import { RuleNode } from "./tree/RuleNode";
-import { ParseTree } from "./tree/ParseTree";
-import { Interval } from "./misc/Interval";
-import { ParseTreeVisitor } from "./tree/ParseTreeVisitor";
-export declare class RuleContext extends RuleNode {
- _parent: RuleContext | undefined;
- invokingState: number;
- constructor();
- constructor(parent: RuleContext | undefined, invokingState: number);
- static getChildContext(parent: RuleContext, invokingState: number): RuleContext;
- depth(): number;
- /** A context is empty if there is no invoking state; meaning nobody called
- * current context.
- */
- readonly isEmpty: boolean;
- readonly sourceInterval: Interval;
- readonly ruleContext: RuleContext;
- readonly parent: RuleContext | undefined;
- readonly payload: RuleContext;
- /** Return the combined text of all child nodes. This method only considers
- * tokens which have been added to the parse tree.
- *
- * Since tokens on hidden channels (e.g. whitespace or comments) are not
- * added to the parse trees, they will not appear in the output of this
- * method.
- */
- readonly text: string;
- readonly ruleIndex: number;
- /** For rule associated with this parse tree internal node, return
- * the outer alternative number used to match the input. Default
- * implementation does not compute nor store this alt num. Create
- * a subclass of ParserRuleContext with backing field and set
- * option contextSuperClass.
- * to set it.
- *
- * @since 4.5.3
- */
- /** Set the outer alternative number for this context node. Default
- * implementation does nothing to avoid backing field overhead for
- * trees that don't need it. Create
- * a subclass of ParserRuleContext with backing field and set
- * option contextSuperClass.
- *
- * @since 4.5.3
- */
- altNumber: number;
- getChild(i: number): ParseTree;
- readonly childCount: number;
- accept(visitor: ParseTreeVisitor): T;
- /** Print out a whole tree, not just a node, in LISP format
- * (root child1 .. childN). Print just a node if this is a leaf.
- * We have to know the recognizer so we can get rule names.
- */
- toStringTree(recog: Parser): string;
- /** Print out a whole tree, not just a node, in LISP format
- * (root child1 .. childN). Print just a node if this is a leaf.
- */
- toStringTree(ruleNames: string[] | undefined): string;
- toStringTree(): string;
- toString(): string;
- toString(recog: Recognizer | undefined): string;
- toString(ruleNames: string[] | undefined): string;
- toString(recog: Recognizer | undefined, stop: RuleContext | undefined): string;
- toString(ruleNames: string[] | undefined, stop: RuleContext | undefined): string;
-}
diff --git a/node_modules/antlr4ts/RuleContext.js b/node_modules/antlr4ts/RuleContext.js
deleted file mode 100644
index b8034fa..0000000
--- a/node_modules/antlr4ts/RuleContext.js
+++ /dev/null
@@ -1,206 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:57.3490837-07:00
-/** A rule context is a record of a single rule invocation.
- *
- * We form a stack of these context objects using the parent
- * pointer. A parent pointer of null indicates that the current
- * context is the bottom of the stack. The ParserRuleContext subclass
- * as a children list so that we can turn this data structure into a
- * tree.
- *
- * The root node always has a null pointer and invokingState of -1.
- *
- * Upon entry to parsing, the first invoked rule function creates a
- * context object (a subclass specialized for that rule such as
- * SContext) and makes it the root of a parse tree, recorded by field
- * Parser._ctx.
- *
- * public final SContext s() throws RecognitionException {
- * SContext _localctx = new SContext(_ctx, state); <-- create new node
- * enterRule(_localctx, 0, RULE_s); <-- push it
- * ...
- * exitRule(); <-- pop back to _localctx
- * return _localctx;
- * }
- *
- * A subsequent rule invocation of r from the start rule s pushes a
- * new context object for r whose parent points at s and use invoking
- * state is the state with r emanating as edge label.
- *
- * The invokingState fields from a context object to the root
- * together form a stack of rule indication states where the root
- * (bottom of the stack) has a -1 sentinel value. If we invoke start
- * symbol s then call r1, which calls r2, the would look like
- * this:
- *
- * SContext[-1] <- root node (bottom of the stack)
- * R1Context[p] <- p in rule s called r1
- * R2Context[q] <- q in rule r1 called r2
- *
- * So the top of the stack, _ctx, represents a call to the current
- * rule and it holds the return address from another rule that invoke
- * to this rule. To invoke a rule, we must always have a current context.
- *
- * The parent contexts are useful for computing lookahead sets and
- * getting error information.
- *
- * These objects are used during parsing and prediction.
- * For the special case of parsers, we use the subclass
- * ParserRuleContext.
- *
- * @see ParserRuleContext
- */
-const ATN_1 = require("./atn/ATN");
-const Recognizer_1 = require("./Recognizer");
-const RuleNode_1 = require("./tree/RuleNode");
-const Interval_1 = require("./misc/Interval");
-const Decorators_1 = require("./Decorators");
-const Trees_1 = require("./tree/Trees");
-const ParserRuleContext_1 = require("./ParserRuleContext");
-class RuleContext extends RuleNode_1.RuleNode {
- constructor(parent, invokingState) {
- super();
- this._parent = parent;
- this.invokingState = invokingState != null ? invokingState : -1;
- }
- static getChildContext(parent, invokingState) {
- return new RuleContext(parent, invokingState);
- }
- depth() {
- let n = 0;
- let p = this;
- while (p) {
- p = p._parent;
- n++;
- }
- return n;
- }
- /** A context is empty if there is no invoking state; meaning nobody called
- * current context.
- */
- get isEmpty() {
- return this.invokingState === -1;
- }
- // satisfy the ParseTree / SyntaxTree interface
- get sourceInterval() {
- return Interval_1.Interval.INVALID;
- }
- get ruleContext() { return this; }
- get parent() { return this._parent; }
- get payload() { return this; }
- /** Return the combined text of all child nodes. This method only considers
- * tokens which have been added to the parse tree.
- *
- * Since tokens on hidden channels (e.g. whitespace or comments) are not
- * added to the parse trees, they will not appear in the output of this
- * method.
- */
- get text() {
- if (this.childCount === 0) {
- return "";
- }
- let builder = "";
- for (let i = 0; i < this.childCount; i++) {
- builder += this.getChild(i).text;
- }
- return builder.toString();
- }
- get ruleIndex() { return -1; }
- /** For rule associated with this parse tree internal node, return
- * the outer alternative number used to match the input. Default
- * implementation does not compute nor store this alt num. Create
- * a subclass of ParserRuleContext with backing field and set
- * option contextSuperClass.
- * to set it.
- *
- * @since 4.5.3
- */
- get altNumber() { return ATN_1.ATN.INVALID_ALT_NUMBER; }
- /** Set the outer alternative number for this context node. Default
- * implementation does nothing to avoid backing field overhead for
- * trees that don't need it. Create
- * a subclass of ParserRuleContext with backing field and set
- * option contextSuperClass.
- *
- * @since 4.5.3
- */
- set altNumber(altNumber) { }
- getChild(i) {
- throw new RangeError("i must be greater than or equal to 0 and less than childCount");
- }
- get childCount() {
- return 0;
- }
- accept(visitor) {
- return visitor.visitChildren(this);
- }
- toStringTree(recog) {
- return Trees_1.Trees.toStringTree(this, recog);
- }
- toString(arg1, stop) {
- const ruleNames = (arg1 instanceof Recognizer_1.Recognizer) ? arg1.ruleNames : arg1;
- stop = stop || ParserRuleContext_1.ParserRuleContext.emptyContext();
- let buf = "";
- let p = this;
- buf += ("[");
- while (p && p !== stop) {
- if (!ruleNames) {
- if (!p.isEmpty) {
- buf += (p.invokingState);
- }
- }
- else {
- let ruleIndex = p.ruleIndex;
- let ruleName = (ruleIndex >= 0 && ruleIndex < ruleNames.length)
- ? ruleNames[ruleIndex] : ruleIndex.toString();
- buf += (ruleName);
- }
- if (p._parent && (ruleNames || !p._parent.isEmpty)) {
- buf += (" ");
- }
- p = p._parent;
- }
- buf += ("]");
- return buf.toString();
- }
-}
-__decorate([
- Decorators_1.Override
-], RuleContext.prototype, "sourceInterval", null);
-__decorate([
- Decorators_1.Override
-], RuleContext.prototype, "ruleContext", null);
-__decorate([
- Decorators_1.Override
-], RuleContext.prototype, "parent", null);
-__decorate([
- Decorators_1.Override
-], RuleContext.prototype, "payload", null);
-__decorate([
- Decorators_1.Override
-], RuleContext.prototype, "text", null);
-__decorate([
- Decorators_1.Override
-], RuleContext.prototype, "getChild", null);
-__decorate([
- Decorators_1.Override
-], RuleContext.prototype, "childCount", null);
-__decorate([
- Decorators_1.Override
-], RuleContext.prototype, "accept", null);
-__decorate([
- Decorators_1.Override
-], RuleContext.prototype, "toStringTree", null);
-exports.RuleContext = RuleContext;
-//# sourceMappingURL=RuleContext.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/RuleContext.js.map b/node_modules/antlr4ts/RuleContext.js.map
deleted file mode 100644
index 12d54e0..0000000
--- a/node_modules/antlr4ts/RuleContext.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"RuleContext.js","sourceRoot":"","sources":["../../src/RuleContext.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAEH,wDAAwD;AAExD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiDG;AAEH,mCAAgC;AAEhC,6CAA0C;AAC1C,8CAA2C;AAE3C,8CAA2C;AAC3C,6CAAuC;AACvC,wCAAqC;AAErC,2DAAwD;AAExD,iBAAyB,SAAQ,mBAAQ;IAMxC,YAAY,MAAoB,EAAE,aAAsB;QACvD,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,aAAa,GAAG,aAAa,IAAI,IAAI,GAAG,aAAa,GAAG,CAAC,CAAC,CAAC;IACjE,CAAC;IAED,MAAM,CAAC,eAAe,CAAC,MAAmB,EAAE,aAAqB;QAChE,MAAM,CAAC,IAAI,WAAW,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IAC/C,CAAC;IAED,KAAK;QACJ,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAA4B,IAAI,CAAC;QACtC,OAAO,CAAC,EAAE,CAAC;YACV,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;YACd,CAAC,EAAE,CAAC;QACL,CAAC;QACD,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAED;;OAEG;IACH,IAAI,OAAO;QACV,MAAM,CAAC,IAAI,CAAC,aAAa,KAAK,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,+CAA+C;IAG/C,IAAI,cAAc;QACjB,MAAM,CAAC,mBAAQ,CAAC,OAAO,CAAC;IACzB,CAAC;IAGD,IAAI,WAAW,KAAkB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAG/C,IAAI,MAAM,KAA8B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IAG9D,IAAI,OAAO,KAAkB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAE3C;;;;;;OAMG;IAEH,IAAI,IAAI;QACP,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,EAAE,CAAC;QACX,CAAC;QAED,IAAI,OAAO,GAAG,EAAE,CAAC;QACjB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAClC,CAAC;QAED,MAAM,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC;IAED,IAAI,SAAS,KAAa,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtC;;;;;;;;OAQG;IACH,IAAI,SAAS,KAAa,MAAM,CAAC,SAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC;IAE1D;;;;;;;OAOG;IACH,IAAI,SAAS,CAAC,SAAiB,IAAI,CAAC;IAGpC,QAAQ,CAAC,CAAS;QACjB,MAAM,IAAI,UAAU,CAAC,+DAA+D,CAAC,CAAC;IACvF,CAAC;IAGD,IAAI,UAAU;QACb,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAGD,MAAM,CAAI,OAA4B;QACrC,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAgBD,YAAY,CAAC,KAAyB;QACrC,MAAM,CAAC,aAAK,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACxC,CAAC;IAWD,QAAQ,CACP,IAAsC,EACtC,IAAkB;QAElB,MAAM,SAAS,GAAG,CAAC,IAAI,YAAY,uBAAU,CAAC,GAAG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QACvE,IAAI,GAAG,IAAI,IAAI,qCAAiB,CAAC,YAAY,EAAE,CAAC;QAEhD,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,GAA4B,IAAI,CAAC;QACtC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACb,OAAO,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACxB,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;gBAChB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;oBAChB,GAAG,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;gBAC1B,CAAC;YACF,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,IAAI,SAAS,GAAW,CAAC,CAAC,SAAS,CAAC;gBACpC,IAAI,QAAQ,GAAW,CAAC,SAAS,IAAI,CAAC,IAAI,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC;sBACpE,SAAS,CAAC,SAAS,CAAC,GAAG,SAAS,CAAC,QAAQ,EAAE,CAAC;gBAC/C,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;YACnB,CAAC;YAED,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACpD,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YACd,CAAC;YAED,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;QACf,CAAC;QAED,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACb,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IACvB,CAAC;CACD;AAnIA;IADC,qBAAQ;iDAGR;AAGD;IADC,qBAAQ;8CACsC;AAG/C;IADC,qBAAQ;yCACqD;AAG9D;IADC,qBAAQ;0CACkC;AAU3C;IADC,qBAAQ;uCAYR;AA0BD;IADC,qBAAQ;2CAGR;AAGD;IADC,qBAAQ;6CAGR;AAGD;IADC,qBAAQ;yCAGR;AAgBD;IADC,qBAAQ;+CAGR;AA5HF,kCAuKC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/RuleContextWithAltNum.d.ts b/node_modules/antlr4ts/RuleContextWithAltNum.d.ts
deleted file mode 100644
index 1926141..0000000
--- a/node_modules/antlr4ts/RuleContextWithAltNum.d.ts
+++ /dev/null
@@ -1,21 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ParserRuleContext } from './ParserRuleContext';
-/** A handy class for use with
- *
- * options {contextSuperClass=org.antlr.v4.runtime.RuleContextWithAltNum;}
- *
- * that provides a backing field / impl for the outer alternative number
- * matched for an internal parse tree node.
- *
- * I'm only putting into Java runtime as I'm certain I'm the only one that
- * will really every use this.
- */
-export declare class RuleContextWithAltNum extends ParserRuleContext {
- private _altNumber;
- constructor();
- constructor(parent: ParserRuleContext | undefined, invokingStateNumber: number);
- altNumber: number;
-}
diff --git a/node_modules/antlr4ts/RuleContextWithAltNum.js b/node_modules/antlr4ts/RuleContextWithAltNum.js
deleted file mode 100644
index 14723c2..0000000
--- a/node_modules/antlr4ts/RuleContextWithAltNum.js
+++ /dev/null
@@ -1,49 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:57.4741196-07:00
-const ATN_1 = require("./atn/ATN");
-const Decorators_1 = require("./Decorators");
-const ParserRuleContext_1 = require("./ParserRuleContext");
-/** A handy class for use with
- *
- * options {contextSuperClass=org.antlr.v4.runtime.RuleContextWithAltNum;}
- *
- * that provides a backing field / impl for the outer alternative number
- * matched for an internal parse tree node.
- *
- * I'm only putting into Java runtime as I'm certain I'm the only one that
- * will really every use this.
- */
-class RuleContextWithAltNum extends ParserRuleContext_1.ParserRuleContext {
- constructor(parent, invokingStateNumber) {
- if (invokingStateNumber !== undefined) {
- super(parent, invokingStateNumber);
- }
- else {
- super();
- }
- this._altNumber = ATN_1.ATN.INVALID_ALT_NUMBER;
- }
- get altNumber() {
- return this._altNumber;
- }
- // @Override
- set altNumber(altNum) {
- this._altNumber = altNum;
- }
-}
-__decorate([
- Decorators_1.Override
-], RuleContextWithAltNum.prototype, "altNumber", null);
-exports.RuleContextWithAltNum = RuleContextWithAltNum;
-//# sourceMappingURL=RuleContextWithAltNum.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/RuleContextWithAltNum.js.map b/node_modules/antlr4ts/RuleContextWithAltNum.js.map
deleted file mode 100644
index bd0b8c3..0000000
--- a/node_modules/antlr4ts/RuleContextWithAltNum.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"RuleContextWithAltNum.js","sourceRoot":"","sources":["../../src/RuleContextWithAltNum.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAEH,wDAAwD;AAExD,mCAAgC;AAChC,6CAAwC;AACxC,2DAAwD;AAExD;;;;;;;;;GASG;AACH,2BAAmC,SAAQ,qCAAiB;IAK3D,YAAY,MAA0B,EAAE,mBAA4B;QACnE,EAAE,CAAC,CAAC,mBAAmB,KAAK,SAAS,CAAC,CAAC,CAAC;YACvC,KAAK,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC;QACpC,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,KAAK,EAAE,CAAC;QACT,CAAC;QAED,IAAI,CAAC,UAAU,GAAG,SAAG,CAAC,kBAAkB,CAAC;IAC1C,CAAC;IAGD,IAAI,SAAS;QACZ,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC;IACxB,CAAC;IAED,YAAY;IACZ,IAAI,SAAS,CAAC,MAAc;QAC3B,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC;IAC1B,CAAC;CACD;AARA;IADC,qBAAQ;sDAGR;AAlBF,sDAwBC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/RuleDependency.d.ts b/node_modules/antlr4ts/RuleDependency.d.ts
deleted file mode 100644
index 89fe2b7..0000000
--- a/node_modules/antlr4ts/RuleDependency.d.ts
+++ /dev/null
@@ -1,32 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Dependents } from './Dependents';
-import { Parser } from './Parser';
-/**
- * Declares a dependency upon a grammar rule, along with a set of zero or more dependent rules.
- *
- * Version numbers within a grammar should be assigned on a monotonically increasing basis to allow for accurate
- * tracking of dependent rules.
- *
- * @author Sam Harwell
- */
-export declare function RuleDependency(dependency: DependencySpecification): (target: Object, propertyKey: PropertyKey, propertyDescriptor: PropertyDescriptor) => void;
-export interface DependencySpecification {
- readonly recognizer: {
- new (...args: any[]): Parser;
- };
- readonly rule: number;
- readonly version: number;
- /**
- * Specifies the set of grammar rules related to `rule` which the annotated element depends on. Even when absent
- * from this set, the annotated element is implicitly dependent upon the explicitly specified `rule`, which
- * corresponds to the `Dependents.SELF` element.
- *
- * By default, the annotated element is dependent upon the specified `rule` and its `Dependents.PARENTS`, i.e. the
- * rule within one level of context information. The parents are included since the most frequent assumption about a
- * rule is where it's used in the grammar.
- */
- readonly dependents?: Dependents[];
-}
diff --git a/node_modules/antlr4ts/RuleDependency.js b/node_modules/antlr4ts/RuleDependency.js
deleted file mode 100644
index e4a07f3..0000000
--- a/node_modules/antlr4ts/RuleDependency.js
+++ /dev/null
@@ -1,20 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-/**
- * Declares a dependency upon a grammar rule, along with a set of zero or more dependent rules.
- *
- * Version numbers within a grammar should be assigned on a monotonically increasing basis to allow for accurate
- * tracking of dependent rules.
- *
- * @author Sam Harwell
- */
-function RuleDependency(dependency) {
- return function (target, propertyKey, propertyDescriptor) {
- };
-}
-exports.RuleDependency = RuleDependency;
-//# sourceMappingURL=RuleDependency.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/RuleDependency.js.map b/node_modules/antlr4ts/RuleDependency.js.map
deleted file mode 100644
index ad59779..0000000
--- a/node_modules/antlr4ts/RuleDependency.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"RuleDependency.js","sourceRoot":"","sources":["../../src/RuleDependency.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAOH;;;;;;;GAOG;AACH,wBAA+B,UAAmC;IACjE,MAAM,CAAC,UAAS,MAAc,EAAE,WAAwB,EAAE,kBAAsC;IAChG,CAAC,CAAC;AACH,CAAC;AAHD,wCAGC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/RuleVersion.d.ts b/node_modules/antlr4ts/RuleVersion.d.ts
deleted file mode 100644
index b1cf423..0000000
--- a/node_modules/antlr4ts/RuleVersion.d.ts
+++ /dev/null
@@ -1,11 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Parser } from './Parser';
-import { ParserRuleContext } from './ParserRuleContext';
-/**
- *
- * @author Sam Harwell
- */
-export declare function RuleVersion(version: number): (target: Parser, propertyKey: PropertyKey, propertyDescriptor: TypedPropertyDescriptor<(...args: any[]) => ParserRuleContext>) => void;
diff --git a/node_modules/antlr4ts/RuleVersion.js b/node_modules/antlr4ts/RuleVersion.js
deleted file mode 100644
index 923ff01..0000000
--- a/node_modules/antlr4ts/RuleVersion.js
+++ /dev/null
@@ -1,16 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-/**
- *
- * @author Sam Harwell
- */
-function RuleVersion(version) {
- return function (target, propertyKey, propertyDescriptor) {
- };
-}
-exports.RuleVersion = RuleVersion;
-//# sourceMappingURL=RuleVersion.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/RuleVersion.js.map b/node_modules/antlr4ts/RuleVersion.js.map
deleted file mode 100644
index c64ac34..0000000
--- a/node_modules/antlr4ts/RuleVersion.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"RuleVersion.js","sourceRoot":"","sources":["../../src/RuleVersion.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAOH;;;GAGG;AACH,qBAA4B,OAAe;IAE1C,MAAM,CAAC,UAAS,MAAc,EAAE,WAAwB,EAAE,kBAAkF;IAC5I,CAAC,CAAC;AAEH,CAAC;AALD,kCAKC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/Token.d.ts b/node_modules/antlr4ts/Token.d.ts
deleted file mode 100644
index b36020c..0000000
--- a/node_modules/antlr4ts/Token.d.ts
+++ /dev/null
@@ -1,84 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { CharStream } from './CharStream';
-import { TokenSource } from './TokenSource';
-/** A token has properties: text, type, line, character position in the line
- * (so we can ignore tabs), token channel, index, and source from which
- * we obtained this token.
- */
-export interface Token {
- /**
- * Get the text of the token.
- */
- readonly text: string | undefined;
- /** Get the token type of the token */
- readonly type: number;
- /** The line number on which the 1st character of this token was matched,
- * line=1..n
- */
- readonly line: number;
- /** The index of the first character of this token relative to the
- * beginning of the line at which it occurs, 0..n-1
- */
- readonly charPositionInLine: number;
- /** Return the channel this token. Each token can arrive at the parser
- * on a different channel, but the parser only "tunes" to a single channel.
- * The parser ignores everything not on DEFAULT_CHANNEL.
- */
- readonly channel: number;
- /** An index from 0..n-1 of the token object in the input stream.
- * This must be valid in order to print token streams and
- * use TokenRewriteStream.
- *
- * Return -1 to indicate that this token was conjured up since
- * it doesn't have a valid index.
- */
- readonly tokenIndex: number;
- /** The starting character index of the token
- * This method is optional; return -1 if not implemented.
- */
- readonly startIndex: number;
- /** The last character index of the token.
- * This method is optional; return -1 if not implemented.
- */
- readonly stopIndex: number;
- /** Gets the {@link TokenSource} which created this token.
- */
- readonly tokenSource: TokenSource | undefined;
- /**
- * Gets the {@link CharStream} from which this token was derived.
- */
- readonly inputStream: CharStream | undefined;
-}
-export declare namespace Token {
- const INVALID_TYPE: number;
- /** During lookahead operations, this "token" signifies we hit rule end ATN state
- * and did not follow it despite needing to.
- */
- const EPSILON: number;
- const MIN_USER_TOKEN_TYPE: number;
- const EOF: number;
- /** All tokens go to the parser (unless skip() is called in that rule)
- * on a particular "channel". The parser tunes to a particular channel
- * so that whitespace etc... can go to the parser on a "hidden" channel.
- */
- const DEFAULT_CHANNEL: number;
- /** Anything on different channel than DEFAULT_CHANNEL is not parsed
- * by parser.
- */
- const HIDDEN_CHANNEL: number;
- /**
- * This is the minimum constant value which can be assigned to a
- * user-defined token channel.
- *
- *
- * The non-negative numbers less than {@link #MIN_USER_CHANNEL_VALUE} are
- * assigned to the predefined channels {@link #DEFAULT_CHANNEL} and
- * {@link #HIDDEN_CHANNEL}.
- *
- * @see `Token.channel`
- */
- const MIN_USER_CHANNEL_VALUE: number;
-}
diff --git a/node_modules/antlr4ts/Token.js b/node_modules/antlr4ts/Token.js
deleted file mode 100644
index 6c2e700..0000000
--- a/node_modules/antlr4ts/Token.js
+++ /dev/null
@@ -1,39 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-const IntStream_1 = require("./IntStream");
-var Token;
-(function (Token) {
- Token.INVALID_TYPE = 0;
- /** During lookahead operations, this "token" signifies we hit rule end ATN state
- * and did not follow it despite needing to.
- */
- Token.EPSILON = -2;
- Token.MIN_USER_TOKEN_TYPE = 1;
- Token.EOF = IntStream_1.IntStream.EOF;
- /** All tokens go to the parser (unless skip() is called in that rule)
- * on a particular "channel". The parser tunes to a particular channel
- * so that whitespace etc... can go to the parser on a "hidden" channel.
- */
- Token.DEFAULT_CHANNEL = 0;
- /** Anything on different channel than DEFAULT_CHANNEL is not parsed
- * by parser.
- */
- Token.HIDDEN_CHANNEL = 1;
- /**
- * This is the minimum constant value which can be assigned to a
- * user-defined token channel.
- *
- *
- * The non-negative numbers less than {@link #MIN_USER_CHANNEL_VALUE} are
- * assigned to the predefined channels {@link #DEFAULT_CHANNEL} and
- * {@link #HIDDEN_CHANNEL}.
- *
- * @see `Token.channel`
- */
- Token.MIN_USER_CHANNEL_VALUE = 2;
-})(Token = exports.Token || (exports.Token = {}));
-//# sourceMappingURL=Token.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/Token.js.map b/node_modules/antlr4ts/Token.js.map
deleted file mode 100644
index b3c8d56..0000000
--- a/node_modules/antlr4ts/Token.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"Token.js","sourceRoot":"","sources":["../../src/Token.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAKH,2CAAwC;AA8DxC,IAAiB,KAAK,CAmCrB;AAnCD,WAAiB,KAAK;IACR,kBAAY,GAAW,CAAC,CAAC;IAEtC;;OAEG;IACU,aAAO,GAAW,CAAC,CAAC,CAAC;IAErB,yBAAmB,GAAW,CAAC,CAAC;IAEhC,SAAG,GAAW,qBAAS,CAAC,GAAG,CAAC;IAEzC;;;OAGG;IACU,qBAAe,GAAW,CAAC,CAAC;IAEzC;;OAEG;IACU,oBAAc,GAAW,CAAC,CAAC;IAExC;;;;;;;;;;OAUG;IACU,4BAAsB,GAAW,CAAC,CAAC;AACjD,CAAC,EAnCgB,KAAK,GAAL,aAAK,KAAL,aAAK,QAmCrB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/TokenFactory.d.ts b/node_modules/antlr4ts/TokenFactory.d.ts
deleted file mode 100644
index 5a1b5b8..0000000
--- a/node_modules/antlr4ts/TokenFactory.d.ts
+++ /dev/null
@@ -1,23 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { CharStream } from './CharStream';
-import { Token } from './Token';
-import { TokenSource } from './TokenSource';
-/** The default mechanism for creating tokens. It's used by default in Lexer and
- * the error handling strategy (to create missing tokens). Notifying the parser
- * of a new factory means that it notifies it's token source and error strategy.
- */
-export interface TokenFactory {
- /** This is the method used to create tokens in the lexer and in the
- * error handling strategy. If text!=null, than the start and stop positions
- * are wiped to -1 in the text override is set in the CommonToken.
- */
- create(source: {
- source?: TokenSource;
- stream?: CharStream;
- }, type: number, text: string | undefined, channel: number, start: number, stop: number, line: number, charPositionInLine: number): Token;
- /** Generically useful */
- createSimple(type: number, text: string): Token;
-}
diff --git a/node_modules/antlr4ts/TokenFactory.js b/node_modules/antlr4ts/TokenFactory.js
deleted file mode 100644
index 078ce57..0000000
--- a/node_modules/antlr4ts/TokenFactory.js
+++ /dev/null
@@ -1,7 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=TokenFactory.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/TokenFactory.js.map b/node_modules/antlr4ts/TokenFactory.js.map
deleted file mode 100644
index d30e535..0000000
--- a/node_modules/antlr4ts/TokenFactory.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"TokenFactory.js","sourceRoot":"","sources":["../../src/TokenFactory.ts"],"names":[],"mappings":";AAAA;;;GAGG"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/TokenSource.d.ts b/node_modules/antlr4ts/TokenSource.d.ts
deleted file mode 100644
index 8475fa2..0000000
--- a/node_modules/antlr4ts/TokenSource.d.ts
+++ /dev/null
@@ -1,67 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { CharStream } from './CharStream';
-import { Token } from './Token';
-import { TokenFactory } from './TokenFactory';
-/**
- * A source of tokens must provide a sequence of tokens via {@link #nextToken()}
- * and also must reveal it's source of characters; {@link CommonToken}'s text is
- * computed from a {@link CharStream}; it only store indices into the char
- * stream.
- *
- * Errors from the lexer are never passed to the parser. Either you want to keep
- * going or you do not upon token recognition error. If you do not want to
- * continue lexing then you do not want to continue parsing. Just throw an
- * exception not under {@link RecognitionException} and Java will naturally toss
- * you all the way out of the recognizers. If you want to continue lexing then
- * you should not throw an exception to the parser--it has already requested a
- * token. Keep lexing until you get a valid one. Just report errors and keep
- * going, looking for a valid token.
- */
-export interface TokenSource {
- /**
- * Return a {@link Token} object from your input stream (usually a
- * {@link CharStream}). Do not fail/return upon lexing error; keep chewing
- * on the characters until you get a good one; errors are not passed through
- * to the parser.
- */
- nextToken(): Token;
- /**
- * Get the line number for the current position in the input stream. The
- * first line in the input is line 1.
- *
- * @return The line number for the current position in the input stream, or
- * 0 if the current token source does not track line numbers.
- */
- readonly line: number;
- /**
- * Get the index into the current line for the current position in the input
- * stream. The first character on a line has position 0.
- *
- * @return The line number for the current position in the input stream, or
- * -1 if the current token source does not track character positions.
- */
- readonly charPositionInLine: number;
- /**
- * Get the {@link CharStream} from which this token source is currently
- * providing tokens.
- *
- * @return The {@link CharStream} associated with the current position in
- * the input, or {@code null} if no input stream is available for the token
- * source.
- */
- readonly inputStream: CharStream | undefined;
- /**
- * Gets the name of the underlying input source. This method returns a
- * non-null, non-empty string. If such a name is not known, this method
- * returns {@link IntStream#UNKNOWN_SOURCE_NAME}.
- */
- readonly sourceName: string;
- /**
- * Gets or sets the `TokenFactory` this token source is currently using for
- * creating `Token` objects from the input.
- */
- tokenFactory: TokenFactory;
-}
diff --git a/node_modules/antlr4ts/TokenSource.js b/node_modules/antlr4ts/TokenSource.js
deleted file mode 100644
index 3b0aaa0..0000000
--- a/node_modules/antlr4ts/TokenSource.js
+++ /dev/null
@@ -1,7 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=TokenSource.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/TokenSource.js.map b/node_modules/antlr4ts/TokenSource.js.map
deleted file mode 100644
index 11d40c8..0000000
--- a/node_modules/antlr4ts/TokenSource.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"TokenSource.js","sourceRoot":"","sources":["../../src/TokenSource.ts"],"names":[],"mappings":";AAAA;;;GAGG"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/TokenStream.d.ts b/node_modules/antlr4ts/TokenStream.d.ts
deleted file mode 100644
index 2f4f346..0000000
--- a/node_modules/antlr4ts/TokenStream.d.ts
+++ /dev/null
@@ -1,145 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Interval } from './misc/Interval';
-import { IntStream } from './IntStream';
-import { RuleContext } from './RuleContext';
-import { Token } from './Token';
-import { TokenSource } from './TokenSource';
-/**
- * An {@link IntStream} whose symbols are {@link Token} instances.
- */
-export interface TokenStream extends IntStream {
- /**
- * Get the `Token` instance associated with the value returned by `LA(k)`. This method has the same pre- and
- * post-conditions as `IntStream.LA`. In addition, when the preconditions of this method are met, the return value
- * is non-null and the value of `LT(k).type === LA(k)`.
- *
- * A `RangeError` is thrown if `k<0` and fewer than `-k` calls to `consume()` have occurred from the beginning of
- * the stream before calling this method.
- *
- * See `IntStream.LA`
- */
- LT(k: number): Token;
- /**
- * Get the `Token` instance associated with the value returned by `LA(k)`. This method has the same pre- and
- * post-conditions as `IntStream.LA`. In addition, when the preconditions of this method are met, the return value
- * is non-null and the value of `tryLT(k).type === LA(k)`.
- *
- * The return value is `undefined` if `k<0` and fewer than `-k` calls to `consume()` have occurred from the
- * beginning of the stream before calling this method.
- *
- * See `IntStream.LA`
- */
- tryLT(k: number): Token | undefined;
- /**
- * Gets the {@link Token} at the specified {@code index} in the stream. When
- * the preconditions of this method are met, the return value is non-null.
- *
- * The preconditions for this method are the same as the preconditions of
- * {@link IntStream#seek}. If the behavior of {@code seek(index)} is
- * unspecified for the current state and given {@code index}, then the
- * behavior of this method is also unspecified.
- *
- * The symbol referred to by {@code index} differs from {@code seek()} only
- * in the case of filtering streams where {@code index} lies before the end
- * of the stream. Unlike {@code seek()}, this method does not adjust
- * {@code index} to point to a non-ignored symbol.
- *
- * @throws IllegalArgumentException if {code index} is less than 0
- * @throws UnsupportedOperationException if the stream does not support
- * retrieving the token at the specified index
- */
- get(i: number): Token;
- /**
- * Gets the underlying {@link TokenSource} which provides tokens for this
- * stream.
- */
- readonly tokenSource: TokenSource;
- /**
- * Return the text of all tokens within the specified {@code interval}. This
- * method behaves like the following code (including potential exceptions
- * for violating preconditions of {@link #get}, but may be optimized by the
- * specific implementation.
- *
- *
- * TokenStream stream = ...;
- * String text = "";
- * for (int i = interval.a; i <= interval.b; i++) {
- * text += stream.get(i).text;
- * }
- *
- *
- * @param interval The interval of tokens within this stream to get text
- * for.
- * @return The text of all tokens within the specified interval in this
- * stream.
- *
- * @throws NullPointerException if {@code interval} is {@code null}
- */
- getText(interval: Interval): string;
- /**
- * Return the text of all tokens in the stream. This method behaves like the
- * following code, including potential exceptions from the calls to
- * {@link IntStream#size} and {@link #getText(Interval)}, but may be
- * optimized by the specific implementation.
- *
- *
- * TokenStream stream = ...;
- * String text = stream.getText(new Interval(0, stream.size));
- *
- *
- * @return The text of all tokens in the stream.
- */
- getText(): string;
- /**
- * Return the text of all tokens in the source interval of the specified
- * context. This method behaves like the following code, including potential
- * exceptions from the call to {@link #getText(Interval)}, but may be
- * optimized by the specific implementation.
- *
- * If {@code ctx.sourceInterval} does not return a valid interval of
- * tokens provided by this stream, the behavior is unspecified.
- *
- *
- * TokenStream stream = ...;
- * String text = stream.getText(ctx.sourceInterval);
- *
- *
- * @param ctx The context providing the source interval of tokens to get
- * text for.
- * @return The text of all tokens within the source interval of {@code ctx}.
- */
- getText(ctx: RuleContext): string;
- /**
- * Return the text of all tokens in this stream between {@code start} and
- * {@code stop} (inclusive).
- *
- * If the specified {@code start} or {@code stop} token was not provided by
- * this stream, or if the {@code stop} occurred before the {@code start}
- * token, the behavior is unspecified.
- *
- * For streams which ensure that the `Token.tokenIndex` method is
- * accurate for all of its provided tokens, this method behaves like the
- * following code. Other streams may implement this method in other ways
- * provided the behavior is consistent with this at a high level.
- *
- *
- * TokenStream stream = ...;
- * String text = "";
- * for (int i = start.tokenIndex; i <= stop.tokenIndex; i++) {
- * text += stream.get(i).text;
- * }
- *
- *
- * @param start The first token in the interval to get text for.
- * @param stop The last token in the interval to get text for (inclusive).
- * @return The text of all tokens lying between the specified {@code start}
- * and {@code stop} tokens.
- *
- * @throws UnsupportedOperationException if this stream does not support
- * this method for the specified tokens
- */
- getTextFromRange(start: any, stop: any): string;
-}
diff --git a/node_modules/antlr4ts/TokenStream.js b/node_modules/antlr4ts/TokenStream.js
deleted file mode 100644
index a1e8432..0000000
--- a/node_modules/antlr4ts/TokenStream.js
+++ /dev/null
@@ -1,7 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=TokenStream.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/TokenStream.js.map b/node_modules/antlr4ts/TokenStream.js.map
deleted file mode 100644
index 97631c2..0000000
--- a/node_modules/antlr4ts/TokenStream.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"TokenStream.js","sourceRoot":"","sources":["../../src/TokenStream.ts"],"names":[],"mappings":";AAAA;;;GAGG"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/TokenStreamRewriter.d.ts b/node_modules/antlr4ts/TokenStreamRewriter.d.ts
deleted file mode 100644
index 3001a43..0000000
--- a/node_modules/antlr4ts/TokenStreamRewriter.d.ts
+++ /dev/null
@@ -1,224 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Interval } from './misc/Interval';
-import { Token } from './Token';
-import { TokenStream } from './TokenStream';
-/**
- * Useful for rewriting out a buffered input token stream after doing some
- * augmentation or other manipulations on it.
- *
- *
- * You can insert stuff, replace, and delete chunks. Note that the operations
- * are done lazily--only if you convert the buffer to a {@link String} with
- * {@link TokenStream#getText()}. This is very efficient because you are not
- * moving data around all the time. As the buffer of tokens is converted to
- * strings, the {@link #getText()} method(s) scan the input token stream and
- * check to see if there is an operation at the current index. If so, the
- * operation is done and then normal {@link String} rendering continues on the
- * buffer. This is like having multiple Turing machine instruction streams
- * (programs) operating on a single input tape. :)
- *
- *
- * This rewriter makes no modifications to the token stream. It does not ask the
- * stream to fill itself up nor does it advance the input cursor. The token
- * stream `TokenStream.index` will return the same value before and
- * after any {@link #getText()} call.
- *
- *
- * The rewriter only works on tokens that you have in the buffer and ignores the
- * current input cursor. If you are buffering tokens on-demand, calling
- * {@link #getText()} halfway through the input will only do rewrites for those
- * tokens in the first half of the file.
- *
- *
- * Since the operations are done lazily at {@link #getText}-time, operations do
- * not screw up the token index values. That is, an insert operation at token
- * index {@code i} does not change the index values for tokens
- * {@code i}+1..n-1.
- *
- *
- * Because operations never actually alter the buffer, you may always get the
- * original token stream back without undoing anything. Since the instructions
- * are queued up, you can easily simulate transactions and roll back any changes
- * if there is an error just by removing instructions. For example,
- *
- *
- * CharStream input = new ANTLRFileStream("input");
- * TLexer lex = new TLexer(input);
- * CommonTokenStream tokens = new CommonTokenStream(lex);
- * T parser = new T(tokens);
- * TokenStreamRewriter rewriter = new TokenStreamRewriter(tokens);
- * parser.startRule();
- *
- *
- *
- * Then in the rules, you can execute (assuming rewriter is visible):
- *
- *
- * Token t,u;
- * ...
- * rewriter.insertAfter(t, "text to put after t");}
- * rewriter.insertAfter(u, "text after u");}
- * System.out.println(rewriter.getText());
- *
- *
- *
- * You can also have multiple "instruction streams" and get multiple rewrites
- * from a single pass over the input. Just name the instruction streams and use
- * that name again when printing the buffer. This could be useful for generating
- * a C file and also its header file--all from the same buffer:
- *
- *
- * rewriter.insertAfter("pass1", t, "text to put after t");}
- * rewriter.insertAfter("pass2", u, "text after u");}
- * System.out.println(rewriter.getText("pass1"));
- * System.out.println(rewriter.getText("pass2"));
- *
- *
- *
- * If you don't use named rewrite streams, a "default" stream is used as the
- * first example shows.
- */
-export declare class TokenStreamRewriter {
- static readonly DEFAULT_PROGRAM_NAME: string;
- static readonly PROGRAM_INIT_SIZE: number;
- static readonly MIN_TOKEN_INDEX: number;
- /** Our source stream */
- protected tokens: TokenStream;
- /** You may have multiple, named streams of rewrite operations.
- * I'm calling these things "programs."
- * Maps String (name) → rewrite (List)
- */
- protected programs: Map;
- /** Map String (program name) → Integer index */
- protected lastRewriteTokenIndexes: Map;
- constructor(tokens: TokenStream);
- getTokenStream(): TokenStream;
- rollback(instructionIndex: number): void;
- /** Rollback the instruction stream for a program so that
- * the indicated instruction (via instructionIndex) is no
- * longer in the stream. UNTESTED!
- */
- rollback(instructionIndex: number, programName: string): void;
- deleteProgram(): void;
- /** Reset the program so that no instructions exist */
- deleteProgram(programName: string): void;
- insertAfter(t: Token, text: any): void;
- insertAfter(index: number, text: any): void;
- insertAfter(t: Token, text: any, programName: string): void;
- insertAfter(index: number, text: any, programName: string): void;
- insertBefore(t: Token, text: any): void;
- insertBefore(index: number, text: any): void;
- insertBefore(t: Token, text: any, programName: string): void;
- insertBefore(index: number, text: any, programName: string): void;
- replaceSingle(index: number, text: any): void;
- replaceSingle(indexT: Token, text: any): void;
- replace(from: number, to: number, text: any): void;
- replace(from: Token, to: Token, text: any): void;
- replace(from: number, to: number, text: any, programName: string): void;
- replace(from: Token, to: Token, text: any, programName: string): void;
- delete(index: number): void;
- delete(from: number, to: number): void;
- delete(indexT: Token): void;
- delete(from: Token, to: Token): void;
- delete(from: number, to: number, programName: string): void;
- delete(from: Token, to: Token, programName: string): void;
- protected getLastRewriteTokenIndex(): number;
- protected getLastRewriteTokenIndex(programName: string): number;
- protected setLastRewriteTokenIndex(programName: string, i: number): void;
- protected getProgram(name: string): RewriteOperation[];
- private initializeProgram(name);
- /** Return the text from the original tokens altered per the
- * instructions given to this rewriter.
- */
- getText(): string;
- /** Return the text from the original tokens altered per the
- * instructions given to this rewriter in programName.
- *
- * @since 4.5
- */
- getText(programName: string): string;
- /** Return the text associated with the tokens in the interval from the
- * original token stream but with the alterations given to this rewriter.
- * The interval refers to the indexes in the original token stream.
- * We do not alter the token stream in any way, so the indexes
- * and intervals are still consistent. Includes any operations done
- * to the first and last token in the interval. So, if you did an
- * insertBefore on the first token, you would get that insertion.
- * The same is true if you do an insertAfter the stop token.
- */
- getText(interval: Interval): string;
- getText(interval: Interval, programName: string): string;
- /** We need to combine operations and report invalid operations (like
- * overlapping replaces that are not completed nested). Inserts to
- * same index need to be combined etc... Here are the cases:
- *
- * I.i.u I.j.v leave alone, nonoverlapping
- * I.i.u I.i.v combine: Iivu
- *
- * R.i-j.u R.x-y.v | i-j in x-y delete first R
- * R.i-j.u R.i-j.v delete first R
- * R.i-j.u R.x-y.v | x-y in i-j ERROR
- * R.i-j.u R.x-y.v | boundaries overlap ERROR
- *
- * Delete special case of replace (text==null):
- * D.i-j.u D.x-y.v | boundaries overlap combine to max(min)..max(right)
- *
- * I.i.u R.x-y.v | i in (x+1)-y delete I (since insert before
- * we're not deleting i)
- * I.i.u R.x-y.v | i not in (x+1)-y leave alone, nonoverlapping
- * R.x-y.v I.i.u | i in x-y ERROR
- * R.x-y.v I.x.u R.x-y.uv (combine, delete I)
- * R.x-y.v I.i.u | i not in x-y leave alone, nonoverlapping
- *
- * I.i.u = insert u before op @ index i
- * R.x-y.u = replace x-y indexed tokens with u
- *
- * First we need to examine replaces. For any replace op:
- *
- * 1. wipe out any insertions before op within that range.
- * 2. Drop any replace op before that is contained completely within
- * that range.
- * 3. Throw exception upon boundary overlap with any previous replace.
- *
- * Then we can deal with inserts:
- *
- * 1. for any inserts to same index, combine even if not adjacent.
- * 2. for any prior replace with same left boundary, combine this
- * insert with replace and delete this replace.
- * 3. throw exception if index in same range as previous replace
- *
- * Don't actually delete; make op null in list. Easier to walk list.
- * Later we can throw as we add to index → op map.
- *
- * Note that I.2 R.2-2 will wipe out I.2 even though, technically, the
- * inserted stuff would be before the replace range. But, if you
- * add tokens in front of a method body '{' and then delete the method
- * body, I think the stuff before the '{' you added should disappear too.
- *
- * Return a map from token index to operation.
- */
- protected reduceToSingleOperationPerIndex(rewrites: (RewriteOperation | undefined)[]): Map;
- protected catOpText(a: any, b: any): string;
- /** Get all operations before an index of a particular kind */
- protected getKindOfOps(rewrites: (RewriteOperation | undefined)[], kind: {
- new (...args: any[]): T;
- }, before: number): T[];
-}
-export declare class RewriteOperation {
- protected tokens: TokenStream;
- /** What index into rewrites List are we? */
- instructionIndex: number;
- /** Token buffer index. */
- index: number;
- text: any;
- constructor(tokens: TokenStream, index: number);
- constructor(tokens: TokenStream, index: number, text: any);
- /** Execute the rewrite operation by possibly adding to the buffer.
- * Return the index of the next token to operate on.
- */
- execute(buf: string[]): number;
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/TokenStreamRewriter.js b/node_modules/antlr4ts/TokenStreamRewriter.js
deleted file mode 100644
index 1702a2d..0000000
--- a/node_modules/antlr4ts/TokenStreamRewriter.js
+++ /dev/null
@@ -1,503 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:58.1768850-07:00
-const Interval_1 = require("./misc/Interval");
-const Decorators_1 = require("./Decorators");
-const Token_1 = require("./Token");
-/**
- * Useful for rewriting out a buffered input token stream after doing some
- * augmentation or other manipulations on it.
- *
- *
- * You can insert stuff, replace, and delete chunks. Note that the operations
- * are done lazily--only if you convert the buffer to a {@link String} with
- * {@link TokenStream#getText()}. This is very efficient because you are not
- * moving data around all the time. As the buffer of tokens is converted to
- * strings, the {@link #getText()} method(s) scan the input token stream and
- * check to see if there is an operation at the current index. If so, the
- * operation is done and then normal {@link String} rendering continues on the
- * buffer. This is like having multiple Turing machine instruction streams
- * (programs) operating on a single input tape. :)
- *
- *
- * This rewriter makes no modifications to the token stream. It does not ask the
- * stream to fill itself up nor does it advance the input cursor. The token
- * stream `TokenStream.index` will return the same value before and
- * after any {@link #getText()} call.
- *
- *
- * The rewriter only works on tokens that you have in the buffer and ignores the
- * current input cursor. If you are buffering tokens on-demand, calling
- * {@link #getText()} halfway through the input will only do rewrites for those
- * tokens in the first half of the file.
- *
- *
- * Since the operations are done lazily at {@link #getText}-time, operations do
- * not screw up the token index values. That is, an insert operation at token
- * index {@code i} does not change the index values for tokens
- * {@code i}+1..n-1.
- *
- *
- * Because operations never actually alter the buffer, you may always get the
- * original token stream back without undoing anything. Since the instructions
- * are queued up, you can easily simulate transactions and roll back any changes
- * if there is an error just by removing instructions. For example,
- *
- *
- * CharStream input = new ANTLRFileStream("input");
- * TLexer lex = new TLexer(input);
- * CommonTokenStream tokens = new CommonTokenStream(lex);
- * T parser = new T(tokens);
- * TokenStreamRewriter rewriter = new TokenStreamRewriter(tokens);
- * parser.startRule();
- *
- *
- *
- * Then in the rules, you can execute (assuming rewriter is visible):
- *
- *
- * Token t,u;
- * ...
- * rewriter.insertAfter(t, "text to put after t");}
- * rewriter.insertAfter(u, "text after u");}
- * System.out.println(rewriter.getText());
- *
- *
- *
- * You can also have multiple "instruction streams" and get multiple rewrites
- * from a single pass over the input. Just name the instruction streams and use
- * that name again when printing the buffer. This could be useful for generating
- * a C file and also its header file--all from the same buffer:
- *
- *
- * rewriter.insertAfter("pass1", t, "text to put after t");}
- * rewriter.insertAfter("pass2", u, "text after u");}
- * System.out.println(rewriter.getText("pass1"));
- * System.out.println(rewriter.getText("pass2"));
- *
- *
- *
- * If you don't use named rewrite streams, a "default" stream is used as the
- * first example shows.
- */
-class TokenStreamRewriter {
- constructor(tokens) {
- this.tokens = tokens;
- this.programs = new Map();
- this.programs.set(TokenStreamRewriter.DEFAULT_PROGRAM_NAME, []);
- this.lastRewriteTokenIndexes = new Map();
- }
- getTokenStream() {
- return this.tokens;
- }
- rollback(instructionIndex, programName = TokenStreamRewriter.DEFAULT_PROGRAM_NAME) {
- let is = this.programs.get(programName);
- if (is != null) {
- this.programs.set(programName, is.slice(TokenStreamRewriter.MIN_TOKEN_INDEX, instructionIndex));
- }
- }
- deleteProgram(programName = TokenStreamRewriter.DEFAULT_PROGRAM_NAME) {
- this.rollback(TokenStreamRewriter.MIN_TOKEN_INDEX, programName);
- }
- insertAfter(tokenOrIndex, text, programName = TokenStreamRewriter.DEFAULT_PROGRAM_NAME) {
- let index;
- if (typeof tokenOrIndex === 'number') {
- index = tokenOrIndex;
- }
- else {
- index = tokenOrIndex.tokenIndex;
- }
- // to insert after, just insert before next index (even if past end)
- let op = new InsertAfterOp(this.tokens, index, text);
- let rewrites = this.getProgram(programName);
- op.instructionIndex = rewrites.length;
- rewrites.push(op);
- }
- insertBefore(tokenOrIndex, text, programName = TokenStreamRewriter.DEFAULT_PROGRAM_NAME) {
- let index;
- if (typeof tokenOrIndex === 'number') {
- index = tokenOrIndex;
- }
- else {
- index = tokenOrIndex.tokenIndex;
- }
- let op = new InsertBeforeOp(this.tokens, index, text);
- let rewrites = this.getProgram(programName);
- op.instructionIndex = rewrites.length;
- rewrites.push(op);
- }
- replaceSingle(index, text) {
- if (typeof index === 'number') {
- this.replace(index, index, text);
- }
- else {
- this.replace(index, index, text);
- }
- }
- replace(from, to, text, programName = TokenStreamRewriter.DEFAULT_PROGRAM_NAME) {
- if (typeof from !== 'number') {
- from = from.tokenIndex;
- }
- if (typeof to !== 'number') {
- to = to.tokenIndex;
- }
- if (from > to || from < 0 || to < 0 || to >= this.tokens.size) {
- throw new RangeError(`replace: range invalid: ${from}..${to}(size=${this.tokens.size})`);
- }
- let op = new ReplaceOp(this.tokens, from, to, text);
- let rewrites = this.getProgram(programName);
- op.instructionIndex = rewrites.length;
- rewrites.push(op);
- }
- delete(from, to, programName = TokenStreamRewriter.DEFAULT_PROGRAM_NAME) {
- if (to === undefined) {
- to = from;
- }
- if (typeof from === 'number') {
- this.replace(from, to, undefined, programName);
- }
- else {
- this.replace(from, to, undefined, programName);
- }
- }
- getLastRewriteTokenIndex(programName = TokenStreamRewriter.DEFAULT_PROGRAM_NAME) {
- let I = this.lastRewriteTokenIndexes.get(programName);
- if (I == null) {
- return -1;
- }
- return I;
- }
- setLastRewriteTokenIndex(programName, i) {
- this.lastRewriteTokenIndexes.set(programName, i);
- }
- getProgram(name) {
- let is = this.programs.get(name);
- if (is == null) {
- is = this.initializeProgram(name);
- }
- return is;
- }
- initializeProgram(name) {
- let is = [];
- this.programs.set(name, is);
- return is;
- }
- getText(intervalOrProgram, programName = TokenStreamRewriter.DEFAULT_PROGRAM_NAME) {
- let interval;
- if (intervalOrProgram instanceof Interval_1.Interval) {
- interval = intervalOrProgram;
- }
- else {
- interval = Interval_1.Interval.of(0, this.tokens.size - 1);
- }
- if (typeof intervalOrProgram === 'string') {
- programName = intervalOrProgram;
- }
- let rewrites = this.programs.get(programName);
- let start = interval.a;
- let stop = interval.b;
- // ensure start/end are in range
- if (stop > this.tokens.size - 1)
- stop = this.tokens.size - 1;
- if (start < 0)
- start = 0;
- if (rewrites == null || rewrites.length === 0) {
- return this.tokens.getText(interval); // no instructions to execute
- }
- let buf = [];
- // First, optimize instruction stream
- let indexToOp = this.reduceToSingleOperationPerIndex(rewrites);
- // Walk buffer, executing instructions and emitting tokens
- let i = start;
- while (i <= stop && i < this.tokens.size) {
- let op = indexToOp.get(i);
- indexToOp.delete(i); // remove so any left have index size-1
- let t = this.tokens.get(i);
- if (op == null) {
- // no operation at that index, just dump token
- if (t.type !== Token_1.Token.EOF)
- buf.push(String(t.text));
- i++; // move to next token
- }
- else {
- i = op.execute(buf); // execute operation and skip
- }
- }
- // include stuff after end if it's last index in buffer
- // So, if they did an insertAfter(lastValidIndex, "foo"), include
- // foo if end==lastValidIndex.
- if (stop === this.tokens.size - 1) {
- // Scan any remaining operations after last token
- // should be included (they will be inserts).
- for (let op of indexToOp.values()) {
- if (op.index >= this.tokens.size - 1)
- buf += op.text;
- }
- }
- return buf.join("");
- }
- /** We need to combine operations and report invalid operations (like
- * overlapping replaces that are not completed nested). Inserts to
- * same index need to be combined etc... Here are the cases:
- *
- * I.i.u I.j.v leave alone, nonoverlapping
- * I.i.u I.i.v combine: Iivu
- *
- * R.i-j.u R.x-y.v | i-j in x-y delete first R
- * R.i-j.u R.i-j.v delete first R
- * R.i-j.u R.x-y.v | x-y in i-j ERROR
- * R.i-j.u R.x-y.v | boundaries overlap ERROR
- *
- * Delete special case of replace (text==null):
- * D.i-j.u D.x-y.v | boundaries overlap combine to max(min)..max(right)
- *
- * I.i.u R.x-y.v | i in (x+1)-y delete I (since insert before
- * we're not deleting i)
- * I.i.u R.x-y.v | i not in (x+1)-y leave alone, nonoverlapping
- * R.x-y.v I.i.u | i in x-y ERROR
- * R.x-y.v I.x.u R.x-y.uv (combine, delete I)
- * R.x-y.v I.i.u | i not in x-y leave alone, nonoverlapping
- *
- * I.i.u = insert u before op @ index i
- * R.x-y.u = replace x-y indexed tokens with u
- *
- * First we need to examine replaces. For any replace op:
- *
- * 1. wipe out any insertions before op within that range.
- * 2. Drop any replace op before that is contained completely within
- * that range.
- * 3. Throw exception upon boundary overlap with any previous replace.
- *
- * Then we can deal with inserts:
- *
- * 1. for any inserts to same index, combine even if not adjacent.
- * 2. for any prior replace with same left boundary, combine this
- * insert with replace and delete this replace.
- * 3. throw exception if index in same range as previous replace
- *
- * Don't actually delete; make op null in list. Easier to walk list.
- * Later we can throw as we add to index → op map.
- *
- * Note that I.2 R.2-2 will wipe out I.2 even though, technically, the
- * inserted stuff would be before the replace range. But, if you
- * add tokens in front of a method body '{' and then delete the method
- * body, I think the stuff before the '{' you added should disappear too.
- *
- * Return a map from token index to operation.
- */
- reduceToSingleOperationPerIndex(rewrites) {
- // console.log(`rewrites=[${Utils.join(rewrites, ", ")}]`);
- // WALK REPLACES
- for (let i = 0; i < rewrites.length; i++) {
- let op = rewrites[i];
- if (op == null)
- continue;
- if (!(op instanceof ReplaceOp))
- continue;
- let rop = op;
- // Wipe prior inserts within range
- let inserts = this.getKindOfOps(rewrites, InsertBeforeOp, i);
- for (let iop of inserts) {
- if (iop.index == rop.index) {
- // E.g., insert before 2, delete 2..2; update replace
- // text to include insert before, kill insert
- rewrites[iop.instructionIndex] = undefined;
- rop.text = iop.text.toString() + (rop.text != null ? rop.text.toString() : "");
- }
- else if (iop.index > rop.index && iop.index <= rop.lastIndex) {
- // delete insert as it's a no-op.
- rewrites[iop.instructionIndex] = undefined;
- }
- }
- // Drop any prior replaces contained within
- let prevReplaces = this.getKindOfOps(rewrites, ReplaceOp, i);
- for (let prevRop of prevReplaces) {
- if (prevRop.index >= rop.index && prevRop.lastIndex <= rop.lastIndex) {
- // delete replace as it's a no-op.
- rewrites[prevRop.instructionIndex] = undefined;
- continue;
- }
- // throw exception unless disjoint or identical
- let disjoint = prevRop.lastIndex < rop.index || prevRop.index > rop.lastIndex;
- // Delete special case of replace (text==null):
- // D.i-j.u D.x-y.v | boundaries overlap combine to max(min)..max(right)
- if (prevRop.text == null && rop.text == null && !disjoint) {
- // console.log(`overlapping deletes: ${prevRop}, ${rop}`);
- rewrites[prevRop.instructionIndex] = undefined; // kill first delete
- rop.index = Math.min(prevRop.index, rop.index);
- rop.lastIndex = Math.max(prevRop.lastIndex, rop.lastIndex);
- // console.log(`new rop ${rop}`);
- }
- else if (!disjoint) {
- throw new Error(`replace op boundaries of ${rop} overlap with previous ${prevRop}`);
- }
- }
- }
- // WALK INSERTS
- for (let i = 0; i < rewrites.length; i++) {
- let op = rewrites[i];
- if (op == null)
- continue;
- if (!(op instanceof InsertBeforeOp))
- continue;
- let iop = op;
- // combine current insert with prior if any at same index
- let prevInserts = this.getKindOfOps(rewrites, InsertBeforeOp, i);
- for (let prevIop of prevInserts) {
- if (prevIop.index === iop.index) {
- if (prevIop instanceof InsertAfterOp) {
- iop.text = this.catOpText(prevIop.text, iop.text);
- rewrites[prevIop.instructionIndex] = undefined;
- }
- else if (prevIop instanceof InsertBeforeOp) {
- // convert to strings...we're in process of toString'ing
- // whole token buffer so no lazy eval issue with any templates
- iop.text = this.catOpText(iop.text, prevIop.text);
- // delete redundant prior insert
- rewrites[prevIop.instructionIndex] = undefined;
- }
- }
- }
- // look for replaces where iop.index is in range; error
- let prevReplaces = this.getKindOfOps(rewrites, ReplaceOp, i);
- for (let rop of prevReplaces) {
- if (iop.index == rop.index) {
- rop.text = this.catOpText(iop.text, rop.text);
- rewrites[i] = undefined; // delete current insert
- continue;
- }
- if (iop.index >= rop.index && iop.index <= rop.lastIndex) {
- throw new Error(`insert op ${iop} within boundaries of previous ${rop}`);
- }
- }
- }
- // console.log(`rewrites after=[${Utils.join(rewrites, ", ")}]`);
- let m = new Map();
- for (let i = 0; i < rewrites.length; i++) {
- let op = rewrites[i];
- if (op == null)
- continue; // ignore deleted ops
- if (m.get(op.index) != null) {
- throw new Error("should only be one op per index");
- }
- m.set(op.index, op);
- }
- // console.log(`index to op: ${m}`);
- return m;
- }
- catOpText(a, b) {
- let x = "";
- let y = "";
- if (a != null)
- x = a.toString();
- if (b != null)
- y = b.toString();
- return x + y;
- }
- /** Get all operations before an index of a particular kind */
- getKindOfOps(rewrites, kind, before) {
- let ops = [];
- for (let i = 0; i < before && i < rewrites.length; i++) {
- let op = rewrites[i];
- if (op == null)
- continue; // ignore deleted
- if (op instanceof kind) {
- ops.push(op);
- }
- }
- return ops;
- }
-}
-TokenStreamRewriter.DEFAULT_PROGRAM_NAME = "default";
-TokenStreamRewriter.PROGRAM_INIT_SIZE = 100;
-TokenStreamRewriter.MIN_TOKEN_INDEX = 0;
-exports.TokenStreamRewriter = TokenStreamRewriter;
-// Define the rewrite operation hierarchy
-class RewriteOperation {
- constructor(tokens, index, text) {
- this.tokens = tokens;
- this.index = index;
- this.text = text;
- }
- /** Execute the rewrite operation by possibly adding to the buffer.
- * Return the index of the next token to operate on.
- */
- execute(buf) {
- return this.index;
- }
- toString() {
- let opName = this.constructor.name;
- let $index = opName.indexOf('$');
- opName = opName.substring($index + 1, opName.length);
- return "<" + opName + "@" + this.tokens.get(this.index) +
- ":\"" + this.text + "\">";
- }
-}
-__decorate([
- Decorators_1.Override
-], RewriteOperation.prototype, "toString", null);
-exports.RewriteOperation = RewriteOperation;
-class InsertBeforeOp extends RewriteOperation {
- constructor(tokens, index, text) {
- super(tokens, index, text);
- }
- execute(buf) {
- buf.push(this.text);
- if (this.tokens.get(this.index).type !== Token_1.Token.EOF) {
- buf.push(String(this.tokens.get(this.index).text));
- }
- return this.index + 1;
- }
-}
-__decorate([
- Decorators_1.Override
-], InsertBeforeOp.prototype, "execute", null);
-/** Distinguish between insert after/before to do the "insert afters"
- * first and then the "insert befores" at same index. Implementation
- * of "insert after" is "insert before index+1".
- */
-class InsertAfterOp extends InsertBeforeOp {
- constructor(tokens, index, text) {
- super(tokens, index + 1, text); // insert after is insert before index+1
- }
-}
-/** I'm going to try replacing range from x..y with (y-x)+1 ReplaceOp
- * instructions.
- */
-class ReplaceOp extends RewriteOperation {
- constructor(tokens, from, to, text) {
- super(tokens, from, text);
- this.lastIndex = to;
- }
- execute(buf) {
- if (this.text != null) {
- buf.push(this.text);
- }
- return this.lastIndex + 1;
- }
- toString() {
- if (this.text == null) {
- return "";
- }
- return "";
- }
-}
-__decorate([
- Decorators_1.Override
-], ReplaceOp.prototype, "execute", null);
-__decorate([
- Decorators_1.Override
-], ReplaceOp.prototype, "toString", null);
-//# sourceMappingURL=TokenStreamRewriter.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/TokenStreamRewriter.js.map b/node_modules/antlr4ts/TokenStreamRewriter.js.map
deleted file mode 100644
index 2c1be46..0000000
--- a/node_modules/antlr4ts/TokenStreamRewriter.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"TokenStreamRewriter.js","sourceRoot":"","sources":["../../src/TokenStreamRewriter.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAEH,wDAAwD;AAExD,8CAA2C;AAC3C,6CAAwC;AACxC,mCAAgC;AAKhC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2EG;AACH;IAiBE,YAAY,MAAmB;QAC/B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAA8B,CAAC;QACtD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,mBAAmB,CAAC,oBAAoB,EAAE,EAAE,CAAC,CAAC;QAChE,IAAI,CAAC,uBAAuB,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1D,CAAC;IAED,cAAc;QACb,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IAQD,QAAQ,CAAC,gBAAwB,EAAE,cAAsB,mBAAmB,CAAC,oBAAoB;QAChG,IAAI,EAAE,GAAoC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACzE,EAAE,CAAC,CAAE,EAAE,IAAE,IAAK,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,EAAE,CAAC,KAAK,CAAC,mBAAmB,CAAC,eAAe,EAAC,gBAAgB,CAAC,CAAC,CAAC;QAChG,CAAC;IACF,CAAC;IAMD,aAAa,CAAC,cAAsB,mBAAmB,CAAC,oBAAoB;QAC3E,IAAI,CAAC,QAAQ,CAAC,mBAAmB,CAAC,eAAe,EAAE,WAAW,CAAC,CAAC;IACjE,CAAC;IAMD,WAAW,CAAC,YAA4B,EAAE,IAAS,EAAE,cAAsB,mBAAmB,CAAC,oBAAoB;QAClH,IAAI,KAAa,CAAC;QAClB,EAAE,CAAC,CAAC,OAAO,YAAY,KAAK,QAAQ,CAAC,CAAC,CAAC;YACtC,KAAK,GAAG,YAAY,CAAC;QACtB,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,KAAK,GAAG,YAAY,CAAC,UAAU,CAAC;QACjC,CAAC;QAED,oEAAoE;QACpE,IAAI,EAAE,GAAG,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QACrD,IAAI,QAAQ,GAAuB,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAChE,EAAE,CAAC,gBAAgB,GAAG,QAAQ,CAAC,MAAM,CAAC;QACtC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;IAMD,YAAY,CAAC,YAA4B,EAAE,IAAS,EAAE,cAAsB,mBAAmB,CAAC,oBAAoB;QACnH,IAAI,KAAa,CAAC;QAClB,EAAE,CAAC,CAAC,OAAO,YAAY,KAAK,QAAQ,CAAC,CAAC,CAAC;YACtC,KAAK,GAAG,YAAY,CAAC;QACtB,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,KAAK,GAAG,YAAY,CAAC,UAAU,CAAC;QACjC,CAAC;QAED,IAAI,EAAE,GAAqB,IAAI,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QACxE,IAAI,QAAQ,GAAuB,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAChE,EAAE,CAAC,gBAAgB,GAAG,QAAQ,CAAC,MAAM,CAAC;QACtC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;IAID,aAAa,CAAC,KAAqB,EAAE,IAAS;QAC7C,EAAE,CAAC,CAAC,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAClC,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAClC,CAAC;IACF,CAAC;IAUD,OAAO,CAAC,IAAoB,EAAE,EAAkB,EAAE,IAAsB,EAAE,cAAsB,mBAAmB,CAAC,oBAAoB;QACvI,EAAE,CAAC,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC;YAC9B,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;QACxB,CAAC;QAED,EAAE,CAAC,CAAC,OAAO,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC;YAC5B,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC;QACpB,CAAC;QAED,EAAE,CAAC,CAAE,IAAI,GAAG,EAAE,IAAI,IAAI,GAAC,CAAC,IAAI,EAAE,GAAC,CAAC,IAAI,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,IAAK,CAAC,CAAC,CAAC;YAC7D,MAAM,IAAI,UAAU,CAAC,2BAA2B,IAAI,KAAK,EAAE,SAAS,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;QAC1F,CAAC;QAED,IAAI,EAAE,GAAsB,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QACvE,IAAI,QAAQ,GAAuB,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAChE,EAAE,CAAC,gBAAgB,GAAG,QAAQ,CAAC,MAAM,CAAC;QACtC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;IAcD,MAAM,CAAC,IAAoB,EAAE,EAAmB,EAAE,cAAsB,mBAAmB,CAAC,oBAAoB;QAC/G,EAAE,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC;YACtB,EAAE,GAAG,IAAI,CAAC;QACX,CAAC;QAED,EAAE,CAAC,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC;YAC9B,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAY,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC;QAC1D,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAW,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC;QACzD,CAAC;IACF,CAAC;IAMS,wBAAwB,CAAC,cAAsB,mBAAmB,CAAC,oBAAoB;QAChG,IAAI,CAAC,GAAuB,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAC1E,EAAE,CAAC,CAAE,CAAC,IAAE,IAAK,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,CAAC,CAAC,CAAC;QACX,CAAC;QAED,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAES,wBAAwB,CAAC,WAAmB,EAAE,CAAS;QAChE,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAClD,CAAC;IAES,UAAU,CAAC,IAAY;QAChC,IAAI,EAAE,GAAmC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjE,EAAE,CAAC,CAAE,EAAE,IAAE,IAAK,CAAC,CAAC,CAAC;YAChB,EAAE,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACnC,CAAC;QAED,MAAM,CAAC,EAAE,CAAC;IACX,CAAC;IAEO,iBAAiB,CAAC,IAAY;QACrC,IAAI,EAAE,GAAuB,EAAE,CAAC;QAChC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,CAAC,EAAE,CAAC;IACX,CAAC;IA2BD,OAAO,CAAC,iBAAqC,EAAE,cAAsB,mBAAmB,CAAC,oBAAoB;QAC5G,IAAI,QAAkB,CAAC;QACvB,EAAE,CAAC,CAAC,iBAAiB,YAAY,mBAAQ,CAAC,CAAC,CAAC;YAC3C,QAAQ,GAAG,iBAAiB,CAAC;QAC9B,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,QAAQ,GAAG,mBAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QACjD,CAAC;QAED,EAAE,CAAC,CAAC,OAAO,iBAAiB,KAAK,QAAQ,CAAC,CAAC,CAAC;YAC3C,WAAW,GAAG,iBAAiB,CAAC;QACjC,CAAC;QAED,IAAI,QAAQ,GAAmC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAC9E,IAAI,KAAK,GAAY,QAAQ,CAAC,CAAC,CAAC;QAChC,IAAI,IAAI,GAAY,QAAQ,CAAC,CAAC,CAAC;QAE/B,gCAAgC;QAChC,EAAE,CAAC,CAAE,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,GAAC,CAAE,CAAC;YAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,GAAC,CAAC,CAAC;QAC3D,EAAE,CAAC,CAAE,KAAK,GAAC,CAAE,CAAC;YAAC,KAAK,GAAG,CAAC,CAAC;QAEzB,EAAE,CAAC,CAAE,QAAQ,IAAE,IAAI,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAE,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,6BAA6B;QACpE,CAAC;QAED,IAAI,GAAG,GAAa,EAAE,CAAC;QAEvB,qCAAqC;QACrC,IAAI,SAAS,GAAkC,IAAI,CAAC,+BAA+B,CAAC,QAAQ,CAAC,CAAC;QAE9F,0DAA0D;QAC1D,IAAI,CAAC,GAAY,KAAK,CAAC;QACvB,OAAQ,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAG,CAAC;YAC5C,IAAI,EAAE,GAAkC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACzD,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,uCAAuC;YAC5D,IAAI,CAAC,GAAU,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClC,EAAE,CAAC,CAAE,EAAE,IAAE,IAAK,CAAC,CAAC,CAAC;gBAChB,8CAA8C;gBAC9C,EAAE,CAAC,CAAE,CAAC,CAAC,IAAI,KAAG,aAAK,CAAC,GAAI,CAAC;oBAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBACnD,CAAC,EAAE,CAAC,CAAC,qBAAqB;YAC3B,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,6BAA6B;YACnD,CAAC;QACF,CAAC;QAED,uDAAuD;QACvD,iEAAiE;QACjE,8BAA8B;QAC9B,EAAE,CAAC,CAAE,IAAI,KAAG,IAAI,CAAC,MAAM,CAAC,IAAI,GAAC,CAAE,CAAC,CAAC,CAAC;YACjC,iDAAiD;YACjD,6CAA6C;YAC7C,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBACnC,EAAE,CAAC,CAAE,EAAE,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,GAAC,CAAE,CAAC;oBAAC,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC;YACtD,CAAC;QACF,CAAC;QAED,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACrB,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAgDG;IACO,+BAA+B,CAAC,QAA0C;QACnF,2DAA2D;QAE3D,gBAAgB;QAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,EAAE,GAAiC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACnD,EAAE,CAAC,CAAE,EAAE,IAAE,IAAK,CAAC;gBAAC,QAAQ,CAAC;YACzB,EAAE,CAAC,CAAE,CAAC,CAAC,EAAE,YAAY,SAAS,CAAE,CAAC;gBAAC,QAAQ,CAAC;YAC3C,IAAI,GAAG,GAAc,EAAE,CAAC;YACxB,kCAAkC;YAClC,IAAI,OAAO,GAAqB,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC;YAC/E,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,OAAO,CAAC,CAAC,CAAC;gBACzB,EAAE,CAAC,CAAE,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,KAAM,CAAC,CAAC,CAAC;oBAC9B,qDAAqD;oBACrD,6CAA6C;oBAC7C,QAAQ,CAAC,GAAG,CAAC,gBAAgB,CAAC,GAAG,SAAS,CAAC;oBAC3C,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,IAAE,IAAI,GAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAC,EAAE,CAAC,CAAC;gBAC1E,CAAC;gBACD,IAAI,CAAC,EAAE,CAAC,CAAE,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,SAAU,CAAC,CAAC,CAAC;oBAChE,iCAAiC;oBACjC,QAAQ,CAAC,GAAG,CAAC,gBAAgB,CAAC,GAAG,SAAS,CAAC;gBAC5C,CAAC;YACF,CAAC;YACD,2CAA2C;YAC3C,IAAI,YAAY,GAAgB,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;YAC1E,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,YAAY,CAAC,CAAC,CAAC;gBAClC,EAAE,CAAC,CAAE,OAAO,CAAC,KAAK,IAAE,GAAG,CAAC,KAAK,IAAI,OAAO,CAAC,SAAS,IAAI,GAAG,CAAC,SAAU,CAAC,CAAC,CAAC;oBACtE,kCAAkC;oBAClC,QAAQ,CAAC,OAAO,CAAC,gBAAgB,CAAC,GAAG,SAAS,CAAC;oBAC/C,QAAQ,CAAC;gBACV,CAAC;gBACD,+CAA+C;gBAC/C,IAAI,QAAQ,GACX,OAAO,CAAC,SAAS,GAAC,GAAG,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,GAAG,GAAG,CAAC,SAAS,CAAC;gBAC9D,+CAA+C;gBAC/C,uEAAuE;gBACvE,EAAE,CAAC,CAAE,OAAO,CAAC,IAAI,IAAE,IAAI,IAAI,GAAG,CAAC,IAAI,IAAE,IAAI,IAAI,CAAC,QAAS,CAAC,CAAC,CAAC;oBACzD,0DAA0D;oBAC1D,QAAQ,CAAC,OAAO,CAAC,gBAAgB,CAAC,GAAG,SAAS,CAAC,CAAC,oBAAoB;oBACpE,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;oBAC/C,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;oBAC3D,iCAAiC;gBAClC,CAAC;gBACD,IAAI,CAAC,EAAE,CAAC,CAAE,CAAC,QAAS,CAAC,CAAC,CAAC;oBACtB,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,0BAA0B,OAAO,EAAE,CAAC,CAAC;gBACrF,CAAC;YACF,CAAC;QACF,CAAC;QAED,eAAe;QACf,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,EAAE,GAAiC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACnD,EAAE,CAAC,CAAE,EAAE,IAAE,IAAK,CAAC;gBAAC,QAAQ,CAAC;YACzB,EAAE,CAAC,CAAE,CAAC,CAAC,EAAE,YAAY,cAAc,CAAE,CAAC;gBAAC,QAAQ,CAAC;YAChD,IAAI,GAAG,GAAoB,EAAE,CAAC;YAC9B,yDAAyD;YACzD,IAAI,WAAW,GAAqB,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC;YACnF,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC;gBACjC,EAAE,CAAC,CAAE,OAAO,CAAC,KAAK,KAAK,GAAG,CAAC,KAAM,CAAC,CAAC,CAAC;oBACnC,EAAE,CAAC,CAAC,OAAO,YAAY,aAAa,CAAC,CAAC,CAAC;wBACtC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;wBAClD,QAAQ,CAAC,OAAO,CAAC,gBAAgB,CAAC,GAAG,SAAS,CAAC;oBAChD,CAAC;oBACD,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,YAAY,cAAc,CAAC,CAAC,CAAC;wBAC5C,wDAAwD;wBACxD,8DAA8D;wBAC9D,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAC,OAAO,CAAC,IAAI,CAAC,CAAC;wBACjD,gCAAgC;wBAChC,QAAQ,CAAC,OAAO,CAAC,gBAAgB,CAAC,GAAG,SAAS,CAAC;oBAChD,CAAC;gBACF,CAAC;YACF,CAAC;YACD,uDAAuD;YACvD,IAAI,YAAY,GAAgB,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;YAC1E,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC;gBAC9B,EAAE,CAAC,CAAE,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,KAAM,CAAC,CAAC,CAAC;oBAC9B,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAC7C,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,wBAAwB;oBACjD,QAAQ,CAAC;gBACV,CAAC;gBACD,EAAE,CAAC,CAAE,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,SAAU,CAAC,CAAC,CAAC;oBAC5D,MAAM,IAAI,KAAK,CAAC,aAAa,GAAG,kCAAkC,GAAG,EAAE,CAAC,CAAC;gBAC1E,CAAC;YACF,CAAC;QACF,CAAC;QACD,iEAAiE;QACjE,IAAI,CAAC,GAAmC,IAAI,GAAG,EAA4B,CAAC;QAC5E,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,EAAE,GAAiC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACnD,EAAE,CAAC,CAAE,EAAE,IAAE,IAAK,CAAC;gBAAC,QAAQ,CAAC,CAAC,qBAAqB;YAC/C,EAAE,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,IAAE,IAAK,CAAC,CAAC,CAAC;gBAC7B,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;YACpD,CAAC;YACD,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACrB,CAAC;QACD,oCAAoC;QACpC,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAES,SAAS,CAAC,CAAM,EAAE,CAAM;QACjC,IAAI,CAAC,GAAY,EAAE,CAAC;QACpB,IAAI,CAAC,GAAY,EAAE,CAAC;QACpB,EAAE,CAAC,CAAE,CAAC,IAAE,IAAK,CAAC;YAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC;QAChC,EAAE,CAAC,CAAE,CAAC,IAAE,IAAK,CAAC;YAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC;QAChC,MAAM,CAAC,CAAC,GAAC,CAAC,CAAC;IACZ,CAAC;IAED,8DAA8D;IACpD,YAAY,CAA6B,QAA0C,EAAE,IAA8B,EAAE,MAAc;QAC5I,IAAI,GAAG,GAAQ,EAAE,CAAC;QAClB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,MAAM,IAAI,CAAC,GAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,IAAI,EAAE,GAAkC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACpD,EAAE,CAAC,CAAE,EAAE,IAAE,IAAK,CAAC;gBAAC,QAAQ,CAAC,CAAC,iBAAiB;YAC3C,EAAE,CAAC,CAAE,EAAE,YAAY,IAAK,CAAC,CAAC,CAAC;gBAC1B,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACd,CAAC;QACF,CAAC;QACD,MAAM,CAAC,GAAG,CAAC;IACZ,CAAC;;AA7ae,wCAAoB,GAAY,SAAS,CAAC;AAC1C,qCAAiB,GAAY,GAAG,CAAC;AACjC,mCAAe,GAAY,CAAC,CAAC;AAH9C,kDA+aC;AAED,yCAAyC;AAEzC;IAUC,YAAY,MAAmB,EAAE,KAAa,EAAE,IAAU;QACzD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,GAAa;QACpB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAGD,QAAQ;QACP,IAAI,MAAM,GAAW,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;QAC3C,IAAI,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACjC,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,GAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QACnD,MAAM,CAAC,GAAG,GAAC,MAAM,GAAC,GAAG,GAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;YAC/C,KAAK,GAAC,IAAI,CAAC,IAAI,GAAC,KAAK,CAAC;IACzB,CAAC;CACD;AAPA;IADC,qBAAQ;gDAOR;AA9BF,4CA+BC;AAED,oBAAqB,SAAQ,gBAAgB;IAC5C,YAAY,MAAmB,EAAE,KAAa,EAAE,IAAS;QACxD,KAAK,CAAC,MAAM,EAAC,KAAK,EAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAGD,OAAO,CAAC,GAAa;QACpB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,EAAE,CAAC,CAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,aAAK,CAAC,GAAI,CAAC,CAAC,CAAC;YACtD,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,KAAK,GAAC,CAAC,CAAC;IACrB,CAAC;CACD;AAPA;IADC,qBAAQ;6CAOR;AAGF;;;GAGG;AACH,mBAAoB,SAAQ,cAAc;IACzC,YAAY,MAAmB,EAAE,KAAa,EAAE,IAAS;QACxD,KAAK,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,wCAAwC;IACzE,CAAC;CACD;AAED;;GAEG;AACH,eAAgB,SAAQ,gBAAgB;IAEvC,YAAY,MAAmB,EAAE,IAAY,EAAE,EAAU,EAAE,IAAS;QACnE,KAAK,CAAC,MAAM,EAAE,IAAI,EAAC,IAAI,CAAC,CAAC;QACzB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACrB,CAAC;IAGD,OAAO,CAAC,GAAa;QACpB,EAAE,CAAC,CAAE,IAAI,CAAC,IAAI,IAAE,IAAK,CAAC,CAAC,CAAC;YACvB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,SAAS,GAAC,CAAC,CAAC;IACzB,CAAC;IAGD,QAAQ;QACP,EAAE,CAAC,CAAE,IAAI,CAAC,IAAI,IAAE,IAAK,CAAC,CAAC,CAAC;YACvB,MAAM,CAAC,YAAY,GAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;gBAC7C,IAAI,GAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAC,GAAG,CAAC;QAC5C,CAAC;QACD,MAAM,CAAC,aAAa,GAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;YAC9C,IAAI,GAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAC,KAAK,GAAC,IAAI,CAAC,IAAI,GAAC,KAAK,CAAC;IAC9D,CAAC;CACD;AAhBA;IADC,qBAAQ;wCAMR;AAGD;IADC,qBAAQ;yCAQR"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/Vocabulary.d.ts b/node_modules/antlr4ts/Vocabulary.d.ts
deleted file mode 100644
index 6dd5e72..0000000
--- a/node_modules/antlr4ts/Vocabulary.d.ts
+++ /dev/null
@@ -1,121 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-/**
- * This interface provides information about the vocabulary used by a
- * recognizer.
- *
- * @see Recognizer.vocabulary
- * @author Sam Harwell
- */
-export interface Vocabulary {
- /**
- * Returns the highest token type value. It can be used to iterate from
- * zero to that number, inclusively, thus querying all stored entries.
- * @return the highest token type value
- */
- readonly maxTokenType: number;
- /**
- * Gets the string literal associated with a token type. The string returned
- * by this method, when not {@code null}, can be used unaltered in a parser
- * grammar to represent this token type.
- *
- * The following table shows examples of lexer rules and the literal
- * names assigned to the corresponding token types.
- *
- *
- *
- * Rule |
- * Literal Name |
- * Java String Literal |
- *
- *
- * {@code THIS : 'this';} |
- * {@code 'this'} |
- * {@code "'this'"} |
- *
- *
- * {@code SQUOTE : '\'';} |
- * {@code '\''} |
- * {@code "'\\''"} |
- *
- *
- * {@code ID : [A-Z]+;} |
- * n/a |
- * {@code null} |
- *
- *
- *
- * @param tokenType The token type.
- *
- * @return The string literal associated with the specified token type, or
- * {@code null} if no string literal is associated with the type.
- */
- getLiteralName(tokenType: number): string | undefined;
- /**
- * Gets the symbolic name associated with a token type. The string returned
- * by this method, when not {@code null}, can be used unaltered in a parser
- * grammar to represent this token type.
- *
- * This method supports token types defined by any of the following
- * methods:
- *
- *
- * - Tokens created by lexer rules.
- * - Tokens defined in a
tokens{}
block in a lexer or parser
- * grammar.
- * - The implicitly defined {@code EOF} token, which has the token type
- * {@link Token#EOF}.
- *
- *
- * The following table shows examples of lexer rules and the literal
- * names assigned to the corresponding token types.
- *
- *
- *
- * Rule |
- * Symbolic Name |
- *
- *
- * {@code THIS : 'this';} |
- * {@code THIS} |
- *
- *
- * {@code SQUOTE : '\'';} |
- * {@code SQUOTE} |
- *
- *
- * {@code ID : [A-Z]+;} |
- * {@code ID} |
- *
- *
- *
- * @param tokenType The token type.
- *
- * @return The symbolic name associated with the specified token type, or
- * {@code null} if no symbolic name is associated with the type.
- */
- getSymbolicName(tokenType: number): string | undefined;
- /**
- * Gets the display name of a token type.
- *
- * ANTLR provides a default implementation of this method, but
- * applications are free to override the behavior in any manner which makes
- * sense for the application. The default implementation returns the first
- * result from the following list which produces a non-{@code null}
- * result.
- *
- *
- * - The result of {@link #getLiteralName}
- * - The result of {@link #getSymbolicName}
- * - The result of {@link Integer#toString}
- *
- *
- * @param tokenType The token type.
- *
- * @return The display name of the token type, for use in error reporting or
- * other user-visible messages which reference specific token types.
- */
- getDisplayName(tokenType: number): string;
-}
diff --git a/node_modules/antlr4ts/Vocabulary.js b/node_modules/antlr4ts/Vocabulary.js
deleted file mode 100644
index 73dce58..0000000
--- a/node_modules/antlr4ts/Vocabulary.js
+++ /dev/null
@@ -1,7 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=Vocabulary.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/Vocabulary.js.map b/node_modules/antlr4ts/Vocabulary.js.map
deleted file mode 100644
index 342fa1b..0000000
--- a/node_modules/antlr4ts/Vocabulary.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"Vocabulary.js","sourceRoot":"","sources":["../../src/Vocabulary.ts"],"names":[],"mappings":";AAAA;;;GAGG"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/VocabularyImpl.d.ts b/node_modules/antlr4ts/VocabularyImpl.d.ts
deleted file mode 100644
index 875a2ae..0000000
--- a/node_modules/antlr4ts/VocabularyImpl.d.ts
+++ /dev/null
@@ -1,48 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Vocabulary } from './Vocabulary';
-/**
- * This class provides a default implementation of the {@link Vocabulary}
- * interface.
- *
- * @author Sam Harwell
- */
-export declare class VocabularyImpl implements Vocabulary {
- /**
- * Gets an empty {@link Vocabulary} instance.
- *
- *
- * No literal or symbol names are assigned to token types, so
- * {@link #getDisplayName(int)} returns the numeric value for all tokens
- * except {@link Token#EOF}.
- */
- static readonly EMPTY_VOCABULARY: VocabularyImpl;
- private readonly literalNames;
- private readonly symbolicNames;
- private readonly displayNames;
- private _maxTokenType;
- /**
- * Constructs a new instance of {@link VocabularyImpl} from the specified
- * literal, symbolic, and display token names.
- *
- * @param literalNames The literal names assigned to tokens, or an empty array
- * if no literal names are assigned.
- * @param symbolicNames The symbolic names assigned to tokens, or
- * an empty array if no symbolic names are assigned.
- * @param displayNames The display names assigned to tokens, or an empty array
- * to use the values in {@code literalNames} and {@code symbolicNames} as
- * the source of display names, as described in
- * {@link #getDisplayName(int)}.
- *
- * @see #getLiteralName(int)
- * @see #getSymbolicName(int)
- * @see #getDisplayName(int)
- */
- constructor(literalNames: (string | undefined)[], symbolicNames: (string | undefined)[], displayNames: (string | undefined)[]);
- readonly maxTokenType: number;
- getLiteralName(tokenType: number): string | undefined;
- getSymbolicName(tokenType: number): string | undefined;
- getDisplayName(tokenType: number): string;
-}
diff --git a/node_modules/antlr4ts/VocabularyImpl.js b/node_modules/antlr4ts/VocabularyImpl.js
deleted file mode 100644
index 07a3ad7..0000000
--- a/node_modules/antlr4ts/VocabularyImpl.js
+++ /dev/null
@@ -1,119 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:59.5829654-07:00
-const Decorators_1 = require("./Decorators");
-const Token_1 = require("./Token");
-/**
- * This class provides a default implementation of the {@link Vocabulary}
- * interface.
- *
- * @author Sam Harwell
- */
-class VocabularyImpl {
- /**
- * Constructs a new instance of {@link VocabularyImpl} from the specified
- * literal, symbolic, and display token names.
- *
- * @param literalNames The literal names assigned to tokens, or an empty array
- * if no literal names are assigned.
- * @param symbolicNames The symbolic names assigned to tokens, or
- * an empty array if no symbolic names are assigned.
- * @param displayNames The display names assigned to tokens, or an empty array
- * to use the values in {@code literalNames} and {@code symbolicNames} as
- * the source of display names, as described in
- * {@link #getDisplayName(int)}.
- *
- * @see #getLiteralName(int)
- * @see #getSymbolicName(int)
- * @see #getDisplayName(int)
- */
- constructor(literalNames, symbolicNames, displayNames) {
- this.literalNames = literalNames;
- this.symbolicNames = symbolicNames;
- this.displayNames = displayNames;
- // See note here on -1 part: https://github.com/antlr/antlr4/pull/1146
- this._maxTokenType =
- Math.max(this.displayNames.length, Math.max(this.literalNames.length, this.symbolicNames.length)) - 1;
- }
- get maxTokenType() {
- return this._maxTokenType;
- }
- getLiteralName(tokenType) {
- if (tokenType >= 0 && tokenType < this.literalNames.length) {
- return this.literalNames[tokenType];
- }
- return undefined;
- }
- getSymbolicName(tokenType) {
- if (tokenType >= 0 && tokenType < this.symbolicNames.length) {
- return this.symbolicNames[tokenType];
- }
- if (tokenType === Token_1.Token.EOF) {
- return "EOF";
- }
- return undefined;
- }
- getDisplayName(tokenType) {
- if (tokenType >= 0 && tokenType < this.displayNames.length) {
- let displayName = this.displayNames[tokenType];
- if (displayName) {
- return displayName;
- }
- }
- let literalName = this.getLiteralName(tokenType);
- if (literalName) {
- return literalName;
- }
- let symbolicName = this.getSymbolicName(tokenType);
- if (symbolicName) {
- return symbolicName;
- }
- return String(tokenType);
- }
-}
-/**
- * Gets an empty {@link Vocabulary} instance.
- *
- *
- * No literal or symbol names are assigned to token types, so
- * {@link #getDisplayName(int)} returns the numeric value for all tokens
- * except {@link Token#EOF}.
- */
-VocabularyImpl.EMPTY_VOCABULARY = new VocabularyImpl([], [], []);
-__decorate([
- Decorators_1.NotNull
-], VocabularyImpl.prototype, "literalNames", void 0);
-__decorate([
- Decorators_1.NotNull
-], VocabularyImpl.prototype, "symbolicNames", void 0);
-__decorate([
- Decorators_1.NotNull
-], VocabularyImpl.prototype, "displayNames", void 0);
-__decorate([
- Decorators_1.Override
-], VocabularyImpl.prototype, "maxTokenType", null);
-__decorate([
- Decorators_1.Override
-], VocabularyImpl.prototype, "getLiteralName", null);
-__decorate([
- Decorators_1.Override
-], VocabularyImpl.prototype, "getSymbolicName", null);
-__decorate([
- Decorators_1.Override,
- Decorators_1.NotNull
-], VocabularyImpl.prototype, "getDisplayName", null);
-__decorate([
- Decorators_1.NotNull
-], VocabularyImpl, "EMPTY_VOCABULARY", void 0);
-exports.VocabularyImpl = VocabularyImpl;
-//# sourceMappingURL=VocabularyImpl.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/VocabularyImpl.js.map b/node_modules/antlr4ts/VocabularyImpl.js.map
deleted file mode 100644
index 790ebb6..0000000
--- a/node_modules/antlr4ts/VocabularyImpl.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"VocabularyImpl.js","sourceRoot":"","sources":["../../src/VocabularyImpl.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAEH,wDAAwD;AAExD,6CAAiD;AACjD,mCAAgC;AAGhC;;;;;GAKG;AACH;IAqBC;;;;;;;;;;;;;;;;OAgBG;IACH,YAAY,YAAoC,EAAE,aAAqC,EAAE,YAAoC;QAC5H,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,sEAAsE;QACtE,IAAI,CAAC,aAAa;YACjB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,EAChC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;IACtE,CAAC;IAGD,IAAI,YAAY;QACf,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC;IAC3B,CAAC;IAGD,cAAc,CAAC,SAAiB;QAC/B,EAAE,CAAC,CAAC,SAAS,IAAI,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5D,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QACrC,CAAC;QAED,MAAM,CAAC,SAAS,CAAC;IAClB,CAAC;IAGD,eAAe,CAAC,SAAiB;QAChC,EAAE,CAAC,CAAC,SAAS,IAAI,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;YAC7D,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACtC,CAAC;QAED,EAAE,CAAC,CAAC,SAAS,KAAK,aAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,SAAS,CAAC;IAClB,CAAC;IAID,cAAc,CAAC,SAAiB;QAC/B,EAAE,CAAC,CAAC,SAAS,IAAI,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5D,IAAI,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;YAC/C,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;gBACjB,MAAM,CAAC,WAAW,CAAC;YACpB,CAAC;QACF,CAAC;QAED,IAAI,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;QACjD,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,WAAW,CAAC;QACpB,CAAC;QAED,IAAI,YAAY,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;QACnD,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,YAAY,CAAC;QACrB,CAAC;QAED,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC1B,CAAC;;AA/FD;;;;;;;GAOG;AAEa,+BAAgB,GAAmB,IAAI,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;AAGlF;IADC,oBAAO;oDAC8C;AAEtD;IADC,oBAAO;qDAC+C;AAEvD;IADC,oBAAO;oDAC8C;AAgCtD;IADC,qBAAQ;kDAGR;AAGD;IADC,qBAAQ;oDAOR;AAGD;IADC,qBAAQ;qDAWR;AAID;IAFC,qBAAQ;IACR,oBAAO;oDAoBP;AAtFD;IADC,oBAAO;8CAC0E;AAVnF,wCAiGC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/WritableToken.d.ts b/node_modules/antlr4ts/WritableToken.d.ts
deleted file mode 100644
index 8b7f585..0000000
--- a/node_modules/antlr4ts/WritableToken.d.ts
+++ /dev/null
@@ -1,13 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Token } from './Token';
-export interface WritableToken extends Token {
- text: string | undefined;
- type: number;
- line: number;
- charPositionInLine: number;
- channel: number;
- tokenIndex: number;
-}
diff --git a/node_modules/antlr4ts/WritableToken.js b/node_modules/antlr4ts/WritableToken.js
deleted file mode 100644
index 203231a..0000000
--- a/node_modules/antlr4ts/WritableToken.js
+++ /dev/null
@@ -1,7 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=WritableToken.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/WritableToken.js.map b/node_modules/antlr4ts/WritableToken.js.map
deleted file mode 100644
index 3123c09..0000000
--- a/node_modules/antlr4ts/WritableToken.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"WritableToken.js","sourceRoot":"","sources":["../../src/WritableToken.ts"],"names":[],"mappings":";AAAA;;;GAGG"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATN.d.ts b/node_modules/antlr4ts/atn/ATN.d.ts
deleted file mode 100644
index 54c409b..0000000
--- a/node_modules/antlr4ts/atn/ATN.d.ts
+++ /dev/null
@@ -1,123 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { ATNType } from './ATNType';
-import { DecisionState } from './DecisionState';
-import { DFA } from '../dfa/DFA';
-import { IntervalSet } from '../misc/IntervalSet';
-import { LexerAction } from './LexerAction';
-import { PredictionContext } from './PredictionContext';
-import { RuleContext } from '../RuleContext';
-import { RuleStartState } from './RuleStartState';
-import { RuleStopState } from './RuleStopState';
-import { TokensStartState } from './TokensStartState';
-/** */
-export declare class ATN {
- readonly states: ATNState[];
- /** Each subrule/rule is a decision point and we must track them so we
- * can go back later and build DFA predictors for them. This includes
- * all the rules, subrules, optional blocks, ()+, ()* etc...
- */
- decisionToState: DecisionState[];
- /**
- * Maps from rule index to starting state number.
- */
- ruleToStartState: RuleStartState[];
- /**
- * Maps from rule index to stop state number.
- */
- ruleToStopState: RuleStopState[];
- modeNameToStartState: Map;
- /**
- * The type of the ATN.
- */
- grammarType: ATNType;
- /**
- * The maximum value for any symbol recognized by a transition in the ATN.
- */
- maxTokenType: number;
- /**
- * For lexer ATNs, this maps the rule index to the resulting token type.
- * For parser ATNs, this maps the rule index to the generated bypass token
- * type if the
- * {@link ATNDeserializationOptions#isGenerateRuleBypassTransitions}
- * deserialization option was specified; otherwise, this is {@code null}.
- */
- ruleToTokenType: Int32Array;
- /**
- * For lexer ATNs, this is an array of {@link LexerAction} objects which may
- * be referenced by action transitions in the ATN.
- */
- lexerActions: LexerAction[];
- modeToStartState: TokensStartState[];
- private contextCache;
- decisionToDFA: DFA[];
- modeToDFA: DFA[];
- LL1Table: Map;
- /** Used for runtime deserialization of ATNs from strings */
- constructor(grammarType: ATNType, maxTokenType: number);
- clearDFA(): void;
- readonly contextCacheSize: number;
- getCachedContext(context: PredictionContext): PredictionContext;
- getDecisionToDFA(): DFA[];
- /** Compute the set of valid tokens that can occur starting in state {@code s}.
- * If {@code ctx} is {@link PredictionContext#EMPTY_LOCAL}, the set of tokens will not include what can follow
- * the rule surrounding {@code s}. In other words, the set will be
- * restricted to tokens reachable staying within {@code s}'s rule.
- */
- nextTokens(s: ATNState, ctx: PredictionContext): IntervalSet;
- /**
- * Compute the set of valid tokens that can occur starting in {@code s} and
- * staying in same rule. {@link Token#EPSILON} is in set if we reach end of
- * rule.
- */
- nextTokens(s: ATNState): IntervalSet;
- addState(state: ATNState): void;
- removeState(state: ATNState): void;
- defineMode(name: string, s: TokensStartState): void;
- defineDecisionState(s: DecisionState): number;
- getDecisionState(decision: number): DecisionState | undefined;
- readonly numberOfDecisions: number;
- /**
- * Computes the set of input symbols which could follow ATN state number
- * {@code stateNumber} in the specified full {@code context}. This method
- * considers the complete parser context, but does not evaluate semantic
- * predicates (i.e. all predicates encountered during the calculation are
- * assumed true). If a path in the ATN exists from the starting state to the
- * {@link RuleStopState} of the outermost context without matching any
- * symbols, {@link Token#EOF} is added to the returned set.
- *
- * If {@code context} is {@code null}, it is treated as
- * {@link ParserRuleContext#EMPTY}.
- *
- * Note that this does NOT give you the set of all tokens that could
- * appear at a given token position in the input phrase. In other words, it
- * does not answer:
- *
- * "Given a specific partial input phrase, return the set of all
- * tokens that can follow the last token in the input phrase."
- *
- * The big difference is that with just the input, the parser could land
- * right in the middle of a lookahead decision. Getting all
- * possible tokens given a partial input stream is a separate
- * computation. See https://github.com/antlr/antlr4/issues/1428
- *
- * For this function, we are specifying an ATN state and call stack to
- * compute what token(s) can come next and specifically: outside of a
- * lookahead decision. That is what you want for error reporting and
- * recovery upon parse error.
- *
- * @param stateNumber the ATN state number
- * @param context the full parse context
- * @return The set of potentially valid input symbols which could follow the
- * specified state in the specified context.
- * @ if the ATN does not contain a state with
- * number {@code stateNumber}
- */
- getExpectedTokens(stateNumber: number, context: RuleContext | undefined): IntervalSet;
-}
-export declare namespace ATN {
- const INVALID_ALT_NUMBER: number;
-}
diff --git a/node_modules/antlr4ts/atn/ATN.js b/node_modules/antlr4ts/atn/ATN.js
deleted file mode 100644
index 5d24e7d..0000000
--- a/node_modules/antlr4ts/atn/ATN.js
+++ /dev/null
@@ -1,220 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:25.1063510-07:00
-const Array2DHashMap_1 = require("../misc/Array2DHashMap");
-const DFA_1 = require("../dfa/DFA");
-const IntervalSet_1 = require("../misc/IntervalSet");
-const InvalidState_1 = require("./InvalidState");
-const LL1Analyzer_1 = require("./LL1Analyzer");
-const Decorators_1 = require("../Decorators");
-const ObjectEqualityComparator_1 = require("../misc/ObjectEqualityComparator");
-const PredictionContext_1 = require("./PredictionContext");
-const Token_1 = require("../Token");
-const assert = require("assert");
-/** */
-let ATN = class ATN {
- /** Used for runtime deserialization of ATNs from strings */
- constructor(grammarType, maxTokenType) {
- this.states = [];
- /** Each subrule/rule is a decision point and we must track them so we
- * can go back later and build DFA predictors for them. This includes
- * all the rules, subrules, optional blocks, ()+, ()* etc...
- */
- this.decisionToState = [];
- this.modeNameToStartState = new Map();
- this.modeToStartState = [];
- this.contextCache = new Array2DHashMap_1.Array2DHashMap(ObjectEqualityComparator_1.ObjectEqualityComparator.INSTANCE);
- this.decisionToDFA = [];
- this.modeToDFA = [];
- this.LL1Table = new Map();
- this.grammarType = grammarType;
- this.maxTokenType = maxTokenType;
- }
- clearDFA() {
- this.decisionToDFA = new Array(this.decisionToState.length);
- for (let i = 0; i < this.decisionToDFA.length; i++) {
- this.decisionToDFA[i] = new DFA_1.DFA(this.decisionToState[i], i);
- }
- this.modeToDFA = new Array(this.modeToStartState.length);
- for (let i = 0; i < this.modeToDFA.length; i++) {
- this.modeToDFA[i] = new DFA_1.DFA(this.modeToStartState[i]);
- }
- this.contextCache.clear();
- this.LL1Table.clear();
- }
- get contextCacheSize() {
- return this.contextCache.size;
- }
- getCachedContext(context) {
- return PredictionContext_1.PredictionContext.getCachedContext(context, this.contextCache, new PredictionContext_1.PredictionContext.IdentityHashMap());
- }
- getDecisionToDFA() {
- assert(this.decisionToDFA != null && this.decisionToDFA.length === this.decisionToState.length);
- return this.decisionToDFA;
- }
- nextTokens(s, ctx) {
- if (ctx) {
- let anal = new LL1Analyzer_1.LL1Analyzer(this);
- let next = anal.LOOK(s, ctx);
- return next;
- }
- else {
- if (s.nextTokenWithinRule) {
- return s.nextTokenWithinRule;
- }
- s.nextTokenWithinRule = this.nextTokens(s, PredictionContext_1.PredictionContext.EMPTY_LOCAL);
- s.nextTokenWithinRule.setReadonly(true);
- return s.nextTokenWithinRule;
- }
- }
- addState(state) {
- state.atn = this;
- state.stateNumber = this.states.length;
- this.states.push(state);
- }
- removeState(state) {
- // just replace the state, don't shift states in list
- let invalidState = new InvalidState_1.InvalidState();
- invalidState.atn = this;
- invalidState.stateNumber = state.stateNumber;
- this.states[state.stateNumber] = invalidState;
- }
- defineMode(name, s) {
- this.modeNameToStartState.set(name, s);
- this.modeToStartState.push(s);
- this.modeToDFA.push(new DFA_1.DFA(s));
- this.defineDecisionState(s);
- }
- defineDecisionState(s) {
- this.decisionToState.push(s);
- s.decision = this.decisionToState.length - 1;
- this.decisionToDFA.push(new DFA_1.DFA(s, s.decision));
- return s.decision;
- }
- getDecisionState(decision) {
- if (this.decisionToState.length > 0) {
- return this.decisionToState[decision];
- }
- return undefined;
- }
- get numberOfDecisions() {
- return this.decisionToState.length;
- }
- /**
- * Computes the set of input symbols which could follow ATN state number
- * {@code stateNumber} in the specified full {@code context}. This method
- * considers the complete parser context, but does not evaluate semantic
- * predicates (i.e. all predicates encountered during the calculation are
- * assumed true). If a path in the ATN exists from the starting state to the
- * {@link RuleStopState} of the outermost context without matching any
- * symbols, {@link Token#EOF} is added to the returned set.
- *
- * If {@code context} is {@code null}, it is treated as
- * {@link ParserRuleContext#EMPTY}.
- *
- * Note that this does NOT give you the set of all tokens that could
- * appear at a given token position in the input phrase. In other words, it
- * does not answer:
- *
- * "Given a specific partial input phrase, return the set of all
- * tokens that can follow the last token in the input phrase."
- *
- * The big difference is that with just the input, the parser could land
- * right in the middle of a lookahead decision. Getting all
- * possible tokens given a partial input stream is a separate
- * computation. See https://github.com/antlr/antlr4/issues/1428
- *
- * For this function, we are specifying an ATN state and call stack to
- * compute what token(s) can come next and specifically: outside of a
- * lookahead decision. That is what you want for error reporting and
- * recovery upon parse error.
- *
- * @param stateNumber the ATN state number
- * @param context the full parse context
- * @return The set of potentially valid input symbols which could follow the
- * specified state in the specified context.
- * @ if the ATN does not contain a state with
- * number {@code stateNumber}
- */
- getExpectedTokens(stateNumber, context) {
- if (stateNumber < 0 || stateNumber >= this.states.length) {
- throw new RangeError("Invalid state number.");
- }
- let ctx = context;
- let s = this.states[stateNumber];
- let following = this.nextTokens(s);
- if (!following.contains(Token_1.Token.EPSILON)) {
- return following;
- }
- let expected = new IntervalSet_1.IntervalSet();
- expected.addAll(following);
- expected.remove(Token_1.Token.EPSILON);
- while (ctx != null && ctx.invokingState >= 0 && following.contains(Token_1.Token.EPSILON)) {
- let invokingState = this.states[ctx.invokingState];
- let rt = invokingState.transition(0);
- following = this.nextTokens(rt.followState);
- expected.addAll(following);
- expected.remove(Token_1.Token.EPSILON);
- ctx = ctx._parent;
- }
- if (following.contains(Token_1.Token.EPSILON)) {
- expected.add(Token_1.Token.EOF);
- }
- return expected;
- }
-};
-__decorate([
- Decorators_1.NotNull
-], ATN.prototype, "states", void 0);
-__decorate([
- Decorators_1.NotNull
-], ATN.prototype, "decisionToState", void 0);
-__decorate([
- Decorators_1.NotNull
-], ATN.prototype, "modeNameToStartState", void 0);
-__decorate([
- Decorators_1.NotNull
-], ATN.prototype, "modeToStartState", void 0);
-__decorate([
- Decorators_1.NotNull
-], ATN.prototype, "decisionToDFA", void 0);
-__decorate([
- Decorators_1.NotNull
-], ATN.prototype, "modeToDFA", void 0);
-__decorate([
- Decorators_1.NotNull
-], ATN.prototype, "nextTokens", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], ATN.prototype, "removeState", null);
-__decorate([
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.NotNull)
-], ATN.prototype, "defineMode", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], ATN.prototype, "defineDecisionState", null);
-__decorate([
- Decorators_1.NotNull
-], ATN.prototype, "getExpectedTokens", null);
-ATN = __decorate([
- __param(0, Decorators_1.NotNull)
-], ATN);
-exports.ATN = ATN;
-(function (ATN) {
- ATN.INVALID_ALT_NUMBER = 0;
-})(ATN = exports.ATN || (exports.ATN = {}));
-exports.ATN = ATN;
-//# sourceMappingURL=ATN.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATN.js.map b/node_modules/antlr4ts/atn/ATN.js.map
deleted file mode 100644
index 3cc3d9e..0000000
--- a/node_modules/antlr4ts/atn/ATN.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ATN.js","sourceRoot":"","sources":["../../../src/atn/ATN.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,2DAAwD;AAIxD,oCAAiC;AACjC,qDAAkD;AAClD,iDAA8C;AAE9C,+CAA4C;AAC5C,8CAAwC;AACxC,+EAA4E;AAC5E,2DAAwD;AAKxD,oCAAiC;AAGjC,iCAAiC;AAEjC,MAAM;AACN,IAAa,GAAG,GAAhB;IA+DC,4DAA4D;IAC5D,YAAqB,WAAoB,EAAE,YAAoB;QA9DtD,WAAM,GAAe,EAAE,CAAC;QAEjC;;;WAGG;QAEH,oBAAe,GAAoB,EAAE,CAAC;QAatC,yBAAoB,GACnB,IAAI,GAAG,EAA4B,CAAC;QA4BrC,qBAAgB,GAAuB,EAAE,CAAC;QAElC,iBAAY,GACnB,IAAI,+BAAc,CAAuC,mDAAwB,CAAC,QAAQ,CAAC,CAAC;QAG7F,kBAAa,GAAU,EAAE,CAAC;QAE1B,cAAS,GAAU,EAAE,CAAC;QAEtB,aAAQ,GAAwB,IAAI,GAAG,EAAkB,CAAC;QAIzD,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;IAClC,CAAC;IAED,QAAQ;QACP,IAAI,CAAC,aAAa,GAAG,IAAI,KAAK,CAAM,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QACjE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpD,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,IAAI,SAAG,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7D,CAAC;QAED,IAAI,CAAC,SAAS,GAAG,IAAI,KAAK,CAAM,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAC9D,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,SAAG,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC;QAED,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAED,IAAI,gBAAgB;QACnB,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;IAC/B,CAAC;IAED,gBAAgB,CAAC,OAA0B;QAC1C,MAAM,CAAC,qCAAiB,CAAC,gBAAgB,CAAC,OAAO,EAAE,IAAI,CAAC,YAAY,EAAE,IAAI,qCAAiB,CAAC,eAAe,EAAE,CAAC,CAAC;IAChH,CAAC;IAED,gBAAgB;QACf,MAAM,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,KAAK,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAChG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC;IAC3B,CAAC;IAmBD,UAAU,CAAC,CAAW,EAAE,GAAuB;QAC9C,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACT,IAAI,IAAI,GAAgB,IAAI,yBAAW,CAAC,IAAI,CAAC,CAAC;YAC9C,IAAI,IAAI,GAAgB,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC;gBAC3B,MAAM,CAAC,CAAC,CAAC,mBAAmB,CAAC;YAC9B,CAAC;YAED,CAAC,CAAC,mBAAmB,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,qCAAiB,CAAC,WAAW,CAAC,CAAC;YAC1E,CAAC,CAAC,mBAAmB,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACxC,MAAM,CAAC,CAAC,CAAC,mBAAmB,CAAC;QAC9B,CAAC;IACF,CAAC;IAED,QAAQ,CAAC,KAAe;QACvB,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC;QACjB,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QACvC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,WAAW,CAAU,KAAe;QACnC,qDAAqD;QACrD,IAAI,YAAY,GAAG,IAAI,2BAAY,EAAE,CAAC;QACtC,YAAY,CAAC,GAAG,GAAG,IAAI,CAAC;QACxB,YAAY,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;QAC7C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,YAAY,CAAC;IAC/C,CAAC;IAED,UAAU,CAAU,IAAY,EAAW,CAAmB;QAC7D,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACvC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,SAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,mBAAmB,CAAU,CAAgB;QAC5C,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC;QAC7C,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,SAAG,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAChD,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;IACnB,CAAC;IAED,gBAAgB,CAAC,QAAgB;QAChC,EAAE,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;QACvC,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IAClB,CAAC;IAED,IAAI,iBAAiB;QACpB,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC;IACpC,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAmCG;IAEH,iBAAiB,CAAC,WAAmB,EAAE,OAAgC;QACtE,EAAE,CAAC,CAAC,WAAW,GAAG,CAAC,IAAI,WAAW,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YAC1D,MAAM,IAAI,UAAU,CAAC,uBAAuB,CAAC,CAAC;QAC/C,CAAC;QAED,IAAI,GAAG,GAA4B,OAAO,CAAC;QAC3C,IAAI,CAAC,GAAa,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAC3C,IAAI,SAAS,GAAgB,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAChD,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,aAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAED,IAAI,QAAQ,GAAgB,IAAI,yBAAW,EAAE,CAAC;QAC9C,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC3B,QAAQ,CAAC,MAAM,CAAC,aAAK,CAAC,OAAO,CAAC,CAAC;QAC/B,OAAO,GAAG,IAAI,IAAI,IAAI,GAAG,CAAC,aAAa,IAAI,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,aAAK,CAAC,OAAO,CAAC,EAAE,CAAC;YACnF,IAAI,aAAa,GAAa,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;YAC7D,IAAI,EAAE,GAAmB,aAAa,CAAC,UAAU,CAAC,CAAC,CAAmB,CAAC;YACvE,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC;YAC5C,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAC3B,QAAQ,CAAC,MAAM,CAAC,aAAK,CAAC,OAAO,CAAC,CAAC;YAC/B,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC;QACnB,CAAC;QAED,EAAE,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,aAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACvC,QAAQ,CAAC,GAAG,CAAC,aAAK,CAAC,GAAG,CAAC,CAAC;QACzB,CAAC;QAED,MAAM,CAAC,QAAQ,CAAC;IACjB,CAAC;CACD,CAAA;AA1OA;IADC,oBAAO;mCACyB;AAOjC;IADC,oBAAO;4CAC8B;AAatC;IADC,oBAAO;iDAE6B;AA4BrC;IADC,oBAAO;6CACkC;AAM1C;IADC,oBAAO;0CACkB;AAE1B;IADC,oBAAO;sCACc;AAuDtB;IADC,oBAAO;qCAeP;AAQD;IAAa,WAAA,oBAAO,CAAA;sCAMnB;AAED;IAAY,WAAA,oBAAO,CAAA,EAAgB,WAAA,oBAAO,CAAA;qCAKzC;AAED;IAAqB,WAAA,oBAAO,CAAA;8CAK3B;AAkDD;IADC,oBAAO;4CA8BP;AA3OW,GAAG;IAgEF,WAAA,oBAAO,CAAA;GAhER,GAAG,CA4Of;AA5OY,kBAAG;AA8OhB,WAAiB,GAAG;IACN,sBAAkB,GAAW,CAAC,CAAC;AAC7C,CAAC,EAFgB,GAAG,GAAH,WAAG,KAAH,WAAG,QAEnB;AAhPY,kBAAG"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATNConfig.d.ts b/node_modules/antlr4ts/atn/ATNConfig.d.ts
deleted file mode 100644
index 0069b76..0000000
--- a/node_modules/antlr4ts/atn/ATNConfig.d.ts
+++ /dev/null
@@ -1,140 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { Equatable } from '../misc/Stubs';
-import { LexerActionExecutor } from './LexerActionExecutor';
-import { PredictionContext } from './PredictionContext';
-import { PredictionContextCache } from './PredictionContextCache';
-import { Recognizer } from '../Recognizer';
-import { SemanticContext } from './SemanticContext';
-/**
- * Represents a location with context in an ATN. The location is identified by the following values:
- *
- * * The current ATN state
- * * The predicted alternative
- * * The semantic context which must be true for this configuration to be enabled
- * * The syntactic context, which is represented as a graph-structured stack whose path(s) lead to the root of the rule
- * invocations leading to this state
- *
- * In addition to these values, `ATNConfig` stores several properties about paths taken to get to the location which
- * were added over time to help with performance, correctness, and/or debugging.
- *
- * * `reachesIntoOuterContext`:: Used to ensure semantic predicates are not evaluated in the wrong context.
- * * `hasPassedThroughNonGreedyDecision`: Used for enabling first-match-wins instead of longest-match-wins after
- * crossing a non-greedy decision.
- * * `lexerActionExecutor`: Used for tracking the lexer action(s) to execute should this instance be selected during
- * lexing.
- * * `isPrecedenceFilterSuppressed`: A state variable for one of the dynamic disambiguation strategies employed by
- * `ParserATNSimulator.applyPrecedenceFilter`.
- *
- * Due to the use of a graph-structured stack, a single `ATNConfig` is capable of representing many individual ATN
- * configurations which reached the same location in an ATN by following different paths.
- *
- * PERF: To conserve memory, `ATNConfig` is split into several different concrete types. `ATNConfig` itself stores the
- * minimum amount of information typically used to define an `ATNConfig` instance. Various derived types provide
- * additional storage space for cases where a non-default value is used for some of the object properties. The
- * `ATNConfig.create` and `ATNConfig.transform` methods automatically select the smallest concrete type capable of
- * representing the unique information for any given `ATNConfig`.
- */
-export declare class ATNConfig implements Equatable {
- /** The ATN state associated with this configuration */
- private _state;
- /**
- * This is a bit-field currently containing the following values.
- *
- *
- * - 0x00FFFFFF: Alternative
- * - 0x7F000000: Outer context depth
- * - 0x80000000: Suppress precedence filter
- *
- */
- private altAndOuterContextDepth;
- /** The stack of invoking states leading to the rule/states associated
- * with this config. We track only those contexts pushed during
- * execution of the ATN simulator.
- */
- private _context;
- constructor(state: ATNState, alt: number, context: PredictionContext);
- constructor(state: ATNState, c: ATNConfig, context: PredictionContext);
- static create(state: ATNState, alt: number, context: PredictionContext): ATNConfig;
- static create(state: ATNState, alt: number, context: PredictionContext, semanticContext: SemanticContext): ATNConfig;
- static create(state: ATNState, alt: number, context: PredictionContext, semanticContext: SemanticContext, lexerActionExecutor: LexerActionExecutor | undefined): ATNConfig;
- /** Gets the ATN state associated with this configuration */
- readonly state: ATNState;
- /** What alt (or lexer rule) is predicted by this configuration */
- readonly alt: number;
- context: PredictionContext;
- readonly reachesIntoOuterContext: boolean;
- /**
- * We cannot execute predicates dependent upon local context unless
- * we know for sure we are in the correct context. Because there is
- * no way to do this efficiently, we simply cannot evaluate
- * dependent predicates unless we are in the rule that initially
- * invokes the ATN simulator.
- *
- *
- * closure() tracks the depth of how far we dip into the outer context:
- * depth > 0. Note that it may not be totally accurate depth since I
- * don't ever decrement. TODO: make it a boolean then
- */
- outerContextDepth: number;
- readonly lexerActionExecutor: LexerActionExecutor | undefined;
- readonly semanticContext: SemanticContext;
- readonly hasPassedThroughNonGreedyDecision: boolean;
- clone(): ATNConfig;
- transform(state: ATNState, checkNonGreedy: boolean): ATNConfig;
- transform(state: ATNState, checkNonGreedy: boolean, semanticContext: SemanticContext): ATNConfig;
- transform(state: ATNState, checkNonGreedy: boolean, context: PredictionContext): ATNConfig;
- transform(state: ATNState, checkNonGreedy: boolean, lexerActionExecutor: LexerActionExecutor): ATNConfig;
- private transformImpl(state, context, semanticContext, checkNonGreedy, lexerActionExecutor);
- private static checkNonGreedyDecision(source, target);
- appendContext(context: number, contextCache: PredictionContextCache): ATNConfig;
- appendContext(context: PredictionContext, contextCache: PredictionContextCache): ATNConfig;
- /**
- * Determines if this `ATNConfig` fully contains another `ATNConfig`.
- *
- * An ATN configuration represents a position (including context) in an ATN during parsing. Since `ATNConfig` stores
- * the context as a graph, a single `ATNConfig` instance is capable of representing many ATN configurations which
- * are all in the same "location" but have different contexts. These `ATNConfig` instances are again merged when
- * they are added to an `ATNConfigSet`. This method supports `ATNConfigSet.contains` by evaluating whether a
- * particular `ATNConfig` contains all of the ATN configurations represented by another `ATNConfig`.
- *
- * An `ATNConfig` _a_ contains another `ATNConfig` _b_ if all of the following conditions are met:
- *
- * * The configurations are in the same state (`state`)
- * * The configurations predict the same alternative (`alt`)
- * * The semantic context of _a_ implies the semantic context of _b_ (this method performs a weaker equality check)
- * * Joining the prediction contexts of _a_ and _b_ results in the prediction context of _a_
- *
- * This method implements a conservative approximation of containment. As a result, when this method returns `true`
- * it is known that parsing from `subconfig` can only recognize a subset of the inputs which can be recognized
- * starting at the current `ATNConfig`. However, due to the imprecise evaluation of implication for the semantic
- * contexts, no assumptions can be made about the relationship between the configurations when this method returns
- * `false`.
- *
- * @param subconfig The sub configuration.
- * @return `true` if this configuration contains `subconfig`; otherwise, `false`.
- */
- contains(subconfig: ATNConfig): boolean;
- isPrecedenceFilterSuppressed: boolean;
- /** An ATN configuration is equal to another if both have
- * the same state, they predict the same alternative, and
- * syntactic/semantic contexts are the same.
- */
- equals(o: any): boolean;
- hashCode(): number;
- /**
- * Returns a graphical representation of the current `ATNConfig` in Graphviz format. The graph can be stored to a
- * **.dot** file and then rendered to an image using Graphviz.
- *
- * @return A Graphviz graph representing the current `ATNConfig`.
- *
- * @see http://www.graphviz.org/
- */
- toDotString(): string;
- toString(): string;
- toString(recog: Recognizer | undefined, showAlt: boolean): string;
- toString(recog: Recognizer | undefined, showAlt: boolean, showContext: boolean): string;
-}
diff --git a/node_modules/antlr4ts/atn/ATNConfig.js b/node_modules/antlr4ts/atn/ATNConfig.js
deleted file mode 100644
index 204aaa2..0000000
--- a/node_modules/antlr4ts/atn/ATNConfig.js
+++ /dev/null
@@ -1,524 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:25.2796692-07:00
-const Array2DHashMap_1 = require("../misc/Array2DHashMap");
-const DecisionState_1 = require("./DecisionState");
-const MurmurHash_1 = require("../misc/MurmurHash");
-const Decorators_1 = require("../Decorators");
-const ObjectEqualityComparator_1 = require("../misc/ObjectEqualityComparator");
-const PredictionContext_1 = require("./PredictionContext");
-const SemanticContext_1 = require("./SemanticContext");
-const assert = require("assert");
-/**
- * This field stores the bit mask for implementing the
- * {@link #isPrecedenceFilterSuppressed} property as a bit within the
- * existing {@link #altAndOuterContextDepth} field.
- */
-const SUPPRESS_PRECEDENCE_FILTER = 0x80000000;
-/**
- * Represents a location with context in an ATN. The location is identified by the following values:
- *
- * * The current ATN state
- * * The predicted alternative
- * * The semantic context which must be true for this configuration to be enabled
- * * The syntactic context, which is represented as a graph-structured stack whose path(s) lead to the root of the rule
- * invocations leading to this state
- *
- * In addition to these values, `ATNConfig` stores several properties about paths taken to get to the location which
- * were added over time to help with performance, correctness, and/or debugging.
- *
- * * `reachesIntoOuterContext`:: Used to ensure semantic predicates are not evaluated in the wrong context.
- * * `hasPassedThroughNonGreedyDecision`: Used for enabling first-match-wins instead of longest-match-wins after
- * crossing a non-greedy decision.
- * * `lexerActionExecutor`: Used for tracking the lexer action(s) to execute should this instance be selected during
- * lexing.
- * * `isPrecedenceFilterSuppressed`: A state variable for one of the dynamic disambiguation strategies employed by
- * `ParserATNSimulator.applyPrecedenceFilter`.
- *
- * Due to the use of a graph-structured stack, a single `ATNConfig` is capable of representing many individual ATN
- * configurations which reached the same location in an ATN by following different paths.
- *
- * PERF: To conserve memory, `ATNConfig` is split into several different concrete types. `ATNConfig` itself stores the
- * minimum amount of information typically used to define an `ATNConfig` instance. Various derived types provide
- * additional storage space for cases where a non-default value is used for some of the object properties. The
- * `ATNConfig.create` and `ATNConfig.transform` methods automatically select the smallest concrete type capable of
- * representing the unique information for any given `ATNConfig`.
- */
-let ATNConfig = class ATNConfig {
- constructor(state, altOrConfig, context) {
- if (typeof altOrConfig === 'number') {
- assert((altOrConfig & 0xFFFFFF) == altOrConfig);
- this._state = state;
- this.altAndOuterContextDepth = altOrConfig;
- this._context = context;
- }
- else {
- this._state = state;
- this.altAndOuterContextDepth = altOrConfig.altAndOuterContextDepth;
- this._context = context;
- }
- }
- static create(state, alt, context, semanticContext = SemanticContext_1.SemanticContext.NONE, lexerActionExecutor) {
- if (semanticContext != SemanticContext_1.SemanticContext.NONE) {
- if (lexerActionExecutor != null) {
- return new ActionSemanticContextATNConfig(lexerActionExecutor, semanticContext, state, alt, context, false);
- }
- else {
- return new SemanticContextATNConfig(semanticContext, state, alt, context);
- }
- }
- else if (lexerActionExecutor != null) {
- return new ActionATNConfig(lexerActionExecutor, state, alt, context, false);
- }
- else {
- return new ATNConfig(state, alt, context);
- }
- }
- /** Gets the ATN state associated with this configuration */
- get state() {
- return this._state;
- }
- /** What alt (or lexer rule) is predicted by this configuration */
- get alt() {
- return this.altAndOuterContextDepth & 0x00FFFFFF;
- }
- get context() {
- return this._context;
- }
- set context(context) {
- this._context = context;
- }
- get reachesIntoOuterContext() {
- return this.outerContextDepth !== 0;
- }
- /**
- * We cannot execute predicates dependent upon local context unless
- * we know for sure we are in the correct context. Because there is
- * no way to do this efficiently, we simply cannot evaluate
- * dependent predicates unless we are in the rule that initially
- * invokes the ATN simulator.
- *
- *
- * closure() tracks the depth of how far we dip into the outer context:
- * depth > 0. Note that it may not be totally accurate depth since I
- * don't ever decrement. TODO: make it a boolean then
- */
- get outerContextDepth() {
- return (this.altAndOuterContextDepth >>> 24) & 0x7F;
- }
- set outerContextDepth(outerContextDepth) {
- assert(outerContextDepth >= 0);
- // saturate at 0x7F - everything but zero/positive is only used for debug information anyway
- outerContextDepth = Math.min(outerContextDepth, 0x7F);
- this.altAndOuterContextDepth = ((outerContextDepth << 24) | (this.altAndOuterContextDepth & ~0x7F000000) >>> 0);
- }
- get lexerActionExecutor() {
- return undefined;
- }
- get semanticContext() {
- return SemanticContext_1.SemanticContext.NONE;
- }
- get hasPassedThroughNonGreedyDecision() {
- return false;
- }
- clone() {
- return this.transform(this.state, false);
- }
- transform(/*@NotNull*/ state, checkNonGreedy, arg2) {
- if (arg2 == null) {
- return this.transformImpl(state, this._context, this.semanticContext, checkNonGreedy, this.lexerActionExecutor);
- }
- else if (arg2 instanceof PredictionContext_1.PredictionContext) {
- return this.transformImpl(state, arg2, this.semanticContext, checkNonGreedy, this.lexerActionExecutor);
- }
- else if (arg2 instanceof SemanticContext_1.SemanticContext) {
- return this.transformImpl(state, this._context, arg2, checkNonGreedy, this.lexerActionExecutor);
- }
- else {
- return this.transformImpl(state, this._context, this.semanticContext, checkNonGreedy, arg2);
- }
- }
- transformImpl(state, context, semanticContext, checkNonGreedy, lexerActionExecutor) {
- let passedThroughNonGreedy = checkNonGreedy && ATNConfig.checkNonGreedyDecision(this, state);
- if (semanticContext != SemanticContext_1.SemanticContext.NONE) {
- if (lexerActionExecutor != null || passedThroughNonGreedy) {
- return new ActionSemanticContextATNConfig(lexerActionExecutor, semanticContext, state, this, context, passedThroughNonGreedy);
- }
- else {
- return new SemanticContextATNConfig(semanticContext, state, this, context);
- }
- }
- else if (lexerActionExecutor != null || passedThroughNonGreedy) {
- return new ActionATNConfig(lexerActionExecutor, state, this, context, passedThroughNonGreedy);
- }
- else {
- return new ATNConfig(state, this, context);
- }
- }
- static checkNonGreedyDecision(source, target) {
- return source.hasPassedThroughNonGreedyDecision
- || target instanceof DecisionState_1.DecisionState && target.nonGreedy;
- }
- appendContext(context, contextCache) {
- if (typeof context === 'number') {
- let appendedContext = this.context.appendSingleContext(context, contextCache);
- let result = this.transform(this.state, false, appendedContext);
- return result;
- }
- else {
- let appendedContext = this.context.appendContext(context, contextCache);
- let result = this.transform(this.state, false, appendedContext);
- return result;
- }
- }
- /**
- * Determines if this `ATNConfig` fully contains another `ATNConfig`.
- *
- * An ATN configuration represents a position (including context) in an ATN during parsing. Since `ATNConfig` stores
- * the context as a graph, a single `ATNConfig` instance is capable of representing many ATN configurations which
- * are all in the same "location" but have different contexts. These `ATNConfig` instances are again merged when
- * they are added to an `ATNConfigSet`. This method supports `ATNConfigSet.contains` by evaluating whether a
- * particular `ATNConfig` contains all of the ATN configurations represented by another `ATNConfig`.
- *
- * An `ATNConfig` _a_ contains another `ATNConfig` _b_ if all of the following conditions are met:
- *
- * * The configurations are in the same state (`state`)
- * * The configurations predict the same alternative (`alt`)
- * * The semantic context of _a_ implies the semantic context of _b_ (this method performs a weaker equality check)
- * * Joining the prediction contexts of _a_ and _b_ results in the prediction context of _a_
- *
- * This method implements a conservative approximation of containment. As a result, when this method returns `true`
- * it is known that parsing from `subconfig` can only recognize a subset of the inputs which can be recognized
- * starting at the current `ATNConfig`. However, due to the imprecise evaluation of implication for the semantic
- * contexts, no assumptions can be made about the relationship between the configurations when this method returns
- * `false`.
- *
- * @param subconfig The sub configuration.
- * @return `true` if this configuration contains `subconfig`; otherwise, `false`.
- */
- contains(subconfig) {
- if (this.state.stateNumber !== subconfig.state.stateNumber
- || this.alt !== subconfig.alt
- || !this.semanticContext.equals(subconfig.semanticContext)) {
- return false;
- }
- let leftWorkList = [];
- let rightWorkList = [];
- leftWorkList.push(this.context);
- rightWorkList.push(subconfig.context);
- while (true) {
- let left = leftWorkList.pop();
- let right = rightWorkList.pop();
- if (!left || !right) {
- break;
- }
- if (left === right) {
- return true;
- }
- if (left.size < right.size) {
- return false;
- }
- if (right.isEmpty) {
- return left.hasEmpty;
- }
- else {
- for (let i = 0; i < right.size; i++) {
- let index = left.findReturnState(right.getReturnState(i));
- if (index < 0) {
- // assumes invokingStates has no duplicate entries
- return false;
- }
- leftWorkList.push(left.getParent(index));
- rightWorkList.push(right.getParent(i));
- }
- }
- }
- return false;
- }
- get isPrecedenceFilterSuppressed() {
- return (this.altAndOuterContextDepth & SUPPRESS_PRECEDENCE_FILTER) !== 0;
- }
- set isPrecedenceFilterSuppressed(value) {
- if (value) {
- this.altAndOuterContextDepth |= SUPPRESS_PRECEDENCE_FILTER;
- }
- else {
- this.altAndOuterContextDepth &= ~SUPPRESS_PRECEDENCE_FILTER;
- }
- }
- /** An ATN configuration is equal to another if both have
- * the same state, they predict the same alternative, and
- * syntactic/semantic contexts are the same.
- */
- equals(o) {
- if (this === o) {
- return true;
- }
- else if (!(o instanceof ATNConfig)) {
- return false;
- }
- return this.state.stateNumber == o.state.stateNumber
- && this.alt == o.alt
- && this.reachesIntoOuterContext == o.reachesIntoOuterContext
- && this.context.equals(o.context)
- && this.semanticContext.equals(o.semanticContext)
- && this.isPrecedenceFilterSuppressed == o.isPrecedenceFilterSuppressed
- && this.hasPassedThroughNonGreedyDecision == o.hasPassedThroughNonGreedyDecision
- && ObjectEqualityComparator_1.ObjectEqualityComparator.INSTANCE.equals(this.lexerActionExecutor, o.lexerActionExecutor);
- }
- hashCode() {
- let hashCode = MurmurHash_1.MurmurHash.initialize(7);
- hashCode = MurmurHash_1.MurmurHash.update(hashCode, this.state.stateNumber);
- hashCode = MurmurHash_1.MurmurHash.update(hashCode, this.alt);
- hashCode = MurmurHash_1.MurmurHash.update(hashCode, this.reachesIntoOuterContext ? 1 : 0);
- hashCode = MurmurHash_1.MurmurHash.update(hashCode, this.context);
- hashCode = MurmurHash_1.MurmurHash.update(hashCode, this.semanticContext);
- hashCode = MurmurHash_1.MurmurHash.update(hashCode, this.hasPassedThroughNonGreedyDecision ? 1 : 0);
- hashCode = MurmurHash_1.MurmurHash.update(hashCode, this.lexerActionExecutor);
- hashCode = MurmurHash_1.MurmurHash.finish(hashCode, 7);
- return hashCode;
- }
- /**
- * Returns a graphical representation of the current `ATNConfig` in Graphviz format. The graph can be stored to a
- * **.dot** file and then rendered to an image using Graphviz.
- *
- * @return A Graphviz graph representing the current `ATNConfig`.
- *
- * @see http://www.graphviz.org/
- */
- toDotString() {
- let builder = "";
- builder += ("digraph G {\n");
- builder += ("rankdir=LR;\n");
- let visited = new Array2DHashMap_1.Array2DHashMap(PredictionContext_1.PredictionContext.IdentityEqualityComparator.INSTANCE);
- let workList = [];
- function getOrAddContext(context) {
- let newNumber = visited.size;
- let result = visited.putIfAbsent(context, newNumber);
- if (result != null) {
- // Already saw this context
- return result;
- }
- workList.push(context);
- return newNumber;
- }
- workList.push(this.context);
- visited.put(this.context, 0);
- while (true) {
- let current = workList.pop();
- if (!current) {
- break;
- }
- for (let i = 0; i < current.size; i++) {
- builder += (" s") + (getOrAddContext(current));
- builder += ("->");
- builder += ("s") + (getOrAddContext(current.getParent(i)));
- builder += ("[label=\"") + (current.getReturnState(i)) + ("\"];\n");
- }
- }
- builder += ("}\n");
- return builder.toString();
- }
- toString(recog, showAlt, showContext) {
- // Must check showContext before showAlt to preserve original overload behavior
- if (showContext == null) {
- showContext = showAlt != null;
- }
- if (showAlt == null) {
- showAlt = true;
- }
- let buf = "";
- // if (this.state.ruleIndex >= 0) {
- // if (recog != null) {
- // buf += (recog.ruleNames[this.state.ruleIndex] + ":");
- // } else {
- // buf += (this.state.ruleIndex + ":");
- // }
- // }
- let contexts;
- if (showContext) {
- contexts = this.context.toStrings(recog, this.state.stateNumber);
- }
- else {
- contexts = ["?"];
- }
- let first = true;
- for (let contextDesc of contexts) {
- if (first) {
- first = false;
- }
- else {
- buf += (", ");
- }
- buf += ('(');
- buf += (this.state);
- if (showAlt) {
- buf += (",");
- buf += (this.alt);
- }
- if (this.context) {
- buf += (",");
- buf += (contextDesc);
- }
- if (this.semanticContext !== SemanticContext_1.SemanticContext.NONE) {
- buf += (",");
- buf += (this.semanticContext);
- }
- if (this.reachesIntoOuterContext) {
- buf += (",up=") + (this.outerContextDepth);
- }
- buf += (')');
- }
- return buf.toString();
- }
-};
-__decorate([
- Decorators_1.NotNull
-], ATNConfig.prototype, "_state", void 0);
-__decorate([
- Decorators_1.NotNull
-], ATNConfig.prototype, "_context", void 0);
-__decorate([
- Decorators_1.NotNull
-], ATNConfig.prototype, "state", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull)
-], ATNConfig.prototype, "context", null);
-__decorate([
- Decorators_1.NotNull
-], ATNConfig.prototype, "semanticContext", null);
-__decorate([
- Decorators_1.Override
-], ATNConfig.prototype, "clone", null);
-__decorate([
- __param(0, Decorators_1.NotNull), __param(2, Decorators_1.NotNull)
-], ATNConfig.prototype, "transformImpl", null);
-__decorate([
- Decorators_1.Override
-], ATNConfig.prototype, "equals", null);
-__decorate([
- Decorators_1.Override
-], ATNConfig.prototype, "hashCode", null);
-__decorate([
- __param(0, Decorators_1.NotNull), __param(3, Decorators_1.NotNull)
-], ATNConfig, "create", null);
-ATNConfig = __decorate([
- __param(0, Decorators_1.NotNull), __param(2, Decorators_1.NotNull)
-], ATNConfig);
-exports.ATNConfig = ATNConfig;
-/**
- * This class was derived from `ATNConfig` purely as a memory optimization. It allows for the creation of an `ATNConfig`
- * with a non-default semantic context.
- *
- * See the `ATNConfig` documentation for more information about conserving memory through the use of several concrete
- * types.
- */
-let SemanticContextATNConfig = class SemanticContextATNConfig extends ATNConfig {
- constructor(semanticContext, state, altOrConfig, context) {
- if (typeof altOrConfig === 'number') {
- super(state, altOrConfig, context);
- }
- else {
- super(state, altOrConfig, context);
- }
- this._semanticContext = semanticContext;
- }
- get semanticContext() {
- return this._semanticContext;
- }
-};
-__decorate([
- Decorators_1.NotNull
-], SemanticContextATNConfig.prototype, "_semanticContext", void 0);
-__decorate([
- Decorators_1.Override
-], SemanticContextATNConfig.prototype, "semanticContext", null);
-SemanticContextATNConfig = __decorate([
- __param(1, Decorators_1.NotNull), __param(2, Decorators_1.NotNull)
-], SemanticContextATNConfig);
-/**
- * This class was derived from `ATNConfig` purely as a memory optimization. It allows for the creation of an `ATNConfig`
- * with a lexer action.
- *
- * See the `ATNConfig` documentation for more information about conserving memory through the use of several concrete
- * types.
- */
-let ActionATNConfig = class ActionATNConfig extends ATNConfig {
- constructor(lexerActionExecutor, state, altOrConfig, context, passedThroughNonGreedyDecision) {
- if (typeof altOrConfig === 'number') {
- super(state, altOrConfig, context);
- }
- else {
- super(state, altOrConfig, context);
- if (altOrConfig.semanticContext !== SemanticContext_1.SemanticContext.NONE) {
- throw new Error("Not supported");
- }
- }
- this._lexerActionExecutor = lexerActionExecutor;
- this.passedThroughNonGreedyDecision = passedThroughNonGreedyDecision;
- }
- get lexerActionExecutor() {
- return this._lexerActionExecutor;
- }
- get hasPassedThroughNonGreedyDecision() {
- return this.passedThroughNonGreedyDecision;
- }
-};
-__decorate([
- Decorators_1.Override
-], ActionATNConfig.prototype, "lexerActionExecutor", null);
-__decorate([
- Decorators_1.Override
-], ActionATNConfig.prototype, "hasPassedThroughNonGreedyDecision", null);
-ActionATNConfig = __decorate([
- __param(1, Decorators_1.NotNull), __param(2, Decorators_1.NotNull)
-], ActionATNConfig);
-/**
- * This class was derived from `SemanticContextATNConfig` purely as a memory optimization. It allows for the creation of
- * an `ATNConfig` with both a lexer action and a non-default semantic context.
- *
- * See the `ATNConfig` documentation for more information about conserving memory through the use of several concrete
- * types.
- */
-let ActionSemanticContextATNConfig = class ActionSemanticContextATNConfig extends SemanticContextATNConfig {
- constructor(lexerActionExecutor, semanticContext, state, altOrConfig, context, passedThroughNonGreedyDecision) {
- if (typeof altOrConfig === 'number') {
- super(semanticContext, state, altOrConfig, context);
- }
- else {
- super(semanticContext, state, altOrConfig, context);
- }
- this._lexerActionExecutor = lexerActionExecutor;
- this.passedThroughNonGreedyDecision = passedThroughNonGreedyDecision;
- }
- get lexerActionExecutor() {
- return this._lexerActionExecutor;
- }
- get hasPassedThroughNonGreedyDecision() {
- return this.passedThroughNonGreedyDecision;
- }
-};
-__decorate([
- Decorators_1.Override
-], ActionSemanticContextATNConfig.prototype, "lexerActionExecutor", null);
-__decorate([
- Decorators_1.Override
-], ActionSemanticContextATNConfig.prototype, "hasPassedThroughNonGreedyDecision", null);
-ActionSemanticContextATNConfig = __decorate([
- __param(1, Decorators_1.NotNull), __param(2, Decorators_1.NotNull)
-], ActionSemanticContextATNConfig);
-//# sourceMappingURL=ATNConfig.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATNConfig.js.map b/node_modules/antlr4ts/atn/ATNConfig.js.map
deleted file mode 100644
index dada593..0000000
--- a/node_modules/antlr4ts/atn/ATNConfig.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ATNConfig.js","sourceRoot":"","sources":["../../../src/atn/ATNConfig.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,2DAAwD;AAExD,mDAAgD;AAGhD,mDAAgD;AAChD,8CAAkD;AAClD,+EAA4E;AAC5E,2DAAwD;AAGxD,uDAAoD;AAEpD,iCAAiC;AAEjC;;;;GAIG;AACH,MAAM,0BAA0B,GAAW,UAAU,CAAC;AAEtD;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,IAAa,SAAS,GAAtB;IA0BC,YAAqB,KAAe,EAAE,WAA+B,EAAW,OAA0B;QACzG,EAAE,CAAC,CAAC,OAAO,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,CAAC,WAAW,GAAG,QAAQ,CAAC,IAAI,WAAW,CAAC,CAAC;YAChD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;YACpB,IAAI,CAAC,uBAAuB,GAAG,WAAW,CAAC;YAC3C,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACzB,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;YACpB,IAAI,CAAC,uBAAuB,GAAG,WAAW,CAAC,uBAAuB,CAAC;YACnE,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACzB,CAAC;IACF,CAAC;IAQD,MAAM,CAAC,MAAM,CAAU,KAAe,EAAE,GAAW,EAAE,OAA0B,EAAW,kBAAmC,iCAAe,CAAC,IAAI,EAAE,mBAAyC;QAC3L,EAAE,CAAC,CAAC,eAAe,IAAI,iCAAe,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7C,EAAE,CAAC,CAAC,mBAAmB,IAAI,IAAI,CAAC,CAAC,CAAC;gBACjC,MAAM,CAAC,IAAI,8BAA8B,CAAC,mBAAmB,EAAE,eAAe,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;YAC7G,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,MAAM,CAAC,IAAI,wBAAwB,CAAC,eAAe,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;YAC3E,CAAC;QACF,CAAC;QACD,IAAI,CAAC,EAAE,CAAC,CAAC,mBAAmB,IAAI,IAAI,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,IAAI,eAAe,CAAC,mBAAmB,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QAC7E,CAAC;QACD,IAAI,CAAC,CAAC;YACL,MAAM,CAAC,IAAI,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QAC3C,CAAC;IACF,CAAC;IAED,4DAA4D;IAE5D,IAAI,KAAK;QACR,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IAED,kEAAkE;IAClE,IAAI,GAAG;QACN,MAAM,CAAC,IAAI,CAAC,uBAAuB,GAAG,UAAU,CAAC;IAClD,CAAC;IAGD,IAAI,OAAO;QACV,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC;IACtB,CAAC;IAED,IAAI,OAAO,CAAU,OAA0B;QAC9C,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,IAAI,uBAAuB;QAC1B,MAAM,CAAC,IAAI,CAAC,iBAAiB,KAAK,CAAC,CAAC;IACrC,CAAC;IAED;;;;;;;;;;;OAWG;IACH,IAAI,iBAAiB;QACpB,MAAM,CAAC,CAAC,IAAI,CAAC,uBAAuB,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IACrD,CAAC;IAED,IAAI,iBAAiB,CAAC,iBAAyB;QAC9C,MAAM,CAAC,iBAAiB,IAAI,CAAC,CAAC,CAAC;QAC/B,4FAA4F;QAC5F,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QACtD,IAAI,CAAC,uBAAuB,GAAG,CAAC,CAAC,iBAAiB,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,uBAAuB,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC;IACjH,CAAC;IAED,IAAI,mBAAmB;QACtB,MAAM,CAAC,SAAS,CAAC;IAClB,CAAC;IAGD,IAAI,eAAe;QAClB,MAAM,CAAC,iCAAe,CAAC,IAAI,CAAC;IAC7B,CAAC;IAED,IAAI,iCAAiC;QACpC,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAGD,KAAK;QACJ,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC1C,CAAC;IAMD,SAAS,CAAC,YAAY,CAAC,KAAe,EAAE,cAAuB,EAAE,IAAgE;QAChI,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,eAAe,EAAE,cAAc,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;QACjH,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,YAAY,qCAAiB,CAAC,CAAC,CAAC;YAC9C,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,eAAe,EAAE,cAAc,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;QACxG,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,YAAY,iCAAe,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,cAAc,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;QACjG,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,eAAe,EAAE,cAAc,EAAE,IAAI,CAAC,CAAC;QAC7F,CAAC;IACF,CAAC;IAEO,aAAa,CAAU,KAAe,EAAE,OAA0B,EAAW,eAAgC,EAAE,cAAuB,EAAE,mBAAoD;QACnM,IAAI,sBAAsB,GAAY,cAAc,IAAI,SAAS,CAAC,sBAAsB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACtG,EAAE,CAAC,CAAC,eAAe,IAAI,iCAAe,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7C,EAAE,CAAC,CAAC,mBAAmB,IAAI,IAAI,IAAI,sBAAsB,CAAC,CAAC,CAAC;gBAC3D,MAAM,CAAC,IAAI,8BAA8B,CAAC,mBAAmB,EAAE,eAAe,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,sBAAsB,CAAC,CAAC;YAC/H,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,MAAM,CAAC,IAAI,wBAAwB,CAAC,eAAe,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;YAC5E,CAAC;QACF,CAAC;QACD,IAAI,CAAC,EAAE,CAAC,CAAC,mBAAmB,IAAI,IAAI,IAAI,sBAAsB,CAAC,CAAC,CAAC;YAChE,MAAM,CAAC,IAAI,eAAe,CAAC,mBAAmB,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,sBAAsB,CAAC,CAAC;QAC/F,CAAC;QACD,IAAI,CAAC,CAAC;YACL,MAAM,CAAC,IAAI,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAC5C,CAAC;IACF,CAAC;IAEO,MAAM,CAAC,sBAAsB,CAAC,MAAiB,EAAE,MAAgB;QACxE,MAAM,CAAC,MAAM,CAAC,iCAAiC;eAC3C,MAAM,YAAY,6BAAa,IAAI,MAAM,CAAC,SAAS,CAAC;IACzD,CAAC;IAID,aAAa,CAAC,OAAmC,EAAE,YAAoC;QACtF,EAAE,CAAC,CAAC,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC;YACjC,IAAI,eAAe,GAAsB,IAAI,CAAC,OAAO,CAAC,mBAAmB,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;YACjG,IAAI,MAAM,GAAc,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;YAC3E,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,eAAe,GAAsB,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;YAC3F,IAAI,MAAM,GAAc,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;YAC3E,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;IACF,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACH,QAAQ,CAAC,SAAoB;QAC5B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,KAAK,SAAS,CAAC,KAAK,CAAC,WAAW;eACtD,IAAI,CAAC,GAAG,KAAK,SAAS,CAAC,GAAG;eAC1B,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YAC7D,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,IAAI,YAAY,GAAwB,EAAE,CAAC;QAC3C,IAAI,aAAa,GAAwB,EAAE,CAAC;QAC5C,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChC,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACtC,OAAO,IAAI,EAAE,CAAC;YACb,IAAI,IAAI,GAAG,YAAY,CAAC,GAAG,EAAE,CAAC;YAC9B,IAAI,KAAK,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC;YAChC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBACrB,KAAK,CAAC;YACP,CAAC;YAED,EAAE,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC;gBACpB,MAAM,CAAC,IAAI,CAAC;YACb,CAAC;YAED,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC5B,MAAM,CAAC,KAAK,CAAC;YACd,CAAC;YAED,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC;YACtB,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrC,IAAI,KAAK,GAAW,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;oBAClE,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;wBACf,kDAAkD;wBAClD,MAAM,CAAC,KAAK,CAAC;oBACd,CAAC;oBAED,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;oBACzC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxC,CAAC;YACF,CAAC;QACF,CAAC;QAED,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED,IAAI,4BAA4B;QAC/B,MAAM,CAAC,CAAC,IAAI,CAAC,uBAAuB,GAAG,0BAA0B,CAAC,KAAK,CAAC,CAAC;IAC1E,CAAC;IAED,IAAI,4BAA4B,CAAC,KAAc;QAC9C,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,CAAC,uBAAuB,IAAI,0BAA0B,CAAC;QAC5D,CAAC;QACD,IAAI,CAAC,CAAC;YACL,IAAI,CAAC,uBAAuB,IAAI,CAAC,0BAA0B,CAAC;QAC7D,CAAC;IACF,CAAC;IAED;;;OAGM;IAEN,MAAM,CAAC,CAAM;QACZ,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,SAAS,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC,KAAK,CAAC,WAAW;eAChD,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG;eACjB,IAAI,CAAC,uBAAuB,IAAI,CAAC,CAAC,uBAAuB;eACzD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;eAC9B,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC;eAC9C,IAAI,CAAC,4BAA4B,IAAI,CAAC,CAAC,4BAA4B;eACnE,IAAI,CAAC,iCAAiC,IAAI,CAAC,CAAC,iCAAiC;eAC7E,mDAAwB,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,mBAAmB,EAAE,CAAC,CAAC,mBAAmB,CAAC,CAAC;IAC/F,CAAC;IAGD,QAAQ;QACP,IAAI,QAAQ,GAAW,uBAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAChD,QAAQ,GAAG,uBAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAC/D,QAAQ,GAAG,uBAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QACjD,QAAQ,GAAG,uBAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,uBAAuB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7E,QAAQ,GAAG,uBAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACrD,QAAQ,GAAG,uBAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC;QAC7D,QAAQ,GAAG,uBAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,iCAAiC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACvF,QAAQ,GAAG,uBAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;QACjE,QAAQ,GAAG,uBAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,QAAQ,CAAC;IACjB,CAAC;IAED;;;;;;;OAOG;IACH,WAAW;QACV,IAAI,OAAO,GAAG,EAAE,CAAC;QACjB,OAAO,IAAI,CAAC,eAAe,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC,eAAe,CAAC,CAAC;QAE7B,IAAI,OAAO,GAAG,IAAI,+BAAc,CAA4B,qCAAiB,CAAC,0BAA0B,CAAC,QAAQ,CAAC,CAAC;QACnH,IAAI,QAAQ,GAAwB,EAAE,CAAC;QACvC,yBAAyB,OAA0B;YAClD,IAAI,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC;YAC7B,IAAI,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;YACrD,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC;gBACpB,2BAA2B;gBAC3B,MAAM,CAAC,MAAM,CAAC;YACf,CAAC;YAED,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACvB,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAED,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAC7B,OAAO,IAAI,EAAE,CAAC;YACb,IAAI,OAAO,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC;YAC7B,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;gBACd,KAAK,CAAC;YACP,CAAC;YAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC;gBAChD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC;gBAClB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3D,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACrE,CAAC;QACF,CAAC;QAED,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,MAAM,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC;IAKD,QAAQ,CAAC,KAA4B,EAAE,OAAiB,EAAE,WAAqB;QAC9E,+EAA+E;QAC/E,EAAE,CAAC,CAAC,WAAW,IAAI,IAAI,CAAC,CAAC,CAAC;YACzB,WAAW,GAAG,OAAO,IAAI,IAAI,CAAC;QAC/B,CAAC;QAED,EAAE,CAAC,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC;YACrB,OAAO,GAAG,IAAI,CAAC;QAChB,CAAC;QAED,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,mCAAmC;QACnC,wBAAwB;QACxB,0DAA0D;QAC1D,YAAY;QACZ,yCAAyC;QACzC,KAAK;QACL,IAAI;QACJ,IAAI,QAAkB,CAAC;QACvB,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;YACjB,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAClE,CAAC;QACD,IAAI,CAAC,CAAC;YACL,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC;QAED,IAAI,KAAK,GAAY,IAAI,CAAC;QAC1B,GAAG,CAAC,CAAC,IAAI,WAAW,IAAI,QAAQ,CAAC,CAAC,CAAC;YAClC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBACX,KAAK,GAAG,KAAK,CAAC;YACf,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;YACf,CAAC;YAED,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YACb,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;gBACb,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;gBACb,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnB,CAAC;YACD,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;gBAClB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;gBACb,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;YACtB,CAAC;YACD,EAAE,CAAC,CAAC,IAAI,CAAC,eAAe,KAAK,iCAAe,CAAC,IAAI,CAAC,CAAC,CAAC;gBACnD,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;gBACb,GAAG,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YAC/B,CAAC;YACD,EAAE,CAAC,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC;gBAClC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;YAC5C,CAAC;YACD,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACd,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IACvB,CAAC;CACD,CAAA;AAlZA;IADC,oBAAO;yCACiB;AAkBzB;IADC,oBAAO;2CAC4B;AA2CpC;IADC,oBAAO;sCAGP;AAQD;IADC,oBAAO;IAKK,WAAA,oBAAO,CAAA;wCAFnB;AAsCD;IADC,oBAAO;gDAGP;AAOD;IADC,qBAAQ;sCAGR;AAkBD;IAAuB,WAAA,oBAAO,CAAA,EAA+C,WAAA,oBAAO,CAAA;8CAgBnF;AA6GD;IADC,qBAAQ;uCAgBR;AAGD;IADC,qBAAQ;yCAYR;AA5PD;IAAe,WAAA,oBAAO,CAAA,EAA4D,WAAA,oBAAO,CAAA;6BAexF;AA5DW,SAAS;IA0BR,WAAA,oBAAO,CAAA,EAAoD,WAAA,oBAAO,CAAA;GA1BnE,SAAS,CAqZrB;AArZY,8BAAS;AAuZtB;;;;;;GAMG;AACH,IAAM,wBAAwB,GAA9B,8BAA+B,SAAQ,SAAS;IAM/C,YAAY,eAAgC,EAAW,KAAe,EAAW,WAA+B,EAAE,OAA0B;QAC3I,EAAE,CAAC,CAAC,OAAO,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC;YACrC,KAAK,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;QACpC,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,KAAK,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;QACpC,CAAC;QAED,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC;IACzC,CAAC;IAGD,IAAI,eAAe;QAClB,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC;IAC9B,CAAC;CAED,CAAA;AAnBA;IADC,oBAAO;kEACkC;AAe1C;IADC,qBAAQ;+DAGR;AAnBI,wBAAwB;IAMkB,WAAA,oBAAO,CAAA,EAAmB,WAAA,oBAAO,CAAA;GAN3E,wBAAwB,CAqB7B;AAED;;;;;;GAMG;AACH,IAAM,eAAe,GAArB,qBAAsB,SAAQ,SAAS;IAMtC,YAAY,mBAAoD,EAAW,KAAe,EAAW,WAA+B,EAAE,OAA0B,EAAE,8BAAuC;QACxM,EAAE,CAAC,CAAC,OAAO,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC;YACrC,KAAK,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;QACpC,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,KAAK,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;YACnC,EAAE,CAAC,CAAC,WAAW,CAAC,eAAe,KAAK,iCAAe,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC1D,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;YAClC,CAAC;QACF,CAAC;QAED,IAAI,CAAC,oBAAoB,GAAG,mBAAmB,CAAC;QAChD,IAAI,CAAC,8BAA8B,GAAG,8BAA8B,CAAC;IACtE,CAAC;IAGD,IAAI,mBAAmB;QACtB,MAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC;IAClC,CAAC;IAGD,IAAI,iCAAiC;QACpC,MAAM,CAAC,IAAI,CAAC,8BAA8B,CAAC;IAC5C,CAAC;CACD,CAAA;AARA;IADC,qBAAQ;0DAGR;AAGD;IADC,qBAAQ;wEAGR;AA5BI,eAAe;IAM+C,WAAA,oBAAO,CAAA,EAAmB,WAAA,oBAAO,CAAA;GAN/F,eAAe,CA6BpB;AAED;;;;;;GAMG;AACH,IAAM,8BAA8B,GAApC,oCAAqC,SAAQ,wBAAwB;IAMpE,YAAY,mBAAoD,EAAW,eAAgC,EAAW,KAAe,EAAE,WAA+B,EAAE,OAA0B,EAAE,8BAAuC;QAC1O,EAAE,CAAC,CAAC,OAAO,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC;YACrC,KAAK,CAAC,eAAe,EAAE,KAAK,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;QACrD,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,KAAK,CAAC,eAAe,EAAE,KAAK,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;QACrD,CAAC;QAED,IAAI,CAAC,oBAAoB,GAAG,mBAAmB,CAAC;QAChD,IAAI,CAAC,8BAA8B,GAAG,8BAA8B,CAAC;IACtE,CAAC;IAGD,IAAI,mBAAmB;QACtB,MAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC;IAClC,CAAC;IAGD,IAAI,iCAAiC;QACpC,MAAM,CAAC,IAAI,CAAC,8BAA8B,CAAC;IAC5C,CAAC;CACD,CAAA;AARA;IADC,qBAAQ;yEAGR;AAGD;IADC,qBAAQ;uFAGR;AAzBI,8BAA8B;IAMgC,WAAA,oBAAO,CAAA,EAAoC,WAAA,oBAAO,CAAA;GANhH,8BAA8B,CA0BnC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATNConfigSet.d.ts b/node_modules/antlr4ts/atn/ATNConfigSet.d.ts
deleted file mode 100644
index 38454b3..0000000
--- a/node_modules/antlr4ts/atn/ATNConfigSet.d.ts
+++ /dev/null
@@ -1,116 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Array2DHashSet } from '../misc/Array2DHashSet';
-import { ATNConfig } from './ATNConfig';
-import { ATNSimulator } from './ATNSimulator';
-import { ATNState } from './ATNState';
-import { BitSet } from '../misc/BitSet';
-import { Collection, JavaIterator } from '../misc/Stubs';
-import { ConflictInfo } from './ConflictInfo';
-import { JavaSet } from '../misc/Stubs';
-import { PredictionContextCache } from './PredictionContextCache';
-/**
- * Represents a set of ATN configurations (see `ATNConfig`). As configurations are added to the set, they are merged
- * with other `ATNConfig` instances already in the set when possible using the graph-structured stack.
- *
- * An instance of this class represents the complete set of positions (with context) in an ATN which would be associated
- * with a single DFA state. Its internal representation is more complex than traditional state used for NFA to DFA
- * conversion due to performance requirements (both improving speed and reducing memory overhead) as well as supporting
- * features such as semantic predicates and non-greedy operators in a form to support ANTLR's prediction algorithm.
- *
- * @author Sam Harwell
- */
-export declare class ATNConfigSet implements JavaSet {
- /**
- * This maps (state, alt) -> merged {@link ATNConfig}. The key does not account for
- * the {@link ATNConfig#getSemanticContext} of the value, which is only a problem if a single
- * {@code ATNConfigSet} contains two configs with the same state and alternative
- * but different semantic contexts. When this case arises, the first config
- * added to this map stays, and the remaining configs are placed in {@link #unmerged}.
- *
- * This map is only used for optimizing the process of adding configs to the set,
- * and is {@code null} for read-only sets stored in the DFA.
- */
- private mergedConfigs?;
- /**
- * This is an "overflow" list holding configs which cannot be merged with one
- * of the configs in {@link #mergedConfigs} but have a colliding key. This
- * occurs when two configs in the set have the same state and alternative but
- * different semantic contexts.
- *
- * This list is only used for optimizing the process of adding configs to the set,
- * and is {@code null} for read-only sets stored in the DFA.
- */
- private unmerged?;
- /**
- * This is a list of all configs in this set.
- */
- private configs;
- private _uniqueAlt;
- private _conflictInfo?;
- private _hasSemanticContext;
- private _dipsIntoOuterContext;
- /**
- * When {@code true}, this config set represents configurations where the entire
- * outer context has been consumed by the ATN interpreter. This prevents the
- * {@link ParserATNSimulator#closure} from pursuing the global FOLLOW when a
- * rule stop state is reached with an empty prediction context.
- *
- * Note: {@code outermostConfigSet} and {@link #dipsIntoOuterContext} should never
- * be true at the same time.
- */
- private outermostConfigSet;
- private cachedHashCode;
- constructor();
- constructor(set: ATNConfigSet, readonly: boolean);
- /**
- * Get the set of all alternatives represented by configurations in this
- * set.
- */
- getRepresentedAlternatives(): BitSet;
- readonly isReadOnly: boolean;
- isOutermostConfigSet: boolean;
- getStates(): Array2DHashSet;
- optimizeConfigs(interpreter: ATNSimulator): void;
- clone(readonly: boolean): ATNConfigSet;
- readonly size: number;
- readonly isEmpty: boolean;
- contains(o: any): boolean;
- iterator(): JavaIterator;
- toArray(): ATNConfig[];
- toArray(a?: ATNConfig[]): ATNConfig[];
- add(e: ATNConfig): boolean;
- add(e: ATNConfig, contextCache: PredictionContextCache | undefined): boolean;
- private updatePropertiesForMergedConfig(config);
- private updatePropertiesForAddedConfig(config);
- protected canMerge(left: ATNConfig, leftKey: {
- state: number;
- alt: number;
- }, right: ATNConfig): boolean;
- protected getKey(e: ATNConfig): {
- state: number;
- alt: number;
- };
- containsAll(c: Collection): boolean;
- addAll(c: Collection): boolean;
- addAll(c: Collection, contextCache: PredictionContextCache): boolean;
- retainAll(c: Collection): boolean;
- removeAll(c: Collection): boolean;
- clear(): void;
- equals(obj: any): boolean;
- hashCode(): number;
- toString(): string;
- toString(showContext: boolean): string;
- readonly uniqueAlt: number;
- hasSemanticContext: boolean;
- conflictInfo: ConflictInfo | undefined;
- readonly conflictingAlts: BitSet | undefined;
- readonly isExactConflict: boolean;
- readonly dipsIntoOuterContext: boolean;
- get(index: number): ATNConfig;
- remove(o: any): boolean;
- remove(index: number): void;
- protected ensureWritable(): void;
-}
diff --git a/node_modules/antlr4ts/atn/ATNConfigSet.js b/node_modules/antlr4ts/atn/ATNConfigSet.js
deleted file mode 100644
index c7657de..0000000
--- a/node_modules/antlr4ts/atn/ATNConfigSet.js
+++ /dev/null
@@ -1,522 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:25.5488013-07:00
-const Array2DHashMap_1 = require("../misc/Array2DHashMap");
-const Array2DHashSet_1 = require("../misc/Array2DHashSet");
-const ArrayEqualityComparator_1 = require("../misc/ArrayEqualityComparator");
-const ATN_1 = require("./ATN");
-const ATNConfig_1 = require("./ATNConfig");
-const BitSet_1 = require("../misc/BitSet");
-const Stubs_1 = require("../misc/Stubs");
-const Decorators_1 = require("../Decorators");
-const ObjectEqualityComparator_1 = require("../misc/ObjectEqualityComparator");
-const PredictionContext_1 = require("./PredictionContext");
-const PredictionContextCache_1 = require("./PredictionContextCache");
-const SemanticContext_1 = require("./SemanticContext");
-const assert = require("assert");
-const Utils = require("../misc/Utils");
-class KeyTypeEqualityComparer {
- hashCode(key) {
- return key.state ^ key.alt;
- }
- equals(a, b) {
- return a.state === b.state && a.alt === b.alt;
- }
-}
-KeyTypeEqualityComparer.INSTANCE = new KeyTypeEqualityComparer();
-function NewKeyedConfigMap(map) {
- if (map) {
- return new Array2DHashMap_1.Array2DHashMap(map);
- }
- else {
- return new Array2DHashMap_1.Array2DHashMap(KeyTypeEqualityComparer.INSTANCE);
- }
-}
-/**
- * Represents a set of ATN configurations (see `ATNConfig`). As configurations are added to the set, they are merged
- * with other `ATNConfig` instances already in the set when possible using the graph-structured stack.
- *
- * An instance of this class represents the complete set of positions (with context) in an ATN which would be associated
- * with a single DFA state. Its internal representation is more complex than traditional state used for NFA to DFA
- * conversion due to performance requirements (both improving speed and reducing memory overhead) as well as supporting
- * features such as semantic predicates and non-greedy operators in a form to support ANTLR's prediction algorithm.
- *
- * @author Sam Harwell
- */
-class ATNConfigSet {
- constructor(set, readonly) {
- this._uniqueAlt = 0;
- // Used in parser and lexer. In lexer, it indicates we hit a pred
- // while computing a closure operation. Don't make a DFA state from this.
- this._hasSemanticContext = false;
- this._dipsIntoOuterContext = false;
- /**
- * When {@code true}, this config set represents configurations where the entire
- * outer context has been consumed by the ATN interpreter. This prevents the
- * {@link ParserATNSimulator#closure} from pursuing the global FOLLOW when a
- * rule stop state is reached with an empty prediction context.
- *
- * Note: {@code outermostConfigSet} and {@link #dipsIntoOuterContext} should never
- * be true at the same time.
- */
- this.outermostConfigSet = false;
- this.cachedHashCode = -1;
- if (!set) {
- this.mergedConfigs = NewKeyedConfigMap();
- this.unmerged = [];
- this.configs = [];
- this._uniqueAlt = ATN_1.ATN.INVALID_ALT_NUMBER;
- }
- else {
- if (readonly) {
- this.mergedConfigs = undefined;
- this.unmerged = undefined;
- }
- else if (!set.isReadOnly) {
- this.mergedConfigs = NewKeyedConfigMap(set.mergedConfigs);
- this.unmerged = set.unmerged.slice(0);
- }
- else {
- this.mergedConfigs = NewKeyedConfigMap();
- this.unmerged = [];
- }
- this.configs = set.configs.slice(0);
- this._dipsIntoOuterContext = set._dipsIntoOuterContext;
- this._hasSemanticContext = set._hasSemanticContext;
- this.outermostConfigSet = set.outermostConfigSet;
- if (readonly || !set.isReadOnly) {
- this._uniqueAlt = set._uniqueAlt;
- this._conflictInfo = set._conflictInfo;
- }
- // if (!readonly && set.isReadOnly) -> addAll is called from clone()
- }
- }
- /**
- * Get the set of all alternatives represented by configurations in this
- * set.
- */
- getRepresentedAlternatives() {
- if (this._conflictInfo != null) {
- return this._conflictInfo.conflictedAlts.clone();
- }
- let alts = new BitSet_1.BitSet();
- for (let config of Stubs_1.asIterable(this)) {
- alts.set(config.alt);
- }
- return alts;
- }
- get isReadOnly() {
- return this.mergedConfigs == null;
- }
- get isOutermostConfigSet() {
- return this.outermostConfigSet;
- }
- set isOutermostConfigSet(outermostConfigSet) {
- if (this.outermostConfigSet && !outermostConfigSet) {
- throw new Error("IllegalStateException");
- }
- assert(!outermostConfigSet || !this._dipsIntoOuterContext);
- this.outermostConfigSet = outermostConfigSet;
- }
- getStates() {
- let states = new Array2DHashSet_1.Array2DHashSet(ObjectEqualityComparator_1.ObjectEqualityComparator.INSTANCE);
- for (let c of this.configs) {
- states.add(c.state);
- }
- return states;
- }
- optimizeConfigs(interpreter) {
- if (this.configs.length === 0) {
- return;
- }
- for (let i = 0; i < this.configs.length; i++) {
- let config = this.configs[i];
- config.context = interpreter.atn.getCachedContext(config.context);
- }
- }
- clone(readonly) {
- let copy = new ATNConfigSet(this, readonly);
- if (!readonly && this.isReadOnly) {
- copy.addAll(this.configs);
- }
- return copy;
- }
- get size() {
- return this.configs.length;
- }
- get isEmpty() {
- return this.configs.length === 0;
- }
- contains(o) {
- if (!(o instanceof ATNConfig_1.ATNConfig)) {
- return false;
- }
- if (this.mergedConfigs && this.unmerged) {
- let config = o;
- let configKey = this.getKey(config);
- let mergedConfig = this.mergedConfigs.get(configKey);
- if (mergedConfig != null && this.canMerge(config, configKey, mergedConfig)) {
- return mergedConfig.contains(config);
- }
- for (let c of this.unmerged) {
- if (c.contains(o)) {
- return true;
- }
- }
- }
- else {
- for (let c of this.configs) {
- if (c.contains(o)) {
- return true;
- }
- }
- }
- return false;
- }
- iterator() {
- return new ATNConfigSetIterator(this, this.configs);
- }
- toArray(a) {
- if (!a || a.length < this.configs.length) {
- return this.configs;
- }
- for (let i = 0; i < this.configs.length; i++) {
- a[i] = this.configs[i];
- }
- return a;
- }
- add(e, contextCache) {
- this.ensureWritable();
- if (!this.mergedConfigs || !this.unmerged) {
- throw new Error("Covered by ensureWritable but duplicated here for strict null check limitation");
- }
- assert(!this.outermostConfigSet || !e.reachesIntoOuterContext);
- if (contextCache == null) {
- contextCache = PredictionContextCache_1.PredictionContextCache.UNCACHED;
- }
- let addKey;
- let key = this.getKey(e);
- let mergedConfig = this.mergedConfigs.get(key);
- addKey = (mergedConfig == null);
- if (mergedConfig != null && this.canMerge(e, key, mergedConfig)) {
- mergedConfig.outerContextDepth = Math.max(mergedConfig.outerContextDepth, e.outerContextDepth);
- if (e.isPrecedenceFilterSuppressed) {
- mergedConfig.isPrecedenceFilterSuppressed = true;
- }
- let joined = PredictionContext_1.PredictionContext.join(mergedConfig.context, e.context, contextCache);
- this.updatePropertiesForMergedConfig(e);
- if (mergedConfig.context == joined) {
- return false;
- }
- mergedConfig.context = joined;
- return true;
- }
- for (let i = 0; i < this.unmerged.length; i++) {
- let unmergedConfig = this.unmerged[i];
- if (this.canMerge(e, key, unmergedConfig)) {
- unmergedConfig.outerContextDepth = Math.max(unmergedConfig.outerContextDepth, e.outerContextDepth);
- if (e.isPrecedenceFilterSuppressed) {
- unmergedConfig.isPrecedenceFilterSuppressed = true;
- }
- let joined = PredictionContext_1.PredictionContext.join(unmergedConfig.context, e.context, contextCache);
- this.updatePropertiesForMergedConfig(e);
- if (unmergedConfig.context == joined) {
- return false;
- }
- unmergedConfig.context = joined;
- if (addKey) {
- this.mergedConfigs.put(key, unmergedConfig);
- this.unmerged.splice(i, 1);
- }
- return true;
- }
- }
- this.configs.push(e);
- if (addKey) {
- this.mergedConfigs.put(key, e);
- }
- else {
- this.unmerged.push(e);
- }
- this.updatePropertiesForAddedConfig(e);
- return true;
- }
- updatePropertiesForMergedConfig(config) {
- // merged configs can't change the alt or semantic context
- this._dipsIntoOuterContext = this._dipsIntoOuterContext || config.reachesIntoOuterContext;
- assert(!this.outermostConfigSet || !this._dipsIntoOuterContext);
- }
- updatePropertiesForAddedConfig(config) {
- if (this.configs.length === 1) {
- this._uniqueAlt = config.alt;
- }
- else if (this._uniqueAlt !== config.alt) {
- this._uniqueAlt = ATN_1.ATN.INVALID_ALT_NUMBER;
- }
- this._hasSemanticContext = this._hasSemanticContext || !SemanticContext_1.SemanticContext.NONE.equals(config.semanticContext);
- this._dipsIntoOuterContext = this._dipsIntoOuterContext || config.reachesIntoOuterContext;
- assert(!this.outermostConfigSet || !this._dipsIntoOuterContext);
- }
- canMerge(left, leftKey, right) {
- if (left.state.stateNumber != right.state.stateNumber) {
- return false;
- }
- if (leftKey.alt !== right.alt) {
- return false;
- }
- return left.semanticContext.equals(right.semanticContext);
- }
- getKey(e) {
- return { state: e.state.stateNumber, alt: e.alt };
- }
- containsAll(c) {
- for (let o of Stubs_1.asIterable(c)) {
- if (!(o instanceof ATNConfig_1.ATNConfig)) {
- return false;
- }
- if (!this.contains(o)) {
- return false;
- }
- }
- return true;
- }
- addAll(c, contextCache) {
- this.ensureWritable();
- let changed = false;
- for (let group of Stubs_1.asIterable(c)) {
- if (this.add(group, contextCache)) {
- changed = true;
- }
- }
- return changed;
- }
- retainAll(c) {
- this.ensureWritable();
- throw new Error("Not supported yet.");
- }
- removeAll(c) {
- this.ensureWritable();
- throw new Error("Not supported yet.");
- }
- clear() {
- this.ensureWritable();
- if (!this.mergedConfigs || !this.unmerged) {
- throw new Error("Covered by ensureWritable but duplicated here for strict null check limitation");
- }
- this.mergedConfigs.clear();
- this.unmerged.length = 0;
- this.configs.length = 0;
- this._dipsIntoOuterContext = false;
- this._hasSemanticContext = false;
- this._uniqueAlt = ATN_1.ATN.INVALID_ALT_NUMBER;
- this._conflictInfo = undefined;
- }
- equals(obj) {
- if (this === obj) {
- return true;
- }
- if (!(obj instanceof ATNConfigSet)) {
- return false;
- }
- return this.outermostConfigSet == obj.outermostConfigSet
- && Utils.equals(this._conflictInfo, obj._conflictInfo)
- && ArrayEqualityComparator_1.ArrayEqualityComparator.INSTANCE.equals(this.configs, obj.configs);
- }
- hashCode() {
- if (this.isReadOnly && this.cachedHashCode != -1) {
- return this.cachedHashCode;
- }
- let hashCode = 1;
- hashCode = 5 * hashCode ^ (this.outermostConfigSet ? 1 : 0);
- hashCode = 5 * hashCode ^ ArrayEqualityComparator_1.ArrayEqualityComparator.INSTANCE.hashCode(this.configs);
- if (this.isReadOnly) {
- this.cachedHashCode = hashCode;
- }
- return hashCode;
- }
- toString(showContext) {
- if (showContext == null) {
- showContext = false;
- }
- let buf = "";
- let sortedConfigs = this.configs.slice(0);
- sortedConfigs.sort((o1, o2) => {
- if (o1.alt != o2.alt) {
- return o1.alt - o2.alt;
- }
- else if (o1.state.stateNumber != o2.state.stateNumber) {
- return o1.state.stateNumber - o2.state.stateNumber;
- }
- else {
- return o1.semanticContext.toString().localeCompare(o2.semanticContext.toString());
- }
- });
- buf += ("[");
- for (let i = 0; i < sortedConfigs.length; i++) {
- if (i > 0) {
- buf += (", ");
- }
- buf += (sortedConfigs[i].toString(undefined, true, showContext));
- }
- buf += ("]");
- if (this._hasSemanticContext)
- buf += (",hasSemanticContext=") + (this._hasSemanticContext);
- if (this._uniqueAlt !== ATN_1.ATN.INVALID_ALT_NUMBER)
- buf += (",uniqueAlt=") + (this._uniqueAlt);
- if (this._conflictInfo != null) {
- buf += (",conflictingAlts=") + (this._conflictInfo.conflictedAlts);
- if (!this._conflictInfo.isExact) {
- buf += ("*");
- }
- }
- if (this._dipsIntoOuterContext)
- buf += (",dipsIntoOuterContext");
- return buf.toString();
- }
- get uniqueAlt() {
- return this._uniqueAlt;
- }
- get hasSemanticContext() {
- return this._hasSemanticContext;
- }
- set hasSemanticContext(value) {
- this.ensureWritable();
- this._hasSemanticContext = value;
- }
- get conflictInfo() {
- return this._conflictInfo;
- }
- set conflictInfo(conflictInfo) {
- this.ensureWritable();
- this._conflictInfo = conflictInfo;
- }
- get conflictingAlts() {
- if (this._conflictInfo == null) {
- return undefined;
- }
- return this._conflictInfo.conflictedAlts;
- }
- get isExactConflict() {
- if (this._conflictInfo == null) {
- return false;
- }
- return this._conflictInfo.isExact;
- }
- get dipsIntoOuterContext() {
- return this._dipsIntoOuterContext;
- }
- get(index) {
- return this.configs[index];
- }
- remove(indexOrItem) {
- this.ensureWritable();
- if (!this.mergedConfigs || !this.unmerged) {
- throw new Error("Covered by ensureWritable but duplicated here for strict null check limitation");
- }
- if (typeof indexOrItem !== 'number') {
- throw new Error("Not supported yet");
- }
- let index = indexOrItem;
- let config = this.configs[index];
- this.configs.splice(index, 1);
- let key = this.getKey(config);
- if (this.mergedConfigs.get(key) === config) {
- this.mergedConfigs.remove(key);
- }
- else {
- for (let i = 0; i < this.unmerged.length; i++) {
- if (this.unmerged[i] === config) {
- this.unmerged.splice(i, 1);
- return;
- }
- }
- }
- }
- ensureWritable() {
- if (this.isReadOnly) {
- throw new Error("This ATNConfigSet is read only.");
- }
- }
-}
-__decorate([
- Decorators_1.NotNull
-], ATNConfigSet.prototype, "getRepresentedAlternatives", null);
-__decorate([
- Decorators_1.Override
-], ATNConfigSet.prototype, "size", null);
-__decorate([
- Decorators_1.Override
-], ATNConfigSet.prototype, "isEmpty", null);
-__decorate([
- Decorators_1.Override
-], ATNConfigSet.prototype, "contains", null);
-__decorate([
- Decorators_1.Override
-], ATNConfigSet.prototype, "iterator", null);
-__decorate([
- Decorators_1.Override
-], ATNConfigSet.prototype, "toArray", null);
-__decorate([
- Decorators_1.Override
-], ATNConfigSet.prototype, "containsAll", null);
-__decorate([
- Decorators_1.Override
-], ATNConfigSet.prototype, "retainAll", null);
-__decorate([
- Decorators_1.Override
-], ATNConfigSet.prototype, "removeAll", null);
-__decorate([
- Decorators_1.Override
-], ATNConfigSet.prototype, "clear", null);
-__decorate([
- Decorators_1.Override
-], ATNConfigSet.prototype, "equals", null);
-__decorate([
- Decorators_1.Override
-], ATNConfigSet.prototype, "hashCode", null);
-exports.ATNConfigSet = ATNConfigSet;
-class ATNConfigSetIterator {
- constructor(set, configs) {
- this.index = -1;
- this.removed = false;
- this.configs = configs;
- }
- hasNext() {
- return this.index + 1 < this.configs.length;
- }
- next() {
- if (!this.hasNext()) {
- throw new Error("NoSuchElementException");
- }
- this.index++;
- this.removed = false;
- return this.configs[this.index];
- }
- remove() {
- if (this.removed || this.index < 0 || this.index >= this.configs.length) {
- throw new Error("IllegalStateException");
- }
- this.set.remove(this.index);
- this.removed = true;
- }
-}
-__decorate([
- Decorators_1.Override
-], ATNConfigSetIterator.prototype, "hasNext", null);
-__decorate([
- Decorators_1.Override
-], ATNConfigSetIterator.prototype, "next", null);
-__decorate([
- Decorators_1.Override
-], ATNConfigSetIterator.prototype, "remove", null);
-//# sourceMappingURL=ATNConfigSet.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATNConfigSet.js.map b/node_modules/antlr4ts/atn/ATNConfigSet.js.map
deleted file mode 100644
index 1036fbf..0000000
--- a/node_modules/antlr4ts/atn/ATNConfigSet.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ATNConfigSet.js","sourceRoot":"","sources":["../../../src/atn/ATNConfigSet.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAEH,wDAAwD;AAExD,2DAAwD;AACxD,2DAAwD;AACxD,6EAA0E;AAC1E,+BAA4B;AAC5B,2CAAwC;AAGxC,2CAAwC;AACxC,yCAAqE;AAIrE,8CAAkD;AAClD,+EAA4E;AAC5E,2DAAwD;AACxD,qEAAkE;AAClE,uDAAoD;AAEpD,iCAAiC;AACjC,uCAAuC;AAIvC;IACC,QAAQ,CAAC,GAAY;QACpB,MAAM,CAAC,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC;IAC5B,CAAC;IAED,MAAM,CAAC,CAAU,EAAE,CAAU;QAC5B,MAAM,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC;IAC/C,CAAC;;AAEe,gCAAQ,GAAG,IAAI,uBAAuB,EAAE,CAAC;AAG1D,2BAA2B,GAAwC;IAClE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACT,MAAM,CAAC,IAAI,+BAAc,CAAqB,GAAG,CAAC,CAAC;IACpD,CAAC;IAAC,IAAI,CAAC,CAAC;QACP,MAAM,CAAC,IAAI,+BAAc,CAAqB,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IACjF,CAAC;AACF,CAAC;AAED;;;;;;;;;;GAUG;AACH;IAkDC,YAAY,GAAkB,EAAE,QAAkB;QArB1C,eAAU,GAAW,CAAC,CAAC;QAE/B,iEAAiE;QACjE,0EAA0E;QAClE,wBAAmB,GAAY,KAAK,CAAC;QACrC,0BAAqB,GAAY,KAAK,CAAC;QAC/C;;;;;;;;WAQG;QACK,uBAAkB,GAAY,KAAK,CAAC;QAEpC,mBAAc,GAAW,CAAC,CAAC,CAAC;QAKnC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACV,IAAI,CAAC,aAAa,GAAG,iBAAiB,EAAE,CAAC;YACzC,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;YACnB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;YAElB,IAAI,CAAC,UAAU,GAAG,SAAG,CAAC,kBAAkB,CAAC;QAC1C,CAAC;QAAC,IAAI,CAAC,CAAC;YAEP,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACd,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC;gBAC/B,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;YAC3B,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;gBAC5B,IAAI,CAAC,aAAa,GAAG,iBAAiB,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;gBAC1D,IAAI,CAAC,QAAQ,GAAiB,GAAG,CAAC,QAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACtD,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,IAAI,CAAC,aAAa,GAAG,iBAAiB,EAAE,CAAC;gBACzC,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;YACpB,CAAC;YAED,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAEpC,IAAI,CAAC,qBAAqB,GAAG,GAAG,CAAC,qBAAqB,CAAC;YACvD,IAAI,CAAC,mBAAmB,GAAG,GAAG,CAAC,mBAAmB,CAAC;YACnD,IAAI,CAAC,kBAAkB,GAAG,GAAG,CAAC,kBAAkB,CAAC;YAEjD,EAAE,CAAC,CAAC,QAAQ,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;gBACjC,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC,UAAU,CAAC;gBACjC,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC,aAAa,CAAC;YACxC,CAAC;YAED,oEAAoE;QACrE,CAAC;IACF,CAAC;IAED;;;OAGG;IAEH,0BAA0B;QACzB,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;QAClD,CAAC;QAED,IAAI,IAAI,GAAW,IAAI,eAAM,EAAE,CAAC;QAChC,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,kBAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACtB,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAED,IAAI,UAAU;QACb,MAAM,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC;IACnC,CAAC;IAED,IAAI,oBAAoB;QACvB,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAC;IAChC,CAAC;IAED,IAAI,oBAAoB,CAAC,kBAA2B;QACnD,EAAE,CAAC,CAAC,IAAI,CAAC,kBAAkB,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC;YACpD,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAC1C,CAAC;QAED,MAAM,CAAC,CAAC,kBAAkB,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;QAC3D,IAAI,CAAC,kBAAkB,GAAG,kBAAkB,CAAC;IAC9C,CAAC;IAED,SAAS;QACR,IAAI,MAAM,GAAG,IAAI,+BAAc,CAAW,mDAAwB,CAAC,QAAQ,CAAC,CAAC;QAC7E,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAED,eAAe,CAAC,WAAyB;QACxC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC;QACR,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,IAAI,MAAM,GAAc,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACnE,CAAC;IACF,CAAC;IAED,KAAK,CAAC,QAAiB;QACtB,IAAI,IAAI,GAAiB,IAAI,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC1D,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3B,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAGD,IAAI,IAAI;QACP,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC5B,CAAC;IAGD,IAAI,OAAO;QACV,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC;IAClC,CAAC;IAGD,QAAQ,CAAC,CAAM;QACd,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,qBAAS,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YACzC,IAAI,MAAM,GAAc,CAAC,CAAC;YAC1B,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACpC,IAAI,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACrD,EAAE,CAAC,CAAC,YAAY,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;gBAC5E,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACtC,CAAC;YAED,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAC7B,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnB,MAAM,CAAC,IAAI,CAAC;gBACb,CAAC;YACF,CAAC;QACF,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;gBAC5B,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnB,MAAM,CAAC,IAAI,CAAC;gBACb,CAAC;YACF,CAAC;QACF,CAAC;QAED,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,IAAI,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IACrD,CAAC;IAMD,OAAO,CAAC,CAAe;QACtB,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;QACrB,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;QAED,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAID,GAAG,CAAC,CAAY,EAAE,YAAqC;QACtD,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC3C,MAAM,IAAI,KAAK,CAAC,gFAAgF,CAAC,CAAC;QACnG,CAAC;QAED,MAAM,CAAC,CAAC,IAAI,CAAC,kBAAkB,IAAI,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC;QAE/D,EAAE,CAAC,CAAC,YAAY,IAAI,IAAI,CAAC,CAAC,CAAC;YAC1B,YAAY,GAAG,+CAAsB,CAAC,QAAQ,CAAC;QAChD,CAAC;QAED,IAAI,MAAe,CAAC;QACpB,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/C,MAAM,GAAG,CAAC,YAAY,IAAI,IAAI,CAAC,CAAC;QAChC,EAAE,CAAC,CAAC,YAAY,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;YACjE,YAAY,CAAC,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,iBAAiB,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC;YAC/F,EAAE,CAAC,CAAC,CAAC,CAAC,4BAA4B,CAAC,CAAC,CAAC;gBACpC,YAAY,CAAC,4BAA4B,GAAG,IAAI,CAAC;YAClD,CAAC;YAED,IAAI,MAAM,GAAsB,qCAAiB,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;YACtG,IAAI,CAAC,+BAA+B,CAAC,CAAC,CAAC,CAAC;YACxC,EAAE,CAAC,CAAC,YAAY,CAAC,OAAO,IAAI,MAAM,CAAC,CAAC,CAAC;gBACpC,MAAM,CAAC,KAAK,CAAC;YACd,CAAC;YAED,YAAY,CAAC,OAAO,GAAG,MAAM,CAAC;YAC9B,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,IAAI,cAAc,GAAc,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACjD,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;gBAC3C,cAAc,CAAC,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,iBAAiB,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC;gBACnG,EAAE,CAAC,CAAC,CAAC,CAAC,4BAA4B,CAAC,CAAC,CAAC;oBACpC,cAAc,CAAC,4BAA4B,GAAG,IAAI,CAAC;gBACpD,CAAC;gBAED,IAAI,MAAM,GAAsB,qCAAiB,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;gBACxG,IAAI,CAAC,+BAA+B,CAAC,CAAC,CAAC,CAAC;gBACxC,EAAE,CAAC,CAAC,cAAc,CAAC,OAAO,IAAI,MAAM,CAAC,CAAC,CAAC;oBACtC,MAAM,CAAC,KAAK,CAAC;gBACd,CAAC;gBAED,cAAc,CAAC,OAAO,GAAG,MAAM,CAAC;gBAEhC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;oBACZ,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,cAAc,CAAC,CAAC;oBAC5C,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC5B,CAAC;gBAED,MAAM,CAAC,IAAI,CAAC;YACb,CAAC;QACF,CAAC;QAED,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAChC,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QAED,IAAI,CAAC,8BAA8B,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAEO,+BAA+B,CAAC,MAAiB;QACxD,0DAA0D;QAC1D,IAAI,CAAC,qBAAqB,GAAG,IAAI,CAAC,qBAAqB,IAAI,MAAM,CAAC,uBAAuB,CAAC;QAC1F,MAAM,CAAC,CAAC,IAAI,CAAC,kBAAkB,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;IACjE,CAAC;IAEO,8BAA8B,CAAC,MAAiB;QACvD,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC;QAC9B,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,UAAU,GAAG,SAAG,CAAC,kBAAkB,CAAC;QAC1C,CAAC;QAED,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC,mBAAmB,IAAI,CAAC,iCAAe,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;QAC5G,IAAI,CAAC,qBAAqB,GAAG,IAAI,CAAC,qBAAqB,IAAI,MAAM,CAAC,uBAAuB,CAAC;QAC1F,MAAM,CAAC,CAAC,IAAI,CAAC,kBAAkB,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;IACjE,CAAC;IAES,QAAQ,CAAC,IAAe,EAAE,OAAuC,EAAE,KAAgB;QAC5F,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,IAAI,KAAK,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;YACvD,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IAC3D,CAAC;IAES,MAAM,CAAC,CAAY;QAC5B,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;IACnD,CAAC;IAGD,WAAW,CAAC,CAAkB;QAC7B,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,kBAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,qBAAS,CAAC,CAAC,CAAC,CAAC;gBAC/B,MAAM,CAAC,KAAK,CAAC;YACd,CAAC;YAED,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACvB,MAAM,CAAC,KAAK,CAAC;YACd,CAAC;QACF,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAID,MAAM,CAAC,CAAwB,EAAE,YAAqC;QACrE,IAAI,CAAC,cAAc,EAAE,CAAC;QAEtB,IAAI,OAAO,GAAY,KAAK,CAAC;QAC7B,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,kBAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;gBACnC,OAAO,GAAG,IAAI,CAAC;YAChB,CAAC;QACF,CAAC;QAED,MAAM,CAAC,OAAO,CAAC;IAChB,CAAC;IAGD,SAAS,CAAC,CAAkB;QAC3B,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC;IACvC,CAAC;IAGD,SAAS,CAAC,CAAkB;QAC3B,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC;IACvC,CAAC;IAGD,KAAK;QACJ,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC3C,MAAM,IAAI,KAAK,CAAC,gFAAgF,CAAC,CAAC;QACnG,CAAC;QAED,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAExB,IAAI,CAAC,qBAAqB,GAAG,KAAK,CAAC;QACnC,IAAI,CAAC,mBAAmB,GAAG,KAAK,CAAC;QACjC,IAAI,CAAC,UAAU,GAAG,SAAG,CAAC,kBAAkB,CAAC;QACzC,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC;IAChC,CAAC;IAGD,MAAM,CAAC,GAAQ;QACd,EAAE,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,YAAY,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,kBAAkB,IAAI,GAAG,CAAC,kBAAkB;eACpD,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,aAAa,CAAC;eACnD,iDAAuB,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;IACxE,CAAC;IAGD,QAAQ;QACP,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,cAAc,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAClD,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC;QAC5B,CAAC;QAED,IAAI,QAAQ,GAAW,CAAC,CAAC;QACzB,QAAQ,GAAG,CAAC,GAAG,QAAQ,GAAG,CAAC,IAAI,CAAC,kBAAkB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5D,QAAQ,GAAG,CAAC,GAAG,QAAQ,GAAG,iDAAuB,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAElF,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,cAAc,GAAG,QAAQ,CAAC;QAChC,CAAC;QAED,MAAM,CAAC,QAAQ,CAAC;IACjB,CAAC;IAID,QAAQ,CAAC,WAAqB;QAC7B,EAAE,CAAC,CAAC,WAAW,IAAI,IAAI,CAAC,CAAC,CAAC;YACzB,WAAW,GAAG,KAAK,CAAC;QACrB,CAAC;QAED,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,IAAI,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1C,aAAa,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE;YACzB,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBACtB,MAAM,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC;YACxB,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,WAAW,IAAI,EAAE,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;gBACvD,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,WAAW,GAAG,EAAE,CAAC,KAAK,CAAC,WAAW,CAAC;YACpD,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,MAAM,CAAC,EAAE,CAAC,eAAe,CAAC,QAAQ,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC,eAAe,CAAC,QAAQ,EAAE,CAAC,CAAC;YACnF,CAAC;QACF,CAAC,CAAC,CAAC;QAEH,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACX,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;YACf,CAAC;YACD,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC;QAClE,CAAC;QACD,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QAEb,EAAE,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC;YAAC,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;QAC3F,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,KAAK,SAAG,CAAC,kBAAkB,CAAC;YAAC,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC3F,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,CAAC,CAAC;YAChC,GAAG,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,CAAC;YACnE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;gBACjC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YACd,CAAC;QACF,CAAC;QACD,EAAE,CAAC,CAAC,IAAI,CAAC,qBAAqB,CAAC;YAAC,GAAG,IAAI,CAAC,uBAAuB,CAAC,CAAC;QACjE,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IACvB,CAAC;IAED,IAAI,SAAS;QACZ,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC;IACxB,CAAC;IAED,IAAI,kBAAkB;QACrB,MAAM,CAAC,IAAI,CAAC,mBAAmB,CAAC;IACjC,CAAC;IAED,IAAI,kBAAkB,CAAC,KAAc;QACpC,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,IAAI,CAAC,mBAAmB,GAAG,KAAK,CAAC;IAClC,CAAC;IAED,IAAI,YAAY;QACf,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC;IAC3B,CAAC;IAED,IAAI,YAAY,CAAC,YAAsC;QACtD,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;IACnC,CAAC;IAED,IAAI,eAAe;QAClB,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC;IAC1C,CAAC;IAED,IAAI,eAAe;QAClB,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC;IACnC,CAAC;IAED,IAAI,oBAAoB;QACvB,MAAM,CAAC,IAAI,CAAC,qBAAqB,CAAC;IACnC,CAAC;IAED,GAAG,CAAC,KAAa;QAChB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAWD,MAAM,CAAC,WAAyB;QAC/B,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC3C,MAAM,IAAI,KAAK,CAAC,gFAAgF,CAAC,CAAC;QACnG,CAAC;QAED,EAAE,CAAC,CAAC,OAAO,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC;YACrC,MAAM,IAAI,KAAK,CAAC,mBAAmB,CAAC,CAAC;QACtC,CAAC;QAED,IAAI,KAAK,GAAG,WAAW,CAAC;QACxB,IAAI,MAAM,GAAc,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC9B,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC9B,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC;YAC5C,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChC,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/C,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC;oBACjC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC3B,MAAM,CAAC;gBACR,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IAES,cAAc;QACvB,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YACrB,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;QACpD,CAAC;IACF,CAAC;CACD;AA3bA;IADC,oBAAO;8DAYP;AAiDD;IADC,qBAAQ;wCAGR;AAGD;IADC,qBAAQ;2CAGR;AAGD;IADC,qBAAQ;4CA4BR;AAGD;IADC,qBAAQ;4CAGR;AAMD;IADC,qBAAQ;2CAWR;AA2GD;IADC,qBAAQ;+CAaR;AAkBD;IADC,qBAAQ;6CAIR;AAGD;IADC,qBAAQ;6CAIR;AAGD;IADC,qBAAQ;yCAeR;AAGD;IADC,qBAAQ;0CAaR;AAGD;IADC,qBAAQ;4CAeR;AAnZF,oCAqhBC;AAED;IAMC,YAAY,GAAiB,EAAE,OAAoB;QALnD,UAAK,GAAW,CAAC,CAAC,CAAC;QACnB,YAAO,GAAY,KAAK,CAAC;QAKxB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACxB,CAAC;IAGD,OAAO;QACN,MAAM,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7C,CAAC;IAGD,IAAI;QACH,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YACrB,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;QAC3C,CAAC;QAED,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;QACrB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAGD,MAAM;QACL,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;YACzE,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;IACrB,CAAC;CACD;AAxBA;IADC,qBAAQ;mDAGR;AAGD;IADC,qBAAQ;gDASR;AAGD;IADC,qBAAQ;kDAQR"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATNDeserializationOptions.d.ts b/node_modules/antlr4ts/atn/ATNDeserializationOptions.d.ts
deleted file mode 100644
index e0c7b4d..0000000
--- a/node_modules/antlr4ts/atn/ATNDeserializationOptions.d.ts
+++ /dev/null
@@ -1,23 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-/**
- *
- * @author Sam Harwell
- */
-export declare class ATNDeserializationOptions {
- private static _defaultOptions?;
- private readOnly;
- private verifyATN;
- private generateRuleBypassTransitions;
- private optimize;
- constructor(options?: ATNDeserializationOptions);
- static readonly defaultOptions: ATNDeserializationOptions;
- readonly isReadOnly: boolean;
- makeReadOnly(): void;
- isVerifyATN: boolean;
- isGenerateRuleBypassTransitions: boolean;
- isOptimize: boolean;
- protected throwIfReadOnly(): void;
-}
diff --git a/node_modules/antlr4ts/atn/ATNDeserializationOptions.js b/node_modules/antlr4ts/atn/ATNDeserializationOptions.js
deleted file mode 100644
index 429fe15..0000000
--- a/node_modules/antlr4ts/atn/ATNDeserializationOptions.js
+++ /dev/null
@@ -1,77 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:25.8187912-07:00
-const Decorators_1 = require("../Decorators");
-/**
- *
- * @author Sam Harwell
- */
-class ATNDeserializationOptions {
- constructor(options) {
- this.readOnly = false;
- if (options) {
- this.verifyATN = options.verifyATN;
- this.generateRuleBypassTransitions = options.generateRuleBypassTransitions;
- this.optimize = options.optimize;
- }
- else {
- this.verifyATN = true;
- this.generateRuleBypassTransitions = false;
- this.optimize = true;
- }
- }
- static get defaultOptions() {
- if (ATNDeserializationOptions._defaultOptions == null) {
- ATNDeserializationOptions._defaultOptions = new ATNDeserializationOptions();
- ATNDeserializationOptions._defaultOptions.makeReadOnly();
- }
- return ATNDeserializationOptions._defaultOptions;
- }
- get isReadOnly() {
- return this.readOnly;
- }
- makeReadOnly() {
- this.readOnly = true;
- }
- get isVerifyATN() {
- return this.verifyATN;
- }
- set isVerifyATN(verifyATN) {
- this.throwIfReadOnly();
- this.verifyATN = verifyATN;
- }
- get isGenerateRuleBypassTransitions() {
- return this.generateRuleBypassTransitions;
- }
- set isGenerateRuleBypassTransitions(generateRuleBypassTransitions) {
- this.throwIfReadOnly();
- this.generateRuleBypassTransitions = generateRuleBypassTransitions;
- }
- get isOptimize() {
- return this.optimize;
- }
- set isOptimize(optimize) {
- this.throwIfReadOnly();
- this.optimize = optimize;
- }
- throwIfReadOnly() {
- if (this.isReadOnly) {
- throw new Error("The object is read only.");
- }
- }
-}
-__decorate([
- Decorators_1.NotNull
-], ATNDeserializationOptions, "defaultOptions", null);
-exports.ATNDeserializationOptions = ATNDeserializationOptions;
-//# sourceMappingURL=ATNDeserializationOptions.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATNDeserializationOptions.js.map b/node_modules/antlr4ts/atn/ATNDeserializationOptions.js.map
deleted file mode 100644
index 97a22df..0000000
--- a/node_modules/antlr4ts/atn/ATNDeserializationOptions.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ATNDeserializationOptions.js","sourceRoot":"","sources":["../../../src/atn/ATNDeserializationOptions.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAEH,wDAAwD;AAExD,8CAAwC;AAExC;;;GAGG;AACH;IAQC,YAAY,OAAmC;QALvC,aAAQ,GAAY,KAAK,CAAC;QAMjC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;YACnC,IAAI,CAAC,6BAA6B,GAAG,OAAO,CAAC,6BAA6B,CAAC;YAC3E,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;QAClC,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;YACtB,IAAI,CAAC,6BAA6B,GAAG,KAAK,CAAC;YAC3C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACtB,CAAC;IACF,CAAC;IAGD,MAAM,KAAK,cAAc;QACxB,EAAE,CAAC,CAAC,yBAAyB,CAAC,eAAe,IAAI,IAAI,CAAC,CAAC,CAAC;YACvD,yBAAyB,CAAC,eAAe,GAAG,IAAI,yBAAyB,EAAE,CAAC;YAC5E,yBAAyB,CAAC,eAAe,CAAC,YAAY,EAAE,CAAC;QAC1D,CAAC;QAED,MAAM,CAAC,yBAAyB,CAAC,eAAe,CAAC;IAClD,CAAC;IAED,IAAI,UAAU;QACb,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC;IACtB,CAAC;IAED,YAAY;QACX,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;IACtB,CAAC;IAED,IAAI,WAAW;QACd,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;IACvB,CAAC;IAED,IAAI,WAAW,CAAC,SAAkB;QACjC,IAAI,CAAC,eAAe,EAAE,CAAC;QACvB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC5B,CAAC;IAED,IAAI,+BAA+B;QAClC,MAAM,CAAC,IAAI,CAAC,6BAA6B,CAAC;IAC3C,CAAC;IAED,IAAI,+BAA+B,CAAC,6BAAsC;QACzE,IAAI,CAAC,eAAe,EAAE,CAAC;QACvB,IAAI,CAAC,6BAA6B,GAAG,6BAA6B,CAAC;IACpE,CAAC;IAED,IAAI,UAAU;QACb,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC;IACtB,CAAC;IAED,IAAI,UAAU,CAAC,QAAiB;QAC/B,IAAI,CAAC,eAAe,EAAE,CAAC;QACvB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC1B,CAAC;IAES,eAAe;QACxB,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YACrB,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;QAC7C,CAAC;IACF,CAAC;CACD;AAjDA;IADC,oBAAO;qDAQP;AA5BF,8DAsEC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATNDeserializer.d.ts b/node_modules/antlr4ts/atn/ATNDeserializer.d.ts
deleted file mode 100644
index 8f3b270..0000000
--- a/node_modules/antlr4ts/atn/ATNDeserializer.d.ts
+++ /dev/null
@@ -1,85 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATN } from './ATN';
-import { ATNDeserializationOptions } from './ATNDeserializationOptions';
-import { ATNState } from './ATNState';
-import { ATNStateType } from './ATNStateType';
-import { IntervalSet } from '../misc/IntervalSet';
-import { LexerAction } from './LexerAction';
-import { LexerActionType } from './LexerActionType';
-import { Transition } from './Transition';
-import { TransitionType } from './TransitionType';
-import { UUID } from '../misc/UUID';
-/**
- *
- * @author Sam Harwell
- */
-export declare class ATNDeserializer {
- static readonly SERIALIZED_VERSION: number;
- /**
- * This is the earliest supported serialized UUID.
- */
- private static readonly BASE_SERIALIZED_UUID;
- /**
- * This UUID indicates an extension of {@link #ADDED_PRECEDENCE_TRANSITIONS}
- * for the addition of lexer actions encoded as a sequence of
- * {@link LexerAction} instances.
- */
- private static readonly ADDED_LEXER_ACTIONS;
- /**
- * This UUID indicates the serialized ATN contains two sets of
- * IntervalSets, where the second set's values are encoded as
- * 32-bit integers to support the full Unicode SMP range up to U+10FFFF.
- */
- private static readonly ADDED_UNICODE_SMP;
- /**
- * This list contains all of the currently supported UUIDs, ordered by when
- * the feature first appeared in this branch.
- */
- private static readonly SUPPORTED_UUIDS;
- /**
- * This is the current serialized UUID.
- */
- private static readonly SERIALIZED_UUID;
- private readonly deserializationOptions;
- constructor(deserializationOptions?: ATNDeserializationOptions);
- /**
- * Determines if a particular serialized representation of an ATN supports
- * a particular feature, identified by the {@link UUID} used for serializing
- * the ATN at the time the feature was first introduced.
- *
- * @param feature The {@link UUID} marking the first time the feature was
- * supported in the serialized ATN.
- * @param actualUuid The {@link UUID} of the actual serialized ATN which is
- * currently being deserialized.
- * @return {@code true} if the {@code actualUuid} value represents a
- * serialized ATN at or after the feature identified by {@code feature} was
- * introduced; otherwise, {@code false}.
- */
- protected isFeatureSupported(feature: UUID, actualUuid: UUID): boolean;
- deserialize(data: Uint16Array): ATN;
- private readSets(data, p, sets, read32);
- /**
- * Analyze the {@link StarLoopEntryState} states in the specified ATN to set
- * the {@link StarLoopEntryState#precedenceRuleDecision} field to the
- * correct value.
- *
- * @param atn The ATN.
- */
- protected markPrecedenceDecisions(atn: ATN): void;
- protected verifyATN(atn: ATN): void;
- protected checkCondition(condition: boolean, message?: string): void;
- private static inlineSetRules(atn);
- private static combineChainedEpsilons(atn);
- private static optimizeSets(atn, preserveOrder);
- private static identifyTailCalls(atn);
- private static testTailCall(atn, transition, optimizedPath);
- protected static toInt(c: number): number;
- protected static toInt32(data: Uint16Array, offset: number): number;
- protected static toUUID(data: Uint16Array, offset: number): UUID;
- protected edgeFactory(atn: ATN, type: TransitionType, src: number, trg: number, arg1: number, arg2: number, arg3: number, sets: IntervalSet[]): Transition;
- protected stateFactory(type: ATNStateType, ruleIndex: number): ATNState;
- protected lexerActionFactory(type: LexerActionType, data1: number, data2: number): LexerAction;
-}
diff --git a/node_modules/antlr4ts/atn/ATNDeserializer.js b/node_modules/antlr4ts/atn/ATNDeserializer.js
deleted file mode 100644
index 07aefab..0000000
--- a/node_modules/antlr4ts/atn/ATNDeserializer.js
+++ /dev/null
@@ -1,1067 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:25.9683447-07:00
-const ActionTransition_1 = require("./ActionTransition");
-const Array2DHashSet_1 = require("../misc/Array2DHashSet");
-const ATN_1 = require("./ATN");
-const ATNDeserializationOptions_1 = require("./ATNDeserializationOptions");
-const AtomTransition_1 = require("./AtomTransition");
-const BasicBlockStartState_1 = require("./BasicBlockStartState");
-const BasicState_1 = require("./BasicState");
-const BitSet_1 = require("../misc/BitSet");
-const BlockEndState_1 = require("./BlockEndState");
-const BlockStartState_1 = require("./BlockStartState");
-const DecisionState_1 = require("./DecisionState");
-const DFA_1 = require("../dfa/DFA");
-const EpsilonTransition_1 = require("./EpsilonTransition");
-const IntervalSet_1 = require("../misc/IntervalSet");
-const InvalidState_1 = require("./InvalidState");
-const LexerChannelAction_1 = require("./LexerChannelAction");
-const LexerCustomAction_1 = require("./LexerCustomAction");
-const LexerModeAction_1 = require("./LexerModeAction");
-const LexerMoreAction_1 = require("./LexerMoreAction");
-const LexerPopModeAction_1 = require("./LexerPopModeAction");
-const LexerPushModeAction_1 = require("./LexerPushModeAction");
-const LexerSkipAction_1 = require("./LexerSkipAction");
-const LexerTypeAction_1 = require("./LexerTypeAction");
-const LoopEndState_1 = require("./LoopEndState");
-const Decorators_1 = require("../Decorators");
-const NotSetTransition_1 = require("./NotSetTransition");
-const ParserATNSimulator_1 = require("./ParserATNSimulator");
-const PlusBlockStartState_1 = require("./PlusBlockStartState");
-const PlusLoopbackState_1 = require("./PlusLoopbackState");
-const PrecedencePredicateTransition_1 = require("./PrecedencePredicateTransition");
-const PredicateTransition_1 = require("./PredicateTransition");
-const RangeTransition_1 = require("./RangeTransition");
-const RuleStartState_1 = require("./RuleStartState");
-const RuleStopState_1 = require("./RuleStopState");
-const RuleTransition_1 = require("./RuleTransition");
-const SetTransition_1 = require("./SetTransition");
-const StarBlockStartState_1 = require("./StarBlockStartState");
-const StarLoopbackState_1 = require("./StarLoopbackState");
-const StarLoopEntryState_1 = require("./StarLoopEntryState");
-const Token_1 = require("../Token");
-const TokensStartState_1 = require("./TokensStartState");
-const UUID_1 = require("../misc/UUID");
-const WildcardTransition_1 = require("./WildcardTransition");
-/**
- *
- * @author Sam Harwell
- */
-class ATNDeserializer {
- constructor(deserializationOptions) {
- if (deserializationOptions == null) {
- deserializationOptions = ATNDeserializationOptions_1.ATNDeserializationOptions.defaultOptions;
- }
- this.deserializationOptions = deserializationOptions;
- }
- static get SERIALIZED_VERSION() {
- /* This value should never change. Updates following this version are
- * reflected as change in the unique ID SERIALIZED_UUID.
- */
- return 3;
- }
- /**
- * Determines if a particular serialized representation of an ATN supports
- * a particular feature, identified by the {@link UUID} used for serializing
- * the ATN at the time the feature was first introduced.
- *
- * @param feature The {@link UUID} marking the first time the feature was
- * supported in the serialized ATN.
- * @param actualUuid The {@link UUID} of the actual serialized ATN which is
- * currently being deserialized.
- * @return {@code true} if the {@code actualUuid} value represents a
- * serialized ATN at or after the feature identified by {@code feature} was
- * introduced; otherwise, {@code false}.
- */
- isFeatureSupported(feature, actualUuid) {
- let featureIndex = ATNDeserializer.SUPPORTED_UUIDS.findIndex(e => e.equals(feature));
- if (featureIndex < 0) {
- return false;
- }
- return ATNDeserializer.SUPPORTED_UUIDS.findIndex(e => e.equals(actualUuid)) >= featureIndex;
- }
- deserialize(data) {
- data = data.slice(0);
- // Each Uint16 value in data is shifted by +2 at the entry to this method. This is an encoding optimization
- // targeting the serialized values 0 and -1 (serialized to 0xFFFF), each of which are very common in the
- // serialized form of the ATN. In the modified UTF-8 that Java uses for compiled string literals, these two
- // character values have multi-byte forms. By shifting each value by +2, they become characters 2 and 1 prior to
- // writing the string, each of which have single-byte representations. Since the shift occurs in the tool during
- // ATN serialization, each target is responsible for adjusting the values during deserialization.
- //
- // As a special case, note that the first element of data is not adjusted because it contains the major version
- // number of the serialized ATN, which was fixed at 3 at the time the value shifting was implemented.
- for (let i = 1; i < data.length; i++) {
- data[i] = (data[i] - 2) & 0xFFFF;
- }
- let p = 0;
- let version = ATNDeserializer.toInt(data[p++]);
- if (version != ATNDeserializer.SERIALIZED_VERSION) {
- let reason = `Could not deserialize ATN with version ${version} (expected ${ATNDeserializer.SERIALIZED_VERSION}).`;
- throw new Error(reason);
- }
- let uuid = ATNDeserializer.toUUID(data, p);
- p += 8;
- if (ATNDeserializer.SUPPORTED_UUIDS.findIndex(e => e.equals(uuid)) < 0) {
- let reason = `Could not deserialize ATN with UUID ${uuid} (expected ${ATNDeserializer.SERIALIZED_UUID} or a legacy UUID).`;
- throw new Error(reason);
- }
- let supportsLexerActions = this.isFeatureSupported(ATNDeserializer.ADDED_LEXER_ACTIONS, uuid);
- let grammarType = ATNDeserializer.toInt(data[p++]);
- let maxTokenType = ATNDeserializer.toInt(data[p++]);
- let atn = new ATN_1.ATN(grammarType, maxTokenType);
- //
- // STATES
- //
- let loopBackStateNumbers = [];
- let endStateNumbers = [];
- let nstates = ATNDeserializer.toInt(data[p++]);
- for (let i = 0; i < nstates; i++) {
- let stype = ATNDeserializer.toInt(data[p++]);
- // ignore bad type of states
- if (stype === 0 /* INVALID_TYPE */) {
- atn.addState(new InvalidState_1.InvalidState());
- continue;
- }
- let ruleIndex = ATNDeserializer.toInt(data[p++]);
- if (ruleIndex === 0xFFFF) {
- ruleIndex = -1;
- }
- let s = this.stateFactory(stype, ruleIndex);
- if (stype === 12 /* LOOP_END */) {
- let loopBackStateNumber = ATNDeserializer.toInt(data[p++]);
- loopBackStateNumbers.push([s, loopBackStateNumber]);
- }
- else if (s instanceof BlockStartState_1.BlockStartState) {
- let endStateNumber = ATNDeserializer.toInt(data[p++]);
- endStateNumbers.push([s, endStateNumber]);
- }
- atn.addState(s);
- }
- // delay the assignment of loop back and end states until we know all the state instances have been initialized
- for (let pair of loopBackStateNumbers) {
- pair[0].loopBackState = atn.states[pair[1]];
- }
- for (let pair of endStateNumbers) {
- pair[0].endState = atn.states[pair[1]];
- }
- let numNonGreedyStates = ATNDeserializer.toInt(data[p++]);
- for (let i = 0; i < numNonGreedyStates; i++) {
- let stateNumber = ATNDeserializer.toInt(data[p++]);
- atn.states[stateNumber].nonGreedy = true;
- }
- let numSllDecisions = ATNDeserializer.toInt(data[p++]);
- for (let i = 0; i < numSllDecisions; i++) {
- let stateNumber = ATNDeserializer.toInt(data[p++]);
- atn.states[stateNumber].sll = true;
- }
- let numPrecedenceStates = ATNDeserializer.toInt(data[p++]);
- for (let i = 0; i < numPrecedenceStates; i++) {
- let stateNumber = ATNDeserializer.toInt(data[p++]);
- atn.states[stateNumber].isPrecedenceRule = true;
- }
- //
- // RULES
- //
- let nrules = ATNDeserializer.toInt(data[p++]);
- if (atn.grammarType === 0 /* LEXER */) {
- atn.ruleToTokenType = new Int32Array(nrules);
- }
- atn.ruleToStartState = new Array(nrules);
- for (let i = 0; i < nrules; i++) {
- let s = ATNDeserializer.toInt(data[p++]);
- let startState = atn.states[s];
- startState.leftFactored = ATNDeserializer.toInt(data[p++]) != 0;
- atn.ruleToStartState[i] = startState;
- if (atn.grammarType === 0 /* LEXER */) {
- let tokenType = ATNDeserializer.toInt(data[p++]);
- if (tokenType === 0xFFFF) {
- tokenType = Token_1.Token.EOF;
- }
- atn.ruleToTokenType[i] = tokenType;
- if (!this.isFeatureSupported(ATNDeserializer.ADDED_LEXER_ACTIONS, uuid)) {
- // this piece of unused metadata was serialized prior to the
- // addition of LexerAction
- let actionIndexIgnored = ATNDeserializer.toInt(data[p++]);
- if (actionIndexIgnored === 0xFFFF) {
- actionIndexIgnored = -1;
- }
- }
- }
- }
- atn.ruleToStopState = new Array(nrules);
- for (let state of atn.states) {
- if (!(state instanceof RuleStopState_1.RuleStopState)) {
- continue;
- }
- atn.ruleToStopState[state.ruleIndex] = state;
- atn.ruleToStartState[state.ruleIndex].stopState = state;
- }
- //
- // MODES
- //
- let nmodes = ATNDeserializer.toInt(data[p++]);
- for (let i = 0; i < nmodes; i++) {
- let s = ATNDeserializer.toInt(data[p++]);
- atn.modeToStartState.push(atn.states[s]);
- }
- atn.modeToDFA = new Array(nmodes);
- for (let i = 0; i < nmodes; i++) {
- atn.modeToDFA[i] = new DFA_1.DFA(atn.modeToStartState[i]);
- }
- //
- // SETS
- //
- let sets = [];
- p = this.readSets(data, p, sets, false);
- // Next, if the ATN was serialized with the Unicode SMP feature,
- // deserialize sets with 32-bit arguments <= U+10FFFF.
- if (this.isFeatureSupported(ATNDeserializer.ADDED_UNICODE_SMP, uuid)) {
- p = this.readSets(data, p, sets, true);
- }
- //
- // EDGES
- //
- let nedges = ATNDeserializer.toInt(data[p++]);
- for (let i = 0; i < nedges; i++) {
- let src = ATNDeserializer.toInt(data[p]);
- let trg = ATNDeserializer.toInt(data[p + 1]);
- let ttype = ATNDeserializer.toInt(data[p + 2]);
- let arg1 = ATNDeserializer.toInt(data[p + 3]);
- let arg2 = ATNDeserializer.toInt(data[p + 4]);
- let arg3 = ATNDeserializer.toInt(data[p + 5]);
- let trans = this.edgeFactory(atn, ttype, src, trg, arg1, arg2, arg3, sets);
- // console.log(`EDGE ${trans.constructor.name} ${src}->${trg} ${Transition.serializationNames[ttype]} ${arg1},${arg2},${arg3}`);
- let srcState = atn.states[src];
- srcState.addTransition(trans);
- p += 6;
- }
- let returnTransitionsSet = new Array2DHashSet_1.Array2DHashSet({
- hashCode: (o) => o.stopState ^ o.returnState ^ o.outermostPrecedenceReturn,
- equals: function (a, b) {
- return a.stopState === b.stopState
- && a.returnState === b.returnState
- && a.outermostPrecedenceReturn === b.outermostPrecedenceReturn;
- }
- });
- let returnTransitions = [];
- for (let state of atn.states) {
- let returningToLeftFactored = state.ruleIndex >= 0 && atn.ruleToStartState[state.ruleIndex].leftFactored;
- for (let i = 0; i < state.numberOfTransitions; i++) {
- let t = state.transition(i);
- if (!(t instanceof RuleTransition_1.RuleTransition)) {
- continue;
- }
- let ruleTransition = t;
- let returningFromLeftFactored = atn.ruleToStartState[ruleTransition.target.ruleIndex].leftFactored;
- if (!returningFromLeftFactored && returningToLeftFactored) {
- continue;
- }
- let outermostPrecedenceReturn = -1;
- if (atn.ruleToStartState[ruleTransition.target.ruleIndex].isPrecedenceRule) {
- if (ruleTransition.precedence === 0) {
- outermostPrecedenceReturn = ruleTransition.target.ruleIndex;
- }
- }
- let current = { stopState: ruleTransition.target.ruleIndex, returnState: ruleTransition.followState.stateNumber, outermostPrecedenceReturn: outermostPrecedenceReturn };
- if (returnTransitionsSet.add(current)) {
- returnTransitions.push(current);
- }
- }
- }
- // Add all elements from returnTransitions to the ATN
- for (let returnTransition of returnTransitions) {
- let transition = new EpsilonTransition_1.EpsilonTransition(atn.states[returnTransition.returnState], returnTransition.outermostPrecedenceReturn);
- atn.ruleToStopState[returnTransition.stopState].addTransition(transition);
- }
- for (let state of atn.states) {
- if (state instanceof BlockStartState_1.BlockStartState) {
- // we need to know the end state to set its start state
- if (state.endState == null) {
- throw new Error("IllegalStateException");
- }
- // block end states can only be associated to a single block start state
- if (state.endState.startState != null) {
- throw new Error("IllegalStateException");
- }
- state.endState.startState = state;
- }
- if (state instanceof PlusLoopbackState_1.PlusLoopbackState) {
- let loopbackState = state;
- for (let i = 0; i < loopbackState.numberOfTransitions; i++) {
- let target = loopbackState.transition(i).target;
- if (target instanceof PlusBlockStartState_1.PlusBlockStartState) {
- target.loopBackState = loopbackState;
- }
- }
- }
- else if (state instanceof StarLoopbackState_1.StarLoopbackState) {
- let loopbackState = state;
- for (let i = 0; i < loopbackState.numberOfTransitions; i++) {
- let target = loopbackState.transition(i).target;
- if (target instanceof StarLoopEntryState_1.StarLoopEntryState) {
- target.loopBackState = loopbackState;
- }
- }
- }
- }
- //
- // DECISIONS
- //
- let ndecisions = ATNDeserializer.toInt(data[p++]);
- for (let i = 1; i <= ndecisions; i++) {
- let s = ATNDeserializer.toInt(data[p++]);
- let decState = atn.states[s];
- atn.decisionToState.push(decState);
- decState.decision = i - 1;
- }
- //
- // LEXER ACTIONS
- //
- if (atn.grammarType === 0 /* LEXER */) {
- if (supportsLexerActions) {
- atn.lexerActions = new Array(ATNDeserializer.toInt(data[p++]));
- for (let i = 0; i < atn.lexerActions.length; i++) {
- let actionType = ATNDeserializer.toInt(data[p++]);
- let data1 = ATNDeserializer.toInt(data[p++]);
- if (data1 == 0xFFFF) {
- data1 = -1;
- }
- let data2 = ATNDeserializer.toInt(data[p++]);
- if (data2 == 0xFFFF) {
- data2 = -1;
- }
- let lexerAction = this.lexerActionFactory(actionType, data1, data2);
- atn.lexerActions[i] = lexerAction;
- }
- }
- else {
- // for compatibility with older serialized ATNs, convert the old
- // serialized action index for action transitions to the new
- // form, which is the index of a LexerCustomAction
- let legacyLexerActions = [];
- for (let state of atn.states) {
- for (let i = 0; i < state.numberOfTransitions; i++) {
- let transition = state.transition(i);
- if (!(transition instanceof ActionTransition_1.ActionTransition)) {
- continue;
- }
- let ruleIndex = transition.ruleIndex;
- let actionIndex = transition.actionIndex;
- let lexerAction = new LexerCustomAction_1.LexerCustomAction(ruleIndex, actionIndex);
- state.setTransition(i, new ActionTransition_1.ActionTransition(transition.target, ruleIndex, legacyLexerActions.length, false));
- legacyLexerActions.push(lexerAction);
- }
- }
- atn.lexerActions = legacyLexerActions;
- }
- }
- this.markPrecedenceDecisions(atn);
- atn.decisionToDFA = new Array(ndecisions);
- for (let i = 0; i < ndecisions; i++) {
- atn.decisionToDFA[i] = new DFA_1.DFA(atn.decisionToState[i], i);
- }
- if (this.deserializationOptions.isVerifyATN) {
- this.verifyATN(atn);
- }
- if (this.deserializationOptions.isGenerateRuleBypassTransitions && atn.grammarType === 1 /* PARSER */) {
- atn.ruleToTokenType = new Int32Array(atn.ruleToStartState.length);
- for (let i = 0; i < atn.ruleToStartState.length; i++) {
- atn.ruleToTokenType[i] = atn.maxTokenType + i + 1;
- }
- for (let i = 0; i < atn.ruleToStartState.length; i++) {
- let bypassStart = new BasicBlockStartState_1.BasicBlockStartState();
- bypassStart.ruleIndex = i;
- atn.addState(bypassStart);
- let bypassStop = new BlockEndState_1.BlockEndState();
- bypassStop.ruleIndex = i;
- atn.addState(bypassStop);
- bypassStart.endState = bypassStop;
- atn.defineDecisionState(bypassStart);
- bypassStop.startState = bypassStart;
- let endState;
- let excludeTransition;
- if (atn.ruleToStartState[i].isPrecedenceRule) {
- // wrap from the beginning of the rule to the StarLoopEntryState
- endState = undefined;
- for (let state of atn.states) {
- if (state.ruleIndex !== i) {
- continue;
- }
- if (!(state instanceof StarLoopEntryState_1.StarLoopEntryState)) {
- continue;
- }
- let maybeLoopEndState = state.transition(state.numberOfTransitions - 1).target;
- if (!(maybeLoopEndState instanceof LoopEndState_1.LoopEndState)) {
- continue;
- }
- if (maybeLoopEndState.epsilonOnlyTransitions && maybeLoopEndState.transition(0).target instanceof RuleStopState_1.RuleStopState) {
- endState = state;
- break;
- }
- }
- if (!endState) {
- throw new Error("Couldn't identify final state of the precedence rule prefix section.");
- }
- excludeTransition = endState.loopBackState.transition(0);
- }
- else {
- endState = atn.ruleToStopState[i];
- }
- // all non-excluded transitions that currently target end state need to target blockEnd instead
- for (let state of atn.states) {
- for (let i = 0; i < state.numberOfTransitions; i++) {
- let transition = state.transition(i);
- if (transition === excludeTransition) {
- continue;
- }
- if (transition.target === endState) {
- transition.target = bypassStop;
- }
- }
- }
- // all transitions leaving the rule start state need to leave blockStart instead
- while (atn.ruleToStartState[i].numberOfTransitions > 0) {
- let transition = atn.ruleToStartState[i].removeTransition(atn.ruleToStartState[i].numberOfTransitions - 1);
- bypassStart.addTransition(transition);
- }
- // link the new states
- atn.ruleToStartState[i].addTransition(new EpsilonTransition_1.EpsilonTransition(bypassStart));
- bypassStop.addTransition(new EpsilonTransition_1.EpsilonTransition(endState));
- let matchState = new BasicState_1.BasicState();
- atn.addState(matchState);
- matchState.addTransition(new AtomTransition_1.AtomTransition(bypassStop, atn.ruleToTokenType[i]));
- bypassStart.addTransition(new EpsilonTransition_1.EpsilonTransition(matchState));
- }
- if (this.deserializationOptions.isVerifyATN) {
- // reverify after modification
- this.verifyATN(atn);
- }
- }
- if (this.deserializationOptions.isOptimize) {
- while (true) {
- let optimizationCount = 0;
- optimizationCount += ATNDeserializer.inlineSetRules(atn);
- optimizationCount += ATNDeserializer.combineChainedEpsilons(atn);
- let preserveOrder = atn.grammarType === 0 /* LEXER */;
- optimizationCount += ATNDeserializer.optimizeSets(atn, preserveOrder);
- if (optimizationCount === 0) {
- break;
- }
- }
- if (this.deserializationOptions.isVerifyATN) {
- // reverify after modification
- this.verifyATN(atn);
- }
- }
- ATNDeserializer.identifyTailCalls(atn);
- return atn;
- }
- readSets(data, p, sets, read32) {
- let nsets = ATNDeserializer.toInt(data[p++]);
- for (let i = 0; i < nsets; i++) {
- let nintervals = ATNDeserializer.toInt(data[p]);
- p++;
- let set = new IntervalSet_1.IntervalSet();
- sets.push(set);
- let containsEof = ATNDeserializer.toInt(data[p++]) != 0;
- if (containsEof) {
- set.add(-1);
- }
- if (read32) {
- for (let j = 0; j < nintervals; j++) {
- set.add(ATNDeserializer.toInt32(data, p), ATNDeserializer.toInt32(data, p + 2));
- p += 4;
- }
- }
- else {
- for (let j = 0; j < nintervals; j++) {
- set.add(ATNDeserializer.toInt(data[p]), ATNDeserializer.toInt(data[p + 1]));
- p += 2;
- }
- }
- }
- return p;
- }
- /**
- * Analyze the {@link StarLoopEntryState} states in the specified ATN to set
- * the {@link StarLoopEntryState#precedenceRuleDecision} field to the
- * correct value.
- *
- * @param atn The ATN.
- */
- markPrecedenceDecisions(atn) {
- // Map rule index -> precedence decision for that rule
- let rulePrecedenceDecisions = new Map();
- for (let state of atn.states) {
- if (!(state instanceof StarLoopEntryState_1.StarLoopEntryState)) {
- continue;
- }
- /* We analyze the ATN to determine if this ATN decision state is the
- * decision for the closure block that determines whether a
- * precedence rule should continue or complete.
- */
- if (atn.ruleToStartState[state.ruleIndex].isPrecedenceRule) {
- let maybeLoopEndState = state.transition(state.numberOfTransitions - 1).target;
- if (maybeLoopEndState instanceof LoopEndState_1.LoopEndState) {
- if (maybeLoopEndState.epsilonOnlyTransitions && maybeLoopEndState.transition(0).target instanceof RuleStopState_1.RuleStopState) {
- rulePrecedenceDecisions.set(state.ruleIndex, state);
- state.precedenceRuleDecision = true;
- state.precedenceLoopbackStates = new BitSet_1.BitSet(atn.states.length);
- }
- }
- }
- }
- // After marking precedence decisions, we go back through and fill in
- // StarLoopEntryState.precedenceLoopbackStates.
- for (let precedenceDecision of rulePrecedenceDecisions) {
- for (let transition of atn.ruleToStopState[precedenceDecision[0]].getTransitions()) {
- if (transition.serializationType !== 1 /* EPSILON */) {
- continue;
- }
- let epsilonTransition = transition;
- if (epsilonTransition.outermostPrecedenceReturn !== -1) {
- continue;
- }
- precedenceDecision[1].precedenceLoopbackStates.set(transition.target.stateNumber);
- }
- }
- }
- verifyATN(atn) {
- // verify assumptions
- for (let state of atn.states) {
- this.checkCondition(state != null, "ATN states should not be null.");
- if (state.stateType === 0 /* INVALID_TYPE */) {
- continue;
- }
- this.checkCondition(state.onlyHasEpsilonTransitions || state.numberOfTransitions <= 1);
- if (state instanceof PlusBlockStartState_1.PlusBlockStartState) {
- this.checkCondition(state.loopBackState != null);
- }
- if (state instanceof StarLoopEntryState_1.StarLoopEntryState) {
- let starLoopEntryState = state;
- this.checkCondition(starLoopEntryState.loopBackState != null);
- this.checkCondition(starLoopEntryState.numberOfTransitions === 2);
- if (starLoopEntryState.transition(0).target instanceof StarBlockStartState_1.StarBlockStartState) {
- this.checkCondition(starLoopEntryState.transition(1).target instanceof LoopEndState_1.LoopEndState);
- this.checkCondition(!starLoopEntryState.nonGreedy);
- }
- else if (starLoopEntryState.transition(0).target instanceof LoopEndState_1.LoopEndState) {
- this.checkCondition(starLoopEntryState.transition(1).target instanceof StarBlockStartState_1.StarBlockStartState);
- this.checkCondition(starLoopEntryState.nonGreedy);
- }
- else {
- throw new Error("IllegalStateException");
- }
- }
- if (state instanceof StarLoopbackState_1.StarLoopbackState) {
- this.checkCondition(state.numberOfTransitions === 1);
- this.checkCondition(state.transition(0).target instanceof StarLoopEntryState_1.StarLoopEntryState);
- }
- if (state instanceof LoopEndState_1.LoopEndState) {
- this.checkCondition(state.loopBackState != null);
- }
- if (state instanceof RuleStartState_1.RuleStartState) {
- this.checkCondition(state.stopState != null);
- }
- if (state instanceof BlockStartState_1.BlockStartState) {
- this.checkCondition(state.endState != null);
- }
- if (state instanceof BlockEndState_1.BlockEndState) {
- this.checkCondition(state.startState != null);
- }
- if (state instanceof DecisionState_1.DecisionState) {
- let decisionState = state;
- this.checkCondition(decisionState.numberOfTransitions <= 1 || decisionState.decision >= 0);
- }
- else {
- this.checkCondition(state.numberOfTransitions <= 1 || state instanceof RuleStopState_1.RuleStopState);
- }
- }
- }
- checkCondition(condition, message) {
- if (!condition) {
- throw new Error("IllegalStateException: " + message);
- }
- }
- static inlineSetRules(atn) {
- let inlinedCalls = 0;
- let ruleToInlineTransition = new Array(atn.ruleToStartState.length);
- for (let i = 0; i < atn.ruleToStartState.length; i++) {
- let startState = atn.ruleToStartState[i];
- let middleState = startState;
- while (middleState.onlyHasEpsilonTransitions
- && middleState.numberOfOptimizedTransitions === 1
- && middleState.getOptimizedTransition(0).serializationType === 1 /* EPSILON */) {
- middleState = middleState.getOptimizedTransition(0).target;
- }
- if (middleState.numberOfOptimizedTransitions !== 1) {
- continue;
- }
- let matchTransition = middleState.getOptimizedTransition(0);
- let matchTarget = matchTransition.target;
- if (matchTransition.isEpsilon
- || !matchTarget.onlyHasEpsilonTransitions
- || matchTarget.numberOfOptimizedTransitions !== 1
- || !(matchTarget.getOptimizedTransition(0).target instanceof RuleStopState_1.RuleStopState)) {
- continue;
- }
- switch (matchTransition.serializationType) {
- case 5 /* ATOM */:
- case 2 /* RANGE */:
- case 7 /* SET */:
- ruleToInlineTransition[i] = matchTransition;
- break;
- case 8 /* NOT_SET */:
- case 9 /* WILDCARD */:
- // not implemented yet
- continue;
- default:
- continue;
- }
- }
- for (let stateNumber = 0; stateNumber < atn.states.length; stateNumber++) {
- let state = atn.states[stateNumber];
- if (state.ruleIndex < 0) {
- continue;
- }
- let optimizedTransitions;
- for (let i = 0; i < state.numberOfOptimizedTransitions; i++) {
- let transition = state.getOptimizedTransition(i);
- if (!(transition instanceof RuleTransition_1.RuleTransition)) {
- if (optimizedTransitions != null) {
- optimizedTransitions.push(transition);
- }
- continue;
- }
- let ruleTransition = transition;
- let effective = ruleToInlineTransition[ruleTransition.target.ruleIndex];
- if (effective == null) {
- if (optimizedTransitions != null) {
- optimizedTransitions.push(transition);
- }
- continue;
- }
- if (optimizedTransitions == null) {
- optimizedTransitions = [];
- for (let j = 0; j < i; j++) {
- optimizedTransitions.push(state.getOptimizedTransition(i));
- }
- }
- inlinedCalls++;
- let target = ruleTransition.followState;
- let intermediateState = new BasicState_1.BasicState();
- intermediateState.setRuleIndex(target.ruleIndex);
- atn.addState(intermediateState);
- optimizedTransitions.push(new EpsilonTransition_1.EpsilonTransition(intermediateState));
- switch (effective.serializationType) {
- case 5 /* ATOM */:
- intermediateState.addTransition(new AtomTransition_1.AtomTransition(target, effective._label));
- break;
- case 2 /* RANGE */:
- intermediateState.addTransition(new RangeTransition_1.RangeTransition(target, effective.from, effective.to));
- break;
- case 7 /* SET */:
- intermediateState.addTransition(new SetTransition_1.SetTransition(target, effective.label));
- break;
- default:
- throw new Error("UnsupportedOperationException");
- }
- }
- if (optimizedTransitions != null) {
- if (state.isOptimized) {
- while (state.numberOfOptimizedTransitions > 0) {
- state.removeOptimizedTransition(state.numberOfOptimizedTransitions - 1);
- }
- }
- for (let transition of optimizedTransitions) {
- state.addOptimizedTransition(transition);
- }
- }
- }
- if (ParserATNSimulator_1.ParserATNSimulator.debug) {
- console.log("ATN runtime optimizer removed " + inlinedCalls + " rule invocations by inlining sets.");
- }
- return inlinedCalls;
- }
- static combineChainedEpsilons(atn) {
- let removedEdges = 0;
- for (let state of atn.states) {
- if (!state.onlyHasEpsilonTransitions || state instanceof RuleStopState_1.RuleStopState) {
- continue;
- }
- let optimizedTransitions;
- nextTransition: for (let i = 0; i < state.numberOfOptimizedTransitions; i++) {
- let transition = state.getOptimizedTransition(i);
- let intermediate = transition.target;
- if (transition.serializationType !== 1 /* EPSILON */
- || transition.outermostPrecedenceReturn !== -1
- || intermediate.stateType !== 1 /* BASIC */
- || !intermediate.onlyHasEpsilonTransitions) {
- if (optimizedTransitions != null) {
- optimizedTransitions.push(transition);
- }
- continue nextTransition;
- }
- for (let j = 0; j < intermediate.numberOfOptimizedTransitions; j++) {
- if (intermediate.getOptimizedTransition(j).serializationType !== 1 /* EPSILON */
- || intermediate.getOptimizedTransition(j).outermostPrecedenceReturn !== -1) {
- if (optimizedTransitions != null) {
- optimizedTransitions.push(transition);
- }
- continue nextTransition;
- }
- }
- removedEdges++;
- if (optimizedTransitions == null) {
- optimizedTransitions = [];
- for (let j = 0; j < i; j++) {
- optimizedTransitions.push(state.getOptimizedTransition(j));
- }
- }
- for (let j = 0; j < intermediate.numberOfOptimizedTransitions; j++) {
- let target = intermediate.getOptimizedTransition(j).target;
- optimizedTransitions.push(new EpsilonTransition_1.EpsilonTransition(target));
- }
- }
- if (optimizedTransitions != null) {
- if (state.isOptimized) {
- while (state.numberOfOptimizedTransitions > 0) {
- state.removeOptimizedTransition(state.numberOfOptimizedTransitions - 1);
- }
- }
- for (let transition of optimizedTransitions) {
- state.addOptimizedTransition(transition);
- }
- }
- }
- if (ParserATNSimulator_1.ParserATNSimulator.debug) {
- console.log("ATN runtime optimizer removed " + removedEdges + " transitions by combining chained epsilon transitions.");
- }
- return removedEdges;
- }
- static optimizeSets(atn, preserveOrder) {
- if (preserveOrder) {
- // this optimization currently doesn't preserve edge order.
- return 0;
- }
- let removedPaths = 0;
- let decisions = atn.decisionToState;
- for (let decision of decisions) {
- let setTransitions = new IntervalSet_1.IntervalSet();
- for (let i = 0; i < decision.numberOfOptimizedTransitions; i++) {
- let epsTransition = decision.getOptimizedTransition(i);
- if (!(epsTransition instanceof EpsilonTransition_1.EpsilonTransition)) {
- continue;
- }
- if (epsTransition.target.numberOfOptimizedTransitions !== 1) {
- continue;
- }
- let transition = epsTransition.target.getOptimizedTransition(0);
- if (!(transition.target instanceof BlockEndState_1.BlockEndState)) {
- continue;
- }
- if (transition instanceof NotSetTransition_1.NotSetTransition) {
- // TODO: not yet implemented
- continue;
- }
- if (transition instanceof AtomTransition_1.AtomTransition
- || transition instanceof RangeTransition_1.RangeTransition
- || transition instanceof SetTransition_1.SetTransition) {
- setTransitions.add(i);
- }
- }
- if (setTransitions.size <= 1) {
- continue;
- }
- let optimizedTransitions = [];
- for (let i = 0; i < decision.numberOfOptimizedTransitions; i++) {
- if (!setTransitions.contains(i)) {
- optimizedTransitions.push(decision.getOptimizedTransition(i));
- }
- }
- let blockEndState = decision.getOptimizedTransition(setTransitions.minElement).target.getOptimizedTransition(0).target;
- let matchSet = new IntervalSet_1.IntervalSet();
- for (let i = 0; i < setTransitions.intervals.length; i++) {
- let interval = setTransitions.intervals[i];
- for (let j = interval.a; j <= interval.b; j++) {
- let matchTransition = decision.getOptimizedTransition(j).target.getOptimizedTransition(0);
- if (matchTransition instanceof NotSetTransition_1.NotSetTransition) {
- throw new Error("Not yet implemented.");
- }
- else {
- matchSet.addAll(matchTransition.label);
- }
- }
- }
- let newTransition;
- if (matchSet.intervals.length === 1) {
- if (matchSet.size === 1) {
- newTransition = new AtomTransition_1.AtomTransition(blockEndState, matchSet.minElement);
- }
- else {
- let matchInterval = matchSet.intervals[0];
- newTransition = new RangeTransition_1.RangeTransition(blockEndState, matchInterval.a, matchInterval.b);
- }
- }
- else {
- newTransition = new SetTransition_1.SetTransition(blockEndState, matchSet);
- }
- let setOptimizedState = new BasicState_1.BasicState();
- setOptimizedState.setRuleIndex(decision.ruleIndex);
- atn.addState(setOptimizedState);
- setOptimizedState.addTransition(newTransition);
- optimizedTransitions.push(new EpsilonTransition_1.EpsilonTransition(setOptimizedState));
- removedPaths += decision.numberOfOptimizedTransitions - optimizedTransitions.length;
- if (decision.isOptimized) {
- while (decision.numberOfOptimizedTransitions > 0) {
- decision.removeOptimizedTransition(decision.numberOfOptimizedTransitions - 1);
- }
- }
- for (let transition of optimizedTransitions) {
- decision.addOptimizedTransition(transition);
- }
- }
- if (ParserATNSimulator_1.ParserATNSimulator.debug) {
- console.log("ATN runtime optimizer removed " + removedPaths + " paths by collapsing sets.");
- }
- return removedPaths;
- }
- static identifyTailCalls(atn) {
- for (let state of atn.states) {
- for (let i = 0; i < state.numberOfTransitions; i++) {
- let transition = state.transition(i);
- if (!(transition instanceof RuleTransition_1.RuleTransition)) {
- continue;
- }
- transition.tailCall = this.testTailCall(atn, transition, false);
- transition.optimizedTailCall = this.testTailCall(atn, transition, true);
- }
- if (!state.isOptimized) {
- continue;
- }
- for (let i = 0; i < state.numberOfOptimizedTransitions; i++) {
- let transition = state.getOptimizedTransition(i);
- if (!(transition instanceof RuleTransition_1.RuleTransition)) {
- continue;
- }
- transition.tailCall = this.testTailCall(atn, transition, false);
- transition.optimizedTailCall = this.testTailCall(atn, transition, true);
- }
- }
- }
- static testTailCall(atn, transition, optimizedPath) {
- if (!optimizedPath && transition.tailCall) {
- return true;
- }
- if (optimizedPath && transition.optimizedTailCall) {
- return true;
- }
- let reachable = new BitSet_1.BitSet(atn.states.length);
- let worklist = [];
- worklist.push(transition.followState);
- while (true) {
- let state = worklist.pop();
- if (!state) {
- break;
- }
- if (reachable.get(state.stateNumber)) {
- continue;
- }
- if (state instanceof RuleStopState_1.RuleStopState) {
- continue;
- }
- if (!state.onlyHasEpsilonTransitions) {
- return false;
- }
- let transitionCount = optimizedPath ? state.numberOfOptimizedTransitions : state.numberOfTransitions;
- for (let i = 0; i < transitionCount; i++) {
- let t = optimizedPath ? state.getOptimizedTransition(i) : state.transition(i);
- if (t.serializationType !== 1 /* EPSILON */) {
- return false;
- }
- worklist.push(t.target);
- }
- }
- return true;
- }
- static toInt(c) {
- return c;
- }
- static toInt32(data, offset) {
- return (data[offset] | (data[offset + 1] << 16)) >>> 0;
- }
- static toUUID(data, offset) {
- let leastSigBits = ATNDeserializer.toInt32(data, offset);
- let lessSigBits = ATNDeserializer.toInt32(data, offset + 2);
- let moreSigBits = ATNDeserializer.toInt32(data, offset + 4);
- let mostSigBits = ATNDeserializer.toInt32(data, offset + 6);
- return new UUID_1.UUID(mostSigBits, moreSigBits, lessSigBits, leastSigBits);
- }
- edgeFactory(atn, type, src, trg, arg1, arg2, arg3, sets) {
- let target = atn.states[trg];
- switch (type) {
- case 1 /* EPSILON */: return new EpsilonTransition_1.EpsilonTransition(target);
- case 2 /* RANGE */:
- if (arg3 !== 0) {
- return new RangeTransition_1.RangeTransition(target, Token_1.Token.EOF, arg2);
- }
- else {
- return new RangeTransition_1.RangeTransition(target, arg1, arg2);
- }
- case 3 /* RULE */:
- let rt = new RuleTransition_1.RuleTransition(atn.states[arg1], arg2, arg3, target);
- return rt;
- case 4 /* PREDICATE */:
- let pt = new PredicateTransition_1.PredicateTransition(target, arg1, arg2, arg3 !== 0);
- return pt;
- case 10 /* PRECEDENCE */:
- return new PrecedencePredicateTransition_1.PrecedencePredicateTransition(target, arg1);
- case 5 /* ATOM */:
- if (arg3 !== 0) {
- return new AtomTransition_1.AtomTransition(target, Token_1.Token.EOF);
- }
- else {
- return new AtomTransition_1.AtomTransition(target, arg1);
- }
- case 6 /* ACTION */:
- let a = new ActionTransition_1.ActionTransition(target, arg1, arg2, arg3 !== 0);
- return a;
- case 7 /* SET */: return new SetTransition_1.SetTransition(target, sets[arg1]);
- case 8 /* NOT_SET */: return new NotSetTransition_1.NotSetTransition(target, sets[arg1]);
- case 9 /* WILDCARD */: return new WildcardTransition_1.WildcardTransition(target);
- }
- throw new Error("The specified transition type is not valid.");
- }
- stateFactory(type, ruleIndex) {
- let s;
- switch (type) {
- case 0 /* INVALID_TYPE */: return new InvalidState_1.InvalidState();
- case 1 /* BASIC */:
- s = new BasicState_1.BasicState();
- break;
- case 2 /* RULE_START */:
- s = new RuleStartState_1.RuleStartState();
- break;
- case 3 /* BLOCK_START */:
- s = new BasicBlockStartState_1.BasicBlockStartState();
- break;
- case 4 /* PLUS_BLOCK_START */:
- s = new PlusBlockStartState_1.PlusBlockStartState();
- break;
- case 5 /* STAR_BLOCK_START */:
- s = new StarBlockStartState_1.StarBlockStartState();
- break;
- case 6 /* TOKEN_START */:
- s = new TokensStartState_1.TokensStartState();
- break;
- case 7 /* RULE_STOP */:
- s = new RuleStopState_1.RuleStopState();
- break;
- case 8 /* BLOCK_END */:
- s = new BlockEndState_1.BlockEndState();
- break;
- case 9 /* STAR_LOOP_BACK */:
- s = new StarLoopbackState_1.StarLoopbackState();
- break;
- case 10 /* STAR_LOOP_ENTRY */:
- s = new StarLoopEntryState_1.StarLoopEntryState();
- break;
- case 11 /* PLUS_LOOP_BACK */:
- s = new PlusLoopbackState_1.PlusLoopbackState();
- break;
- case 12 /* LOOP_END */:
- s = new LoopEndState_1.LoopEndState();
- break;
- default:
- let message = `The specified state type ${type} is not valid.`;
- throw new Error(message);
- }
- s.ruleIndex = ruleIndex;
- return s;
- }
- lexerActionFactory(type, data1, data2) {
- switch (type) {
- case 0 /* CHANNEL */:
- return new LexerChannelAction_1.LexerChannelAction(data1);
- case 1 /* CUSTOM */:
- return new LexerCustomAction_1.LexerCustomAction(data1, data2);
- case 2 /* MODE */:
- return new LexerModeAction_1.LexerModeAction(data1);
- case 3 /* MORE */:
- return LexerMoreAction_1.LexerMoreAction.INSTANCE;
- case 4 /* POP_MODE */:
- return LexerPopModeAction_1.LexerPopModeAction.INSTANCE;
- case 5 /* PUSH_MODE */:
- return new LexerPushModeAction_1.LexerPushModeAction(data1);
- case 6 /* SKIP */:
- return LexerSkipAction_1.LexerSkipAction.INSTANCE;
- case 7 /* TYPE */:
- return new LexerTypeAction_1.LexerTypeAction(data1);
- default:
- let message = `The specified lexer action type ${type} is not valid.`;
- throw new Error(message);
- }
- }
-}
-/* WARNING: DO NOT MERGE THESE LINES. If UUIDs differ during a merge,
- * resolve the conflict by generating a new ID!
- */
-/**
- * This is the earliest supported serialized UUID.
- */
-ATNDeserializer.BASE_SERIALIZED_UUID = UUID_1.UUID.fromString("E4178468-DF95-44D0-AD87-F22A5D5FB6D3");
-/**
- * This UUID indicates an extension of {@link #ADDED_PRECEDENCE_TRANSITIONS}
- * for the addition of lexer actions encoded as a sequence of
- * {@link LexerAction} instances.
- */
-ATNDeserializer.ADDED_LEXER_ACTIONS = UUID_1.UUID.fromString("AB35191A-1603-487E-B75A-479B831EAF6D");
-/**
- * This UUID indicates the serialized ATN contains two sets of
- * IntervalSets, where the second set's values are encoded as
- * 32-bit integers to support the full Unicode SMP range up to U+10FFFF.
- */
-ATNDeserializer.ADDED_UNICODE_SMP = UUID_1.UUID.fromString("59627784-3BE5-417A-B9EB-8131A7286089");
-/**
- * This list contains all of the currently supported UUIDs, ordered by when
- * the feature first appeared in this branch.
- */
-ATNDeserializer.SUPPORTED_UUIDS = [
- ATNDeserializer.BASE_SERIALIZED_UUID,
- ATNDeserializer.ADDED_LEXER_ACTIONS,
- ATNDeserializer.ADDED_UNICODE_SMP
-];
-/**
- * This is the current serialized UUID.
- */
-ATNDeserializer.SERIALIZED_UUID = ATNDeserializer.ADDED_UNICODE_SMP;
-__decorate([
- Decorators_1.NotNull
-], ATNDeserializer.prototype, "deserializationOptions", void 0);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], ATNDeserializer.prototype, "deserialize", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], ATNDeserializer.prototype, "markPrecedenceDecisions", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull)
-], ATNDeserializer.prototype, "edgeFactory", null);
-exports.ATNDeserializer = ATNDeserializer;
-//# sourceMappingURL=ATNDeserializer.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATNDeserializer.js.map b/node_modules/antlr4ts/atn/ATNDeserializer.js.map
deleted file mode 100644
index ffb24d0..0000000
--- a/node_modules/antlr4ts/atn/ATNDeserializer.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ATNDeserializer.js","sourceRoot":"","sources":["../../../src/atn/ATNDeserializer.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,yDAAsD;AACtD,2DAAwD;AACxD,+BAA4B;AAC5B,2EAAwE;AAIxE,qDAAkD;AAClD,iEAA8D;AAC9D,6CAA0C;AAC1C,2CAAwC;AACxC,mDAAgD;AAChD,uDAAoD;AACpD,mDAAgD;AAChD,oCAAiC;AACjC,2DAAwD;AAExD,qDAAkD;AAClD,iDAA8C;AAG9C,6DAA0D;AAC1D,2DAAwD;AACxD,uDAAoD;AACpD,uDAAoD;AACpD,6DAA0D;AAC1D,+DAA4D;AAC5D,uDAAoD;AACpD,uDAAoD;AACpD,iDAA8C;AAC9C,8CAAwC;AACxC,yDAAsD;AACtD,6DAA0D;AAC1D,+DAA4D;AAC5D,2DAAwD;AACxD,mFAAgF;AAChF,+DAA4D;AAC5D,uDAAoD;AACpD,qDAAkD;AAClD,mDAAgD;AAChD,qDAAkD;AAClD,mDAAgD;AAChD,+DAA4D;AAC5D,2DAAwD;AACxD,6DAA0D;AAC1D,oCAAiC;AACjC,yDAAsD;AAGtD,uCAAoC;AACpC,6DAA0D;AAE1D;;;GAGG;AACH;IA8CC,YAAY,sBAAkD;QAC7D,EAAE,CAAC,CAAC,sBAAsB,IAAI,IAAI,CAAC,CAAC,CAAC;YACpC,sBAAsB,GAAG,qDAAyB,CAAC,cAAc,CAAC;QACnE,CAAC;QAED,IAAI,CAAC,sBAAsB,GAAG,sBAAsB,CAAC;IACtD,CAAC;IAnDD,MAAM,KAAK,kBAAkB;QAC5B;;WAEG;QACH,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAgDD;;;;;;;;;;;;OAYG;IACO,kBAAkB,CAAC,OAAa,EAAE,UAAgB;QAC3D,IAAI,YAAY,GAAW,eAAe,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;QAC7F,EAAE,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,eAAe,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,YAAY,CAAC;IAC7F,CAAC;IAED,WAAW,CAAU,IAAiB;QACrC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAErB,2GAA2G;QAC3G,wGAAwG;QACxG,2GAA2G;QAC3G,gHAAgH;QAChH,gHAAgH;QAChH,iGAAiG;QACjG,EAAE;QACF,+GAA+G;QAC/G,qGAAqG;QACrG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC;QAClC,CAAC;QAED,IAAI,CAAC,GAAW,CAAC,CAAC;QAClB,IAAI,OAAO,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,EAAE,CAAC,CAAC,OAAO,IAAI,eAAe,CAAC,kBAAkB,CAAC,CAAC,CAAC;YACnD,IAAI,MAAM,GAAG,0CAA0C,OAAO,cAAc,eAAe,CAAC,kBAAkB,IAAI,CAAC;YACnH,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;QACzB,CAAC;QAED,IAAI,IAAI,GAAS,eAAe,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACjD,CAAC,IAAI,CAAC,CAAC;QACP,EAAE,CAAC,CAAC,eAAe,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACxE,IAAI,MAAM,GAAG,uCAAuC,IAAI,cAAc,eAAe,CAAC,eAAe,qBAAqB,CAAC;YAC3H,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;QACzB,CAAC;QAED,IAAI,oBAAoB,GAAY,IAAI,CAAC,kBAAkB,CAAC,eAAe,CAAC,mBAAmB,EAAE,IAAI,CAAC,CAAC;QAEvG,IAAI,WAAW,GAAY,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5D,IAAI,YAAY,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5D,IAAI,GAAG,GAAQ,IAAI,SAAG,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;QAElD,EAAE;QACF,SAAS;QACT,EAAE;QACF,IAAI,oBAAoB,GAA6B,EAAE,CAAC;QACxD,IAAI,eAAe,GAAgC,EAAE,CAAC;QACtD,IAAI,OAAO,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,IAAI,KAAK,GAAiB,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3D,4BAA4B;YAC5B,EAAE,CAAC,CAAC,KAAK,yBAA8B,CAAC,CAAC,CAAC;gBACzC,GAAG,CAAC,QAAQ,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;gBACjC,QAAQ,CAAC;YACV,CAAC;YAED,IAAI,SAAS,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACzD,EAAE,CAAC,CAAC,SAAS,KAAK,MAAM,CAAC,CAAC,CAAC;gBAC1B,SAAS,GAAG,CAAC,CAAC,CAAC;YAChB,CAAC;YAED,IAAI,CAAC,GAAa,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;YACtD,EAAE,CAAC,CAAC,KAAK,sBAA0B,CAAC,CAAC,CAAC;gBACrC,IAAI,mBAAmB,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACnE,oBAAoB,CAAC,IAAI,CAAC,CAAe,CAAC,EAAE,mBAAmB,CAAC,CAAC,CAAC;YACnE,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,iCAAe,CAAC,CAAC,CAAC;gBACvC,IAAI,cAAc,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC9D,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC;YAC3C,CAAC;YACD,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;QAED,+GAA+G;QAC/G,GAAG,CAAC,CAAC,IAAI,IAAI,IAAI,oBAAoB,CAAC,CAAC,CAAC;YACvC,IAAI,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,IAAI,IAAI,eAAe,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAkB,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC;QAED,IAAI,kBAAkB,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,WAAW,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3C,GAAG,CAAC,MAAM,CAAC,WAAW,CAAE,CAAC,SAAS,GAAG,IAAI,CAAC;QAC3D,CAAC;QAED,IAAI,eAAe,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/D,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,WAAW,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3C,GAAG,CAAC,MAAM,CAAC,WAAW,CAAE,CAAC,GAAG,GAAG,IAAI,CAAC;QACrD,CAAC;QAED,IAAI,mBAAmB,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,mBAAmB,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,IAAI,WAAW,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,GAAG,CAAC,MAAM,CAAC,WAAW,CAAE,CAAC,gBAAgB,GAAG,IAAI,CAAC;QACnE,CAAC;QAED,EAAE;QACF,QAAQ;QACR,EAAE;QACF,IAAI,MAAM,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,EAAE,CAAC,CAAC,GAAG,CAAC,WAAW,kBAAkB,CAAC,CAAC,CAAC;YACvC,GAAG,CAAC,eAAe,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;QAC9C,CAAC;QAED,GAAG,CAAC,gBAAgB,GAAG,IAAI,KAAK,CAAiB,MAAM,CAAC,CAAC;QACzD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjD,IAAI,UAAU,GAAmC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC/D,UAAU,CAAC,YAAY,GAAG,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;YAChE,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;YACrC,EAAE,CAAC,CAAC,GAAG,CAAC,WAAW,kBAAkB,CAAC,CAAC,CAAC;gBACvC,IAAI,SAAS,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzD,EAAE,CAAC,CAAC,SAAS,KAAK,MAAM,CAAC,CAAC,CAAC;oBAC1B,SAAS,GAAG,aAAK,CAAC,GAAG,CAAC;gBACvB,CAAC;gBAED,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;gBAEnC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,eAAe,CAAC,mBAAmB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;oBACzE,4DAA4D;oBAC5D,0BAA0B;oBAC1B,IAAI,kBAAkB,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBAClE,EAAE,CAAC,CAAC,kBAAkB,KAAK,MAAM,CAAC,CAAC,CAAC;wBACnC,kBAAkB,GAAG,CAAC,CAAC,CAAC;oBACzB,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;QAED,GAAG,CAAC,eAAe,GAAG,IAAI,KAAK,CAAgB,MAAM,CAAC,CAAC;QACvD,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YAC9B,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,YAAY,6BAAa,CAAC,CAAC,CAAC,CAAC;gBACvC,QAAQ,CAAC;YACV,CAAC;YAED,GAAG,CAAC,eAAe,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,KAAK,CAAC;YAC7C,GAAG,CAAC,gBAAgB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,SAAS,GAAG,KAAK,CAAC;QACzD,CAAC;QAED,EAAE;QACF,QAAQ;QACR,EAAE;QACF,IAAI,MAAM,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjD,GAAG,CAAC,gBAAgB,CAAC,IAAI,CAAmB,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC;QAED,GAAG,CAAC,SAAS,GAAG,IAAI,KAAK,CAAM,MAAM,CAAC,CAAC;QACvC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,SAAG,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,CAAC;QAED,EAAE;QACF,OAAO;QACP,EAAE;QACF,IAAI,IAAI,GAAkB,EAAE,CAAC;QAC7B,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAExC,gEAAgE;QAChE,sDAAsD;QACtD,EAAE,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,eAAe,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACtE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACxC,CAAC;QAED,EAAE;QACF,QAAQ;QACR,EAAE;QACF,IAAI,MAAM,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,GAAG,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACjD,IAAI,GAAG,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACrD,IAAI,KAAK,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACvD,IAAI,IAAI,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtD,IAAI,IAAI,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtD,IAAI,IAAI,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtD,IAAI,KAAK,GAAe,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACvF,gIAAgI;YAChI,IAAI,QAAQ,GAAa,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACzC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YAC9B,CAAC,IAAI,CAAC,CAAC;QACR,CAAC;QAID,IAAI,oBAAoB,GAAG,IAAI,+BAAc,CAAI;YAChD,QAAQ,EAAE,CAAC,CAAI,KAAK,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,yBAAyB;YAE7E,MAAM,EAAE,UAAU,CAAI,EAAE,CAAI;gBAC3B,MAAM,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS;uBAC9B,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,WAAW;uBAC/B,CAAC,CAAC,yBAAyB,KAAK,CAAC,CAAC,yBAAyB,CAAC;YACjE,CAAC;SACD,CAAC,CAAC;QACH,IAAI,iBAAiB,GAAQ,EAAE,CAAC;QAChC,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YAC9B,IAAI,uBAAuB,GAAY,KAAK,CAAC,SAAS,IAAI,CAAC,IAAI,GAAG,CAAC,gBAAgB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,YAAY,CAAC;YAClH,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,mBAAmB,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpD,IAAI,CAAC,GAAe,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBACxC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,+BAAc,CAAC,CAAC,CAAC,CAAC;oBACpC,QAAQ,CAAC;gBACV,CAAC;gBAED,IAAI,cAAc,GAAmB,CAAC,CAAC;gBACvC,IAAI,yBAAyB,GAAY,GAAG,CAAC,gBAAgB,CAAC,cAAc,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,YAAY,CAAC;gBAC5G,EAAE,CAAC,CAAC,CAAC,yBAAyB,IAAI,uBAAuB,CAAC,CAAC,CAAC;oBAC3D,QAAQ,CAAC;gBACV,CAAC;gBAED,IAAI,yBAAyB,GAAW,CAAC,CAAC,CAAC;gBAC3C,EAAE,CAAC,CAAC,GAAG,CAAC,gBAAgB,CAAC,cAAc,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC;oBAC5E,EAAE,CAAC,CAAC,cAAc,CAAC,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC;wBACrC,yBAAyB,GAAG,cAAc,CAAC,MAAM,CAAC,SAAS,CAAC;oBAC7D,CAAC;gBACF,CAAC;gBAED,IAAI,OAAO,GAAG,EAAE,SAAS,EAAE,cAAc,CAAC,MAAM,CAAC,SAAS,EAAE,WAAW,EAAE,cAAc,CAAC,WAAW,CAAC,WAAW,EAAE,yBAAyB,EAAE,yBAAyB,EAAE,CAAC;gBACxK,EAAE,CAAC,CAAC,oBAAoB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBACvC,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACjC,CAAC;YACF,CAAC;QACF,CAAC;QAED,qDAAqD;QACrD,GAAG,CAAC,CAAC,IAAI,gBAAgB,IAAI,iBAAiB,CAAC,CAAC,CAAC;YAChD,IAAI,UAAU,GAAG,IAAI,qCAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,gBAAgB,CAAC,WAAW,CAAC,EAAE,gBAAgB,CAAC,yBAAyB,CAAC,CAAC;YAC7H,GAAG,CAAC,eAAe,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;QAC3E,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YAC9B,EAAE,CAAC,CAAC,KAAK,YAAY,iCAAe,CAAC,CAAC,CAAC;gBACtC,uDAAuD;gBACvD,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ,IAAI,IAAI,CAAC,CAAC,CAAC;oBAC5B,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;gBAC1C,CAAC;gBAED,wEAAwE;gBACxE,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC;oBACvC,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;gBAC1C,CAAC;gBAED,KAAK,CAAC,QAAQ,CAAC,UAAU,GAAG,KAAK,CAAC;YACnC,CAAC;YAED,EAAE,CAAC,CAAC,KAAK,YAAY,qCAAiB,CAAC,CAAC,CAAC;gBACxC,IAAI,aAAa,GAAsB,KAAK,CAAC;gBAC7C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,mBAAmB,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC5D,IAAI,MAAM,GAAa,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;oBAC1D,EAAE,CAAC,CAAC,MAAM,YAAY,yCAAmB,CAAC,CAAC,CAAC;wBAC3C,MAAM,CAAC,aAAa,GAAG,aAAa,CAAC;oBACtC,CAAC;gBACF,CAAC;YACF,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,YAAY,qCAAiB,CAAC,CAAC,CAAC;gBAC7C,IAAI,aAAa,GAAsB,KAAK,CAAC;gBAC7C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,mBAAmB,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC5D,IAAI,MAAM,GAAa,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;oBAC1D,EAAE,CAAC,CAAC,MAAM,YAAY,uCAAkB,CAAC,CAAC,CAAC;wBAC1C,MAAM,CAAC,aAAa,GAAG,aAAa,CAAC;oBACtC,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;QAED,EAAE;QACF,YAAY;QACZ,EAAE;QACF,IAAI,UAAU,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1D,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjD,IAAI,QAAQ,GAAiC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC3D,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACnC,QAAQ,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;QAED,EAAE;QACF,gBAAgB;QAChB,EAAE;QACF,EAAE,CAAC,CAAC,GAAG,CAAC,WAAW,kBAAkB,CAAC,CAAC,CAAC;YACvC,EAAE,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC;gBAC1B,GAAG,CAAC,YAAY,GAAG,IAAI,KAAK,CAAc,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC5E,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAClD,IAAI,UAAU,GAAoB,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACnE,IAAI,KAAK,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACrD,EAAE,CAAC,CAAC,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC;wBACrB,KAAK,GAAG,CAAC,CAAC,CAAC;oBACZ,CAAC;oBAED,IAAI,KAAK,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACrD,EAAE,CAAC,CAAC,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC;wBACrB,KAAK,GAAG,CAAC,CAAC,CAAC;oBACZ,CAAC;oBAED,IAAI,WAAW,GAAgB,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;oBAEjF,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;gBACnC,CAAC;YACF,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,gEAAgE;gBAChE,4DAA4D;gBAC5D,kDAAkD;gBAClD,IAAI,kBAAkB,GAAkB,EAAE,CAAC;gBAC3C,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;oBAC9B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,mBAAmB,EAAE,CAAC,EAAE,EAAE,CAAC;wBACpD,IAAI,UAAU,GAAe,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;wBACjD,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,YAAY,mCAAgB,CAAC,CAAC,CAAC,CAAC;4BAC/C,QAAQ,CAAC;wBACV,CAAC;wBAED,IAAI,SAAS,GAAW,UAAU,CAAC,SAAS,CAAC;wBAC7C,IAAI,WAAW,GAAW,UAAU,CAAC,WAAW,CAAC;wBACjD,IAAI,WAAW,GAAsB,IAAI,qCAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;wBACnF,KAAK,CAAC,aAAa,CAAC,CAAC,EAAE,IAAI,mCAAgB,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,EAAE,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;wBAC7G,kBAAkB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;oBACtC,CAAC;gBACF,CAAC;gBAED,GAAG,CAAC,YAAY,GAAG,kBAAkB,CAAC;YACvC,CAAC;QACF,CAAC;QAED,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,CAAC;QAElC,GAAG,CAAC,aAAa,GAAG,IAAI,KAAK,CAAM,UAAU,CAAC,CAAC;QAC/C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,IAAI,SAAG,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3D,CAAC;QAED,EAAE,CAAC,CAAC,IAAI,CAAC,sBAAsB,CAAC,WAAW,CAAC,CAAC,CAAC;YAC7C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC;QAED,EAAE,CAAC,CAAC,IAAI,CAAC,sBAAsB,CAAC,+BAA+B,IAAI,GAAG,CAAC,WAAW,mBAAmB,CAAC,CAAC,CAAC;YACvG,GAAG,CAAC,eAAe,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;YAClE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtD,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,YAAY,GAAG,CAAC,GAAG,CAAC,CAAC;YACnD,CAAC;YAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtD,IAAI,WAAW,GAAyB,IAAI,2CAAoB,EAAE,CAAC;gBACnE,WAAW,CAAC,SAAS,GAAG,CAAC,CAAC;gBAC1B,GAAG,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;gBAE1B,IAAI,UAAU,GAAkB,IAAI,6BAAa,EAAE,CAAC;gBACpD,UAAU,CAAC,SAAS,GAAG,CAAC,CAAC;gBACzB,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;gBAEzB,WAAW,CAAC,QAAQ,GAAG,UAAU,CAAC;gBAClC,GAAG,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC;gBAErC,UAAU,CAAC,UAAU,GAAG,WAAW,CAAC;gBAEpC,IAAI,QAA8B,CAAC;gBACnC,IAAI,iBAAyC,CAAC;gBAC9C,EAAE,CAAC,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC;oBAC9C,gEAAgE;oBAChE,QAAQ,GAAG,SAAS,CAAC;oBACrB,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;wBAC9B,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC;4BAC3B,QAAQ,CAAC;wBACV,CAAC;wBAED,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,YAAY,uCAAkB,CAAC,CAAC,CAAC,CAAC;4BAC5C,QAAQ,CAAC;wBACV,CAAC;wBAED,IAAI,iBAAiB,GAAa,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,mBAAmB,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;wBACzF,EAAE,CAAC,CAAC,CAAC,CAAC,iBAAiB,YAAY,2BAAY,CAAC,CAAC,CAAC,CAAC;4BAClD,QAAQ,CAAC;wBACV,CAAC;wBAED,EAAE,CAAC,CAAC,iBAAiB,CAAC,sBAAsB,IAAI,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,YAAY,6BAAa,CAAC,CAAC,CAAC;4BACjH,QAAQ,GAAG,KAAK,CAAC;4BACjB,KAAK,CAAC;wBACP,CAAC;oBACF,CAAC;oBAED,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;wBACf,MAAM,IAAI,KAAK,CAAC,sEAAsE,CAAC,CAAC;oBACzF,CAAC;oBAED,iBAAiB,GAAwB,QAAS,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBAChF,CAAC;gBACD,IAAI,CAAC,CAAC;oBACL,QAAQ,GAAG,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;gBACnC,CAAC;gBAED,+FAA+F;gBAC/F,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;oBAC9B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,mBAAmB,EAAE,CAAC,EAAE,EAAE,CAAC;wBACpD,IAAI,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;wBACrC,EAAE,CAAC,CAAC,UAAU,KAAK,iBAAiB,CAAC,CAAC,CAAC;4BACtC,QAAQ,CAAC;wBACV,CAAC;wBAED,EAAE,CAAC,CAAC,UAAU,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC;4BACpC,UAAU,CAAC,MAAM,GAAG,UAAU,CAAC;wBAChC,CAAC;oBACF,CAAC;gBACF,CAAC;gBAED,gFAAgF;gBAChF,OAAO,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,mBAAmB,GAAG,CAAC,EAAE,CAAC;oBACxD,IAAI,UAAU,GAAe,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,mBAAmB,GAAG,CAAC,CAAC,CAAC;oBACvH,WAAW,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;gBACvC,CAAC;gBAED,sBAAsB;gBACtB,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,qCAAiB,CAAC,WAAW,CAAC,CAAC,CAAC;gBAC1E,UAAU,CAAC,aAAa,CAAC,IAAI,qCAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAE1D,IAAI,UAAU,GAAa,IAAI,uBAAU,EAAE,CAAC;gBAC5C,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;gBACzB,UAAU,CAAC,aAAa,CAAC,IAAI,+BAAc,CAAC,UAAU,EAAE,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjF,WAAW,CAAC,aAAa,CAAC,IAAI,qCAAiB,CAAC,UAAU,CAAC,CAAC,CAAC;YAC9D,CAAC;YAED,EAAE,CAAC,CAAC,IAAI,CAAC,sBAAsB,CAAC,WAAW,CAAC,CAAC,CAAC;gBAC7C,8BAA8B;gBAC9B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACrB,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,IAAI,CAAC,sBAAsB,CAAC,UAAU,CAAC,CAAC,CAAC;YAC5C,OAAO,IAAI,EAAE,CAAC;gBACb,IAAI,iBAAiB,GAAW,CAAC,CAAC;gBAClC,iBAAiB,IAAI,eAAe,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;gBACzD,iBAAiB,IAAI,eAAe,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;gBACjE,IAAI,aAAa,GAAY,GAAG,CAAC,WAAW,kBAAkB,CAAC;gBAC/D,iBAAiB,IAAI,eAAe,CAAC,YAAY,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;gBACtE,EAAE,CAAC,CAAC,iBAAiB,KAAK,CAAC,CAAC,CAAC,CAAC;oBAC7B,KAAK,CAAC;gBACP,CAAC;YACF,CAAC;YAED,EAAE,CAAC,CAAC,IAAI,CAAC,sBAAsB,CAAC,WAAW,CAAC,CAAC,CAAC;gBAC7C,8BAA8B;gBAC9B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACrB,CAAC;QACF,CAAC;QAED,eAAe,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC;QAEvC,MAAM,CAAC,GAAG,CAAC;IACZ,CAAC;IAEO,QAAQ,CAAC,IAAiB,EAAE,CAAS,EAAE,IAAmB,EAAE,MAAe;QAClF,IAAI,KAAK,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,IAAI,UAAU,GAAW,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACxD,CAAC,EAAE,CAAC;YACJ,IAAI,GAAG,GAAgB,IAAI,yBAAW,EAAE,CAAC;YACzC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAEf,IAAI,WAAW,GAAY,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;YACjE,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;gBACjB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACb,CAAC;YAED,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;gBACZ,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrC,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,eAAe,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAChF,CAAC,IAAI,CAAC,CAAC;gBACR,CAAC;YACF,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrC,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC5E,CAAC,IAAI,CAAC,CAAC;gBACR,CAAC;YACF,CAAC;QACF,CAAC;QAED,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAED;;;;;;OAMG;IACO,uBAAuB,CAAU,GAAQ;QAClD,sDAAsD;QACtD,IAAI,uBAAuB,GAAG,IAAI,GAAG,EAA8B,CAAC;QAEpE,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YAC9B,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,YAAY,uCAAkB,CAAC,CAAC,CAAC,CAAC;gBAC5C,QAAQ,CAAC;YACV,CAAC;YAED;;;eAGG;YACH,EAAE,CAAC,CAAC,GAAG,CAAC,gBAAgB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC;gBAC5D,IAAI,iBAAiB,GAAa,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,mBAAmB,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;gBACzF,EAAE,CAAC,CAAC,iBAAiB,YAAY,2BAAY,CAAC,CAAC,CAAC;oBAC/C,EAAE,CAAC,CAAC,iBAAiB,CAAC,sBAAsB,IAAI,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,YAAY,6BAAa,CAAC,CAAC,CAAC;wBACjH,uBAAuB,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;wBACpD,KAAK,CAAC,sBAAsB,GAAG,IAAI,CAAC;wBACpC,KAAK,CAAC,wBAAwB,GAAG,IAAI,eAAM,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBAChE,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;QAED,qEAAqE;QACrE,+CAA+C;QAC/C,GAAG,CAAC,CAAC,IAAI,kBAAkB,IAAI,uBAAuB,CAAC,CAAC,CAAC;YACxD,GAAG,CAAC,CAAC,IAAI,UAAU,IAAI,GAAG,CAAC,eAAe,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;gBACpF,EAAE,CAAC,CAAC,UAAU,CAAC,iBAAiB,oBAA2B,CAAC,CAAC,CAAC;oBAC7D,QAAQ,CAAC;gBACV,CAAC;gBAED,IAAI,iBAAiB,GAAG,UAA+B,CAAC;gBACxD,EAAE,CAAC,CAAC,iBAAiB,CAAC,yBAAyB,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxD,QAAQ,CAAC;gBACV,CAAC;gBAED,kBAAkB,CAAC,CAAC,CAAC,CAAC,wBAAwB,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;YACnF,CAAC;QACF,CAAC;IACF,CAAC;IAES,SAAS,CAAC,GAAQ;QAC3B,qBAAqB;QACrB,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YAC9B,IAAI,CAAC,cAAc,CAAC,KAAK,IAAI,IAAI,EAAE,gCAAgC,CAAC,CAAC;YACrE,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS,yBAA8B,CAAC,CAAC,CAAC;gBACnD,QAAQ,CAAC;YACV,CAAC;YAED,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,yBAAyB,IAAI,KAAK,CAAC,mBAAmB,IAAI,CAAC,CAAC,CAAC;YAEvF,EAAE,CAAC,CAAC,KAAK,YAAY,yCAAmB,CAAC,CAAC,CAAC;gBAC1C,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,aAAa,IAAI,IAAI,CAAC,CAAC;YAClD,CAAC;YAED,EAAE,CAAC,CAAC,KAAK,YAAY,uCAAkB,CAAC,CAAC,CAAC;gBACzC,IAAI,kBAAkB,GAAuB,KAAK,CAAC;gBACnD,IAAI,CAAC,cAAc,CAAC,kBAAkB,CAAC,aAAa,IAAI,IAAI,CAAC,CAAC;gBAC9D,IAAI,CAAC,cAAc,CAAC,kBAAkB,CAAC,mBAAmB,KAAK,CAAC,CAAC,CAAC;gBAElE,EAAE,CAAC,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,YAAY,yCAAmB,CAAC,CAAC,CAAC;oBAC5E,IAAI,CAAC,cAAc,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,YAAY,2BAAY,CAAC,CAAC;oBACrF,IAAI,CAAC,cAAc,CAAC,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;gBACpD,CAAC;gBACD,IAAI,CAAC,EAAE,CAAC,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,YAAY,2BAAY,CAAC,CAAC,CAAC;oBAC1E,IAAI,CAAC,cAAc,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,YAAY,yCAAmB,CAAC,CAAC;oBAC5F,IAAI,CAAC,cAAc,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;gBACnD,CAAC;gBACD,IAAI,CAAC,CAAC;oBACL,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;gBAC1C,CAAC;YACF,CAAC;YAED,EAAE,CAAC,CAAC,KAAK,YAAY,qCAAiB,CAAC,CAAC,CAAC;gBACxC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,mBAAmB,KAAK,CAAC,CAAC,CAAC;gBACrD,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,YAAY,uCAAkB,CAAC,CAAC;YAC/E,CAAC;YAED,EAAE,CAAC,CAAC,KAAK,YAAY,2BAAY,CAAC,CAAC,CAAC;gBACnC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,aAAa,IAAI,IAAI,CAAC,CAAC;YAClD,CAAC;YAED,EAAE,CAAC,CAAC,KAAK,YAAY,+BAAc,CAAC,CAAC,CAAC;gBACrC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC;YAC9C,CAAC;YAED,EAAE,CAAC,CAAC,KAAK,YAAY,iCAAe,CAAC,CAAC,CAAC;gBACtC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,QAAQ,IAAI,IAAI,CAAC,CAAC;YAC7C,CAAC;YAED,EAAE,CAAC,CAAC,KAAK,YAAY,6BAAa,CAAC,CAAC,CAAC;gBACpC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC;YAC/C,CAAC;YAED,EAAE,CAAC,CAAC,KAAK,YAAY,6BAAa,CAAC,CAAC,CAAC;gBACpC,IAAI,aAAa,GAAkB,KAAK,CAAC;gBACzC,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,mBAAmB,IAAI,CAAC,IAAI,aAAa,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC;YAC5F,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,mBAAmB,IAAI,CAAC,IAAI,KAAK,YAAY,6BAAa,CAAC,CAAC;YACvF,CAAC;QACF,CAAC;IACF,CAAC;IAES,cAAc,CAAC,SAAkB,EAAE,OAAgB;QAC5D,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YAChB,MAAM,IAAI,KAAK,CAAC,yBAAyB,GAAG,OAAO,CAAC,CAAC;QACtD,CAAC;IACF,CAAC;IAEO,MAAM,CAAC,cAAc,CAAC,GAAQ;QACrC,IAAI,YAAY,GAAW,CAAC,CAAC;QAE7B,IAAI,sBAAsB,GAAiB,IAAI,KAAK,CAAa,GAAG,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAC9F,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtD,IAAI,UAAU,GAAmB,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;YACzD,IAAI,WAAW,GAAa,UAAU,CAAC;YACvC,OAAO,WAAW,CAAC,yBAAyB;mBACxC,WAAW,CAAC,4BAA4B,KAAK,CAAC;mBAC9C,WAAW,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,iBAAiB,oBAA2B,EAAE,CAAC;gBACxF,WAAW,GAAG,WAAW,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YAC5D,CAAC;YAED,EAAE,CAAC,CAAC,WAAW,CAAC,4BAA4B,KAAK,CAAC,CAAC,CAAC,CAAC;gBACpD,QAAQ,CAAC;YACV,CAAC;YAED,IAAI,eAAe,GAAe,WAAW,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;YACxE,IAAI,WAAW,GAAa,eAAe,CAAC,MAAM,CAAC;YACnD,EAAE,CAAC,CAAC,eAAe,CAAC,SAAS;mBACzB,CAAC,WAAW,CAAC,yBAAyB;mBACtC,WAAW,CAAC,4BAA4B,KAAK,CAAC;mBAC9C,CAAC,CAAC,WAAW,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,MAAM,YAAY,6BAAa,CAAC,CAAC,CAAC,CAAC;gBAC9E,QAAQ,CAAC;YACV,CAAC;YAED,MAAM,CAAC,CAAC,eAAe,CAAC,iBAAiB,CAAC,CAAC,CAAC;gBAC5C,kBAAyB;gBACzB,mBAA0B;gBAC1B;oBACC,sBAAsB,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC;oBAC5C,KAAK,CAAC;gBAEP,qBAA4B;gBAC5B;oBACC,sBAAsB;oBACtB,QAAQ,CAAC;gBAEV;oBACC,QAAQ,CAAC;YACV,CAAC;QACF,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,WAAW,GAAG,CAAC,EAAE,WAAW,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,CAAC;YAC1E,IAAI,KAAK,GAAa,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;YAC9C,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;gBACzB,QAAQ,CAAC;YACV,CAAC;YAED,IAAI,oBAA8C,CAAC;YACnD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,4BAA4B,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7D,IAAI,UAAU,GAAe,KAAK,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;gBAC7D,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,YAAY,+BAAc,CAAC,CAAC,CAAC,CAAC;oBAC7C,EAAE,CAAC,CAAC,oBAAoB,IAAI,IAAI,CAAC,CAAC,CAAC;wBAClC,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBACvC,CAAC;oBAED,QAAQ,CAAC;gBACV,CAAC;gBAED,IAAI,cAAc,GAAmB,UAAU,CAAC;gBAChD,IAAI,SAAS,GAAe,sBAAsB,CAAC,cAAc,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;gBACpF,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC;oBACvB,EAAE,CAAC,CAAC,oBAAoB,IAAI,IAAI,CAAC,CAAC,CAAC;wBAClC,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBACvC,CAAC;oBAED,QAAQ,CAAC;gBACV,CAAC;gBAED,EAAE,CAAC,CAAC,oBAAoB,IAAI,IAAI,CAAC,CAAC,CAAC;oBAClC,oBAAoB,GAAG,EAAE,CAAC;oBAC1B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC5B,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC5D,CAAC;gBACF,CAAC;gBAED,YAAY,EAAE,CAAC;gBACf,IAAI,MAAM,GAAa,cAAc,CAAC,WAAW,CAAC;gBAClD,IAAI,iBAAiB,GAAa,IAAI,uBAAU,EAAE,CAAC;gBACnD,iBAAiB,CAAC,YAAY,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;gBACjD,GAAG,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC;gBAChC,oBAAoB,CAAC,IAAI,CAAC,IAAI,qCAAiB,CAAC,iBAAiB,CAAC,CAAC,CAAC;gBAEpE,MAAM,CAAC,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC,CAAC;oBACtC;wBACC,iBAAiB,CAAC,aAAa,CAAC,IAAI,+BAAc,CAAC,MAAM,EAAmB,SAAU,CAAC,MAAM,CAAC,CAAC,CAAC;wBAChG,KAAK,CAAC;oBAEP;wBACC,iBAAiB,CAAC,aAAa,CAAC,IAAI,iCAAe,CAAC,MAAM,EAAoB,SAAU,CAAC,IAAI,EAAoB,SAAU,CAAC,EAAE,CAAC,CAAC,CAAC;wBACjI,KAAK,CAAC;oBAEP;wBACC,iBAAiB,CAAC,aAAa,CAAC,IAAI,6BAAa,CAAC,MAAM,EAAkB,SAAU,CAAC,KAAK,CAAC,CAAC,CAAC;wBAC7F,KAAK,CAAC;oBAEP;wBACC,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;gBAClD,CAAC;YACF,CAAC;YAED,EAAE,CAAC,CAAC,oBAAoB,IAAI,IAAI,CAAC,CAAC,CAAC;gBAClC,EAAE,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;oBACvB,OAAO,KAAK,CAAC,4BAA4B,GAAG,CAAC,EAAE,CAAC;wBAC/C,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,4BAA4B,GAAG,CAAC,CAAC,CAAC;oBACzE,CAAC;gBACF,CAAC;gBAED,GAAG,CAAC,CAAC,IAAI,UAAU,IAAI,oBAAoB,CAAC,CAAC,CAAC;oBAC7C,KAAK,CAAC,sBAAsB,CAAC,UAAU,CAAC,CAAC;gBAC1C,CAAC;YACF,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,uCAAkB,CAAC,KAAK,CAAC,CAAC,CAAC;YAC9B,OAAO,CAAC,GAAG,CAAC,gCAAgC,GAAG,YAAY,GAAG,qCAAqC,CAAC,CAAC;QACtG,CAAC;QAED,MAAM,CAAC,YAAY,CAAC;IACrB,CAAC;IAEO,MAAM,CAAC,sBAAsB,CAAC,GAAQ;QAC7C,IAAI,YAAY,GAAW,CAAC,CAAC;QAE7B,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YAC9B,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,yBAAyB,IAAI,KAAK,YAAY,6BAAa,CAAC,CAAC,CAAC;gBACxE,QAAQ,CAAC;YACV,CAAC;YAED,IAAI,oBAA8C,CAAC;YACnD,cAAc,EACd,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,4BAA4B,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7D,IAAI,UAAU,GAAe,KAAK,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;gBAC7D,IAAI,YAAY,GAAa,UAAU,CAAC,MAAM,CAAC;gBAC/C,EAAE,CAAC,CAAC,UAAU,CAAC,iBAAiB,oBAA2B;uBACnC,UAAW,CAAC,yBAAyB,KAAK,CAAC,CAAC;uBAChE,YAAY,CAAC,SAAS,kBAAuB;uBAC7C,CAAC,YAAY,CAAC,yBAAyB,CAAC,CAAC,CAAC;oBAC7C,EAAE,CAAC,CAAC,oBAAoB,IAAI,IAAI,CAAC,CAAC,CAAC;wBAClC,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBACvC,CAAC;oBAED,QAAQ,CAAC,cAAc,CAAC;gBACzB,CAAC;gBAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,4BAA4B,EAAE,CAAC,EAAE,EAAE,CAAC;oBACpE,EAAE,CAAC,CAAC,YAAY,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,iBAAiB,oBAA2B;2BAC/D,YAAY,CAAC,sBAAsB,CAAC,CAAC,CAAE,CAAC,yBAAyB,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;wBAClG,EAAE,CAAC,CAAC,oBAAoB,IAAI,IAAI,CAAC,CAAC,CAAC;4BAClC,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;wBACvC,CAAC;wBAED,QAAQ,CAAC,cAAc,CAAC;oBACzB,CAAC;gBACF,CAAC;gBAED,YAAY,EAAE,CAAC;gBACf,EAAE,CAAC,CAAC,oBAAoB,IAAI,IAAI,CAAC,CAAC,CAAC;oBAClC,oBAAoB,GAAG,EAAE,CAAC;oBAC1B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC5B,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC5D,CAAC;gBACF,CAAC;gBAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,4BAA4B,EAAE,CAAC,EAAE,EAAE,CAAC;oBACpE,IAAI,MAAM,GAAa,YAAY,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;oBACrE,oBAAoB,CAAC,IAAI,CAAC,IAAI,qCAAiB,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC1D,CAAC;YACF,CAAC;YAED,EAAE,CAAC,CAAC,oBAAoB,IAAI,IAAI,CAAC,CAAC,CAAC;gBAClC,EAAE,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;oBACvB,OAAO,KAAK,CAAC,4BAA4B,GAAG,CAAC,EAAE,CAAC;wBAC/C,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,4BAA4B,GAAG,CAAC,CAAC,CAAC;oBACzE,CAAC;gBACF,CAAC;gBAED,GAAG,CAAC,CAAC,IAAI,UAAU,IAAI,oBAAoB,CAAC,CAAC,CAAC;oBAC7C,KAAK,CAAC,sBAAsB,CAAC,UAAU,CAAC,CAAC;gBAC1C,CAAC;YACF,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,uCAAkB,CAAC,KAAK,CAAC,CAAC,CAAC;YAC9B,OAAO,CAAC,GAAG,CAAC,gCAAgC,GAAG,YAAY,GAAG,wDAAwD,CAAC,CAAC;QACzH,CAAC;QAED,MAAM,CAAC,YAAY,CAAC;IACrB,CAAC;IAEO,MAAM,CAAC,YAAY,CAAC,GAAQ,EAAE,aAAsB;QAC3D,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC;YACnB,2DAA2D;YAC3D,MAAM,CAAC,CAAC,CAAC;QACV,CAAC;QAED,IAAI,YAAY,GAAW,CAAC,CAAC;QAC7B,IAAI,SAAS,GAAoB,GAAG,CAAC,eAAe,CAAC;QACrD,GAAG,CAAC,CAAC,IAAI,QAAQ,IAAI,SAAS,CAAC,CAAC,CAAC;YAChC,IAAI,cAAc,GAAgB,IAAI,yBAAW,EAAE,CAAC;YACpD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,4BAA4B,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChE,IAAI,aAAa,GAAe,QAAQ,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;gBACnE,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,YAAY,qCAAiB,CAAC,CAAC,CAAC,CAAC;oBACnD,QAAQ,CAAC;gBACV,CAAC;gBAED,EAAE,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,4BAA4B,KAAK,CAAC,CAAC,CAAC,CAAC;oBAC7D,QAAQ,CAAC;gBACV,CAAC;gBAED,IAAI,UAAU,GAAe,aAAa,CAAC,MAAM,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;gBAC5E,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,YAAY,6BAAa,CAAC,CAAC,CAAC,CAAC;oBACnD,QAAQ,CAAC;gBACV,CAAC;gBAED,EAAE,CAAC,CAAC,UAAU,YAAY,mCAAgB,CAAC,CAAC,CAAC;oBAC5C,4BAA4B;oBAC5B,QAAQ,CAAC;gBACV,CAAC;gBAED,EAAE,CAAC,CAAC,UAAU,YAAY,+BAAc;uBACpC,UAAU,YAAY,iCAAe;uBACrC,UAAU,YAAY,6BAAa,CAAC,CAAC,CAAC;oBACzC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACvB,CAAC;YACF,CAAC;YAED,EAAE,CAAC,CAAC,cAAc,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC9B,QAAQ,CAAC;YACV,CAAC;YAED,IAAI,oBAAoB,GAAiB,EAAE,CAAC;YAC5C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,4BAA4B,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChE,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACjC,oBAAoB,CAAC,IAAI,CAAC,QAAQ,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/D,CAAC;YACF,CAAC;YAED,IAAI,aAAa,GAAa,QAAQ,CAAC,sBAAsB,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACjI,IAAI,QAAQ,GAAgB,IAAI,yBAAW,EAAE,CAAC;YAC9C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1D,IAAI,QAAQ,GAAa,cAAc,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBACrD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC/C,IAAI,eAAe,GAAe,QAAQ,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;oBACtG,EAAE,CAAC,CAAC,eAAe,YAAY,mCAAgB,CAAC,CAAC,CAAC;wBACjD,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC;oBACzC,CAAC;oBAAC,IAAI,CAAC,CAAC;wBACP,QAAQ,CAAC,MAAM,CAAc,eAAe,CAAC,KAAK,CAAC,CAAC;oBACrD,CAAC;gBACF,CAAC;YACF,CAAC;YAED,IAAI,aAAyB,CAAC;YAC9B,EAAE,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;gBACrC,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;oBACzB,aAAa,GAAG,IAAI,+BAAc,CAAC,aAAa,EAAE,QAAQ,CAAC,UAAU,CAAC,CAAC;gBACxE,CAAC;gBAAC,IAAI,CAAC,CAAC;oBACP,IAAI,aAAa,GAAa,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;oBACpD,aAAa,GAAG,IAAI,iCAAe,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;gBACtF,CAAC;YACF,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,aAAa,GAAG,IAAI,6BAAa,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;YAC5D,CAAC;YAED,IAAI,iBAAiB,GAAa,IAAI,uBAAU,EAAE,CAAC;YACnD,iBAAiB,CAAC,YAAY,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YACnD,GAAG,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC;YAEhC,iBAAiB,CAAC,aAAa,CAAC,aAAa,CAAC,CAAC;YAC/C,oBAAoB,CAAC,IAAI,CAAC,IAAI,qCAAiB,CAAC,iBAAiB,CAAC,CAAC,CAAC;YAEpE,YAAY,IAAI,QAAQ,CAAC,4BAA4B,GAAG,oBAAoB,CAAC,MAAM,CAAC;YAEpF,EAAE,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC;gBAC1B,OAAO,QAAQ,CAAC,4BAA4B,GAAG,CAAC,EAAE,CAAC;oBAClD,QAAQ,CAAC,yBAAyB,CAAC,QAAQ,CAAC,4BAA4B,GAAG,CAAC,CAAC,CAAC;gBAC/E,CAAC;YACF,CAAC;YAED,GAAG,CAAC,CAAC,IAAI,UAAU,IAAI,oBAAoB,CAAC,CAAC,CAAC;gBAC7C,QAAQ,CAAC,sBAAsB,CAAC,UAAU,CAAC,CAAC;YAC7C,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,uCAAkB,CAAC,KAAK,CAAC,CAAC,CAAC;YAC9B,OAAO,CAAC,GAAG,CAAC,gCAAgC,GAAG,YAAY,GAAG,4BAA4B,CAAC,CAAC;QAC7F,CAAC;QAED,MAAM,CAAC,YAAY,CAAC;IACrB,CAAC;IAEO,MAAM,CAAC,iBAAiB,CAAC,GAAQ;QACxC,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YAC9B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,mBAAmB,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpD,IAAI,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBACrC,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,YAAY,+BAAc,CAAC,CAAC,CAAC,CAAC;oBAC7C,QAAQ,CAAC;gBACV,CAAC;gBAED,UAAU,CAAC,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;gBAChE,UAAU,CAAC,iBAAiB,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;YACzE,CAAC;YAED,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;gBACxB,QAAQ,CAAC;YACV,CAAC;YAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,4BAA4B,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7D,IAAI,UAAU,GAAG,KAAK,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;gBACjD,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,YAAY,+BAAc,CAAC,CAAC,CAAC,CAAC;oBAC7C,QAAQ,CAAC;gBACV,CAAC;gBAED,UAAU,CAAC,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;gBAChE,UAAU,CAAC,iBAAiB,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;YACzE,CAAC;QACF,CAAC;IACF,CAAC;IAEO,MAAM,CAAC,YAAY,CAAC,GAAQ,EAAE,UAA0B,EAAE,aAAsB;QACvF,EAAE,CAAC,CAAC,CAAC,aAAa,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QACD,EAAE,CAAC,CAAC,aAAa,IAAI,UAAU,CAAC,iBAAiB,CAAC,CAAC,CAAC;YACnD,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAED,IAAI,SAAS,GAAW,IAAI,eAAM,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,QAAQ,GAAe,EAAE,CAAC;QAC9B,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QACtC,OAAO,IAAI,EAAE,CAAC;YACb,IAAI,KAAK,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC;YAC3B,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBACZ,KAAK,CAAC;YACP,CAAC;YAED,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACtC,QAAQ,CAAC;YACV,CAAC;YAED,EAAE,CAAC,CAAC,KAAK,YAAY,6BAAa,CAAC,CAAC,CAAC;gBACpC,QAAQ,CAAC;YACV,CAAC;YAED,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,yBAAyB,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC;YACd,CAAC;YAED,IAAI,eAAe,GAAG,aAAa,GAAG,KAAK,CAAC,4BAA4B,GAAG,KAAK,CAAC,mBAAmB,CAAC;YACrG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,IAAI,CAAC,GAAG,aAAa,GAAG,KAAK,CAAC,sBAAsB,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBAC9E,EAAE,CAAC,CAAC,CAAC,CAAC,iBAAiB,oBAA2B,CAAC,CAAC,CAAC;oBACpD,MAAM,CAAC,KAAK,CAAC;gBACd,CAAC;gBAED,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACzB,CAAC;QACF,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAES,MAAM,CAAC,KAAK,CAAC,CAAS;QAC/B,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAES,MAAM,CAAC,OAAO,CAAC,IAAiB,EAAE,MAAc;QACzD,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACxD,CAAC;IAES,MAAM,CAAC,MAAM,CAAC,IAAiB,EAAE,MAAc;QACxD,IAAI,YAAY,GAAW,eAAe,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACjE,IAAI,WAAW,GAAW,eAAe,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;QACpE,IAAI,WAAW,GAAW,eAAe,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;QACpE,IAAI,WAAW,GAAW,eAAe,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,IAAI,WAAI,CAAC,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,YAAY,CAAC,CAAC;IACtE,CAAC;IAGS,WAAW,CAAU,GAAQ,EACtC,IAAoB,EAAE,GAAW,EAAE,GAAW,EAC9C,IAAY,EAAE,IAAY,EAAE,IAAY,EACxC,IAAmB;QACnB,IAAI,MAAM,GAAa,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACd,sBAA6B,MAAM,CAAC,IAAI,qCAAiB,CAAC,MAAM,CAAC,CAAC;YAClE;gBACC,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;oBAChB,MAAM,CAAC,IAAI,iCAAe,CAAC,MAAM,EAAE,aAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBACrD,CAAC;gBACD,IAAI,CAAC,CAAC;oBACL,MAAM,CAAC,IAAI,iCAAe,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;gBAChD,CAAC;YACF;gBACC,IAAI,EAAE,GAAmB,IAAI,+BAAc,CAAiB,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;gBAClG,MAAM,CAAC,EAAE,CAAC;YACX;gBACC,IAAI,EAAE,GAAwB,IAAI,yCAAmB,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC;gBACtF,MAAM,CAAC,EAAE,CAAC;YACX;gBACC,MAAM,CAAC,IAAI,6DAA6B,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACxD;gBACC,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;oBAChB,MAAM,CAAC,IAAI,+BAAc,CAAC,MAAM,EAAE,aAAK,CAAC,GAAG,CAAC,CAAC;gBAC9C,CAAC;gBACD,IAAI,CAAC,CAAC;oBACL,MAAM,CAAC,IAAI,+BAAc,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBACzC,CAAC;YACF;gBACC,IAAI,CAAC,GAAqB,IAAI,mCAAgB,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC;gBAC/E,MAAM,CAAC,CAAC,CAAC;YACV,kBAAyB,MAAM,CAAC,IAAI,6BAAa,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACtE,sBAA6B,MAAM,CAAC,IAAI,mCAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7E,uBAA8B,MAAM,CAAC,IAAI,uCAAkB,CAAC,MAAM,CAAC,CAAC;QACrE,CAAC;QAED,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;IAChE,CAAC;IAES,YAAY,CAAC,IAAkB,EAAE,SAAiB;QAC3D,IAAI,CAAW,CAAC;QAChB,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACd,2BAAgC,MAAM,CAAC,IAAI,2BAAY,EAAE,CAAC;YAC1D;gBAAyB,CAAC,GAAG,IAAI,uBAAU,EAAE,CAAC;gBAAC,KAAK,CAAC;YACrD;gBAA8B,CAAC,GAAG,IAAI,+BAAc,EAAE,CAAC;gBAAC,KAAK,CAAC;YAC9D;gBAA+B,CAAC,GAAG,IAAI,2CAAoB,EAAE,CAAC;gBAAC,KAAK,CAAC;YACrE;gBAAoC,CAAC,GAAG,IAAI,yCAAmB,EAAE,CAAC;gBAAC,KAAK,CAAC;YACzE;gBAAoC,CAAC,GAAG,IAAI,yCAAmB,EAAE,CAAC;gBAAC,KAAK,CAAC;YACzE;gBAA+B,CAAC,GAAG,IAAI,mCAAgB,EAAE,CAAC;gBAAC,KAAK,CAAC;YACjE;gBAA6B,CAAC,GAAG,IAAI,6BAAa,EAAE,CAAC;gBAAC,KAAK,CAAC;YAC5D;gBAA6B,CAAC,GAAG,IAAI,6BAAa,EAAE,CAAC;gBAAC,KAAK,CAAC;YAC5D;gBAAkC,CAAC,GAAG,IAAI,qCAAiB,EAAE,CAAC;gBAAC,KAAK,CAAC;YACrE;gBAAmC,CAAC,GAAG,IAAI,uCAAkB,EAAE,CAAC;gBAAC,KAAK,CAAC;YACvE;gBAAkC,CAAC,GAAG,IAAI,qCAAiB,EAAE,CAAC;gBAAC,KAAK,CAAC;YACrE;gBAA4B,CAAC,GAAG,IAAI,2BAAY,EAAE,CAAC;gBAAC,KAAK,CAAC;YAC1D;gBACC,IAAI,OAAO,GAAW,4BAA4B,IAAI,gBAAgB,CAAC;gBACvE,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;QAC3B,CAAC;QAED,CAAC,CAAC,SAAS,GAAG,SAAS,CAAC;QACxB,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAES,kBAAkB,CAAC,IAAqB,EAAE,KAAa,EAAE,KAAa;QAC/E,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACf;gBACC,MAAM,CAAC,IAAI,uCAAkB,CAAC,KAAK,CAAC,CAAC;YAEtC;gBACC,MAAM,CAAC,IAAI,qCAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAE5C;gBACC,MAAM,CAAC,IAAI,iCAAe,CAAC,KAAK,CAAC,CAAC;YAEnC;gBACC,MAAM,CAAC,iCAAe,CAAC,QAAQ,CAAC;YAEjC;gBACC,MAAM,CAAC,uCAAkB,CAAC,QAAQ,CAAC;YAEpC;gBACC,MAAM,CAAC,IAAI,yCAAmB,CAAC,KAAK,CAAC,CAAC;YAEvC;gBACC,MAAM,CAAC,iCAAe,CAAC,QAAQ,CAAC;YAEjC;gBACC,MAAM,CAAC,IAAI,iCAAe,CAAC,KAAK,CAAC,CAAC;YAEnC;gBACC,IAAI,OAAO,GAAW,mCAAmC,IAAI,gBAAgB,CAAC;gBAC9E,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC;IACF,CAAC;;AAhnCD;;GAEG;AAEH;;GAEG;AACqB,oCAAoB,GAAS,WAAI,CAAC,UAAU,CAAC,sCAAsC,CAAC,CAAC;AAC7G;;;;GAIG;AACqB,mCAAmB,GAAS,WAAI,CAAC,UAAU,CAAC,sCAAsC,CAAC,CAAC;AAC5G;;;;GAIG;AACqB,iCAAiB,GAAS,WAAI,CAAC,UAAU,CAAC,sCAAsC,CAAC,CAAC;AAC1G;;;GAGG;AACqB,+BAAe,GAAW;IACjD,eAAe,CAAC,oBAAoB;IACpC,eAAe,CAAC,mBAAmB;IACnC,eAAe,CAAC,iBAAiB;CACjC,CAAC;AAEF;;GAEG;AACqB,+BAAe,GAAS,eAAe,CAAC,iBAAiB,CAAC;AAGlF;IADC,oBAAO;+DAC2D;AAgCnE;IAAa,WAAA,oBAAO,CAAA;kDA2bnB;AAsCD;IAAmC,WAAA,oBAAO,CAAA;8DAyCzC;AAmcD;IADC,oBAAO;IACe,WAAA,oBAAO,CAAA;kDAsC7B;AA/jCF,0CAynCC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATNSimulator.d.ts b/node_modules/antlr4ts/atn/ATNSimulator.d.ts
deleted file mode 100644
index 87edc95..0000000
--- a/node_modules/antlr4ts/atn/ATNSimulator.d.ts
+++ /dev/null
@@ -1,28 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATN } from './ATN';
-import { DFAState } from '../dfa/DFAState';
-export declare abstract class ATNSimulator {
- /** Must distinguish between missing edge and edge we know leads nowhere */
- private static _ERROR;
- static readonly ERROR: DFAState;
- atn: ATN;
- constructor(atn: ATN);
- abstract reset(): void;
- /**
- * Clear the DFA cache used by the current instance. Since the DFA cache may
- * be shared by multiple ATN simulators, this method may affect the
- * performance (but not accuracy) of other parsers which are being used
- * concurrently.
- *
- * @ if the current instance does not
- * support clearing the DFA.
- *
- * @since 4.3
- */
- clearDFA(): void;
-}
-export declare namespace ATNSimulator {
-}
diff --git a/node_modules/antlr4ts/atn/ATNSimulator.js b/node_modules/antlr4ts/atn/ATNSimulator.js
deleted file mode 100644
index e8b54b7..0000000
--- a/node_modules/antlr4ts/atn/ATNSimulator.js
+++ /dev/null
@@ -1,62 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const ATNConfigSet_1 = require("./ATNConfigSet");
-const DFAState_1 = require("../dfa/DFAState");
-const Decorators_1 = require("../Decorators");
-const PredictionContext_1 = require("./PredictionContext");
-let ATNSimulator = class ATNSimulator {
- constructor(atn) {
- this.atn = atn;
- }
- static get ERROR() {
- if (!ATNSimulator._ERROR) {
- ATNSimulator._ERROR = new DFAState_1.DFAState(new ATNConfigSet_1.ATNConfigSet());
- ATNSimulator._ERROR.stateNumber = PredictionContext_1.PredictionContext.EMPTY_FULL_STATE_KEY;
- }
- return ATNSimulator._ERROR;
- }
- /**
- * Clear the DFA cache used by the current instance. Since the DFA cache may
- * be shared by multiple ATN simulators, this method may affect the
- * performance (but not accuracy) of other parsers which are being used
- * concurrently.
- *
- * @ if the current instance does not
- * support clearing the DFA.
- *
- * @since 4.3
- */
- clearDFA() {
- this.atn.clearDFA();
- }
-};
-__decorate([
- Decorators_1.NotNull
-], ATNSimulator.prototype, "atn", void 0);
-__decorate([
- Decorators_1.NotNull
-], ATNSimulator, "ERROR", null);
-ATNSimulator = __decorate([
- __param(0, Decorators_1.NotNull)
-], ATNSimulator);
-exports.ATNSimulator = ATNSimulator;
-(function (ATNSimulator) {
- const RULE_VARIANT_DELIMITER = '$';
- const RULE_LF_VARIANT_MARKER = "$lf$";
- const RULE_NOLF_VARIANT_MARKER = "$nolf$";
-})(ATNSimulator = exports.ATNSimulator || (exports.ATNSimulator = {}));
-exports.ATNSimulator = ATNSimulator;
-//# sourceMappingURL=ATNSimulator.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATNSimulator.js.map b/node_modules/antlr4ts/atn/ATNSimulator.js.map
deleted file mode 100644
index 0413907..0000000
--- a/node_modules/antlr4ts/atn/ATNSimulator.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ATNSimulator.js","sourceRoot":"","sources":["../../../src/atn/ATNSimulator.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAKH,iDAA8C;AAC9C,8CAA2C;AAC3C,8CAAwC;AACxC,2DAAwD;AAExD,IAAsB,YAAY,GAAlC;IAgBC,YAAqB,GAAQ;QAC5B,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IAChB,CAAC;IAdD,MAAM,KAAK,KAAK;QACf,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;YAC1B,YAAY,CAAC,MAAM,GAAG,IAAI,mBAAQ,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;YACvD,YAAY,CAAC,MAAM,CAAC,WAAW,GAAG,qCAAiB,CAAC,oBAAoB,CAAC;QAC1E,CAAC;QAED,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC;IAC5B,CAAC;IAWD;;;;;;;;;;OAUG;IACH,QAAQ;QACP,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IACrB,CAAC;CACD,CAAA;AAtBA;IADC,oBAAO;yCACC;AAVT;IADC,oBAAO;+BAQP;AAXoB,YAAY;IAgBpB,WAAA,oBAAO,CAAA;GAhBC,YAAY,CAoCjC;AApCqB,oCAAY;AAsClC,WAAiB,YAAY;IAC5B,MAAM,sBAAsB,GAAW,GAAG,CAAC;IAC3C,MAAM,sBAAsB,GAAW,MAAM,CAAC;IAC9C,MAAM,wBAAwB,GAAW,QAAQ,CAAC;AACnD,CAAC,EAJgB,YAAY,GAAZ,oBAAY,KAAZ,oBAAY,QAI5B;AA1CqB,oCAAY"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATNState.d.ts b/node_modules/antlr4ts/atn/ATNState.d.ts
deleted file mode 100644
index 8848360..0000000
--- a/node_modules/antlr4ts/atn/ATNState.d.ts
+++ /dev/null
@@ -1,116 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATN } from './ATN';
-import { ATNStateType } from './ATNStateType';
-import { IntervalSet } from '../misc/IntervalSet';
-import { Transition } from './Transition';
-/**
- * The following images show the relation of states and
- * {@link ATNState#transitions} for various grammar constructs.
- *
- *
- *
- * - Solid edges marked with an ε indicate a required
- * {@link EpsilonTransition}.
- *
- * - Dashed edges indicate locations where any transition derived from
- * {@link Transition} might appear.
- *
- * - Dashed nodes are place holders for either a sequence of linked
- * {@link BasicState} states or the inclusion of a block representing a nested
- * construct in one of the forms below.
- *
- * - Nodes showing multiple outgoing alternatives with a {@code ...} support
- * any number of alternatives (one or more). Nodes without the {@code ...} only
- * support the exact number of alternatives shown in the diagram.
- *
- *
- *
- * Basic Blocks
- *
- * Rule
- *
- *
- *
- * Block of 1 or more alternatives
- *
- *
- *
- * Greedy Loops
- *
- * Greedy Closure: {@code (...)*}
- *
- *
- *
- * Greedy Positive Closure: {@code (...)+}
- *
- *
- *
- * Greedy Optional: {@code (...)?}
- *
- *
- *
- * Non-Greedy Loops
- *
- * Non-Greedy Closure: {@code (...)*?}
- *
- *
- *
- * Non-Greedy Positive Closure: {@code (...)+?}
- *
- *
- *
- * Non-Greedy Optional: {@code (...)??}
- *
- *
- */
-export declare abstract class ATNState {
- private static readonly serializationNames;
- /** Which ATN are we in? */
- atn?: ATN;
- stateNumber: number;
- ruleIndex: number;
- epsilonOnlyTransitions: boolean;
- /** Track the transitions emanating from this ATN state. */
- protected transitions: Transition[];
- protected optimizedTransitions: Transition[];
- /** Used to cache lookahead during parsing, not used during construction */
- nextTokenWithinRule?: IntervalSet;
- /**
- * Gets the state number.
- *
- * @return the state number
- */
- getStateNumber(): number;
- /**
- * For all states except {@link RuleStopState}, this returns the state
- * number. Returns -1 for stop states.
- *
- * @return -1 for {@link RuleStopState}, otherwise the state number
- */
- readonly nonStopStateNumber: number;
- hashCode(): number;
- equals(o: any): boolean;
- readonly isNonGreedyExitState: boolean;
- toString(): string;
- getTransitions(): Transition[];
- readonly numberOfTransitions: number;
- addTransition(e: Transition, index?: number): void;
- transition(i: number): Transition;
- setTransition(i: number, e: Transition): void;
- removeTransition(index: number): Transition;
- readonly abstract stateType: ATNStateType;
- readonly onlyHasEpsilonTransitions: boolean;
- setRuleIndex(ruleIndex: number): void;
- readonly isOptimized: boolean;
- readonly numberOfOptimizedTransitions: number;
- getOptimizedTransition(i: number): Transition;
- addOptimizedTransition(e: Transition): void;
- setOptimizedTransition(i: number, e: Transition): void;
- removeOptimizedTransition(i: number): void;
-}
-export declare namespace ATNState {
- const INVALID_STATE_NUMBER: number;
-}
diff --git a/node_modules/antlr4ts/atn/ATNState.js b/node_modules/antlr4ts/atn/ATNState.js
deleted file mode 100644
index e80bd82..0000000
--- a/node_modules/antlr4ts/atn/ATNState.js
+++ /dev/null
@@ -1,204 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const Decorators_1 = require("../Decorators");
-const INITIAL_NUM_TRANSITIONS = 4;
-/**
- * The following images show the relation of states and
- * {@link ATNState#transitions} for various grammar constructs.
- *
- *
- *
- * - Solid edges marked with an ε indicate a required
- * {@link EpsilonTransition}.
- *
- * - Dashed edges indicate locations where any transition derived from
- * {@link Transition} might appear.
- *
- * - Dashed nodes are place holders for either a sequence of linked
- * {@link BasicState} states or the inclusion of a block representing a nested
- * construct in one of the forms below.
- *
- * - Nodes showing multiple outgoing alternatives with a {@code ...} support
- * any number of alternatives (one or more). Nodes without the {@code ...} only
- * support the exact number of alternatives shown in the diagram.
- *
- *
- *
- * Basic Blocks
- *
- * Rule
- *
- *
- *
- * Block of 1 or more alternatives
- *
- *
- *
- * Greedy Loops
- *
- * Greedy Closure: {@code (...)*}
- *
- *
- *
- * Greedy Positive Closure: {@code (...)+}
- *
- *
- *
- * Greedy Optional: {@code (...)?}
- *
- *
- *
- * Non-Greedy Loops
- *
- * Non-Greedy Closure: {@code (...)*?}
- *
- *
- *
- * Non-Greedy Positive Closure: {@code (...)+?}
- *
- *
- *
- * Non-Greedy Optional: {@code (...)??}
- *
- *
- */
-class ATNState {
- constructor() {
- this.stateNumber = ATNState.INVALID_STATE_NUMBER;
- this.ruleIndex = 0; // at runtime, we don't have Rule objects
- this.epsilonOnlyTransitions = false;
- /** Track the transitions emanating from this ATN state. */
- this.transitions = [];
- this.optimizedTransitions = this.transitions;
- }
- /**
- * Gets the state number.
- *
- * @return the state number
- */
- getStateNumber() {
- return this.stateNumber;
- }
- /**
- * For all states except {@link RuleStopState}, this returns the state
- * number. Returns -1 for stop states.
- *
- * @return -1 for {@link RuleStopState}, otherwise the state number
- */
- get nonStopStateNumber() {
- return this.getStateNumber();
- }
- hashCode() {
- return this.stateNumber;
- }
- equals(o) {
- // are these states same object?
- if (o instanceof ATNState) {
- return this.stateNumber === o.stateNumber;
- }
- return false;
- }
- get isNonGreedyExitState() {
- return false;
- }
- toString() {
- return String(this.stateNumber);
- }
- getTransitions() {
- return this.transitions.slice(0);
- }
- get numberOfTransitions() {
- return this.transitions.length;
- }
- addTransition(e, index) {
- if (this.transitions.length === 0) {
- this.epsilonOnlyTransitions = e.isEpsilon;
- }
- else if (this.epsilonOnlyTransitions !== e.isEpsilon) {
- this.epsilonOnlyTransitions = false;
- throw new Error("ATN state " + this.stateNumber + " has both epsilon and non-epsilon transitions.");
- }
- this.transitions.splice(index !== undefined ? index : this.transitions.length, 0, e);
- }
- transition(i) {
- return this.transitions[i];
- }
- setTransition(i, e) {
- this.transitions[i] = e;
- }
- removeTransition(index) {
- return this.transitions.splice(index, 1)[0];
- }
- get onlyHasEpsilonTransitions() {
- return this.epsilonOnlyTransitions;
- }
- setRuleIndex(ruleIndex) {
- this.ruleIndex = ruleIndex;
- }
- get isOptimized() {
- return this.optimizedTransitions !== this.transitions;
- }
- get numberOfOptimizedTransitions() {
- return this.optimizedTransitions.length;
- }
- getOptimizedTransition(i) {
- return this.optimizedTransitions[i];
- }
- addOptimizedTransition(e) {
- if (!this.isOptimized) {
- this.optimizedTransitions = new Array();
- }
- this.optimizedTransitions.push(e);
- }
- setOptimizedTransition(i, e) {
- if (!this.isOptimized) {
- throw new Error("This ATNState is not optimized.");
- }
- this.optimizedTransitions[i] = e;
- }
- removeOptimizedTransition(i) {
- if (!this.isOptimized) {
- throw new Error("This ATNState is not optimized.");
- }
- this.optimizedTransitions.splice(i, 1);
- }
-}
-ATNState.serializationNames = [
- "INVALID",
- "BASIC",
- "RULE_START",
- "BLOCK_START",
- "PLUS_BLOCK_START",
- "STAR_BLOCK_START",
- "TOKEN_START",
- "RULE_STOP",
- "BLOCK_END",
- "STAR_LOOP_BACK",
- "STAR_LOOP_ENTRY",
- "PLUS_LOOP_BACK",
- "LOOP_END"
-];
-__decorate([
- Decorators_1.Override
-], ATNState.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], ATNState.prototype, "equals", null);
-__decorate([
- Decorators_1.Override
-], ATNState.prototype, "toString", null);
-exports.ATNState = ATNState;
-(function (ATNState) {
- ATNState.INVALID_STATE_NUMBER = -1;
-})(ATNState = exports.ATNState || (exports.ATNState = {}));
-//# sourceMappingURL=ATNState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATNState.js.map b/node_modules/antlr4ts/atn/ATNState.js.map
deleted file mode 100644
index c796bf2..0000000
--- a/node_modules/antlr4ts/atn/ATNState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ATNState.js","sourceRoot":"","sources":["../../../src/atn/ATNState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAOH,8CAAyC;AAGzC,MAAM,uBAAuB,GAAW,CAAC,CAAC;AAE1C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2DG;AACH;IAAA;QAoBC,gBAAW,GAAW,QAAQ,CAAC,oBAAoB,CAAC;QAEpD,cAAS,GAAW,CAAC,CAAC,CAAE,yCAAyC;QAEjE,2BAAsB,GAAY,KAAK,CAAC;QAExC,2DAA2D;QACjD,gBAAW,GAAiB,EAAE,CAAC;QAE/B,yBAAoB,GAAiB,IAAI,CAAC,WAAW,CAAC;IA6HjE,CAAC;IAxHA;;;;OAIG;IACH,cAAc;QACb,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC;IACzB,CAAC;IAED;;;;;OAKG;IACH,IAAI,kBAAkB;QACrB,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;IAC9B,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC;IACzB,CAAC;IAGD,MAAM,CAAC,CAAM;QACZ,gCAAgC;QAChC,EAAE,CAAC,CAAC,CAAC,YAAY,QAAQ,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,WAAW,KAAK,CAAC,CAAC,WAAW,CAAC;QAC3C,CAAC;QAED,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED,IAAI,oBAAoB;QACvB,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACjC,CAAC;IAED,cAAc;QACb,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,IAAI,mBAAmB;QACtB,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;IAChC,CAAC;IAED,aAAa,CAAC,CAAa,EAAE,KAAc;QAC1C,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,CAAC,sBAAsB,GAAG,CAAC,CAAC,SAAS,CAAC;QAC3C,CAAC;QACD,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,sBAAsB,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YACtD,IAAI,CAAC,sBAAsB,GAAG,KAAK,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,WAAW,GAAG,gDAAgD,CAAC,CAAC;QACrG,CAAC;QAED,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS,GAAG,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACtF,CAAC;IAED,UAAU,CAAC,CAAS;QACnB,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC;IAED,aAAa,CAAC,CAAS,EAAE,CAAa;QACrC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;IAED,gBAAgB,CAAC,KAAa;QAC7B,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC;IAID,IAAI,yBAAyB;QAC5B,MAAM,CAAC,IAAI,CAAC,sBAAsB,CAAC;IACpC,CAAC;IAED,YAAY,CAAC,SAAiB;QAC7B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC5B,CAAC;IAED,IAAI,WAAW;QACd,MAAM,CAAC,IAAI,CAAC,oBAAoB,KAAK,IAAI,CAAC,WAAW,CAAC;IACvD,CAAC;IAED,IAAI,4BAA4B;QAC/B,MAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC;IACzC,CAAC;IAED,sBAAsB,CAAC,CAAS;QAC/B,MAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;IAED,sBAAsB,CAAC,CAAa;QACnC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YACvB,IAAI,CAAC,oBAAoB,GAAG,IAAI,KAAK,EAAc,CAAC;QACrD,CAAC;QAED,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IAED,sBAAsB,CAAC,CAAS,EAAE,CAAa;QAC9C,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;QACpD,CAAC;QAED,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC;IAED,yBAAyB,CAAC,CAAS;QAClC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;QACpD,CAAC;QAED,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxC,CAAC;;AAxJuB,2BAAkB,GAAa;IACtD,SAAS;IACT,OAAO;IACP,YAAY;IACZ,aAAa;IACb,kBAAkB;IAClB,kBAAkB;IAClB,aAAa;IACb,WAAW;IACX,WAAW;IACX,gBAAgB;IAChB,iBAAiB;IACjB,gBAAgB;IAChB,UAAU;CACV,CAAC;AAuCF;IADC,qBAAQ;wCAGR;AAGD;IADC,qBAAQ;sCAQR;AAOD;IADC,qBAAQ;wCAGR;AA3EF,4BA0JC;AAED,WAAiB,QAAQ;IACX,6BAAoB,GAAW,CAAC,CAAC,CAAC;AAChD,CAAC,EAFgB,QAAQ,GAAR,gBAAQ,KAAR,gBAAQ,QAExB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATNStateType.d.ts b/node_modules/antlr4ts/atn/ATNStateType.d.ts
deleted file mode 100644
index a08c640..0000000
--- a/node_modules/antlr4ts/atn/ATNStateType.d.ts
+++ /dev/null
@@ -1,19 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-export declare const enum ATNStateType {
- INVALID_TYPE = 0,
- BASIC = 1,
- RULE_START = 2,
- BLOCK_START = 3,
- PLUS_BLOCK_START = 4,
- STAR_BLOCK_START = 5,
- TOKEN_START = 6,
- RULE_STOP = 7,
- BLOCK_END = 8,
- STAR_LOOP_BACK = 9,
- STAR_LOOP_ENTRY = 10,
- PLUS_LOOP_BACK = 11,
- LOOP_END = 12,
-}
diff --git a/node_modules/antlr4ts/atn/ATNStateType.js b/node_modules/antlr4ts/atn/ATNStateType.js
deleted file mode 100644
index 8996755..0000000
--- a/node_modules/antlr4ts/atn/ATNStateType.js
+++ /dev/null
@@ -1,24 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:27.4734328-07:00
-var ATNStateType;
-(function (ATNStateType) {
- ATNStateType[ATNStateType["INVALID_TYPE"] = 0] = "INVALID_TYPE";
- ATNStateType[ATNStateType["BASIC"] = 1] = "BASIC";
- ATNStateType[ATNStateType["RULE_START"] = 2] = "RULE_START";
- ATNStateType[ATNStateType["BLOCK_START"] = 3] = "BLOCK_START";
- ATNStateType[ATNStateType["PLUS_BLOCK_START"] = 4] = "PLUS_BLOCK_START";
- ATNStateType[ATNStateType["STAR_BLOCK_START"] = 5] = "STAR_BLOCK_START";
- ATNStateType[ATNStateType["TOKEN_START"] = 6] = "TOKEN_START";
- ATNStateType[ATNStateType["RULE_STOP"] = 7] = "RULE_STOP";
- ATNStateType[ATNStateType["BLOCK_END"] = 8] = "BLOCK_END";
- ATNStateType[ATNStateType["STAR_LOOP_BACK"] = 9] = "STAR_LOOP_BACK";
- ATNStateType[ATNStateType["STAR_LOOP_ENTRY"] = 10] = "STAR_LOOP_ENTRY";
- ATNStateType[ATNStateType["PLUS_LOOP_BACK"] = 11] = "PLUS_LOOP_BACK";
- ATNStateType[ATNStateType["LOOP_END"] = 12] = "LOOP_END";
-})(ATNStateType = exports.ATNStateType || (exports.ATNStateType = {}));
-//# sourceMappingURL=ATNStateType.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATNStateType.js.map b/node_modules/antlr4ts/atn/ATNStateType.js.map
deleted file mode 100644
index 9531dac..0000000
--- a/node_modules/antlr4ts/atn/ATNStateType.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ATNStateType.js","sourceRoot":"","sources":["../../../src/atn/ATNStateType.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,wDAAwD;AAExD,IAAkB,YAcjB;AAdD,WAAkB,YAAY;IAC7B,+DAAgB,CAAA;IAChB,iDAAS,CAAA;IACT,2DAAc,CAAA;IACd,6DAAe,CAAA;IACf,uEAAoB,CAAA;IACpB,uEAAoB,CAAA;IACpB,6DAAe,CAAA;IACf,yDAAa,CAAA;IACb,yDAAa,CAAA;IACb,mEAAkB,CAAA;IAClB,sEAAoB,CAAA;IACpB,oEAAmB,CAAA;IACnB,wDAAa,CAAA;AACd,CAAC,EAdiB,YAAY,GAAZ,oBAAY,KAAZ,oBAAY,QAc7B"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATNType.d.ts b/node_modules/antlr4ts/atn/ATNType.d.ts
deleted file mode 100644
index f0ada42..0000000
--- a/node_modules/antlr4ts/atn/ATNType.d.ts
+++ /dev/null
@@ -1,19 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-/**
- * Represents the type of recognizer an ATN applies to.
- *
- * @author Sam Harwell
- */
-export declare const enum ATNType {
- /**
- * A lexer grammar.
- */
- LEXER = 0,
- /**
- * A parser grammar.
- */
- PARSER = 1,
-}
diff --git a/node_modules/antlr4ts/atn/ATNType.js b/node_modules/antlr4ts/atn/ATNType.js
deleted file mode 100644
index 040042c..0000000
--- a/node_modules/antlr4ts/atn/ATNType.js
+++ /dev/null
@@ -1,24 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:27.6094030-07:00
-/**
- * Represents the type of recognizer an ATN applies to.
- *
- * @author Sam Harwell
- */
-var ATNType;
-(function (ATNType) {
- /**
- * A lexer grammar.
- */
- ATNType[ATNType["LEXER"] = 0] = "LEXER";
- /**
- * A parser grammar.
- */
- ATNType[ATNType["PARSER"] = 1] = "PARSER";
-})(ATNType = exports.ATNType || (exports.ATNType = {}));
-//# sourceMappingURL=ATNType.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ATNType.js.map b/node_modules/antlr4ts/atn/ATNType.js.map
deleted file mode 100644
index f2fe4dc..0000000
--- a/node_modules/antlr4ts/atn/ATNType.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ATNType.js","sourceRoot":"","sources":["../../../src/atn/ATNType.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,wDAAwD;AAExD;;;;GAIG;AACH,IAAkB,OAYjB;AAZD,WAAkB,OAAO;IAExB;;OAEG;IACH,uCAAK,CAAA;IAEL;;OAEG;IACH,yCAAM,CAAA;AAEP,CAAC,EAZiB,OAAO,GAAP,eAAO,KAAP,eAAO,QAYxB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/AbstractPredicateTransition.d.ts b/node_modules/antlr4ts/atn/AbstractPredicateTransition.d.ts
deleted file mode 100644
index ebbfc5b..0000000
--- a/node_modules/antlr4ts/atn/AbstractPredicateTransition.d.ts
+++ /dev/null
@@ -1,13 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { Transition } from './Transition';
-/**
- *
- * @author Sam Harwell
- */
-export declare abstract class AbstractPredicateTransition extends Transition {
- constructor(target: ATNState);
-}
diff --git a/node_modules/antlr4ts/atn/AbstractPredicateTransition.js b/node_modules/antlr4ts/atn/AbstractPredicateTransition.js
deleted file mode 100644
index 9e8fca3..0000000
--- a/node_modules/antlr4ts/atn/AbstractPredicateTransition.js
+++ /dev/null
@@ -1,18 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-const Transition_1 = require("./Transition");
-/**
- *
- * @author Sam Harwell
- */
-class AbstractPredicateTransition extends Transition_1.Transition {
- constructor(target) {
- super(target);
- }
-}
-exports.AbstractPredicateTransition = AbstractPredicateTransition;
-//# sourceMappingURL=AbstractPredicateTransition.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/AbstractPredicateTransition.js.map b/node_modules/antlr4ts/atn/AbstractPredicateTransition.js.map
deleted file mode 100644
index be4b375..0000000
--- a/node_modules/antlr4ts/atn/AbstractPredicateTransition.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"AbstractPredicateTransition.js","sourceRoot":"","sources":["../../../src/atn/AbstractPredicateTransition.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAKH,6CAA0C;AAE1C;;;GAGG;AACH,iCAAkD,SAAQ,uBAAU;IAEnE,YAAY,MAAgB;QAC3B,KAAK,CAAC,MAAM,CAAC,CAAC;IACf,CAAC;CAED;AAND,kEAMC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ActionTransition.d.ts b/node_modules/antlr4ts/atn/ActionTransition.d.ts
deleted file mode 100644
index 730b9cc..0000000
--- a/node_modules/antlr4ts/atn/ActionTransition.d.ts
+++ /dev/null
@@ -1,17 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { Transition } from './Transition';
-import { TransitionType } from './TransitionType';
-export declare class ActionTransition extends Transition {
- ruleIndex: number;
- actionIndex: number;
- isCtxDependent: boolean;
- constructor(target: ATNState, ruleIndex: number, actionIndex?: number, isCtxDependent?: boolean);
- readonly serializationType: TransitionType;
- readonly isEpsilon: boolean;
- matches(symbol: number, minVocabSymbol: number, maxVocabSymbol: number): boolean;
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/atn/ActionTransition.js b/node_modules/antlr4ts/atn/ActionTransition.js
deleted file mode 100644
index d1a34b0..0000000
--- a/node_modules/antlr4ts/atn/ActionTransition.js
+++ /dev/null
@@ -1,54 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const Decorators_1 = require("../Decorators");
-const Transition_1 = require("./Transition");
-let ActionTransition = class ActionTransition extends Transition_1.Transition {
- constructor(target, ruleIndex, actionIndex = -1, isCtxDependent = false) {
- super(target);
- this.ruleIndex = ruleIndex;
- this.actionIndex = actionIndex;
- this.isCtxDependent = isCtxDependent;
- }
- get serializationType() {
- return 6 /* ACTION */;
- }
- get isEpsilon() {
- return true; // we are to be ignored by analysis 'cept for predicates
- }
- matches(symbol, minVocabSymbol, maxVocabSymbol) {
- return false;
- }
- toString() {
- return "action_" + this.ruleIndex + ":" + this.actionIndex;
- }
-};
-__decorate([
- Decorators_1.Override
-], ActionTransition.prototype, "serializationType", null);
-__decorate([
- Decorators_1.Override
-], ActionTransition.prototype, "isEpsilon", null);
-__decorate([
- Decorators_1.Override
-], ActionTransition.prototype, "matches", null);
-__decorate([
- Decorators_1.Override
-], ActionTransition.prototype, "toString", null);
-ActionTransition = __decorate([
- __param(0, Decorators_1.NotNull)
-], ActionTransition);
-exports.ActionTransition = ActionTransition;
-//# sourceMappingURL=ActionTransition.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ActionTransition.js.map b/node_modules/antlr4ts/atn/ActionTransition.js.map
deleted file mode 100644
index bcf5e15..0000000
--- a/node_modules/antlr4ts/atn/ActionTransition.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ActionTransition.js","sourceRoot":"","sources":["../../../src/atn/ActionTransition.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAKH,8CAAkD;AAClD,6CAA0C;AAG1C,IAAa,gBAAgB,GAA7B,sBAA8B,SAAQ,uBAAU;IAK/C,YAAqB,MAAgB,EAAE,SAAiB,EAAE,cAAsB,CAAC,CAAC,EAAE,iBAA0B,KAAK;QAClH,KAAK,CAAC,MAAM,CAAC,CAAC;QACd,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;IACtC,CAAC;IAGD,IAAI,iBAAiB;QACpB,MAAM,gBAAuB;IAC9B,CAAC;IAGD,IAAI,SAAS;QACZ,MAAM,CAAC,IAAI,CAAC,CAAC,wDAAwD;IACtE,CAAC;IAGD,OAAO,CAAC,MAAc,EAAE,cAAsB,EAAE,cAAsB;QACrE,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,GAAG,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC;IAC5D,CAAC;CACD,CAAA;AAlBA;IADC,qBAAQ;yDAGR;AAGD;IADC,qBAAQ;iDAGR;AAGD;IADC,qBAAQ;+CAGR;AAGD;IADC,qBAAQ;gDAGR;AA9BW,gBAAgB;IAKf,WAAA,oBAAO,CAAA;GALR,gBAAgB,CA+B5B;AA/BY,4CAAgB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/AmbiguityInfo.d.ts b/node_modules/antlr4ts/atn/AmbiguityInfo.d.ts
deleted file mode 100644
index 6096049..0000000
--- a/node_modules/antlr4ts/atn/AmbiguityInfo.d.ts
+++ /dev/null
@@ -1,62 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { BitSet } from '../misc/BitSet';
-import { DecisionEventInfo } from './DecisionEventInfo';
-import { SimulatorState } from './SimulatorState';
-import { TokenStream } from '../TokenStream';
-/**
- * This class represents profiling event information for an ambiguity.
- * Ambiguities are decisions where a particular input resulted in an SLL
- * conflict, followed by LL prediction also reaching a conflict state
- * (indicating a true ambiguity in the grammar).
- *
- *
- * This event may be reported during SLL prediction in cases where the
- * conflicting SLL configuration set provides sufficient information to
- * determine that the SLL conflict is truly an ambiguity. For example, if none
- * of the ATN configurations in the conflicting SLL configuration set have
- * traversed a global follow transition (i.e.
- * {@link ATNConfig#getReachesIntoOuterContext} is {@code false} for all
- * configurations), then the result of SLL prediction for that input is known to
- * be equivalent to the result of LL prediction for that input.
- *
- *
- * In some cases, the minimum represented alternative in the conflicting LL
- * configuration set is not equal to the minimum represented alternative in the
- * conflicting SLL configuration set. Grammars and inputs which result in this
- * scenario are unable to use {@link PredictionMode#SLL}, which in turn means
- * they cannot use the two-stage parsing strategy to improve parsing performance
- * for that input.
- *
- * @see ParserATNSimulator#reportAmbiguity
- * @see ParserErrorListener#reportAmbiguity
- *
- * @since 4.3
- */
-export declare class AmbiguityInfo extends DecisionEventInfo {
- /** The set of alternative numbers for this decision event that lead to a valid parse. */
- private ambigAlts;
- /**
- * Constructs a new instance of the {@link AmbiguityInfo} class with the
- * specified detailed ambiguity information.
- *
- * @param decision The decision number
- * @param state The final simulator state identifying the ambiguous
- * alternatives for the current input
- * @param ambigAlts The set of alternatives in the decision that lead to a valid parse.
- * The predicted alt is the min(ambigAlts)
- * @param input The input token stream
- * @param startIndex The start index for the current prediction
- * @param stopIndex The index at which the ambiguity was identified during
- * prediction
- */
- constructor(decision: number, state: SimulatorState, ambigAlts: BitSet, input: TokenStream, startIndex: number, stopIndex: number);
- /**
- * Gets the set of alternatives in the decision that lead to a valid parse.
- *
- * @since 4.5
- */
- readonly ambiguousAlternatives: BitSet;
-}
diff --git a/node_modules/antlr4ts/atn/AmbiguityInfo.js b/node_modules/antlr4ts/atn/AmbiguityInfo.js
deleted file mode 100644
index d2cbff3..0000000
--- a/node_modules/antlr4ts/atn/AmbiguityInfo.js
+++ /dev/null
@@ -1,87 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const DecisionEventInfo_1 = require("./DecisionEventInfo");
-const Decorators_1 = require("../Decorators");
-/**
- * This class represents profiling event information for an ambiguity.
- * Ambiguities are decisions where a particular input resulted in an SLL
- * conflict, followed by LL prediction also reaching a conflict state
- * (indicating a true ambiguity in the grammar).
- *
- *
- * This event may be reported during SLL prediction in cases where the
- * conflicting SLL configuration set provides sufficient information to
- * determine that the SLL conflict is truly an ambiguity. For example, if none
- * of the ATN configurations in the conflicting SLL configuration set have
- * traversed a global follow transition (i.e.
- * {@link ATNConfig#getReachesIntoOuterContext} is {@code false} for all
- * configurations), then the result of SLL prediction for that input is known to
- * be equivalent to the result of LL prediction for that input.
- *
- *
- * In some cases, the minimum represented alternative in the conflicting LL
- * configuration set is not equal to the minimum represented alternative in the
- * conflicting SLL configuration set. Grammars and inputs which result in this
- * scenario are unable to use {@link PredictionMode#SLL}, which in turn means
- * they cannot use the two-stage parsing strategy to improve parsing performance
- * for that input.
- *
- * @see ParserATNSimulator#reportAmbiguity
- * @see ParserErrorListener#reportAmbiguity
- *
- * @since 4.3
- */
-let AmbiguityInfo = class AmbiguityInfo extends DecisionEventInfo_1.DecisionEventInfo {
- /**
- * Constructs a new instance of the {@link AmbiguityInfo} class with the
- * specified detailed ambiguity information.
- *
- * @param decision The decision number
- * @param state The final simulator state identifying the ambiguous
- * alternatives for the current input
- * @param ambigAlts The set of alternatives in the decision that lead to a valid parse.
- * The predicted alt is the min(ambigAlts)
- * @param input The input token stream
- * @param startIndex The start index for the current prediction
- * @param stopIndex The index at which the ambiguity was identified during
- * prediction
- */
- constructor(decision, state, ambigAlts, input, startIndex, stopIndex) {
- super(decision, state, input, startIndex, stopIndex, state.useContext);
- this.ambigAlts = ambigAlts;
- }
- /**
- * Gets the set of alternatives in the decision that lead to a valid parse.
- *
- * @since 4.5
- */
- get ambiguousAlternatives() {
- return this.ambigAlts;
- }
-};
-__decorate([
- Decorators_1.NotNull
-], AmbiguityInfo.prototype, "ambigAlts", void 0);
-__decorate([
- Decorators_1.NotNull
-], AmbiguityInfo.prototype, "ambiguousAlternatives", null);
-AmbiguityInfo = __decorate([
- __param(1, Decorators_1.NotNull),
- __param(2, Decorators_1.NotNull),
- __param(3, Decorators_1.NotNull)
-], AmbiguityInfo);
-exports.AmbiguityInfo = AmbiguityInfo;
-//# sourceMappingURL=AmbiguityInfo.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/AmbiguityInfo.js.map b/node_modules/antlr4ts/atn/AmbiguityInfo.js.map
deleted file mode 100644
index 6bd75e0..0000000
--- a/node_modules/antlr4ts/atn/AmbiguityInfo.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"AmbiguityInfo.js","sourceRoot":"","sources":["../../../src/atn/AmbiguityInfo.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAKH,2DAAwD;AACxD,8CAAwC;AAIxC;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,IAAa,aAAa,GAA1B,mBAA2B,SAAQ,qCAAiB;IAKnD;;;;;;;;;;;;;OAaG;IACH,YACC,QAAgB,EACP,KAAqB,EACrB,SAAiB,EACjB,KAAkB,EAC3B,UAAkB,EAClB,SAAiB;QACjB,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;QACvE,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IAEH,IAAI,qBAAqB;QACxB,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;IACvB,CAAC;CACD,CAAA;AApCA;IADC,oBAAO;gDACkB;AAiC1B;IADC,oBAAO;0DAGP;AAtCW,aAAa;IAqBvB,WAAA,oBAAO,CAAA;IACP,WAAA,oBAAO,CAAA;IACP,WAAA,oBAAO,CAAA;GAvBG,aAAa,CAuCzB;AAvCY,sCAAa"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/AtomTransition.d.ts b/node_modules/antlr4ts/atn/AtomTransition.d.ts
deleted file mode 100644
index dcc61db..0000000
--- a/node_modules/antlr4ts/atn/AtomTransition.d.ts
+++ /dev/null
@@ -1,18 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { IntervalSet } from '../misc/IntervalSet';
-import { Transition } from './Transition';
-import { TransitionType } from './TransitionType';
-/** TODO: make all transitions sets? no, should remove set edges */
-export declare class AtomTransition extends Transition {
- /** The token type or character value; or, signifies special label. */
- _label: number;
- constructor(target: ATNState, label: number);
- readonly serializationType: TransitionType;
- readonly label: IntervalSet;
- matches(symbol: number, minVocabSymbol: number, maxVocabSymbol: number): boolean;
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/atn/AtomTransition.js b/node_modules/antlr4ts/atn/AtomTransition.js
deleted file mode 100644
index 61ac155..0000000
--- a/node_modules/antlr4ts/atn/AtomTransition.js
+++ /dev/null
@@ -1,56 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const IntervalSet_1 = require("../misc/IntervalSet");
-const Decorators_1 = require("../Decorators");
-const Transition_1 = require("./Transition");
-/** TODO: make all transitions sets? no, should remove set edges */
-let AtomTransition = class AtomTransition extends Transition_1.Transition {
- constructor(target, label) {
- super(target);
- this._label = label;
- }
- get serializationType() {
- return 5 /* ATOM */;
- }
- get label() {
- return IntervalSet_1.IntervalSet.of(this._label);
- }
- matches(symbol, minVocabSymbol, maxVocabSymbol) {
- return this._label === symbol;
- }
- toString() {
- return String(this.label);
- }
-};
-__decorate([
- Decorators_1.Override
-], AtomTransition.prototype, "serializationType", null);
-__decorate([
- Decorators_1.Override,
- Decorators_1.NotNull
-], AtomTransition.prototype, "label", null);
-__decorate([
- Decorators_1.Override
-], AtomTransition.prototype, "matches", null);
-__decorate([
- Decorators_1.Override,
- Decorators_1.NotNull
-], AtomTransition.prototype, "toString", null);
-AtomTransition = __decorate([
- __param(0, Decorators_1.NotNull)
-], AtomTransition);
-exports.AtomTransition = AtomTransition;
-//# sourceMappingURL=AtomTransition.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/AtomTransition.js.map b/node_modules/antlr4ts/atn/AtomTransition.js.map
deleted file mode 100644
index 8bd05c7..0000000
--- a/node_modules/antlr4ts/atn/AtomTransition.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"AtomTransition.js","sourceRoot":"","sources":["../../../src/atn/AtomTransition.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAKH,qDAAkD;AAClD,8CAAkD;AAClD,6CAA0C;AAG1C,mEAAmE;AACnE,IAAa,cAAc,GAA3B,oBAA4B,SAAQ,uBAAU;IAI7C,YAAqB,MAAgB,EAAE,KAAa;QACnD,KAAK,CAAC,MAAM,CAAC,CAAC;QACd,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACrB,CAAC;IAGD,IAAI,iBAAiB;QACpB,MAAM,cAAqB;IAC5B,CAAC;IAID,IAAI,KAAK;QACR,MAAM,CAAC,yBAAW,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IAGD,OAAO,CAAC,MAAc,EAAE,cAAsB,EAAE,cAAsB;QACrE,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC;IAC/B,CAAC;IAID,QAAQ;QACP,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;CACD,CAAA;AApBA;IADC,qBAAQ;uDAGR;AAID;IAFC,qBAAQ;IACR,oBAAO;2CAGP;AAGD;IADC,qBAAQ;6CAGR;AAID;IAFC,qBAAQ;IACR,oBAAO;8CAGP;AA7BW,cAAc;IAIb,WAAA,oBAAO,CAAA;GAJR,cAAc,CA8B1B;AA9BY,wCAAc"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/BasicBlockStartState.d.ts b/node_modules/antlr4ts/atn/BasicBlockStartState.d.ts
deleted file mode 100644
index ed40ad9..0000000
--- a/node_modules/antlr4ts/atn/BasicBlockStartState.d.ts
+++ /dev/null
@@ -1,13 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNStateType } from './ATNStateType';
-import { BlockStartState } from './BlockStartState';
-/**
- *
- * @author Sam Harwell
- */
-export declare class BasicBlockStartState extends BlockStartState {
- readonly stateType: ATNStateType;
-}
diff --git a/node_modules/antlr4ts/atn/BasicBlockStartState.js b/node_modules/antlr4ts/atn/BasicBlockStartState.js
deleted file mode 100644
index 5a0ea7f..0000000
--- a/node_modules/antlr4ts/atn/BasicBlockStartState.js
+++ /dev/null
@@ -1,28 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const BlockStartState_1 = require("./BlockStartState");
-const Decorators_1 = require("../Decorators");
-/**
- *
- * @author Sam Harwell
- */
-class BasicBlockStartState extends BlockStartState_1.BlockStartState {
- get stateType() {
- return 3 /* BLOCK_START */;
- }
-}
-__decorate([
- Decorators_1.Override
-], BasicBlockStartState.prototype, "stateType", null);
-exports.BasicBlockStartState = BasicBlockStartState;
-//# sourceMappingURL=BasicBlockStartState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/BasicBlockStartState.js.map b/node_modules/antlr4ts/atn/BasicBlockStartState.js.map
deleted file mode 100644
index 35a4ae6..0000000
--- a/node_modules/antlr4ts/atn/BasicBlockStartState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"BasicBlockStartState.js","sourceRoot":"","sources":["../../../src/atn/BasicBlockStartState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAKH,uDAAoD;AACpD,8CAAyC;AAEzC;;;GAGG;AACH,0BAAkC,SAAQ,iCAAe;IAGxD,IAAI,SAAS;QACZ,MAAM,qBAA0B;IACjC,CAAC;CAED;AAJA;IADC,qBAAQ;qDAGR;AALF,oDAOC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/BasicState.d.ts b/node_modules/antlr4ts/atn/BasicState.d.ts
deleted file mode 100644
index 5f81458..0000000
--- a/node_modules/antlr4ts/atn/BasicState.d.ts
+++ /dev/null
@@ -1,13 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { ATNStateType } from './ATNStateType';
-/**
- *
- * @author Sam Harwell
- */
-export declare class BasicState extends ATNState {
- readonly stateType: ATNStateType;
-}
diff --git a/node_modules/antlr4ts/atn/BasicState.js b/node_modules/antlr4ts/atn/BasicState.js
deleted file mode 100644
index 9d81a3e..0000000
--- a/node_modules/antlr4ts/atn/BasicState.js
+++ /dev/null
@@ -1,29 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:27.8389930-07:00
-const ATNState_1 = require("./ATNState");
-const Decorators_1 = require("../Decorators");
-/**
- *
- * @author Sam Harwell
- */
-class BasicState extends ATNState_1.ATNState {
- get stateType() {
- return 1 /* BASIC */;
- }
-}
-__decorate([
- Decorators_1.Override
-], BasicState.prototype, "stateType", null);
-exports.BasicState = BasicState;
-//# sourceMappingURL=BasicState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/BasicState.js.map b/node_modules/antlr4ts/atn/BasicState.js.map
deleted file mode 100644
index 9cd481c..0000000
--- a/node_modules/antlr4ts/atn/BasicState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"BasicState.js","sourceRoot":"","sources":["../../../src/atn/BasicState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAEH,wDAAwD;AAExD,yCAAsC;AAEtC,8CAAyC;AAEzC;;;GAGG;AACH,gBAAwB,SAAQ,mBAAQ;IAGvC,IAAI,SAAS;QACZ,MAAM,eAAoB;IAC3B,CAAC;CAED;AAJA;IADC,qBAAQ;2CAGR;AALF,gCAOC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/BlockEndState.d.ts b/node_modules/antlr4ts/atn/BlockEndState.d.ts
deleted file mode 100644
index a80a3b5..0000000
--- a/node_modules/antlr4ts/atn/BlockEndState.d.ts
+++ /dev/null
@@ -1,12 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { ATNStateType } from './ATNStateType';
-import { BlockStartState } from './BlockStartState';
-/** Terminal node of a simple {@code (a|b|c)} block. */
-export declare class BlockEndState extends ATNState {
- startState: BlockStartState;
- readonly stateType: ATNStateType;
-}
diff --git a/node_modules/antlr4ts/atn/BlockEndState.js b/node_modules/antlr4ts/atn/BlockEndState.js
deleted file mode 100644
index a15d4b7..0000000
--- a/node_modules/antlr4ts/atn/BlockEndState.js
+++ /dev/null
@@ -1,26 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:27.9125304-07:00
-const ATNState_1 = require("./ATNState");
-const Decorators_1 = require("../Decorators");
-/** Terminal node of a simple {@code (a|b|c)} block. */
-class BlockEndState extends ATNState_1.ATNState {
- get stateType() {
- return 8 /* BLOCK_END */;
- }
-}
-__decorate([
- Decorators_1.Override
-], BlockEndState.prototype, "stateType", null);
-exports.BlockEndState = BlockEndState;
-//# sourceMappingURL=BlockEndState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/BlockEndState.js.map b/node_modules/antlr4ts/atn/BlockEndState.js.map
deleted file mode 100644
index e6ea4e8..0000000
--- a/node_modules/antlr4ts/atn/BlockEndState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"BlockEndState.js","sourceRoot":"","sources":["../../../src/atn/BlockEndState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAEH,wDAAwD;AAExD,yCAAsC;AAGtC,8CAAyC;AAEzC,uDAAuD;AACvD,mBAA2B,SAAQ,mBAAQ;IAI1C,IAAI,SAAS;QACZ,MAAM,mBAAwB;IAC/B,CAAC;CACD;AAHA;IADC,qBAAQ;8CAGR;AANF,sCAOC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/BlockStartState.d.ts b/node_modules/antlr4ts/atn/BlockStartState.d.ts
deleted file mode 100644
index 0e8527b..0000000
--- a/node_modules/antlr4ts/atn/BlockStartState.d.ts
+++ /dev/null
@@ -1,10 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { BlockEndState } from './BlockEndState';
-import { DecisionState } from './DecisionState';
-/** The start of a regular {@code (...)} block. */
-export declare abstract class BlockStartState extends DecisionState {
- endState: BlockEndState;
-}
diff --git a/node_modules/antlr4ts/atn/BlockStartState.js b/node_modules/antlr4ts/atn/BlockStartState.js
deleted file mode 100644
index 171ddeb..0000000
--- a/node_modules/antlr4ts/atn/BlockStartState.js
+++ /dev/null
@@ -1,12 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-const DecisionState_1 = require("./DecisionState");
-/** The start of a regular {@code (...)} block. */
-class BlockStartState extends DecisionState_1.DecisionState {
-}
-exports.BlockStartState = BlockStartState;
-//# sourceMappingURL=BlockStartState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/BlockStartState.js.map b/node_modules/antlr4ts/atn/BlockStartState.js.map
deleted file mode 100644
index 09bc46e..0000000
--- a/node_modules/antlr4ts/atn/BlockStartState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"BlockStartState.js","sourceRoot":"","sources":["../../../src/atn/BlockStartState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAKH,mDAAgD;AAGhD,mDAAmD;AACnD,qBAAsC,SAAQ,6BAAa;CAE1D;AAFD,0CAEC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ConflictInfo.d.ts b/node_modules/antlr4ts/atn/ConflictInfo.d.ts
deleted file mode 100644
index f70d6f1..0000000
--- a/node_modules/antlr4ts/atn/ConflictInfo.d.ts
+++ /dev/null
@@ -1,36 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { BitSet } from '../misc/BitSet';
-/**
- * This class stores information about a configuration conflict.
- *
- * @author Sam Harwell
- */
-export declare class ConflictInfo {
- private _conflictedAlts;
- private exact;
- constructor(conflictedAlts: BitSet, exact: boolean);
- /**
- * Gets the set of conflicting alternatives for the configuration set.
- */
- readonly conflictedAlts: BitSet;
- /**
- * Gets whether or not the configuration conflict is an exact conflict.
- * An exact conflict occurs when the prediction algorithm determines that
- * the represented alternatives for a particular configuration set cannot be
- * further reduced by consuming additional input. After reaching an exact
- * conflict during an SLL prediction, only switch to full-context prediction
- * could reduce the set of viable alternatives. In LL prediction, an exact
- * conflict indicates a true ambiguity in the input.
- *
- *
- * For the {@link PredictionMode#LL_EXACT_AMBIG_DETECTION} prediction mode,
- * accept states are conflicting but not exact are treated as non-accept
- * states.
- */
- readonly isExact: boolean;
- equals(obj: any): boolean;
- hashCode(): number;
-}
diff --git a/node_modules/antlr4ts/atn/ConflictInfo.js b/node_modules/antlr4ts/atn/ConflictInfo.js
deleted file mode 100644
index 44b6737..0000000
--- a/node_modules/antlr4ts/atn/ConflictInfo.js
+++ /dev/null
@@ -1,69 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const Decorators_1 = require("../Decorators");
-const Utils = require("../misc/Utils");
-/**
- * This class stores information about a configuration conflict.
- *
- * @author Sam Harwell
- */
-class ConflictInfo {
- constructor(conflictedAlts, exact) {
- this._conflictedAlts = conflictedAlts;
- this.exact = exact;
- }
- /**
- * Gets the set of conflicting alternatives for the configuration set.
- */
- get conflictedAlts() {
- return this._conflictedAlts;
- }
- /**
- * Gets whether or not the configuration conflict is an exact conflict.
- * An exact conflict occurs when the prediction algorithm determines that
- * the represented alternatives for a particular configuration set cannot be
- * further reduced by consuming additional input. After reaching an exact
- * conflict during an SLL prediction, only switch to full-context prediction
- * could reduce the set of viable alternatives. In LL prediction, an exact
- * conflict indicates a true ambiguity in the input.
- *
- *
- * For the {@link PredictionMode#LL_EXACT_AMBIG_DETECTION} prediction mode,
- * accept states are conflicting but not exact are treated as non-accept
- * states.
- */
- get isExact() {
- return this.exact;
- }
- equals(obj) {
- if (obj === this) {
- return true;
- }
- else if (!(obj instanceof ConflictInfo)) {
- return false;
- }
- return this.isExact === obj.isExact
- && Utils.equals(this.conflictedAlts, obj.conflictedAlts);
- }
- hashCode() {
- return this.conflictedAlts.hashCode();
- }
-}
-__decorate([
- Decorators_1.Override
-], ConflictInfo.prototype, "equals", null);
-__decorate([
- Decorators_1.Override
-], ConflictInfo.prototype, "hashCode", null);
-exports.ConflictInfo = ConflictInfo;
-//# sourceMappingURL=ConflictInfo.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ConflictInfo.js.map b/node_modules/antlr4ts/atn/ConflictInfo.js.map
deleted file mode 100644
index 6b68410..0000000
--- a/node_modules/antlr4ts/atn/ConflictInfo.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ConflictInfo.js","sourceRoot":"","sources":["../../../src/atn/ConflictInfo.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAKH,8CAAyC;AACzC,uCAAuC;AAEvC;;;;GAIG;AACH;IAKC,YAAY,cAAsB,EAAE,KAAc;QACjD,IAAI,CAAC,eAAe,GAAG,cAAc,CAAC;QACtC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,IAAI,cAAc;QACjB,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC;IAC7B,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,IAAI,OAAO;QACV,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAGD,MAAM,CAAC,GAAQ;QACd,EAAE,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,YAAY,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,OAAO,KAAK,GAAG,CAAC,OAAO;eAC/B,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE,GAAG,CAAC,cAAc,CAAC,CAAC;IAC3D,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,CAAC;IACvC,CAAC;CACD;AAfA;IADC,qBAAQ;0CAUR;AAGD;IADC,qBAAQ;4CAGR;AAlDF,oCAmDC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ContextSensitivityInfo.d.ts b/node_modules/antlr4ts/atn/ContextSensitivityInfo.d.ts
deleted file mode 100644
index ba6fe1a..0000000
--- a/node_modules/antlr4ts/atn/ContextSensitivityInfo.d.ts
+++ /dev/null
@@ -1,40 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { DecisionEventInfo } from './DecisionEventInfo';
-import { SimulatorState } from './SimulatorState';
-import { TokenStream } from '../TokenStream';
-/**
- * This class represents profiling event information for a context sensitivity.
- * Context sensitivities are decisions where a particular input resulted in an
- * SLL conflict, but LL prediction produced a single unique alternative.
- *
- *
- * In some cases, the unique alternative identified by LL prediction is not
- * equal to the minimum represented alternative in the conflicting SLL
- * configuration set. Grammars and inputs which result in this scenario are
- * unable to use {@link PredictionMode#SLL}, which in turn means they cannot use
- * the two-stage parsing strategy to improve parsing performance for that
- * input.
- *
- * @see ParserATNSimulator#reportContextSensitivity
- * @see ParserErrorListener#reportContextSensitivity
- *
- * @since 4.3
- */
-export declare class ContextSensitivityInfo extends DecisionEventInfo {
- /**
- * Constructs a new instance of the {@link ContextSensitivityInfo} class
- * with the specified detailed context sensitivity information.
- *
- * @param decision The decision number
- * @param state The final simulator state containing the unique
- * alternative identified by full-context prediction
- * @param input The input token stream
- * @param startIndex The start index for the current prediction
- * @param stopIndex The index at which the context sensitivity was
- * identified during full-context prediction
- */
- constructor(decision: number, state: SimulatorState, input: TokenStream, startIndex: number, stopIndex: number);
-}
diff --git a/node_modules/antlr4ts/atn/ContextSensitivityInfo.js b/node_modules/antlr4ts/atn/ContextSensitivityInfo.js
deleted file mode 100644
index b6c7c17..0000000
--- a/node_modules/antlr4ts/atn/ContextSensitivityInfo.js
+++ /dev/null
@@ -1,59 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:28.1575933-07:00
-const DecisionEventInfo_1 = require("./DecisionEventInfo");
-const Decorators_1 = require("../Decorators");
-/**
- * This class represents profiling event information for a context sensitivity.
- * Context sensitivities are decisions where a particular input resulted in an
- * SLL conflict, but LL prediction produced a single unique alternative.
- *
- *
- * In some cases, the unique alternative identified by LL prediction is not
- * equal to the minimum represented alternative in the conflicting SLL
- * configuration set. Grammars and inputs which result in this scenario are
- * unable to use {@link PredictionMode#SLL}, which in turn means they cannot use
- * the two-stage parsing strategy to improve parsing performance for that
- * input.
- *
- * @see ParserATNSimulator#reportContextSensitivity
- * @see ParserErrorListener#reportContextSensitivity
- *
- * @since 4.3
- */
-let ContextSensitivityInfo = class ContextSensitivityInfo extends DecisionEventInfo_1.DecisionEventInfo {
- /**
- * Constructs a new instance of the {@link ContextSensitivityInfo} class
- * with the specified detailed context sensitivity information.
- *
- * @param decision The decision number
- * @param state The final simulator state containing the unique
- * alternative identified by full-context prediction
- * @param input The input token stream
- * @param startIndex The start index for the current prediction
- * @param stopIndex The index at which the context sensitivity was
- * identified during full-context prediction
- */
- constructor(decision, state, input, startIndex, stopIndex) {
- super(decision, state, input, startIndex, stopIndex, true);
- }
-};
-ContextSensitivityInfo = __decorate([
- __param(1, Decorators_1.NotNull),
- __param(2, Decorators_1.NotNull)
-], ContextSensitivityInfo);
-exports.ContextSensitivityInfo = ContextSensitivityInfo;
-//# sourceMappingURL=ContextSensitivityInfo.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ContextSensitivityInfo.js.map b/node_modules/antlr4ts/atn/ContextSensitivityInfo.js.map
deleted file mode 100644
index f5a53b6..0000000
--- a/node_modules/antlr4ts/atn/ContextSensitivityInfo.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ContextSensitivityInfo.js","sourceRoot":"","sources":["../../../src/atn/ContextSensitivityInfo.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,2DAAwD;AACxD,8CAAwC;AAIxC;;;;;;;;;;;;;;;;;GAiBG;AACH,IAAa,sBAAsB,GAAnC,4BAAoC,SAAQ,qCAAiB;IAC5D;;;;;;;;;;;OAWG;IACH,YACC,QAAgB,EACP,KAAqB,EACrB,KAAkB,EAC3B,UAAkB,EAClB,SAAiB;QAEjB,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;IAC5D,CAAC;CACD,CAAA;AAtBY,sBAAsB;IAehC,WAAA,oBAAO,CAAA;IACP,WAAA,oBAAO,CAAA;GAhBG,sBAAsB,CAsBlC;AAtBY,wDAAsB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/DecisionEventInfo.d.ts b/node_modules/antlr4ts/atn/DecisionEventInfo.d.ts
deleted file mode 100644
index 01b8f49..0000000
--- a/node_modules/antlr4ts/atn/DecisionEventInfo.d.ts
+++ /dev/null
@@ -1,54 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { SimulatorState } from './SimulatorState';
-import { TokenStream } from '../TokenStream';
-/**
- * This is the base class for gathering detailed information about prediction
- * events which occur during parsing.
- *
- * Note that we could record the parser call stack at the time this event
- * occurred but in the presence of left recursive rules, the stack is kind of
- * meaningless. It's better to look at the individual configurations for their
- * individual stacks. Of course that is a {@link PredictionContext} object
- * not a parse tree node and so it does not have information about the extent
- * (start...stop) of the various subtrees. Examining the stack tops of all
- * configurations provide the return states for the rule invocations.
- * From there you can get the enclosing rule.
- *
- * @since 4.3
- */
-export declare class DecisionEventInfo {
- /**
- * The invoked decision number which this event is related to.
- *
- * @see ATN#decisionToState
- */
- decision: number;
- /**
- * The simulator state containing additional information relevant to the
- * prediction state when the current event occurred, or {@code null} if no
- * additional information is relevant or available.
- */
- state: SimulatorState | undefined;
- /**
- * The input token stream which is being parsed.
- */
- input: TokenStream;
- /**
- * The token index in the input stream at which the current prediction was
- * originally invoked.
- */
- startIndex: number;
- /**
- * The token index in the input stream at which the current event occurred.
- */
- stopIndex: number;
- /**
- * {@code true} if the current event occurred during LL prediction;
- * otherwise, {@code false} if the input occurred during SLL prediction.
- */
- fullCtx: boolean;
- constructor(decision: number, state: SimulatorState | undefined, input: TokenStream, startIndex: number, stopIndex: number, fullCtx: boolean);
-}
diff --git a/node_modules/antlr4ts/atn/DecisionEventInfo.js b/node_modules/antlr4ts/atn/DecisionEventInfo.js
deleted file mode 100644
index da67978..0000000
--- a/node_modules/antlr4ts/atn/DecisionEventInfo.js
+++ /dev/null
@@ -1,50 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:28.2401032-07:00
-const Decorators_1 = require("../Decorators");
-/**
- * This is the base class for gathering detailed information about prediction
- * events which occur during parsing.
- *
- * Note that we could record the parser call stack at the time this event
- * occurred but in the presence of left recursive rules, the stack is kind of
- * meaningless. It's better to look at the individual configurations for their
- * individual stacks. Of course that is a {@link PredictionContext} object
- * not a parse tree node and so it does not have information about the extent
- * (start...stop) of the various subtrees. Examining the stack tops of all
- * configurations provide the return states for the rule invocations.
- * From there you can get the enclosing rule.
- *
- * @since 4.3
- */
-let DecisionEventInfo = class DecisionEventInfo {
- constructor(decision, state, input, startIndex, stopIndex, fullCtx) {
- this.decision = decision;
- this.fullCtx = fullCtx;
- this.stopIndex = stopIndex;
- this.input = input;
- this.startIndex = startIndex;
- this.state = state;
- }
-};
-__decorate([
- Decorators_1.NotNull
-], DecisionEventInfo.prototype, "input", void 0);
-DecisionEventInfo = __decorate([
- __param(2, Decorators_1.NotNull)
-], DecisionEventInfo);
-exports.DecisionEventInfo = DecisionEventInfo;
-//# sourceMappingURL=DecisionEventInfo.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/DecisionEventInfo.js.map b/node_modules/antlr4ts/atn/DecisionEventInfo.js.map
deleted file mode 100644
index 6796769..0000000
--- a/node_modules/antlr4ts/atn/DecisionEventInfo.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"DecisionEventInfo.js","sourceRoot":"","sources":["../../../src/atn/DecisionEventInfo.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,8CAAwC;AAIxC;;;;;;;;;;;;;;GAcG;AACH,IAAa,iBAAiB,GAA9B;IAsCC,YACC,QAAgB,EAChB,KAAiC,EACxB,KAAkB,EAC3B,UAAkB,EAClB,SAAiB,EACjB,OAAgB;QAEhB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACpB,CAAC;CACD,CAAA;AAlCA;IADC,oBAAO;gDACW;AAnBP,iBAAiB;IAyC3B,WAAA,oBAAO,CAAA;GAzCG,iBAAiB,CAqD7B;AArDY,8CAAiB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/DecisionInfo.d.ts b/node_modules/antlr4ts/atn/DecisionInfo.d.ts
deleted file mode 100644
index f200a09..0000000
--- a/node_modules/antlr4ts/atn/DecisionInfo.d.ts
+++ /dev/null
@@ -1,205 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { AmbiguityInfo } from './AmbiguityInfo';
-import { ContextSensitivityInfo } from './ContextSensitivityInfo';
-import { ErrorInfo } from './ErrorInfo';
-import { LookaheadEventInfo } from './LookaheadEventInfo';
-import { PredicateEvalInfo } from './PredicateEvalInfo';
-/**
- * This class contains profiling gathered for a particular decision.
- *
- *
- * Parsing performance in ANTLR 4 is heavily influenced by both static factors
- * (e.g. the form of the rules in the grammar) and dynamic factors (e.g. the
- * choice of input and the state of the DFA cache at the time profiling
- * operations are started). For best results, gather and use aggregate
- * statistics from a large sample of inputs representing the inputs expected in
- * production before using the results to make changes in the grammar.
- *
- * @since 4.3
- */
-export declare class DecisionInfo {
- /**
- * The decision number, which is an index into {@link ATN#decisionToState}.
- */
- decision: number;
- /**
- * The total number of times {@link ParserATNSimulator#adaptivePredict} was
- * invoked for this decision.
- */
- invocations: number;
- /**
- * The total time spent in {@link ParserATNSimulator#adaptivePredict} for
- * this decision, in nanoseconds.
- *
- *
- * The value of this field contains the sum of differential results obtained
- * by {@link System#nanoTime()}, and is not adjusted to compensate for JIT
- * and/or garbage collection overhead. For best accuracy, use a modern JVM
- * implementation that provides precise results from
- * {@link System#nanoTime()}, and perform profiling in a separate process
- * which is warmed up by parsing the input prior to profiling. If desired,
- * call {@link ATNSimulator#clearDFA} to reset the DFA cache to its initial
- * state before starting the profiling measurement pass.
- */
- timeInPrediction: number;
- /**
- * The sum of the lookahead required for SLL prediction for this decision.
- * Note that SLL prediction is used before LL prediction for performance
- * reasons even when {@link PredictionMode#LL} or
- * {@link PredictionMode#LL_EXACT_AMBIG_DETECTION} is used.
- */
- SLL_TotalLook: number;
- /**
- * Gets the minimum lookahead required for any single SLL prediction to
- * complete for this decision, by reaching a unique prediction, reaching an
- * SLL conflict state, or encountering a syntax error.
- */
- SLL_MinLook: number;
- /**
- * Gets the maximum lookahead required for any single SLL prediction to
- * complete for this decision, by reaching a unique prediction, reaching an
- * SLL conflict state, or encountering a syntax error.
- */
- SLL_MaxLook: number;
- /**
- * Gets the {@link LookaheadEventInfo} associated with the event where the
- * {@link #SLL_MaxLook} value was set.
- */
- SLL_MaxLookEvent?: LookaheadEventInfo;
- /**
- * The sum of the lookahead required for LL prediction for this decision.
- * Note that LL prediction is only used when SLL prediction reaches a
- * conflict state.
- */
- LL_TotalLook: number;
- /**
- * Gets the minimum lookahead required for any single LL prediction to
- * complete for this decision. An LL prediction completes when the algorithm
- * reaches a unique prediction, a conflict state (for
- * {@link PredictionMode#LL}, an ambiguity state (for
- * {@link PredictionMode#LL_EXACT_AMBIG_DETECTION}, or a syntax error.
- */
- LL_MinLook: number;
- /**
- * Gets the maximum lookahead required for any single LL prediction to
- * complete for this decision. An LL prediction completes when the algorithm
- * reaches a unique prediction, a conflict state (for
- * {@link PredictionMode#LL}, an ambiguity state (for
- * {@link PredictionMode#LL_EXACT_AMBIG_DETECTION}, or a syntax error.
- */
- LL_MaxLook: number;
- /**
- * Gets the {@link LookaheadEventInfo} associated with the event where the
- * {@link #LL_MaxLook} value was set.
- */
- LL_MaxLookEvent?: LookaheadEventInfo;
- /**
- * A collection of {@link ContextSensitivityInfo} instances describing the
- * context sensitivities encountered during LL prediction for this decision.
- *
- * @see ContextSensitivityInfo
- */
- contextSensitivities: ContextSensitivityInfo[];
- /**
- * A collection of {@link ErrorInfo} instances describing the parse errors
- * identified during calls to {@link ParserATNSimulator#adaptivePredict} for
- * this decision.
- *
- * @see ErrorInfo
- */
- errors: ErrorInfo[];
- /**
- * A collection of {@link AmbiguityInfo} instances describing the
- * ambiguities encountered during LL prediction for this decision.
- *
- * @see AmbiguityInfo
- */
- ambiguities: AmbiguityInfo[];
- /**
- * A collection of {@link PredicateEvalInfo} instances describing the
- * results of evaluating individual predicates during prediction for this
- * decision.
- *
- * @see PredicateEvalInfo
- */
- predicateEvals: PredicateEvalInfo[];
- /**
- * The total number of ATN transitions required during SLL prediction for
- * this decision. An ATN transition is determined by the number of times the
- * DFA does not contain an edge that is required for prediction, resulting
- * in on-the-fly computation of that edge.
- *
- *
- * If DFA caching of SLL transitions is employed by the implementation, ATN
- * computation may cache the computed edge for efficient lookup during
- * future parsing of this decision. Otherwise, the SLL parsing algorithm
- * will use ATN transitions exclusively.
- *
- * @see #SLL_ATNTransitions
- * @see ParserATNSimulator#computeTargetState
- * @see LexerATNSimulator#computeTargetState
- */
- SLL_ATNTransitions: number;
- /**
- * The total number of DFA transitions required during SLL prediction for
- * this decision.
- *
- * If the ATN simulator implementation does not use DFA caching for SLL
- * transitions, this value will be 0.
- *
- * @see ParserATNSimulator#getExistingTargetState
- * @see LexerATNSimulator#getExistingTargetState
- */
- SLL_DFATransitions: number;
- /**
- * Gets the total number of times SLL prediction completed in a conflict
- * state, resulting in fallback to LL prediction.
- *
- * Note that this value is not related to whether or not
- * {@link PredictionMode#SLL} may be used successfully with a particular
- * grammar. If the ambiguity resolution algorithm applied to the SLL
- * conflicts for this decision produce the same result as LL prediction for
- * this decision, {@link PredictionMode#SLL} would produce the same overall
- * parsing result as {@link PredictionMode#LL}.
- */
- LL_Fallback: number;
- /**
- * The total number of ATN transitions required during LL prediction for
- * this decision. An ATN transition is determined by the number of times the
- * DFA does not contain an edge that is required for prediction, resulting
- * in on-the-fly computation of that edge.
- *
- *
- * If DFA caching of LL transitions is employed by the implementation, ATN
- * computation may cache the computed edge for efficient lookup during
- * future parsing of this decision. Otherwise, the LL parsing algorithm will
- * use ATN transitions exclusively.
- *
- * @see #LL_DFATransitions
- * @see ParserATNSimulator#computeTargetState
- * @see LexerATNSimulator#computeTargetState
- */
- LL_ATNTransitions: number;
- /**
- * The total number of DFA transitions required during LL prediction for
- * this decision.
- *
- * If the ATN simulator implementation does not use DFA caching for LL
- * transitions, this value will be 0.
- *
- * @see ParserATNSimulator#getExistingTargetState
- * @see LexerATNSimulator#getExistingTargetState
- */
- LL_DFATransitions: number;
- /**
- * Constructs a new instance of the {@link DecisionInfo} class to contain
- * statistics for a particular decision.
- *
- * @param decision The decision number
- */
- constructor(decision: number);
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/atn/DecisionInfo.js b/node_modules/antlr4ts/atn/DecisionInfo.js
deleted file mode 100644
index e98e02d..0000000
--- a/node_modules/antlr4ts/atn/DecisionInfo.js
+++ /dev/null
@@ -1,215 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const Decorators_1 = require("../Decorators");
-/**
- * This class contains profiling gathered for a particular decision.
- *
- *
- * Parsing performance in ANTLR 4 is heavily influenced by both static factors
- * (e.g. the form of the rules in the grammar) and dynamic factors (e.g. the
- * choice of input and the state of the DFA cache at the time profiling
- * operations are started). For best results, gather and use aggregate
- * statistics from a large sample of inputs representing the inputs expected in
- * production before using the results to make changes in the grammar.
- *
- * @since 4.3
- */
-class DecisionInfo {
- /**
- * Constructs a new instance of the {@link DecisionInfo} class to contain
- * statistics for a particular decision.
- *
- * @param decision The decision number
- */
- constructor(decision) {
- /**
- * The total number of times {@link ParserATNSimulator#adaptivePredict} was
- * invoked for this decision.
- */
- this.invocations = 0;
- /**
- * The total time spent in {@link ParserATNSimulator#adaptivePredict} for
- * this decision, in nanoseconds.
- *
- *
- * The value of this field contains the sum of differential results obtained
- * by {@link System#nanoTime()}, and is not adjusted to compensate for JIT
- * and/or garbage collection overhead. For best accuracy, use a modern JVM
- * implementation that provides precise results from
- * {@link System#nanoTime()}, and perform profiling in a separate process
- * which is warmed up by parsing the input prior to profiling. If desired,
- * call {@link ATNSimulator#clearDFA} to reset the DFA cache to its initial
- * state before starting the profiling measurement pass.
- */
- this.timeInPrediction = 0;
- /**
- * The sum of the lookahead required for SLL prediction for this decision.
- * Note that SLL prediction is used before LL prediction for performance
- * reasons even when {@link PredictionMode#LL} or
- * {@link PredictionMode#LL_EXACT_AMBIG_DETECTION} is used.
- */
- this.SLL_TotalLook = 0;
- /**
- * Gets the minimum lookahead required for any single SLL prediction to
- * complete for this decision, by reaching a unique prediction, reaching an
- * SLL conflict state, or encountering a syntax error.
- */
- this.SLL_MinLook = 0;
- /**
- * Gets the maximum lookahead required for any single SLL prediction to
- * complete for this decision, by reaching a unique prediction, reaching an
- * SLL conflict state, or encountering a syntax error.
- */
- this.SLL_MaxLook = 0;
- /**
- * The sum of the lookahead required for LL prediction for this decision.
- * Note that LL prediction is only used when SLL prediction reaches a
- * conflict state.
- */
- this.LL_TotalLook = 0;
- /**
- * Gets the minimum lookahead required for any single LL prediction to
- * complete for this decision. An LL prediction completes when the algorithm
- * reaches a unique prediction, a conflict state (for
- * {@link PredictionMode#LL}, an ambiguity state (for
- * {@link PredictionMode#LL_EXACT_AMBIG_DETECTION}, or a syntax error.
- */
- this.LL_MinLook = 0;
- /**
- * Gets the maximum lookahead required for any single LL prediction to
- * complete for this decision. An LL prediction completes when the algorithm
- * reaches a unique prediction, a conflict state (for
- * {@link PredictionMode#LL}, an ambiguity state (for
- * {@link PredictionMode#LL_EXACT_AMBIG_DETECTION}, or a syntax error.
- */
- this.LL_MaxLook = 0;
- /**
- * A collection of {@link ContextSensitivityInfo} instances describing the
- * context sensitivities encountered during LL prediction for this decision.
- *
- * @see ContextSensitivityInfo
- */
- this.contextSensitivities = [];
- /**
- * A collection of {@link ErrorInfo} instances describing the parse errors
- * identified during calls to {@link ParserATNSimulator#adaptivePredict} for
- * this decision.
- *
- * @see ErrorInfo
- */
- this.errors = [];
- /**
- * A collection of {@link AmbiguityInfo} instances describing the
- * ambiguities encountered during LL prediction for this decision.
- *
- * @see AmbiguityInfo
- */
- this.ambiguities = [];
- /**
- * A collection of {@link PredicateEvalInfo} instances describing the
- * results of evaluating individual predicates during prediction for this
- * decision.
- *
- * @see PredicateEvalInfo
- */
- this.predicateEvals = [];
- /**
- * The total number of ATN transitions required during SLL prediction for
- * this decision. An ATN transition is determined by the number of times the
- * DFA does not contain an edge that is required for prediction, resulting
- * in on-the-fly computation of that edge.
- *
- *
- * If DFA caching of SLL transitions is employed by the implementation, ATN
- * computation may cache the computed edge for efficient lookup during
- * future parsing of this decision. Otherwise, the SLL parsing algorithm
- * will use ATN transitions exclusively.
- *
- * @see #SLL_ATNTransitions
- * @see ParserATNSimulator#computeTargetState
- * @see LexerATNSimulator#computeTargetState
- */
- this.SLL_ATNTransitions = 0;
- /**
- * The total number of DFA transitions required during SLL prediction for
- * this decision.
- *
- * If the ATN simulator implementation does not use DFA caching for SLL
- * transitions, this value will be 0.
- *
- * @see ParserATNSimulator#getExistingTargetState
- * @see LexerATNSimulator#getExistingTargetState
- */
- this.SLL_DFATransitions = 0;
- /**
- * Gets the total number of times SLL prediction completed in a conflict
- * state, resulting in fallback to LL prediction.
- *
- * Note that this value is not related to whether or not
- * {@link PredictionMode#SLL} may be used successfully with a particular
- * grammar. If the ambiguity resolution algorithm applied to the SLL
- * conflicts for this decision produce the same result as LL prediction for
- * this decision, {@link PredictionMode#SLL} would produce the same overall
- * parsing result as {@link PredictionMode#LL}.
- */
- this.LL_Fallback = 0;
- /**
- * The total number of ATN transitions required during LL prediction for
- * this decision. An ATN transition is determined by the number of times the
- * DFA does not contain an edge that is required for prediction, resulting
- * in on-the-fly computation of that edge.
- *
- *
- * If DFA caching of LL transitions is employed by the implementation, ATN
- * computation may cache the computed edge for efficient lookup during
- * future parsing of this decision. Otherwise, the LL parsing algorithm will
- * use ATN transitions exclusively.
- *
- * @see #LL_DFATransitions
- * @see ParserATNSimulator#computeTargetState
- * @see LexerATNSimulator#computeTargetState
- */
- this.LL_ATNTransitions = 0;
- /**
- * The total number of DFA transitions required during LL prediction for
- * this decision.
- *
- * If the ATN simulator implementation does not use DFA caching for LL
- * transitions, this value will be 0.
- *
- * @see ParserATNSimulator#getExistingTargetState
- * @see LexerATNSimulator#getExistingTargetState
- */
- this.LL_DFATransitions = 0;
- this.decision = decision;
- }
- toString() {
- return "{" +
- "decision=" + this.decision +
- ", contextSensitivities=" + this.contextSensitivities.length +
- ", errors=" + this.errors.length +
- ", ambiguities=" + this.ambiguities.length +
- ", SLL_lookahead=" + this.SLL_TotalLook +
- ", SLL_ATNTransitions=" + this.SLL_ATNTransitions +
- ", SLL_DFATransitions=" + this.SLL_DFATransitions +
- ", LL_Fallback=" + this.LL_Fallback +
- ", LL_lookahead=" + this.LL_TotalLook +
- ", LL_ATNTransitions=" + this.LL_ATNTransitions +
- '}';
- }
-}
-__decorate([
- Decorators_1.Override
-], DecisionInfo.prototype, "toString", null);
-exports.DecisionInfo = DecisionInfo;
-//# sourceMappingURL=DecisionInfo.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/DecisionInfo.js.map b/node_modules/antlr4ts/atn/DecisionInfo.js.map
deleted file mode 100644
index 0397e54..0000000
--- a/node_modules/antlr4ts/atn/DecisionInfo.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"DecisionInfo.js","sourceRoot":"","sources":["../../../src/atn/DecisionInfo.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAQH,8CAAyC;AAGzC;;;;;;;;;;;;GAYG;AACH;IAkMC;;;;;OAKG;IACH,YAAY,QAAgB;QAlM5B;;;WAGG;QACH,gBAAW,GAAW,CAAC,CAAC;QAExB;;;;;;;;;;;;;WAaG;QACH,qBAAgB,GAAW,CAAC,CAAC;QAE7B;;;;;WAKG;QACH,kBAAa,GAAW,CAAC,CAAC;QAE1B;;;;WAIG;QACH,gBAAW,GAAW,CAAC,CAAC;QAExB;;;;WAIG;QACH,gBAAW,GAAW,CAAC,CAAC;QAQxB;;;;WAIG;QACH,iBAAY,GAAW,CAAC,CAAC;QAEzB;;;;;;WAMG;QACH,eAAU,GAAW,CAAC,CAAC;QAEvB;;;;;;WAMG;QACH,eAAU,GAAW,CAAC,CAAC;QAQvB;;;;;WAKG;QACH,yBAAoB,GAA6B,EAAE,CAAC;QAEpD;;;;;;WAMG;QACH,WAAM,GAAgB,EAAE,CAAC;QAEzB;;;;;WAKG;QACH,gBAAW,GAAoB,EAAE,CAAC;QAElC;;;;;;WAMG;QACH,mBAAc,GAAwB,EAAE,CAAC;QAEzC;;;;;;;;;;;;;;;WAeG;QACH,uBAAkB,GAAW,CAAC,CAAC;QAE/B;;;;;;;;;WASG;QACH,uBAAkB,GAAW,CAAC,CAAC;QAE/B;;;;;;;;;;WAUG;QACH,gBAAW,GAAW,CAAC,CAAC;QAExB;;;;;;;;;;;;;;;WAeG;QACH,sBAAiB,GAAW,CAAC,CAAC;QAE9B;;;;;;;;;WASG;QACH,sBAAiB,GAAW,CAAC,CAAC;QAS7B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC1B,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,GAAG;YACT,WAAW,GAAG,IAAI,CAAC,QAAQ;YAC3B,yBAAyB,GAAG,IAAI,CAAC,oBAAoB,CAAC,MAAM;YAC5D,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM;YAChC,gBAAgB,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM;YAC1C,kBAAkB,GAAG,IAAI,CAAC,aAAa;YACvC,uBAAuB,GAAG,IAAI,CAAC,kBAAkB;YACjD,uBAAuB,GAAG,IAAI,CAAC,kBAAkB;YACjD,gBAAgB,GAAG,IAAI,CAAC,WAAW;YACnC,iBAAiB,GAAG,IAAI,CAAC,YAAY;YACrC,sBAAsB,GAAG,IAAI,CAAC,iBAAiB;YAC/C,GAAG,CAAC;IACN,CAAC;CACD;AAdA;IADC,qBAAQ;4CAcR;AA1NF,oCA2NC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/DecisionState.d.ts b/node_modules/antlr4ts/atn/DecisionState.d.ts
deleted file mode 100644
index b4f4568..0000000
--- a/node_modules/antlr4ts/atn/DecisionState.d.ts
+++ /dev/null
@@ -1,10 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-export declare abstract class DecisionState extends ATNState {
- decision: number;
- nonGreedy: boolean;
- sll: boolean;
-}
diff --git a/node_modules/antlr4ts/atn/DecisionState.js b/node_modules/antlr4ts/atn/DecisionState.js
deleted file mode 100644
index d6b919b..0000000
--- a/node_modules/antlr4ts/atn/DecisionState.js
+++ /dev/null
@@ -1,18 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:28.4381103-07:00
-const ATNState_1 = require("./ATNState");
-class DecisionState extends ATNState_1.ATNState {
- constructor() {
- super(...arguments);
- this.decision = -1;
- this.nonGreedy = false;
- this.sll = false;
- }
-}
-exports.DecisionState = DecisionState;
-//# sourceMappingURL=DecisionState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/DecisionState.js.map b/node_modules/antlr4ts/atn/DecisionState.js.map
deleted file mode 100644
index 45d7845..0000000
--- a/node_modules/antlr4ts/atn/DecisionState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"DecisionState.js","sourceRoot":"","sources":["../../../src/atn/DecisionState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,wDAAwD;AAExD,yCAAsC;AAEtC,mBAAoC,SAAQ,mBAAQ;IAApD;;QACC,aAAQ,GAAW,CAAC,CAAC,CAAC;QACtB,cAAS,GAAY,KAAK,CAAC;QAC3B,QAAG,GAAY,KAAK,CAAC;IACtB,CAAC;CAAA;AAJD,sCAIC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/EpsilonTransition.d.ts b/node_modules/antlr4ts/atn/EpsilonTransition.d.ts
deleted file mode 100644
index baa1eb9..0000000
--- a/node_modules/antlr4ts/atn/EpsilonTransition.d.ts
+++ /dev/null
@@ -1,24 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { Transition } from './Transition';
-import { TransitionType } from './TransitionType';
-export declare class EpsilonTransition extends Transition {
- private _outermostPrecedenceReturn;
- constructor(target: ATNState, outermostPrecedenceReturn?: number);
- /**
- * @return the rule index of a precedence rule for which this transition is
- * returning from, where the precedence value is 0; otherwise, -1.
- *
- * @see ATNConfig.isPrecedenceFilterSuppressed
- * @see ParserATNSimulator#applyPrecedenceFilter(ATNConfigSet, ParserRuleContext, PredictionContextCache)
- * @since 4.4.1
- */
- readonly outermostPrecedenceReturn: number;
- readonly serializationType: TransitionType;
- readonly isEpsilon: boolean;
- matches(symbol: number, minVocabSymbol: number, maxVocabSymbol: number): boolean;
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/atn/EpsilonTransition.js b/node_modules/antlr4ts/atn/EpsilonTransition.js
deleted file mode 100644
index 2e5d7ab..0000000
--- a/node_modules/antlr4ts/atn/EpsilonTransition.js
+++ /dev/null
@@ -1,64 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const Decorators_1 = require("../Decorators");
-const Transition_1 = require("./Transition");
-let EpsilonTransition = class EpsilonTransition extends Transition_1.Transition {
- constructor(target, outermostPrecedenceReturn = -1) {
- super(target);
- this._outermostPrecedenceReturn = outermostPrecedenceReturn;
- }
- /**
- * @return the rule index of a precedence rule for which this transition is
- * returning from, where the precedence value is 0; otherwise, -1.
- *
- * @see ATNConfig.isPrecedenceFilterSuppressed
- * @see ParserATNSimulator#applyPrecedenceFilter(ATNConfigSet, ParserRuleContext, PredictionContextCache)
- * @since 4.4.1
- */
- get outermostPrecedenceReturn() {
- return this._outermostPrecedenceReturn;
- }
- get serializationType() {
- return 1 /* EPSILON */;
- }
- get isEpsilon() {
- return true;
- }
- matches(symbol, minVocabSymbol, maxVocabSymbol) {
- return false;
- }
- toString() {
- return "epsilon";
- }
-};
-__decorate([
- Decorators_1.Override
-], EpsilonTransition.prototype, "serializationType", null);
-__decorate([
- Decorators_1.Override
-], EpsilonTransition.prototype, "isEpsilon", null);
-__decorate([
- Decorators_1.Override
-], EpsilonTransition.prototype, "matches", null);
-__decorate([
- Decorators_1.Override,
- Decorators_1.NotNull
-], EpsilonTransition.prototype, "toString", null);
-EpsilonTransition = __decorate([
- __param(0, Decorators_1.NotNull)
-], EpsilonTransition);
-exports.EpsilonTransition = EpsilonTransition;
-//# sourceMappingURL=EpsilonTransition.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/EpsilonTransition.js.map b/node_modules/antlr4ts/atn/EpsilonTransition.js.map
deleted file mode 100644
index e9d6100..0000000
--- a/node_modules/antlr4ts/atn/EpsilonTransition.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"EpsilonTransition.js","sourceRoot":"","sources":["../../../src/atn/EpsilonTransition.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAKH,8CAAkD;AAClD,6CAA0C;AAG1C,IAAa,iBAAiB,GAA9B,uBAA+B,SAAQ,uBAAU;IAIhD,YAAqB,MAAgB,EAAE,4BAAoC,CAAC,CAAC;QAC5E,KAAK,CAAC,MAAM,CAAC,CAAC;QACd,IAAI,CAAC,0BAA0B,GAAG,yBAAyB,CAAC;IAC7D,CAAC;IAED;;;;;;;OAOG;IACH,IAAI,yBAAyB;QAC5B,MAAM,CAAC,IAAI,CAAC,0BAA0B,CAAC;IACxC,CAAC;IAGD,IAAI,iBAAiB;QACpB,MAAM,iBAAwB;IAC/B,CAAC;IAGD,IAAI,SAAS;QACZ,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAGD,OAAO,CAAC,MAAc,EAAE,cAAsB,EAAE,cAAsB;QACrE,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAID,QAAQ;QACP,MAAM,CAAC,SAAS,CAAC;IAClB,CAAC;CACD,CAAA;AAnBA;IADC,qBAAQ;0DAGR;AAGD;IADC,qBAAQ;kDAGR;AAGD;IADC,qBAAQ;gDAGR;AAID;IAFC,qBAAQ;IACR,oBAAO;iDAGP;AAxCW,iBAAiB;IAIhB,WAAA,oBAAO,CAAA;GAJR,iBAAiB,CAyC7B;AAzCY,8CAAiB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ErrorInfo.d.ts b/node_modules/antlr4ts/atn/ErrorInfo.d.ts
deleted file mode 100644
index b294caf..0000000
--- a/node_modules/antlr4ts/atn/ErrorInfo.d.ts
+++ /dev/null
@@ -1,32 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { DecisionEventInfo } from './DecisionEventInfo';
-import { SimulatorState } from './SimulatorState';
-import { TokenStream } from '../TokenStream';
-/**
- * This class represents profiling event information for a syntax error
- * identified during prediction. Syntax errors occur when the prediction
- * algorithm is unable to identify an alternative which would lead to a
- * successful parse.
- *
- * @see Parser#notifyErrorListeners(Token, String, RecognitionException)
- * @see ANTLRErrorListener#syntaxError
- *
- * @since 4.3
- */
-export declare class ErrorInfo extends DecisionEventInfo {
- /**
- * Constructs a new instance of the {@link ErrorInfo} class with the
- * specified detailed syntax error information.
- *
- * @param decision The decision number
- * @param state The final simulator state reached during prediction
- * prior to reaching the {@link ATNSimulator#ERROR} state
- * @param input The input token stream
- * @param startIndex The start index for the current prediction
- * @param stopIndex The index at which the syntax error was identified
- */
- constructor(decision: number, state: SimulatorState, input: TokenStream, startIndex: number, stopIndex: number);
-}
diff --git a/node_modules/antlr4ts/atn/ErrorInfo.js b/node_modules/antlr4ts/atn/ErrorInfo.js
deleted file mode 100644
index 287f972..0000000
--- a/node_modules/antlr4ts/atn/ErrorInfo.js
+++ /dev/null
@@ -1,51 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:28.7213647-07:00
-const DecisionEventInfo_1 = require("./DecisionEventInfo");
-const Decorators_1 = require("../Decorators");
-/**
- * This class represents profiling event information for a syntax error
- * identified during prediction. Syntax errors occur when the prediction
- * algorithm is unable to identify an alternative which would lead to a
- * successful parse.
- *
- * @see Parser#notifyErrorListeners(Token, String, RecognitionException)
- * @see ANTLRErrorListener#syntaxError
- *
- * @since 4.3
- */
-let ErrorInfo = class ErrorInfo extends DecisionEventInfo_1.DecisionEventInfo {
- /**
- * Constructs a new instance of the {@link ErrorInfo} class with the
- * specified detailed syntax error information.
- *
- * @param decision The decision number
- * @param state The final simulator state reached during prediction
- * prior to reaching the {@link ATNSimulator#ERROR} state
- * @param input The input token stream
- * @param startIndex The start index for the current prediction
- * @param stopIndex The index at which the syntax error was identified
- */
- constructor(decision, state, input, startIndex, stopIndex) {
- super(decision, state, input, startIndex, stopIndex, state.useContext);
- }
-};
-ErrorInfo = __decorate([
- __param(1, Decorators_1.NotNull),
- __param(2, Decorators_1.NotNull)
-], ErrorInfo);
-exports.ErrorInfo = ErrorInfo;
-//# sourceMappingURL=ErrorInfo.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ErrorInfo.js.map b/node_modules/antlr4ts/atn/ErrorInfo.js.map
deleted file mode 100644
index 2e9d8a8..0000000
--- a/node_modules/antlr4ts/atn/ErrorInfo.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ErrorInfo.js","sourceRoot":"","sources":["../../../src/atn/ErrorInfo.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,2DAAwD;AACxD,8CAAwC;AAIxC;;;;;;;;;;GAUG;AACH,IAAa,SAAS,GAAtB,eAAuB,SAAQ,qCAAiB;IAC/C;;;;;;;;;;OAUG;IACH,YACC,QAAgB,EACP,KAAqB,EACrB,KAAkB,EAC3B,UAAkB,EAClB,SAAiB;QAEjB,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IACxE,CAAC;CACD,CAAA;AArBY,SAAS;IAcnB,WAAA,oBAAO,CAAA;IACP,WAAA,oBAAO,CAAA;GAfG,SAAS,CAqBrB;AArBY,8BAAS"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/InvalidState.d.ts b/node_modules/antlr4ts/atn/InvalidState.d.ts
deleted file mode 100644
index 09e89e8..0000000
--- a/node_modules/antlr4ts/atn/InvalidState.d.ts
+++ /dev/null
@@ -1,13 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNStateType } from './ATNStateType';
-import { BasicState } from './BasicState';
-/**
- *
- * @author Sam Harwell
- */
-export declare class InvalidState extends BasicState {
- readonly stateType: ATNStateType;
-}
diff --git a/node_modules/antlr4ts/atn/InvalidState.js b/node_modules/antlr4ts/atn/InvalidState.js
deleted file mode 100644
index ee67aed..0000000
--- a/node_modules/antlr4ts/atn/InvalidState.js
+++ /dev/null
@@ -1,28 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const BasicState_1 = require("./BasicState");
-const Decorators_1 = require("../Decorators");
-/**
- *
- * @author Sam Harwell
- */
-class InvalidState extends BasicState_1.BasicState {
- get stateType() {
- return 0 /* INVALID_TYPE */;
- }
-}
-__decorate([
- Decorators_1.Override
-], InvalidState.prototype, "stateType", null);
-exports.InvalidState = InvalidState;
-//# sourceMappingURL=InvalidState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/InvalidState.js.map b/node_modules/antlr4ts/atn/InvalidState.js.map
deleted file mode 100644
index 0d1276f..0000000
--- a/node_modules/antlr4ts/atn/InvalidState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"InvalidState.js","sourceRoot":"","sources":["../../../src/atn/InvalidState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAIH,6CAA0C;AAC1C,8CAAyC;AAEzC;;;GAGG;AACH,kBAA0B,SAAQ,uBAAU;IAG3C,IAAI,SAAS;QACZ,MAAM,sBAA2B;IAClC,CAAC;CAED;AAJA;IADC,qBAAQ;6CAGR;AALF,oCAOC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LL1Analyzer.d.ts b/node_modules/antlr4ts/atn/LL1Analyzer.d.ts
deleted file mode 100644
index 85fef65..0000000
--- a/node_modules/antlr4ts/atn/LL1Analyzer.d.ts
+++ /dev/null
@@ -1,98 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Array2DHashSet } from '../misc/Array2DHashSet';
-import { ATN } from './ATN';
-import { ATNConfig } from './ATNConfig';
-import { ATNState } from './ATNState';
-import { BitSet } from '../misc/BitSet';
-import { IntervalSet } from '../misc/IntervalSet';
-import { PredictionContext } from './PredictionContext';
-export declare class LL1Analyzer {
- /** Special value added to the lookahead sets to indicate that we hit
- * a predicate during analysis if {@code seeThruPreds==false}.
- */
- static readonly HIT_PRED: number;
- atn: ATN;
- constructor(atn: ATN);
- /**
- * Calculates the SLL(1) expected lookahead set for each outgoing transition
- * of an {@link ATNState}. The returned array has one element for each
- * outgoing transition in {@code s}. If the closure from transition
- * i leads to a semantic predicate before matching a symbol, the
- * element at index i of the result will be {@code null}.
- *
- * @param s the ATN state
- * @return the expected symbols for each outgoing transition of {@code s}.
- */
- getDecisionLookahead(s: ATNState | undefined): (IntervalSet | undefined)[] | undefined;
- /**
- * Compute set of tokens that can follow {@code s} in the ATN in the
- * specified {@code ctx}.
- *
- * If {@code ctx} is {@code null} and the end of the rule containing
- * {@code s} is reached, {@link Token#EPSILON} is added to the result set.
- * If {@code ctx} is not {@code null} and the end of the outermost rule is
- * reached, {@link Token#EOF} is added to the result set.
- *
- * @param s the ATN state
- * @param ctx the complete parser context, or {@code null} if the context
- * should be ignored
- *
- * @return The set of tokens that can follow {@code s} in the ATN in the
- * specified {@code ctx}.
- */
- LOOK(s: ATNState, ctx: PredictionContext): IntervalSet;
- /**
- * Compute set of tokens that can follow {@code s} in the ATN in the
- * specified {@code ctx}.
- *
- * If {@code ctx} is {@code null} and the end of the rule containing
- * {@code s} is reached, {@link Token#EPSILON} is added to the result set.
- * If {@code ctx} is not {@code PredictionContext#EMPTY_LOCAL} and the end of the outermost rule is
- * reached, {@link Token#EOF} is added to the result set.
- *
- * @param s the ATN state
- * @param stopState the ATN state to stop at. This can be a
- * {@link BlockEndState} to detect epsilon paths through a closure.
- * @param ctx the complete parser context, or {@code null} if the context
- * should be ignored
- *
- * @return The set of tokens that can follow {@code s} in the ATN in the
- * specified {@code ctx}.
- */
- LOOK(s: ATNState, ctx: PredictionContext, stopState: ATNState | null): IntervalSet;
- /**
- * Compute set of tokens that can follow {@code s} in the ATN in the
- * specified {@code ctx}.
- *
- * If {@code ctx} is {@link PredictionContext#EMPTY_LOCAL} and
- * {@code stopState} or the end of the rule containing {@code s} is reached,
- * {@link Token#EPSILON} is added to the result set. If {@code ctx} is not
- * {@link PredictionContext#EMPTY_LOCAL} and {@code addEOF} is {@code true}
- * and {@code stopState} or the end of the outermost rule is reached,
- * {@link Token#EOF} is added to the result set.
- *
- * @param s the ATN state.
- * @param stopState the ATN state to stop at. This can be a
- * {@link BlockEndState} to detect epsilon paths through a closure.
- * @param ctx The outer context, or {@link PredictionContext#EMPTY_LOCAL} if
- * the outer context should not be used.
- * @param look The result lookahead set.
- * @param lookBusy A set used for preventing epsilon closures in the ATN
- * from causing a stack overflow. Outside code should pass
- * {@code new HashSet} for this argument.
- * @param calledRuleStack A set used for preventing left recursion in the
- * ATN from causing a stack overflow. Outside code should pass
- * {@code new BitSet()} for this argument.
- * @param seeThruPreds {@code true} to true semantic predicates as
- * implicitly {@code true} and "see through them", otherwise {@code false}
- * to treat semantic predicates as opaque and add {@link #HIT_PRED} to the
- * result if one is encountered.
- * @param addEOF Add {@link Token#EOF} to the result if the end of the
- * outermost context is reached. This parameter has no effect if {@code ctx}
- * is {@link PredictionContext#EMPTY_LOCAL}.
- */
- protected _LOOK(s: ATNState, stopState: ATNState | undefined, ctx: PredictionContext, look: IntervalSet, lookBusy: Array2DHashSet, calledRuleStack: BitSet, seeThruPreds: boolean, addEOF: boolean): void;
-}
diff --git a/node_modules/antlr4ts/atn/LL1Analyzer.js b/node_modules/antlr4ts/atn/LL1Analyzer.js
deleted file mode 100644
index 32ee5ef..0000000
--- a/node_modules/antlr4ts/atn/LL1Analyzer.js
+++ /dev/null
@@ -1,219 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:30.4445360-07:00
-const AbstractPredicateTransition_1 = require("./AbstractPredicateTransition");
-const Array2DHashSet_1 = require("../misc/Array2DHashSet");
-const ATNConfig_1 = require("./ATNConfig");
-const BitSet_1 = require("../misc/BitSet");
-const IntervalSet_1 = require("../misc/IntervalSet");
-const Decorators_1 = require("../Decorators");
-const NotSetTransition_1 = require("./NotSetTransition");
-const ObjectEqualityComparator_1 = require("../misc/ObjectEqualityComparator");
-const PredictionContext_1 = require("./PredictionContext");
-const RuleStopState_1 = require("./RuleStopState");
-const RuleTransition_1 = require("./RuleTransition");
-const Token_1 = require("../Token");
-const WildcardTransition_1 = require("./WildcardTransition");
-let LL1Analyzer = class LL1Analyzer {
- constructor(atn) { this.atn = atn; }
- /**
- * Calculates the SLL(1) expected lookahead set for each outgoing transition
- * of an {@link ATNState}. The returned array has one element for each
- * outgoing transition in {@code s}. If the closure from transition
- * i leads to a semantic predicate before matching a symbol, the
- * element at index i of the result will be {@code null}.
- *
- * @param s the ATN state
- * @return the expected symbols for each outgoing transition of {@code s}.
- */
- getDecisionLookahead(s) {
- // System.out.println("LOOK("+s.stateNumber+")");
- if (s == null) {
- return undefined;
- }
- let look = new Array(s.numberOfTransitions);
- for (let alt = 0; alt < s.numberOfTransitions; alt++) {
- let current = new IntervalSet_1.IntervalSet();
- look[alt] = current;
- let lookBusy = new Array2DHashSet_1.Array2DHashSet(ObjectEqualityComparator_1.ObjectEqualityComparator.INSTANCE);
- let seeThruPreds = false; // fail to get lookahead upon pred
- this._LOOK(s.transition(alt).target, undefined, PredictionContext_1.PredictionContext.EMPTY_LOCAL, current, lookBusy, new BitSet_1.BitSet(), seeThruPreds, false);
- // Wipe out lookahead for this alternative if we found nothing
- // or we had a predicate when we !seeThruPreds
- if (current.size === 0 || current.contains(LL1Analyzer.HIT_PRED)) {
- current = undefined;
- look[alt] = current;
- }
- }
- return look;
- }
- LOOK(s, ctx, stopState) {
- if (stopState === undefined) {
- if (s.atn == null) {
- throw new Error("Illegal state");
- }
- stopState = s.atn.ruleToStopState[s.ruleIndex];
- }
- else if (stopState === null) {
- // This is an explicit request to pass undefined as the stopState to _LOOK. Used to distinguish an overload
- // from the method which simply omits the stopState parameter.
- stopState = undefined;
- }
- let r = new IntervalSet_1.IntervalSet();
- let seeThruPreds = true; // ignore preds; get all lookahead
- let addEOF = true;
- this._LOOK(s, stopState, ctx, r, new Array2DHashSet_1.Array2DHashSet(), new BitSet_1.BitSet(), seeThruPreds, addEOF);
- return r;
- }
- /**
- * Compute set of tokens that can follow {@code s} in the ATN in the
- * specified {@code ctx}.
- *
- * If {@code ctx} is {@link PredictionContext#EMPTY_LOCAL} and
- * {@code stopState} or the end of the rule containing {@code s} is reached,
- * {@link Token#EPSILON} is added to the result set. If {@code ctx} is not
- * {@link PredictionContext#EMPTY_LOCAL} and {@code addEOF} is {@code true}
- * and {@code stopState} or the end of the outermost rule is reached,
- * {@link Token#EOF} is added to the result set.
- *
- * @param s the ATN state.
- * @param stopState the ATN state to stop at. This can be a
- * {@link BlockEndState} to detect epsilon paths through a closure.
- * @param ctx The outer context, or {@link PredictionContext#EMPTY_LOCAL} if
- * the outer context should not be used.
- * @param look The result lookahead set.
- * @param lookBusy A set used for preventing epsilon closures in the ATN
- * from causing a stack overflow. Outside code should pass
- * {@code new HashSet} for this argument.
- * @param calledRuleStack A set used for preventing left recursion in the
- * ATN from causing a stack overflow. Outside code should pass
- * {@code new BitSet()} for this argument.
- * @param seeThruPreds {@code true} to true semantic predicates as
- * implicitly {@code true} and "see through them", otherwise {@code false}
- * to treat semantic predicates as opaque and add {@link #HIT_PRED} to the
- * result if one is encountered.
- * @param addEOF Add {@link Token#EOF} to the result if the end of the
- * outermost context is reached. This parameter has no effect if {@code ctx}
- * is {@link PredictionContext#EMPTY_LOCAL}.
- */
- _LOOK(s, stopState, ctx, look, lookBusy, calledRuleStack, seeThruPreds, addEOF) {
- // System.out.println("_LOOK("+s.stateNumber+", ctx="+ctx);
- let c = ATNConfig_1.ATNConfig.create(s, 0, ctx);
- if (!lookBusy.add(c))
- return;
- if (s === stopState) {
- if (PredictionContext_1.PredictionContext.isEmptyLocal(ctx)) {
- look.add(Token_1.Token.EPSILON);
- return;
- }
- else if (ctx.isEmpty) {
- if (addEOF) {
- look.add(Token_1.Token.EOF);
- }
- return;
- }
- }
- if (s instanceof RuleStopState_1.RuleStopState) {
- if (ctx.isEmpty && !PredictionContext_1.PredictionContext.isEmptyLocal(ctx)) {
- if (addEOF) {
- look.add(Token_1.Token.EOF);
- }
- return;
- }
- let removed = calledRuleStack.get(s.ruleIndex);
- try {
- calledRuleStack.clear(s.ruleIndex);
- for (let i = 0; i < ctx.size; i++) {
- if (ctx.getReturnState(i) === PredictionContext_1.PredictionContext.EMPTY_FULL_STATE_KEY) {
- continue;
- }
- let returnState = this.atn.states[ctx.getReturnState(i)];
- // System.out.println("popping back to "+retState);
- this._LOOK(returnState, stopState, ctx.getParent(i), look, lookBusy, calledRuleStack, seeThruPreds, addEOF);
- }
- }
- finally {
- if (removed) {
- calledRuleStack.set(s.ruleIndex);
- }
- }
- }
- let n = s.numberOfTransitions;
- for (let i = 0; i < n; i++) {
- let t = s.transition(i);
- if (t instanceof RuleTransition_1.RuleTransition) {
- if (calledRuleStack.get(t.ruleIndex)) {
- continue;
- }
- let newContext = ctx.getChild(t.followState.stateNumber);
- try {
- calledRuleStack.set(t.ruleIndex);
- this._LOOK(t.target, stopState, newContext, look, lookBusy, calledRuleStack, seeThruPreds, addEOF);
- }
- finally {
- calledRuleStack.clear(t.ruleIndex);
- }
- }
- else if (t instanceof AbstractPredicateTransition_1.AbstractPredicateTransition) {
- if (seeThruPreds) {
- this._LOOK(t.target, stopState, ctx, look, lookBusy, calledRuleStack, seeThruPreds, addEOF);
- }
- else {
- look.add(LL1Analyzer.HIT_PRED);
- }
- }
- else if (t.isEpsilon) {
- this._LOOK(t.target, stopState, ctx, look, lookBusy, calledRuleStack, seeThruPreds, addEOF);
- }
- else if (t instanceof WildcardTransition_1.WildcardTransition) {
- look.addAll(IntervalSet_1.IntervalSet.of(Token_1.Token.MIN_USER_TOKEN_TYPE, this.atn.maxTokenType));
- }
- else {
- // System.out.println("adding "+ t);
- let set = t.label;
- if (set != null) {
- if (t instanceof NotSetTransition_1.NotSetTransition) {
- set = set.complement(IntervalSet_1.IntervalSet.of(Token_1.Token.MIN_USER_TOKEN_TYPE, this.atn.maxTokenType));
- }
- look.addAll(set);
- }
- }
- }
- }
-};
-/** Special value added to the lookahead sets to indicate that we hit
- * a predicate during analysis if {@code seeThruPreds==false}.
- */
-LL1Analyzer.HIT_PRED = Token_1.Token.INVALID_TYPE;
-__decorate([
- Decorators_1.NotNull
-], LL1Analyzer.prototype, "atn", void 0);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.NotNull)
-], LL1Analyzer.prototype, "LOOK", null);
-__decorate([
- __param(0, Decorators_1.NotNull),
- __param(2, Decorators_1.NotNull),
- __param(3, Decorators_1.NotNull),
- __param(4, Decorators_1.NotNull),
- __param(5, Decorators_1.NotNull)
-], LL1Analyzer.prototype, "_LOOK", null);
-LL1Analyzer = __decorate([
- __param(0, Decorators_1.NotNull)
-], LL1Analyzer);
-exports.LL1Analyzer = LL1Analyzer;
-//# sourceMappingURL=LL1Analyzer.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LL1Analyzer.js.map b/node_modules/antlr4ts/atn/LL1Analyzer.js.map
deleted file mode 100644
index 7ba0589..0000000
--- a/node_modules/antlr4ts/atn/LL1Analyzer.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LL1Analyzer.js","sourceRoot":"","sources":["../../../src/atn/LL1Analyzer.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,+EAA4E;AAC5E,2DAAwD;AAExD,2CAAwC;AAExC,2CAAwC;AACxC,qDAAkD;AAClD,8CAAwC;AACxC,yDAAsD;AACtD,+EAA4E;AAC5E,2DAAwD;AACxD,mDAAgD;AAChD,qDAAkD;AAElD,oCAAiC;AAEjC,6DAA0D;AAE1D,IAAa,WAAW,GAAxB;IASC,YAAqB,GAAQ,IAAI,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;IAElD;;;;;;;;;OASG;IACH,oBAAoB,CAAC,CAAuB;QAC7C,kDAAkD;QAChD,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAED,IAAI,IAAI,GAAgC,IAAI,KAAK,CAAc,CAAC,CAAC,mBAAmB,CAAC,CAAC;QACtF,GAAG,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,mBAAmB,EAAE,GAAG,EAAE,EAAE,CAAC;YACtD,IAAI,OAAO,GAA4B,IAAI,yBAAW,EAAE,CAAC;YACzD,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC;YACpB,IAAI,QAAQ,GAA8B,IAAI,+BAAc,CAAY,mDAAwB,CAAC,QAAQ,CAAC,CAAC;YAC3G,IAAI,YAAY,GAAY,KAAK,CAAC,CAAC,kCAAkC;YACrE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,SAAS,EAAE,qCAAiB,CAAC,WAAW,EAC5E,OAAO,EAAE,QAAQ,EAAE,IAAI,eAAM,EAAE,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;YACvD,8DAA8D;YAC9D,8CAA8C;YAC9C,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAClE,OAAO,GAAG,SAAS,CAAC;gBACpB,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC;YACrB,CAAC;QACF,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IA2CD,IAAI,CAAU,CAAW,EAAW,GAAsB,EAAE,SAA2B;QACtF,EAAE,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC;gBACnB,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;YAClC,CAAC;YAED,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAChD,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC;YAC/B,2GAA2G;YAC3G,8DAA8D;YAC9D,SAAS,GAAG,SAAS,CAAC;QACvB,CAAC;QAED,IAAI,CAAC,GAAgB,IAAI,yBAAW,EAAE,CAAC;QACvC,IAAI,YAAY,GAAY,IAAI,CAAC,CAAC,kCAAkC;QACpE,IAAI,MAAM,GAAY,IAAI,CAAC;QAC3B,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,+BAAc,EAAa,EAAE,IAAI,eAAM,EAAE,EAAE,YAAY,EAAE,MAAM,CAAC,CAAC;QACtG,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA8BG;IACO,KAAK,CAAU,CAAW,EACnC,SAA+B,EACtB,GAAsB,EACtB,IAAiB,EACjB,QAAmC,EACnC,eAAuB,EAChC,YAAqB,EACrB,MAAe;QACjB,4DAA4D;QAC1D,IAAI,CAAC,GAAc,qBAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;QAC/C,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAAC,MAAM,CAAC;QAE7B,EAAE,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC;YACrB,EAAE,CAAC,CAAC,qCAAiB,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACzC,IAAI,CAAC,GAAG,CAAC,aAAK,CAAC,OAAO,CAAC,CAAC;gBACxB,MAAM,CAAC;YACR,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;gBACxB,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;oBACZ,IAAI,CAAC,GAAG,CAAC,aAAK,CAAC,GAAG,CAAC,CAAC;gBACrB,CAAC;gBAED,MAAM,CAAC;YACR,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,YAAY,6BAAa,CAAC,CAAC,CAAC;YAChC,EAAE,CAAC,CAAC,GAAG,CAAC,OAAO,IAAI,CAAC,qCAAiB,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACzD,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;oBACZ,IAAI,CAAC,GAAG,CAAC,aAAK,CAAC,GAAG,CAAC,CAAC;gBACrB,CAAC;gBAED,MAAM,CAAC;YACR,CAAC;YAED,IAAI,OAAO,GAAY,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACxD,IAAI,CAAC;gBACJ,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBACnC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnC,EAAE,CAAC,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,qCAAiB,CAAC,oBAAoB,CAAC,CAAC,CAAC;wBACtE,QAAQ,CAAC;oBACV,CAAC;oBAED,IAAI,WAAW,GAAa,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxE,uDAAuD;oBAClD,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,CAAC,CAAC;gBAC7G,CAAC;YACF,CAAC;oBACO,CAAC;gBACR,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;oBACb,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBAClC,CAAC;YACF,CAAC;QACF,CAAC;QAED,IAAI,CAAC,GAAW,CAAC,CAAC,mBAAmB,CAAC;QACtC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,CAAC,GAAe,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACpC,EAAE,CAAC,CAAC,CAAC,YAAY,+BAAc,CAAC,CAAC,CAAC;gBACjC,EAAE,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;oBACtC,QAAQ,CAAC;gBACV,CAAC;gBAED,IAAI,UAAU,GAAsB,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;gBAE5E,IAAI,CAAC;oBACJ,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;oBACjC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,CAAC,CAAC;gBACpG,CAAC;wBACO,CAAC;oBACR,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBACpC,CAAC;YACF,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,yDAA2B,CAAC,CAAC,CAAC;gBACnD,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;oBAClB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,CAAC,CAAC;gBAC7F,CAAC;gBACD,IAAI,CAAC,CAAC;oBACL,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;gBAChC,CAAC;YACF,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;gBACtB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,CAAC,CAAC;YAC7F,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,uCAAkB,CAAC,CAAC,CAAC;gBAC1C,IAAI,CAAC,MAAM,CAAC,yBAAW,CAAC,EAAE,CAAC,aAAK,CAAC,mBAAmB,EAAE,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC;YAC/E,CAAC;YACD,IAAI,CAAC,CAAC;gBACT,uCAAuC;gBACnC,IAAI,GAAG,GAAyC,CAAE,CAAC,KAAK,CAAC;gBACzD,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC;oBACjB,EAAE,CAAC,CAAC,CAAC,YAAY,mCAAgB,CAAC,CAAC,CAAC;wBACnC,GAAG,GAAG,GAAG,CAAC,UAAU,CAAC,yBAAW,CAAC,EAAE,CAAC,aAAK,CAAC,mBAAmB,EAAE,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC;oBACxF,CAAC;oBACD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBAClB,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;CACD,CAAA;AA1OA;;GAEG;AACa,oBAAQ,GAAW,aAAK,CAAC,YAAY,CAAC;AAGtD;IADC,oBAAO;wCACC;AA+ET;IADC,oBAAO;IACF,WAAA,oBAAO,CAAA,EAAe,WAAA,oBAAO,CAAA;uCAkBlC;AAiCD;IAAiB,WAAA,oBAAO,CAAA;IAEtB,WAAA,oBAAO,CAAA;IACP,WAAA,oBAAO,CAAA;IACP,WAAA,oBAAO,CAAA;IACP,WAAA,oBAAO,CAAA;wCA4FR;AA1OW,WAAW;IASV,WAAA,oBAAO,CAAA;GATR,WAAW,CA2OvB;AA3OY,kCAAW"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerATNSimulator.d.ts b/node_modules/antlr4ts/atn/LexerATNSimulator.d.ts
deleted file mode 100644
index 4e8f352..0000000
--- a/node_modules/antlr4ts/atn/LexerATNSimulator.d.ts
+++ /dev/null
@@ -1,152 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATN } from './ATN';
-import { ATNConfig } from './ATNConfig';
-import { ATNConfigSet } from './ATNConfigSet';
-import { ATNSimulator } from './ATNSimulator';
-import { ATNState } from './ATNState';
-import { CharStream } from '../CharStream';
-import { DFA } from '../dfa/DFA';
-import { DFAState } from '../dfa/DFAState';
-import { Lexer } from '../Lexer';
-import { LexerActionExecutor } from './LexerActionExecutor';
-import { Transition } from './Transition';
-/** "dup" of ParserInterpreter */
-export declare class LexerATNSimulator extends ATNSimulator {
- optimize_tail_calls: boolean;
- protected recog: Lexer | undefined;
- /** The current token's starting index into the character stream.
- * Shared across DFA to ATN simulation in case the ATN fails and the
- * DFA did not have a previous accept state. In this case, we use the
- * ATN-generated exception object.
- */
- protected startIndex: number;
- /** line number 1..n within the input */
- private _line;
- /** The index of the character relative to the beginning of the line 0..n-1 */
- private _charPositionInLine;
- protected mode: number;
- /** Used during DFA/ATN exec to record the most recent accept configuration info */
- protected prevAccept: LexerATNSimulator.SimState;
- static match_calls: number;
- constructor(atn: ATN);
- constructor(atn: ATN, recog: Lexer | undefined);
- copyState(simulator: LexerATNSimulator): void;
- match(input: CharStream, mode: number): number;
- reset(): void;
- protected matchATN(input: CharStream): number;
- protected execATN(input: CharStream, ds0: DFAState): number;
- /**
- * Get an existing target state for an edge in the DFA. If the target state
- * for the edge has not yet been computed or is otherwise not available,
- * this method returns {@code null}.
- *
- * @param s The current DFA state
- * @param t The next input symbol
- * @return The existing target DFA state for the given input symbol
- * {@code t}, or {@code null} if the target state for this edge is not
- * already cached
- */
- protected getExistingTargetState(s: DFAState, t: number): DFAState | undefined;
- /**
- * Compute a target state for an edge in the DFA, and attempt to add the
- * computed state and corresponding edge to the DFA.
- *
- * @param input The input stream
- * @param s The current DFA state
- * @param t The next input symbol
- *
- * @return The computed target DFA state for the given input symbol
- * {@code t}. If {@code t} does not lead to a valid DFA state, this method
- * returns {@link #ERROR}.
- */
- protected computeTargetState(input: CharStream, s: DFAState, t: number): DFAState;
- protected failOrAccept(prevAccept: LexerATNSimulator.SimState, input: CharStream, reach: ATNConfigSet, t: number): number;
- /** Given a starting configuration set, figure out all ATN configurations
- * we can reach upon input {@code t}. Parameter {@code reach} is a return
- * parameter.
- */
- protected getReachableConfigSet(input: CharStream, closure: ATNConfigSet, reach: ATNConfigSet, t: number): void;
- protected accept(input: CharStream, lexerActionExecutor: LexerActionExecutor | undefined, startIndex: number, index: number, line: number, charPos: number): void;
- protected getReachableTarget(trans: Transition, t: number): ATNState | undefined;
- protected computeStartState(input: CharStream, p: ATNState): ATNConfigSet;
- /**
- * Since the alternatives within any lexer decision are ordered by
- * preference, this method stops pursuing the closure as soon as an accept
- * state is reached. After the first accept state is reached by depth-first
- * search from {@code config}, all other (potentially reachable) states for
- * this rule would have a lower priority.
- *
- * @return {@code true} if an accept state is reached, otherwise
- * {@code false}.
- */
- protected closure(input: CharStream, config: ATNConfig, configs: ATNConfigSet, currentAltReachedAcceptState: boolean, speculative: boolean, treatEofAsEpsilon: boolean): boolean;
- protected getEpsilonTarget(input: CharStream, config: ATNConfig, t: Transition, configs: ATNConfigSet, speculative: boolean, treatEofAsEpsilon: boolean): ATNConfig | undefined;
- /**
- * Evaluate a predicate specified in the lexer.
- *
- * If {@code speculative} is {@code true}, this method was called before
- * {@link #consume} for the matched character. This method should call
- * {@link #consume} before evaluating the predicate to ensure position
- * sensitive values, including {@link Lexer#getText}, {@link Lexer#getLine},
- * and {@link Lexer#getCharPositionInLine}, properly reflect the current
- * lexer state. This method should restore {@code input} and the simulator
- * to the original state before returning (i.e. undo the actions made by the
- * call to {@link #consume}.
- *
- * @param input The input stream.
- * @param ruleIndex The rule containing the predicate.
- * @param predIndex The index of the predicate within the rule.
- * @param speculative {@code true} if the current index in {@code input} is
- * one character before the predicate's location.
- *
- * @return {@code true} if the specified predicate evaluates to
- * {@code true}.
- */
- protected evaluatePredicate(input: CharStream, ruleIndex: number, predIndex: number, speculative: boolean): boolean;
- protected captureSimState(settings: LexerATNSimulator.SimState, input: CharStream, dfaState: DFAState): void;
- protected addDFAEdge(p: DFAState, t: number, q: ATNConfigSet): DFAState;
- protected addDFAEdge(p: DFAState, t: number, q: DFAState): void;
- /** Add a new DFA state if there isn't one with this set of
- configurations already. This method also detects the first
- configuration containing an ATN rule stop state. Later, when
- traversing the DFA, we will know which rule to accept.
- */
- protected addDFAState(configs: ATNConfigSet): DFAState;
- getDFA(mode: number): DFA;
- /** Get the text matched so far for the current token.
- */
- getText(input: CharStream): string;
- line: number;
- charPositionInLine: number;
- consume(input: CharStream): void;
- getTokenName(t: number): string;
-}
-export declare namespace LexerATNSimulator {
- const debug: boolean;
- const dfa_debug: boolean;
- /** When we hit an accept state in either the DFA or the ATN, we
- * have to notify the character stream to start buffering characters
- * via {@link IntStream#mark} and record the current state. The current sim state
- * includes the current index into the input, the current line,
- * and current character position in that line. Note that the Lexer is
- * tracking the starting line and characterization of the token. These
- * variables track the "state" of the simulator when it hits an accept state.
- *
- * We track these variables separately for the DFA and ATN simulation
- * because the DFA simulation often has to fail over to the ATN
- * simulation. If the ATN simulation fails, we need the DFA to fall
- * back to its previously accepted state, if any. If the ATN succeeds,
- * then the ATN does the accept and the DFA simulator that invoked it
- * can simply return the predicted token type.
- */
- class SimState {
- index: number;
- line: number;
- charPos: number;
- dfaState?: DFAState;
- reset(): void;
- }
-}
diff --git a/node_modules/antlr4ts/atn/LexerATNSimulator.js b/node_modules/antlr4ts/atn/LexerATNSimulator.js
deleted file mode 100644
index fb4d322..0000000
--- a/node_modules/antlr4ts/atn/LexerATNSimulator.js
+++ /dev/null
@@ -1,716 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:29.1083066-07:00
-const AcceptStateInfo_1 = require("../dfa/AcceptStateInfo");
-const Stubs_1 = require("../misc/Stubs");
-const ATN_1 = require("./ATN");
-const ATNConfig_1 = require("./ATNConfig");
-const ATNConfigSet_1 = require("./ATNConfigSet");
-const ATNSimulator_1 = require("./ATNSimulator");
-const DFAState_1 = require("../dfa/DFAState");
-const Interval_1 = require("../misc/Interval");
-const IntStream_1 = require("../IntStream");
-const Lexer_1 = require("../Lexer");
-const LexerActionExecutor_1 = require("./LexerActionExecutor");
-const LexerNoViableAltException_1 = require("../LexerNoViableAltException");
-const Decorators_1 = require("../Decorators");
-const OrderedATNConfigSet_1 = require("./OrderedATNConfigSet");
-const PredictionContext_1 = require("./PredictionContext");
-const RuleStopState_1 = require("./RuleStopState");
-const Token_1 = require("../Token");
-const assert = require("assert");
-/** "dup" of ParserInterpreter */
-let LexerATNSimulator = class LexerATNSimulator extends ATNSimulator_1.ATNSimulator {
- constructor(atn, recog) {
- super(atn);
- this.optimize_tail_calls = true;
- /** The current token's starting index into the character stream.
- * Shared across DFA to ATN simulation in case the ATN fails and the
- * DFA did not have a previous accept state. In this case, we use the
- * ATN-generated exception object.
- */
- this.startIndex = -1;
- /** line number 1..n within the input */
- this._line = 1;
- /** The index of the character relative to the beginning of the line 0..n-1 */
- this._charPositionInLine = 0;
- this.mode = Lexer_1.Lexer.DEFAULT_MODE;
- /** Used during DFA/ATN exec to record the most recent accept configuration info */
- this.prevAccept = new LexerATNSimulator.SimState();
- this.recog = recog;
- }
- copyState(simulator) {
- this._charPositionInLine = simulator.charPositionInLine;
- this._line = simulator._line;
- this.mode = simulator.mode;
- this.startIndex = simulator.startIndex;
- }
- match(input, mode) {
- LexerATNSimulator.match_calls++;
- this.mode = mode;
- let mark = input.mark();
- try {
- this.startIndex = input.index;
- this.prevAccept.reset();
- let s0 = this.atn.modeToDFA[mode].s0;
- if (s0 == null) {
- return this.matchATN(input);
- }
- else {
- return this.execATN(input, s0);
- }
- }
- finally {
- input.release(mark);
- }
- }
- reset() {
- this.prevAccept.reset();
- this.startIndex = -1;
- this._line = 1;
- this._charPositionInLine = 0;
- this.mode = Lexer_1.Lexer.DEFAULT_MODE;
- }
- matchATN(input) {
- let startState = this.atn.modeToStartState[this.mode];
- if (LexerATNSimulator.debug) {
- console.log(`matchATN mode ${this.mode} start: ${startState}`);
- }
- let old_mode = this.mode;
- let s0_closure = this.computeStartState(input, startState);
- let suppressEdge = s0_closure.hasSemanticContext;
- if (suppressEdge) {
- s0_closure.hasSemanticContext = false;
- }
- let next = this.addDFAState(s0_closure);
- if (!suppressEdge) {
- let dfa = this.atn.modeToDFA[this.mode];
- if (!dfa.s0) {
- dfa.s0 = next;
- }
- else {
- next = dfa.s0;
- }
- }
- let predict = this.execATN(input, next);
- if (LexerATNSimulator.debug) {
- console.log(`DFA after matchATN: ${this.atn.modeToDFA[old_mode].toLexerString()}`);
- }
- return predict;
- }
- execATN(input, ds0) {
- // console.log("enter exec index "+input.index+" from "+ds0.configs);
- if (LexerATNSimulator.debug) {
- console.log(`start state closure=${ds0.configs}`);
- }
- if (ds0.isAcceptState) {
- // allow zero-length tokens
- this.captureSimState(this.prevAccept, input, ds0);
- }
- let t = input.LA(1);
- // @NotNull
- let s = ds0; // s is current/from DFA state
- while (true) {
- if (LexerATNSimulator.debug) {
- console.log(`execATN loop starting closure: ${s.configs}`);
- }
- // As we move src->trg, src->trg, we keep track of the previous trg to
- // avoid looking up the DFA state again, which is expensive.
- // If the previous target was already part of the DFA, we might
- // be able to avoid doing a reach operation upon t. If s!=null,
- // it means that semantic predicates didn't prevent us from
- // creating a DFA state. Once we know s!=null, we check to see if
- // the DFA state has an edge already for t. If so, we can just reuse
- // it's configuration set; there's no point in re-computing it.
- // This is kind of like doing DFA simulation within the ATN
- // simulation because DFA simulation is really just a way to avoid
- // computing reach/closure sets. Technically, once we know that
- // we have a previously added DFA state, we could jump over to
- // the DFA simulator. But, that would mean popping back and forth
- // a lot and making things more complicated algorithmically.
- // This optimization makes a lot of sense for loops within DFA.
- // A character will take us back to an existing DFA state
- // that already has lots of edges out of it. e.g., .* in comments.
- let target = this.getExistingTargetState(s, t);
- if (target == null) {
- target = this.computeTargetState(input, s, t);
- }
- if (target === ATNSimulator_1.ATNSimulator.ERROR) {
- break;
- }
- // If this is a consumable input element, make sure to consume before
- // capturing the accept state so the input index, line, and char
- // position accurately reflect the state of the interpreter at the
- // end of the token.
- if (t !== IntStream_1.IntStream.EOF) {
- this.consume(input);
- }
- if (target.isAcceptState) {
- this.captureSimState(this.prevAccept, input, target);
- if (t === IntStream_1.IntStream.EOF) {
- break;
- }
- }
- t = input.LA(1);
- s = target; // flip; current DFA target becomes new src/from state
- }
- return this.failOrAccept(this.prevAccept, input, s.configs, t);
- }
- /**
- * Get an existing target state for an edge in the DFA. If the target state
- * for the edge has not yet been computed or is otherwise not available,
- * this method returns {@code null}.
- *
- * @param s The current DFA state
- * @param t The next input symbol
- * @return The existing target DFA state for the given input symbol
- * {@code t}, or {@code null} if the target state for this edge is not
- * already cached
- */
- getExistingTargetState(s, t) {
- let target = s.getTarget(t);
- if (LexerATNSimulator.debug && target != null) {
- console.log("reuse state " + s.stateNumber +
- " edge to " + target.stateNumber);
- }
- return target;
- }
- /**
- * Compute a target state for an edge in the DFA, and attempt to add the
- * computed state and corresponding edge to the DFA.
- *
- * @param input The input stream
- * @param s The current DFA state
- * @param t The next input symbol
- *
- * @return The computed target DFA state for the given input symbol
- * {@code t}. If {@code t} does not lead to a valid DFA state, this method
- * returns {@link #ERROR}.
- */
- computeTargetState(input, s, t) {
- let reach = new OrderedATNConfigSet_1.OrderedATNConfigSet();
- // if we don't find an existing DFA state
- // Fill reach starting from closure, following t transitions
- this.getReachableConfigSet(input, s.configs, reach, t);
- if (reach.isEmpty) {
- if (!reach.hasSemanticContext) {
- // we got nowhere on t, don't throw out this knowledge; it'd
- // cause a failover from DFA later.
- this.addDFAEdge(s, t, ATNSimulator_1.ATNSimulator.ERROR);
- }
- // stop when we can't match any more char
- return ATNSimulator_1.ATNSimulator.ERROR;
- }
- // Add an edge from s to target DFA found/created for reach
- return this.addDFAEdge(s, t, reach);
- }
- failOrAccept(prevAccept, input, reach, t) {
- if (prevAccept.dfaState != null) {
- let lexerActionExecutor = prevAccept.dfaState.lexerActionExecutor;
- this.accept(input, lexerActionExecutor, this.startIndex, prevAccept.index, prevAccept.line, prevAccept.charPos);
- return prevAccept.dfaState.prediction;
- }
- else {
- // if no accept and EOF is first char, return EOF
- if (t === IntStream_1.IntStream.EOF && input.index === this.startIndex) {
- return Token_1.Token.EOF;
- }
- throw new LexerNoViableAltException_1.LexerNoViableAltException(this.recog, input, this.startIndex, reach);
- }
- }
- /** Given a starting configuration set, figure out all ATN configurations
- * we can reach upon input {@code t}. Parameter {@code reach} is a return
- * parameter.
- */
- getReachableConfigSet(input, closure, reach, t) {
- // this is used to skip processing for configs which have a lower priority
- // than a config that already reached an accept state for the same rule
- let skipAlt = ATN_1.ATN.INVALID_ALT_NUMBER;
- for (let c of Stubs_1.asIterable(closure)) {
- let currentAltReachedAcceptState = c.alt === skipAlt;
- if (currentAltReachedAcceptState && c.hasPassedThroughNonGreedyDecision) {
- continue;
- }
- if (LexerATNSimulator.debug) {
- console.log(`testing ${this.getTokenName(t)} at ${c.toString(this.recog, true)}`);
- }
- let n = c.state.numberOfOptimizedTransitions;
- for (let ti = 0; ti < n; ti++) {
- let trans = c.state.getOptimizedTransition(ti);
- let target = this.getReachableTarget(trans, t);
- if (target != null) {
- let lexerActionExecutor = c.lexerActionExecutor;
- let config;
- if (lexerActionExecutor != null) {
- lexerActionExecutor = lexerActionExecutor.fixOffsetBeforeMatch(input.index - this.startIndex);
- config = c.transform(target, true, lexerActionExecutor);
- }
- else {
- assert(c.lexerActionExecutor == null);
- config = c.transform(target, true);
- }
- let treatEofAsEpsilon = t === IntStream_1.IntStream.EOF;
- if (this.closure(input, config, reach, currentAltReachedAcceptState, true, treatEofAsEpsilon)) {
- // any remaining configs for this alt have a lower priority than
- // the one that just reached an accept state.
- skipAlt = c.alt;
- break;
- }
- }
- }
- }
- }
- accept(input, lexerActionExecutor, startIndex, index, line, charPos) {
- if (LexerATNSimulator.debug) {
- console.log(`ACTION ${lexerActionExecutor}`);
- }
- // seek to after last char in token
- input.seek(index);
- this._line = line;
- this._charPositionInLine = charPos;
- if (lexerActionExecutor != null && this.recog != null) {
- lexerActionExecutor.execute(this.recog, input, startIndex);
- }
- }
- getReachableTarget(trans, t) {
- if (trans.matches(t, Lexer_1.Lexer.MIN_CHAR_VALUE, Lexer_1.Lexer.MAX_CHAR_VALUE)) {
- return trans.target;
- }
- return undefined;
- }
- computeStartState(input, p) {
- let initialContext = PredictionContext_1.PredictionContext.EMPTY_FULL;
- let configs = new OrderedATNConfigSet_1.OrderedATNConfigSet();
- for (let i = 0; i < p.numberOfTransitions; i++) {
- let target = p.transition(i).target;
- let c = ATNConfig_1.ATNConfig.create(target, i + 1, initialContext);
- this.closure(input, c, configs, false, false, false);
- }
- return configs;
- }
- /**
- * Since the alternatives within any lexer decision are ordered by
- * preference, this method stops pursuing the closure as soon as an accept
- * state is reached. After the first accept state is reached by depth-first
- * search from {@code config}, all other (potentially reachable) states for
- * this rule would have a lower priority.
- *
- * @return {@code true} if an accept state is reached, otherwise
- * {@code false}.
- */
- closure(input, config, configs, currentAltReachedAcceptState, speculative, treatEofAsEpsilon) {
- if (LexerATNSimulator.debug) {
- console.log("closure(" + config.toString(this.recog, true) + ")");
- }
- if (config.state instanceof RuleStopState_1.RuleStopState) {
- if (LexerATNSimulator.debug) {
- if (this.recog != null) {
- console.log(`closure at ${this.recog.ruleNames[config.state.ruleIndex]} rule stop ${config}`);
- }
- else {
- console.log(`closure at rule stop ${config}`);
- }
- }
- let context = config.context;
- if (context.isEmpty) {
- configs.add(config);
- return true;
- }
- else if (context.hasEmpty) {
- configs.add(config.transform(config.state, true, PredictionContext_1.PredictionContext.EMPTY_FULL));
- currentAltReachedAcceptState = true;
- }
- for (let i = 0; i < context.size; i++) {
- let returnStateNumber = context.getReturnState(i);
- if (returnStateNumber == PredictionContext_1.PredictionContext.EMPTY_FULL_STATE_KEY) {
- continue;
- }
- let newContext = context.getParent(i); // "pop" return state
- let returnState = this.atn.states[returnStateNumber];
- let c = config.transform(returnState, false, newContext);
- currentAltReachedAcceptState = this.closure(input, c, configs, currentAltReachedAcceptState, speculative, treatEofAsEpsilon);
- }
- return currentAltReachedAcceptState;
- }
- // optimization
- if (!config.state.onlyHasEpsilonTransitions) {
- if (!currentAltReachedAcceptState || !config.hasPassedThroughNonGreedyDecision) {
- configs.add(config);
- }
- }
- let p = config.state;
- for (let i = 0; i < p.numberOfOptimizedTransitions; i++) {
- let t = p.getOptimizedTransition(i);
- let c = this.getEpsilonTarget(input, config, t, configs, speculative, treatEofAsEpsilon);
- if (c != null) {
- currentAltReachedAcceptState = this.closure(input, c, configs, currentAltReachedAcceptState, speculative, treatEofAsEpsilon);
- }
- }
- return currentAltReachedAcceptState;
- }
- // side-effect: can alter configs.hasSemanticContext
- getEpsilonTarget(input, config, t, configs, speculative, treatEofAsEpsilon) {
- let c;
- switch (t.serializationType) {
- case 3 /* RULE */:
- let ruleTransition = t;
- if (this.optimize_tail_calls && ruleTransition.optimizedTailCall && !config.context.hasEmpty) {
- c = config.transform(t.target, true);
- }
- else {
- let newContext = config.context.getChild(ruleTransition.followState.stateNumber);
- c = config.transform(t.target, true, newContext);
- }
- break;
- case 10 /* PRECEDENCE */:
- throw new Error("Precedence predicates are not supported in lexers.");
- case 4 /* PREDICATE */:
- /* Track traversing semantic predicates. If we traverse,
- we cannot add a DFA state for this "reach" computation
- because the DFA would not test the predicate again in the
- future. Rather than creating collections of semantic predicates
- like v3 and testing them on prediction, v4 will test them on the
- fly all the time using the ATN not the DFA. This is slower but
- semantically it's not used that often. One of the key elements to
- this predicate mechanism is not adding DFA states that see
- predicates immediately afterwards in the ATN. For example,
-
- a : ID {p1}? | ID {p2}? ;
-
- should create the start state for rule 'a' (to save start state
- competition), but should not create target of ID state. The
- collection of ATN states the following ID references includes
- states reached by traversing predicates. Since this is when we
- test them, we cannot cash the DFA state target of ID.
- */
- let pt = t;
- if (LexerATNSimulator.debug) {
- console.log("EVAL rule " + pt.ruleIndex + ":" + pt.predIndex);
- }
- configs.hasSemanticContext = true;
- if (this.evaluatePredicate(input, pt.ruleIndex, pt.predIndex, speculative)) {
- c = config.transform(t.target, true);
- }
- else {
- c = undefined;
- }
- break;
- case 6 /* ACTION */:
- if (config.context.hasEmpty) {
- // execute actions anywhere in the start rule for a token.
- //
- // TODO: if the entry rule is invoked recursively, some
- // actions may be executed during the recursive call. The
- // problem can appear when hasEmpty is true but
- // isEmpty is false. In this case, the config needs to be
- // split into two contexts - one with just the empty path
- // and another with everything but the empty path.
- // Unfortunately, the current algorithm does not allow
- // getEpsilonTarget to return two configurations, so
- // additional modifications are needed before we can support
- // the split operation.
- let lexerActionExecutor = LexerActionExecutor_1.LexerActionExecutor.append(config.lexerActionExecutor, this.atn.lexerActions[t.actionIndex]);
- c = config.transform(t.target, true, lexerActionExecutor);
- break;
- }
- else {
- // ignore actions in referenced rules
- c = config.transform(t.target, true);
- break;
- }
- case 1 /* EPSILON */:
- c = config.transform(t.target, true);
- break;
- case 5 /* ATOM */:
- case 2 /* RANGE */:
- case 7 /* SET */:
- if (treatEofAsEpsilon) {
- if (t.matches(IntStream_1.IntStream.EOF, Lexer_1.Lexer.MIN_CHAR_VALUE, Lexer_1.Lexer.MAX_CHAR_VALUE)) {
- c = config.transform(t.target, false);
- break;
- }
- }
- c = undefined;
- break;
- default:
- c = undefined;
- break;
- }
- return c;
- }
- /**
- * Evaluate a predicate specified in the lexer.
- *
- * If {@code speculative} is {@code true}, this method was called before
- * {@link #consume} for the matched character. This method should call
- * {@link #consume} before evaluating the predicate to ensure position
- * sensitive values, including {@link Lexer#getText}, {@link Lexer#getLine},
- * and {@link Lexer#getCharPositionInLine}, properly reflect the current
- * lexer state. This method should restore {@code input} and the simulator
- * to the original state before returning (i.e. undo the actions made by the
- * call to {@link #consume}.
- *
- * @param input The input stream.
- * @param ruleIndex The rule containing the predicate.
- * @param predIndex The index of the predicate within the rule.
- * @param speculative {@code true} if the current index in {@code input} is
- * one character before the predicate's location.
- *
- * @return {@code true} if the specified predicate evaluates to
- * {@code true}.
- */
- evaluatePredicate(input, ruleIndex, predIndex, speculative) {
- // assume true if no recognizer was provided
- if (this.recog == null) {
- return true;
- }
- if (!speculative) {
- return this.recog.sempred(undefined, ruleIndex, predIndex);
- }
- let savedCharPositionInLine = this._charPositionInLine;
- let savedLine = this._line;
- let index = input.index;
- let marker = input.mark();
- try {
- this.consume(input);
- return this.recog.sempred(undefined, ruleIndex, predIndex);
- }
- finally {
- this._charPositionInLine = savedCharPositionInLine;
- this._line = savedLine;
- input.seek(index);
- input.release(marker);
- }
- }
- captureSimState(settings, input, dfaState) {
- settings.index = input.index;
- settings.line = this._line;
- settings.charPos = this._charPositionInLine;
- settings.dfaState = dfaState;
- }
- addDFAEdge(p, t, q) {
- if (q instanceof ATNConfigSet_1.ATNConfigSet) {
- /* leading to this call, ATNConfigSet.hasSemanticContext is used as a
- * marker indicating dynamic predicate evaluation makes this edge
- * dependent on the specific input sequence, so the static edge in the
- * DFA should be omitted. The target DFAState is still created since
- * execATN has the ability to resynchronize with the DFA state cache
- * following the predicate evaluation step.
- *
- * TJP notes: next time through the DFA, we see a pred again and eval.
- * If that gets us to a previously created (but dangling) DFA
- * state, we can continue in pure DFA mode from there.
- */
- let suppressEdge = q.hasSemanticContext;
- if (suppressEdge) {
- q.hasSemanticContext = false;
- }
- // @NotNull
- let to = this.addDFAState(q);
- if (suppressEdge) {
- return to;
- }
- this.addDFAEdge(p, t, to);
- return to;
- }
- else {
- if (LexerATNSimulator.debug) {
- console.log("EDGE " + p + " -> " + q + " upon " + String.fromCharCode(t));
- }
- if (p != null) {
- p.setTarget(t, q);
- }
- }
- }
- /** Add a new DFA state if there isn't one with this set of
- configurations already. This method also detects the first
- configuration containing an ATN rule stop state. Later, when
- traversing the DFA, we will know which rule to accept.
- */
- addDFAState(configs) {
- /* the lexer evaluates predicates on-the-fly; by this point configs
- * should not contain any configurations with unevaluated predicates.
- */
- assert(!configs.hasSemanticContext);
- let proposed = new DFAState_1.DFAState(configs);
- let existing = this.atn.modeToDFA[this.mode].states.get(proposed);
- if (existing != null)
- return existing;
- configs.optimizeConfigs(this);
- let newState = new DFAState_1.DFAState(configs.clone(true));
- let firstConfigWithRuleStopState = undefined;
- for (let c of Stubs_1.asIterable(configs)) {
- if (c.state instanceof RuleStopState_1.RuleStopState) {
- firstConfigWithRuleStopState = c;
- break;
- }
- }
- if (firstConfigWithRuleStopState != null) {
- let prediction = this.atn.ruleToTokenType[firstConfigWithRuleStopState.state.ruleIndex];
- let lexerActionExecutor = firstConfigWithRuleStopState.lexerActionExecutor;
- newState.acceptStateInfo = new AcceptStateInfo_1.AcceptStateInfo(prediction, lexerActionExecutor);
- }
- return this.atn.modeToDFA[this.mode].addState(newState);
- }
- getDFA(mode) {
- return this.atn.modeToDFA[mode];
- }
- /** Get the text matched so far for the current token.
- */
- getText(input) {
- // index is first lookahead char, don't include.
- return input.getText(Interval_1.Interval.of(this.startIndex, input.index - 1));
- }
- get line() {
- return this._line;
- }
- set line(line) {
- this._line = line;
- }
- get charPositionInLine() {
- return this._charPositionInLine;
- }
- set charPositionInLine(charPositionInLine) {
- this._charPositionInLine = charPositionInLine;
- }
- consume(input) {
- let curChar = input.LA(1);
- if (curChar == '\n'.charCodeAt(0)) {
- this._line++;
- this._charPositionInLine = 0;
- }
- else {
- this._charPositionInLine++;
- }
- input.consume();
- }
- getTokenName(t) {
- if (t === -1)
- return "EOF";
- //if ( atn.g!=null ) return atn.g.getTokenDisplayName(t);
- return "'" + String.fromCharCode(t) + "'";
- }
-};
-LexerATNSimulator.match_calls = 0;
-__decorate([
- Decorators_1.NotNull
-], LexerATNSimulator.prototype, "prevAccept", void 0);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], LexerATNSimulator.prototype, "copyState", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], LexerATNSimulator.prototype, "match", null);
-__decorate([
- Decorators_1.Override
-], LexerATNSimulator.prototype, "reset", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], LexerATNSimulator.prototype, "matchATN", null);
-__decorate([
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.NotNull)
-], LexerATNSimulator.prototype, "execATN", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], LexerATNSimulator.prototype, "getExistingTargetState", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.NotNull)
-], LexerATNSimulator.prototype, "computeTargetState", null);
-__decorate([
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.NotNull), __param(2, Decorators_1.NotNull)
-], LexerATNSimulator.prototype, "getReachableConfigSet", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], LexerATNSimulator.prototype, "accept", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull),
- __param(1, Decorators_1.NotNull)
-], LexerATNSimulator.prototype, "computeStartState", null);
-__decorate([
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.NotNull), __param(2, Decorators_1.NotNull)
-], LexerATNSimulator.prototype, "closure", null);
-__decorate([
- __param(0, Decorators_1.NotNull),
- __param(1, Decorators_1.NotNull),
- __param(2, Decorators_1.NotNull),
- __param(3, Decorators_1.NotNull)
-], LexerATNSimulator.prototype, "getEpsilonTarget", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], LexerATNSimulator.prototype, "evaluatePredicate", null);
-__decorate([
- __param(0, Decorators_1.NotNull),
- __param(1, Decorators_1.NotNull),
- __param(2, Decorators_1.NotNull)
-], LexerATNSimulator.prototype, "captureSimState", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull)
-], LexerATNSimulator.prototype, "addDFAState", null);
-__decorate([
- Decorators_1.NotNull
-], LexerATNSimulator.prototype, "getDFA", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull)
-], LexerATNSimulator.prototype, "getText", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], LexerATNSimulator.prototype, "consume", null);
-__decorate([
- Decorators_1.NotNull
-], LexerATNSimulator.prototype, "getTokenName", null);
-LexerATNSimulator = __decorate([
- __param(0, Decorators_1.NotNull)
-], LexerATNSimulator);
-exports.LexerATNSimulator = LexerATNSimulator;
-(function (LexerATNSimulator) {
- LexerATNSimulator.debug = false;
- LexerATNSimulator.dfa_debug = false;
- /** When we hit an accept state in either the DFA or the ATN, we
- * have to notify the character stream to start buffering characters
- * via {@link IntStream#mark} and record the current state. The current sim state
- * includes the current index into the input, the current line,
- * and current character position in that line. Note that the Lexer is
- * tracking the starting line and characterization of the token. These
- * variables track the "state" of the simulator when it hits an accept state.
- *
- * We track these variables separately for the DFA and ATN simulation
- * because the DFA simulation often has to fail over to the ATN
- * simulation. If the ATN simulation fails, we need the DFA to fall
- * back to its previously accepted state, if any. If the ATN succeeds,
- * then the ATN does the accept and the DFA simulator that invoked it
- * can simply return the predicted token type.
- */
- class SimState {
- constructor() {
- this.index = -1;
- this.line = 0;
- this.charPos = -1;
- }
- reset() {
- this.index = -1;
- this.line = 0;
- this.charPos = -1;
- this.dfaState = undefined;
- }
- }
- LexerATNSimulator.SimState = SimState;
-})(LexerATNSimulator = exports.LexerATNSimulator || (exports.LexerATNSimulator = {}));
-exports.LexerATNSimulator = LexerATNSimulator;
-//# sourceMappingURL=LexerATNSimulator.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerATNSimulator.js.map b/node_modules/antlr4ts/atn/LexerATNSimulator.js.map
deleted file mode 100644
index 954e759..0000000
--- a/node_modules/antlr4ts/atn/LexerATNSimulator.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LexerATNSimulator.js","sourceRoot":"","sources":["../../../src/atn/LexerATNSimulator.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,4DAAyD;AAEzD,yCAA2C;AAC3C,+BAA4B;AAC5B,2CAAwC;AACxC,iDAA8C;AAC9C,iDAA8C;AAI9C,8CAA2C;AAC3C,+CAA4C;AAC5C,4CAAyC;AACzC,oCAAiC;AACjC,+DAA4D;AAC5D,4EAAyE;AACzE,8CAAkD;AAClD,+DAA4D;AAC5D,2DAAwD;AAExD,mDAAgD;AAEhD,oCAAiC;AAGjC,iCAAiC;AAEjC,iCAAiC;AACjC,IAAa,iBAAiB,GAA9B,uBAA+B,SAAQ,2BAAY;IA4BlD,YAAqB,GAAQ,EAAE,KAAa;QAC3C,KAAK,CAAC,GAAG,CAAC,CAAC;QA5BZ,wBAAmB,GAAY,IAAI,CAAC;QAIpC;;;;WAIG;QACO,eAAU,GAAW,CAAC,CAAC,CAAC;QAElC,wCAAwC;QAChC,UAAK,GAAW,CAAC,CAAC;QAE1B,8EAA8E;QACtE,wBAAmB,GAAW,CAAC,CAAC;QAE9B,SAAI,GAAW,aAAK,CAAC,YAAY,CAAC;QAE5C,mFAAmF;QAEzE,eAAU,GAA+B,IAAI,iBAAiB,CAAC,QAAQ,EAAE,CAAC;QAQnF,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACpB,CAAC;IAED,SAAS,CAAU,SAA4B;QAC9C,IAAI,CAAC,mBAAmB,GAAG,SAAS,CAAC,kBAAkB,CAAC;QACxD,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC;QAC7B,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC;QAC3B,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC;IACxC,CAAC;IAED,KAAK,CAAU,KAAiB,EAAE,IAAY;QAC7C,iBAAiB,CAAC,WAAW,EAAE,CAAC;QAChC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,IAAI,GAAW,KAAK,CAAC,IAAI,EAAE,CAAC;QAChC,IAAI,CAAC;YACJ,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC;YAC9B,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;YACxB,IAAI,EAAE,GAAyB,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YAC3D,EAAE,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC;gBAChB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAChC,CAAC;QACF,CAAC;gBACO,CAAC;YACR,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;IACF,CAAC;IAGD,KAAK;QACJ,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,mBAAmB,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,IAAI,GAAG,aAAK,CAAC,YAAY,CAAC;IAChC,CAAC;IAES,QAAQ,CAAU,KAAiB;QAC5C,IAAI,UAAU,GAAa,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEhE,EAAE,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,OAAO,CAAC,GAAG,CAAC,iBAAiB,IAAI,CAAC,IAAI,WAAW,UAAU,EAAE,CAAC,CAAC;QAChE,CAAC;QAED,IAAI,QAAQ,GAAW,IAAI,CAAC,IAAI,CAAC;QAEjC,IAAI,UAAU,GAAiB,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QACzE,IAAI,YAAY,GAAY,UAAU,CAAC,kBAAkB,CAAC;QAC1D,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;YAClB,UAAU,CAAC,kBAAkB,GAAG,KAAK,CAAC;QACvC,CAAC;QAED,IAAI,IAAI,GAAa,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QAClD,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;YACnB,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;gBACb,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC;YACf,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACf,CAAC;QACF,CAAC;QAED,IAAI,OAAO,GAAW,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAEhD,EAAE,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,OAAO,CAAC,GAAG,CAAC,uBAAuB,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;QACpF,CAAC;QAED,MAAM,CAAC,OAAO,CAAC;IAChB,CAAC;IAES,OAAO,CAAU,KAAiB,EAAW,GAAa;QACnE,qEAAqE;QACrE,EAAE,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,OAAO,CAAC,GAAG,CAAC,uBAAuB,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;QACnD,CAAC;QAED,EAAE,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC;YACvB,2BAA2B;YAC3B,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QACnD,CAAC;QAED,IAAI,CAAC,GAAW,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5B,WAAW;QACX,IAAI,CAAC,GAAa,GAAG,CAAC,CAAC,8BAA8B;QAErD,OAAO,IAAI,EAAE,CAAC;YACb,EAAE,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC;gBAC7B,OAAO,CAAC,GAAG,CAAC,kCAAkC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;YAC5D,CAAC;YAED,sEAAsE;YACtE,4DAA4D;YAC5D,+DAA+D;YAC/D,+DAA+D;YAC/D,2DAA2D;YAC3D,iEAAiE;YACjE,oEAAoE;YACpE,+DAA+D;YAC/D,2DAA2D;YAC3D,kEAAkE;YAClE,+DAA+D;YAC/D,8DAA8D;YAC9D,iEAAiE;YACjE,4DAA4D;YAC5D,+DAA+D;YAC/D,yDAAyD;YACzD,kEAAkE;YAClE,IAAI,MAAM,GAAyB,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrE,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC;gBACpB,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/C,CAAC;YAED,EAAE,CAAC,CAAC,MAAM,KAAK,2BAAY,CAAC,KAAK,CAAC,CAAC,CAAC;gBACnC,KAAK,CAAC;YACP,CAAC;YAED,qEAAqE;YACrE,gEAAgE;YAChE,kEAAkE;YAClE,oBAAoB;YACpB,EAAE,CAAC,CAAC,CAAC,KAAK,qBAAS,CAAC,GAAG,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;YAED,EAAE,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC;gBAC1B,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACrD,EAAE,CAAC,CAAC,CAAC,KAAK,qBAAS,CAAC,GAAG,CAAC,CAAC,CAAC;oBACzB,KAAK,CAAC;gBACP,CAAC;YACF,CAAC;YAED,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC,GAAG,MAAM,CAAC,CAAC,sDAAsD;QACnE,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAChE,CAAC;IAED;;;;;;;;;;OAUG;IACO,sBAAsB,CAAU,CAAW,EAAE,CAAS;QAC/D,IAAI,MAAM,GAAyB,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAClD,EAAE,CAAC,CAAC,iBAAiB,CAAC,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC;YAC/C,OAAO,CAAC,GAAG,CAAC,cAAc,GAAG,CAAC,CAAC,WAAW;gBACzC,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;QACpC,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAED;;;;;;;;;;;OAWG;IAEO,kBAAkB,CAAU,KAAiB,EAAW,CAAW,EAAE,CAAS;QACvF,IAAI,KAAK,GAAiB,IAAI,yCAAmB,EAAE,CAAC;QAEpD,yCAAyC;QACzC,4DAA4D;QAC5D,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAEvD,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YACnB,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC,CAAC;gBAC/B,4DAA4D;gBAC5D,mCAAmC;gBACnC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,2BAAY,CAAC,KAAK,CAAC,CAAC;YAC3C,CAAC;YAED,yCAAyC;YACzC,MAAM,CAAC,2BAAY,CAAC,KAAK,CAAC;QAC3B,CAAC;QAED,2DAA2D;QAC3D,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IACrC,CAAC;IAES,YAAY,CAAC,UAAsC,EAAE,KAAiB,EAC/E,KAAmB,EAAE,CAAS;QAC9B,EAAE,CAAC,CAAC,UAAU,CAAC,QAAQ,IAAI,IAAI,CAAC,CAAC,CAAC;YACjC,IAAI,mBAAmB,GAAoC,UAAU,CAAC,QAAQ,CAAC,mBAAmB,CAAC;YACnG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,mBAAmB,EAAE,IAAI,CAAC,UAAU,EACtD,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;YACxD,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC;QACvC,CAAC;QACD,IAAI,CAAC,CAAC;YACL,iDAAiD;YACjD,EAAE,CAAC,CAAC,CAAC,KAAK,qBAAS,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,KAAK,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;gBAC5D,MAAM,CAAC,aAAK,CAAC,GAAG,CAAC;YAClB,CAAC;YAED,MAAM,IAAI,qDAAyB,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAChF,CAAC;IACF,CAAC;IAED;;;OAGG;IACO,qBAAqB,CAAU,KAAiB,EAAW,OAAqB,EAAW,KAAmB,EAAE,CAAS;QAClI,0EAA0E;QAC1E,uEAAuE;QACvE,IAAI,OAAO,GAAW,SAAG,CAAC,kBAAkB,CAAC;QAC7C,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,kBAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,4BAA4B,GAAY,CAAC,CAAC,GAAG,KAAK,OAAO,CAAC;YAC9D,EAAE,CAAC,CAAC,4BAA4B,IAAI,CAAC,CAAC,iCAAiC,CAAC,CAAC,CAAC;gBACzE,QAAQ,CAAC;YACV,CAAC;YAED,EAAE,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC;gBAC7B,OAAO,CAAC,GAAG,CAAC,WAAW,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;YACnF,CAAC;YAED,IAAI,CAAC,GAAW,CAAC,CAAC,KAAK,CAAC,4BAA4B,CAAC;YACrD,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;gBAC/B,IAAI,KAAK,GAAe,CAAC,CAAC,KAAK,CAAC,sBAAsB,CAAC,EAAE,CAAC,CAAC;gBAC3D,IAAI,MAAM,GAAyB,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBACrE,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC;oBACpB,IAAI,mBAAmB,GAAoC,CAAC,CAAC,mBAAmB,CAAC;oBACjF,IAAI,MAAiB,CAAC;oBACtB,EAAE,CAAC,CAAC,mBAAmB,IAAI,IAAI,CAAC,CAAC,CAAC;wBACjC,mBAAmB,GAAG,mBAAmB,CAAC,oBAAoB,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;wBAC9F,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,mBAAmB,CAAC,CAAC;oBACzD,CAAC;oBAAC,IAAI,CAAC,CAAC;wBACP,MAAM,CAAC,CAAC,CAAC,mBAAmB,IAAI,IAAI,CAAC,CAAC;wBACtC,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;oBACpC,CAAC;oBAED,IAAI,iBAAiB,GAAY,CAAC,KAAK,qBAAS,CAAC,GAAG,CAAC;oBACrD,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,4BAA4B,EAAE,IAAI,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC;wBAC/F,gEAAgE;wBAChE,6CAA6C;wBAC7C,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC;wBAChB,KAAK,CAAC;oBACP,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IAES,MAAM,CAAU,KAAiB,EAAE,mBAAoD,EAC1F,UAAkB,EAAE,KAAa,EAAE,IAAY,EAAE,OAAe;QACtE,EAAE,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,mBAAmB,EAAE,CAAC,CAAC;QAC9C,CAAC;QAED,mCAAmC;QACnC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,mBAAmB,GAAG,OAAO,CAAC;QAEnC,EAAE,CAAC,CAAC,mBAAmB,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC;YACvD,mBAAmB,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;QAC5D,CAAC;IACF,CAAC;IAES,kBAAkB,CAAC,KAAiB,EAAE,CAAS;QACxD,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,aAAK,CAAC,cAAc,EAAE,aAAK,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;YAClE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;QACrB,CAAC;QAED,MAAM,CAAC,SAAS,CAAC;IAClB,CAAC;IAGS,iBAAiB,CAAW,KAAiB,EAC7C,CAAW;QACpB,IAAI,cAAc,GAAsB,qCAAiB,CAAC,UAAU,CAAC;QACrE,IAAI,OAAO,GAAiB,IAAI,yCAAmB,EAAE,CAAC;QACtD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,mBAAmB,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,IAAI,MAAM,GAAa,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YAC9C,IAAI,CAAC,GAAc,qBAAS,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,CAAC;YACnE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACtD,CAAC;QACD,MAAM,CAAC,OAAO,CAAC;IAChB,CAAC;IAED;;;;;;;;;OASG;IACO,OAAO,CAAU,KAAiB,EAAW,MAAiB,EAAW,OAAqB,EAAE,4BAAqC,EAAE,WAAoB,EAAE,iBAA0B;QAChM,EAAE,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;QACnE,CAAC;QAED,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,YAAY,6BAAa,CAAC,CAAC,CAAC;YAC3C,EAAE,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC;gBAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC;oBACxB,OAAO,CAAC,GAAG,CAAC,cAAc,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,cAAc,MAAM,EAAE,CAAC,CAAC;gBAC/F,CAAC;gBACD,IAAI,CAAC,CAAC;oBACL,OAAO,CAAC,GAAG,CAAC,wBAAwB,MAAM,EAAE,CAAC,CAAC;gBAC/C,CAAC;YACF,CAAC;YAED,IAAI,OAAO,GAAsB,MAAM,CAAC,OAAO,CAAC;YAChD,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;gBACrB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACpB,MAAM,CAAC,IAAI,CAAC;YACb,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAC3B,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,qCAAiB,CAAC,UAAU,CAAC,CAAC,CAAC;gBAChF,4BAA4B,GAAG,IAAI,CAAC;YACrC,CAAC;YAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,IAAI,iBAAiB,GAAW,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;gBAC1D,EAAE,CAAC,CAAC,iBAAiB,IAAI,qCAAiB,CAAC,oBAAoB,CAAC,CAAC,CAAC;oBACjE,QAAQ,CAAC;gBACV,CAAC;gBAED,IAAI,UAAU,GAAsB,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,qBAAqB;gBAC/E,IAAI,WAAW,GAAa,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;gBAC/D,IAAI,CAAC,GAAc,MAAM,CAAC,SAAS,CAAC,WAAW,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;gBACpE,4BAA4B,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,4BAA4B,EAAE,WAAW,EAAE,iBAAiB,CAAC,CAAC;YAC9H,CAAC;YAED,MAAM,CAAC,4BAA4B,CAAC;QACrC,CAAC;QAED,eAAe;QACf,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,yBAAyB,CAAC,CAAC,CAAC;YAC7C,EAAE,CAAC,CAAC,CAAC,4BAA4B,IAAI,CAAC,MAAM,CAAC,iCAAiC,CAAC,CAAC,CAAC;gBAChF,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACrB,CAAC;QACF,CAAC;QAED,IAAI,CAAC,GAAa,MAAM,CAAC,KAAK,CAAC;QAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,4BAA4B,EAAE,CAAC,EAAE,EAAE,CAAC;YACzD,IAAI,CAAC,GAAe,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;YAChD,IAAI,CAAC,GAA0B,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,WAAW,EAAE,iBAAiB,CAAC,CAAC;YAChH,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;gBACf,4BAA4B,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,4BAA4B,EAAE,WAAW,EAAE,iBAAiB,CAAC,CAAC;YAC9H,CAAC;QACF,CAAC;QAED,MAAM,CAAC,4BAA4B,CAAC;IACrC,CAAC;IAED,oDAAoD;IAC1C,gBAAgB,CAAU,KAAiB,EAC3C,MAAiB,EACjB,CAAa,EACb,OAAqB,EAC9B,WAAoB,EACpB,iBAA0B;QAC1B,IAAI,CAAwB,CAAC;QAE7B,MAAM,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;YAC9B;gBACC,IAAI,cAAc,GAAmC,CAAC,CAAC;gBACvD,EAAE,CAAC,CAAC,IAAI,CAAC,mBAAmB,IAAI,cAAc,CAAC,iBAAiB,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAC9F,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBACtC,CAAC;gBACD,IAAI,CAAC,CAAC;oBACL,IAAI,UAAU,GAAsB,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;oBACpG,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;gBAClD,CAAC;gBAED,KAAK,CAAC;YAEP;gBACC,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAC;YAEvE;gBACC;;;;;;;;;;;;;;;;;kBAiBE;gBACF,IAAI,EAAE,GAA6C,CAAC,CAAC;gBACrD,EAAE,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC7B,OAAO,CAAC,GAAG,CAAC,YAAY,GAAG,EAAE,CAAC,SAAS,GAAG,GAAG,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;gBAC/D,CAAC;gBACD,OAAO,CAAC,kBAAkB,GAAG,IAAI,CAAC;gBAClC,EAAE,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,EAAE,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;oBAC5E,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBACtC,CAAC;gBACD,IAAI,CAAC,CAAC;oBACL,CAAC,GAAG,SAAS,CAAC;gBACf,CAAC;gBAED,KAAK,CAAC;YAEP;gBACC,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAC7B,0DAA0D;oBAC1D,EAAE;oBACF,uDAAuD;oBACvD,yDAAyD;oBACzD,+CAA+C;oBAC/C,yDAAyD;oBACzD,yDAAyD;oBACzD,kDAAkD;oBAClD,sDAAsD;oBACtD,oDAAoD;oBACpD,4DAA4D;oBAC5D,uBAAuB;oBACvB,IAAI,mBAAmB,GAAwB,yCAAmB,CAAC,MAAM,CAAC,MAAM,CAAC,mBAAmB,EAAE,IAAI,CAAC,GAAG,CAAC,YAAY,CAAoB,CAAE,CAAC,WAAW,CAAC,CAAC,CAAC;oBAChK,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,mBAAmB,CAAC,CAAC;oBAC1D,KAAK,CAAC;gBACP,CAAC;gBACD,IAAI,CAAC,CAAC;oBACL,qCAAqC;oBACrC,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;oBACrC,KAAK,CAAC;gBACP,CAAC;YAEF;gBACC,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBACrC,KAAK,CAAC;YAEP,kBAAyB;YACzB,mBAA0B;YAC1B;gBACC,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;oBACvB,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,qBAAS,CAAC,GAAG,EAAE,aAAK,CAAC,cAAc,EAAE,aAAK,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;wBAC1E,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;wBACtC,KAAK,CAAC;oBACP,CAAC;gBACF,CAAC;gBAED,CAAC,GAAG,SAAS,CAAC;gBACd,KAAK,CAAC;YAEP;gBACC,CAAC,GAAG,SAAS,CAAC;gBACd,KAAK,CAAC;QACP,CAAC;QAED,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAED;;;;;;;;;;;;;;;;;;;;OAoBG;IACO,iBAAiB,CAAU,KAAiB,EAAE,SAAiB,EAAE,SAAiB,EAAE,WAAoB;QACjH,4CAA4C;QAC5C,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QAC5D,CAAC;QAED,IAAI,uBAAuB,GAAW,IAAI,CAAC,mBAAmB,CAAC;QAC/D,IAAI,SAAS,GAAW,IAAI,CAAC,KAAK,CAAC;QACnC,IAAI,KAAK,GAAW,KAAK,CAAC,KAAK,CAAC;QAChC,IAAI,MAAM,GAAW,KAAK,CAAC,IAAI,EAAE,CAAC;QAClC,IAAI,CAAC;YACJ,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QAC5D,CAAC;gBACO,CAAC;YACR,IAAI,CAAC,mBAAmB,GAAG,uBAAuB,CAAC;YACnD,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClB,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACvB,CAAC;IACF,CAAC;IAES,eAAe,CAAU,QAAoC,EAC7D,KAAiB,EACjB,QAAkB;QAC3B,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAC7B,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QAC3B,QAAQ,CAAC,OAAO,GAAG,IAAI,CAAC,mBAAmB,CAAC;QAC5C,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC9B,CAAC;IAKS,UAAU,CAAC,CAAW,EAAE,CAAS,EAAE,CAA0B;QACtE,EAAE,CAAC,CAAC,CAAC,YAAY,2BAAY,CAAC,CAAC,CAAC;YAC/B;;;;;;;;;;cAUE;YACF,IAAI,YAAY,GAAY,CAAC,CAAC,kBAAkB,CAAC;YACjD,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;gBAClB,CAAC,CAAC,kBAAkB,GAAG,KAAK,CAAC;YAC9B,CAAC;YAED,WAAW;YACX,IAAI,EAAE,GAAa,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAEvC,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;gBAClB,MAAM,CAAC,EAAE,CAAC;YACX,CAAC;YAED,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC1B,MAAM,CAAC,EAAE,CAAC;QACX,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,EAAE,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC;gBAC7B,OAAO,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3E,CAAC;YAED,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;gBACf,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACnB,CAAC;QACF,CAAC;IACF,CAAC;IAED;;;;OAIG;IAEO,WAAW,CAAU,OAAqB;QACnD;;WAEG;QACH,MAAM,CAAC,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;QAEpC,IAAI,QAAQ,GAAa,IAAI,mBAAQ,CAAC,OAAO,CAAC,CAAC;QAC/C,IAAI,QAAQ,GAAyB,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACxF,EAAE,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC;YAAC,MAAM,CAAC,QAAQ,CAAC;QAEtC,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,QAAQ,GAAa,IAAI,mBAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QAE3D,IAAI,4BAA4B,GAA0B,SAAS,CAAC;QACpE,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,kBAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,YAAY,6BAAa,CAAC,CAAC,CAAC;gBACtC,4BAA4B,GAAG,CAAC,CAAC;gBACjC,KAAK,CAAC;YACP,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,4BAA4B,IAAI,IAAI,CAAC,CAAC,CAAC;YAC1C,IAAI,UAAU,GAAW,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,4BAA4B,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YAChG,IAAI,mBAAmB,GAAoC,4BAA4B,CAAC,mBAAmB,CAAC;YAC5G,QAAQ,CAAC,eAAe,GAAG,IAAI,iCAAe,CAAC,UAAU,EAAE,mBAAmB,CAAC,CAAC;QACjF,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IACzD,CAAC;IAGD,MAAM,CAAC,IAAY;QAClB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IAED;OACG;IAEH,OAAO,CAAU,KAAiB;QACjC,gDAAgD;QAChD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,mBAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;IACrE,CAAC;IAED,IAAI,IAAI;QACP,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED,IAAI,IAAI,CAAC,IAAY;QACpB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACnB,CAAC;IAED,IAAI,kBAAkB;QACrB,MAAM,CAAC,IAAI,CAAC,mBAAmB,CAAC;IACjC,CAAC;IAED,IAAI,kBAAkB,CAAC,kBAA0B;QAChD,IAAI,CAAC,mBAAmB,GAAG,kBAAkB,CAAC;IAC/C,CAAC;IAED,OAAO,CAAU,KAAiB;QACjC,IAAI,OAAO,GAAW,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClC,EAAE,CAAC,CAAC,OAAO,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,IAAI,CAAC,mBAAmB,GAAG,CAAC,CAAC;QAC9B,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC5B,CAAC;QACD,KAAK,CAAC,OAAO,EAAE,CAAC;IACjB,CAAC;IAGD,YAAY,CAAC,CAAS;QACrB,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YAAC,MAAM,CAAC,KAAK,CAAC;QAC3B,yDAAyD;QACzD,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IAC3C,CAAC;CACD,CAAA;AAlpBO,6BAAW,GAAW,CAAC,CAAC;AAF/B;IADC,oBAAO;qDAC4E;AAWpF;IAAW,WAAA,oBAAO,CAAA;kDAKjB;AAED;IAAO,WAAA,oBAAO,CAAA;8CAkBb;AAGD;IADC,qBAAQ;8CAOR;AAED;IAAoB,WAAA,oBAAO,CAAA;iDAgC1B;AAED;IAAmB,WAAA,oBAAO,CAAA,EAAqB,WAAA,oBAAO,CAAA;gDAkErD;AAaD;IAAkC,WAAA,oBAAO,CAAA;+DAQxC;AAeD;IADC,oBAAO;IACsB,WAAA,oBAAO,CAAA,EAAqB,WAAA,oBAAO,CAAA;2DAoBhE;AAwBD;IAAiC,WAAA,oBAAO,CAAA,EAAqB,WAAA,oBAAO,CAAA,EAAyB,WAAA,oBAAO,CAAA;8DAuCnG;AAED;IAAkB,WAAA,oBAAO,CAAA;+CAcxB;AAWD;IADC,oBAAO;IACsB,WAAA,oBAAO,CAAA;IACnC,WAAA,oBAAO,CAAA;0DASR;AAYD;IAAmB,WAAA,oBAAO,CAAA,EAAqB,WAAA,oBAAO,CAAA,EAAqB,WAAA,oBAAO,CAAA;gDAyDjF;AAGD;IAA4B,WAAA,oBAAO,CAAA;IACjC,WAAA,oBAAO,CAAA;IACP,WAAA,oBAAO,CAAA;IACP,WAAA,oBAAO,CAAA;yDAqGR;AAuBD;IAA6B,WAAA,oBAAO,CAAA;0DAwBnC;AAED;IAA2B,WAAA,oBAAO,CAAA;IAChC,WAAA,oBAAO,CAAA;IACP,WAAA,oBAAO,CAAA;wDAKR;AAiDD;IADC,oBAAO;IACe,WAAA,oBAAO,CAAA;oDA4B7B;AAGD;IADC,oBAAO;+CAGP;AAKD;IADC,oBAAO;IACC,WAAA,oBAAO,CAAA;gDAGf;AAkBD;IAAS,WAAA,oBAAO,CAAA;gDASf;AAGD;IADC,oBAAO;qDAKP;AAzqBW,iBAAiB;IA4BhB,WAAA,oBAAO,CAAA;GA5BR,iBAAiB,CA0qB7B;AA1qBY,8CAAiB;AA4qB9B,WAAiB,iBAAiB;IACpB,uBAAK,GAAY,KAAK,CAAC;IACvB,2BAAS,GAAY,KAAK,CAAC;IAExC;;;;;;;;;;;;;;OAcG;IACH;QAAA;YACC,UAAK,GAAW,CAAC,CAAC,CAAC;YACnB,SAAI,GAAW,CAAC,CAAC;YACjB,YAAO,GAAW,CAAC,CAAC,CAAC;QAStB,CAAC;QANA,KAAK;YACJ,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACd,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC3B,CAAC;KACD;IAZY,0BAAQ,WAYpB,CAAA;AACF,CAAC,EAhCgB,iBAAiB,GAAjB,yBAAiB,KAAjB,yBAAiB,QAgCjC;AA5sBY,8CAAiB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerAction.d.ts b/node_modules/antlr4ts/atn/LexerAction.d.ts
deleted file mode 100644
index 0d98025..0000000
--- a/node_modules/antlr4ts/atn/LexerAction.d.ts
+++ /dev/null
@@ -1,47 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Equatable } from '../misc/Stubs';
-import { Lexer } from '../Lexer';
-import { LexerActionType } from './LexerActionType';
-/**
- * Represents a single action which can be executed following the successful
- * match of a lexer rule. Lexer actions are used for both embedded action syntax
- * and ANTLR 4's new lexer command syntax.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-export interface LexerAction extends Equatable {
- /**
- * Gets the serialization type of the lexer action.
- *
- * @return The serialization type of the lexer action.
- */
- readonly actionType: LexerActionType;
- /**
- * Gets whether the lexer action is position-dependent. Position-dependent
- * actions may have different semantics depending on the {@link CharStream}
- * index at the time the action is executed.
- *
- * Many lexer commands, including {@code type}, {@code skip}, and
- * {@code more}, do not check the input index during their execution.
- * Actions like this are position-independent, and may be stored more
- * efficiently as part of the `ATNConfig.lexerActionExecutor`.
- *
- * @return {@code true} if the lexer action semantics can be affected by the
- * position of the input {@link CharStream} at the time it is executed;
- * otherwise, {@code false}.
- */
- readonly isPositionDependent: boolean;
- /**
- * Execute the lexer action in the context of the specified {@link Lexer}.
- *
- * For position-dependent actions, the input stream must already be
- * positioned correctly prior to calling this method.
- *
- * @param lexer The lexer instance.
- */
- execute(lexer: Lexer): void;
-}
diff --git a/node_modules/antlr4ts/atn/LexerAction.js b/node_modules/antlr4ts/atn/LexerAction.js
deleted file mode 100644
index 9253df1..0000000
--- a/node_modules/antlr4ts/atn/LexerAction.js
+++ /dev/null
@@ -1,7 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=LexerAction.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerAction.js.map b/node_modules/antlr4ts/atn/LexerAction.js.map
deleted file mode 100644
index 90465ee..0000000
--- a/node_modules/antlr4ts/atn/LexerAction.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LexerAction.js","sourceRoot":"","sources":["../../../src/atn/LexerAction.ts"],"names":[],"mappings":";AAAA;;;GAGG"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerActionExecutor.d.ts b/node_modules/antlr4ts/atn/LexerActionExecutor.d.ts
deleted file mode 100644
index 1933c43..0000000
--- a/node_modules/antlr4ts/atn/LexerActionExecutor.d.ts
+++ /dev/null
@@ -1,104 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { CharStream } from '../CharStream';
-import { Lexer } from '../Lexer';
-import { LexerAction } from './LexerAction';
-/**
- * Represents an executor for a sequence of lexer actions which traversed during
- * the matching operation of a lexer rule (token).
- *
- * The executor tracks position information for position-dependent lexer actions
- * efficiently, ensuring that actions appearing only at the end of the rule do
- * not cause bloating of the {@link DFA} created for the lexer.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-export declare class LexerActionExecutor {
- private _lexerActions;
- /**
- * Caches the result of {@link #hashCode} since the hash code is an element
- * of the performance-critical {@link LexerATNConfig#hashCode} operation.
- */
- private cachedHashCode;
- /**
- * Constructs an executor for a sequence of {@link LexerAction} actions.
- * @param lexerActions The lexer actions to execute.
- */
- constructor(lexerActions: LexerAction[]);
- /**
- * Creates a {@link LexerActionExecutor} which executes the actions for
- * the input {@code lexerActionExecutor} followed by a specified
- * {@code lexerAction}.
- *
- * @param lexerActionExecutor The executor for actions already traversed by
- * the lexer while matching a token within a particular
- * {@link ATNConfig}. If this is {@code null}, the method behaves as though
- * it were an empty executor.
- * @param lexerAction The lexer action to execute after the actions
- * specified in {@code lexerActionExecutor}.
- *
- * @return A {@link LexerActionExecutor} for executing the combine actions
- * of {@code lexerActionExecutor} and {@code lexerAction}.
- */
- static append(lexerActionExecutor: LexerActionExecutor | undefined, lexerAction: LexerAction): LexerActionExecutor;
- /**
- * Creates a {@link LexerActionExecutor} which encodes the current offset
- * for position-dependent lexer actions.
- *
- * Normally, when the executor encounters lexer actions where
- * {@link LexerAction#isPositionDependent} returns {@code true}, it calls
- * {@link IntStream#seek} on the input {@link CharStream} to set the input
- * position to the end of the current token. This behavior provides
- * for efficient DFA representation of lexer actions which appear at the end
- * of a lexer rule, even when the lexer rule matches a variable number of
- * characters.
- *
- * Prior to traversing a match transition in the ATN, the current offset
- * from the token start index is assigned to all position-dependent lexer
- * actions which have not already been assigned a fixed offset. By storing
- * the offsets relative to the token start index, the DFA representation of
- * lexer actions which appear in the middle of tokens remains efficient due
- * to sharing among tokens of the same length, regardless of their absolute
- * position in the input stream.
- *
- * If the current executor already has offsets assigned to all
- * position-dependent lexer actions, the method returns {@code this}.
- *
- * @param offset The current offset to assign to all position-dependent
- * lexer actions which do not already have offsets assigned.
- *
- * @return A {@link LexerActionExecutor} which stores input stream offsets
- * for all position-dependent lexer actions.
- */
- fixOffsetBeforeMatch(offset: number): LexerActionExecutor;
- /**
- * Gets the lexer actions to be executed by this executor.
- * @return The lexer actions to be executed by this executor.
- */
- readonly lexerActions: LexerAction[];
- /**
- * Execute the actions encapsulated by this executor within the context of a
- * particular {@link Lexer}.
- *
- * This method calls {@link IntStream#seek} to set the position of the
- * {@code input} {@link CharStream} prior to calling
- * {@link LexerAction#execute} on a position-dependent action. Before the
- * method returns, the input position will be restored to the same position
- * it was in when the method was invoked.
- *
- * @param lexer The lexer instance.
- * @param input The input stream which is the source for the current token.
- * When this method is called, the current {@link IntStream#index} for
- * {@code input} should be the start of the following token, i.e. 1
- * character past the end of the current token.
- * @param startIndex The token start index. This value may be passed to
- * {@link IntStream#seek} to set the {@code input} position to the beginning
- * of the token.
- */
- execute(lexer: Lexer, input: CharStream, startIndex: number): void;
- hashCode(): number;
- equals(obj: any): boolean;
-}
diff --git a/node_modules/antlr4ts/atn/LexerActionExecutor.js b/node_modules/antlr4ts/atn/LexerActionExecutor.js
deleted file mode 100644
index f1fc480..0000000
--- a/node_modules/antlr4ts/atn/LexerActionExecutor.js
+++ /dev/null
@@ -1,199 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:28.8810453-07:00
-const ArrayEqualityComparator_1 = require("../misc/ArrayEqualityComparator");
-const LexerIndexedCustomAction_1 = require("./LexerIndexedCustomAction");
-const MurmurHash_1 = require("../misc/MurmurHash");
-const Decorators_1 = require("../Decorators");
-/**
- * Represents an executor for a sequence of lexer actions which traversed during
- * the matching operation of a lexer rule (token).
- *
- * The executor tracks position information for position-dependent lexer actions
- * efficiently, ensuring that actions appearing only at the end of the rule do
- * not cause bloating of the {@link DFA} created for the lexer.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-let LexerActionExecutor = class LexerActionExecutor {
- /**
- * Constructs an executor for a sequence of {@link LexerAction} actions.
- * @param lexerActions The lexer actions to execute.
- */
- constructor(lexerActions) {
- this._lexerActions = lexerActions;
- let hash = MurmurHash_1.MurmurHash.initialize();
- for (let lexerAction of lexerActions) {
- hash = MurmurHash_1.MurmurHash.update(hash, lexerAction);
- }
- this.cachedHashCode = MurmurHash_1.MurmurHash.finish(hash, lexerActions.length);
- }
- /**
- * Creates a {@link LexerActionExecutor} which executes the actions for
- * the input {@code lexerActionExecutor} followed by a specified
- * {@code lexerAction}.
- *
- * @param lexerActionExecutor The executor for actions already traversed by
- * the lexer while matching a token within a particular
- * {@link ATNConfig}. If this is {@code null}, the method behaves as though
- * it were an empty executor.
- * @param lexerAction The lexer action to execute after the actions
- * specified in {@code lexerActionExecutor}.
- *
- * @return A {@link LexerActionExecutor} for executing the combine actions
- * of {@code lexerActionExecutor} and {@code lexerAction}.
- */
- static append(lexerActionExecutor, lexerAction) {
- if (!lexerActionExecutor) {
- return new LexerActionExecutor([lexerAction]);
- }
- let lexerActions = lexerActionExecutor._lexerActions.slice(0);
- lexerActions.push(lexerAction);
- return new LexerActionExecutor(lexerActions);
- }
- /**
- * Creates a {@link LexerActionExecutor} which encodes the current offset
- * for position-dependent lexer actions.
- *
- * Normally, when the executor encounters lexer actions where
- * {@link LexerAction#isPositionDependent} returns {@code true}, it calls
- * {@link IntStream#seek} on the input {@link CharStream} to set the input
- * position to the end of the current token. This behavior provides
- * for efficient DFA representation of lexer actions which appear at the end
- * of a lexer rule, even when the lexer rule matches a variable number of
- * characters.
- *
- * Prior to traversing a match transition in the ATN, the current offset
- * from the token start index is assigned to all position-dependent lexer
- * actions which have not already been assigned a fixed offset. By storing
- * the offsets relative to the token start index, the DFA representation of
- * lexer actions which appear in the middle of tokens remains efficient due
- * to sharing among tokens of the same length, regardless of their absolute
- * position in the input stream.
- *
- * If the current executor already has offsets assigned to all
- * position-dependent lexer actions, the method returns {@code this}.
- *
- * @param offset The current offset to assign to all position-dependent
- * lexer actions which do not already have offsets assigned.
- *
- * @return A {@link LexerActionExecutor} which stores input stream offsets
- * for all position-dependent lexer actions.
- */
- fixOffsetBeforeMatch(offset) {
- let updatedLexerActions;
- for (let i = 0; i < this._lexerActions.length; i++) {
- if (this._lexerActions[i].isPositionDependent && !(this._lexerActions[i] instanceof LexerIndexedCustomAction_1.LexerIndexedCustomAction)) {
- if (!updatedLexerActions) {
- updatedLexerActions = this._lexerActions.slice(0);
- }
- updatedLexerActions[i] = new LexerIndexedCustomAction_1.LexerIndexedCustomAction(offset, this._lexerActions[i]);
- }
- }
- if (!updatedLexerActions) {
- return this;
- }
- return new LexerActionExecutor(updatedLexerActions);
- }
- /**
- * Gets the lexer actions to be executed by this executor.
- * @return The lexer actions to be executed by this executor.
- */
- get lexerActions() {
- return this._lexerActions;
- }
- /**
- * Execute the actions encapsulated by this executor within the context of a
- * particular {@link Lexer}.
- *
- * This method calls {@link IntStream#seek} to set the position of the
- * {@code input} {@link CharStream} prior to calling
- * {@link LexerAction#execute} on a position-dependent action. Before the
- * method returns, the input position will be restored to the same position
- * it was in when the method was invoked.
- *
- * @param lexer The lexer instance.
- * @param input The input stream which is the source for the current token.
- * When this method is called, the current {@link IntStream#index} for
- * {@code input} should be the start of the following token, i.e. 1
- * character past the end of the current token.
- * @param startIndex The token start index. This value may be passed to
- * {@link IntStream#seek} to set the {@code input} position to the beginning
- * of the token.
- */
- execute(lexer, input, startIndex) {
- let requiresSeek = false;
- let stopIndex = input.index;
- try {
- for (let lexerAction of this._lexerActions) {
- if (lexerAction instanceof LexerIndexedCustomAction_1.LexerIndexedCustomAction) {
- let offset = lexerAction.offset;
- input.seek(startIndex + offset);
- lexerAction = lexerAction.action;
- requiresSeek = (startIndex + offset) !== stopIndex;
- }
- else if (lexerAction.isPositionDependent) {
- input.seek(stopIndex);
- requiresSeek = false;
- }
- lexerAction.execute(lexer);
- }
- }
- finally {
- if (requiresSeek) {
- input.seek(stopIndex);
- }
- }
- }
- hashCode() {
- return this.cachedHashCode;
- }
- equals(obj) {
- if (obj === this) {
- return true;
- }
- else if (!(obj instanceof LexerActionExecutor)) {
- return false;
- }
- return this.cachedHashCode === obj.cachedHashCode
- && ArrayEqualityComparator_1.ArrayEqualityComparator.INSTANCE.equals(this._lexerActions, obj._lexerActions);
- }
-};
-__decorate([
- Decorators_1.NotNull
-], LexerActionExecutor.prototype, "_lexerActions", void 0);
-__decorate([
- Decorators_1.NotNull
-], LexerActionExecutor.prototype, "lexerActions", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], LexerActionExecutor.prototype, "execute", null);
-__decorate([
- Decorators_1.Override
-], LexerActionExecutor.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], LexerActionExecutor.prototype, "equals", null);
-__decorate([
- Decorators_1.NotNull,
- __param(1, Decorators_1.NotNull)
-], LexerActionExecutor, "append", null);
-LexerActionExecutor = __decorate([
- __param(0, Decorators_1.NotNull)
-], LexerActionExecutor);
-exports.LexerActionExecutor = LexerActionExecutor;
-//# sourceMappingURL=LexerActionExecutor.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerActionExecutor.js.map b/node_modules/antlr4ts/atn/LexerActionExecutor.js.map
deleted file mode 100644
index 1886588..0000000
--- a/node_modules/antlr4ts/atn/LexerActionExecutor.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LexerActionExecutor.js","sourceRoot":"","sources":["../../../src/atn/LexerActionExecutor.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,6EAA0E;AAI1E,yEAAsE;AACtE,mDAAgD;AAChD,8CAAkD;AAElD;;;;;;;;;;GAUG;AACH,IAAa,mBAAmB,GAAhC;IAUC;;;OAGG;IACH,YAAqB,YAA2B;QAC/C,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAElC,IAAI,IAAI,GAAW,uBAAU,CAAC,UAAU,EAAE,CAAC;QAC3C,GAAG,CAAC,CAAC,IAAI,WAAW,IAAI,YAAY,CAAC,CAAC,CAAC;YACtC,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAC7C,CAAC;QAED,IAAI,CAAC,cAAc,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;IACpE,CAAC;IAED;;;;;;;;;;;;;;OAcG;IAEH,MAAM,CAAC,MAAM,CAAC,mBAAoD,EAAW,WAAwB;QACpG,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,IAAI,mBAAmB,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;QAC/C,CAAC;QAED,IAAI,YAAY,GAAG,mBAAmB,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9D,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC/B,MAAM,CAAC,IAAI,mBAAmB,CAAC,YAAY,CAAC,CAAC;IAC9C,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA4BG;IACH,oBAAoB,CAAC,MAAc;QAClC,IAAI,mBAA8C,CAAC;QACnD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpD,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,mBAAmB,IAAI,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,YAAY,mDAAwB,CAAC,CAAC,CAAC,CAAC;gBAC/G,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC;oBAC1B,mBAAmB,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACnD,CAAC;gBAED,mBAAmB,CAAC,CAAC,CAAC,GAAG,IAAI,mDAAwB,CAAC,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;YACtF,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAED,MAAM,CAAC,IAAI,mBAAmB,CAAC,mBAAmB,CAAC,CAAC;IACrD,CAAC;IAED;;;OAGG;IAEH,IAAI,YAAY;QACf,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC;IAC3B,CAAC;IAED;;;;;;;;;;;;;;;;;;OAkBG;IACH,OAAO,CAAU,KAAY,EAAE,KAAiB,EAAE,UAAkB;QACnE,IAAI,YAAY,GAAY,KAAK,CAAC;QAClC,IAAI,SAAS,GAAW,KAAK,CAAC,KAAK,CAAC;QACpC,IAAI,CAAC;YACJ,GAAG,CAAC,CAAC,IAAI,WAAW,IAAI,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;gBAC5C,EAAE,CAAC,CAAC,WAAW,YAAY,mDAAwB,CAAC,CAAC,CAAC;oBACrD,IAAI,MAAM,GAAW,WAAW,CAAC,MAAM,CAAC;oBACxC,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,CAAC;oBAChC,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC;oBACjC,YAAY,GAAG,CAAC,UAAU,GAAG,MAAM,CAAC,KAAK,SAAS,CAAC;gBACpD,CAAC;gBAAC,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,mBAAmB,CAAC,CAAC,CAAC;oBAC5C,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACtB,YAAY,GAAG,KAAK,CAAC;gBACtB,CAAC;gBAED,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC5B,CAAC;QACF,CAAC;gBAAS,CAAC;YACV,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;gBAClB,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACvB,CAAC;QACF,CAAC;IACF,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC;IAC5B,CAAC;IAGD,MAAM,CAAC,GAAQ;QACd,EAAE,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,mBAAmB,CAAC,CAAC,CAAC,CAAC;YAClD,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,cAAc,KAAK,GAAG,CAAC,cAAc;eAC7C,iDAAuB,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC;IACpF,CAAC;CACD,CAAA;AArKA;IADC,oBAAO;0DAC6B;AAsGrC;IADC,oBAAO;uDAGP;AAqBD;IAAS,WAAA,oBAAO,CAAA;kDAsBf;AAGD;IADC,qBAAQ;mDAGR;AAGD;IADC,qBAAQ;iDAUR;AA7HD;IADC,oBAAO;IAC6D,WAAA,oBAAO,CAAA;uCAQ3E;AAjDW,mBAAmB;IAclB,WAAA,oBAAO,CAAA;GAdR,mBAAmB,CAuK/B;AAvKY,kDAAmB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerActionType.d.ts b/node_modules/antlr4ts/atn/LexerActionType.d.ts
deleted file mode 100644
index 32d48a7..0000000
--- a/node_modules/antlr4ts/atn/LexerActionType.d.ts
+++ /dev/null
@@ -1,44 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-/**
- * Represents the serialization type of a {@link LexerAction}.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-export declare const enum LexerActionType {
- /**
- * The type of a {@link LexerChannelAction} action.
- */
- CHANNEL = 0,
- /**
- * The type of a {@link LexerCustomAction} action.
- */
- CUSTOM = 1,
- /**
- * The type of a {@link LexerModeAction} action.
- */
- MODE = 2,
- /**
- * The type of a {@link LexerMoreAction} action.
- */
- MORE = 3,
- /**
- * The type of a {@link LexerPopModeAction} action.
- */
- POP_MODE = 4,
- /**
- * The type of a {@link LexerPushModeAction} action.
- */
- PUSH_MODE = 5,
- /**
- * The type of a {@link LexerSkipAction} action.
- */
- SKIP = 6,
- /**
- * The type of a {@link LexerTypeAction} action.
- */
- TYPE = 7,
-}
diff --git a/node_modules/antlr4ts/atn/LexerActionType.js b/node_modules/antlr4ts/atn/LexerActionType.js
deleted file mode 100644
index e14ceae..0000000
--- a/node_modules/antlr4ts/atn/LexerActionType.js
+++ /dev/null
@@ -1,49 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:29.0172086-07:00
-/**
- * Represents the serialization type of a {@link LexerAction}.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-var LexerActionType;
-(function (LexerActionType) {
- /**
- * The type of a {@link LexerChannelAction} action.
- */
- LexerActionType[LexerActionType["CHANNEL"] = 0] = "CHANNEL";
- /**
- * The type of a {@link LexerCustomAction} action.
- */
- LexerActionType[LexerActionType["CUSTOM"] = 1] = "CUSTOM";
- /**
- * The type of a {@link LexerModeAction} action.
- */
- LexerActionType[LexerActionType["MODE"] = 2] = "MODE";
- /**
- * The type of a {@link LexerMoreAction} action.
- */
- LexerActionType[LexerActionType["MORE"] = 3] = "MORE";
- /**
- * The type of a {@link LexerPopModeAction} action.
- */
- LexerActionType[LexerActionType["POP_MODE"] = 4] = "POP_MODE";
- /**
- * The type of a {@link LexerPushModeAction} action.
- */
- LexerActionType[LexerActionType["PUSH_MODE"] = 5] = "PUSH_MODE";
- /**
- * The type of a {@link LexerSkipAction} action.
- */
- LexerActionType[LexerActionType["SKIP"] = 6] = "SKIP";
- /**
- * The type of a {@link LexerTypeAction} action.
- */
- LexerActionType[LexerActionType["TYPE"] = 7] = "TYPE";
-})(LexerActionType = exports.LexerActionType || (exports.LexerActionType = {}));
-//# sourceMappingURL=LexerActionType.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerActionType.js.map b/node_modules/antlr4ts/atn/LexerActionType.js.map
deleted file mode 100644
index 4ebf0aa..0000000
--- a/node_modules/antlr4ts/atn/LexerActionType.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LexerActionType.js","sourceRoot":"","sources":["../../../src/atn/LexerActionType.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,wDAAwD;AAExD;;;;;GAKG;AACH,IAAkB,eAiCjB;AAjCD,WAAkB,eAAe;IAChC;;OAEG;IACH,2DAAO,CAAA;IACP;;OAEG;IACH,yDAAM,CAAA;IACN;;OAEG;IACH,qDAAI,CAAA;IACJ;;OAEG;IACH,qDAAI,CAAA;IACJ;;OAEG;IACH,6DAAQ,CAAA;IACR;;OAEG;IACH,+DAAS,CAAA;IACT;;OAEG;IACH,qDAAI,CAAA;IACJ;;OAEG;IACH,qDAAI,CAAA;AACL,CAAC,EAjCiB,eAAe,GAAf,uBAAe,KAAf,uBAAe,QAiChC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerChannelAction.d.ts b/node_modules/antlr4ts/atn/LexerChannelAction.d.ts
deleted file mode 100644
index 90ecf97..0000000
--- a/node_modules/antlr4ts/atn/LexerChannelAction.d.ts
+++ /dev/null
@@ -1,48 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Lexer } from '../Lexer';
-import { LexerAction } from './LexerAction';
-import { LexerActionType } from './LexerActionType';
-/**
- * Implements the {@code channel} lexer action by calling
- * {@link Lexer#setChannel} with the assigned channel.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-export declare class LexerChannelAction implements LexerAction {
- private readonly _channel;
- /**
- * Constructs a new {@code channel} action with the specified channel value.
- * @param channel The channel value to pass to {@link Lexer#setChannel}.
- */
- constructor(channel: number);
- /**
- * Gets the channel to use for the {@link Token} created by the lexer.
- *
- * @return The channel to use for the {@link Token} created by the lexer.
- */
- readonly channel: number;
- /**
- * {@inheritDoc}
- * @return This method returns {@link LexerActionType#CHANNEL}.
- */
- readonly actionType: LexerActionType;
- /**
- * {@inheritDoc}
- * @return This method returns {@code false}.
- */
- readonly isPositionDependent: boolean;
- /**
- * {@inheritDoc}
- *
- * This action is implemented by calling {@link Lexer#setChannel} with the
- * value provided by {@link #getChannel}.
- */
- execute(lexer: Lexer): void;
- hashCode(): number;
- equals(obj: any): boolean;
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/atn/LexerChannelAction.js b/node_modules/antlr4ts/atn/LexerChannelAction.js
deleted file mode 100644
index 2e9e351..0000000
--- a/node_modules/antlr4ts/atn/LexerChannelAction.js
+++ /dev/null
@@ -1,103 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const MurmurHash_1 = require("../misc/MurmurHash");
-const Decorators_1 = require("../Decorators");
-/**
- * Implements the {@code channel} lexer action by calling
- * {@link Lexer#setChannel} with the assigned channel.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-class LexerChannelAction {
- /**
- * Constructs a new {@code channel} action with the specified channel value.
- * @param channel The channel value to pass to {@link Lexer#setChannel}.
- */
- constructor(channel) {
- this._channel = channel;
- }
- /**
- * Gets the channel to use for the {@link Token} created by the lexer.
- *
- * @return The channel to use for the {@link Token} created by the lexer.
- */
- get channel() {
- return this._channel;
- }
- /**
- * {@inheritDoc}
- * @return This method returns {@link LexerActionType#CHANNEL}.
- */
- get actionType() {
- return 0 /* CHANNEL */;
- }
- /**
- * {@inheritDoc}
- * @return This method returns {@code false}.
- */
- get isPositionDependent() {
- return false;
- }
- /**
- * {@inheritDoc}
- *
- * This action is implemented by calling {@link Lexer#setChannel} with the
- * value provided by {@link #getChannel}.
- */
- execute(lexer) {
- lexer.channel = this._channel;
- }
- hashCode() {
- let hash = MurmurHash_1.MurmurHash.initialize();
- hash = MurmurHash_1.MurmurHash.update(hash, this.actionType);
- hash = MurmurHash_1.MurmurHash.update(hash, this._channel);
- return MurmurHash_1.MurmurHash.finish(hash, 2);
- }
- equals(obj) {
- if (obj === this) {
- return true;
- }
- else if (!(obj instanceof LexerChannelAction)) {
- return false;
- }
- return this._channel === obj._channel;
- }
- toString() {
- return `channel(${this._channel})`;
- }
-}
-__decorate([
- Decorators_1.Override
-], LexerChannelAction.prototype, "actionType", null);
-__decorate([
- Decorators_1.Override
-], LexerChannelAction.prototype, "isPositionDependent", null);
-__decorate([
- Decorators_1.Override,
- __param(0, Decorators_1.NotNull)
-], LexerChannelAction.prototype, "execute", null);
-__decorate([
- Decorators_1.Override
-], LexerChannelAction.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], LexerChannelAction.prototype, "equals", null);
-__decorate([
- Decorators_1.Override
-], LexerChannelAction.prototype, "toString", null);
-exports.LexerChannelAction = LexerChannelAction;
-//# sourceMappingURL=LexerChannelAction.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerChannelAction.js.map b/node_modules/antlr4ts/atn/LexerChannelAction.js.map
deleted file mode 100644
index d83b560..0000000
--- a/node_modules/antlr4ts/atn/LexerChannelAction.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LexerChannelAction.js","sourceRoot":"","sources":["../../../src/atn/LexerChannelAction.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAOH,mDAAgD;AAChD,8CAAkD;AAElD;;;;;;GAMG;AACH;IAGC;;;OAGG;IACH,YAAY,OAAe;QAC1B,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACH,IAAI,OAAO;QACV,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC;IACtB,CAAC;IAED;;;OAGG;IAEH,IAAI,UAAU;QACb,MAAM,iBAAyB;IAChC,CAAC;IAED;;;OAGG;IAEH,IAAI,mBAAmB;QACtB,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED;;;;;OAKG;IAEH,OAAO,CAAU,KAAY;QAC5B,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC/B,CAAC;IAGD,QAAQ;QACP,IAAI,IAAI,GAAW,uBAAU,CAAC,UAAU,EAAE,CAAC;QAC3C,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9C,MAAM,CAAC,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACnC,CAAC;IAGD,MAAM,CAAC,GAAQ;QACd,EAAE,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,kBAAkB,CAAC,CAAC,CAAC,CAAC;YACjD,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,QAAQ,KAAK,GAAG,CAAC,QAAQ,CAAC;IACvC,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,WAAW,IAAI,CAAC,QAAQ,GAAG,CAAC;IACpC,CAAC;CACD;AA/CA;IADC,qBAAQ;oDAGR;AAOD;IADC,qBAAQ;6DAGR;AASD;IADC,qBAAQ;IACA,WAAA,oBAAO,CAAA;iDAEf;AAGD;IADC,qBAAQ;kDAMR;AAGD;IADC,qBAAQ;gDASR;AAGD;IADC,qBAAQ;kDAGR;AAvEF,gDAwEC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerCustomAction.d.ts b/node_modules/antlr4ts/atn/LexerCustomAction.d.ts
deleted file mode 100644
index 76e328e..0000000
--- a/node_modules/antlr4ts/atn/LexerCustomAction.d.ts
+++ /dev/null
@@ -1,73 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Lexer } from '../Lexer';
-import { LexerAction } from './LexerAction';
-import { LexerActionType } from './LexerActionType';
-/**
- * Executes a custom lexer action by calling {@link Recognizer#action} with the
- * rule and action indexes assigned to the custom action. The implementation of
- * a custom action is added to the generated code for the lexer in an override
- * of {@link Recognizer#action} when the grammar is compiled.
- *
- * This class may represent embedded actions created with the {...}
- * syntax in ANTLR 4, as well as actions created for lexer commands where the
- * command argument could not be evaluated when the grammar was compiled.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-export declare class LexerCustomAction implements LexerAction {
- private readonly _ruleIndex;
- private readonly _actionIndex;
- /**
- * Constructs a custom lexer action with the specified rule and action
- * indexes.
- *
- * @param ruleIndex The rule index to use for calls to
- * {@link Recognizer#action}.
- * @param actionIndex The action index to use for calls to
- * {@link Recognizer#action}.
- */
- constructor(ruleIndex: number, actionIndex: number);
- /**
- * Gets the rule index to use for calls to {@link Recognizer#action}.
- *
- * @return The rule index for the custom action.
- */
- readonly ruleIndex: number;
- /**
- * Gets the action index to use for calls to {@link Recognizer#action}.
- *
- * @return The action index for the custom action.
- */
- readonly actionIndex: number;
- /**
- * {@inheritDoc}
- *
- * @return This method returns {@link LexerActionType#CUSTOM}.
- */
- readonly actionType: LexerActionType;
- /**
- * Gets whether the lexer action is position-dependent. Position-dependent
- * actions may have different semantics depending on the {@link CharStream}
- * index at the time the action is executed.
- *
- * Custom actions are position-dependent since they may represent a
- * user-defined embedded action which makes calls to methods like
- * {@link Lexer#getText}.
- *
- * @return This method returns {@code true}.
- */
- readonly isPositionDependent: boolean;
- /**
- * {@inheritDoc}
- *
- * Custom actions are implemented by calling {@link Lexer#action} with the
- * appropriate rule and action indexes.
- */
- execute(lexer: Lexer): void;
- hashCode(): number;
- equals(obj: any): boolean;
-}
diff --git a/node_modules/antlr4ts/atn/LexerCustomAction.js b/node_modules/antlr4ts/atn/LexerCustomAction.js
deleted file mode 100644
index 6aa6909..0000000
--- a/node_modules/antlr4ts/atn/LexerCustomAction.js
+++ /dev/null
@@ -1,127 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const MurmurHash_1 = require("../misc/MurmurHash");
-const Decorators_1 = require("../Decorators");
-/**
- * Executes a custom lexer action by calling {@link Recognizer#action} with the
- * rule and action indexes assigned to the custom action. The implementation of
- * a custom action is added to the generated code for the lexer in an override
- * of {@link Recognizer#action} when the grammar is compiled.
- *
- * This class may represent embedded actions created with the {...}
- * syntax in ANTLR 4, as well as actions created for lexer commands where the
- * command argument could not be evaluated when the grammar was compiled.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-class LexerCustomAction {
- /**
- * Constructs a custom lexer action with the specified rule and action
- * indexes.
- *
- * @param ruleIndex The rule index to use for calls to
- * {@link Recognizer#action}.
- * @param actionIndex The action index to use for calls to
- * {@link Recognizer#action}.
- */
- constructor(ruleIndex, actionIndex) {
- this._ruleIndex = ruleIndex;
- this._actionIndex = actionIndex;
- }
- /**
- * Gets the rule index to use for calls to {@link Recognizer#action}.
- *
- * @return The rule index for the custom action.
- */
- get ruleIndex() {
- return this._ruleIndex;
- }
- /**
- * Gets the action index to use for calls to {@link Recognizer#action}.
- *
- * @return The action index for the custom action.
- */
- get actionIndex() {
- return this._actionIndex;
- }
- /**
- * {@inheritDoc}
- *
- * @return This method returns {@link LexerActionType#CUSTOM}.
- */
- get actionType() {
- return 1 /* CUSTOM */;
- }
- /**
- * Gets whether the lexer action is position-dependent. Position-dependent
- * actions may have different semantics depending on the {@link CharStream}
- * index at the time the action is executed.
- *
- * Custom actions are position-dependent since they may represent a
- * user-defined embedded action which makes calls to methods like
- * {@link Lexer#getText}.
- *
- * @return This method returns {@code true}.
- */
- get isPositionDependent() {
- return true;
- }
- /**
- * {@inheritDoc}
- *
- * Custom actions are implemented by calling {@link Lexer#action} with the
- * appropriate rule and action indexes.
- */
- execute(lexer) {
- lexer.action(undefined, this._ruleIndex, this._actionIndex);
- }
- hashCode() {
- let hash = MurmurHash_1.MurmurHash.initialize();
- hash = MurmurHash_1.MurmurHash.update(hash, this.actionType);
- hash = MurmurHash_1.MurmurHash.update(hash, this._ruleIndex);
- hash = MurmurHash_1.MurmurHash.update(hash, this._actionIndex);
- return MurmurHash_1.MurmurHash.finish(hash, 3);
- }
- equals(obj) {
- if (obj === this) {
- return true;
- }
- else if (!(obj instanceof LexerCustomAction)) {
- return false;
- }
- return this._ruleIndex === obj._ruleIndex
- && this._actionIndex === obj._actionIndex;
- }
-}
-__decorate([
- Decorators_1.Override
-], LexerCustomAction.prototype, "actionType", null);
-__decorate([
- Decorators_1.Override
-], LexerCustomAction.prototype, "isPositionDependent", null);
-__decorate([
- Decorators_1.Override,
- __param(0, Decorators_1.NotNull)
-], LexerCustomAction.prototype, "execute", null);
-__decorate([
- Decorators_1.Override
-], LexerCustomAction.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], LexerCustomAction.prototype, "equals", null);
-exports.LexerCustomAction = LexerCustomAction;
-//# sourceMappingURL=LexerCustomAction.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerCustomAction.js.map b/node_modules/antlr4ts/atn/LexerCustomAction.js.map
deleted file mode 100644
index 035d594..0000000
--- a/node_modules/antlr4ts/atn/LexerCustomAction.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LexerCustomAction.js","sourceRoot":"","sources":["../../../src/atn/LexerCustomAction.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAOH,mDAAgD;AAChD,8CAAkD;AAElD;;;;;;;;;;;;GAYG;AACH;IAIC;;;;;;;;OAQG;IACH,YAAY,SAAiB,EAAE,WAAmB;QACjD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;IACjC,CAAC;IAED;;;;OAIG;IACH,IAAI,SAAS;QACZ,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC;IACxB,CAAC;IAED;;;;OAIG;IACH,IAAI,WAAW;QACd,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC;IAC1B,CAAC;IAED;;;;OAIG;IAEH,IAAI,UAAU;QACb,MAAM,gBAAwB;IAC/B,CAAC;IAED;;;;;;;;;;OAUG;IAEH,IAAI,mBAAmB;QACtB,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAED;;;;;OAKG;IAEH,OAAO,CAAU,KAAY;QAC5B,KAAK,CAAC,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;IAC7D,CAAC;IAGD,QAAQ;QACP,IAAI,IAAI,GAAW,uBAAU,CAAC,UAAU,EAAE,CAAC;QAC3C,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QAClD,MAAM,CAAC,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACnC,CAAC;IAGD,MAAM,CAAC,GAAQ;QACd,EAAE,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,iBAAiB,CAAC,CAAC,CAAC,CAAC;YAChD,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,UAAU,KAAK,GAAG,CAAC,UAAU;eACrC,IAAI,CAAC,YAAY,KAAK,GAAG,CAAC,YAAY,CAAC;IAC5C,CAAC;CACD;AAnDA;IADC,qBAAQ;mDAGR;AAcD;IADC,qBAAQ;4DAGR;AASD;IADC,qBAAQ;IACA,WAAA,oBAAO,CAAA;gDAEf;AAGD;IADC,qBAAQ;iDAOR;AAGD;IADC,qBAAQ;+CAUR;AA5FF,8CA6FC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerIndexedCustomAction.d.ts b/node_modules/antlr4ts/atn/LexerIndexedCustomAction.d.ts
deleted file mode 100644
index 2684968..0000000
--- a/node_modules/antlr4ts/atn/LexerIndexedCustomAction.d.ts
+++ /dev/null
@@ -1,74 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Lexer } from '../Lexer';
-import { LexerAction } from './LexerAction';
-import { LexerActionType } from './LexerActionType';
-/**
- * This implementation of {@link LexerAction} is used for tracking input offsets
- * for position-dependent actions within a {@link LexerActionExecutor}.
- *
- * This action is not serialized as part of the ATN, and is only required for
- * position-dependent lexer actions which appear at a location other than the
- * end of a rule. For more information about DFA optimizations employed for
- * lexer actions, see {@link LexerActionExecutor#append} and
- * {@link LexerActionExecutor#fixOffsetBeforeMatch}.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-export declare class LexerIndexedCustomAction implements LexerAction {
- private readonly _offset;
- private readonly _action;
- /**
- * Constructs a new indexed custom action by associating a character offset
- * with a {@link LexerAction}.
- *
- * Note: This class is only required for lexer actions for which
- * {@link LexerAction#isPositionDependent} returns {@code true}.
- *
- * @param offset The offset into the input {@link CharStream}, relative to
- * the token start index, at which the specified lexer action should be
- * executed.
- * @param action The lexer action to execute at a particular offset in the
- * input {@link CharStream}.
- */
- constructor(offset: number, action: LexerAction);
- /**
- * Gets the location in the input {@link CharStream} at which the lexer
- * action should be executed. The value is interpreted as an offset relative
- * to the token start index.
- *
- * @return The location in the input {@link CharStream} at which the lexer
- * action should be executed.
- */
- readonly offset: number;
- /**
- * Gets the lexer action to execute.
- *
- * @return A {@link LexerAction} object which executes the lexer action.
- */
- readonly action: LexerAction;
- /**
- * {@inheritDoc}
- *
- * @return This method returns the result of calling {@link #getActionType}
- * on the {@link LexerAction} returned by {@link #getAction}.
- */
- readonly actionType: LexerActionType;
- /**
- * {@inheritDoc}
- * @return This method returns {@code true}.
- */
- readonly isPositionDependent: boolean;
- /**
- * {@inheritDoc}
- *
- * This method calls {@link #execute} on the result of {@link #getAction}
- * using the provided {@code lexer}.
- */
- execute(lexer: Lexer): void;
- hashCode(): number;
- equals(obj: any): boolean;
-}
diff --git a/node_modules/antlr4ts/atn/LexerIndexedCustomAction.js b/node_modules/antlr4ts/atn/LexerIndexedCustomAction.js
deleted file mode 100644
index cb47bee..0000000
--- a/node_modules/antlr4ts/atn/LexerIndexedCustomAction.js
+++ /dev/null
@@ -1,133 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const MurmurHash_1 = require("../misc/MurmurHash");
-const Decorators_1 = require("../Decorators");
-/**
- * This implementation of {@link LexerAction} is used for tracking input offsets
- * for position-dependent actions within a {@link LexerActionExecutor}.
- *
- * This action is not serialized as part of the ATN, and is only required for
- * position-dependent lexer actions which appear at a location other than the
- * end of a rule. For more information about DFA optimizations employed for
- * lexer actions, see {@link LexerActionExecutor#append} and
- * {@link LexerActionExecutor#fixOffsetBeforeMatch}.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-let LexerIndexedCustomAction = class LexerIndexedCustomAction {
- /**
- * Constructs a new indexed custom action by associating a character offset
- * with a {@link LexerAction}.
- *
- * Note: This class is only required for lexer actions for which
- * {@link LexerAction#isPositionDependent} returns {@code true}.
- *
- * @param offset The offset into the input {@link CharStream}, relative to
- * the token start index, at which the specified lexer action should be
- * executed.
- * @param action The lexer action to execute at a particular offset in the
- * input {@link CharStream}.
- */
- constructor(offset, action) {
- this._offset = offset;
- this._action = action;
- }
- /**
- * Gets the location in the input {@link CharStream} at which the lexer
- * action should be executed. The value is interpreted as an offset relative
- * to the token start index.
- *
- * @return The location in the input {@link CharStream} at which the lexer
- * action should be executed.
- */
- get offset() {
- return this._offset;
- }
- /**
- * Gets the lexer action to execute.
- *
- * @return A {@link LexerAction} object which executes the lexer action.
- */
- get action() {
- return this._action;
- }
- /**
- * {@inheritDoc}
- *
- * @return This method returns the result of calling {@link #getActionType}
- * on the {@link LexerAction} returned by {@link #getAction}.
- */
- get actionType() {
- return this._action.actionType;
- }
- /**
- * {@inheritDoc}
- * @return This method returns {@code true}.
- */
- get isPositionDependent() {
- return true;
- }
- /**
- * {@inheritDoc}
- *
- * This method calls {@link #execute} on the result of {@link #getAction}
- * using the provided {@code lexer}.
- */
- execute(lexer) {
- // assume the input stream position was properly set by the calling code
- this._action.execute(lexer);
- }
- hashCode() {
- let hash = MurmurHash_1.MurmurHash.initialize();
- hash = MurmurHash_1.MurmurHash.update(hash, this._offset);
- hash = MurmurHash_1.MurmurHash.update(hash, this._action);
- return MurmurHash_1.MurmurHash.finish(hash, 2);
- }
- equals(obj) {
- if (obj === this) {
- return true;
- }
- else if (!(obj instanceof LexerIndexedCustomAction)) {
- return false;
- }
- return this._offset === obj._offset
- && this._action.equals(obj._action);
- }
-};
-__decorate([
- Decorators_1.NotNull
-], LexerIndexedCustomAction.prototype, "action", null);
-__decorate([
- Decorators_1.Override
-], LexerIndexedCustomAction.prototype, "actionType", null);
-__decorate([
- Decorators_1.Override
-], LexerIndexedCustomAction.prototype, "isPositionDependent", null);
-__decorate([
- Decorators_1.Override
-], LexerIndexedCustomAction.prototype, "execute", null);
-__decorate([
- Decorators_1.Override
-], LexerIndexedCustomAction.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], LexerIndexedCustomAction.prototype, "equals", null);
-LexerIndexedCustomAction = __decorate([
- __param(1, Decorators_1.NotNull)
-], LexerIndexedCustomAction);
-exports.LexerIndexedCustomAction = LexerIndexedCustomAction;
-//# sourceMappingURL=LexerIndexedCustomAction.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerIndexedCustomAction.js.map b/node_modules/antlr4ts/atn/LexerIndexedCustomAction.js.map
deleted file mode 100644
index c689190..0000000
--- a/node_modules/antlr4ts/atn/LexerIndexedCustomAction.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LexerIndexedCustomAction.js","sourceRoot":"","sources":["../../../src/atn/LexerIndexedCustomAction.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAOH,mDAAgD;AAChD,8CAAkD;AAElD;;;;;;;;;;;;GAYG;AACH,IAAa,wBAAwB,GAArC;IAIC;;;;;;;;;;;;OAYG;IACH,YAAY,MAAc,EAAW,MAAmB;QACvD,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACvB,CAAC;IAED;;;;;;;OAOG;IACH,IAAI,MAAM;QACT,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;IACrB,CAAC;IAED;;;;OAIG;IAEH,IAAI,MAAM;QACT,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;IACrB,CAAC;IAED;;;;;OAKG;IAEH,IAAI,UAAU;QACb,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;IAChC,CAAC;IAED;;;OAGG;IAEH,IAAI,mBAAmB;QACtB,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAED;;;;;OAKG;IAEH,OAAO,CAAC,KAAY;QACnB,wEAAwE;QACxE,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC;IAGD,QAAQ;QACP,IAAI,IAAI,GAAW,uBAAU,CAAC,UAAU,EAAE,CAAC;QAC3C,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7C,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7C,MAAM,CAAC,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACnC,CAAC;IAGD,MAAM,CAAC,GAAQ;QACd,EAAE,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,wBAAwB,CAAC,CAAC,CAAC,CAAC;YACvD,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,OAAO,KAAK,GAAG,CAAC,OAAO;eAC/B,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACtC,CAAC;CACD,CAAA;AAvDA;IADC,oBAAO;sDAGP;AASD;IADC,qBAAQ;0DAGR;AAOD;IADC,qBAAQ;mEAGR;AASD;IADC,qBAAQ;uDAIR;AAGD;IADC,qBAAQ;wDAMR;AAGD;IADC,qBAAQ;sDAUR;AA9FW,wBAAwB;IAiBP,WAAA,oBAAO,CAAA;GAjBxB,wBAAwB,CA+FpC;AA/FY,4DAAwB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerModeAction.d.ts b/node_modules/antlr4ts/atn/LexerModeAction.d.ts
deleted file mode 100644
index 6b96caa..0000000
--- a/node_modules/antlr4ts/atn/LexerModeAction.d.ts
+++ /dev/null
@@ -1,48 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Lexer } from '../Lexer';
-import { LexerAction } from './LexerAction';
-import { LexerActionType } from './LexerActionType';
-/**
- * Implements the {@code mode} lexer action by calling {@link Lexer#mode} with
- * the assigned mode.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-export declare class LexerModeAction implements LexerAction {
- private readonly _mode;
- /**
- * Constructs a new {@code mode} action with the specified mode value.
- * @param mode The mode value to pass to {@link Lexer#mode}.
- */
- constructor(mode: number);
- /**
- * Get the lexer mode this action should transition the lexer to.
- *
- * @return The lexer mode for this {@code mode} command.
- */
- readonly mode: number;
- /**
- * {@inheritDoc}
- * @return This method returns {@link LexerActionType#MODE}.
- */
- readonly actionType: LexerActionType;
- /**
- * {@inheritDoc}
- * @return This method returns {@code false}.
- */
- readonly isPositionDependent: boolean;
- /**
- * {@inheritDoc}
- *
- * This action is implemented by calling {@link Lexer#mode} with the
- * value provided by {@link #getMode}.
- */
- execute(lexer: Lexer): void;
- hashCode(): number;
- equals(obj: any): boolean;
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/atn/LexerModeAction.js b/node_modules/antlr4ts/atn/LexerModeAction.js
deleted file mode 100644
index a03c74f..0000000
--- a/node_modules/antlr4ts/atn/LexerModeAction.js
+++ /dev/null
@@ -1,103 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const MurmurHash_1 = require("../misc/MurmurHash");
-const Decorators_1 = require("../Decorators");
-/**
- * Implements the {@code mode} lexer action by calling {@link Lexer#mode} with
- * the assigned mode.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-class LexerModeAction {
- /**
- * Constructs a new {@code mode} action with the specified mode value.
- * @param mode The mode value to pass to {@link Lexer#mode}.
- */
- constructor(mode) {
- this._mode = mode;
- }
- /**
- * Get the lexer mode this action should transition the lexer to.
- *
- * @return The lexer mode for this {@code mode} command.
- */
- get mode() {
- return this._mode;
- }
- /**
- * {@inheritDoc}
- * @return This method returns {@link LexerActionType#MODE}.
- */
- get actionType() {
- return 2 /* MODE */;
- }
- /**
- * {@inheritDoc}
- * @return This method returns {@code false}.
- */
- get isPositionDependent() {
- return false;
- }
- /**
- * {@inheritDoc}
- *
- * This action is implemented by calling {@link Lexer#mode} with the
- * value provided by {@link #getMode}.
- */
- execute(lexer) {
- lexer.mode(this._mode);
- }
- hashCode() {
- let hash = MurmurHash_1.MurmurHash.initialize();
- hash = MurmurHash_1.MurmurHash.update(hash, this.actionType);
- hash = MurmurHash_1.MurmurHash.update(hash, this._mode);
- return MurmurHash_1.MurmurHash.finish(hash, 2);
- }
- equals(obj) {
- if (obj === this) {
- return true;
- }
- else if (!(obj instanceof LexerModeAction)) {
- return false;
- }
- return this._mode === obj._mode;
- }
- toString() {
- return `mode(${this._mode})`;
- }
-}
-__decorate([
- Decorators_1.Override
-], LexerModeAction.prototype, "actionType", null);
-__decorate([
- Decorators_1.Override
-], LexerModeAction.prototype, "isPositionDependent", null);
-__decorate([
- Decorators_1.Override,
- __param(0, Decorators_1.NotNull)
-], LexerModeAction.prototype, "execute", null);
-__decorate([
- Decorators_1.Override
-], LexerModeAction.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], LexerModeAction.prototype, "equals", null);
-__decorate([
- Decorators_1.Override
-], LexerModeAction.prototype, "toString", null);
-exports.LexerModeAction = LexerModeAction;
-//# sourceMappingURL=LexerModeAction.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerModeAction.js.map b/node_modules/antlr4ts/atn/LexerModeAction.js.map
deleted file mode 100644
index bba6a18..0000000
--- a/node_modules/antlr4ts/atn/LexerModeAction.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LexerModeAction.js","sourceRoot":"","sources":["../../../src/atn/LexerModeAction.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAOH,mDAAgD;AAChD,8CAAkD;AAElD;;;;;;GAMG;AACH;IAGC;;;OAGG;IACH,YAAY,IAAY;QACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACH,IAAI,IAAI;QACP,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED;;;OAGG;IAEH,IAAI,UAAU;QACb,MAAM,cAAsB;IAC7B,CAAC;IAED;;;OAGG;IAEH,IAAI,mBAAmB;QACtB,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED;;;;;OAKG;IAEH,OAAO,CAAU,KAAY;QAC5B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IAGD,QAAQ;QACP,IAAI,IAAI,GAAW,uBAAU,CAAC,UAAU,EAAE,CAAC;QAC3C,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3C,MAAM,CAAC,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACnC,CAAC;IAGD,MAAM,CAAC,GAAQ;QACd,EAAE,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,eAAe,CAAC,CAAC,CAAC,CAAC;YAC9C,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK,CAAC;IACjC,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,QAAQ,IAAI,CAAC,KAAK,GAAG,CAAC;IAC9B,CAAC;CACD;AA/CA;IADC,qBAAQ;iDAGR;AAOD;IADC,qBAAQ;0DAGR;AASD;IADC,qBAAQ;IACA,WAAA,oBAAO,CAAA;8CAEf;AAGD;IADC,qBAAQ;+CAMR;AAGD;IADC,qBAAQ;6CASR;AAGD;IADC,qBAAQ;+CAGR;AAvEF,0CAwEC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerMoreAction.d.ts b/node_modules/antlr4ts/atn/LexerMoreAction.d.ts
deleted file mode 100644
index 5093e8c..0000000
--- a/node_modules/antlr4ts/atn/LexerMoreAction.d.ts
+++ /dev/null
@@ -1,47 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Lexer } from '../Lexer';
-import { LexerAction } from './LexerAction';
-import { LexerActionType } from './LexerActionType';
-/**
- * Implements the {@code more} lexer action by calling {@link Lexer#more}.
- *
- * The {@code more} command does not have any parameters, so this action is
- * implemented as a singleton instance exposed by {@link #INSTANCE}.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-export declare class LexerMoreAction implements LexerAction {
- /**
- * Constructs the singleton instance of the lexer {@code more} command.
- */
- constructor();
- /**
- * {@inheritDoc}
- * @return This method returns {@link LexerActionType#MORE}.
- */
- readonly actionType: LexerActionType;
- /**
- * {@inheritDoc}
- * @return This method returns {@code false}.
- */
- readonly isPositionDependent: boolean;
- /**
- * {@inheritDoc}
- *
- * This action is implemented by calling {@link Lexer#more}.
- */
- execute(lexer: Lexer): void;
- hashCode(): number;
- equals(obj: any): boolean;
- toString(): string;
-}
-export declare namespace LexerMoreAction {
- /**
- * Provides a singleton instance of this parameterless lexer action.
- */
- const INSTANCE: LexerMoreAction;
-}
diff --git a/node_modules/antlr4ts/atn/LexerMoreAction.js b/node_modules/antlr4ts/atn/LexerMoreAction.js
deleted file mode 100644
index b5ea6ae..0000000
--- a/node_modules/antlr4ts/atn/LexerMoreAction.js
+++ /dev/null
@@ -1,93 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const MurmurHash_1 = require("../misc/MurmurHash");
-const Decorators_1 = require("../Decorators");
-/**
- * Implements the {@code more} lexer action by calling {@link Lexer#more}.
- *
- * The {@code more} command does not have any parameters, so this action is
- * implemented as a singleton instance exposed by {@link #INSTANCE}.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-class LexerMoreAction {
- /**
- * Constructs the singleton instance of the lexer {@code more} command.
- */
- constructor() {
- }
- /**
- * {@inheritDoc}
- * @return This method returns {@link LexerActionType#MORE}.
- */
- get actionType() {
- return 3 /* MORE */;
- }
- /**
- * {@inheritDoc}
- * @return This method returns {@code false}.
- */
- get isPositionDependent() {
- return false;
- }
- /**
- * {@inheritDoc}
- *
- * This action is implemented by calling {@link Lexer#more}.
- */
- execute(lexer) {
- lexer.more();
- }
- hashCode() {
- let hash = MurmurHash_1.MurmurHash.initialize();
- hash = MurmurHash_1.MurmurHash.update(hash, this.actionType);
- return MurmurHash_1.MurmurHash.finish(hash, 1);
- }
- equals(obj) {
- return obj === this;
- }
- toString() {
- return "more";
- }
-}
-__decorate([
- Decorators_1.Override
-], LexerMoreAction.prototype, "actionType", null);
-__decorate([
- Decorators_1.Override
-], LexerMoreAction.prototype, "isPositionDependent", null);
-__decorate([
- Decorators_1.Override,
- __param(0, Decorators_1.NotNull)
-], LexerMoreAction.prototype, "execute", null);
-__decorate([
- Decorators_1.Override
-], LexerMoreAction.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], LexerMoreAction.prototype, "equals", null);
-__decorate([
- Decorators_1.Override
-], LexerMoreAction.prototype, "toString", null);
-exports.LexerMoreAction = LexerMoreAction;
-(function (LexerMoreAction) {
- /**
- * Provides a singleton instance of this parameterless lexer action.
- */
- LexerMoreAction.INSTANCE = new LexerMoreAction();
-})(LexerMoreAction = exports.LexerMoreAction || (exports.LexerMoreAction = {}));
-//# sourceMappingURL=LexerMoreAction.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerMoreAction.js.map b/node_modules/antlr4ts/atn/LexerMoreAction.js.map
deleted file mode 100644
index 10c101d..0000000
--- a/node_modules/antlr4ts/atn/LexerMoreAction.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LexerMoreAction.js","sourceRoot":"","sources":["../../../src/atn/LexerMoreAction.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAOH,mDAAgD;AAChD,8CAAkD;AAElD;;;;;;;;GAQG;AACH;IACC;;OAEG;IACH;IACA,CAAC;IAED;;;OAGG;IAEH,IAAI,UAAU;QACb,MAAM,cAAsB;IAC7B,CAAC;IAED;;;OAGG;IAEH,IAAI,mBAAmB;QACtB,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED;;;;OAIG;IAEH,OAAO,CAAU,KAAY;QAC5B,KAAK,CAAC,IAAI,EAAE,CAAC;IACd,CAAC;IAGD,QAAQ;QACP,IAAI,IAAI,GAAW,uBAAU,CAAC,UAAU,EAAE,CAAC;QAC3C,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,MAAM,CAAC,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACnC,CAAC;IAGD,MAAM,CAAC,GAAQ;QACd,MAAM,CAAC,GAAG,KAAK,IAAI,CAAC;IACrB,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;CACD;AAvCA;IADC,qBAAQ;iDAGR;AAOD;IADC,qBAAQ;0DAGR;AAQD;IADC,qBAAQ;IACA,WAAA,oBAAO,CAAA;8CAEf;AAGD;IADC,qBAAQ;+CAKR;AAGD;IADC,qBAAQ;6CAGR;AAGD;IADC,qBAAQ;+CAGR;AAlDF,0CAmDC;AAED,WAAiB,eAAe;IAC/B;;OAEG;IACU,wBAAQ,GAAoB,IAAI,eAAe,EAAE,CAAC;AAChE,CAAC,EALgB,eAAe,GAAf,uBAAe,KAAf,uBAAe,QAK/B"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerPopModeAction.d.ts b/node_modules/antlr4ts/atn/LexerPopModeAction.d.ts
deleted file mode 100644
index 4879007..0000000
--- a/node_modules/antlr4ts/atn/LexerPopModeAction.d.ts
+++ /dev/null
@@ -1,47 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Lexer } from '../Lexer';
-import { LexerAction } from './LexerAction';
-import { LexerActionType } from './LexerActionType';
-/**
- * Implements the {@code popMode} lexer action by calling {@link Lexer#popMode}.
- *
- * The {@code popMode} command does not have any parameters, so this action is
- * implemented as a singleton instance exposed by {@link #INSTANCE}.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-export declare class LexerPopModeAction implements LexerAction {
- /**
- * Constructs the singleton instance of the lexer {@code popMode} command.
- */
- constructor();
- /**
- * {@inheritDoc}
- * @return This method returns {@link LexerActionType#POP_MODE}.
- */
- readonly actionType: LexerActionType;
- /**
- * {@inheritDoc}
- * @return This method returns {@code false}.
- */
- readonly isPositionDependent: boolean;
- /**
- * {@inheritDoc}
- *
- * This action is implemented by calling {@link Lexer#popMode}.
- */
- execute(lexer: Lexer): void;
- hashCode(): number;
- equals(obj: any): boolean;
- toString(): string;
-}
-export declare namespace LexerPopModeAction {
- /**
- * Provides a singleton instance of this parameterless lexer action.
- */
- const INSTANCE: LexerPopModeAction;
-}
diff --git a/node_modules/antlr4ts/atn/LexerPopModeAction.js b/node_modules/antlr4ts/atn/LexerPopModeAction.js
deleted file mode 100644
index 9d099af..0000000
--- a/node_modules/antlr4ts/atn/LexerPopModeAction.js
+++ /dev/null
@@ -1,93 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const MurmurHash_1 = require("../misc/MurmurHash");
-const Decorators_1 = require("../Decorators");
-/**
- * Implements the {@code popMode} lexer action by calling {@link Lexer#popMode}.
- *
- * The {@code popMode} command does not have any parameters, so this action is
- * implemented as a singleton instance exposed by {@link #INSTANCE}.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-class LexerPopModeAction {
- /**
- * Constructs the singleton instance of the lexer {@code popMode} command.
- */
- constructor() {
- }
- /**
- * {@inheritDoc}
- * @return This method returns {@link LexerActionType#POP_MODE}.
- */
- get actionType() {
- return 4 /* POP_MODE */;
- }
- /**
- * {@inheritDoc}
- * @return This method returns {@code false}.
- */
- get isPositionDependent() {
- return false;
- }
- /**
- * {@inheritDoc}
- *
- * This action is implemented by calling {@link Lexer#popMode}.
- */
- execute(lexer) {
- lexer.popMode();
- }
- hashCode() {
- let hash = MurmurHash_1.MurmurHash.initialize();
- hash = MurmurHash_1.MurmurHash.update(hash, this.actionType);
- return MurmurHash_1.MurmurHash.finish(hash, 1);
- }
- equals(obj) {
- return obj === this;
- }
- toString() {
- return "popMode";
- }
-}
-__decorate([
- Decorators_1.Override
-], LexerPopModeAction.prototype, "actionType", null);
-__decorate([
- Decorators_1.Override
-], LexerPopModeAction.prototype, "isPositionDependent", null);
-__decorate([
- Decorators_1.Override,
- __param(0, Decorators_1.NotNull)
-], LexerPopModeAction.prototype, "execute", null);
-__decorate([
- Decorators_1.Override
-], LexerPopModeAction.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], LexerPopModeAction.prototype, "equals", null);
-__decorate([
- Decorators_1.Override
-], LexerPopModeAction.prototype, "toString", null);
-exports.LexerPopModeAction = LexerPopModeAction;
-(function (LexerPopModeAction) {
- /**
- * Provides a singleton instance of this parameterless lexer action.
- */
- LexerPopModeAction.INSTANCE = new LexerPopModeAction();
-})(LexerPopModeAction = exports.LexerPopModeAction || (exports.LexerPopModeAction = {}));
-//# sourceMappingURL=LexerPopModeAction.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerPopModeAction.js.map b/node_modules/antlr4ts/atn/LexerPopModeAction.js.map
deleted file mode 100644
index d60cebc..0000000
--- a/node_modules/antlr4ts/atn/LexerPopModeAction.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LexerPopModeAction.js","sourceRoot":"","sources":["../../../src/atn/LexerPopModeAction.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAOH,mDAAgD;AAChD,8CAAkD;AAElD;;;;;;;;GAQG;AACH;IACC;;OAEG;IACH;IACA,CAAC;IAED;;;OAGG;IAEH,IAAI,UAAU;QACb,MAAM,kBAA0B;IACjC,CAAC;IAED;;;OAGG;IAEH,IAAI,mBAAmB;QACtB,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED;;;;OAIG;IAEH,OAAO,CAAU,KAAY;QAC5B,KAAK,CAAC,OAAO,EAAE,CAAC;IACjB,CAAC;IAGD,QAAQ;QACP,IAAI,IAAI,GAAW,uBAAU,CAAC,UAAU,EAAE,CAAC;QAC3C,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,MAAM,CAAC,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACnC,CAAC;IAGD,MAAM,CAAC,GAAQ;QACd,MAAM,CAAC,GAAG,KAAK,IAAI,CAAC;IACrB,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,SAAS,CAAC;IAClB,CAAC;CACD;AAvCA;IADC,qBAAQ;oDAGR;AAOD;IADC,qBAAQ;6DAGR;AAQD;IADC,qBAAQ;IACA,WAAA,oBAAO,CAAA;iDAEf;AAGD;IADC,qBAAQ;kDAKR;AAGD;IADC,qBAAQ;gDAGR;AAGD;IADC,qBAAQ;kDAGR;AAlDF,gDAmDC;AAED,WAAiB,kBAAkB;IAClC;;OAEG;IACU,2BAAQ,GAAuB,IAAI,kBAAkB,EAAE,CAAC;AACtE,CAAC,EALgB,kBAAkB,GAAlB,0BAAkB,KAAlB,0BAAkB,QAKlC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerPushModeAction.d.ts b/node_modules/antlr4ts/atn/LexerPushModeAction.d.ts
deleted file mode 100644
index 852af85..0000000
--- a/node_modules/antlr4ts/atn/LexerPushModeAction.d.ts
+++ /dev/null
@@ -1,48 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Lexer } from '../Lexer';
-import { LexerAction } from './LexerAction';
-import { LexerActionType } from './LexerActionType';
-/**
- * Implements the {@code pushMode} lexer action by calling
- * {@link Lexer#pushMode} with the assigned mode.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-export declare class LexerPushModeAction implements LexerAction {
- private readonly _mode;
- /**
- * Constructs a new {@code pushMode} action with the specified mode value.
- * @param mode The mode value to pass to {@link Lexer#pushMode}.
- */
- constructor(mode: number);
- /**
- * Get the lexer mode this action should transition the lexer to.
- *
- * @return The lexer mode for this {@code pushMode} command.
- */
- readonly mode: number;
- /**
- * {@inheritDoc}
- * @return This method returns {@link LexerActionType#PUSH_MODE}.
- */
- readonly actionType: LexerActionType;
- /**
- * {@inheritDoc}
- * @return This method returns {@code false}.
- */
- readonly isPositionDependent: boolean;
- /**
- * {@inheritDoc}
- *
- * This action is implemented by calling {@link Lexer#pushMode} with the
- * value provided by {@link #getMode}.
- */
- execute(lexer: Lexer): void;
- hashCode(): number;
- equals(obj: any): boolean;
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/atn/LexerPushModeAction.js b/node_modules/antlr4ts/atn/LexerPushModeAction.js
deleted file mode 100644
index 46c5434..0000000
--- a/node_modules/antlr4ts/atn/LexerPushModeAction.js
+++ /dev/null
@@ -1,103 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const MurmurHash_1 = require("../misc/MurmurHash");
-const Decorators_1 = require("../Decorators");
-/**
- * Implements the {@code pushMode} lexer action by calling
- * {@link Lexer#pushMode} with the assigned mode.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-class LexerPushModeAction {
- /**
- * Constructs a new {@code pushMode} action with the specified mode value.
- * @param mode The mode value to pass to {@link Lexer#pushMode}.
- */
- constructor(mode) {
- this._mode = mode;
- }
- /**
- * Get the lexer mode this action should transition the lexer to.
- *
- * @return The lexer mode for this {@code pushMode} command.
- */
- get mode() {
- return this._mode;
- }
- /**
- * {@inheritDoc}
- * @return This method returns {@link LexerActionType#PUSH_MODE}.
- */
- get actionType() {
- return 5 /* PUSH_MODE */;
- }
- /**
- * {@inheritDoc}
- * @return This method returns {@code false}.
- */
- get isPositionDependent() {
- return false;
- }
- /**
- * {@inheritDoc}
- *
- * This action is implemented by calling {@link Lexer#pushMode} with the
- * value provided by {@link #getMode}.
- */
- execute(lexer) {
- lexer.pushMode(this._mode);
- }
- hashCode() {
- let hash = MurmurHash_1.MurmurHash.initialize();
- hash = MurmurHash_1.MurmurHash.update(hash, this.actionType);
- hash = MurmurHash_1.MurmurHash.update(hash, this._mode);
- return MurmurHash_1.MurmurHash.finish(hash, 2);
- }
- equals(obj) {
- if (obj === this) {
- return true;
- }
- else if (!(obj instanceof LexerPushModeAction)) {
- return false;
- }
- return this._mode === obj._mode;
- }
- toString() {
- return `pushMode(${this._mode})`;
- }
-}
-__decorate([
- Decorators_1.Override
-], LexerPushModeAction.prototype, "actionType", null);
-__decorate([
- Decorators_1.Override
-], LexerPushModeAction.prototype, "isPositionDependent", null);
-__decorate([
- Decorators_1.Override,
- __param(0, Decorators_1.NotNull)
-], LexerPushModeAction.prototype, "execute", null);
-__decorate([
- Decorators_1.Override
-], LexerPushModeAction.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], LexerPushModeAction.prototype, "equals", null);
-__decorate([
- Decorators_1.Override
-], LexerPushModeAction.prototype, "toString", null);
-exports.LexerPushModeAction = LexerPushModeAction;
-//# sourceMappingURL=LexerPushModeAction.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerPushModeAction.js.map b/node_modules/antlr4ts/atn/LexerPushModeAction.js.map
deleted file mode 100644
index 33773ad..0000000
--- a/node_modules/antlr4ts/atn/LexerPushModeAction.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LexerPushModeAction.js","sourceRoot":"","sources":["../../../src/atn/LexerPushModeAction.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAOH,mDAAgD;AAChD,8CAAkD;AAElD;;;;;;GAMG;AACH;IAGC;;;OAGG;IACH,YAAY,IAAY;QACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACH,IAAI,IAAI;QACP,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED;;;OAGG;IAEH,IAAI,UAAU;QACb,MAAM,mBAA2B;IAClC,CAAC;IAED;;;OAGG;IAEH,IAAI,mBAAmB;QACtB,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED;;;;;OAKG;IAEH,OAAO,CAAU,KAAY;QAC5B,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAGD,QAAQ;QACP,IAAI,IAAI,GAAW,uBAAU,CAAC,UAAU,EAAE,CAAC;QAC3C,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3C,MAAM,CAAC,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACnC,CAAC;IAGD,MAAM,CAAC,GAAQ;QACd,EAAE,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,mBAAmB,CAAC,CAAC,CAAC,CAAC;YAClD,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK,CAAC;IACjC,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,YAAY,IAAI,CAAC,KAAK,GAAG,CAAC;IAClC,CAAC;CACD;AA/CA;IADC,qBAAQ;qDAGR;AAOD;IADC,qBAAQ;8DAGR;AASD;IADC,qBAAQ;IACA,WAAA,oBAAO,CAAA;kDAEf;AAGD;IADC,qBAAQ;mDAMR;AAGD;IADC,qBAAQ;iDASR;AAGD;IADC,qBAAQ;mDAGR;AAvEF,kDAwEC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerSkipAction.d.ts b/node_modules/antlr4ts/atn/LexerSkipAction.d.ts
deleted file mode 100644
index 10bd0eb..0000000
--- a/node_modules/antlr4ts/atn/LexerSkipAction.d.ts
+++ /dev/null
@@ -1,47 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Lexer } from '../Lexer';
-import { LexerAction } from './LexerAction';
-import { LexerActionType } from './LexerActionType';
-/**
- * Implements the {@code skip} lexer action by calling {@link Lexer#skip}.
- *
- * The {@code skip} command does not have any parameters, so this action is
- * implemented as a singleton instance exposed by {@link #INSTANCE}.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-export declare class LexerSkipAction implements LexerAction {
- /**
- * Constructs the singleton instance of the lexer {@code skip} command.
- */
- constructor();
- /**
- * {@inheritDoc}
- * @return This method returns {@link LexerActionType#SKIP}.
- */
- readonly actionType: LexerActionType;
- /**
- * {@inheritDoc}
- * @return This method returns {@code false}.
- */
- readonly isPositionDependent: boolean;
- /**
- * {@inheritDoc}
- *
- * This action is implemented by calling {@link Lexer#skip}.
- */
- execute(lexer: Lexer): void;
- hashCode(): number;
- equals(obj: any): boolean;
- toString(): string;
-}
-export declare namespace LexerSkipAction {
- /**
- * Provides a singleton instance of this parameterless lexer action.
- */
- const INSTANCE: LexerSkipAction;
-}
diff --git a/node_modules/antlr4ts/atn/LexerSkipAction.js b/node_modules/antlr4ts/atn/LexerSkipAction.js
deleted file mode 100644
index cf19c85..0000000
--- a/node_modules/antlr4ts/atn/LexerSkipAction.js
+++ /dev/null
@@ -1,93 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const MurmurHash_1 = require("../misc/MurmurHash");
-const Decorators_1 = require("../Decorators");
-/**
- * Implements the {@code skip} lexer action by calling {@link Lexer#skip}.
- *
- * The {@code skip} command does not have any parameters, so this action is
- * implemented as a singleton instance exposed by {@link #INSTANCE}.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-class LexerSkipAction {
- /**
- * Constructs the singleton instance of the lexer {@code skip} command.
- */
- constructor() {
- }
- /**
- * {@inheritDoc}
- * @return This method returns {@link LexerActionType#SKIP}.
- */
- get actionType() {
- return 6 /* SKIP */;
- }
- /**
- * {@inheritDoc}
- * @return This method returns {@code false}.
- */
- get isPositionDependent() {
- return false;
- }
- /**
- * {@inheritDoc}
- *
- * This action is implemented by calling {@link Lexer#skip}.
- */
- execute(lexer) {
- lexer.skip();
- }
- hashCode() {
- let hash = MurmurHash_1.MurmurHash.initialize();
- hash = MurmurHash_1.MurmurHash.update(hash, this.actionType);
- return MurmurHash_1.MurmurHash.finish(hash, 1);
- }
- equals(obj) {
- return obj === this;
- }
- toString() {
- return "skip";
- }
-}
-__decorate([
- Decorators_1.Override
-], LexerSkipAction.prototype, "actionType", null);
-__decorate([
- Decorators_1.Override
-], LexerSkipAction.prototype, "isPositionDependent", null);
-__decorate([
- Decorators_1.Override,
- __param(0, Decorators_1.NotNull)
-], LexerSkipAction.prototype, "execute", null);
-__decorate([
- Decorators_1.Override
-], LexerSkipAction.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], LexerSkipAction.prototype, "equals", null);
-__decorate([
- Decorators_1.Override
-], LexerSkipAction.prototype, "toString", null);
-exports.LexerSkipAction = LexerSkipAction;
-(function (LexerSkipAction) {
- /**
- * Provides a singleton instance of this parameterless lexer action.
- */
- LexerSkipAction.INSTANCE = new LexerSkipAction();
-})(LexerSkipAction = exports.LexerSkipAction || (exports.LexerSkipAction = {}));
-//# sourceMappingURL=LexerSkipAction.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerSkipAction.js.map b/node_modules/antlr4ts/atn/LexerSkipAction.js.map
deleted file mode 100644
index c2126bb..0000000
--- a/node_modules/antlr4ts/atn/LexerSkipAction.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LexerSkipAction.js","sourceRoot":"","sources":["../../../src/atn/LexerSkipAction.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAOH,mDAAgD;AAChD,8CAAkD;AAElD;;;;;;;;GAQG;AACH;IACC;;OAEG;IACH;IACA,CAAC;IAED;;;OAGG;IAEH,IAAI,UAAU;QACb,MAAM,cAAsB;IAC7B,CAAC;IAED;;;OAGG;IAEH,IAAI,mBAAmB;QACtB,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED;;;;OAIG;IAEH,OAAO,CAAU,KAAY;QAC5B,KAAK,CAAC,IAAI,EAAE,CAAC;IACd,CAAC;IAGD,QAAQ;QACP,IAAI,IAAI,GAAW,uBAAU,CAAC,UAAU,EAAE,CAAC;QAC3C,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,MAAM,CAAC,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACnC,CAAC;IAGD,MAAM,CAAC,GAAQ;QACd,MAAM,CAAC,GAAG,KAAK,IAAI,CAAC;IACrB,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;CACD;AAvCA;IADC,qBAAQ;iDAGR;AAOD;IADC,qBAAQ;0DAGR;AAQD;IADC,qBAAQ;IACA,WAAA,oBAAO,CAAA;8CAEf;AAGD;IADC,qBAAQ;+CAKR;AAGD;IADC,qBAAQ;6CAGR;AAGD;IADC,qBAAQ;+CAGR;AAlDF,0CAmDC;AAED,WAAiB,eAAe;IAC/B;;OAEG;IACU,wBAAQ,GAAoB,IAAI,eAAe,EAAE,CAAC;AAChE,CAAC,EALgB,eAAe,GAAf,uBAAe,KAAf,uBAAe,QAK/B"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerTypeAction.d.ts b/node_modules/antlr4ts/atn/LexerTypeAction.d.ts
deleted file mode 100644
index dae786f..0000000
--- a/node_modules/antlr4ts/atn/LexerTypeAction.d.ts
+++ /dev/null
@@ -1,47 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Lexer } from '../Lexer';
-import { LexerAction } from './LexerAction';
-import { LexerActionType } from './LexerActionType';
-/**
- * Implements the {@code type} lexer action by setting `Lexer.type`
- * with the assigned type.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-export declare class LexerTypeAction implements LexerAction {
- private readonly _type;
- /**
- * Constructs a new {@code type} action with the specified token type value.
- * @param type The type to assign to the token using `Lexer.type`.
- */
- constructor(type: number);
- /**
- * Gets the type to assign to a token created by the lexer.
- * @return The type to assign to a token created by the lexer.
- */
- readonly type: number;
- /**
- * {@inheritDoc}
- * @return This method returns {@link LexerActionType#TYPE}.
- */
- readonly actionType: LexerActionType;
- /**
- * {@inheritDoc}
- * @return This method returns {@code false}.
- */
- readonly isPositionDependent: boolean;
- /**
- * {@inheritDoc}
- *
- * This action is implemented by setting `Lexer.type` with the
- * value provided by `type`.
- */
- execute(lexer: Lexer): void;
- hashCode(): number;
- equals(obj: any): boolean;
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/atn/LexerTypeAction.js b/node_modules/antlr4ts/atn/LexerTypeAction.js
deleted file mode 100644
index aff5226..0000000
--- a/node_modules/antlr4ts/atn/LexerTypeAction.js
+++ /dev/null
@@ -1,102 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const MurmurHash_1 = require("../misc/MurmurHash");
-const Decorators_1 = require("../Decorators");
-/**
- * Implements the {@code type} lexer action by setting `Lexer.type`
- * with the assigned type.
- *
- * @author Sam Harwell
- * @since 4.2
- */
-class LexerTypeAction {
- /**
- * Constructs a new {@code type} action with the specified token type value.
- * @param type The type to assign to the token using `Lexer.type`.
- */
- constructor(type) {
- this._type = type;
- }
- /**
- * Gets the type to assign to a token created by the lexer.
- * @return The type to assign to a token created by the lexer.
- */
- get type() {
- return this._type;
- }
- /**
- * {@inheritDoc}
- * @return This method returns {@link LexerActionType#TYPE}.
- */
- get actionType() {
- return 7 /* TYPE */;
- }
- /**
- * {@inheritDoc}
- * @return This method returns {@code false}.
- */
- get isPositionDependent() {
- return false;
- }
- /**
- * {@inheritDoc}
- *
- * This action is implemented by setting `Lexer.type` with the
- * value provided by `type`.
- */
- execute(lexer) {
- lexer.type = this._type;
- }
- hashCode() {
- let hash = MurmurHash_1.MurmurHash.initialize();
- hash = MurmurHash_1.MurmurHash.update(hash, this.actionType);
- hash = MurmurHash_1.MurmurHash.update(hash, this._type);
- return MurmurHash_1.MurmurHash.finish(hash, 2);
- }
- equals(obj) {
- if (obj === this) {
- return true;
- }
- else if (!(obj instanceof LexerTypeAction)) {
- return false;
- }
- return this._type === obj._type;
- }
- toString() {
- return `type(${this._type})`;
- }
-}
-__decorate([
- Decorators_1.Override
-], LexerTypeAction.prototype, "actionType", null);
-__decorate([
- Decorators_1.Override
-], LexerTypeAction.prototype, "isPositionDependent", null);
-__decorate([
- Decorators_1.Override,
- __param(0, Decorators_1.NotNull)
-], LexerTypeAction.prototype, "execute", null);
-__decorate([
- Decorators_1.Override
-], LexerTypeAction.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], LexerTypeAction.prototype, "equals", null);
-__decorate([
- Decorators_1.Override
-], LexerTypeAction.prototype, "toString", null);
-exports.LexerTypeAction = LexerTypeAction;
-//# sourceMappingURL=LexerTypeAction.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LexerTypeAction.js.map b/node_modules/antlr4ts/atn/LexerTypeAction.js.map
deleted file mode 100644
index 5a57021..0000000
--- a/node_modules/antlr4ts/atn/LexerTypeAction.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LexerTypeAction.js","sourceRoot":"","sources":["../../../src/atn/LexerTypeAction.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAOH,mDAAgD;AAChD,8CAAkD;AAElD;;;;;;GAMG;AACH;IAGC;;;OAGG;IACH,YAAY,IAAY;QACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACnB,CAAC;IAED;;;OAGG;IACH,IAAI,IAAI;QACP,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED;;;OAGG;IAEH,IAAI,UAAU;QACb,MAAM,cAAsB;IAC7B,CAAC;IAED;;;OAGG;IAEH,IAAI,mBAAmB;QACtB,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED;;;;;OAKG;IAEH,OAAO,CAAU,KAAY;QAC5B,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;IACzB,CAAC;IAGD,QAAQ;QACP,IAAI,IAAI,GAAW,uBAAU,CAAC,UAAU,EAAE,CAAC;QAC3C,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3C,MAAM,CAAC,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACnC,CAAC;IAGD,MAAM,CAAC,GAAQ;QACd,EAAE,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,eAAe,CAAC,CAAC,CAAC,CAAC;YAC9C,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK,CAAC;IACjC,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,QAAQ,IAAI,CAAC,KAAK,GAAG,CAAC;IAC9B,CAAC;CACD;AA/CA;IADC,qBAAQ;iDAGR;AAOD;IADC,qBAAQ;0DAGR;AASD;IADC,qBAAQ;IACA,WAAA,oBAAO,CAAA;8CAEf;AAGD;IADC,qBAAQ;+CAMR;AAGD;IADC,qBAAQ;6CASR;AAGD;IADC,qBAAQ;+CAGR;AAtEF,0CAuEC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LookaheadEventInfo.d.ts b/node_modules/antlr4ts/atn/LookaheadEventInfo.d.ts
deleted file mode 100644
index 82214d9..0000000
--- a/node_modules/antlr4ts/atn/LookaheadEventInfo.d.ts
+++ /dev/null
@@ -1,37 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { DecisionEventInfo } from './DecisionEventInfo';
-import { SimulatorState } from './SimulatorState';
-import { TokenStream } from '../TokenStream';
-/**
- * This class represents profiling event information for tracking the lookahead
- * depth required in order to make a prediction.
- *
- * @since 4.3
- */
-export declare class LookaheadEventInfo extends DecisionEventInfo {
- /** The alternative chosen by adaptivePredict(), not necessarily
- * the outermost alt shown for a rule; left-recursive rules have
- * user-level alts that differ from the rewritten rule with a (...) block
- * and a (..)* loop.
- */
- predictedAlt: number;
- /**
- * Constructs a new instance of the {@link LookaheadEventInfo} class with
- * the specified detailed lookahead information.
- *
- * @param decision The decision number
- * @param state The final simulator state containing the necessary
- * information to determine the result of a prediction, or {@code null} if
- * the final state is not available
- * @param input The input token stream
- * @param startIndex The start index for the current prediction
- * @param stopIndex The index at which the prediction was finally made
- * @param fullCtx {@code true} if the current lookahead is part of an LL
- * prediction; otherwise, {@code false} if the current lookahead is part of
- * an SLL prediction
- */
- constructor(decision: number, state: SimulatorState | undefined, predictedAlt: number, input: TokenStream, startIndex: number, stopIndex: number, fullCtx: boolean);
-}
diff --git a/node_modules/antlr4ts/atn/LookaheadEventInfo.js b/node_modules/antlr4ts/atn/LookaheadEventInfo.js
deleted file mode 100644
index 6e2b9ab..0000000
--- a/node_modules/antlr4ts/atn/LookaheadEventInfo.js
+++ /dev/null
@@ -1,50 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:30.6852565-07:00
-const DecisionEventInfo_1 = require("./DecisionEventInfo");
-const Decorators_1 = require("../Decorators");
-/**
- * This class represents profiling event information for tracking the lookahead
- * depth required in order to make a prediction.
- *
- * @since 4.3
- */
-let LookaheadEventInfo = class LookaheadEventInfo extends DecisionEventInfo_1.DecisionEventInfo {
- /**
- * Constructs a new instance of the {@link LookaheadEventInfo} class with
- * the specified detailed lookahead information.
- *
- * @param decision The decision number
- * @param state The final simulator state containing the necessary
- * information to determine the result of a prediction, or {@code null} if
- * the final state is not available
- * @param input The input token stream
- * @param startIndex The start index for the current prediction
- * @param stopIndex The index at which the prediction was finally made
- * @param fullCtx {@code true} if the current lookahead is part of an LL
- * prediction; otherwise, {@code false} if the current lookahead is part of
- * an SLL prediction
- */
- constructor(decision, state, predictedAlt, input, startIndex, stopIndex, fullCtx) {
- super(decision, state, input, startIndex, stopIndex, fullCtx);
- this.predictedAlt = predictedAlt;
- }
-};
-LookaheadEventInfo = __decorate([
- __param(3, Decorators_1.NotNull)
-], LookaheadEventInfo);
-exports.LookaheadEventInfo = LookaheadEventInfo;
-//# sourceMappingURL=LookaheadEventInfo.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LookaheadEventInfo.js.map b/node_modules/antlr4ts/atn/LookaheadEventInfo.js.map
deleted file mode 100644
index 88904aa..0000000
--- a/node_modules/antlr4ts/atn/LookaheadEventInfo.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LookaheadEventInfo.js","sourceRoot":"","sources":["../../../src/atn/LookaheadEventInfo.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,2DAAwD;AACxD,8CAAwC;AAIxC;;;;;GAKG;AACH,IAAa,kBAAkB,GAA/B,wBAAgC,SAAQ,qCAAiB;IAQxD;;;;;;;;;;;;;;OAcG;IACH,YAAY,QAAgB,EAC3B,KAAiC,EACjC,YAAoB,EACX,KAAkB,EAC3B,UAAkB,EAClB,SAAiB,EACjB,OAAgB;QAEhB,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QAC9D,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;IAClC,CAAC;CACD,CAAA;AAlCY,kBAAkB;IA0B5B,WAAA,oBAAO,CAAA;GA1BG,kBAAkB,CAkC9B;AAlCY,gDAAkB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LoopEndState.d.ts b/node_modules/antlr4ts/atn/LoopEndState.d.ts
deleted file mode 100644
index 9256ce5..0000000
--- a/node_modules/antlr4ts/atn/LoopEndState.d.ts
+++ /dev/null
@@ -1,11 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { ATNStateType } from './ATNStateType';
-/** Mark the end of a * or + loop. */
-export declare class LoopEndState extends ATNState {
- loopBackState: ATNState;
- readonly stateType: ATNStateType;
-}
diff --git a/node_modules/antlr4ts/atn/LoopEndState.js b/node_modules/antlr4ts/atn/LoopEndState.js
deleted file mode 100644
index a4e28ba..0000000
--- a/node_modules/antlr4ts/atn/LoopEndState.js
+++ /dev/null
@@ -1,26 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:30.7737978-07:00
-const ATNState_1 = require("./ATNState");
-const Decorators_1 = require("../Decorators");
-/** Mark the end of a * or + loop. */
-class LoopEndState extends ATNState_1.ATNState {
- get stateType() {
- return 12 /* LOOP_END */;
- }
-}
-__decorate([
- Decorators_1.Override
-], LoopEndState.prototype, "stateType", null);
-exports.LoopEndState = LoopEndState;
-//# sourceMappingURL=LoopEndState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/LoopEndState.js.map b/node_modules/antlr4ts/atn/LoopEndState.js.map
deleted file mode 100644
index 766c5ec..0000000
--- a/node_modules/antlr4ts/atn/LoopEndState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LoopEndState.js","sourceRoot":"","sources":["../../../src/atn/LoopEndState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAEH,wDAAwD;AAExD,yCAAsC;AAEtC,8CAAyC;AAEzC,qCAAqC;AACrC,kBAA0B,SAAQ,mBAAQ;IAIzC,IAAI,SAAS;QACZ,MAAM,mBAAuB;IAC9B,CAAC;CACD;AAHA;IADC,qBAAQ;6CAGR;AANF,oCAOC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/NotSetTransition.d.ts b/node_modules/antlr4ts/atn/NotSetTransition.d.ts
deleted file mode 100644
index 88e6970..0000000
--- a/node_modules/antlr4ts/atn/NotSetTransition.d.ts
+++ /dev/null
@@ -1,14 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { IntervalSet } from '../misc/IntervalSet';
-import { SetTransition } from './SetTransition';
-import { TransitionType } from './TransitionType';
-export declare class NotSetTransition extends SetTransition {
- constructor(target: ATNState, set: IntervalSet);
- readonly serializationType: TransitionType;
- matches(symbol: number, minVocabSymbol: number, maxVocabSymbol: number): boolean;
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/atn/NotSetTransition.js b/node_modules/antlr4ts/atn/NotSetTransition.js
deleted file mode 100644
index 95c1780..0000000
--- a/node_modules/antlr4ts/atn/NotSetTransition.js
+++ /dev/null
@@ -1,47 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const Decorators_1 = require("../Decorators");
-const SetTransition_1 = require("./SetTransition");
-let NotSetTransition = class NotSetTransition extends SetTransition_1.SetTransition {
- constructor(target, set) {
- super(target, set);
- }
- get serializationType() {
- return 8 /* NOT_SET */;
- }
- matches(symbol, minVocabSymbol, maxVocabSymbol) {
- return symbol >= minVocabSymbol
- && symbol <= maxVocabSymbol
- && !super.matches(symbol, minVocabSymbol, maxVocabSymbol);
- }
- toString() {
- return '~' + super.toString();
- }
-};
-__decorate([
- Decorators_1.Override
-], NotSetTransition.prototype, "serializationType", null);
-__decorate([
- Decorators_1.Override
-], NotSetTransition.prototype, "matches", null);
-__decorate([
- Decorators_1.Override
-], NotSetTransition.prototype, "toString", null);
-NotSetTransition = __decorate([
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.Nullable)
-], NotSetTransition);
-exports.NotSetTransition = NotSetTransition;
-//# sourceMappingURL=NotSetTransition.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/NotSetTransition.js.map b/node_modules/antlr4ts/atn/NotSetTransition.js.map
deleted file mode 100644
index 99ab50c..0000000
--- a/node_modules/antlr4ts/atn/NotSetTransition.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"NotSetTransition.js","sourceRoot":"","sources":["../../../src/atn/NotSetTransition.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAMH,8CAA4D;AAC5D,mDAAgD;AAIhD,IAAa,gBAAgB,GAA7B,sBAA8B,SAAQ,6BAAa;IAClD,YAAqB,MAAgB,EAAY,GAAgB;QAChE,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACpB,CAAC;IAGD,IAAI,iBAAiB;QACpB,MAAM,iBAAwB;IAC/B,CAAC;IAGD,OAAO,CAAC,MAAc,EAAE,cAAsB,EAAE,cAAsB;QACrE,MAAM,CAAC,MAAM,IAAI,cAAc;eAC3B,MAAM,IAAI,cAAc;eACxB,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC;IAC5D,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,GAAG,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC;CACD,CAAA;AAfA;IADC,qBAAQ;yDAGR;AAGD;IADC,qBAAQ;+CAKR;AAGD;IADC,qBAAQ;gDAGR;AApBW,gBAAgB;IACf,WAAA,oBAAO,CAAA,EAAoB,WAAA,qBAAQ,CAAA;GADpC,gBAAgB,CAqB5B;AArBY,4CAAgB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/OrderedATNConfigSet.d.ts b/node_modules/antlr4ts/atn/OrderedATNConfigSet.d.ts
deleted file mode 100644
index 7118fbb..0000000
--- a/node_modules/antlr4ts/atn/OrderedATNConfigSet.d.ts
+++ /dev/null
@@ -1,23 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNConfig } from './ATNConfig';
-import { ATNConfigSet } from './ATNConfigSet';
-/**
- *
- * @author Sam Harwell
- */
-export declare class OrderedATNConfigSet extends ATNConfigSet {
- constructor();
- constructor(set: ATNConfigSet, readonly: boolean);
- clone(readonly: boolean): ATNConfigSet;
- protected getKey(e: ATNConfig): {
- state: number;
- alt: number;
- };
- protected canMerge(left: ATNConfig, leftKey: {
- state: number;
- alt: number;
- }, right: ATNConfig): boolean;
-}
diff --git a/node_modules/antlr4ts/atn/OrderedATNConfigSet.js b/node_modules/antlr4ts/atn/OrderedATNConfigSet.js
deleted file mode 100644
index 20bbfcb..0000000
--- a/node_modules/antlr4ts/atn/OrderedATNConfigSet.js
+++ /dev/null
@@ -1,53 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const ATNConfigSet_1 = require("./ATNConfigSet");
-const Decorators_1 = require("../Decorators");
-/**
- *
- * @author Sam Harwell
- */
-class OrderedATNConfigSet extends ATNConfigSet_1.ATNConfigSet {
- constructor(set, readonly) {
- if (set != null && readonly != null) {
- super(set, readonly);
- }
- else {
- super();
- }
- }
- clone(readonly) {
- let copy = new OrderedATNConfigSet(this, readonly);
- if (!readonly && this.isReadOnly) {
- copy.addAll(this);
- }
- return copy;
- }
- getKey(e) {
- // This is a specially crafted key to ensure configurations are only merged if they are equal
- return { state: 0, alt: e.hashCode() };
- }
- canMerge(left, leftKey, right) {
- return left.equals(right);
- }
-}
-__decorate([
- Decorators_1.Override
-], OrderedATNConfigSet.prototype, "clone", null);
-__decorate([
- Decorators_1.Override
-], OrderedATNConfigSet.prototype, "getKey", null);
-__decorate([
- Decorators_1.Override
-], OrderedATNConfigSet.prototype, "canMerge", null);
-exports.OrderedATNConfigSet = OrderedATNConfigSet;
-//# sourceMappingURL=OrderedATNConfigSet.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/OrderedATNConfigSet.js.map b/node_modules/antlr4ts/atn/OrderedATNConfigSet.js.map
deleted file mode 100644
index f546f13..0000000
--- a/node_modules/antlr4ts/atn/OrderedATNConfigSet.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"OrderedATNConfigSet.js","sourceRoot":"","sources":["../../../src/atn/OrderedATNConfigSet.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAKH,iDAA8C;AAC9C,8CAAyC;AAEzC;;;GAGG;AACH,yBAAiC,SAAQ,2BAAY;IAIpD,YAAY,GAAkB,EAAE,QAAkB;QACjD,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,IAAI,QAAQ,IAAI,IAAI,CAAC,CAAC,CAAC;YACrC,KAAK,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QACtB,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,KAAK,EAAE,CAAC;QACT,CAAC;IACF,CAAC;IAGD,KAAK,CAAC,QAAiB;QACtB,IAAI,IAAI,GAAwB,IAAI,mBAAmB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACxE,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAGS,MAAM,CAAC,CAAY;QAC5B,6FAA6F;QAC7F,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC;IACxC,CAAC;IAGS,QAAQ,CAAC,IAAe,EAAE,OAAuC,EAAE,KAAgB;QAC5F,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;CAED;AApBA;IADC,qBAAQ;gDAQR;AAGD;IADC,qBAAQ;iDAIR;AAGD;IADC,qBAAQ;mDAGR;AA/BF,kDAiCC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ParseInfo.d.ts b/node_modules/antlr4ts/atn/ParseInfo.d.ts
deleted file mode 100644
index 20f0608..0000000
--- a/node_modules/antlr4ts/atn/ParseInfo.d.ts
+++ /dev/null
@@ -1,80 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { DecisionInfo } from './DecisionInfo';
-import { ProfilingATNSimulator } from './ProfilingATNSimulator';
-/**
- * This class provides access to specific and aggregate statistics gathered
- * during profiling of a parser.
- *
- * @since 4.3
- */
-export declare class ParseInfo {
- protected atnSimulator: ProfilingATNSimulator;
- constructor(atnSimulator: ProfilingATNSimulator);
- /**
- * Gets an array of {@link DecisionInfo} instances containing the profiling
- * information gathered for each decision in the ATN.
- *
- * @return An array of {@link DecisionInfo} instances, indexed by decision
- * number.
- */
- getDecisionInfo(): DecisionInfo[];
- /**
- * Gets the decision numbers for decisions that required one or more
- * full-context predictions during parsing. These are decisions for which
- * {@link DecisionInfo#LL_Fallback} is non-zero.
- *
- * @return A list of decision numbers which required one or more
- * full-context predictions during parsing.
- */
- getLLDecisions(): number[];
- /**
- * Gets the total time spent during prediction across all decisions made
- * during parsing. This value is the sum of
- * {@link DecisionInfo#timeInPrediction} for all decisions.
- */
- getTotalTimeInPrediction(): number;
- /**
- * Gets the total number of SLL lookahead operations across all decisions
- * made during parsing. This value is the sum of
- * {@link DecisionInfo#SLL_TotalLook} for all decisions.
- */
- getTotalSLLLookaheadOps(): number;
- /**
- * Gets the total number of LL lookahead operations across all decisions
- * made during parsing. This value is the sum of
- * {@link DecisionInfo#LL_TotalLook} for all decisions.
- */
- getTotalLLLookaheadOps(): number;
- /**
- * Gets the total number of ATN lookahead operations for SLL prediction
- * across all decisions made during parsing.
- */
- getTotalSLLATNLookaheadOps(): number;
- /**
- * Gets the total number of ATN lookahead operations for LL prediction
- * across all decisions made during parsing.
- */
- getTotalLLATNLookaheadOps(): number;
- /**
- * Gets the total number of ATN lookahead operations for SLL and LL
- * prediction across all decisions made during parsing.
- *
- *
- * This value is the sum of {@link #getTotalSLLATNLookaheadOps} and
- * {@link #getTotalLLATNLookaheadOps}.
- */
- getTotalATNLookaheadOps(): number;
- /**
- * Gets the total number of DFA states stored in the DFA cache for all
- * decisions in the ATN.
- */
- getDFASize(): number;
- /**
- * Gets the total number of DFA states stored in the DFA cache for a
- * particular decision.
- */
- getDFASize(decision: number): number;
-}
diff --git a/node_modules/antlr4ts/atn/ParseInfo.js b/node_modules/antlr4ts/atn/ParseInfo.js
deleted file mode 100644
index e7f6c40..0000000
--- a/node_modules/antlr4ts/atn/ParseInfo.js
+++ /dev/null
@@ -1,161 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const Decorators_1 = require("../Decorators");
-/**
- * This class provides access to specific and aggregate statistics gathered
- * during profiling of a parser.
- *
- * @since 4.3
- */
-let ParseInfo = class ParseInfo {
- constructor(atnSimulator) {
- this.atnSimulator = atnSimulator;
- }
- /**
- * Gets an array of {@link DecisionInfo} instances containing the profiling
- * information gathered for each decision in the ATN.
- *
- * @return An array of {@link DecisionInfo} instances, indexed by decision
- * number.
- */
- getDecisionInfo() {
- return this.atnSimulator.getDecisionInfo();
- }
- /**
- * Gets the decision numbers for decisions that required one or more
- * full-context predictions during parsing. These are decisions for which
- * {@link DecisionInfo#LL_Fallback} is non-zero.
- *
- * @return A list of decision numbers which required one or more
- * full-context predictions during parsing.
- */
- getLLDecisions() {
- let decisions = this.atnSimulator.getDecisionInfo();
- let LL = [];
- for (let i = 0; i < decisions.length; i++) {
- let fallBack = decisions[i].LL_Fallback;
- if (fallBack > 0) {
- LL.push(i);
- }
- }
- return LL;
- }
- /**
- * Gets the total time spent during prediction across all decisions made
- * during parsing. This value is the sum of
- * {@link DecisionInfo#timeInPrediction} for all decisions.
- */
- getTotalTimeInPrediction() {
- let decisions = this.atnSimulator.getDecisionInfo();
- let t = 0;
- for (let i = 0; i < decisions.length; i++) {
- t += decisions[i].timeInPrediction;
- }
- return t;
- }
- /**
- * Gets the total number of SLL lookahead operations across all decisions
- * made during parsing. This value is the sum of
- * {@link DecisionInfo#SLL_TotalLook} for all decisions.
- */
- getTotalSLLLookaheadOps() {
- let decisions = this.atnSimulator.getDecisionInfo();
- let k = 0;
- for (let i = 0; i < decisions.length; i++) {
- k += decisions[i].SLL_TotalLook;
- }
- return k;
- }
- /**
- * Gets the total number of LL lookahead operations across all decisions
- * made during parsing. This value is the sum of
- * {@link DecisionInfo#LL_TotalLook} for all decisions.
- */
- getTotalLLLookaheadOps() {
- let decisions = this.atnSimulator.getDecisionInfo();
- let k = 0;
- for (let i = 0; i < decisions.length; i++) {
- k += decisions[i].LL_TotalLook;
- }
- return k;
- }
- /**
- * Gets the total number of ATN lookahead operations for SLL prediction
- * across all decisions made during parsing.
- */
- getTotalSLLATNLookaheadOps() {
- let decisions = this.atnSimulator.getDecisionInfo();
- let k = 0;
- for (let i = 0; i < decisions.length; i++) {
- k += decisions[i].SLL_ATNTransitions;
- }
- return k;
- }
- /**
- * Gets the total number of ATN lookahead operations for LL prediction
- * across all decisions made during parsing.
- */
- getTotalLLATNLookaheadOps() {
- let decisions = this.atnSimulator.getDecisionInfo();
- let k = 0;
- for (let i = 0; i < decisions.length; i++) {
- k += decisions[i].LL_ATNTransitions;
- }
- return k;
- }
- /**
- * Gets the total number of ATN lookahead operations for SLL and LL
- * prediction across all decisions made during parsing.
- *
- *
- * This value is the sum of {@link #getTotalSLLATNLookaheadOps} and
- * {@link #getTotalLLATNLookaheadOps}.
- */
- getTotalATNLookaheadOps() {
- let decisions = this.atnSimulator.getDecisionInfo();
- let k = 0;
- for (let i = 0; i < decisions.length; i++) {
- k += decisions[i].SLL_ATNTransitions;
- k += decisions[i].LL_ATNTransitions;
- }
- return k;
- }
- getDFASize(decision) {
- if (decision) {
- let decisionToDFA = this.atnSimulator.atn.decisionToDFA[decision];
- return decisionToDFA.states.size;
- }
- else {
- let n = 0;
- let decisionToDFA = this.atnSimulator.atn.decisionToDFA;
- for (let i = 0; i < decisionToDFA.length; i++) {
- n += this.getDFASize(i);
- }
- return n;
- }
- }
-};
-__decorate([
- Decorators_1.NotNull
-], ParseInfo.prototype, "getDecisionInfo", null);
-__decorate([
- Decorators_1.NotNull
-], ParseInfo.prototype, "getLLDecisions", null);
-ParseInfo = __decorate([
- __param(0, Decorators_1.NotNull)
-], ParseInfo);
-exports.ParseInfo = ParseInfo;
-//# sourceMappingURL=ParseInfo.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ParseInfo.js.map b/node_modules/antlr4ts/atn/ParseInfo.js.map
deleted file mode 100644
index c48628e..0000000
--- a/node_modules/antlr4ts/atn/ParseInfo.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ParseInfo.js","sourceRoot":"","sources":["../../../src/atn/ParseInfo.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAMH,8CAAwC;AAGxC;;;;;GAKG;AACH,IAAa,SAAS,GAAtB;IAGC,YAAqB,YAAmC;QACvD,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;IAClC,CAAC;IAED;;;;;;OAMG;IAEH,eAAe;QACd,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,eAAe,EAAE,CAAC;IAC5C,CAAC;IAED;;;;;;;OAOG;IAEH,cAAc;QACb,IAAI,SAAS,GAAmB,IAAI,CAAC,YAAY,CAAC,eAAe,EAAE,CAAC;QACpE,IAAI,EAAE,GAAa,EAAE,CAAC;QACtB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,QAAQ,GAAW,SAAS,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;YAChD,EAAE,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;gBAClB,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,CAAC;QACF,CAAC;QAED,MAAM,CAAC,EAAE,CAAC;IACX,CAAC;IAED;;;;OAIG;IACH,wBAAwB;QACvB,IAAI,SAAS,GAAmB,IAAI,CAAC,YAAY,CAAC,eAAe,EAAE,CAAC;QACpE,IAAI,CAAC,GAAW,CAAC,CAAC;QAClB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC;QACpC,CAAC;QAED,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAED;;;;OAIG;IACH,uBAAuB;QACtB,IAAI,SAAS,GAAmB,IAAI,CAAC,YAAY,CAAC,eAAe,EAAE,CAAC;QACpE,IAAI,CAAC,GAAW,CAAC,CAAC;QAClB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;QACjC,CAAC;QAED,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAED;;;;OAIG;IACH,sBAAsB;QACrB,IAAI,SAAS,GAAmB,IAAI,CAAC,YAAY,CAAC,eAAe,EAAE,CAAC;QACpE,IAAI,CAAC,GAAW,CAAC,CAAC;QAClB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC;QAChC,CAAC;QAED,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAED;;;OAGG;IACH,0BAA0B;QACzB,IAAI,SAAS,GAAmB,IAAI,CAAC,YAAY,CAAC,eAAe,EAAE,CAAC;QACpE,IAAI,CAAC,GAAW,CAAC,CAAC;QAClB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC;QACtC,CAAC;QAED,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAED;;;OAGG;IACH,yBAAyB;QACxB,IAAI,SAAS,GAAmB,IAAI,CAAC,YAAY,CAAC,eAAe,EAAE,CAAC;QACpE,IAAI,CAAC,GAAW,CAAC,CAAC;QAClB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC;QACrC,CAAC;QAED,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAED;;;;;;;OAOG;IACH,uBAAuB;QACtB,IAAI,SAAS,GAAmB,IAAI,CAAC,YAAY,CAAC,eAAe,EAAE,CAAC;QACpE,IAAI,CAAC,GAAW,CAAC,CAAC;QAClB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC;YACrC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC;QACrC,CAAC;QAED,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAcD,UAAU,CAAC,QAAiB;QAC3B,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;YACd,IAAI,aAAa,GAAQ,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YACvE,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC;QAClC,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,GAAW,CAAC,CAAC;YAClB,IAAI,aAAa,GAAU,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,aAAa,CAAC;YAC/D,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/C,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC;YAED,MAAM,CAAC,CAAC,CAAC;QACV,CAAC;IACF,CAAC;CACD,CAAA;AAhJA;IADC,oBAAO;gDAGP;AAWD;IADC,oBAAO;+CAYP;AAvCW,SAAS;IAGR,WAAA,oBAAO,CAAA;GAHR,SAAS,CA+JrB;AA/JY,8BAAS"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ParserATNSimulator.d.ts b/node_modules/antlr4ts/atn/ParserATNSimulator.d.ts
deleted file mode 100644
index de6aecd..0000000
--- a/node_modules/antlr4ts/atn/ParserATNSimulator.d.ts
+++ /dev/null
@@ -1,616 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ActionTransition } from './ActionTransition';
-import { Array2DHashSet } from '../misc/Array2DHashSet';
-import { ATN } from './ATN';
-import { ATNConfig } from './ATNConfig';
-import { ATNConfigSet } from './ATNConfigSet';
-import { ATNSimulator } from './ATNSimulator';
-import { ATNState } from './ATNState';
-import { BitSet } from '../misc/BitSet';
-import { Collection } from '../misc/Stubs';
-import { DFA } from '../dfa/DFA';
-import { DFAState } from '../dfa/DFAState';
-import { IntegerList } from '../misc/IntegerList';
-import { NoViableAltException } from '../NoViableAltException';
-import { Parser } from '../Parser';
-import { ParserRuleContext } from '../ParserRuleContext';
-import { PrecedencePredicateTransition } from './PrecedencePredicateTransition';
-import { PredicateTransition } from './PredicateTransition';
-import { PredictionContextCache } from './PredictionContextCache';
-import { PredictionMode } from './PredictionMode';
-import { RuleContext } from '../RuleContext';
-import { RuleTransition } from './RuleTransition';
-import { SemanticContext } from './SemanticContext';
-import { SimulatorState } from './SimulatorState';
-import { TokenStream } from '../TokenStream';
-import { Transition } from './Transition';
-/**
- * The embodiment of the adaptive LL(*), ALL(*), parsing strategy.
- *
- *
- * The basic complexity of the adaptive strategy makes it harder to understand.
- * We begin with ATN simulation to build paths in a DFA. Subsequent prediction
- * requests go through the DFA first. If they reach a state without an edge for
- * the current symbol, the algorithm fails over to the ATN simulation to
- * complete the DFA path for the current input (until it finds a conflict state
- * or uniquely predicting state).
- *
- *
- * All of that is done without using the outer context because we want to create
- * a DFA that is not dependent upon the rule invocation stack when we do a
- * prediction. One DFA works in all contexts. We avoid using context not
- * necessarily because it's slower, although it can be, but because of the DFA
- * caching problem. The closure routine only considers the rule invocation stack
- * created during prediction beginning in the decision rule. For example, if
- * prediction occurs without invoking another rule's ATN, there are no context
- * stacks in the configurations. When lack of context leads to a conflict, we
- * don't know if it's an ambiguity or a weakness in the strong LL(*) parsing
- * strategy (versus full LL(*)).
- *
- *
- * When SLL yields a configuration set with conflict, we rewind the input and
- * retry the ATN simulation, this time using full outer context without adding
- * to the DFA. Configuration context stacks will be the full invocation stacks
- * from the start rule. If we get a conflict using full context, then we can
- * definitively say we have a true ambiguity for that input sequence. If we
- * don't get a conflict, it implies that the decision is sensitive to the outer
- * context. (It is not context-sensitive in the sense of context-sensitive
- * grammars.)
- *
- *
- * The next time we reach this DFA state with an SLL conflict, through DFA
- * simulation, we will again retry the ATN simulation using full context mode.
- * This is slow because we can't save the results and have to "interpret" the
- * ATN each time we get that input.
- *
- *
- * CACHING FULL CONTEXT PREDICTIONS
- *
- *
- * We could cache results from full context to predicted alternative easily and
- * that saves a lot of time but doesn't work in presence of predicates. The set
- * of visible predicates from the ATN start state changes depending on the
- * context, because closure can fall off the end of a rule. I tried to cache
- * tuples (stack context, semantic context, predicted alt) but it was slower
- * than interpreting and much more complicated. Also required a huge amount of
- * memory. The goal is not to create the world's fastest parser anyway. I'd like
- * to keep this algorithm simple. By launching multiple threads, we can improve
- * the speed of parsing across a large number of files.
- *
- *
- * There is no strict ordering between the amount of input used by SLL vs LL,
- * which makes it really hard to build a cache for full context. Let's say that
- * we have input A B C that leads to an SLL conflict with full context X. That
- * implies that using X we might only use A B but we could also use A B C D to
- * resolve conflict. Input A B C D could predict alternative 1 in one position
- * in the input and A B C E could predict alternative 2 in another position in
- * input. The conflicting SLL configurations could still be non-unique in the
- * full context prediction, which would lead us to requiring more input than the
- * original A B C. To make a prediction cache work, we have to track the exact
- * input used during the previous prediction. That amounts to a cache that maps
- * X to a specific DFA for that context.
- *
- *
- * Something should be done for left-recursive expression predictions. They are
- * likely LL(1) + pred eval. Easier to do the whole SLL unless error and retry
- * with full LL thing Sam does.
- *
- *
- * AVOIDING FULL CONTEXT PREDICTION
- *
- *
- * We avoid doing full context retry when the outer context is empty, we did not
- * dip into the outer context by falling off the end of the decision state rule,
- * or when we force SLL mode.
- *
- *
- * As an example of the not dip into outer context case, consider as super
- * constructor calls versus function calls. One grammar might look like
- * this:
- *
- *
- * ctorBody
- * : '{' superCall? stat* '}'
- * ;
- *
- *
- *
- * Or, you might see something like
- *
- *
- * stat
- * : superCall ';'
- * | expression ';'
- * | ...
- * ;
- *
- *
- *
- * In both cases I believe that no closure operations will dip into the outer
- * context. In the first case ctorBody in the worst case will stop at the '}'.
- * In the 2nd case it should stop at the ';'. Both cases should stay within the
- * entry rule and not dip into the outer context.
- *
- *
- * PREDICATES
- *
- *
- * Predicates are always evaluated if present in either SLL or LL both. SLL and
- * LL simulation deals with predicates differently. SLL collects predicates as
- * it performs closure operations like ANTLR v3 did. It delays predicate
- * evaluation until it reaches and accept state. This allows us to cache the SLL
- * ATN simulation whereas, if we had evaluated predicates on-the-fly during
- * closure, the DFA state configuration sets would be different and we couldn't
- * build up a suitable DFA.
- *
- *
- * When building a DFA accept state during ATN simulation, we evaluate any
- * predicates and return the sole semantically valid alternative. If there is
- * more than 1 alternative, we report an ambiguity. If there are 0 alternatives,
- * we throw an exception. Alternatives without predicates act like they have
- * true predicates. The simple way to think about it is to strip away all
- * alternatives with false predicates and choose the minimum alternative that
- * remains.
- *
- *
- * When we start in the DFA and reach an accept state that's predicated, we test
- * those and return the minimum semantically viable alternative. If no
- * alternatives are viable, we throw an exception.
- *
- *
- * During full LL ATN simulation, closure always evaluates predicates and
- * on-the-fly. This is crucial to reducing the configuration set size during
- * closure. It hits a landmine when parsing with the Java grammar, for example,
- * without this on-the-fly evaluation.
- *
- *
- * SHARING DFA
- *
- *
- * All instances of the same parser share the same decision DFAs through a
- * static field. Each instance gets its own ATN simulator but they share the
- * same {@link ATN#decisionToDFA} field. They also share a
- * {@link PredictionContextCache} object that makes sure that all
- * {@link PredictionContext} objects are shared among the DFA states. This makes
- * a big size difference.
- *
- *
- * THREAD SAFETY
- *
- *
- * The {@link ParserATNSimulator} locks on the {@link ATN#decisionToDFA} field when
- * it adds a new DFA object to that array. {@link #addDFAEdge}
- * locks on the DFA for the current decision when setting the
- * {@link DFAState#edges} field. {@link #addDFAState} locks on
- * the DFA for the current decision when looking up a DFA state to see if it
- * already exists. We must make sure that all requests to add DFA states that
- * are equivalent result in the same shared DFA object. This is because lots of
- * threads will be trying to update the DFA at once. The
- * {@link #addDFAState} method also locks inside the DFA lock
- * but this time on the shared context cache when it rebuilds the
- * configurations' {@link PredictionContext} objects using cached
- * subgraphs/nodes. No other locking occurs, even during DFA simulation. This is
- * safe as long as we can guarantee that all threads referencing
- * {@code s.edge[t]} get the same physical target {@link DFAState}, or
- * {@code null}. Once into the DFA, the DFA simulation does not reference the
- * {@link DFA#states} map. It follows the {@link DFAState#edges} field to new
- * targets. The DFA simulator will either find {@link DFAState#edges} to be
- * {@code null}, to be non-{@code null} and {@code dfa.edges[t]} null, or
- * {@code dfa.edges[t]} to be non-null. The
- * {@link #addDFAEdge} method could be racing to set the field
- * but in either case the DFA simulator works; if {@code null}, and requests ATN
- * simulation. It could also race trying to get {@code dfa.edges[t]}, but either
- * way it will work because it's not doing a test and set operation.
- *
- *
- * Starting with SLL then failing to combined SLL/LL (Two-Stage
- * Parsing)
- *
- *
- * Sam pointed out that if SLL does not give a syntax error, then there is no
- * point in doing full LL, which is slower. We only have to try LL if we get a
- * syntax error. For maximum speed, Sam starts the parser set to pure SLL
- * mode with the {@link BailErrorStrategy}:
- *
- *
- * parser.interpreter.{@link #setPredictionMode setPredictionMode}{@code (}{@link PredictionMode#SLL}{@code )};
- * parser.{@link Parser#setErrorHandler setErrorHandler}(new {@link BailErrorStrategy}());
- *
- *
- *
- * If it does not get a syntax error, then we're done. If it does get a syntax
- * error, we need to retry with the combined SLL/LL strategy.
- *
- *
- * The reason this works is as follows. If there are no SLL conflicts, then the
- * grammar is SLL (at least for that input set). If there is an SLL conflict,
- * the full LL analysis must yield a set of viable alternatives which is a
- * subset of the alternatives reported by SLL. If the LL set is a singleton,
- * then the grammar is LL but not SLL. If the LL set is the same size as the SLL
- * set, the decision is SLL. If the LL set has size > 1, then that decision
- * is truly ambiguous on the current input. If the LL set is smaller, then the
- * SLL conflict resolution might choose an alternative that the full LL would
- * rule out as a possibility based upon better context information. If that's
- * the case, then the SLL parse will definitely get an error because the full LL
- * analysis says it's not viable. If SLL conflict resolution chooses an
- * alternative within the LL set, them both SLL and LL would choose the same
- * alternative because they both choose the minimum of multiple conflicting
- * alternatives.
- *
- *
- * Let's say we have a set of SLL conflicting alternatives {@code {1, 2, 3}} and
- * a smaller LL set called s. If s is {@code {2, 3}}, then SLL
- * parsing will get an error because SLL will pursue alternative 1. If
- * s is {@code {1, 2}} or {@code {1, 3}} then both SLL and LL will
- * choose the same alternative because alternative one is the minimum of either
- * set. If s is {@code {2}} or {@code {3}} then SLL will get a syntax
- * error. If s is {@code {1}} then SLL will succeed.
- *
- *
- * Of course, if the input is invalid, then we will get an error for sure in
- * both SLL and LL parsing. Erroneous input will therefore require 2 passes over
- * the input.
- */
-export declare class ParserATNSimulator extends ATNSimulator {
- static debug: boolean;
- static dfa_debug: boolean;
- static retry_debug: boolean;
- private predictionMode;
- force_global_context: boolean;
- always_try_local_context: boolean;
- /**
- * Determines whether the DFA is used for full-context predictions. When
- * {@code true}, the DFA stores transition information for both full-context
- * and SLL parsing; otherwise, the DFA only stores SLL transition
- * information.
- *
- *
- * For some grammars, enabling the full-context DFA can result in a
- * substantial performance improvement. However, this improvement typically
- * comes at the expense of memory used for storing the cached DFA states,
- * configuration sets, and prediction contexts.
- *
- *
- * The default value is {@code false}.
- */
- enable_global_context_dfa: boolean;
- optimize_unique_closure: boolean;
- optimize_ll1: boolean;
- optimize_tail_calls: boolean;
- tail_call_preserves_sll: boolean;
- treat_sllk1_conflict_as_ambiguity: boolean;
- protected _parser: Parser;
- /**
- * When {@code true}, ambiguous alternatives are reported when they are
- * encountered within {@link #execATN}. When {@code false}, these messages
- * are suppressed. The default is {@code false}.
- *
- * When messages about ambiguous alternatives are not required, setting this
- * to {@code false} enables additional internal optimizations which may lose
- * this information.
- */
- reportAmbiguities: boolean;
- /** By default we do full context-sensitive LL(*) parsing not
- * Strong LL(*) parsing. If we fail with Strong LL(*) we
- * try full LL(*). That means we rewind and use context information
- * when closure operations fall off the end of the rule that
- * holds the decision were evaluating.
- */
- protected userWantsCtxSensitive: boolean;
- private dfa?;
- constructor(atn: ATN, parser: Parser);
- getPredictionMode(): PredictionMode;
- setPredictionMode(predictionMode: PredictionMode): void;
- reset(): void;
- adaptivePredict(input: TokenStream, decision: number, outerContext: ParserRuleContext | undefined): number;
- adaptivePredict(input: TokenStream, decision: number, outerContext: ParserRuleContext | undefined, useContext: boolean): number;
- protected getStartState(dfa: DFA, input: TokenStream, outerContext: ParserRuleContext, useContext: boolean): SimulatorState | undefined;
- protected execDFA(dfa: DFA, input: TokenStream, startIndex: number, state: SimulatorState): number;
- /**
- * Determines if a particular DFA state should be treated as an accept state
- * for the current prediction mode. In addition to the {@code useContext}
- * parameter, the {@link #getPredictionMode()} method provides the
- * prediction mode controlling the prediction algorithm as a whole.
- *
- *
- * The default implementation simply returns the value of
- * `DFAState.isAcceptState` except for conflict states when
- * {@code useContext} is {@code true} and {@link #getPredictionMode()} is
- * {@link PredictionMode#LL_EXACT_AMBIG_DETECTION}. In that case, only
- * conflict states where {@link ATNConfigSet#isExactConflict} is
- * {@code true} are considered accept states.
- *
- *
- * @param state The DFA state to check.
- * @param useContext {@code true} if the prediction algorithm is currently
- * considering the full parser context; otherwise, {@code false} if the
- * algorithm is currently performing a local context prediction.
- *
- * @return {@code true} if the specified {@code state} is an accept state;
- * otherwise, {@code false}.
- */
- protected isAcceptState(state: DFAState, useContext: boolean): boolean;
- /** Performs ATN simulation to compute a predicted alternative based
- * upon the remaining input, but also updates the DFA cache to avoid
- * having to traverse the ATN again for the same input sequence.
-
- There are some key conditions we're looking for after computing a new
- set of ATN configs (proposed DFA state):
- * if the set is empty, there is no viable alternative for current symbol
- * does the state uniquely predict an alternative?
- * does the state have a conflict that would prevent us from
- putting it on the work list?
- * if in non-greedy decision is there a config at a rule stop state?
-
- We also have some key operations to do:
- * add an edge from previous DFA state to potentially new DFA state, D,
- upon current symbol but only if adding to work list, which means in all
- cases except no viable alternative (and possibly non-greedy decisions?)
- * collecting predicates and adding semantic context to DFA accept states
- * adding rule context to context-sensitive DFA accept states
- * consuming an input symbol
- * reporting a conflict
- * reporting an ambiguity
- * reporting a context sensitivity
- * reporting insufficient predicates
-
- We should isolate those operations, which are side-effecting, to the
- main work loop. We can isolate lots of code into other functions, but
- they should be side effect free. They can return package that
- indicates whether we should report something, whether we need to add a
- DFA edge, whether we need to augment accept state with semantic
- context or rule invocation context. Actually, it seems like we always
- add predicates if they exist, so that can simply be done in the main
- loop for any accept state creation or modification request.
-
- cover these cases:
- dead end
- single alt
- single alt + preds
- conflict
- conflict + preds
-
- TODO: greedy + those
-
- */
- protected execATN(dfa: DFA, input: TokenStream, startIndex: number, initialState: SimulatorState): number;
- /**
- * This method is used to improve the localization of error messages by
- * choosing an alternative rather than throwing a
- * {@link NoViableAltException} in particular prediction scenarios where the
- * {@link #ERROR} state was reached during ATN simulation.
- *
- *
- * The default implementation of this method uses the following
- * algorithm to identify an ATN configuration which successfully parsed the
- * decision entry rule. Choosing such an alternative ensures that the
- * {@link ParserRuleContext} returned by the calling rule will be complete
- * and valid, and the syntax error will be reported later at a more
- * localized location.
- *
- *
- * - If no configuration in {@code configs} reached the end of the
- * decision rule, return {@link ATN#INVALID_ALT_NUMBER}.
- * - If all configurations in {@code configs} which reached the end of the
- * decision rule predict the same alternative, return that alternative.
- * - If the configurations in {@code configs} which reached the end of the
- * decision rule predict multiple alternatives (call this S),
- * choose an alternative in the following order.
- *
- * - Filter the configurations in {@code configs} to only those
- * configurations which remain viable after evaluating semantic predicates.
- * If the set of these filtered configurations which also reached the end of
- * the decision rule is not empty, return the minimum alternative
- * represented in this set.
- * - Otherwise, choose the minimum alternative in S.
- *
- *
- *
- *
- *
- * In some scenarios, the algorithm described above could predict an
- * alternative which will result in a {@link FailedPredicateException} in
- * parser. Specifically, this could occur if the only configuration
- * capable of successfully parsing to the end of the decision rule is
- * blocked by a semantic predicate. By choosing this alternative within
- * {@link #adaptivePredict} instead of throwing a
- * {@link NoViableAltException}, the resulting
- * {@link FailedPredicateException} in the parser will identify the specific
- * predicate which is preventing the parser from successfully parsing the
- * decision rule, which helps developers identify and correct logic errors
- * in semantic predicates.
- *
- *
- * @param input The input {@link TokenStream}
- * @param startIndex The start index for the current prediction, which is
- * the input index where any semantic context in {@code configs} should be
- * evaluated
- * @param previous The ATN simulation state immediately before the
- * {@link #ERROR} state was reached
- *
- * @return The value to return from {@link #adaptivePredict}, or
- * {@link ATN#INVALID_ALT_NUMBER} if a suitable alternative was not
- * identified and {@link #adaptivePredict} should report an error instead.
- */
- protected handleNoViableAlt(input: TokenStream, startIndex: number, previous: SimulatorState): number;
- protected computeReachSet(dfa: DFA, previous: SimulatorState, t: number, contextCache: PredictionContextCache): SimulatorState | undefined;
- /**
- * Get an existing target state for an edge in the DFA. If the target state
- * for the edge has not yet been computed or is otherwise not available,
- * this method returns {@code null}.
- *
- * @param s The current DFA state
- * @param t The next input symbol
- * @return The existing target DFA state for the given input symbol
- * {@code t}, or {@code null} if the target state for this edge is not
- * already cached
- */
- protected getExistingTargetState(s: DFAState, t: number): DFAState | undefined;
- /**
- * Compute a target state for an edge in the DFA, and attempt to add the
- * computed state and corresponding edge to the DFA.
- *
- * @param dfa
- * @param s The current DFA state
- * @param remainingGlobalContext
- * @param t The next input symbol
- * @param useContext
- * @param contextCache
- *
- * @return The computed target DFA state for the given input symbol
- * {@code t}. If {@code t} does not lead to a valid DFA state, this method
- * returns {@link #ERROR}.
- */
- protected computeTargetState(dfa: DFA, s: DFAState, remainingGlobalContext: ParserRuleContext | undefined, t: number, useContext: boolean, contextCache: PredictionContextCache): [DFAState, ParserRuleContext | undefined];
- /**
- * Return a configuration set containing only the configurations from
- * {@code configs} which are in a {@link RuleStopState}. If all
- * configurations in {@code configs} are already in a rule stop state, this
- * method simply returns {@code configs}.
- *
- * @param configs the configuration set to update
- * @param contextCache the {@link PredictionContext} cache
- *
- * @return {@code configs} if all configurations in {@code configs} are in a
- * rule stop state, otherwise return a new configuration set containing only
- * the configurations from {@code configs} which are in a rule stop state
- */
- protected removeAllConfigsNotInRuleStopState(configs: ATNConfigSet, contextCache: PredictionContextCache): ATNConfigSet;
- protected computeStartState(dfa: DFA, globalContext: ParserRuleContext, useContext: boolean): SimulatorState;
- /**
- * This method transforms the start state computed by
- * {@link #computeStartState} to the special start state used by a
- * precedence DFA for a particular precedence value. The transformation
- * process applies the following changes to the start state's configuration
- * set.
- *
- *
- * - Evaluate the precedence predicates for each configuration using
- * {@link SemanticContext#evalPrecedence}.
- * - When {@link ATNConfig#isPrecedenceFilterSuppressed} is {@code false},
- * remove all configurations which predict an alternative greater than 1,
- * for which another configuration that predicts alternative 1 is in the
- * same ATN state with the same prediction context. This transformation is
- * valid for the following reasons:
- *
- * - The closure block cannot contain any epsilon transitions which bypass
- * the body of the closure, so all states reachable via alternative 1 are
- * part of the precedence alternatives of the transformed left-recursive
- * rule.
- * - The "primary" portion of a left recursive rule cannot contain an
- * epsilon transition, so the only way an alternative other than 1 can exist
- * in a state that is also reachable via alternative 1 is by nesting calls
- * to the left-recursive rule, with the outer calls not being at the
- * preferred precedence level. The
- * {@link ATNConfig#isPrecedenceFilterSuppressed} property marks ATN
- * configurations which do not meet this condition, and therefore are not
- * eligible for elimination during the filtering process.
- *
- *
- *
- *
- *
- * The prediction context must be considered by this filter to address
- * situations like the following.
- *
- *
- *
- * grammar TA;
- * prog: statement* EOF;
- * statement: letterA | statement letterA 'b' ;
- * letterA: 'a';
- *
- *
- *
- * If the above grammar, the ATN state immediately before the token
- * reference {@code 'a'} in {@code letterA} is reachable from the left edge
- * of both the primary and closure blocks of the left-recursive rule
- * {@code statement}. The prediction context associated with each of these
- * configurations distinguishes between them, and prevents the alternative
- * which stepped out to {@code prog} (and then back in to {@code statement}
- * from being eliminated by the filter.
- *
- *
- * @param configs The configuration set computed by
- * {@link #computeStartState} as the start state for the DFA.
- * @return The transformed configuration set representing the start state
- * for a precedence DFA at a particular precedence level (determined by
- * calling {@link Parser#getPrecedence}).
- */
- protected applyPrecedenceFilter(configs: ATNConfigSet, globalContext: ParserRuleContext, contextCache: PredictionContextCache): ATNConfigSet;
- protected getReachableTarget(source: ATNConfig, trans: Transition, ttype: number): ATNState | undefined;
- /** collect and set D's semantic context */
- protected predicateDFAState(D: DFAState, configs: ATNConfigSet, nalts: number): DFAState.PredPrediction[] | undefined;
- protected getPredsForAmbigAlts(ambigAlts: BitSet, configs: ATNConfigSet, nalts: number): SemanticContext[] | undefined;
- protected getPredicatePredictions(ambigAlts: BitSet | undefined, altToPred: SemanticContext[]): DFAState.PredPrediction[] | undefined;
- /** Look through a list of predicate/alt pairs, returning alts for the
- * pairs that win. A {@code null} predicate indicates an alt containing an
- * unpredicated config which behaves as "always true."
- */
- protected evalSemanticContext(predPredictions: DFAState.PredPrediction[], outerContext: ParserRuleContext, complete: boolean): BitSet;
- /**
- * Evaluate a semantic context within a specific parser context.
- *
- *
- * This method might not be called for every semantic context evaluated
- * during the prediction process. In particular, we currently do not
- * evaluate the following but it may change in the future:
- *
- *
- * - Precedence predicates (represented by
- * {@link SemanticContext.PrecedencePredicate}) are not currently evaluated
- * through this method.
- * - Operator predicates (represented by {@link SemanticContext.AND} and
- * {@link SemanticContext.OR}) are evaluated as a single semantic
- * context, rather than evaluating the operands individually.
- * Implementations which require evaluation results from individual
- * predicates should override this method to explicitly handle evaluation of
- * the operands within operator predicates.
- *
- *
- * @param pred The semantic context to evaluate
- * @param parserCallStack The parser context in which to evaluate the
- * semantic context
- * @param alt The alternative which is guarded by {@code pred}
- *
- * @since 4.3
- */
- protected evalSemanticContextImpl(pred: SemanticContext, parserCallStack: ParserRuleContext, alt: number): boolean;
- protected closure(sourceConfigs: ATNConfigSet, configs: ATNConfigSet, collectPredicates: boolean, hasMoreContext: boolean, contextCache: PredictionContextCache, treatEofAsEpsilon: boolean): void;
- protected closureImpl(config: ATNConfig, configs: ATNConfigSet, intermediate: ATNConfigSet, closureBusy: Array2DHashSet, collectPredicates: boolean, hasMoreContexts: boolean, contextCache: PredictionContextCache, depth: number, treatEofAsEpsilon: boolean): void;
- getRuleName(index: number): string;
- protected getEpsilonTarget(config: ATNConfig, t: Transition, collectPredicates: boolean, inContext: boolean, contextCache: PredictionContextCache, treatEofAsEpsilon: boolean): ATNConfig | undefined;
- protected actionTransition(config: ATNConfig, t: ActionTransition): ATNConfig;
- protected precedenceTransition(config: ATNConfig, pt: PrecedencePredicateTransition, collectPredicates: boolean, inContext: boolean): ATNConfig;
- protected predTransition(config: ATNConfig, pt: PredicateTransition, collectPredicates: boolean, inContext: boolean): ATNConfig;
- protected ruleTransition(config: ATNConfig, t: RuleTransition, contextCache: PredictionContextCache): ATNConfig;
- private static STATE_ALT_SORT_COMPARATOR;
- private isConflicted(configset, contextCache);
- protected getConflictingAltsFromConfigSet(configs: ATNConfigSet): BitSet | undefined;
- getTokenName(t: number): string;
- getLookaheadName(input: TokenStream): string;
- dumpDeadEndConfigs(nvae: NoViableAltException): void;
- protected noViableAlt(input: TokenStream, outerContext: ParserRuleContext, configs: ATNConfigSet, startIndex: number): NoViableAltException;
- protected getUniqueAlt(configs: Collection): number;
- protected configWithAltAtStopState(configs: Collection, alt: number): boolean;
- protected addDFAEdge(dfa: DFA, fromState: DFAState, t: number, contextTransitions: IntegerList | undefined, toConfigs: ATNConfigSet, contextCache: PredictionContextCache): DFAState;
- protected setDFAEdge(p: DFAState, t: number, q: DFAState): void;
- /** See comment on LexerInterpreter.addDFAState. */
- protected addDFAContextState(dfa: DFA, configs: ATNConfigSet, returnContext: number, contextCache: PredictionContextCache): DFAState;
- /** See comment on LexerInterpreter.addDFAState. */
- protected addDFAState(dfa: DFA, configs: ATNConfigSet, contextCache: PredictionContextCache): DFAState;
- protected createDFAState(dfa: DFA, configs: ATNConfigSet): DFAState;
- protected reportAttemptingFullContext(dfa: DFA, conflictingAlts: BitSet | undefined, conflictState: SimulatorState, startIndex: number, stopIndex: number): void;
- protected reportContextSensitivity(dfa: DFA, prediction: number, acceptState: SimulatorState, startIndex: number, stopIndex: number): void;
- /** If context sensitive parsing, we know it's ambiguity not conflict */
- protected reportAmbiguity(dfa: DFA, D: DFAState, startIndex: number, stopIndex: number, exact: boolean, ambigAlts: BitSet, configs: ATNConfigSet): void;
- protected getReturnState(context: RuleContext): number;
- protected skipTailCalls(context: ParserRuleContext): ParserRuleContext;
- /**
- * @since 4.3
- */
- readonly parser: Parser;
-}
diff --git a/node_modules/antlr4ts/atn/ParserATNSimulator.js b/node_modules/antlr4ts/atn/ParserATNSimulator.js
deleted file mode 100644
index 03d8f51..0000000
--- a/node_modules/antlr4ts/atn/ParserATNSimulator.js
+++ /dev/null
@@ -1,2287 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:31.1989835-07:00
-const AcceptStateInfo_1 = require("../dfa/AcceptStateInfo");
-const ActionTransition_1 = require("./ActionTransition");
-const Array2DHashSet_1 = require("../misc/Array2DHashSet");
-const Arrays_1 = require("../misc/Arrays");
-const Stubs_1 = require("../misc/Stubs");
-const ATN_1 = require("./ATN");
-const ATNConfig_1 = require("./ATNConfig");
-const ATNConfigSet_1 = require("./ATNConfigSet");
-const ATNSimulator_1 = require("./ATNSimulator");
-const AtomTransition_1 = require("./AtomTransition");
-const BitSet_1 = require("../misc/BitSet");
-const ConflictInfo_1 = require("./ConflictInfo");
-const DecisionState_1 = require("./DecisionState");
-const DFAState_1 = require("../dfa/DFAState");
-const IntegerList_1 = require("../misc/IntegerList");
-const Interval_1 = require("../misc/Interval");
-const IntStream_1 = require("../IntStream");
-const Decorators_1 = require("../Decorators");
-const NotSetTransition_1 = require("./NotSetTransition");
-const NoViableAltException_1 = require("../NoViableAltException");
-const ObjectEqualityComparator_1 = require("../misc/ObjectEqualityComparator");
-const ParserRuleContext_1 = require("../ParserRuleContext");
-const PredictionContext_1 = require("./PredictionContext");
-const PredictionContextCache_1 = require("./PredictionContextCache");
-const PredictionMode_1 = require("./PredictionMode");
-const RuleStopState_1 = require("./RuleStopState");
-const RuleTransition_1 = require("./RuleTransition");
-const SemanticContext_1 = require("./SemanticContext");
-const SetTransition_1 = require("./SetTransition");
-const SimulatorState_1 = require("./SimulatorState");
-const Token_1 = require("../Token");
-const VocabularyImpl_1 = require("../VocabularyImpl");
-const assert = require("assert");
-const MAX_SHORT_VALUE = 0xFFFF;
-const MIN_INTEGER_VALUE = -((1 << 31) >>> 0);
-/**
- * The embodiment of the adaptive LL(*), ALL(*), parsing strategy.
- *
- *
- * The basic complexity of the adaptive strategy makes it harder to understand.
- * We begin with ATN simulation to build paths in a DFA. Subsequent prediction
- * requests go through the DFA first. If they reach a state without an edge for
- * the current symbol, the algorithm fails over to the ATN simulation to
- * complete the DFA path for the current input (until it finds a conflict state
- * or uniquely predicting state).
- *
- *
- * All of that is done without using the outer context because we want to create
- * a DFA that is not dependent upon the rule invocation stack when we do a
- * prediction. One DFA works in all contexts. We avoid using context not
- * necessarily because it's slower, although it can be, but because of the DFA
- * caching problem. The closure routine only considers the rule invocation stack
- * created during prediction beginning in the decision rule. For example, if
- * prediction occurs without invoking another rule's ATN, there are no context
- * stacks in the configurations. When lack of context leads to a conflict, we
- * don't know if it's an ambiguity or a weakness in the strong LL(*) parsing
- * strategy (versus full LL(*)).
- *
- *
- * When SLL yields a configuration set with conflict, we rewind the input and
- * retry the ATN simulation, this time using full outer context without adding
- * to the DFA. Configuration context stacks will be the full invocation stacks
- * from the start rule. If we get a conflict using full context, then we can
- * definitively say we have a true ambiguity for that input sequence. If we
- * don't get a conflict, it implies that the decision is sensitive to the outer
- * context. (It is not context-sensitive in the sense of context-sensitive
- * grammars.)
- *
- *
- * The next time we reach this DFA state with an SLL conflict, through DFA
- * simulation, we will again retry the ATN simulation using full context mode.
- * This is slow because we can't save the results and have to "interpret" the
- * ATN each time we get that input.
- *
- *
- * CACHING FULL CONTEXT PREDICTIONS
- *
- *
- * We could cache results from full context to predicted alternative easily and
- * that saves a lot of time but doesn't work in presence of predicates. The set
- * of visible predicates from the ATN start state changes depending on the
- * context, because closure can fall off the end of a rule. I tried to cache
- * tuples (stack context, semantic context, predicted alt) but it was slower
- * than interpreting and much more complicated. Also required a huge amount of
- * memory. The goal is not to create the world's fastest parser anyway. I'd like
- * to keep this algorithm simple. By launching multiple threads, we can improve
- * the speed of parsing across a large number of files.
- *
- *
- * There is no strict ordering between the amount of input used by SLL vs LL,
- * which makes it really hard to build a cache for full context. Let's say that
- * we have input A B C that leads to an SLL conflict with full context X. That
- * implies that using X we might only use A B but we could also use A B C D to
- * resolve conflict. Input A B C D could predict alternative 1 in one position
- * in the input and A B C E could predict alternative 2 in another position in
- * input. The conflicting SLL configurations could still be non-unique in the
- * full context prediction, which would lead us to requiring more input than the
- * original A B C. To make a prediction cache work, we have to track the exact
- * input used during the previous prediction. That amounts to a cache that maps
- * X to a specific DFA for that context.
- *
- *
- * Something should be done for left-recursive expression predictions. They are
- * likely LL(1) + pred eval. Easier to do the whole SLL unless error and retry
- * with full LL thing Sam does.
- *
- *
- * AVOIDING FULL CONTEXT PREDICTION
- *
- *
- * We avoid doing full context retry when the outer context is empty, we did not
- * dip into the outer context by falling off the end of the decision state rule,
- * or when we force SLL mode.
- *
- *
- * As an example of the not dip into outer context case, consider as super
- * constructor calls versus function calls. One grammar might look like
- * this:
- *
- *
- * ctorBody
- * : '{' superCall? stat* '}'
- * ;
- *
- *
- *
- * Or, you might see something like
- *
- *
- * stat
- * : superCall ';'
- * | expression ';'
- * | ...
- * ;
- *
- *
- *
- * In both cases I believe that no closure operations will dip into the outer
- * context. In the first case ctorBody in the worst case will stop at the '}'.
- * In the 2nd case it should stop at the ';'. Both cases should stay within the
- * entry rule and not dip into the outer context.
- *
- *
- * PREDICATES
- *
- *
- * Predicates are always evaluated if present in either SLL or LL both. SLL and
- * LL simulation deals with predicates differently. SLL collects predicates as
- * it performs closure operations like ANTLR v3 did. It delays predicate
- * evaluation until it reaches and accept state. This allows us to cache the SLL
- * ATN simulation whereas, if we had evaluated predicates on-the-fly during
- * closure, the DFA state configuration sets would be different and we couldn't
- * build up a suitable DFA.
- *
- *
- * When building a DFA accept state during ATN simulation, we evaluate any
- * predicates and return the sole semantically valid alternative. If there is
- * more than 1 alternative, we report an ambiguity. If there are 0 alternatives,
- * we throw an exception. Alternatives without predicates act like they have
- * true predicates. The simple way to think about it is to strip away all
- * alternatives with false predicates and choose the minimum alternative that
- * remains.
- *
- *
- * When we start in the DFA and reach an accept state that's predicated, we test
- * those and return the minimum semantically viable alternative. If no
- * alternatives are viable, we throw an exception.
- *
- *
- * During full LL ATN simulation, closure always evaluates predicates and
- * on-the-fly. This is crucial to reducing the configuration set size during
- * closure. It hits a landmine when parsing with the Java grammar, for example,
- * without this on-the-fly evaluation.
- *
- *
- * SHARING DFA
- *
- *
- * All instances of the same parser share the same decision DFAs through a
- * static field. Each instance gets its own ATN simulator but they share the
- * same {@link ATN#decisionToDFA} field. They also share a
- * {@link PredictionContextCache} object that makes sure that all
- * {@link PredictionContext} objects are shared among the DFA states. This makes
- * a big size difference.
- *
- *
- * THREAD SAFETY
- *
- *
- * The {@link ParserATNSimulator} locks on the {@link ATN#decisionToDFA} field when
- * it adds a new DFA object to that array. {@link #addDFAEdge}
- * locks on the DFA for the current decision when setting the
- * {@link DFAState#edges} field. {@link #addDFAState} locks on
- * the DFA for the current decision when looking up a DFA state to see if it
- * already exists. We must make sure that all requests to add DFA states that
- * are equivalent result in the same shared DFA object. This is because lots of
- * threads will be trying to update the DFA at once. The
- * {@link #addDFAState} method also locks inside the DFA lock
- * but this time on the shared context cache when it rebuilds the
- * configurations' {@link PredictionContext} objects using cached
- * subgraphs/nodes. No other locking occurs, even during DFA simulation. This is
- * safe as long as we can guarantee that all threads referencing
- * {@code s.edge[t]} get the same physical target {@link DFAState}, or
- * {@code null}. Once into the DFA, the DFA simulation does not reference the
- * {@link DFA#states} map. It follows the {@link DFAState#edges} field to new
- * targets. The DFA simulator will either find {@link DFAState#edges} to be
- * {@code null}, to be non-{@code null} and {@code dfa.edges[t]} null, or
- * {@code dfa.edges[t]} to be non-null. The
- * {@link #addDFAEdge} method could be racing to set the field
- * but in either case the DFA simulator works; if {@code null}, and requests ATN
- * simulation. It could also race trying to get {@code dfa.edges[t]}, but either
- * way it will work because it's not doing a test and set operation.
- *
- *
- * Starting with SLL then failing to combined SLL/LL (Two-Stage
- * Parsing)
- *
- *
- * Sam pointed out that if SLL does not give a syntax error, then there is no
- * point in doing full LL, which is slower. We only have to try LL if we get a
- * syntax error. For maximum speed, Sam starts the parser set to pure SLL
- * mode with the {@link BailErrorStrategy}:
- *
- *
- * parser.interpreter.{@link #setPredictionMode setPredictionMode}{@code (}{@link PredictionMode#SLL}{@code )};
- * parser.{@link Parser#setErrorHandler setErrorHandler}(new {@link BailErrorStrategy}());
- *
- *
- *
- * If it does not get a syntax error, then we're done. If it does get a syntax
- * error, we need to retry with the combined SLL/LL strategy.
- *
- *
- * The reason this works is as follows. If there are no SLL conflicts, then the
- * grammar is SLL (at least for that input set). If there is an SLL conflict,
- * the full LL analysis must yield a set of viable alternatives which is a
- * subset of the alternatives reported by SLL. If the LL set is a singleton,
- * then the grammar is LL but not SLL. If the LL set is the same size as the SLL
- * set, the decision is SLL. If the LL set has size > 1, then that decision
- * is truly ambiguous on the current input. If the LL set is smaller, then the
- * SLL conflict resolution might choose an alternative that the full LL would
- * rule out as a possibility based upon better context information. If that's
- * the case, then the SLL parse will definitely get an error because the full LL
- * analysis says it's not viable. If SLL conflict resolution chooses an
- * alternative within the LL set, them both SLL and LL would choose the same
- * alternative because they both choose the minimum of multiple conflicting
- * alternatives.
- *
- *
- * Let's say we have a set of SLL conflicting alternatives {@code {1, 2, 3}} and
- * a smaller LL set called s. If s is {@code {2, 3}}, then SLL
- * parsing will get an error because SLL will pursue alternative 1. If
- * s is {@code {1, 2}} or {@code {1, 3}} then both SLL and LL will
- * choose the same alternative because alternative one is the minimum of either
- * set. If s is {@code {2}} or {@code {3}} then SLL will get a syntax
- * error. If s is {@code {1}} then SLL will succeed.
- *
- *
- * Of course, if the input is invalid, then we will get an error for sure in
- * both SLL and LL parsing. Erroneous input will therefore require 2 passes over
- * the input.
- */
-let ParserATNSimulator = class ParserATNSimulator extends ATNSimulator_1.ATNSimulator {
- constructor(atn, parser) {
- super(atn);
- this.predictionMode = PredictionMode_1.PredictionMode.LL;
- this.force_global_context = false;
- this.always_try_local_context = true;
- /**
- * Determines whether the DFA is used for full-context predictions. When
- * {@code true}, the DFA stores transition information for both full-context
- * and SLL parsing; otherwise, the DFA only stores SLL transition
- * information.
- *
- *
- * For some grammars, enabling the full-context DFA can result in a
- * substantial performance improvement. However, this improvement typically
- * comes at the expense of memory used for storing the cached DFA states,
- * configuration sets, and prediction contexts.
- *
- *
- * The default value is {@code false}.
- */
- this.enable_global_context_dfa = false;
- this.optimize_unique_closure = true;
- this.optimize_ll1 = true;
- this.optimize_tail_calls = true;
- this.tail_call_preserves_sll = true;
- this.treat_sllk1_conflict_as_ambiguity = false;
- /**
- * When {@code true}, ambiguous alternatives are reported when they are
- * encountered within {@link #execATN}. When {@code false}, these messages
- * are suppressed. The default is {@code false}.
- *
- * When messages about ambiguous alternatives are not required, setting this
- * to {@code false} enables additional internal optimizations which may lose
- * this information.
- */
- this.reportAmbiguities = false;
- /** By default we do full context-sensitive LL(*) parsing not
- * Strong LL(*) parsing. If we fail with Strong LL(*) we
- * try full LL(*). That means we rewind and use context information
- * when closure operations fall off the end of the rule that
- * holds the decision were evaluating.
- */
- this.userWantsCtxSensitive = true;
- this._parser = parser;
- }
- getPredictionMode() {
- return this.predictionMode;
- }
- setPredictionMode(predictionMode) {
- this.predictionMode = predictionMode;
- }
- reset() {
- }
- adaptivePredict(input, decision, outerContext, useContext) {
- if (useContext === undefined) {
- useContext = false;
- }
- let dfa = this.atn.decisionToDFA[decision];
- assert(dfa != null);
- if (this.optimize_ll1 && !dfa.isPrecedenceDfa && !dfa.isEmpty) {
- let ll_1 = input.LA(1);
- if (ll_1 >= 0 && ll_1 <= 0xFFFF) {
- let key = ((decision << 16) >>> 0) + ll_1;
- let alt = this.atn.LL1Table.get(key);
- if (alt != null) {
- return alt;
- }
- }
- }
- this.dfa = dfa;
- if (this.force_global_context) {
- useContext = true;
- }
- else if (!this.always_try_local_context) {
- useContext = useContext || dfa.isContextSensitive;
- }
- this.userWantsCtxSensitive = useContext || (this.predictionMode !== PredictionMode_1.PredictionMode.SLL && outerContext != null && !this.atn.decisionToState[decision].sll);
- if (outerContext == null) {
- outerContext = ParserRuleContext_1.ParserRuleContext.emptyContext();
- }
- let state;
- if (!dfa.isEmpty) {
- state = this.getStartState(dfa, input, outerContext, useContext);
- }
- if (state == null) {
- if (outerContext == null)
- outerContext = ParserRuleContext_1.ParserRuleContext.emptyContext();
- if (ParserATNSimulator.debug)
- console.log("ATN decision " + dfa.decision +
- " exec LA(1)==" + this.getLookaheadName(input) +
- ", outerContext=" + outerContext.toString(this._parser));
- state = this.computeStartState(dfa, outerContext, useContext);
- }
- let m = input.mark();
- let index = input.index;
- try {
- let alt = this.execDFA(dfa, input, index, state);
- if (ParserATNSimulator.debug)
- console.log("DFA after predictATN: " + dfa.toString(this._parser.vocabulary, this._parser.ruleNames));
- return alt;
- }
- finally {
- this.dfa = undefined;
- input.seek(index);
- input.release(m);
- }
- }
- getStartState(dfa, input, outerContext, useContext) {
- if (!useContext) {
- if (dfa.isPrecedenceDfa) {
- // the start state for a precedence DFA depends on the current
- // parser precedence, and is provided by a DFA method.
- let state = dfa.getPrecedenceStartState(this._parser.precedence, false);
- if (state == null) {
- return undefined;
- }
- return new SimulatorState_1.SimulatorState(outerContext, state, false, outerContext);
- }
- else {
- if (dfa.s0 == null) {
- return undefined;
- }
- return new SimulatorState_1.SimulatorState(outerContext, dfa.s0, false, outerContext);
- }
- }
- if (!this.enable_global_context_dfa) {
- return undefined;
- }
- let remainingContext = outerContext;
- assert(outerContext != null);
- let s0;
- if (dfa.isPrecedenceDfa) {
- s0 = dfa.getPrecedenceStartState(this._parser.precedence, true);
- }
- else {
- s0 = dfa.s0full;
- }
- while (remainingContext != null && s0 != null && s0.isContextSensitive) {
- remainingContext = this.skipTailCalls(remainingContext);
- s0 = s0.getContextTarget(this.getReturnState(remainingContext));
- if (remainingContext.isEmpty) {
- assert(s0 == null || !s0.isContextSensitive);
- }
- else {
- remainingContext = remainingContext.parent;
- }
- }
- if (s0 == null) {
- return undefined;
- }
- return new SimulatorState_1.SimulatorState(outerContext, s0, useContext, remainingContext);
- }
- execDFA(dfa, input, startIndex, state) {
- let outerContext = state.outerContext;
- if (ParserATNSimulator.dfa_debug)
- console.log("DFA decision " + dfa.decision +
- " exec LA(1)==" + this.getLookaheadName(input) +
- ", outerContext=" + outerContext.toString(this._parser));
- if (ParserATNSimulator.dfa_debug)
- console.log(dfa.toString(this._parser.vocabulary, this._parser.ruleNames));
- let s = state.s0;
- let t = input.LA(1);
- let remainingOuterContext = state.remainingOuterContext;
- while (true) {
- if (ParserATNSimulator.dfa_debug)
- console.log("DFA state " + s.stateNumber + " LA(1)==" + this.getLookaheadName(input));
- if (state.useContext) {
- while (s.isContextSymbol(t)) {
- let next;
- if (remainingOuterContext != null) {
- remainingOuterContext = this.skipTailCalls(remainingOuterContext);
- next = s.getContextTarget(this.getReturnState(remainingOuterContext));
- }
- if (next == null) {
- // fail over to ATN
- let initialState = new SimulatorState_1.SimulatorState(state.outerContext, s, state.useContext, remainingOuterContext);
- return this.execATN(dfa, input, startIndex, initialState);
- }
- assert(remainingOuterContext != null);
- remainingOuterContext = remainingOuterContext.parent;
- s = next;
- }
- }
- if (this.isAcceptState(s, state.useContext)) {
- if (s.predicates != null) {
- if (ParserATNSimulator.dfa_debug)
- console.log("accept " + s);
- }
- else {
- if (ParserATNSimulator.dfa_debug)
- console.log("accept; predict " + s.prediction + " in state " + s.stateNumber);
- }
- // keep going unless we're at EOF or state only has one alt number
- // mentioned in configs; check if something else could match
- // TODO: don't we always stop? only lexer would keep going
- // TODO: v3 dfa don't do this.
- break;
- }
- // t is not updated if one of these states is reached
- assert(!this.isAcceptState(s, state.useContext));
- // if no edge, pop over to ATN interpreter, update DFA and return
- let target = this.getExistingTargetState(s, t);
- if (target == null) {
- if (ParserATNSimulator.dfa_debug && t >= 0)
- console.log("no edge for " + this._parser.vocabulary.getDisplayName(t));
- let alt;
- if (ParserATNSimulator.dfa_debug) {
- let interval = Interval_1.Interval.of(startIndex, this._parser.inputStream.index);
- console.log("ATN exec upon " +
- this._parser.inputStream.getText(interval) +
- " at DFA state " + s.stateNumber);
- }
- let initialState = new SimulatorState_1.SimulatorState(outerContext, s, state.useContext, remainingOuterContext);
- alt = this.execATN(dfa, input, startIndex, initialState);
- if (ParserATNSimulator.dfa_debug) {
- console.log("back from DFA update, alt=" + alt + ", dfa=\n" + dfa.toString(this._parser.vocabulary, this._parser.ruleNames));
- //dump(dfa);
- }
- // action already executed
- if (ParserATNSimulator.dfa_debug)
- console.log("DFA decision " + dfa.decision +
- " predicts " + alt);
- return alt; // we've updated DFA, exec'd action, and have our deepest answer
- }
- else if (target === ATNSimulator_1.ATNSimulator.ERROR) {
- let errorState = new SimulatorState_1.SimulatorState(outerContext, s, state.useContext, remainingOuterContext);
- return this.handleNoViableAlt(input, startIndex, errorState);
- }
- s = target;
- if (!this.isAcceptState(s, state.useContext) && t !== IntStream_1.IntStream.EOF) {
- input.consume();
- t = input.LA(1);
- }
- }
- // if ( acceptState==null ) {
- // if ( debug ) System.out.println("!!! no viable alt in dfa");
- // return -1;
- // }
- if (!state.useContext && s.configs.conflictInfo != null) {
- if (dfa.atnStartState instanceof DecisionState_1.DecisionState) {
- if (!this.userWantsCtxSensitive ||
- (!s.configs.dipsIntoOuterContext && s.configs.isExactConflict) ||
- (this.treat_sllk1_conflict_as_ambiguity && input.index === startIndex)) {
- // we don't report the ambiguity again
- //if ( !this.acceptState.configset.hasSemanticContext ) {
- // this.reportAmbiguity(dfa, acceptState, startIndex, input.index, acceptState.configset.conflictingAlts, acceptState.configset);
- //}
- }
- else {
- assert(!state.useContext);
- // Before attempting full context prediction, check to see if there are
- // disambiguating or validating predicates to evaluate which allow an
- // immediate decision
- let conflictingAlts;
- let predicates = s.predicates;
- if (predicates != null) {
- let conflictIndex = input.index;
- if (conflictIndex !== startIndex) {
- input.seek(startIndex);
- }
- conflictingAlts = this.evalSemanticContext(predicates, outerContext, true);
- if (conflictingAlts.cardinality() === 1) {
- return conflictingAlts.nextSetBit(0);
- }
- if (conflictIndex !== startIndex) {
- // restore the index so reporting the fallback to full
- // context occurs with the index at the correct spot
- input.seek(conflictIndex);
- }
- }
- if (this.reportAmbiguities) {
- let conflictState = new SimulatorState_1.SimulatorState(outerContext, s, state.useContext, remainingOuterContext);
- this.reportAttemptingFullContext(dfa, conflictingAlts, conflictState, startIndex, input.index);
- }
- input.seek(startIndex);
- return this.adaptivePredict(input, dfa.decision, outerContext, true);
- }
- }
- }
- // Before jumping to prediction, check to see if there are
- // disambiguating or validating predicates to evaluate
- let predicates = s.predicates;
- if (predicates != null) {
- let stopIndex = input.index;
- if (startIndex !== stopIndex) {
- input.seek(startIndex);
- }
- let alts = this.evalSemanticContext(predicates, outerContext, this.reportAmbiguities && this.predictionMode === PredictionMode_1.PredictionMode.LL_EXACT_AMBIG_DETECTION);
- switch (alts.cardinality()) {
- case 0:
- throw this.noViableAlt(input, outerContext, s.configs, startIndex);
- case 1:
- return alts.nextSetBit(0);
- default:
- // report ambiguity after predicate evaluation to make sure the correct
- // set of ambig alts is reported.
- if (startIndex !== stopIndex) {
- input.seek(stopIndex);
- }
- this.reportAmbiguity(dfa, s, startIndex, stopIndex, s.configs.isExactConflict, alts, s.configs);
- return alts.nextSetBit(0);
- }
- }
- if (ParserATNSimulator.dfa_debug)
- console.log("DFA decision " + dfa.decision +
- " predicts " + s.prediction);
- return s.prediction;
- }
- /**
- * Determines if a particular DFA state should be treated as an accept state
- * for the current prediction mode. In addition to the {@code useContext}
- * parameter, the {@link #getPredictionMode()} method provides the
- * prediction mode controlling the prediction algorithm as a whole.
- *
- *
- * The default implementation simply returns the value of
- * `DFAState.isAcceptState` except for conflict states when
- * {@code useContext} is {@code true} and {@link #getPredictionMode()} is
- * {@link PredictionMode#LL_EXACT_AMBIG_DETECTION}. In that case, only
- * conflict states where {@link ATNConfigSet#isExactConflict} is
- * {@code true} are considered accept states.
- *
- *
- * @param state The DFA state to check.
- * @param useContext {@code true} if the prediction algorithm is currently
- * considering the full parser context; otherwise, {@code false} if the
- * algorithm is currently performing a local context prediction.
- *
- * @return {@code true} if the specified {@code state} is an accept state;
- * otherwise, {@code false}.
- */
- isAcceptState(state, useContext) {
- if (!state.isAcceptState) {
- return false;
- }
- if (state.configs.conflictingAlts == null) {
- // unambiguous
- return true;
- }
- // More picky when we need exact conflicts
- if (useContext && this.predictionMode === PredictionMode_1.PredictionMode.LL_EXACT_AMBIG_DETECTION) {
- return state.configs.isExactConflict;
- }
- return true;
- }
- /** Performs ATN simulation to compute a predicted alternative based
- * upon the remaining input, but also updates the DFA cache to avoid
- * having to traverse the ATN again for the same input sequence.
-
- There are some key conditions we're looking for after computing a new
- set of ATN configs (proposed DFA state):
- * if the set is empty, there is no viable alternative for current symbol
- * does the state uniquely predict an alternative?
- * does the state have a conflict that would prevent us from
- putting it on the work list?
- * if in non-greedy decision is there a config at a rule stop state?
-
- We also have some key operations to do:
- * add an edge from previous DFA state to potentially new DFA state, D,
- upon current symbol but only if adding to work list, which means in all
- cases except no viable alternative (and possibly non-greedy decisions?)
- * collecting predicates and adding semantic context to DFA accept states
- * adding rule context to context-sensitive DFA accept states
- * consuming an input symbol
- * reporting a conflict
- * reporting an ambiguity
- * reporting a context sensitivity
- * reporting insufficient predicates
-
- We should isolate those operations, which are side-effecting, to the
- main work loop. We can isolate lots of code into other functions, but
- they should be side effect free. They can return package that
- indicates whether we should report something, whether we need to add a
- DFA edge, whether we need to augment accept state with semantic
- context or rule invocation context. Actually, it seems like we always
- add predicates if they exist, so that can simply be done in the main
- loop for any accept state creation or modification request.
-
- cover these cases:
- dead end
- single alt
- single alt + preds
- conflict
- conflict + preds
-
- TODO: greedy + those
-
- */
- execATN(dfa, input, startIndex, initialState) {
- if (ParserATNSimulator.debug)
- console.log("execATN decision " + dfa.decision + " exec LA(1)==" + this.getLookaheadName(input));
- let outerContext = initialState.outerContext;
- let useContext = initialState.useContext;
- let t = input.LA(1);
- let previous = initialState;
- let contextCache = new PredictionContextCache_1.PredictionContextCache();
- while (true) {
- let nextState = this.computeReachSet(dfa, previous, t, contextCache);
- if (nextState == null) {
- this.setDFAEdge(previous.s0, input.LA(1), ATNSimulator_1.ATNSimulator.ERROR);
- return this.handleNoViableAlt(input, startIndex, previous);
- }
- let D = nextState.s0;
- // predicted alt => accept state
- assert(D.isAcceptState || D.prediction === ATN_1.ATN.INVALID_ALT_NUMBER);
- // conflicted => accept state
- assert(D.isAcceptState || D.configs.conflictInfo == null);
- if (this.isAcceptState(D, useContext)) {
- let conflictingAlts = D.configs.conflictingAlts;
- let predictedAlt = conflictingAlts == null ? D.prediction : ATN_1.ATN.INVALID_ALT_NUMBER;
- if (predictedAlt !== ATN_1.ATN.INVALID_ALT_NUMBER) {
- if (this.optimize_ll1
- && input.index === startIndex
- && !dfa.isPrecedenceDfa
- && nextState.outerContext === nextState.remainingOuterContext
- && dfa.decision >= 0
- && !D.configs.hasSemanticContext) {
- if (t >= 0 && t <= MAX_SHORT_VALUE) {
- let key = ((dfa.decision << 16) >>> 0) + t;
- this.atn.LL1Table.set(key, predictedAlt);
- }
- }
- if (useContext && this.always_try_local_context) {
- this.reportContextSensitivity(dfa, predictedAlt, nextState, startIndex, input.index);
- }
- }
- predictedAlt = D.prediction;
- // int k = input.index - startIndex + 1; // how much input we used
- // System.out.println("used k="+k);
- let attemptFullContext = conflictingAlts != null && this.userWantsCtxSensitive;
- if (attemptFullContext) {
- // Only exact conflicts are known to be ambiguous when local
- // prediction does not step out of the decision rule.
- attemptFullContext = !useContext
- && (D.configs.dipsIntoOuterContext || !D.configs.isExactConflict)
- && (!this.treat_sllk1_conflict_as_ambiguity || input.index !== startIndex);
- }
- if (D.configs.hasSemanticContext) {
- let predPredictions = D.predicates;
- if (predPredictions != null) {
- let conflictIndex = input.index;
- if (conflictIndex !== startIndex) {
- input.seek(startIndex);
- }
- // use complete evaluation here if we'll want to retry with full context if still ambiguous
- conflictingAlts = this.evalSemanticContext(predPredictions, outerContext, attemptFullContext || this.reportAmbiguities);
- switch (conflictingAlts.cardinality()) {
- case 0:
- throw this.noViableAlt(input, outerContext, D.configs, startIndex);
- case 1:
- return conflictingAlts.nextSetBit(0);
- default:
- break;
- }
- if (conflictIndex !== startIndex) {
- // restore the index so reporting the fallback to full
- // context occurs with the index at the correct spot
- input.seek(conflictIndex);
- }
- }
- }
- if (!attemptFullContext) {
- if (conflictingAlts != null) {
- if (this.reportAmbiguities && conflictingAlts.cardinality() > 1) {
- this.reportAmbiguity(dfa, D, startIndex, input.index, D.configs.isExactConflict, conflictingAlts, D.configs);
- }
- predictedAlt = conflictingAlts.nextSetBit(0);
- }
- return predictedAlt;
- }
- else {
- assert(!useContext);
- assert(this.isAcceptState(D, false));
- if (ParserATNSimulator.debug)
- console.log("RETRY with outerContext=" + outerContext);
- let fullContextState = this.computeStartState(dfa, outerContext, true);
- if (this.reportAmbiguities) {
- this.reportAttemptingFullContext(dfa, conflictingAlts, nextState, startIndex, input.index);
- }
- input.seek(startIndex);
- return this.execATN(dfa, input, startIndex, fullContextState);
- }
- }
- previous = nextState;
- if (t !== IntStream_1.IntStream.EOF) {
- input.consume();
- t = input.LA(1);
- }
- }
- }
- /**
- * This method is used to improve the localization of error messages by
- * choosing an alternative rather than throwing a
- * {@link NoViableAltException} in particular prediction scenarios where the
- * {@link #ERROR} state was reached during ATN simulation.
- *
- *
- * The default implementation of this method uses the following
- * algorithm to identify an ATN configuration which successfully parsed the
- * decision entry rule. Choosing such an alternative ensures that the
- * {@link ParserRuleContext} returned by the calling rule will be complete
- * and valid, and the syntax error will be reported later at a more
- * localized location.
- *
- *
- * - If no configuration in {@code configs} reached the end of the
- * decision rule, return {@link ATN#INVALID_ALT_NUMBER}.
- * - If all configurations in {@code configs} which reached the end of the
- * decision rule predict the same alternative, return that alternative.
- * - If the configurations in {@code configs} which reached the end of the
- * decision rule predict multiple alternatives (call this S),
- * choose an alternative in the following order.
- *
- * - Filter the configurations in {@code configs} to only those
- * configurations which remain viable after evaluating semantic predicates.
- * If the set of these filtered configurations which also reached the end of
- * the decision rule is not empty, return the minimum alternative
- * represented in this set.
- * - Otherwise, choose the minimum alternative in S.
- *
- *
- *
- *
- *
- * In some scenarios, the algorithm described above could predict an
- * alternative which will result in a {@link FailedPredicateException} in
- * parser. Specifically, this could occur if the only configuration
- * capable of successfully parsing to the end of the decision rule is
- * blocked by a semantic predicate. By choosing this alternative within
- * {@link #adaptivePredict} instead of throwing a
- * {@link NoViableAltException}, the resulting
- * {@link FailedPredicateException} in the parser will identify the specific
- * predicate which is preventing the parser from successfully parsing the
- * decision rule, which helps developers identify and correct logic errors
- * in semantic predicates.
- *
- *
- * @param input The input {@link TokenStream}
- * @param startIndex The start index for the current prediction, which is
- * the input index where any semantic context in {@code configs} should be
- * evaluated
- * @param previous The ATN simulation state immediately before the
- * {@link #ERROR} state was reached
- *
- * @return The value to return from {@link #adaptivePredict}, or
- * {@link ATN#INVALID_ALT_NUMBER} if a suitable alternative was not
- * identified and {@link #adaptivePredict} should report an error instead.
- */
- handleNoViableAlt(input, startIndex, previous) {
- if (previous.s0 != null) {
- let alts = new BitSet_1.BitSet();
- let maxAlt = 0;
- for (let config of Stubs_1.asIterable(previous.s0.configs)) {
- if (config.reachesIntoOuterContext || config.state instanceof RuleStopState_1.RuleStopState) {
- alts.set(config.alt);
- maxAlt = Math.max(maxAlt, config.alt);
- }
- }
- switch (alts.cardinality()) {
- case 0:
- break;
- case 1:
- return alts.nextSetBit(0);
- default:
- if (!previous.s0.configs.hasSemanticContext) {
- // configs doesn't contain any predicates, so the predicate
- // filtering code below would be pointless
- return alts.nextSetBit(0);
- }
- /*
- * Try to find a configuration set that not only dipped into the outer
- * context, but also isn't eliminated by a predicate.
- */
- let filteredConfigs = new ATNConfigSet_1.ATNConfigSet();
- for (let config of Stubs_1.asIterable(previous.s0.configs)) {
- if (config.reachesIntoOuterContext || config.state instanceof RuleStopState_1.RuleStopState) {
- filteredConfigs.add(config);
- }
- }
- /* The following code blocks are adapted from predicateDFAState with
- * the following key changes.
- *
- * 1. The code operates on an ATNConfigSet rather than a DFAState.
- * 2. Predicates are collected for all alternatives represented in
- * filteredConfigs, rather than restricting the evaluation to
- * conflicting and/or unique configurations.
- */
- let altToPred = this.getPredsForAmbigAlts(alts, filteredConfigs, maxAlt);
- if (altToPred != null) {
- let predicates = this.getPredicatePredictions(alts, altToPred);
- if (predicates != null) {
- let stopIndex = input.index;
- try {
- input.seek(startIndex);
- let filteredAlts = this.evalSemanticContext(predicates, previous.outerContext, false);
- if (!filteredAlts.isEmpty) {
- return filteredAlts.nextSetBit(0);
- }
- }
- finally {
- input.seek(stopIndex);
- }
- }
- }
- return alts.nextSetBit(0);
- }
- }
- throw this.noViableAlt(input, previous.outerContext, previous.s0.configs, startIndex);
- }
- computeReachSet(dfa, previous, t, contextCache) {
- let useContext = previous.useContext;
- let remainingGlobalContext = previous.remainingOuterContext;
- let s = previous.s0;
- if (useContext) {
- while (s.isContextSymbol(t)) {
- let next;
- if (remainingGlobalContext != null) {
- remainingGlobalContext = this.skipTailCalls(remainingGlobalContext);
- next = s.getContextTarget(this.getReturnState(remainingGlobalContext));
- }
- if (next == null) {
- break;
- }
- assert(remainingGlobalContext != null);
- remainingGlobalContext = remainingGlobalContext.parent;
- s = next;
- }
- }
- assert(!this.isAcceptState(s, useContext));
- if (this.isAcceptState(s, useContext)) {
- return new SimulatorState_1.SimulatorState(previous.outerContext, s, useContext, remainingGlobalContext);
- }
- let s0 = s;
- let target = this.getExistingTargetState(s0, t);
- if (target == null) {
- let result = this.computeTargetState(dfa, s0, remainingGlobalContext, t, useContext, contextCache);
- target = result[0];
- remainingGlobalContext = result[1];
- }
- if (target === ATNSimulator_1.ATNSimulator.ERROR) {
- return undefined;
- }
- assert(!useContext || !target.configs.dipsIntoOuterContext);
- return new SimulatorState_1.SimulatorState(previous.outerContext, target, useContext, remainingGlobalContext);
- }
- /**
- * Get an existing target state for an edge in the DFA. If the target state
- * for the edge has not yet been computed or is otherwise not available,
- * this method returns {@code null}.
- *
- * @param s The current DFA state
- * @param t The next input symbol
- * @return The existing target DFA state for the given input symbol
- * {@code t}, or {@code null} if the target state for this edge is not
- * already cached
- */
- getExistingTargetState(s, t) {
- return s.getTarget(t);
- }
- /**
- * Compute a target state for an edge in the DFA, and attempt to add the
- * computed state and corresponding edge to the DFA.
- *
- * @param dfa
- * @param s The current DFA state
- * @param remainingGlobalContext
- * @param t The next input symbol
- * @param useContext
- * @param contextCache
- *
- * @return The computed target DFA state for the given input symbol
- * {@code t}. If {@code t} does not lead to a valid DFA state, this method
- * returns {@link #ERROR}.
- */
- computeTargetState(dfa, s, remainingGlobalContext, t, useContext, contextCache) {
- let closureConfigs = s.configs.toArray();
- let contextElements;
- let reach = new ATNConfigSet_1.ATNConfigSet();
- let stepIntoGlobal;
- do {
- let hasMoreContext = !useContext || remainingGlobalContext != null;
- if (!hasMoreContext) {
- reach.isOutermostConfigSet = true;
- }
- let reachIntermediate = new ATNConfigSet_1.ATNConfigSet();
- /* Configurations already in a rule stop state indicate reaching the end
- * of the decision rule (local context) or end of the start rule (full
- * context). Once reached, these configurations are never updated by a
- * closure operation, so they are handled separately for the performance
- * advantage of having a smaller intermediate set when calling closure.
- *
- * For full-context reach operations, separate handling is required to
- * ensure that the alternative matching the longest overall sequence is
- * chosen when multiple such configurations can match the input.
- */
- let skippedStopStates;
- for (let c of closureConfigs) {
- if (ParserATNSimulator.debug)
- console.log("testing " + this.getTokenName(t) + " at " + c.toString());
- if (c.state instanceof RuleStopState_1.RuleStopState) {
- assert(c.context.isEmpty);
- if (useContext && !c.reachesIntoOuterContext || t === IntStream_1.IntStream.EOF) {
- if (skippedStopStates == null) {
- skippedStopStates = [];
- }
- skippedStopStates.push(c);
- }
- continue;
- }
- let n = c.state.numberOfOptimizedTransitions;
- for (let ti = 0; ti < n; ti++) {
- let trans = c.state.getOptimizedTransition(ti);
- let target = this.getReachableTarget(c, trans, t);
- if (target != null) {
- reachIntermediate.add(c.transform(target, false), contextCache);
- }
- }
- }
- /* This block optimizes the reach operation for intermediate sets which
- * trivially indicate a termination state for the overall
- * adaptivePredict operation.
- *
- * The conditions assume that intermediate
- * contains all configurations relevant to the reach set, but this
- * condition is not true when one or more configurations have been
- * withheld in skippedStopStates, or when the current symbol is EOF.
- */
- if (this.optimize_unique_closure && skippedStopStates == null && t !== Token_1.Token.EOF && reachIntermediate.uniqueAlt !== ATN_1.ATN.INVALID_ALT_NUMBER) {
- reachIntermediate.isOutermostConfigSet = reach.isOutermostConfigSet;
- reach = reachIntermediate;
- break;
- }
- /* If the reach set could not be trivially determined, perform a closure
- * operation on the intermediate set to compute its initial value.
- */
- let collectPredicates = false;
- let treatEofAsEpsilon = t === Token_1.Token.EOF;
- this.closure(reachIntermediate, reach, collectPredicates, hasMoreContext, contextCache, treatEofAsEpsilon);
- stepIntoGlobal = reach.dipsIntoOuterContext;
- if (t === IntStream_1.IntStream.EOF) {
- /* After consuming EOF no additional input is possible, so we are
- * only interested in configurations which reached the end of the
- * decision rule (local context) or end of the start rule (full
- * context). Update reach to contain only these configurations. This
- * handles both explicit EOF transitions in the grammar and implicit
- * EOF transitions following the end of the decision or start rule.
- *
- * This is handled before the configurations in skippedStopStates,
- * because any configurations potentially added from that list are
- * already guaranteed to meet this condition whether or not it's
- * required.
- */
- reach = this.removeAllConfigsNotInRuleStopState(reach, contextCache);
- }
- /* If skippedStopStates is not null, then it contains at least one
- * configuration. For full-context reach operations, these
- * configurations reached the end of the start rule, in which case we
- * only add them back to reach if no configuration during the current
- * closure operation reached such a state. This ensures adaptivePredict
- * chooses an alternative matching the longest overall sequence when
- * multiple alternatives are viable.
- */
- if (skippedStopStates != null && (!useContext || !PredictionMode_1.PredictionMode.hasConfigInRuleStopState(reach))) {
- assert(skippedStopStates.length > 0);
- for (let c of skippedStopStates) {
- reach.add(c, contextCache);
- }
- }
- if (useContext && stepIntoGlobal) {
- reach.clear();
- // We know remainingGlobalContext is not undefined at this point (why?)
- remainingGlobalContext = remainingGlobalContext;
- remainingGlobalContext = this.skipTailCalls(remainingGlobalContext);
- let nextContextElement = this.getReturnState(remainingGlobalContext);
- if (contextElements == null) {
- contextElements = new IntegerList_1.IntegerList();
- }
- if (remainingGlobalContext.isEmpty) {
- remainingGlobalContext = undefined;
- }
- else {
- remainingGlobalContext = remainingGlobalContext.parent;
- }
- contextElements.add(nextContextElement);
- if (nextContextElement !== PredictionContext_1.PredictionContext.EMPTY_FULL_STATE_KEY) {
- for (let i = 0; i < closureConfigs.length; i++) {
- closureConfigs[i] = closureConfigs[i].appendContext(nextContextElement, contextCache);
- }
- }
- }
- } while (useContext && stepIntoGlobal);
- if (reach.isEmpty) {
- this.setDFAEdge(s, t, ATNSimulator_1.ATNSimulator.ERROR);
- return [ATNSimulator_1.ATNSimulator.ERROR, remainingGlobalContext];
- }
- let result = this.addDFAEdge(dfa, s, t, contextElements, reach, contextCache);
- return [result, remainingGlobalContext];
- }
- /**
- * Return a configuration set containing only the configurations from
- * {@code configs} which are in a {@link RuleStopState}. If all
- * configurations in {@code configs} are already in a rule stop state, this
- * method simply returns {@code configs}.
- *
- * @param configs the configuration set to update
- * @param contextCache the {@link PredictionContext} cache
- *
- * @return {@code configs} if all configurations in {@code configs} are in a
- * rule stop state, otherwise return a new configuration set containing only
- * the configurations from {@code configs} which are in a rule stop state
- */
- removeAllConfigsNotInRuleStopState(configs, contextCache) {
- if (PredictionMode_1.PredictionMode.allConfigsInRuleStopStates(configs)) {
- return configs;
- }
- let result = new ATNConfigSet_1.ATNConfigSet();
- for (let config of Stubs_1.asIterable(configs)) {
- if (!(config.state instanceof RuleStopState_1.RuleStopState)) {
- continue;
- }
- result.add(config, contextCache);
- }
- return result;
- }
- computeStartState(dfa, globalContext, useContext) {
- let s0 = dfa.isPrecedenceDfa ? dfa.getPrecedenceStartState(this._parser.precedence, useContext) :
- useContext ? dfa.s0full :
- dfa.s0;
- if (s0 != null) {
- if (!useContext) {
- return new SimulatorState_1.SimulatorState(globalContext, s0, useContext, globalContext);
- }
- s0.setContextSensitive(this.atn);
- }
- let decision = dfa.decision;
- // @NotNull
- let p = dfa.atnStartState;
- let previousContext = 0;
- let remainingGlobalContext = globalContext;
- let initialContext = useContext ? PredictionContext_1.PredictionContext.EMPTY_FULL : PredictionContext_1.PredictionContext.EMPTY_LOCAL; // always at least the implicit call to start rule
- let contextCache = new PredictionContextCache_1.PredictionContextCache();
- if (useContext) {
- if (!this.enable_global_context_dfa) {
- while (remainingGlobalContext != null) {
- if (remainingGlobalContext.isEmpty) {
- previousContext = PredictionContext_1.PredictionContext.EMPTY_FULL_STATE_KEY;
- remainingGlobalContext = undefined;
- }
- else {
- previousContext = this.getReturnState(remainingGlobalContext);
- initialContext = initialContext.appendSingleContext(previousContext, contextCache);
- remainingGlobalContext = remainingGlobalContext.parent;
- }
- }
- }
- while (s0 != null && s0.isContextSensitive && remainingGlobalContext != null) {
- let next;
- remainingGlobalContext = this.skipTailCalls(remainingGlobalContext);
- if (remainingGlobalContext.isEmpty) {
- next = s0.getContextTarget(PredictionContext_1.PredictionContext.EMPTY_FULL_STATE_KEY);
- previousContext = PredictionContext_1.PredictionContext.EMPTY_FULL_STATE_KEY;
- remainingGlobalContext = undefined;
- }
- else {
- previousContext = this.getReturnState(remainingGlobalContext);
- next = s0.getContextTarget(previousContext);
- initialContext = initialContext.appendSingleContext(previousContext, contextCache);
- remainingGlobalContext = remainingGlobalContext.parent;
- }
- if (next == null) {
- break;
- }
- s0 = next;
- }
- }
- if (s0 != null && !s0.isContextSensitive) {
- return new SimulatorState_1.SimulatorState(globalContext, s0, useContext, remainingGlobalContext);
- }
- let configs = new ATNConfigSet_1.ATNConfigSet();
- while (true) {
- let reachIntermediate = new ATNConfigSet_1.ATNConfigSet();
- let n = p.numberOfTransitions;
- for (let ti = 0; ti < n; ti++) {
- // for each transition
- let target = p.transition(ti).target;
- reachIntermediate.add(ATNConfig_1.ATNConfig.create(target, ti + 1, initialContext));
- }
- let hasMoreContext = remainingGlobalContext != null;
- if (!hasMoreContext) {
- configs.isOutermostConfigSet = true;
- }
- let collectPredicates = true;
- this.closure(reachIntermediate, configs, collectPredicates, hasMoreContext, contextCache, false);
- let stepIntoGlobal = configs.dipsIntoOuterContext;
- let next;
- if (useContext && !this.enable_global_context_dfa) {
- s0 = this.addDFAState(dfa, configs, contextCache);
- break;
- }
- else if (s0 == null) {
- if (!dfa.isPrecedenceDfa) {
- next = this.addDFAState(dfa, configs, contextCache);
- if (useContext) {
- if (!dfa.s0full) {
- dfa.s0full = next;
- }
- else {
- next = dfa.s0full;
- }
- }
- else {
- if (!dfa.s0) {
- dfa.s0 = next;
- }
- else {
- next = dfa.s0;
- }
- }
- }
- else {
- /* If this is a precedence DFA, we use applyPrecedenceFilter
- * to convert the computed start state to a precedence start
- * state. We then use DFA.setPrecedenceStartState to set the
- * appropriate start state for the precedence level rather
- * than simply setting DFA.s0.
- */
- configs = this.applyPrecedenceFilter(configs, globalContext, contextCache);
- next = this.addDFAState(dfa, configs, contextCache);
- dfa.setPrecedenceStartState(this._parser.precedence, useContext, next);
- }
- }
- else {
- if (dfa.isPrecedenceDfa) {
- configs = this.applyPrecedenceFilter(configs, globalContext, contextCache);
- }
- next = this.addDFAState(dfa, configs, contextCache);
- s0.setContextTarget(previousContext, next);
- }
- s0 = next;
- if (!useContext || !stepIntoGlobal) {
- break;
- }
- // TODO: make sure it distinguishes empty stack states
- next.setContextSensitive(this.atn);
- // We know remainingGlobalContext is not undefined at this point (why?)
- remainingGlobalContext = remainingGlobalContext;
- configs.clear();
- remainingGlobalContext = this.skipTailCalls(remainingGlobalContext);
- let nextContextElement = this.getReturnState(remainingGlobalContext);
- if (remainingGlobalContext.isEmpty) {
- remainingGlobalContext = undefined;
- }
- else {
- remainingGlobalContext = remainingGlobalContext.parent;
- }
- if (nextContextElement !== PredictionContext_1.PredictionContext.EMPTY_FULL_STATE_KEY) {
- initialContext = initialContext.appendSingleContext(nextContextElement, contextCache);
- }
- previousContext = nextContextElement;
- }
- return new SimulatorState_1.SimulatorState(globalContext, s0, useContext, remainingGlobalContext);
- }
- /**
- * This method transforms the start state computed by
- * {@link #computeStartState} to the special start state used by a
- * precedence DFA for a particular precedence value. The transformation
- * process applies the following changes to the start state's configuration
- * set.
- *
- *
- * - Evaluate the precedence predicates for each configuration using
- * {@link SemanticContext#evalPrecedence}.
- * - When {@link ATNConfig#isPrecedenceFilterSuppressed} is {@code false},
- * remove all configurations which predict an alternative greater than 1,
- * for which another configuration that predicts alternative 1 is in the
- * same ATN state with the same prediction context. This transformation is
- * valid for the following reasons:
- *
- * - The closure block cannot contain any epsilon transitions which bypass
- * the body of the closure, so all states reachable via alternative 1 are
- * part of the precedence alternatives of the transformed left-recursive
- * rule.
- * - The "primary" portion of a left recursive rule cannot contain an
- * epsilon transition, so the only way an alternative other than 1 can exist
- * in a state that is also reachable via alternative 1 is by nesting calls
- * to the left-recursive rule, with the outer calls not being at the
- * preferred precedence level. The
- * {@link ATNConfig#isPrecedenceFilterSuppressed} property marks ATN
- * configurations which do not meet this condition, and therefore are not
- * eligible for elimination during the filtering process.
- *
- *
- *
- *
- *
- * The prediction context must be considered by this filter to address
- * situations like the following.
- *
- *
- *
- * grammar TA;
- * prog: statement* EOF;
- * statement: letterA | statement letterA 'b' ;
- * letterA: 'a';
- *
- *
- *
- * If the above grammar, the ATN state immediately before the token
- * reference {@code 'a'} in {@code letterA} is reachable from the left edge
- * of both the primary and closure blocks of the left-recursive rule
- * {@code statement}. The prediction context associated with each of these
- * configurations distinguishes between them, and prevents the alternative
- * which stepped out to {@code prog} (and then back in to {@code statement}
- * from being eliminated by the filter.
- *
- *
- * @param configs The configuration set computed by
- * {@link #computeStartState} as the start state for the DFA.
- * @return The transformed configuration set representing the start state
- * for a precedence DFA at a particular precedence level (determined by
- * calling {@link Parser#getPrecedence}).
- */
- applyPrecedenceFilter(configs, globalContext, contextCache) {
- let statesFromAlt1 = new Map();
- let configSet = new ATNConfigSet_1.ATNConfigSet();
- for (let config of Stubs_1.asIterable(configs)) {
- // handle alt 1 first
- if (config.alt !== 1) {
- continue;
- }
- let updatedContext = config.semanticContext.evalPrecedence(this._parser, globalContext);
- if (updatedContext == null) {
- // the configuration was eliminated
- continue;
- }
- statesFromAlt1.set(config.state.stateNumber, config.context);
- if (updatedContext !== config.semanticContext) {
- configSet.add(config.transform(config.state, false, updatedContext), contextCache);
- }
- else {
- configSet.add(config, contextCache);
- }
- }
- for (let config of Stubs_1.asIterable(configs)) {
- if (config.alt === 1) {
- // already handled
- continue;
- }
- if (!config.isPrecedenceFilterSuppressed) {
- /* In the future, this elimination step could be updated to also
- * filter the prediction context for alternatives predicting alt>1
- * (basically a graph subtraction algorithm).
- */
- let context = statesFromAlt1.get(config.state.stateNumber);
- if (context != null && context.equals(config.context)) {
- // eliminated
- continue;
- }
- }
- configSet.add(config, contextCache);
- }
- return configSet;
- }
- getReachableTarget(source, trans, ttype) {
- if (trans.matches(ttype, 0, this.atn.maxTokenType)) {
- return trans.target;
- }
- return undefined;
- }
- /** collect and set D's semantic context */
- predicateDFAState(D, configs, nalts) {
- let conflictingAlts = this.getConflictingAltsFromConfigSet(configs);
- if (!conflictingAlts) {
- throw new Error("This unhandled scenario is intended to be unreachable, but I'm currently not sure of why we know that's the case.");
- }
- if (ParserATNSimulator.debug)
- console.log("predicateDFAState " + D);
- let altToPred = this.getPredsForAmbigAlts(conflictingAlts, configs, nalts);
- // altToPred[uniqueAlt] is now our validating predicate (if any)
- let predPredictions;
- if (altToPred != null) {
- // we have a validating predicate; test it
- // Update DFA so reach becomes accept state with predicate
- predPredictions = this.getPredicatePredictions(conflictingAlts, altToPred);
- D.predicates = predPredictions;
- }
- return predPredictions;
- }
- getPredsForAmbigAlts(ambigAlts, configs, nalts) {
- // REACH=[1|1|[]|0:0, 1|2|[]|0:1]
- /* altToPred starts as an array of all undefined contexts. The entry at index i
- * corresponds to alternative i. altToPred[i] may have one of three values:
- * 1. undefined: no ATNConfig c is found such that c.alt===i
- * 2. SemanticContext.NONE: At least one ATNConfig c exists such that
- * c.alt===i and c.semanticContext===SemanticContext.NONE. In other words,
- * alt i has at least one unpredicated config.
- * 3. Non-NONE Semantic Context: There exists at least one, and for all
- * ATNConfig c such that c.alt===i, c.semanticContext!==SemanticContext.NONE.
- *
- * From this, it is clear that NONE||anything==NONE.
- */
- let altToPred = new Array(nalts + 1);
- let n = altToPred.length;
- for (let c of Stubs_1.asIterable(configs)) {
- if (ambigAlts.get(c.alt)) {
- altToPred[c.alt] = SemanticContext_1.SemanticContext.or(altToPred[c.alt], c.semanticContext);
- }
- }
- let nPredAlts = 0;
- for (let i = 0; i < n; i++) {
- if (altToPred[i] == null) {
- altToPred[i] = SemanticContext_1.SemanticContext.NONE;
- }
- else if (altToPred[i] !== SemanticContext_1.SemanticContext.NONE) {
- nPredAlts++;
- }
- }
- // At this point we know `altToPred` doesn't contain any undefined entries
- let result = altToPred;
- // nonambig alts are undefined in result
- if (nPredAlts === 0)
- result = undefined;
- if (ParserATNSimulator.debug)
- console.log("getPredsForAmbigAlts result " + (result ? Arrays_1.Arrays.toString(result) : "undefined"));
- return result;
- }
- getPredicatePredictions(ambigAlts, altToPred) {
- let pairs = [];
- let containsPredicate = false;
- for (let i = 1; i < altToPred.length; i++) {
- let pred = altToPred[i];
- // unpredicated is indicated by SemanticContext.NONE
- assert(pred != null);
- // find first unpredicated but ambig alternative, if any.
- // Only ambiguous alternatives will have SemanticContext.NONE.
- // Any unambig alts or ambig naked alts after first ambig naked are ignored
- // (null, i) means alt i is the default prediction
- // if no (null, i), then no default prediction.
- if (ambigAlts != null && ambigAlts.get(i) && pred === SemanticContext_1.SemanticContext.NONE) {
- pairs.push(new DFAState_1.DFAState.PredPrediction(pred, i));
- }
- else if (pred !== SemanticContext_1.SemanticContext.NONE) {
- containsPredicate = true;
- pairs.push(new DFAState_1.DFAState.PredPrediction(pred, i));
- }
- }
- if (!containsPredicate) {
- return undefined;
- }
- // System.out.println(Arrays.toString(altToPred)+"->"+pairs);
- return pairs;
- }
- /** Look through a list of predicate/alt pairs, returning alts for the
- * pairs that win. A {@code null} predicate indicates an alt containing an
- * unpredicated config which behaves as "always true."
- */
- evalSemanticContext(predPredictions, outerContext, complete) {
- let predictions = new BitSet_1.BitSet();
- for (let pair of predPredictions) {
- if (pair.pred === SemanticContext_1.SemanticContext.NONE) {
- predictions.set(pair.alt);
- if (!complete) {
- break;
- }
- continue;
- }
- let evaluatedResult = this.evalSemanticContextImpl(pair.pred, outerContext, pair.alt);
- if (ParserATNSimulator.debug || ParserATNSimulator.dfa_debug) {
- console.log("eval pred " + pair + "=" + evaluatedResult);
- }
- if (evaluatedResult) {
- if (ParserATNSimulator.debug || ParserATNSimulator.dfa_debug)
- console.log("PREDICT " + pair.alt);
- predictions.set(pair.alt);
- if (!complete) {
- break;
- }
- }
- }
- return predictions;
- }
- /**
- * Evaluate a semantic context within a specific parser context.
- *
- *
- * This method might not be called for every semantic context evaluated
- * during the prediction process. In particular, we currently do not
- * evaluate the following but it may change in the future:
- *
- *
- * - Precedence predicates (represented by
- * {@link SemanticContext.PrecedencePredicate}) are not currently evaluated
- * through this method.
- * - Operator predicates (represented by {@link SemanticContext.AND} and
- * {@link SemanticContext.OR}) are evaluated as a single semantic
- * context, rather than evaluating the operands individually.
- * Implementations which require evaluation results from individual
- * predicates should override this method to explicitly handle evaluation of
- * the operands within operator predicates.
- *
- *
- * @param pred The semantic context to evaluate
- * @param parserCallStack The parser context in which to evaluate the
- * semantic context
- * @param alt The alternative which is guarded by {@code pred}
- *
- * @since 4.3
- */
- evalSemanticContextImpl(pred, parserCallStack, alt) {
- return pred.eval(this._parser, parserCallStack);
- }
- /* TODO: If we are doing predicates, there is no point in pursuing
- closure operations if we reach a DFA state that uniquely predicts
- alternative. We will not be caching that DFA state and it is a
- waste to pursue the closure. Might have to advance when we do
- ambig detection thought :(
- */
- closure(sourceConfigs, configs, collectPredicates, hasMoreContext, contextCache, treatEofAsEpsilon) {
- if (contextCache == null) {
- contextCache = PredictionContextCache_1.PredictionContextCache.UNCACHED;
- }
- let currentConfigs = sourceConfigs;
- let closureBusy = new Array2DHashSet_1.Array2DHashSet(ObjectEqualityComparator_1.ObjectEqualityComparator.INSTANCE);
- while (currentConfigs.size > 0) {
- let intermediate = new ATNConfigSet_1.ATNConfigSet();
- for (let config of Stubs_1.asIterable(currentConfigs)) {
- this.closureImpl(config, configs, intermediate, closureBusy, collectPredicates, hasMoreContext, contextCache, 0, treatEofAsEpsilon);
- }
- currentConfigs = intermediate;
- }
- }
- closureImpl(config, configs, intermediate, closureBusy, collectPredicates, hasMoreContexts, contextCache, depth, treatEofAsEpsilon) {
- if (ParserATNSimulator.debug)
- console.log("closure(" + config.toString(this._parser, true) + ")");
- if (config.state instanceof RuleStopState_1.RuleStopState) {
- // We hit rule end. If we have context info, use it
- if (!config.context.isEmpty) {
- let hasEmpty = config.context.hasEmpty;
- let nonEmptySize = config.context.size - (hasEmpty ? 1 : 0);
- for (let i = 0; i < nonEmptySize; i++) {
- let newContext = config.context.getParent(i); // "pop" return state
- let returnState = this.atn.states[config.context.getReturnState(i)];
- let c = ATNConfig_1.ATNConfig.create(returnState, config.alt, newContext, config.semanticContext);
- // While we have context to pop back from, we may have
- // gotten that context AFTER having fallen off a rule.
- // Make sure we track that we are now out of context.
- c.outerContextDepth = config.outerContextDepth;
- c.isPrecedenceFilterSuppressed = config.isPrecedenceFilterSuppressed;
- assert(depth > MIN_INTEGER_VALUE);
- this.closureImpl(c, configs, intermediate, closureBusy, collectPredicates, hasMoreContexts, contextCache, depth - 1, treatEofAsEpsilon);
- }
- if (!hasEmpty || !hasMoreContexts) {
- return;
- }
- config = config.transform(config.state, false, PredictionContext_1.PredictionContext.EMPTY_LOCAL);
- }
- else if (!hasMoreContexts) {
- configs.add(config, contextCache);
- return;
- }
- else {
- // else if we have no context info, just chase follow links (if greedy)
- if (ParserATNSimulator.debug)
- console.log("FALLING off rule " +
- this.getRuleName(config.state.ruleIndex));
- if (config.context === PredictionContext_1.PredictionContext.EMPTY_FULL) {
- // no need to keep full context overhead when we step out
- config = config.transform(config.state, false, PredictionContext_1.PredictionContext.EMPTY_LOCAL);
- }
- else if (!config.reachesIntoOuterContext && PredictionContext_1.PredictionContext.isEmptyLocal(config.context)) {
- // add stop state when leaving decision rule for the first time
- configs.add(config, contextCache);
- }
- }
- }
- let p = config.state;
- // optimization
- if (!p.onlyHasEpsilonTransitions) {
- configs.add(config, contextCache);
- // make sure to not return here, because EOF transitions can act as
- // both epsilon transitions and non-epsilon transitions.
- if (ParserATNSimulator.debug)
- console.log("added config " + configs);
- }
- for (let i = 0; i < p.numberOfOptimizedTransitions; i++) {
- // This block implements first-edge elimination of ambiguous LR
- // alternatives as part of dynamic disambiguation during prediction.
- // See antlr/antlr4#1398.
- if (i === 0
- && p.stateType === 10 /* STAR_LOOP_ENTRY */
- && p.precedenceRuleDecision
- && !config.context.hasEmpty) {
- let precedenceDecision = p;
- // When suppress is true, it means the outgoing edge i==0 is
- // ambiguous with the outgoing edge i==1, and thus the closure
- // operation can dynamically disambiguate by suppressing this
- // edge during the closure operation.
- let suppress = true;
- for (let j = 0; j < config.context.size; j++) {
- if (!precedenceDecision.precedenceLoopbackStates.get(config.context.getReturnState(j))) {
- suppress = false;
- break;
- }
- }
- if (suppress) {
- continue;
- }
- }
- let t = p.getOptimizedTransition(i);
- let continueCollecting = !(t instanceof ActionTransition_1.ActionTransition) && collectPredicates;
- let c = this.getEpsilonTarget(config, t, continueCollecting, depth === 0, contextCache, treatEofAsEpsilon);
- if (c != null) {
- if (t instanceof RuleTransition_1.RuleTransition) {
- if (intermediate != null && !collectPredicates) {
- intermediate.add(c, contextCache);
- continue;
- }
- }
- if (!t.isEpsilon && !closureBusy.add(c)) {
- // avoid infinite recursion for EOF* and EOF+
- continue;
- }
- let newDepth = depth;
- if (config.state instanceof RuleStopState_1.RuleStopState) {
- // target fell off end of rule; mark resulting c as having dipped into outer context
- // We can't get here if incoming config was rule stop and we had context
- // track how far we dip into outer context. Might
- // come in handy and we avoid evaluating context dependent
- // preds if this is > 0.
- if (!closureBusy.add(c)) {
- // avoid infinite recursion for right-recursive rules
- continue;
- }
- if (this.dfa != null && this.dfa.isPrecedenceDfa) {
- let outermostPrecedenceReturn = t.outermostPrecedenceReturn;
- if (outermostPrecedenceReturn == this.dfa.atnStartState.ruleIndex) {
- c.isPrecedenceFilterSuppressed = true;
- }
- }
- c.outerContextDepth = c.outerContextDepth + 1;
- assert(newDepth > MIN_INTEGER_VALUE);
- newDepth--;
- if (ParserATNSimulator.debug)
- console.log("dips into outer ctx: " + c);
- }
- else if (t instanceof RuleTransition_1.RuleTransition) {
- if (this.optimize_tail_calls && t.optimizedTailCall && (!this.tail_call_preserves_sll || !PredictionContext_1.PredictionContext.isEmptyLocal(config.context))) {
- assert(c.context === config.context);
- if (newDepth === 0) {
- // the pop/push of a tail call would keep the depth
- // constant, except we latch if it goes negative
- newDepth--;
- if (!this.tail_call_preserves_sll && PredictionContext_1.PredictionContext.isEmptyLocal(config.context)) {
- // make sure the SLL config "dips into the outer context" or prediction may not fall back to LL on conflict
- c.outerContextDepth = c.outerContextDepth + 1;
- }
- }
- }
- else {
- // latch when newDepth goes negative - once we step out of the entry context we can't return
- if (newDepth >= 0) {
- newDepth++;
- }
- }
- }
- this.closureImpl(c, configs, intermediate, closureBusy, continueCollecting, hasMoreContexts, contextCache, newDepth, treatEofAsEpsilon);
- }
- }
- }
- getRuleName(index) {
- if (this._parser != null && index >= 0)
- return this._parser.ruleNames[index];
- return "";
- }
- getEpsilonTarget(config, t, collectPredicates, inContext, contextCache, treatEofAsEpsilon) {
- switch (t.serializationType) {
- case 3 /* RULE */:
- return this.ruleTransition(config, t, contextCache);
- case 10 /* PRECEDENCE */:
- return this.precedenceTransition(config, t, collectPredicates, inContext);
- case 4 /* PREDICATE */:
- return this.predTransition(config, t, collectPredicates, inContext);
- case 6 /* ACTION */:
- return this.actionTransition(config, t);
- case 1 /* EPSILON */:
- return config.transform(t.target, false);
- case 5 /* ATOM */:
- case 2 /* RANGE */:
- case 7 /* SET */:
- // EOF transitions act like epsilon transitions after the first EOF
- // transition is traversed
- if (treatEofAsEpsilon) {
- if (t.matches(Token_1.Token.EOF, 0, 1)) {
- return config.transform(t.target, false);
- }
- }
- return undefined;
- default:
- return undefined;
- }
- }
- actionTransition(config, t) {
- if (ParserATNSimulator.debug)
- console.log("ACTION edge " + t.ruleIndex + ":" + t.actionIndex);
- return config.transform(t.target, false);
- }
- precedenceTransition(config, pt, collectPredicates, inContext) {
- if (ParserATNSimulator.debug) {
- console.log("PRED (collectPredicates=" + collectPredicates + ") " +
- pt.precedence + ">=_p" +
- ", ctx dependent=true");
- if (this._parser != null) {
- console.log("context surrounding pred is " +
- this._parser.getRuleInvocationStack());
- }
- }
- let c;
- if (collectPredicates && inContext) {
- let newSemCtx = SemanticContext_1.SemanticContext.and(config.semanticContext, pt.predicate);
- c = config.transform(pt.target, false, newSemCtx);
- }
- else {
- c = config.transform(pt.target, false);
- }
- if (ParserATNSimulator.debug)
- console.log("config from pred transition=" + c);
- return c;
- }
- predTransition(config, pt, collectPredicates, inContext) {
- if (ParserATNSimulator.debug) {
- console.log("PRED (collectPredicates=" + collectPredicates + ") " +
- pt.ruleIndex + ":" + pt.predIndex +
- ", ctx dependent=" + pt.isCtxDependent);
- if (this._parser != null) {
- console.log("context surrounding pred is " +
- this._parser.getRuleInvocationStack());
- }
- }
- let c;
- if (collectPredicates &&
- (!pt.isCtxDependent || (pt.isCtxDependent && inContext))) {
- let newSemCtx = SemanticContext_1.SemanticContext.and(config.semanticContext, pt.predicate);
- c = config.transform(pt.target, false, newSemCtx);
- }
- else {
- c = config.transform(pt.target, false);
- }
- if (ParserATNSimulator.debug)
- console.log("config from pred transition=" + c);
- return c;
- }
- ruleTransition(config, t, contextCache) {
- if (ParserATNSimulator.debug) {
- console.log("CALL rule " + this.getRuleName(t.target.ruleIndex) +
- ", ctx=" + config.context);
- }
- let returnState = t.followState;
- let newContext;
- if (this.optimize_tail_calls && t.optimizedTailCall && (!this.tail_call_preserves_sll || !PredictionContext_1.PredictionContext.isEmptyLocal(config.context))) {
- newContext = config.context;
- }
- else if (contextCache != null) {
- newContext = contextCache.getChild(config.context, returnState.stateNumber);
- }
- else {
- newContext = config.context.getChild(returnState.stateNumber);
- }
- return config.transform(t.target, false, newContext);
- }
- isConflicted(configset, contextCache) {
- if (configset.uniqueAlt !== ATN_1.ATN.INVALID_ALT_NUMBER || configset.size <= 1) {
- return undefined;
- }
- let configs = configset.toArray();
- configs.sort(ParserATNSimulator.STATE_ALT_SORT_COMPARATOR);
- let exact = !configset.dipsIntoOuterContext;
- let alts = new BitSet_1.BitSet();
- let minAlt = configs[0].alt;
- alts.set(minAlt);
- /* Quick checks come first (single pass, no context joining):
- * 1. Make sure first config in the sorted list predicts the minimum
- * represented alternative.
- * 2. Make sure every represented state has at least one configuration
- * which predicts the minimum represented alternative.
- * 3. (exact only) make sure every represented state has at least one
- * configuration which predicts each represented alternative.
- */
- // quick check 1 & 2 => if we assume #1 holds and check #2 against the
- // minAlt from the first state, #2 will fail if the assumption was
- // incorrect
- let currentState = configs[0].state.nonStopStateNumber;
- for (let config of configs) {
- let stateNumber = config.state.nonStopStateNumber;
- if (stateNumber !== currentState) {
- if (config.alt !== minAlt) {
- return undefined;
- }
- currentState = stateNumber;
- }
- }
- let representedAlts;
- if (exact) {
- currentState = configs[0].state.nonStopStateNumber;
- // get the represented alternatives of the first state
- representedAlts = new BitSet_1.BitSet();
- let maxAlt = minAlt;
- for (let config of configs) {
- if (config.state.nonStopStateNumber != currentState) {
- break;
- }
- let alt = config.alt;
- representedAlts.set(alt);
- maxAlt = alt;
- }
- // quick check #3:
- currentState = configs[0].state.nonStopStateNumber;
- let currentAlt = minAlt;
- for (let config of configs) {
- let stateNumber = config.state.nonStopStateNumber;
- let alt = config.alt;
- if (stateNumber !== currentState) {
- if (currentAlt !== maxAlt) {
- exact = false;
- break;
- }
- currentState = stateNumber;
- currentAlt = minAlt;
- }
- else if (alt !== currentAlt) {
- if (alt !== representedAlts.nextSetBit(currentAlt + 1)) {
- exact = false;
- break;
- }
- currentAlt = alt;
- }
- }
- }
- currentState = configs[0].state.nonStopStateNumber;
- let firstIndexCurrentState = 0;
- let lastIndexCurrentStateMinAlt = 0;
- let joinedCheckContext = configs[0].context;
- for (let i = 1; i < configs.length; i++) {
- let config = configs[i];
- if (config.alt !== minAlt) {
- break;
- }
- if (config.state.nonStopStateNumber !== currentState) {
- break;
- }
- lastIndexCurrentStateMinAlt = i;
- joinedCheckContext = contextCache.join(joinedCheckContext, configs[i].context);
- }
- for (let i = lastIndexCurrentStateMinAlt + 1; i < configs.length; i++) {
- let config = configs[i];
- let state = config.state;
- alts.set(config.alt);
- if (state.nonStopStateNumber !== currentState) {
- currentState = state.nonStopStateNumber;
- firstIndexCurrentState = i;
- lastIndexCurrentStateMinAlt = i;
- joinedCheckContext = config.context;
- for (let j = firstIndexCurrentState + 1; j < configs.length; j++) {
- let config2 = configs[j];
- if (config2.alt !== minAlt) {
- break;
- }
- if (config2.state.nonStopStateNumber !== currentState) {
- break;
- }
- lastIndexCurrentStateMinAlt = j;
- joinedCheckContext = contextCache.join(joinedCheckContext, config2.context);
- }
- i = lastIndexCurrentStateMinAlt;
- continue;
- }
- let joinedCheckContext2 = config.context;
- let currentAlt = config.alt;
- let lastIndexCurrentStateCurrentAlt = i;
- for (let j = lastIndexCurrentStateCurrentAlt + 1; j < configs.length; j++) {
- let config2 = configs[j];
- if (config2.alt !== currentAlt) {
- break;
- }
- if (config2.state.nonStopStateNumber !== currentState) {
- break;
- }
- lastIndexCurrentStateCurrentAlt = j;
- joinedCheckContext2 = contextCache.join(joinedCheckContext2, config2.context);
- }
- i = lastIndexCurrentStateCurrentAlt;
- let check = contextCache.join(joinedCheckContext, joinedCheckContext2);
- if (!joinedCheckContext.equals(check)) {
- return undefined;
- }
- // update exact if necessary
- exact = exact && joinedCheckContext.equals(joinedCheckContext2);
- }
- return new ConflictInfo_1.ConflictInfo(alts, exact);
- }
- getConflictingAltsFromConfigSet(configs) {
- let conflictingAlts = configs.conflictingAlts;
- if (conflictingAlts == null && configs.uniqueAlt !== ATN_1.ATN.INVALID_ALT_NUMBER) {
- conflictingAlts = new BitSet_1.BitSet();
- conflictingAlts.set(configs.uniqueAlt);
- }
- return conflictingAlts;
- }
- getTokenName(t) {
- if (t === Token_1.Token.EOF) {
- return "EOF";
- }
- let vocabulary = this._parser != null ? this._parser.vocabulary : VocabularyImpl_1.VocabularyImpl.EMPTY_VOCABULARY;
- let displayName = vocabulary.getDisplayName(t);
- if (displayName === String(t)) {
- return displayName;
- }
- return displayName + "<" + t + ">";
- }
- getLookaheadName(input) {
- return this.getTokenName(input.LA(1));
- }
- dumpDeadEndConfigs(nvae) {
- console.log("dead end configs: ");
- let deadEndConfigs = nvae.deadEndConfigs;
- if (!deadEndConfigs) {
- return;
- }
- for (let c of Stubs_1.asIterable(deadEndConfigs)) {
- let trans = "no edges";
- if (c.state.numberOfOptimizedTransitions > 0) {
- let t = c.state.getOptimizedTransition(0);
- if (t instanceof AtomTransition_1.AtomTransition) {
- trans = "Atom " + this.getTokenName(t._label);
- }
- else if (t instanceof SetTransition_1.SetTransition) {
- let not = t instanceof NotSetTransition_1.NotSetTransition;
- trans = (not ? "~" : "") + "Set " + t.set.toString();
- }
- }
- console.log(c.toString(this._parser, true) + ":" + trans);
- }
- }
- noViableAlt(input, outerContext, configs, startIndex) {
- return new NoViableAltException_1.NoViableAltException(this._parser, input, input.get(startIndex), input.LT(1), configs, outerContext);
- }
- getUniqueAlt(configs) {
- let alt = ATN_1.ATN.INVALID_ALT_NUMBER;
- for (let c of Stubs_1.asIterable(configs)) {
- if (alt === ATN_1.ATN.INVALID_ALT_NUMBER) {
- alt = c.alt; // found first alt
- }
- else if (c.alt !== alt) {
- return ATN_1.ATN.INVALID_ALT_NUMBER;
- }
- }
- return alt;
- }
- configWithAltAtStopState(configs, alt) {
- for (let c of Stubs_1.asIterable(configs)) {
- if (c.alt === alt) {
- if (c.state instanceof RuleStopState_1.RuleStopState) {
- return true;
- }
- }
- }
- return false;
- }
- addDFAEdge(dfa, fromState, t, contextTransitions, toConfigs, contextCache) {
- assert(contextTransitions == null || contextTransitions.isEmpty || dfa.isContextSensitive);
- let from = fromState;
- let to = this.addDFAState(dfa, toConfigs, contextCache);
- if (contextTransitions != null) {
- for (let context of contextTransitions.toArray()) {
- if (context === PredictionContext_1.PredictionContext.EMPTY_FULL_STATE_KEY) {
- if (from.configs.isOutermostConfigSet) {
- continue;
- }
- }
- from.setContextSensitive(this.atn);
- from.setContextSymbol(t);
- let next = from.getContextTarget(context);
- if (next != null) {
- from = next;
- continue;
- }
- next = this.addDFAContextState(dfa, from.configs, context, contextCache);
- assert(context !== PredictionContext_1.PredictionContext.EMPTY_FULL_STATE_KEY || next.configs.isOutermostConfigSet);
- from.setContextTarget(context, next);
- from = next;
- }
- }
- if (ParserATNSimulator.debug)
- console.log("EDGE " + from + " -> " + to + " upon " + this.getTokenName(t));
- this.setDFAEdge(from, t, to);
- if (ParserATNSimulator.debug)
- console.log("DFA=\n" + dfa.toString(this._parser != null ? this._parser.vocabulary : VocabularyImpl_1.VocabularyImpl.EMPTY_VOCABULARY, this._parser != null ? this._parser.ruleNames : undefined));
- return to;
- }
- setDFAEdge(p, t, q) {
- if (p != null) {
- p.setTarget(t, q);
- }
- }
- /** See comment on LexerInterpreter.addDFAState. */
- addDFAContextState(dfa, configs, returnContext, contextCache) {
- if (returnContext !== PredictionContext_1.PredictionContext.EMPTY_FULL_STATE_KEY) {
- let contextConfigs = new ATNConfigSet_1.ATNConfigSet();
- for (let config of Stubs_1.asIterable(configs)) {
- contextConfigs.add(config.appendContext(returnContext, contextCache));
- }
- return this.addDFAState(dfa, contextConfigs, contextCache);
- }
- else {
- assert(!configs.isOutermostConfigSet, "Shouldn't be adding a duplicate edge.");
- configs = configs.clone(true);
- configs.isOutermostConfigSet = true;
- return this.addDFAState(dfa, configs, contextCache);
- }
- }
- /** See comment on LexerInterpreter.addDFAState. */
- addDFAState(dfa, configs, contextCache) {
- let enableDfa = this.enable_global_context_dfa || !configs.isOutermostConfigSet;
- if (enableDfa) {
- if (!configs.isReadOnly) {
- configs.optimizeConfigs(this);
- }
- let proposed = this.createDFAState(dfa, configs);
- let existing = dfa.states.get(proposed);
- if (existing != null)
- return existing;
- }
- if (!configs.isReadOnly) {
- if (configs.conflictInfo == null) {
- configs.conflictInfo = this.isConflicted(configs, contextCache);
- }
- }
- let newState = this.createDFAState(dfa, configs.clone(true));
- // getDecisionState won't return undefined when we request a known valid decision
- let decisionState = this.atn.getDecisionState(dfa.decision);
- let predictedAlt = this.getUniqueAlt(configs);
- if (predictedAlt !== ATN_1.ATN.INVALID_ALT_NUMBER) {
- newState.acceptStateInfo = new AcceptStateInfo_1.AcceptStateInfo(predictedAlt);
- }
- else if (configs.conflictingAlts != null) {
- let conflictingAlts = configs.conflictingAlts;
- if (conflictingAlts) {
- newState.acceptStateInfo = new AcceptStateInfo_1.AcceptStateInfo(conflictingAlts.nextSetBit(0));
- }
- }
- if (newState.isAcceptState && configs.hasSemanticContext) {
- this.predicateDFAState(newState, configs, decisionState.numberOfTransitions);
- }
- if (!enableDfa) {
- return newState;
- }
- let added = dfa.addState(newState);
- if (ParserATNSimulator.debug && added === newState)
- console.log("adding new DFA state: " + newState);
- return added;
- }
- createDFAState(dfa, configs) {
- return new DFAState_1.DFAState(configs);
- }
- reportAttemptingFullContext(dfa, conflictingAlts, conflictState, startIndex, stopIndex) {
- if (ParserATNSimulator.debug || ParserATNSimulator.retry_debug) {
- let interval = Interval_1.Interval.of(startIndex, stopIndex);
- console.log("reportAttemptingFullContext decision=" + dfa.decision + ":" + conflictState.s0.configs +
- ", input=" + this._parser.inputStream.getText(interval));
- }
- if (this._parser != null) {
- let listener = this._parser.getErrorListenerDispatch();
- if (listener.reportAttemptingFullContext) {
- listener.reportAttemptingFullContext(this._parser, dfa, startIndex, stopIndex, conflictingAlts, conflictState);
- }
- }
- }
- reportContextSensitivity(dfa, prediction, acceptState, startIndex, stopIndex) {
- if (ParserATNSimulator.debug || ParserATNSimulator.retry_debug) {
- let interval = Interval_1.Interval.of(startIndex, stopIndex);
- console.log("reportContextSensitivity decision=" + dfa.decision + ":" + acceptState.s0.configs +
- ", input=" + this._parser.inputStream.getText(interval));
- }
- if (this._parser != null) {
- let listener = this._parser.getErrorListenerDispatch();
- if (listener.reportContextSensitivity) {
- listener.reportContextSensitivity(this._parser, dfa, startIndex, stopIndex, prediction, acceptState);
- }
- }
- }
- /** If context sensitive parsing, we know it's ambiguity not conflict */
- reportAmbiguity(dfa, D, // the DFA state from execATN(): void that had SLL conflicts
- startIndex, stopIndex, exact, ambigAlts, configs) {
- if (ParserATNSimulator.debug || ParserATNSimulator.retry_debug) {
- let interval = Interval_1.Interval.of(startIndex, stopIndex);
- console.log("reportAmbiguity " +
- ambigAlts + ":" + configs +
- ", input=" + this._parser.inputStream.getText(interval));
- }
- if (this._parser != null) {
- let listener = this._parser.getErrorListenerDispatch();
- if (listener.reportAmbiguity) {
- listener.reportAmbiguity(this._parser, dfa, startIndex, stopIndex, exact, ambigAlts, configs);
- }
- }
- }
- getReturnState(context) {
- if (context.isEmpty) {
- return PredictionContext_1.PredictionContext.EMPTY_FULL_STATE_KEY;
- }
- let state = this.atn.states[context.invokingState];
- let transition = state.transition(0);
- return transition.followState.stateNumber;
- }
- skipTailCalls(context) {
- if (!this.optimize_tail_calls) {
- return context;
- }
- while (!context.isEmpty) {
- let state = this.atn.states[context.invokingState];
- assert(state.numberOfTransitions === 1 && state.transition(0).serializationType === 3 /* RULE */);
- let transition = state.transition(0);
- if (!transition.tailCall) {
- break;
- }
- // This method requires that the root ancestor of the ParserRuleContext be empty. If we make it to this
- // line, we know the current node is not empty, which means it does have a parent.
- context = context.parent;
- }
- return context;
- }
- /**
- * @since 4.3
- */
- get parser() {
- return this._parser;
- }
-};
-ParserATNSimulator.debug = false;
-ParserATNSimulator.dfa_debug = false;
-ParserATNSimulator.retry_debug = false;
-ParserATNSimulator.STATE_ALT_SORT_COMPARATOR = (o1, o2) => {
- let diff = o1.state.nonStopStateNumber - o2.state.nonStopStateNumber;
- if (diff !== 0) {
- return diff;
- }
- diff = o1.alt - o2.alt;
- if (diff !== 0) {
- return diff;
- }
- return 0;
-};
-__decorate([
- Decorators_1.NotNull
-], ParserATNSimulator.prototype, "predictionMode", void 0);
-__decorate([
- Decorators_1.NotNull
-], ParserATNSimulator.prototype, "getPredictionMode", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "setPredictionMode", null);
-__decorate([
- Decorators_1.Override
-], ParserATNSimulator.prototype, "reset", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "adaptivePredict", null);
-__decorate([
- __param(0, Decorators_1.NotNull),
- __param(1, Decorators_1.NotNull),
- __param(2, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "getStartState", null);
-__decorate([
- __param(0, Decorators_1.NotNull),
- __param(1, Decorators_1.NotNull),
- __param(3, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "execDFA", null);
-__decorate([
- __param(0, Decorators_1.NotNull),
- __param(1, Decorators_1.NotNull),
- __param(3, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "execATN", null);
-__decorate([
- __param(0, Decorators_1.NotNull), __param(2, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "handleNoViableAlt", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "getExistingTargetState", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "computeTargetState", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "removeAllConfigsNotInRuleStopState", null);
-__decorate([
- Decorators_1.NotNull
-], ParserATNSimulator.prototype, "computeStartState", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "applyPrecedenceFilter", null);
-__decorate([
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "getReachableTarget", null);
-__decorate([
- __param(0, Decorators_1.NotNull),
- __param(1, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "getPredsForAmbigAlts", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "evalSemanticContext", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "evalSemanticContextImpl", null);
-__decorate([
- __param(1, Decorators_1.NotNull),
- __param(4, Decorators_1.Nullable)
-], ParserATNSimulator.prototype, "closure", null);
-__decorate([
- __param(0, Decorators_1.NotNull),
- __param(1, Decorators_1.NotNull),
- __param(2, Decorators_1.Nullable),
- __param(3, Decorators_1.NotNull),
- __param(6, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "closureImpl", null);
-__decorate([
- Decorators_1.NotNull
-], ParserATNSimulator.prototype, "getRuleName", null);
-__decorate([
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "getEpsilonTarget", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "actionTransition", null);
-__decorate([
- Decorators_1.Nullable,
- __param(0, Decorators_1.NotNull),
- __param(1, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "precedenceTransition", null);
-__decorate([
- Decorators_1.Nullable,
- __param(0, Decorators_1.NotNull),
- __param(1, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "predTransition", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.NotNull), __param(2, Decorators_1.Nullable)
-], ParserATNSimulator.prototype, "ruleTransition", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "isConflicted", null);
-__decorate([
- Decorators_1.NotNull
-], ParserATNSimulator.prototype, "getTokenName", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "dumpDeadEndConfigs", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull),
- __param(1, Decorators_1.NotNull),
- __param(2, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "noViableAlt", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "getUniqueAlt", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "configWithAltAtStopState", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull),
- __param(1, Decorators_1.NotNull),
- __param(4, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "addDFAEdge", null);
-__decorate([
- __param(0, Decorators_1.Nullable), __param(2, Decorators_1.Nullable)
-], ParserATNSimulator.prototype, "setDFAEdge", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "addDFAContextState", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "addDFAState", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "createDFAState", null);
-__decorate([
- __param(0, Decorators_1.NotNull), __param(2, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "reportAttemptingFullContext", null);
-__decorate([
- __param(0, Decorators_1.NotNull), __param(2, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "reportContextSensitivity", null);
-__decorate([
- __param(0, Decorators_1.NotNull),
- __param(5, Decorators_1.NotNull),
- __param(6, Decorators_1.NotNull)
-], ParserATNSimulator.prototype, "reportAmbiguity", null);
-ParserATNSimulator = __decorate([
- __param(0, Decorators_1.NotNull)
-], ParserATNSimulator);
-exports.ParserATNSimulator = ParserATNSimulator;
-//# sourceMappingURL=ParserATNSimulator.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ParserATNSimulator.js.map b/node_modules/antlr4ts/atn/ParserATNSimulator.js.map
deleted file mode 100644
index c129093..0000000
--- a/node_modules/antlr4ts/atn/ParserATNSimulator.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ParserATNSimulator.js","sourceRoot":"","sources":["../../../src/atn/ParserATNSimulator.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,4DAAyD;AACzD,yDAAsD;AACtD,2DAAwD;AACxD,2CAAwC;AACxC,yCAA2C;AAC3C,+BAA4B;AAC5B,2CAAwC;AACxC,iDAA8C;AAC9C,iDAA8C;AAG9C,qDAAkD;AAClD,2CAAwC;AAExC,iDAA8C;AAC9C,mDAAgD;AAEhD,8CAA2C;AAE3C,qDAAkD;AAClD,+CAA4C;AAC5C,4CAAyC;AACzC,8CAA4D;AAC5D,yDAAsD;AACtD,kEAA+D;AAC/D,+EAA4E;AAE5E,4DAAyD;AAGzD,2DAAwD;AACxD,qEAAkE;AAClE,qDAAkD;AAElD,mDAAgD;AAChD,qDAAkD;AAClD,uDAAoD;AACpD,mDAAgD;AAChD,qDAAkD;AAElD,oCAAiC;AAKjC,sDAAmD;AAEnD,iCAAiC;AAEjC,MAAM,eAAe,GAAG,MAAM,CAAC;AAC/B,MAAM,iBAAiB,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;AAE7C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkOG;AACH,IAAa,kBAAkB,GAA/B,wBAAgC,SAAQ,2BAAY;IAuDnD,YAAqB,GAAQ,EAAE,MAAc;QAC5C,KAAK,CAAC,GAAG,CAAC,CAAC;QAlDJ,mBAAc,GAAmB,+BAAc,CAAC,EAAE,CAAC;QAC3D,yBAAoB,GAAY,KAAK,CAAC;QACtC,6BAAwB,GAAY,IAAI,CAAC;QAEzC;;;;;;;;;;;;;;WAcG;QACH,8BAAyB,GAAY,KAAK,CAAC;QAC3C,4BAAuB,GAAY,IAAI,CAAC;QACxC,iBAAY,GAAY,IAAI,CAAC;QAC7B,wBAAmB,GAAY,IAAI,CAAC;QACpC,4BAAuB,GAAY,IAAI,CAAC;QACxC,sCAAiC,GAAY,KAAK,CAAC;QAInD;;;;;;;;WAQG;QACH,sBAAiB,GAAY,KAAK,CAAC;QAEnC;;;;;WAKG;QACO,0BAAqB,GAAY,IAAI,CAAC;QAM/C,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACvB,CAAC;IAGD,iBAAiB;QAChB,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC;IAC5B,CAAC;IAED,iBAAiB,CAAU,cAA8B;QACxD,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;IACtC,CAAC;IAGD,KAAK;IACL,CAAC;IAID,eAAe,CAAU,KAAkB,EAC1C,QAAgB,EAChB,YAA2C,EAC3C,UAAoB;QACpB,EAAE,CAAC,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC;YAC9B,UAAU,GAAG,KAAK,CAAC;QACpB,CAAC;QAED,IAAI,GAAG,GAAQ,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAChD,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC;QACpB,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,IAAI,CAAC,GAAG,CAAC,eAAe,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;YAC/D,IAAI,IAAI,GAAW,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC;gBACjC,IAAI,GAAG,GAAW,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;gBAClD,IAAI,GAAG,GAAuB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACzD,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC;oBACjB,MAAM,CAAC,GAAG,CAAC;gBACZ,CAAC;YACF,CAAC;QACF,CAAC;QAED,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QAEf,EAAE,CAAC,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC;YAC/B,UAAU,GAAG,IAAI,CAAC;QACnB,CAAC;QACD,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC,CAAC;YACzC,UAAU,GAAG,UAAU,IAAI,GAAG,CAAC,kBAAkB,CAAC;QACnD,CAAC;QAED,IAAI,CAAC,qBAAqB,GAAG,UAAU,IAAI,CAAC,IAAI,CAAC,cAAc,KAAK,+BAAc,CAAC,GAAG,IAAI,YAAY,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC;QAC3J,EAAE,CAAC,CAAC,YAAY,IAAI,IAAI,CAAC,CAAC,CAAC;YAC1B,YAAY,GAAG,qCAAiB,CAAC,YAAY,EAAE,CAAC;QACjD,CAAC;QAED,IAAI,KAAiC,CAAC;QACtC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;YAClB,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,KAAK,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;QAClE,CAAC;QAED,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC;YACnB,EAAE,CAAC,CAAC,YAAY,IAAI,IAAI,CAAC;gBAAC,YAAY,GAAG,qCAAiB,CAAC,YAAY,EAAE,CAAC;YAC1E,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC;gBAAC,OAAO,CAAC,GAAG,CAAC,eAAe,GAAG,GAAG,CAAC,QAAQ;oBACvE,eAAe,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;oBAC9C,iBAAiB,GAAG,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;YAE1D,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;QAC/D,CAAC;QAED,IAAI,CAAC,GAAW,KAAK,CAAC,IAAI,EAAE,CAAC;QAC7B,IAAI,KAAK,GAAW,KAAK,CAAC,KAAK,CAAC;QAChC,IAAI,CAAC;YACJ,IAAI,GAAG,GAAW,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACzD,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC;gBAAC,OAAO,CAAC,GAAG,CAAC,wBAAwB,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;YACpI,MAAM,CAAC,GAAG,CAAC;QACZ,CAAC;gBACO,CAAC;YACR,IAAI,CAAC,GAAG,GAAG,SAAS,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;IACF,CAAC;IAES,aAAa,CAAU,GAAQ,EAC/B,KAAkB,EAClB,YAA+B,EACxC,UAAmB;QAEnB,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;YACjB,EAAE,CAAC,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC;gBACzB,8DAA8D;gBAC9D,sDAAsD;gBACtD,IAAI,KAAK,GAAyB,GAAG,CAAC,uBAAuB,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;gBAC9F,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC;oBACnB,MAAM,CAAC,SAAS,CAAC;gBAClB,CAAC;gBAED,MAAM,CAAC,IAAI,+BAAc,CAAC,YAAY,EAAE,KAAK,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;YACrE,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC;oBACpB,MAAM,CAAC,SAAS,CAAC;gBAClB,CAAC;gBAED,MAAM,CAAC,IAAI,+BAAc,CAAC,YAAY,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;YACtE,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAED,IAAI,gBAAgB,GAAkC,YAAY,CAAC;QACnE,MAAM,CAAC,YAAY,IAAI,IAAI,CAAC,CAAC;QAC7B,IAAI,EAAwB,CAAC;QAC7B,EAAE,CAAC,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC;YACzB,EAAE,GAAG,GAAG,CAAC,uBAAuB,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,CAAC,CAAC;YACL,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC;QACjB,CAAC;QAED,OAAO,gBAAgB,IAAI,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,CAAC,kBAAkB,EAAE,CAAC;YACxE,gBAAgB,GAAG,IAAI,CAAC,aAAa,CAAC,gBAAgB,CAAC,CAAC;YACxD,EAAE,GAAG,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,cAAc,CAAC,gBAAgB,CAAC,CAAC,CAAC;YAChE,EAAE,CAAC,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC;gBAC9B,MAAM,CAAC,EAAE,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,kBAAkB,CAAC,CAAC;YAC9C,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,gBAAgB,GAAG,gBAAgB,CAAC,MAAM,CAAC;YAC5C,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAED,MAAM,CAAC,IAAI,+BAAc,CAAC,YAAY,EAAE,EAAE,EAAE,UAAU,EAAE,gBAAgB,CAAC,CAAC;IAC3E,CAAC;IAES,OAAO,CAAU,GAAQ,EACnB,KAAkB,EAAE,UAAkB,EACtC,KAAqB;QACpC,IAAI,YAAY,GAAsB,KAAK,CAAC,YAAY,CAAC;QACzD,EAAE,CAAC,CAAC,kBAAkB,CAAC,SAAS,CAAC;YAAC,OAAO,CAAC,GAAG,CAAC,eAAe,GAAG,GAAG,CAAC,QAAQ;gBAC3E,eAAe,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;gBAC9C,iBAAiB,GAAG,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1D,EAAE,CAAC,CAAC,kBAAkB,CAAC,SAAS,CAAC;YAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;QAC7G,IAAI,CAAC,GAAa,KAAK,CAAC,EAAE,CAAC;QAE3B,IAAI,CAAC,GAAW,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,qBAAqB,GAAkC,KAAK,CAAC,qBAAqB,CAAC;QAEvF,OAAO,IAAI,EAAE,CAAC;YACb,EAAE,CAAC,CAAC,kBAAkB,CAAC,SAAS,CAAC;gBAAC,OAAO,CAAC,GAAG,CAAC,YAAY,GAAG,CAAC,CAAC,WAAW,GAAG,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC;YACxH,EAAE,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;gBACtB,OAAO,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC7B,IAAI,IAA0B,CAAC;oBAC/B,EAAE,CAAC,CAAC,qBAAqB,IAAI,IAAI,CAAC,CAAC,CAAC;wBACnC,qBAAqB,GAAG,IAAI,CAAC,aAAa,CAAC,qBAAqB,CAAC,CAAC;wBAClE,IAAI,GAAG,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,cAAc,CAAC,qBAAqB,CAAC,CAAC,CAAC;oBACvE,CAAC;oBAED,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC;wBAClB,mBAAmB;wBACnB,IAAI,YAAY,GAAmB,IAAI,+BAAc,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,EAAE,KAAK,CAAC,UAAU,EAAE,qBAAqB,CAAC,CAAC;wBACtH,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;oBAC3D,CAAC;oBAED,MAAM,CAAC,qBAAqB,IAAI,IAAI,CAAC,CAAC;oBACtC,qBAAqB,GAAuB,qBAAsB,CAAC,MAAM,CAAC;oBAC1E,CAAC,GAAG,IAAI,CAAC;gBACV,CAAC;YACF,CAAC;YAED,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBAC7C,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC;oBAC1B,EAAE,CAAC,CAAC,kBAAkB,CAAC,SAAS,CAAC;wBAAC,OAAO,CAAC,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;gBAC9D,CAAC;gBACD,IAAI,CAAC,CAAC;oBACL,EAAE,CAAC,CAAC,kBAAkB,CAAC,SAAS,CAAC;wBAAC,OAAO,CAAC,GAAG,CAAC,kBAAkB,GAAG,CAAC,CAAC,UAAU,GAAG,YAAY,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;gBACjH,CAAC;gBAED,kEAAkE;gBAClE,4DAA4D;gBAC5D,0DAA0D;gBAC1D,8BAA8B;gBAC9B,KAAK,CAAC;YACP,CAAC;YAED,qDAAqD;YACrD,MAAM,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;YAEjD,iEAAiE;YACjE,IAAI,MAAM,GAAyB,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrE,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC;gBACpB,EAAE,CAAC,CAAC,kBAAkB,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,CAAC;oBAAC,OAAO,CAAC,GAAG,CAAC,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpH,IAAI,GAAW,CAAC;gBAChB,EAAE,CAAC,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC;oBAClC,IAAI,QAAQ,GAAa,mBAAQ,CAAC,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;oBACjF,OAAO,CAAC,GAAG,CAAC,gBAAgB;wBAC3B,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC;wBAC1C,gBAAgB,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;gBACpC,CAAC;gBAED,IAAI,YAAY,GAAmB,IAAI,+BAAc,CAAC,YAAY,EAAE,CAAC,EAAE,KAAK,CAAC,UAAU,EAAE,qBAAqB,CAAC,CAAC;gBAChH,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;gBACzD,EAAE,CAAC,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC;oBAClC,OAAO,CAAC,GAAG,CAAC,4BAA4B,GAAG,GAAG,GAAG,UAAU,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;oBAC7H,YAAY;gBACb,CAAC;gBACD,0BAA0B;gBAC1B,EAAE,CAAC,CAAC,kBAAkB,CAAC,SAAS,CAAC;oBAAC,OAAO,CAAC,GAAG,CAAC,eAAe,GAAG,GAAG,CAAC,QAAQ;wBAC3E,YAAY,GAAG,GAAG,CAAC,CAAC;gBACrB,MAAM,CAAC,GAAG,CAAC,CAAC,gEAAgE;YAC7E,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,KAAK,2BAAY,CAAC,KAAK,CAAC,CAAC,CAAC;gBACxC,IAAI,UAAU,GAAmB,IAAI,+BAAc,CAAC,YAAY,EAAE,CAAC,EAAE,KAAK,CAAC,UAAU,EAAE,qBAAqB,CAAC,CAAC;gBAC9G,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;YAC9D,CAAC;YACD,CAAC,GAAG,MAAM,CAAC;YACX,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,qBAAS,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrE,KAAK,CAAC,OAAO,EAAE,CAAC;gBAChB,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;QACF,CAAC;QACH,8BAA8B;QAC9B,iEAAiE;QACjE,eAAe;QACf,KAAK;QAEH,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC,OAAO,CAAC,YAAY,IAAI,IAAI,CAAC,CAAC,CAAC;YACzD,EAAE,CAAC,CAAC,GAAG,CAAC,aAAa,YAAY,6BAAa,CAAC,CAAC,CAAC;gBAChD,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,qBAAqB;oBAC9B,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,oBAAoB,IAAI,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC;oBAC9D,CAAC,IAAI,CAAC,iCAAiC,IAAI,KAAK,CAAC,KAAK,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC;oBACzE,sCAAsC;oBACtC,yDAAyD;oBACzD,kIAAkI;oBAClI,GAAG;gBACJ,CAAC;gBACD,IAAI,CAAC,CAAC;oBACL,MAAM,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;oBAE1B,uEAAuE;oBACvE,qEAAqE;oBACrE,qBAAqB;oBACrB,IAAI,eAAmC,CAAC;oBACxC,IAAI,UAAU,GAA0C,CAAC,CAAC,UAAU,CAAC;oBACrE,EAAE,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC;wBACxB,IAAI,aAAa,GAAW,KAAK,CAAC,KAAK,CAAC;wBACxC,EAAE,CAAC,CAAC,aAAa,KAAK,UAAU,CAAC,CAAC,CAAC;4BAClC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;wBACxB,CAAC;wBAED,eAAe,GAAG,IAAI,CAAC,mBAAmB,CAAC,UAAU,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;wBAC3E,EAAE,CAAC,CAAC,eAAe,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;4BACzC,MAAM,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;wBACtC,CAAC;wBAED,EAAE,CAAC,CAAC,aAAa,KAAK,UAAU,CAAC,CAAC,CAAC;4BAClC,sDAAsD;4BACtD,oDAAoD;4BACpD,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;wBAC3B,CAAC;oBACF,CAAC;oBAED,EAAE,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC;wBAC5B,IAAI,aAAa,GAAmB,IAAI,+BAAc,CAAC,YAAY,EAAE,CAAC,EAAE,KAAK,CAAC,UAAU,EAAE,qBAAqB,CAAC,CAAC;wBACjH,IAAI,CAAC,2BAA2B,CAAC,GAAG,EAAE,eAAe,EAAE,aAAa,EAAE,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;oBAChG,CAAC;oBAED,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBACvB,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,GAAG,CAAC,QAAQ,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;gBACtE,CAAC;YACF,CAAC;QACF,CAAC;QAED,0DAA0D;QAC1D,sDAAsD;QACtD,IAAI,UAAU,GAA0C,CAAC,CAAC,UAAU,CAAC;QACrE,EAAE,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC;YACxB,IAAI,SAAS,GAAW,KAAK,CAAC,KAAK,CAAC;YACpC,EAAE,CAAC,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC;gBAC9B,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACxB,CAAC;YAED,IAAI,IAAI,GAAW,IAAI,CAAC,mBAAmB,CAAC,UAAU,EAAE,YAAY,EAAE,IAAI,CAAC,iBAAiB,IAAI,IAAI,CAAC,cAAc,KAAK,+BAAc,CAAC,wBAAwB,CAAC,CAAC;YACjK,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;gBAC7B,KAAK,CAAC;oBACL,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,EAAE,CAAC,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;gBAEpE,KAAK,CAAC;oBACL,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBAE3B;oBACC,uEAAuE;oBACvE,iCAAiC;oBACjC,EAAE,CAAC,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC;wBAC9B,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACvB,CAAC;oBAED,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,CAAC,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,CAAC,OAAO,CAAC,eAAe,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;oBAChG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC3B,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,kBAAkB,CAAC,SAAS,CAAC;YAAC,OAAO,CAAC,GAAG,CAAC,eAAe,GAAG,GAAG,CAAC,QAAQ;gBAC3E,YAAY,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC;IACrB,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACO,aAAa,CAAC,KAAe,EAAE,UAAmB;QAC3D,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,IAAI,IAAI,CAAC,CAAC,CAAC;YAC3C,cAAc;YACd,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAED,0CAA0C;QAC1C,EAAE,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,cAAc,KAAK,+BAAc,CAAC,wBAAwB,CAAC,CAAC,CAAC;YACnF,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,CAAC;QACtC,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA0CG;IACO,OAAO,CAAU,GAAQ,EACnB,KAAkB,EAAE,UAAkB,EACtC,YAA4B;QAC3C,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC;YAAC,OAAO,CAAC,GAAG,CAAC,mBAAmB,GAAG,GAAG,CAAC,QAAQ,GAAG,eAAe,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC;QAE/H,IAAI,YAAY,GAAsB,YAAY,CAAC,YAAY,CAAC;QAChE,IAAI,UAAU,GAAY,YAAY,CAAC,UAAU,CAAC;QAElD,IAAI,CAAC,GAAW,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAE5B,IAAI,QAAQ,GAAmB,YAAY,CAAC;QAE5C,IAAI,YAAY,GAA2B,IAAI,+CAAsB,EAAE,CAAC;QACxE,OAAO,IAAI,EAAE,CAAC;YACb,IAAI,SAAS,GAA+B,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;YACjG,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC;gBACvB,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,2BAAY,CAAC,KAAK,CAAC,CAAC;gBAC9D,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;YAC5D,CAAC;YAED,IAAI,CAAC,GAAa,SAAS,CAAC,EAAE,CAAC;YAE/B,gCAAgC;YAChC,MAAM,CAAC,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,UAAU,KAAK,SAAG,CAAC,kBAAkB,CAAC,CAAC;YACnE,6BAA6B;YAC7B,MAAM,CAAC,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,OAAO,CAAC,YAAY,IAAI,IAAI,CAAC,CAAC;YAE1D,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;gBACvC,IAAI,eAAe,GAAuB,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC;gBACpE,IAAI,YAAY,GAAW,eAAe,IAAI,IAAI,GAAG,CAAC,CAAC,UAAU,GAAG,SAAG,CAAC,kBAAkB,CAAC;gBAC3F,EAAE,CAAC,CAAC,YAAY,KAAK,SAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC;oBAC7C,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY;2BACjB,KAAK,CAAC,KAAK,KAAK,UAAU;2BAC1B,CAAC,GAAG,CAAC,eAAe;2BACpB,SAAS,CAAC,YAAY,KAAK,SAAS,CAAC,qBAAqB;2BAC1D,GAAG,CAAC,QAAQ,IAAI,CAAC;2BACjB,CAAC,CAAC,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC,CAAC;wBACnC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC;4BACpC,IAAI,GAAG,GAAW,CAAC,CAAC,GAAG,CAAC,QAAQ,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;4BACnD,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;wBAC1C,CAAC;oBACF,CAAC;oBAED,EAAE,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,wBAAwB,CAAC,CAAC,CAAC;wBACjD,IAAI,CAAC,wBAAwB,CAAC,GAAG,EAAE,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;oBACtF,CAAC;gBACF,CAAC;gBAED,YAAY,GAAG,CAAC,CAAC,UAAU,CAAC;gBAChC,qEAAqE;gBACrE,sCAAsC;gBAClC,IAAI,kBAAkB,GAAY,eAAe,IAAI,IAAI,IAAI,IAAI,CAAC,qBAAqB,CAAC;gBACxF,EAAE,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC;oBACxB,4DAA4D;oBAC5D,qDAAqD;oBACrD,kBAAkB,GAAG,CAAC,UAAU;2BAC5B,CAAC,CAAC,CAAC,OAAO,CAAC,oBAAoB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC;2BAC9D,CAAC,CAAC,IAAI,CAAC,iCAAiC,IAAI,KAAK,CAAC,KAAK,KAAK,UAAU,CAAC,CAAC;gBAC7E,CAAC;gBAED,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC,CAAC;oBAClC,IAAI,eAAe,GAA0C,CAAC,CAAC,UAAU,CAAC;oBAC1E,EAAE,CAAC,CAAC,eAAe,IAAI,IAAI,CAAC,CAAC,CAAC;wBAC7B,IAAI,aAAa,GAAW,KAAK,CAAC,KAAK,CAAC;wBACxC,EAAE,CAAC,CAAC,aAAa,KAAK,UAAU,CAAC,CAAC,CAAC;4BAClC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;wBACxB,CAAC;wBAED,2FAA2F;wBAC3F,eAAe,GAAG,IAAI,CAAC,mBAAmB,CAAC,eAAe,EAAE,YAAY,EAAE,kBAAkB,IAAI,IAAI,CAAC,iBAAiB,CAAC,CAAC;wBACxH,MAAM,CAAC,CAAC,eAAe,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;4BACxC,KAAK,CAAC;gCACL,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,EAAE,CAAC,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;4BAEpE,KAAK,CAAC;gCACL,MAAM,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;4BAEtC;gCACC,KAAK,CAAC;wBACP,CAAC;wBAED,EAAE,CAAC,CAAC,aAAa,KAAK,UAAU,CAAC,CAAC,CAAC;4BAClC,sDAAsD;4BACtD,oDAAoD;4BACpD,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;wBAC3B,CAAC;oBACF,CAAC;gBACF,CAAC;gBAED,EAAE,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC;oBACzB,EAAE,CAAC,CAAC,eAAe,IAAI,IAAI,CAAC,CAAC,CAAC;wBAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,iBAAiB,IAAI,eAAe,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;4BACjE,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,CAAC,EAAE,UAAU,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,eAAe,EAAE,eAAe,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;wBAC9G,CAAC;wBAED,YAAY,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;oBAC9C,CAAC;oBAED,MAAM,CAAC,YAAY,CAAC;gBACrB,CAAC;gBACD,IAAI,CAAC,CAAC;oBACL,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;oBACpB,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;oBAErC,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC;wBAAC,OAAO,CAAC,GAAG,CAAC,0BAA0B,GAAG,YAAY,CAAC,CAAC;oBACrF,IAAI,gBAAgB,GAAmB,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;oBACvF,EAAE,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC;wBAC5B,IAAI,CAAC,2BAA2B,CAAC,GAAG,EAAE,eAAe,EAAE,SAAS,EAAE,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;oBAC5F,CAAC;oBAED,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBACvB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,UAAU,EAAE,gBAAgB,CAAC,CAAC;gBAC/D,CAAC;YACF,CAAC;YAED,QAAQ,GAAG,SAAS,CAAC;YAErB,EAAE,CAAC,CAAC,CAAC,KAAK,qBAAS,CAAC,GAAG,CAAC,CAAC,CAAC;gBACzB,KAAK,CAAC,OAAO,EAAE,CAAC;gBAChB,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;QACF,CAAC;IACF,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAyDG;IACO,iBAAiB,CAAU,KAAkB,EAAE,UAAkB,EAAW,QAAwB;QAC7G,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC;YACzB,IAAI,IAAI,GAAW,IAAI,eAAM,EAAE,CAAC;YAChC,IAAI,MAAM,GAAW,CAAC,CAAC;YACvB,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,kBAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACpD,EAAE,CAAC,CAAC,MAAM,CAAC,uBAAuB,IAAI,MAAM,CAAC,KAAK,YAAY,6BAAa,CAAC,CAAC,CAAC;oBAC7E,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;oBACrB,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;gBACvC,CAAC;YACF,CAAC;YAED,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;gBAC7B,KAAK,CAAC;oBACL,KAAK,CAAC;gBAEP,KAAK,CAAC;oBACL,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBAE3B;oBACC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC,CAAC;wBAC7C,2DAA2D;wBAC3D,0CAA0C;wBAC1C,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;oBAC3B,CAAC;oBAED;;;uBAGG;oBACH,IAAI,eAAe,GAAiB,IAAI,2BAAY,EAAE,CAAC;oBACvD,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,kBAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBACpD,EAAE,CAAC,CAAC,MAAM,CAAC,uBAAuB,IAAI,MAAM,CAAC,KAAK,YAAY,6BAAa,CAAC,CAAC,CAAC;4BAC7E,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;wBAC7B,CAAC;oBACF,CAAC;oBAED;;;;;;;uBAOG;oBACH,IAAI,SAAS,GAAkC,IAAI,CAAC,oBAAoB,CAAC,IAAI,EAAE,eAAe,EAAE,MAAM,CAAC,CAAC;oBACxG,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC;wBACvB,IAAI,UAAU,GAA0C,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;wBACtG,EAAE,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC;4BACxB,IAAI,SAAS,GAAW,KAAK,CAAC,KAAK,CAAC;4BACpC,IAAI,CAAC;gCACJ,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gCACvB,IAAI,YAAY,GAAW,IAAI,CAAC,mBAAmB,CAAC,UAAU,EAAE,QAAQ,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;gCAC9F,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC;oCAC3B,MAAM,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gCACnC,CAAC;4BACF,CAAC;oCACO,CAAC;gCACR,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;4BACvB,CAAC;wBACF,CAAC;oBACF,CAAC;oBAED,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC3B,CAAC;QACF,CAAC;QAED,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,YAAY,EAAE,QAAQ,CAAC,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IACvF,CAAC;IAES,eAAe,CAAC,GAAQ,EAAE,QAAwB,EAAE,CAAS,EAAE,YAAoC;QAC5G,IAAI,UAAU,GAAY,QAAQ,CAAC,UAAU,CAAC;QAC9C,IAAI,sBAAsB,GAAkC,QAAQ,CAAC,qBAAqB,CAAC;QAE3F,IAAI,CAAC,GAAa,QAAQ,CAAC,EAAE,CAAC;QAC9B,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7B,IAAI,IAA0B,CAAC;gBAC/B,EAAE,CAAC,CAAC,sBAAsB,IAAI,IAAI,CAAC,CAAC,CAAC;oBACpC,sBAAsB,GAAG,IAAI,CAAC,aAAa,CAAC,sBAAsB,CAAC,CAAC;oBACpE,IAAI,GAAG,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,cAAc,CAAC,sBAAsB,CAAC,CAAC,CAAC;gBACxE,CAAC;gBAED,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC;oBAClB,KAAK,CAAC;gBACP,CAAC;gBAED,MAAM,CAAC,sBAAsB,IAAI,IAAI,CAAC,CAAC;gBACvC,sBAAsB,GAAuB,sBAAuB,CAAC,MAAM,CAAC;gBAC5E,CAAC,GAAG,IAAI,CAAC;YACV,CAAC;QACF,CAAC;QAED,MAAM,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;QAC3C,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,+BAAc,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC,EAAE,UAAU,EAAE,sBAAsB,CAAC,CAAC;QACzF,CAAC;QAED,IAAI,EAAE,GAAa,CAAC,CAAC;QAErB,IAAI,MAAM,GAAyB,IAAI,CAAC,sBAAsB,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACtE,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC;YACpB,IAAI,MAAM,GAA8C,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,EAAE,EAAE,sBAAsB,EAAE,CAAC,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;YAC9I,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACnB,sBAAsB,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC;QAED,EAAE,CAAC,CAAC,MAAM,KAAK,2BAAY,CAAC,KAAK,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAED,MAAM,CAAC,CAAC,UAAU,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,oBAAoB,CAAC,CAAC;QAC5D,MAAM,CAAC,IAAI,+BAAc,CAAC,QAAQ,CAAC,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE,sBAAsB,CAAC,CAAC;IAC9F,CAAC;IAED;;;;;;;;;;OAUG;IACO,sBAAsB,CAAU,CAAW,EAAE,CAAS;QAC/D,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED;;;;;;;;;;;;;;OAcG;IAEO,kBAAkB,CAAU,GAAQ,EAAW,CAAW,EAAE,sBAAqD,EAAE,CAAS,EAAE,UAAmB,EAAE,YAAoC;QAChM,IAAI,cAAc,GAAgB,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;QACtD,IAAI,eAAwC,CAAC;QAC7C,IAAI,KAAK,GAAiB,IAAI,2BAAY,EAAE,CAAC;QAC7C,IAAI,cAAuB,CAAC;QAC5B,GAAG,CAAC;YACH,IAAI,cAAc,GAAY,CAAC,UAAU,IAAI,sBAAsB,IAAI,IAAI,CAAC;YAC5E,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;gBACrB,KAAK,CAAC,oBAAoB,GAAG,IAAI,CAAC;YACnC,CAAC;YAED,IAAI,iBAAiB,GAAiB,IAAI,2BAAY,EAAE,CAAC;YAEzD;;;;;;;;;eASG;YACH,IAAI,iBAA0C,CAAC;YAE/C,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,cAAc,CAAC,CAAC,CAAC;gBAC9B,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC;oBAAC,OAAO,CAAC,GAAG,CAAC,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;gBAErG,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,YAAY,6BAAa,CAAC,CAAC,CAAC;oBACtC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;oBAC1B,EAAE,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,CAAC,uBAAuB,IAAI,CAAC,KAAK,qBAAS,CAAC,GAAG,CAAC,CAAC,CAAC;wBACrE,EAAE,CAAC,CAAC,iBAAiB,IAAI,IAAI,CAAC,CAAC,CAAC;4BAC/B,iBAAiB,GAAG,EAAE,CAAC;wBACxB,CAAC;wBAED,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAC3B,CAAC;oBAED,QAAQ,CAAC;gBACV,CAAC;gBAED,IAAI,CAAC,GAAW,CAAC,CAAC,KAAK,CAAC,4BAA4B,CAAC;gBACrD,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;oBAC/B,IAAI,KAAK,GAAe,CAAC,CAAC,KAAK,CAAC,sBAAsB,CAAC,EAAE,CAAC,CAAC;oBAC3D,IAAI,MAAM,GAAyB,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;oBACxE,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC;wBACpB,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,YAAY,CAAC,CAAC;oBACjE,CAAC;gBACF,CAAC;YACF,CAAC;YAED;;;;;;;;eAQG;YACH,EAAE,CAAC,CAAC,IAAI,CAAC,uBAAuB,IAAI,iBAAiB,IAAI,IAAI,IAAI,CAAC,KAAK,aAAK,CAAC,GAAG,IAAI,iBAAiB,CAAC,SAAS,KAAK,SAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC;gBAC5I,iBAAiB,CAAC,oBAAoB,GAAG,KAAK,CAAC,oBAAoB,CAAC;gBACpE,KAAK,GAAG,iBAAiB,CAAC;gBAC1B,KAAK,CAAC;YACP,CAAC;YAED;;eAEG;YACH,IAAI,iBAAiB,GAAY,KAAK,CAAC;YACvC,IAAI,iBAAiB,GAAY,CAAC,KAAK,aAAK,CAAC,GAAG,CAAC;YACjD,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,KAAK,EAAE,iBAAiB,EAAE,cAAc,EAAE,YAAY,EAAE,iBAAiB,CAAC,CAAC;YAC3G,cAAc,GAAG,KAAK,CAAC,oBAAoB,CAAC;YAE5C,EAAE,CAAC,CAAC,CAAC,KAAK,qBAAS,CAAC,GAAG,CAAC,CAAC,CAAC;gBACzB;;;;;;;;;;;mBAWG;gBACH,KAAK,GAAG,IAAI,CAAC,kCAAkC,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;YACtE,CAAC;YAED;;;;;;;eAOG;YACH,EAAE,CAAC,CAAC,iBAAiB,IAAI,IAAI,IAAI,CAAC,CAAC,UAAU,IAAI,CAAC,+BAAc,CAAC,wBAAwB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBACnG,MAAM,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBACrC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC;oBACjC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;gBAC5B,CAAC;YACF,CAAC;YAED,EAAE,CAAC,CAAC,UAAU,IAAI,cAAc,CAAC,CAAC,CAAC;gBAClC,KAAK,CAAC,KAAK,EAAE,CAAC;gBAEd,uEAAuE;gBACvE,sBAAsB,GAAsB,sBAAsB,CAAC;gBAEnE,sBAAsB,GAAG,IAAI,CAAC,aAAa,CAAC,sBAAsB,CAAC,CAAC;gBACpE,IAAI,kBAAkB,GAAW,IAAI,CAAC,cAAc,CAAC,sBAAsB,CAAC,CAAC;gBAC7E,EAAE,CAAC,CAAC,eAAe,IAAI,IAAI,CAAC,CAAC,CAAC;oBAC7B,eAAe,GAAG,IAAI,yBAAW,EAAE,CAAC;gBACrC,CAAC;gBAED,EAAE,CAAC,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC,CAAC;oBACpC,sBAAsB,GAAG,SAAS,CAAC;gBACpC,CAAC;gBAAC,IAAI,CAAC,CAAC;oBACP,sBAAsB,GAAG,sBAAsB,CAAC,MAAM,CAAC;gBACxD,CAAC;gBAED,eAAe,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;gBACxC,EAAE,CAAC,CAAC,kBAAkB,KAAK,qCAAiB,CAAC,oBAAoB,CAAC,CAAC,CAAC;oBACnE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBAChD,cAAc,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,kBAAkB,EAAE,YAAY,CAAC,CAAC;oBACvF,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC,QAAQ,UAAU,IAAI,cAAc,EAAE;QAEvC,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YACnB,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,2BAAY,CAAC,KAAK,CAAC,CAAC;YAC1C,MAAM,CAAC,CAAC,2BAAY,CAAC,KAAK,EAAE,sBAAsB,CAAC,CAAC;QACrD,CAAC;QAED,IAAI,MAAM,GAAa,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,eAAe,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;QACxF,MAAM,CAAC,CAAC,MAAM,EAAE,sBAAsB,CAAC,CAAC;IACzC,CAAC;IAED;;;;;;;;;;;;OAYG;IAEO,kCAAkC,CAAU,OAAqB,EAAE,YAAoC;QAChH,EAAE,CAAC,CAAC,+BAAc,CAAC,0BAA0B,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACxD,MAAM,CAAC,OAAO,CAAC;QAChB,CAAC;QAED,IAAI,MAAM,GAAiB,IAAI,2BAAY,EAAE,CAAC;QAC9C,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,kBAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACxC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,YAAY,6BAAa,CAAC,CAAC,CAAC,CAAC;gBAC9C,QAAQ,CAAC;YACV,CAAC;YAED,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;QAClC,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAGS,iBAAiB,CAAC,GAAQ,EACnC,aAAgC,EAChC,UAAmB;QACnB,IAAI,EAAE,GACL,GAAG,CAAC,eAAe,GAAG,GAAG,CAAC,uBAAuB,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,UAAU,CAAC;YACrF,UAAU,GAAG,GAAG,CAAC,MAAM;gBACtB,GAAG,CAAC,EAAE,CAAC;QAEV,EAAE,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC;YAChB,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;gBACjB,MAAM,CAAC,IAAI,+BAAc,CAAC,aAAa,EAAE,EAAE,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;YACzE,CAAC;YAED,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClC,CAAC;QAED,IAAI,QAAQ,GAAW,GAAG,CAAC,QAAQ,CAAC;QACpC,WAAW;QACX,IAAI,CAAC,GAAa,GAAG,CAAC,aAAa,CAAC;QAEpC,IAAI,eAAe,GAAW,CAAC,CAAC;QAChC,IAAI,sBAAsB,GAAkC,aAAa,CAAC;QAC1E,IAAI,cAAc,GAAsB,UAAU,GAAG,qCAAiB,CAAC,UAAU,GAAG,qCAAiB,CAAC,WAAW,CAAC,CAAC,kDAAkD;QACrK,IAAI,YAAY,GAA2B,IAAI,+CAAsB,EAAE,CAAC;QACxE,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;YAChB,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC;gBACrC,OAAO,sBAAsB,IAAI,IAAI,EAAE,CAAC;oBACvC,EAAE,CAAC,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC,CAAC;wBACpC,eAAe,GAAG,qCAAiB,CAAC,oBAAoB,CAAC;wBACzD,sBAAsB,GAAG,SAAS,CAAC;oBACpC,CAAC;oBACD,IAAI,CAAC,CAAC;wBACL,eAAe,GAAG,IAAI,CAAC,cAAc,CAAC,sBAAsB,CAAC,CAAC;wBAC9D,cAAc,GAAG,cAAc,CAAC,mBAAmB,CAAC,eAAe,EAAE,YAAY,CAAC,CAAC;wBACnF,sBAAsB,GAAG,sBAAsB,CAAC,MAAM,CAAC;oBACxD,CAAC;gBACF,CAAC;YACF,CAAC;YAED,OAAO,EAAE,IAAI,IAAI,IAAI,EAAE,CAAC,kBAAkB,IAAI,sBAAsB,IAAI,IAAI,EAAE,CAAC;gBAC9E,IAAI,IAA0B,CAAC;gBAC/B,sBAAsB,GAAG,IAAI,CAAC,aAAa,CAAC,sBAAsB,CAAC,CAAC;gBACpE,EAAE,CAAC,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC,CAAC;oBACpC,IAAI,GAAG,EAAE,CAAC,gBAAgB,CAAC,qCAAiB,CAAC,oBAAoB,CAAC,CAAC;oBACnE,eAAe,GAAG,qCAAiB,CAAC,oBAAoB,CAAC;oBACzD,sBAAsB,GAAG,SAAS,CAAC;gBACpC,CAAC;gBACD,IAAI,CAAC,CAAC;oBACL,eAAe,GAAG,IAAI,CAAC,cAAc,CAAC,sBAAsB,CAAC,CAAC;oBAC9D,IAAI,GAAG,EAAE,CAAC,gBAAgB,CAAC,eAAe,CAAC,CAAC;oBAC5C,cAAc,GAAG,cAAc,CAAC,mBAAmB,CAAC,eAAe,EAAE,YAAY,CAAC,CAAC;oBACnF,sBAAsB,GAAG,sBAAsB,CAAC,MAAM,CAAC;gBACxD,CAAC;gBAED,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC;oBAClB,KAAK,CAAC;gBACP,CAAC;gBAED,EAAE,GAAG,IAAI,CAAC;YACX,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,EAAE,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,kBAAkB,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,IAAI,+BAAc,CAAC,aAAa,EAAE,EAAE,EAAE,UAAU,EAAE,sBAAsB,CAAC,CAAC;QAClF,CAAC;QAED,IAAI,OAAO,GAAiB,IAAI,2BAAY,EAAE,CAAC;QAC/C,OAAO,IAAI,EAAE,CAAC;YACb,IAAI,iBAAiB,GAAiB,IAAI,2BAAY,EAAE,CAAC;YACzD,IAAI,CAAC,GAAW,CAAC,CAAC,mBAAmB,CAAC;YACtC,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;gBAC/B,sBAAsB;gBACtB,IAAI,MAAM,GAAa,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;gBAC/C,iBAAiB,CAAC,GAAG,CAAC,qBAAS,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,GAAG,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC;YACzE,CAAC;YAED,IAAI,cAAc,GAAY,sBAAsB,IAAI,IAAI,CAAC;YAC7D,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;gBACrB,OAAO,CAAC,oBAAoB,GAAG,IAAI,CAAC;YACrC,CAAC;YAED,IAAI,iBAAiB,GAAY,IAAI,CAAC;YACtC,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,OAAO,EAAE,iBAAiB,EAAE,cAAc,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;YACjG,IAAI,cAAc,GAAY,OAAO,CAAC,oBAAoB,CAAC;YAE3D,IAAI,IAAc,CAAC;YACnB,EAAE,CAAC,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC;gBACnD,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC;gBAClD,KAAK,CAAC;YACP,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC;gBACrB,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC;oBAC1B,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC;oBACpD,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;wBAChB,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;4BACjB,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC;wBACnB,CAAC;wBAAC,IAAI,CAAC,CAAC;4BACP,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC;wBACnB,CAAC;oBACF,CAAC;oBAAC,IAAI,CAAC,CAAC;wBACP,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;4BACb,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC;wBACf,CAAC;wBAAC,IAAI,CAAC,CAAC;4BACP,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;wBACf,CAAC;oBACF,CAAC;gBACF,CAAC;gBACD,IAAI,CAAC,CAAC;oBACL;;;;;uBAKG;oBACH,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,aAAa,EAAE,YAAY,CAAC,CAAC;oBAC3E,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC;oBACpD,GAAG,CAAC,uBAAuB,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;gBACxE,CAAC;YACF,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,EAAE,CAAC,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC;oBACzB,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,aAAa,EAAE,YAAY,CAAC,CAAC;gBAC5E,CAAC;gBAED,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC;gBACpD,EAAE,CAAC,gBAAgB,CAAC,eAAe,EAAE,IAAI,CAAC,CAAC;YAC5C,CAAC;YAED,EAAE,GAAG,IAAI,CAAC;YAEV,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC;gBACpC,KAAK,CAAC;YACP,CAAC;YAED,sDAAsD;YACtD,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAEnC,uEAAuE;YACvE,sBAAsB,GAAsB,sBAAsB,CAAC;YAEnE,OAAO,CAAC,KAAK,EAAE,CAAC;YAChB,sBAAsB,GAAG,IAAI,CAAC,aAAa,CAAC,sBAAsB,CAAC,CAAC;YACpE,IAAI,kBAAkB,GAAW,IAAI,CAAC,cAAc,CAAC,sBAAsB,CAAC,CAAC;YAE7E,EAAE,CAAC,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC,CAAC;gBACpC,sBAAsB,GAAG,SAAS,CAAC;YACpC,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,sBAAsB,GAAG,sBAAsB,CAAC,MAAM,CAAC;YACxD,CAAC;YAED,EAAE,CAAC,CAAC,kBAAkB,KAAK,qCAAiB,CAAC,oBAAoB,CAAC,CAAC,CAAC;gBACnE,cAAc,GAAG,cAAc,CAAC,mBAAmB,CAAC,kBAAkB,EAAE,YAAY,CAAC,CAAC;YACvF,CAAC;YAED,eAAe,GAAG,kBAAkB,CAAC;QACtC,CAAC;QAED,MAAM,CAAC,IAAI,+BAAc,CAAC,aAAa,EAAE,EAAE,EAAE,UAAU,EAAE,sBAAsB,CAAC,CAAC;IAClF,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA2DG;IAEO,qBAAqB,CAAU,OAAqB,EAAE,aAAgC,EAAE,YAAoC;QACrI,IAAI,cAAc,GAAmC,IAAI,GAAG,EAA6B,CAAC;QAC1F,IAAI,SAAS,GAAiB,IAAI,2BAAY,EAAE,CAAC;QACjD,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,kBAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACxC,qBAAqB;YACrB,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtB,QAAQ,CAAC;YACV,CAAC;YAED,IAAI,cAAc,GAAgC,MAAM,CAAC,eAAe,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;YACrH,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI,CAAC,CAAC,CAAC;gBAC5B,mCAAmC;gBACnC,QAAQ,CAAC;YACV,CAAC;YAED,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;YAC7D,EAAE,CAAC,CAAC,cAAc,KAAK,MAAM,CAAC,eAAe,CAAC,CAAC,CAAC;gBAC/C,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,cAAc,CAAC,EAAE,YAAY,CAAC,CAAC;YACpF,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YACrC,CAAC;QACF,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,kBAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACxC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtB,kBAAkB;gBAClB,QAAQ,CAAC;YACV,CAAC;YAED,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,4BAA4B,CAAC,CAAC,CAAC;gBAC1C;;;mBAGG;gBACH,IAAI,OAAO,GAAkC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;gBAC1F,EAAE,CAAC,CAAC,OAAO,IAAI,IAAI,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBACvD,aAAa;oBACb,QAAQ,CAAC;gBACV,CAAC;YACF,CAAC;YAED,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;QACrC,CAAC;QAED,MAAM,CAAC,SAAS,CAAC;IAClB,CAAC;IAES,kBAAkB,CAAU,MAAiB,EAAW,KAAiB,EAAE,KAAa;QACjG,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACpD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;QACrB,CAAC;QAED,MAAM,CAAC,SAAS,CAAC;IAClB,CAAC;IAED,2CAA2C;IACjC,iBAAiB,CAAC,CAAW,EACtC,OAAqB,EACrB,KAAa;QACb,IAAI,eAAe,GAAuB,IAAI,CAAC,+BAA+B,CAAC,OAAO,CAAC,CAAC;QACxF,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,mHAAmH,CAAC,CAAA;QACrI,CAAC;QAED,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC;YAAC,OAAO,CAAC,GAAG,CAAC,oBAAoB,GAAG,CAAC,CAAC,CAAC;QACpE,IAAI,SAAS,GAAkC,IAAI,CAAC,oBAAoB,CAAC,eAAe,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QAC1G,gEAAgE;QAChE,IAAI,eAAsD,CAAC;QAC3D,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC;YACvB,0CAA0C;YAC1C,0DAA0D;YAC1D,eAAe,GAAG,IAAI,CAAC,uBAAuB,CAAC,eAAe,EAAE,SAAS,CAAC,CAAC;YAC3E,CAAC,CAAC,UAAU,GAAG,eAAe,CAAC;QAChC,CAAC;QACD,MAAM,CAAC,eAAe,CAAC;IACxB,CAAC;IAES,oBAAoB,CAAU,SAAiB,EAC/C,OAAqB,EAC9B,KAAa;QACb,iCAAiC;QAEjC;;;;;;;;;;WAUG;QACH,IAAI,SAAS,GAAgD,IAAI,KAAK,CAAkB,KAAK,GAAG,CAAC,CAAC,CAAC;QACnG,IAAI,CAAC,GAAW,SAAS,CAAC,MAAM,CAAC;QACjC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,kBAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC1B,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,iCAAe,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,eAAe,CAAC,CAAC;YAC5E,CAAC;QACF,CAAC;QAED,IAAI,SAAS,GAAW,CAAC,CAAC;QAC1B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;gBAC1B,SAAS,CAAC,CAAC,CAAC,GAAG,iCAAe,CAAC,IAAI,CAAC;YACrC,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,iCAAe,CAAC,IAAI,CAAC,CAAC,CAAC;gBAChD,SAAS,EAAE,CAAC;YACb,CAAC;QACF,CAAC;QAED,0EAA0E;QAC1E,IAAI,MAAM,GAAqD,SAAS,CAAC;QAEzE,wCAAwC;QACxC,EAAE,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC;YAAC,MAAM,GAAG,SAAS,CAAC;QACxC,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC;YAAC,OAAO,CAAC,GAAG,CAAC,8BAA8B,GAAG,CAAC,MAAM,GAAG,eAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;QAC7H,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAES,uBAAuB,CAAC,SAA6B,EAAE,SAA4B;QAC5F,IAAI,KAAK,GAA8B,EAAE,CAAC;QAC1C,IAAI,iBAAiB,GAAY,KAAK,CAAC;QACvC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,IAAI,GAAoB,SAAS,CAAC,CAAC,CAAC,CAAC;YAEzC,oDAAoD;YACpD,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC;YAErB,yDAAyD;YACzD,8DAA8D;YAC9D,2EAA2E;YAC3E,kDAAkD;YAClD,+CAA+C;YAC/C,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,KAAK,iCAAe,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC5E,KAAK,CAAC,IAAI,CAAC,IAAI,mBAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YAClD,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,iCAAe,CAAC,IAAI,CAAC,CAAC,CAAC;gBACxC,iBAAiB,GAAG,IAAI,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,IAAI,mBAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YAClD,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;YACxB,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAEH,8DAA8D;QAC5D,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED;;;OAGG;IACO,mBAAmB,CAAU,eAA0C,EAChF,YAA+B,EAC/B,QAAiB;QACjB,IAAI,WAAW,GAAW,IAAI,eAAM,EAAE,CAAC;QACvC,GAAG,CAAC,CAAC,IAAI,IAAI,IAAI,eAAe,CAAC,CAAC,CAAC;YAClC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,iCAAe,CAAC,IAAI,CAAC,CAAC,CAAC;gBACxC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC1B,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;oBACf,KAAK,CAAC;gBACP,CAAC;gBAED,QAAQ,CAAC;YACV,CAAC;YAED,IAAI,eAAe,GAAY,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/F,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,IAAI,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC;gBAC9D,OAAO,CAAC,GAAG,CAAC,YAAY,GAAG,IAAI,GAAG,GAAG,GAAG,eAAe,CAAC,CAAC;YAC1D,CAAC;YAED,EAAE,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC;gBACrB,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,IAAI,kBAAkB,CAAC,SAAS,CAAC;oBAAC,OAAO,CAAC,GAAG,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;gBACjG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC1B,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;oBACf,KAAK,CAAC;gBACP,CAAC;YACF,CAAC;QACF,CAAC;QAED,MAAM,CAAC,WAAW,CAAC;IACpB,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;OA0BG;IACO,uBAAuB,CAAU,IAAqB,EAAE,eAAkC,EAAE,GAAW;QAChH,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;IACjD,CAAC;IAED;;;;;YAKK;IAEK,OAAO,CAAC,aAA2B,EACnC,OAAqB,EAC9B,iBAA0B,EAC1B,cAAuB,EACb,YAAoC,EAC9C,iBAA0B;QAC1B,EAAE,CAAC,CAAC,YAAY,IAAI,IAAI,CAAC,CAAC,CAAC;YAC1B,YAAY,GAAG,+CAAsB,CAAC,QAAQ,CAAC;QAChD,CAAC;QAED,IAAI,cAAc,GAAiB,aAAa,CAAC;QACjD,IAAI,WAAW,GAA8B,IAAI,+BAAc,CAAY,mDAAwB,CAAC,QAAQ,CAAC,CAAC;QAC9G,OAAO,cAAc,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAChC,IAAI,YAAY,GAAiB,IAAI,2BAAY,EAAE,CAAC;YACpD,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,kBAAU,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;gBAC/C,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,iBAAiB,EAAE,cAAc,EAAE,YAAY,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;YACrI,CAAC;YAED,cAAc,GAAG,YAAY,CAAC;QAC/B,CAAC;IACF,CAAC;IAES,WAAW,CAAU,MAAiB,EACtC,OAAqB,EACpB,YAA0B,EAC3B,WAAsC,EAC/C,iBAA0B,EAC1B,eAAwB,EACf,YAAoC,EAC7C,KAAa,EACb,iBAA0B;QAC1B,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC;YAAC,OAAO,CAAC,GAAG,CAAC,UAAU,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;QAElG,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,YAAY,6BAAa,CAAC,CAAC,CAAC;YAC3C,mDAAmD;YACnD,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;gBAC7B,IAAI,QAAQ,GAAY,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC;gBAChD,IAAI,YAAY,GAAW,MAAM,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;oBACvC,IAAI,UAAU,GAAsB,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,qBAAqB;oBACtF,IAAI,WAAW,GAAa,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC9E,IAAI,CAAC,GAAc,qBAAS,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,GAAG,EAAE,UAAU,EAAE,MAAM,CAAC,eAAe,CAAC,CAAC;oBACjG,sDAAsD;oBACtD,sDAAsD;oBACtD,qDAAqD;oBACrD,CAAC,CAAC,iBAAiB,GAAG,MAAM,CAAC,iBAAiB,CAAC;oBAC/C,CAAC,CAAC,4BAA4B,GAAG,MAAM,CAAC,4BAA4B,CAAC;oBACrE,MAAM,CAAC,KAAK,GAAG,iBAAiB,CAAC,CAAC;oBAClC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,iBAAiB,EAAE,eAAe,EAAE,YAAY,EAAE,KAAK,GAAG,CAAC,EAAE,iBAAiB,CAAC,CAAC;gBACzI,CAAC;gBAED,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;oBACnC,MAAM,CAAC;gBACR,CAAC;gBAED,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,qCAAiB,CAAC,WAAW,CAAC,CAAC;YAC/E,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC;gBAC3B,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;gBAClC,MAAM,CAAC;YACR,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,uEAAuE;gBACvE,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC;oBAAC,OAAO,CAAC,GAAG,CAAC,mBAAmB;wBAC5D,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;gBAE3C,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,KAAK,qCAAiB,CAAC,UAAU,CAAC,CAAC,CAAC;oBACrD,yDAAyD;oBACzD,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,qCAAiB,CAAC,WAAW,CAAC,CAAC;gBAC/E,CAAC;gBACD,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,uBAAuB,IAAI,qCAAiB,CAAC,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBAC5F,+DAA+D;oBAC/D,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;gBACnC,CAAC;YACF,CAAC;QACF,CAAC;QAED,IAAI,CAAC,GAAa,MAAM,CAAC,KAAK,CAAC;QAC/B,eAAe;QACf,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,yBAAyB,CAAC,CAAC,CAAC;YAClC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YAClC,mEAAmE;YACnE,wDAAwD;YACxD,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC;gBAAC,OAAO,CAAC,GAAG,CAAC,eAAe,GAAG,OAAO,CAAC,CAAC;QACtE,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,4BAA4B,EAAE,CAAC,EAAE,EAAE,CAAC;YACzD,+DAA+D;YAC/D,oEAAoE;YACpE,yBAAyB;YACzB,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;mBACP,CAAC,CAAC,SAAS,6BAAiC;mBAC3C,CAAwB,CAAC,sBAAsB;mBAChD,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAE9B,IAAI,kBAAkB,GAAG,CAAuB,CAAC;gBAEjD,4DAA4D;gBAC5D,8DAA8D;gBAC9D,6DAA6D;gBAC7D,qCAAqC;gBACrC,IAAI,QAAQ,GAAY,IAAI,CAAC;gBAC7B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;oBACtD,EAAE,CAAC,CAAC,CAAC,kBAAkB,CAAC,wBAAwB,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxF,QAAQ,GAAG,KAAK,CAAC;wBACjB,KAAK,CAAC;oBACP,CAAC;gBACF,CAAC;gBAED,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;oBACd,QAAQ,CAAC;gBACV,CAAC;YACF,CAAC;YAED,IAAI,CAAC,GAAe,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;YAChD,IAAI,kBAAkB,GACrB,CAAC,CAAC,CAAC,YAAY,mCAAgB,CAAC,IAAI,iBAAiB,CAAC;YACvD,IAAI,CAAC,GAA0B,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,kBAAkB,EAAE,KAAK,KAAK,CAAC,EAAE,YAAY,EAAE,iBAAiB,CAAC,CAAC;YAClI,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;gBACf,EAAE,CAAC,CAAC,CAAC,YAAY,+BAAc,CAAC,CAAC,CAAC;oBACjC,EAAE,CAAC,CAAC,YAAY,IAAI,IAAI,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC;wBAChD,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;wBAClC,QAAQ,CAAC;oBACV,CAAC;gBACF,CAAC;gBAED,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACzC,6CAA6C;oBAC7C,QAAQ,CAAC;gBACV,CAAC;gBAED,IAAI,QAAQ,GAAW,KAAK,CAAC;gBAC7B,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,YAAY,6BAAa,CAAC,CAAC,CAAC;oBAC3C,oFAAoF;oBACpF,wEAAwE;oBACxE,kDAAkD;oBAClD,0DAA0D;oBAC1D,wBAAwB;oBAExB,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACzB,qDAAqD;wBACrD,QAAQ,CAAC;oBACV,CAAC;oBAED,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC;wBAClD,IAAI,yBAAyB,GAA+B,CAAE,CAAC,yBAAyB,CAAC;wBACzF,EAAE,CAAC,CAAC,yBAAyB,IAAI,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;4BACnE,CAAC,CAAC,4BAA4B,GAAG,IAAI,CAAC;wBACvC,CAAC;oBACF,CAAC;oBAED,CAAC,CAAC,iBAAiB,GAAG,CAAC,CAAC,iBAAiB,GAAG,CAAC,CAAC;oBAE9C,MAAM,CAAC,QAAQ,GAAG,iBAAiB,CAAC,CAAC;oBACrC,QAAQ,EAAE,CAAC;oBACX,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC;wBAAC,OAAO,CAAC,GAAG,CAAC,uBAAuB,GAAG,CAAC,CAAC,CAAC;gBACxE,CAAC;gBACD,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,+BAAc,CAAC,CAAC,CAAC;oBACtC,EAAE,CAAC,CAAC,IAAI,CAAC,mBAAmB,IAAqB,CAAE,CAAC,iBAAiB,IAAI,CAAC,CAAC,IAAI,CAAC,uBAAuB,IAAI,CAAC,qCAAiB,CAAC,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;wBAC7J,MAAM,CAAC,CAAC,CAAC,OAAO,KAAK,MAAM,CAAC,OAAO,CAAC,CAAC;wBACrC,EAAE,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC;4BACpB,mDAAmD;4BACnD,gDAAgD;4BAChD,QAAQ,EAAE,CAAC;4BACX,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,uBAAuB,IAAI,qCAAiB,CAAC,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gCACrF,2GAA2G;gCAC3G,CAAC,CAAC,iBAAiB,GAAG,CAAC,CAAC,iBAAiB,GAAG,CAAC,CAAC;4BAC/C,CAAC;wBACF,CAAC;oBACF,CAAC;oBACD,IAAI,CAAC,CAAC;wBACL,4FAA4F;wBAC5F,EAAE,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC;4BACnB,QAAQ,EAAE,CAAC;wBACZ,CAAC;oBACF,CAAC;gBACF,CAAC;gBAED,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,kBAAkB,EAAE,eAAe,EAAE,YAAY,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;YACzI,CAAC;QACF,CAAC;IACF,CAAC;IAGD,WAAW,CAAC,KAAa;QACxB,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,IAAI,KAAK,IAAI,CAAC,CAAC;YAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC7E,MAAM,CAAC,QAAQ,GAAG,KAAK,GAAG,GAAG,CAAC;IAC/B,CAAC;IAES,gBAAgB,CAAU,MAAiB,EAAW,CAAa,EAAE,iBAA0B,EAAE,SAAkB,EAAE,YAAoC,EAAE,iBAA0B;QAC9L,MAAM,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;YAC9B;gBACC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,EAAkB,CAAC,EAAE,YAAY,CAAC,CAAC;YAErE;gBACC,MAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,MAAM,EAAiC,CAAC,EAAE,iBAAiB,EAAE,SAAS,CAAC,CAAC;YAE1G;gBACC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,EAAuB,CAAC,EAAE,iBAAiB,EAAE,SAAS,CAAC,CAAC;YAE1F;gBACC,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAoB,CAAC,CAAC,CAAC;YAE3D;gBACC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAE1C,kBAAyB;YACzB,mBAA0B;YAC1B;gBACC,mEAAmE;gBACnE,0BAA0B;gBAC1B,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;oBACvB,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,aAAK,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;wBAChC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;oBAC1C,CAAC;gBACF,CAAC;gBAED,MAAM,CAAC,SAAS,CAAC;YAElB;gBACC,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;IACF,CAAC;IAGS,gBAAgB,CAAU,MAAiB,EAAW,CAAmB;QAClF,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC;YAAC,OAAO,CAAC,GAAG,CAAC,cAAc,GAAG,CAAC,CAAC,SAAS,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;QAC9F,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC1C,CAAC;IAGS,oBAAoB,CAAU,MAAiB,EAC/C,EAAiC,EAC1C,iBAA0B,EAC1B,SAAkB;QAClB,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC;YAC9B,OAAO,CAAC,GAAG,CAAC,0BAA0B,GAAG,iBAAiB,GAAG,IAAI;gBAChE,EAAE,CAAC,UAAU,GAAG,MAAM;gBACtB,sBAAsB,CAAC,CAAC;YACzB,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC;gBAC1B,OAAO,CAAC,GAAG,CAAC,8BAA8B;oBACzC,IAAI,CAAC,OAAO,CAAC,sBAAsB,EAAE,CAAC,CAAC;YACzC,CAAC;QACF,CAAC;QAED,IAAI,CAAY,CAAC;QACjB,EAAE,CAAC,CAAC,iBAAiB,IAAI,SAAS,CAAC,CAAC,CAAC;YACpC,IAAI,SAAS,GAAoB,iCAAe,CAAC,GAAG,CAAC,MAAM,CAAC,eAAe,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC;YAC3F,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QACnD,CAAC;QACD,IAAI,CAAC,CAAC;YACL,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACxC,CAAC;QAED,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC;YAAC,OAAO,CAAC,GAAG,CAAC,8BAA8B,GAAG,CAAC,CAAC,CAAC;QAC9E,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAGS,cAAc,CAAU,MAAiB,EACzC,EAAuB,EAChC,iBAA0B,EAC1B,SAAkB;QAClB,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC;YAC9B,OAAO,CAAC,GAAG,CAAC,0BAA0B,GAAG,iBAAiB,GAAG,IAAI;gBAChE,EAAE,CAAC,SAAS,GAAG,GAAG,GAAG,EAAE,CAAC,SAAS;gBACjC,kBAAkB,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;YACzC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC;gBAC1B,OAAO,CAAC,GAAG,CAAC,8BAA8B;oBACzC,IAAI,CAAC,OAAO,CAAC,sBAAsB,EAAE,CAAC,CAAC;YACzC,CAAC;QACF,CAAC;QAED,IAAI,CAAY,CAAC;QACjB,EAAE,CAAC,CAAC,iBAAiB;YACpB,CAAC,CAAC,EAAE,CAAC,cAAc,IAAI,CAAC,EAAE,CAAC,cAAc,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3D,IAAI,SAAS,GAAoB,iCAAe,CAAC,GAAG,CAAC,MAAM,CAAC,eAAe,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC;YAC3F,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QACnD,CAAC;QACD,IAAI,CAAC,CAAC;YACL,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACxC,CAAC;QAED,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC;YAAC,OAAO,CAAC,GAAG,CAAC,8BAA8B,GAAG,CAAC,CAAC,CAAC;QAC9E,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAGS,cAAc,CAAU,MAAiB,EAAW,CAAiB,EAAY,YAAoC;QAC9H,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC;YAC9B,OAAO,CAAC,GAAG,CAAC,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC;gBAC9D,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;QAC7B,CAAC;QAED,IAAI,WAAW,GAAa,CAAC,CAAC,WAAW,CAAC;QAC1C,IAAI,UAA6B,CAAC;QAElC,EAAE,CAAC,CAAC,IAAI,CAAC,mBAAmB,IAAI,CAAC,CAAC,iBAAiB,IAAI,CAAC,CAAC,IAAI,CAAC,uBAAuB,IAAI,CAAC,qCAAiB,CAAC,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3I,UAAU,GAAG,MAAM,CAAC,OAAO,CAAC;QAC7B,CAAC;QACD,IAAI,CAAC,EAAE,CAAC,CAAC,YAAY,IAAI,IAAI,CAAC,CAAC,CAAC;YAC/B,UAAU,GAAG,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,WAAW,CAAC,WAAW,CAAC,CAAC;QAC7E,CAAC;QACD,IAAI,CAAC,CAAC;YACL,UAAU,GAAG,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;QAC/D,CAAC;QAED,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;IACtD,CAAC;IAiBO,YAAY,CAAU,SAAuB,EAAE,YAAoC;QAC1F,EAAE,CAAC,CAAC,SAAS,CAAC,SAAS,KAAK,SAAG,CAAC,kBAAkB,IAAI,SAAS,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3E,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAED,IAAI,OAAO,GAAgB,SAAS,CAAC,OAAO,EAAE,CAAC;QAC/C,OAAO,CAAC,IAAI,CAAC,kBAAkB,CAAC,yBAAyB,CAAC,CAAC;QAE3D,IAAI,KAAK,GAAY,CAAC,SAAS,CAAC,oBAAoB,CAAC;QACrD,IAAI,IAAI,GAAW,IAAI,eAAM,EAAE,CAAC;QAChC,IAAI,MAAM,GAAW,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QACpC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEjB;;;;;;;WAOG;QAEH,sEAAsE;QACtE,kEAAkE;QAClE,YAAY;QACZ,IAAI,YAAY,GAAW,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,kBAAkB,CAAC;QAC/D,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC;YAC5B,IAAI,WAAW,GAAW,MAAM,CAAC,KAAK,CAAC,kBAAkB,CAAC;YAC1D,EAAE,CAAC,CAAC,WAAW,KAAK,YAAY,CAAC,CAAC,CAAC;gBAClC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC,CAAC;oBAC3B,MAAM,CAAC,SAAS,CAAC;gBAClB,CAAC;gBAED,YAAY,GAAG,WAAW,CAAC;YAC5B,CAAC;QACF,CAAC;QAED,IAAI,eAAuB,CAAC;QAC5B,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YACX,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,kBAAkB,CAAC;YAEnD,sDAAsD;YACtD,eAAe,GAAG,IAAI,eAAM,EAAE,CAAC;YAC/B,IAAI,MAAM,GAAW,MAAM,CAAC;YAC5B,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC;gBAC5B,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,kBAAkB,IAAI,YAAY,CAAC,CAAC,CAAC;oBACrD,KAAK,CAAC;gBACP,CAAC;gBAED,IAAI,GAAG,GAAW,MAAM,CAAC,GAAG,CAAC;gBAC7B,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACzB,MAAM,GAAG,GAAG,CAAC;YACd,CAAC;YAED,kBAAkB;YAClB,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,kBAAkB,CAAC;YACnD,IAAI,UAAU,GAAW,MAAM,CAAC;YAChC,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC;gBAC5B,IAAI,WAAW,GAAW,MAAM,CAAC,KAAK,CAAC,kBAAkB,CAAC;gBAC1D,IAAI,GAAG,GAAW,MAAM,CAAC,GAAG,CAAC;gBAC7B,EAAE,CAAC,CAAC,WAAW,KAAK,YAAY,CAAC,CAAC,CAAC;oBAClC,EAAE,CAAC,CAAC,UAAU,KAAK,MAAM,CAAC,CAAC,CAAC;wBAC3B,KAAK,GAAG,KAAK,CAAC;wBACd,KAAK,CAAC;oBACP,CAAC;oBAED,YAAY,GAAG,WAAW,CAAC;oBAC3B,UAAU,GAAG,MAAM,CAAC;gBACrB,CAAC;gBACD,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,UAAU,CAAC,CAAC,CAAC;oBAC7B,EAAE,CAAC,CAAC,GAAG,KAAK,eAAe,CAAC,UAAU,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxD,KAAK,GAAG,KAAK,CAAC;wBACd,KAAK,CAAC;oBACP,CAAC;oBAED,UAAU,GAAG,GAAG,CAAC;gBAClB,CAAC;YACF,CAAC;QACF,CAAC;QAED,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,kBAAkB,CAAC;QACnD,IAAI,sBAAsB,GAAW,CAAC,CAAC;QACvC,IAAI,2BAA2B,GAAW,CAAC,CAAC;QAC5C,IAAI,kBAAkB,GAAsB,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;QAC/D,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,MAAM,GAAc,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC,CAAC;gBAC3B,KAAK,CAAC;YACP,CAAC;YAED,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,kBAAkB,KAAK,YAAY,CAAC,CAAC,CAAC;gBACtD,KAAK,CAAC;YACP,CAAC;YAED,2BAA2B,GAAG,CAAC,CAAC;YAChC,kBAAkB,GAAG,YAAY,CAAC,IAAI,CAAC,kBAAkB,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAChF,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,2BAA2B,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvE,IAAI,MAAM,GAAc,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,KAAK,GAAa,MAAM,CAAC,KAAK,CAAC;YACnC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACrB,EAAE,CAAC,CAAC,KAAK,CAAC,kBAAkB,KAAK,YAAY,CAAC,CAAC,CAAC;gBAC/C,YAAY,GAAG,KAAK,CAAC,kBAAkB,CAAC;gBACxC,sBAAsB,GAAG,CAAC,CAAC;gBAC3B,2BAA2B,GAAG,CAAC,CAAC;gBAChC,kBAAkB,GAAG,MAAM,CAAC,OAAO,CAAC;gBACpC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,sBAAsB,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAClE,IAAI,OAAO,GAAc,OAAO,CAAC,CAAC,CAAC,CAAC;oBACpC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC,CAAC;wBAC5B,KAAK,CAAC;oBACP,CAAC;oBAED,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,kBAAkB,KAAK,YAAY,CAAC,CAAC,CAAC;wBACvD,KAAK,CAAC;oBACP,CAAC;oBAED,2BAA2B,GAAG,CAAC,CAAC;oBAChC,kBAAkB,GAAG,YAAY,CAAC,IAAI,CAAC,kBAAkB,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;gBAC7E,CAAC;gBAED,CAAC,GAAG,2BAA2B,CAAC;gBAChC,QAAQ,CAAC;YACV,CAAC;YAED,IAAI,mBAAmB,GAAsB,MAAM,CAAC,OAAO,CAAC;YAC5D,IAAI,UAAU,GAAW,MAAM,CAAC,GAAG,CAAC;YACpC,IAAI,+BAA+B,GAAW,CAAC,CAAC;YAChD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,+BAA+B,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3E,IAAI,OAAO,GAAc,OAAO,CAAC,CAAC,CAAC,CAAC;gBACpC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,KAAK,UAAU,CAAC,CAAC,CAAC;oBAChC,KAAK,CAAC;gBACP,CAAC;gBAED,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,kBAAkB,KAAK,YAAY,CAAC,CAAC,CAAC;oBACvD,KAAK,CAAC;gBACP,CAAC;gBAED,+BAA+B,GAAG,CAAC,CAAC;gBACpC,mBAAmB,GAAG,YAAY,CAAC,IAAI,CAAC,mBAAmB,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;YAC/E,CAAC;YAED,CAAC,GAAG,+BAA+B,CAAC;YAEpC,IAAI,KAAK,GAAsB,YAAY,CAAC,IAAI,CAAC,kBAAkB,EAAE,mBAAmB,CAAC,CAAC;YAC1F,EAAE,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACvC,MAAM,CAAC,SAAS,CAAC;YAClB,CAAC;YAED,4BAA4B;YAC5B,KAAK,GAAG,KAAK,IAAI,kBAAkB,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;QACjE,CAAC;QAED,MAAM,CAAC,IAAI,2BAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IAES,+BAA+B,CAAC,OAAqB;QAC9D,IAAI,eAAe,GAAuB,OAAO,CAAC,eAAe,CAAC;QAClE,EAAE,CAAC,CAAC,eAAe,IAAI,IAAI,IAAI,OAAO,CAAC,SAAS,KAAK,SAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC;YAC7E,eAAe,GAAG,IAAI,eAAM,EAAE,CAAC;YAC/B,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACxC,CAAC;QAED,MAAM,CAAC,eAAe,CAAC;IACxB,CAAC;IAGD,YAAY,CAAC,CAAS;QACrB,EAAE,CAAC,CAAC,CAAC,KAAK,aAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YACrB,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,IAAI,UAAU,GAAe,IAAI,CAAC,OAAO,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,GAAG,+BAAc,CAAC,gBAAgB,CAAC;QAC9G,IAAI,WAAW,GAAW,UAAU,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QACvD,EAAE,CAAC,CAAC,WAAW,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,WAAW,CAAC;QACpB,CAAC;QAED,MAAM,CAAC,WAAW,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;IACpC,CAAC;IAED,gBAAgB,CAAC,KAAkB;QAClC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,kBAAkB,CAAU,IAA0B;QACrD,OAAO,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC;QAClC,IAAI,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC;QACzC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;YACrB,MAAM,CAAC;QACR,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,kBAAU,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAI,KAAK,GAAW,UAAU,CAAC;YAC/B,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,4BAA4B,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC9C,IAAI,CAAC,GAAe,CAAC,CAAC,KAAK,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;gBACtD,EAAE,CAAC,CAAC,CAAC,YAAY,+BAAc,CAAC,CAAC,CAAC;oBACjC,KAAK,GAAG,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAC/C,CAAC;gBACD,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,6BAAa,CAAC,CAAC,CAAC;oBACrC,IAAI,GAAG,GAAY,CAAC,YAAY,mCAAgB,CAAC;oBACjD,KAAK,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;gBACtD,CAAC;YACF,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,GAAG,GAAG,KAAK,CAAC,CAAC;QAC3D,CAAC;IACF,CAAC;IAGS,WAAW,CAAU,KAAkB,EACvC,YAA+B,EAC/B,OAAqB,EAC9B,UAAkB;QAClB,MAAM,CAAC,IAAI,2CAAoB,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,EAClD,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,EACrB,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,EACX,OAAO,EAAE,YAAY,CAAC,CAAC;IACzB,CAAC;IAES,YAAY,CAAU,OAA8B;QAC7D,IAAI,GAAG,GAAW,SAAG,CAAC,kBAAkB,CAAC;QACzC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,kBAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,EAAE,CAAC,CAAC,GAAG,KAAK,SAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC;gBACpC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,kBAAkB;YAChC,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;gBACxB,MAAM,CAAC,SAAG,CAAC,kBAAkB,CAAC;YAC/B,CAAC;QACF,CAAC;QACD,MAAM,CAAC,GAAG,CAAC;IACZ,CAAC;IAES,wBAAwB,CAAU,OAA8B,EAAE,GAAW;QACtF,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,kBAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;gBACnB,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,YAAY,6BAAa,CAAC,CAAC,CAAC;oBACtC,MAAM,CAAC,IAAI,CAAC;gBACb,CAAC;YACF,CAAC;QACF,CAAC;QACD,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAGS,UAAU,CAAU,GAAQ,EAC5B,SAAmB,EAC5B,CAAS,EACT,kBAA2C,EAClC,SAAuB,EAChC,YAAoC;QACpC,MAAM,CAAC,kBAAkB,IAAI,IAAI,IAAI,kBAAkB,CAAC,OAAO,IAAI,GAAG,CAAC,kBAAkB,CAAC,CAAC;QAE3F,IAAI,IAAI,GAAa,SAAS,CAAC;QAC/B,IAAI,EAAE,GAAa,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;QAElE,EAAE,CAAC,CAAC,kBAAkB,IAAI,IAAI,CAAC,CAAC,CAAC;YAChC,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,kBAAkB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;gBAClD,EAAE,CAAC,CAAC,OAAO,KAAK,qCAAiB,CAAC,oBAAoB,CAAC,CAAC,CAAC;oBACxD,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,oBAAoB,CAAC,CAAC,CAAC;wBACvC,QAAQ,CAAC;oBACV,CAAC;gBACF,CAAC;gBAED,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACnC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,IAAI,GAAyB,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;gBAChE,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC;oBAClB,IAAI,GAAG,IAAI,CAAC;oBACZ,QAAQ,CAAC;gBACV,CAAC;gBAED,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC;gBACzE,MAAM,CAAC,OAAO,KAAK,qCAAiB,CAAC,oBAAoB,IAAI,IAAI,CAAC,OAAO,CAAC,oBAAoB,CAAC,CAAC;gBAChG,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;gBACrC,IAAI,GAAG,IAAI,CAAC;YACb,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC;YAAC,OAAO,CAAC,GAAG,CAAC,OAAO,GAAG,IAAI,GAAG,MAAM,GAAG,EAAE,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1G,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC7B,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC;YAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,GAAG,+BAAc,CAAC,gBAAgB,EAAE,IAAI,CAAC,OAAO,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC;QAChN,MAAM,CAAC,EAAE,CAAC;IACX,CAAC;IAES,UAAU,CAAW,CAAW,EAAE,CAAS,EAAY,CAAW;QAC3E,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YACf,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnB,CAAC;IACF,CAAC;IAED,mDAAmD;IAEzC,kBAAkB,CAAU,GAAQ,EAAW,OAAqB,EAAE,aAAqB,EAAE,YAAoC;QAC1I,EAAE,CAAC,CAAC,aAAa,KAAK,qCAAiB,CAAC,oBAAoB,CAAC,CAAC,CAAC;YAC9D,IAAI,cAAc,GAAiB,IAAI,2BAAY,EAAE,CAAC;YACtD,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,kBAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACxC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,aAAa,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC,CAAC;YACvE,CAAC;YAED,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,cAAc,EAAE,YAAY,CAAC,CAAC;QAC5D,CAAC;QACD,IAAI,CAAC,CAAC;YACL,MAAM,CAAC,CAAC,OAAO,CAAC,oBAAoB,EAAE,uCAAuC,CAAC,CAAC;YAC/E,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC9B,OAAO,CAAC,oBAAoB,GAAG,IAAI,CAAC;YACpC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC;QACrD,CAAC;IACF,CAAC;IAED,mDAAmD;IAEzC,WAAW,CAAU,GAAQ,EAAW,OAAqB,EAAE,YAAoC;QAC5G,IAAI,SAAS,GAAY,IAAI,CAAC,yBAAyB,IAAI,CAAC,OAAO,CAAC,oBAAoB,CAAC;QACzF,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YACf,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC;gBACzB,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;YAC/B,CAAC;YAED,IAAI,QAAQ,GAAa,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;YAC3D,IAAI,QAAQ,GAAyB,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC9D,EAAE,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC;gBAAC,MAAM,CAAC,QAAQ,CAAC;QACvC,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC;YACzB,EAAE,CAAC,CAAC,OAAO,CAAC,YAAY,IAAI,IAAI,CAAC,CAAC,CAAC;gBAClC,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;YACjE,CAAC;QACF,CAAC;QAED,IAAI,QAAQ,GAAa,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QACvE,iFAAiF;QACjF,IAAI,aAAa,GAAiC,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC1F,IAAI,YAAY,GAAW,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QACtD,EAAE,CAAC,CAAC,YAAY,KAAK,SAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC;YAC7C,QAAQ,CAAC,eAAe,GAAG,IAAI,iCAAe,CAAC,YAAY,CAAC,CAAC;QAC9D,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,eAAe,IAAI,IAAI,CAAC,CAAC,CAAC;YAC5C,IAAI,eAAe,GAAG,OAAO,CAAC,eAAe,CAAC;YAC9C,EAAE,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC;gBACrB,QAAQ,CAAC,eAAe,GAAG,IAAI,iCAAe,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/E,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,QAAQ,CAAC,aAAa,IAAI,OAAO,CAAC,kBAAkB,CAAC,CAAC,CAAC;YAC1D,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,OAAO,EAAE,aAAa,CAAC,mBAAmB,CAAC,CAAC;QAC9E,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,QAAQ,CAAC;QACjB,CAAC;QAED,IAAI,KAAK,GAAa,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC7C,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,IAAI,KAAK,KAAK,QAAQ,CAAC;YAAC,OAAO,CAAC,GAAG,CAAC,wBAAwB,GAAG,QAAQ,CAAC,CAAC;QACrG,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAGS,cAAc,CAAU,GAAQ,EAAW,OAAqB;QACzE,MAAM,CAAC,IAAI,mBAAQ,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC;IAES,2BAA2B,CAAU,GAAQ,EAAE,eAAmC,EAAW,aAA6B,EAAE,UAAkB,EAAE,SAAiB;QAC1K,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,IAAI,kBAAkB,CAAC,WAAW,CAAC,CAAC,CAAC;YAChE,IAAI,QAAQ,GAAa,mBAAQ,CAAC,EAAE,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;YAC5D,OAAO,CAAC,GAAG,CAAC,uCAAuC,GAAG,GAAG,CAAC,QAAQ,GAAG,GAAG,GAAG,aAAa,CAAC,EAAE,CAAC,OAAO;gBAClG,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC3D,CAAC;QACD,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC;YAC1B,IAAI,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,wBAAwB,EAAE,CAAC;YACvD,EAAE,CAAC,CAAC,QAAQ,CAAC,2BAA2B,CAAC,CAAC,CAAC;gBAC1C,QAAQ,CAAC,2BAA2B,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,UAAU,EAAE,SAAS,EAAE,eAAe,EAAE,aAAa,CAAC,CAAC;YAChH,CAAC;QACF,CAAC;IACF,CAAC;IAES,wBAAwB,CAAU,GAAQ,EAAE,UAAkB,EAAW,WAA2B,EAAE,UAAkB,EAAE,SAAiB;QACpJ,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,IAAI,kBAAkB,CAAC,WAAW,CAAC,CAAC,CAAC;YAChE,IAAI,QAAQ,GAAa,mBAAQ,CAAC,EAAE,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;YAC5D,OAAO,CAAC,GAAG,CAAC,oCAAoC,GAAG,GAAG,CAAC,QAAQ,GAAG,GAAG,GAAG,WAAW,CAAC,EAAE,CAAC,OAAO;gBAC7F,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC3D,CAAC;QACD,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC;YAC1B,IAAI,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,wBAAwB,EAAE,CAAC;YACvD,EAAE,CAAC,CAAC,QAAQ,CAAC,wBAAwB,CAAC,CAAC,CAAC;gBACvC,QAAQ,CAAC,wBAAwB,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC;YACtG,CAAC;QACF,CAAC;IACF,CAAC;IAED,wEAAwE;IAC9D,eAAe,CAAU,GAAQ,EAC1C,CAAW,EAAG,4DAA4D;QAC1E,UAAkB,EAClB,SAAiB,EACjB,KAAc,EACL,SAAiB,EACjB,OAAqB;QAE9B,EAAE,CAAC,CAAC,kBAAkB,CAAC,KAAK,IAAI,kBAAkB,CAAC,WAAW,CAAC,CAAC,CAAC;YAChE,IAAI,QAAQ,GAAa,mBAAQ,CAAC,EAAE,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;YAC5D,OAAO,CAAC,GAAG,CAAC,kBAAkB;gBAC7B,SAAS,GAAG,GAAG,GAAG,OAAO;gBACzB,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC3D,CAAC;QACD,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC;YAC1B,IAAI,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,wBAAwB,EAAE,CAAC;YACvD,EAAE,CAAC,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC,CAAC;gBAC9B,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,UAAU,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;YAC/F,CAAC;QACF,CAAC;IACF,CAAC;IAES,cAAc,CAAC,OAAoB;QAC5C,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;YACrB,MAAM,CAAC,qCAAiB,CAAC,oBAAoB,CAAC;QAC/C,CAAC;QAED,IAAI,KAAK,GAAa,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;QAC7D,IAAI,UAAU,GAAmC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACrE,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,WAAW,CAAC;IAC3C,CAAC;IAES,aAAa,CAAC,OAA0B;QACjD,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,OAAO,CAAC;QAChB,CAAC;QAED,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;YACzB,IAAI,KAAK,GAAa,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;YAC7D,MAAM,CAAC,KAAK,CAAC,mBAAmB,KAAK,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,iBAAiB,iBAAwB,CAAC,CAAC;YACzG,IAAI,UAAU,GAAmC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAC1B,KAAK,CAAC;YACP,CAAC;YAED,uGAAuG;YACvG,kFAAkF;YAClF,OAAO,GAAsB,OAAO,CAAC,MAAM,CAAC;QAC7C,CAAC;QAED,MAAM,CAAC,OAAO,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,IAAI,MAAM;QACT,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;IACrB,CAAC;CACD,CAAA;AAznEO,wBAAK,GAAY,KAAK,CAAC;AACvB,4BAAS,GAAY,KAAK,CAAC;AAC3B,8BAAW,GAAY,KAAK,CAAC;AAwqDrB,4CAAyB,GACvC,CAAC,EAAa,EAAE,EAAa;IAC5B,IAAI,IAAI,GAAW,EAAE,CAAC,KAAK,CAAC,kBAAkB,GAAG,EAAE,CAAC,KAAK,CAAC,kBAAkB,CAAC;IAC7E,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;QAChB,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAED,IAAI,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC;IACvB,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;QAChB,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAED,MAAM,CAAC,CAAC,CAAC;AACV,CAAC,CAAC;AAlrDH;IADC,oBAAO;0DACmD;AAuD3D;IADC,oBAAO;2DAGP;AAED;IAAmB,WAAA,oBAAO,CAAA;2DAEzB;AAGD;IADC,qBAAQ;+CAER;AAID;IAAiB,WAAA,oBAAO,CAAA;yDA6DvB;AAED;IAAyB,WAAA,oBAAO,CAAA;IAC9B,WAAA,oBAAO,CAAA;IACP,WAAA,oBAAO,CAAA;uDAqDR;AAED;IAAmB,WAAA,oBAAO,CAAA;IAClB,WAAA,oBAAO,CAAA;IACP,WAAA,oBAAO,CAAA;iDAwKd;AAsFD;IAAmB,WAAA,oBAAO,CAAA;IAClB,WAAA,oBAAO,CAAA;IACP,WAAA,oBAAO,CAAA;iDAwHd;AA4DD;IAA6B,WAAA,oBAAO,CAAA,EAA0C,WAAA,oBAAO,CAAA;2DAmEpF;AA0DD;IAAkC,WAAA,oBAAO,CAAA;gEAExC;AAkBD;IADC,oBAAO;IACsB,WAAA,oBAAO,CAAA,EAAY,WAAA,oBAAO,CAAA;4DA2IvD;AAgBD;IADC,oBAAO;IACsC,WAAA,oBAAO,CAAA;4EAepD;AAGD;IADC,oBAAO;2DA+JP;AA+DD;IADC,oBAAO;IACyB,WAAA,oBAAO,CAAA;+DA8CvC;AAED;IAA8B,WAAA,oBAAO,CAAA,EAAqB,WAAA,oBAAO,CAAA;4DAMhE;AAwBD;IAAgC,WAAA,oBAAO,CAAA;IACrC,WAAA,oBAAO,CAAA;8DAwCR;AAqCD;IAA+B,WAAA,oBAAO,CAAA;6DA6BrC;AA6BD;IAAmC,WAAA,oBAAO,CAAA;iEAEzC;AASD;IACE,WAAA,oBAAO,CAAA;IAGP,WAAA,qBAAQ,CAAA;iDAgBT;AAED;IAAuB,WAAA,oBAAO,CAAA;IAC5B,WAAA,oBAAO,CAAA;IACP,WAAA,qBAAQ,CAAA;IACR,WAAA,oBAAO,CAAA;IAGP,WAAA,oBAAO,CAAA;qDAyJR;AAGD;IADC,oBAAO;qDAIP;AAED;IAA4B,WAAA,oBAAO,CAAA,EAAqB,WAAA,oBAAO,CAAA;0DAiC9D;AAGD;IADC,oBAAO;IACoB,WAAA,oBAAO,CAAA,EAAqB,WAAA,oBAAO,CAAA;0DAG9D;AAGD;IADC,qBAAQ;IACuB,WAAA,oBAAO,CAAA;IACrC,WAAA,oBAAO,CAAA;8DAwBR;AAGD;IADC,qBAAQ;IACiB,WAAA,oBAAO,CAAA;IAC/B,WAAA,oBAAO,CAAA;wDAyBR;AAGD;IADC,oBAAO;IACkB,WAAA,oBAAO,CAAA,EAAqB,WAAA,oBAAO,CAAA,EAAqB,WAAA,qBAAQ,CAAA;wDAoBzF;AAiBD;IAAsB,WAAA,oBAAO,CAAA;sDA0J5B;AAaD;IADC,oBAAO;sDAaP;AAMD;IAAoB,WAAA,oBAAO,CAAA;4DAqB1B;AAGD;IADC,oBAAO;IACe,WAAA,oBAAO,CAAA;IAC5B,WAAA,oBAAO,CAAA;IACP,WAAA,oBAAO,CAAA;qDAMR;AAED;IAAwB,WAAA,oBAAO,CAAA;sDAW9B;AAED;IAAoC,WAAA,oBAAO,CAAA;kEAS1C;AAGD;IADC,oBAAO;IACc,WAAA,oBAAO,CAAA;IAC3B,WAAA,oBAAO,CAAA;IAGP,WAAA,oBAAO,CAAA;oDAkCR;AAED;IAAsB,WAAA,qBAAQ,CAAA,EAA0B,WAAA,qBAAQ,CAAA;oDAI/D;AAID;IADC,oBAAO;IACsB,WAAA,oBAAO,CAAA,EAAY,WAAA,oBAAO,CAAA;4DAevD;AAID;IADC,oBAAO;IACe,WAAA,oBAAO,CAAA,EAAY,WAAA,oBAAO,CAAA;qDA0ChD;AAGD;IADC,oBAAO;IACkB,WAAA,oBAAO,CAAA,EAAY,WAAA,oBAAO,CAAA;wDAEnD;AAED;IAAuC,WAAA,oBAAO,CAAA,EAAiD,WAAA,oBAAO,CAAA;qEAYrG;AAED;IAAoC,WAAA,oBAAO,CAAA,EAAgC,WAAA,oBAAO,CAAA;kEAYjF;AAGD;IAA2B,WAAA,oBAAO,CAAA;IAKhC,WAAA,oBAAO,CAAA;IACP,WAAA,oBAAO,CAAA;yDAcR;AAnlEW,kBAAkB;IAuDjB,WAAA,oBAAO,CAAA;GAvDR,kBAAkB,CA0nE9B;AA1nEY,gDAAkB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/PlusBlockStartState.d.ts b/node_modules/antlr4ts/atn/PlusBlockStartState.d.ts
deleted file mode 100644
index c6bdae6..0000000
--- a/node_modules/antlr4ts/atn/PlusBlockStartState.d.ts
+++ /dev/null
@@ -1,16 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNStateType } from './ATNStateType';
-import { BlockStartState } from './BlockStartState';
-import { PlusLoopbackState } from './PlusLoopbackState';
-/** Start of {@code (A|B|...)+} loop. Technically a decision state, but
- * we don't use for code generation; somebody might need it, so I'm defining
- * it for completeness. In reality, the {@link PlusLoopbackState} node is the
- * real decision-making note for {@code A+}.
- */
-export declare class PlusBlockStartState extends BlockStartState {
- loopBackState: PlusLoopbackState;
- readonly stateType: ATNStateType;
-}
diff --git a/node_modules/antlr4ts/atn/PlusBlockStartState.js b/node_modules/antlr4ts/atn/PlusBlockStartState.js
deleted file mode 100644
index 77b98d2..0000000
--- a/node_modules/antlr4ts/atn/PlusBlockStartState.js
+++ /dev/null
@@ -1,29 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const BlockStartState_1 = require("./BlockStartState");
-const Decorators_1 = require("../Decorators");
-/** Start of {@code (A|B|...)+} loop. Technically a decision state, but
- * we don't use for code generation; somebody might need it, so I'm defining
- * it for completeness. In reality, the {@link PlusLoopbackState} node is the
- * real decision-making note for {@code A+}.
- */
-class PlusBlockStartState extends BlockStartState_1.BlockStartState {
- get stateType() {
- return 4 /* PLUS_BLOCK_START */;
- }
-}
-__decorate([
- Decorators_1.Override
-], PlusBlockStartState.prototype, "stateType", null);
-exports.PlusBlockStartState = PlusBlockStartState;
-//# sourceMappingURL=PlusBlockStartState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/PlusBlockStartState.js.map b/node_modules/antlr4ts/atn/PlusBlockStartState.js.map
deleted file mode 100644
index 2882d14..0000000
--- a/node_modules/antlr4ts/atn/PlusBlockStartState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"PlusBlockStartState.js","sourceRoot":"","sources":["../../../src/atn/PlusBlockStartState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAKH,uDAAoD;AACpD,8CAAyC;AAGzC;;;;GAIG;AACH,yBAAiC,SAAQ,iCAAe;IAIvD,IAAI,SAAS;QACZ,MAAM,0BAA+B;IACtC,CAAC;CACD;AAHA;IADC,qBAAQ;oDAGR;AANF,kDAOC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/PlusLoopbackState.d.ts b/node_modules/antlr4ts/atn/PlusLoopbackState.d.ts
deleted file mode 100644
index 1e3cd79..0000000
--- a/node_modules/antlr4ts/atn/PlusLoopbackState.d.ts
+++ /dev/null
@@ -1,12 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNStateType } from './ATNStateType';
-import { DecisionState } from './DecisionState';
-/** Decision state for {@code A+} and {@code (A|B)+}. It has two transitions:
- * one to the loop back to start of the block and one to exit.
- */
-export declare class PlusLoopbackState extends DecisionState {
- readonly stateType: ATNStateType;
-}
diff --git a/node_modules/antlr4ts/atn/PlusLoopbackState.js b/node_modules/antlr4ts/atn/PlusLoopbackState.js
deleted file mode 100644
index 8c77257..0000000
--- a/node_modules/antlr4ts/atn/PlusLoopbackState.js
+++ /dev/null
@@ -1,27 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const DecisionState_1 = require("./DecisionState");
-const Decorators_1 = require("../Decorators");
-/** Decision state for {@code A+} and {@code (A|B)+}. It has two transitions:
- * one to the loop back to start of the block and one to exit.
- */
-class PlusLoopbackState extends DecisionState_1.DecisionState {
- get stateType() {
- return 11 /* PLUS_LOOP_BACK */;
- }
-}
-__decorate([
- Decorators_1.Override
-], PlusLoopbackState.prototype, "stateType", null);
-exports.PlusLoopbackState = PlusLoopbackState;
-//# sourceMappingURL=PlusLoopbackState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/PlusLoopbackState.js.map b/node_modules/antlr4ts/atn/PlusLoopbackState.js.map
deleted file mode 100644
index 21789b5..0000000
--- a/node_modules/antlr4ts/atn/PlusLoopbackState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"PlusLoopbackState.js","sourceRoot":"","sources":["../../../src/atn/PlusLoopbackState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAKH,mDAAgD;AAChD,8CAAyC;AAEzC;;GAEG;AACH,uBAA+B,SAAQ,6BAAa;IAGnD,IAAI,SAAS;QACZ,MAAM,yBAA6B;IACpC,CAAC;CACD;AAHA;IADC,qBAAQ;kDAGR;AALF,8CAMC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/PrecedencePredicateTransition.d.ts b/node_modules/antlr4ts/atn/PrecedencePredicateTransition.d.ts
deleted file mode 100644
index e2f228c..0000000
--- a/node_modules/antlr4ts/atn/PrecedencePredicateTransition.d.ts
+++ /dev/null
@@ -1,21 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { AbstractPredicateTransition } from './AbstractPredicateTransition';
-import { ATNState } from './ATNState';
-import { SemanticContext } from './SemanticContext';
-import { TransitionType } from './TransitionType';
-/**
- *
- * @author Sam Harwell
- */
-export declare class PrecedencePredicateTransition extends AbstractPredicateTransition {
- precedence: number;
- constructor(target: ATNState, precedence: number);
- readonly serializationType: TransitionType;
- readonly isEpsilon: boolean;
- matches(symbol: number, minVocabSymbol: number, maxVocabSymbol: number): boolean;
- readonly predicate: SemanticContext.PrecedencePredicate;
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/atn/PrecedencePredicateTransition.js b/node_modules/antlr4ts/atn/PrecedencePredicateTransition.js
deleted file mode 100644
index f3e71ef..0000000
--- a/node_modules/antlr4ts/atn/PrecedencePredicateTransition.js
+++ /dev/null
@@ -1,61 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:35.0994191-07:00
-const AbstractPredicateTransition_1 = require("./AbstractPredicateTransition");
-const Decorators_1 = require("../Decorators");
-const SemanticContext_1 = require("./SemanticContext");
-/**
- *
- * @author Sam Harwell
- */
-let PrecedencePredicateTransition = class PrecedencePredicateTransition extends AbstractPredicateTransition_1.AbstractPredicateTransition {
- constructor(target, precedence) {
- super(target);
- this.precedence = precedence;
- }
- get serializationType() {
- return 10 /* PRECEDENCE */;
- }
- get isEpsilon() {
- return true;
- }
- matches(symbol, minVocabSymbol, maxVocabSymbol) {
- return false;
- }
- get predicate() {
- return new SemanticContext_1.SemanticContext.PrecedencePredicate(this.precedence);
- }
- toString() {
- return this.precedence + " >= _p";
- }
-};
-__decorate([
- Decorators_1.Override
-], PrecedencePredicateTransition.prototype, "serializationType", null);
-__decorate([
- Decorators_1.Override
-], PrecedencePredicateTransition.prototype, "isEpsilon", null);
-__decorate([
- Decorators_1.Override
-], PrecedencePredicateTransition.prototype, "matches", null);
-__decorate([
- Decorators_1.Override
-], PrecedencePredicateTransition.prototype, "toString", null);
-PrecedencePredicateTransition = __decorate([
- __param(0, Decorators_1.NotNull)
-], PrecedencePredicateTransition);
-exports.PrecedencePredicateTransition = PrecedencePredicateTransition;
-//# sourceMappingURL=PrecedencePredicateTransition.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/PrecedencePredicateTransition.js.map b/node_modules/antlr4ts/atn/PrecedencePredicateTransition.js.map
deleted file mode 100644
index 06f210a..0000000
--- a/node_modules/antlr4ts/atn/PrecedencePredicateTransition.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"PrecedencePredicateTransition.js","sourceRoot":"","sources":["../../../src/atn/PrecedencePredicateTransition.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,+EAA4E;AAE5E,8CAAkD;AAClD,uDAAoD;AAGpD;;;GAGG;AACH,IAAa,6BAA6B,GAA1C,mCAA2C,SAAQ,yDAA2B;IAG7E,YAAsB,MAAgB,EAAE,UAAkB;QACzD,KAAK,CAAC,MAAM,CAAC,CAAC;QACd,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC9B,CAAC;IAGD,IAAI,iBAAiB;QACpB,MAAM,qBAA2B;IAClC,CAAC;IAGD,IAAI,SAAS;QACZ,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAGD,OAAO,CAAC,MAAc,EAAE,cAAsB,EAAE,cAAsB;QACrE,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED,IAAI,SAAS;QACZ,MAAM,CAAC,IAAI,iCAAe,CAAC,mBAAmB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACjE,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC;IACnC,CAAC;CACD,CAAA;AAtBA;IADC,qBAAQ;sEAGR;AAGD;IADC,qBAAQ;8DAGR;AAGD;IADC,qBAAQ;4DAGR;AAOD;IADC,qBAAQ;6DAGR;AA9BW,6BAA6B;IAG3B,WAAA,oBAAO,CAAA;GAHT,6BAA6B,CA+BzC;AA/BY,sEAA6B"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/PredicateEvalInfo.d.ts b/node_modules/antlr4ts/atn/PredicateEvalInfo.d.ts
deleted file mode 100644
index c177f91..0000000
--- a/node_modules/antlr4ts/atn/PredicateEvalInfo.d.ts
+++ /dev/null
@@ -1,54 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { DecisionEventInfo } from './DecisionEventInfo';
-import { SemanticContext } from './SemanticContext';
-import { SimulatorState } from './SimulatorState';
-import { TokenStream } from '../TokenStream';
-/**
- * This class represents profiling event information for semantic predicate
- * evaluations which occur during prediction.
- *
- * @see ParserATNSimulator#evalSemanticContext
- *
- * @since 4.3
- */
-export declare class PredicateEvalInfo extends DecisionEventInfo {
- /**
- * The semantic context which was evaluated.
- */
- semctx: SemanticContext;
- /**
- * The alternative number for the decision which is guarded by the semantic
- * context {@link #semctx}. Note that other ATN
- * configurations may predict the same alternative which are guarded by
- * other semantic contexts and/or {@link SemanticContext#NONE}.
- */
- predictedAlt: number;
- /**
- * The result of evaluating the semantic context {@link #semctx}.
- */
- evalResult: boolean;
- /**
- * Constructs a new instance of the {@link PredicateEvalInfo} class with the
- * specified detailed predicate evaluation information.
- *
- * @param state The simulator state
- * @param decision The decision number
- * @param input The input token stream
- * @param startIndex The start index for the current prediction
- * @param stopIndex The index at which the predicate evaluation was
- * triggered. Note that the input stream may be reset to other positions for
- * the actual evaluation of individual predicates.
- * @param semctx The semantic context which was evaluated
- * @param evalResult The results of evaluating the semantic context
- * @param predictedAlt The alternative number for the decision which is
- * guarded by the semantic context {@code semctx}. See {@link #predictedAlt}
- * for more information.
- *
- * @see ParserATNSimulator#evalSemanticContext(SemanticContext, ParserRuleContext, int)
- * @see SemanticContext#eval(Recognizer, RuleContext)
- */
- constructor(state: SimulatorState, decision: number, input: TokenStream, startIndex: number, stopIndex: number, semctx: SemanticContext, evalResult: boolean, predictedAlt: number);
-}
diff --git a/node_modules/antlr4ts/atn/PredicateEvalInfo.js b/node_modules/antlr4ts/atn/PredicateEvalInfo.js
deleted file mode 100644
index 96f265e..0000000
--- a/node_modules/antlr4ts/atn/PredicateEvalInfo.js
+++ /dev/null
@@ -1,61 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:35.1914305-07:00
-const DecisionEventInfo_1 = require("./DecisionEventInfo");
-const Decorators_1 = require("../Decorators");
-/**
- * This class represents profiling event information for semantic predicate
- * evaluations which occur during prediction.
- *
- * @see ParserATNSimulator#evalSemanticContext
- *
- * @since 4.3
- */
-let PredicateEvalInfo = class PredicateEvalInfo extends DecisionEventInfo_1.DecisionEventInfo {
- /**
- * Constructs a new instance of the {@link PredicateEvalInfo} class with the
- * specified detailed predicate evaluation information.
- *
- * @param state The simulator state
- * @param decision The decision number
- * @param input The input token stream
- * @param startIndex The start index for the current prediction
- * @param stopIndex The index at which the predicate evaluation was
- * triggered. Note that the input stream may be reset to other positions for
- * the actual evaluation of individual predicates.
- * @param semctx The semantic context which was evaluated
- * @param evalResult The results of evaluating the semantic context
- * @param predictedAlt The alternative number for the decision which is
- * guarded by the semantic context {@code semctx}. See {@link #predictedAlt}
- * for more information.
- *
- * @see ParserATNSimulator#evalSemanticContext(SemanticContext, ParserRuleContext, int)
- * @see SemanticContext#eval(Recognizer, RuleContext)
- */
- constructor(state, decision, input, startIndex, stopIndex, semctx, evalResult, predictedAlt) {
- super(decision, state, input, startIndex, stopIndex, state.useContext);
- this.semctx = semctx;
- this.evalResult = evalResult;
- this.predictedAlt = predictedAlt;
- }
-};
-PredicateEvalInfo = __decorate([
- __param(0, Decorators_1.NotNull),
- __param(2, Decorators_1.NotNull),
- __param(5, Decorators_1.NotNull)
-], PredicateEvalInfo);
-exports.PredicateEvalInfo = PredicateEvalInfo;
-//# sourceMappingURL=PredicateEvalInfo.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/PredicateEvalInfo.js.map b/node_modules/antlr4ts/atn/PredicateEvalInfo.js.map
deleted file mode 100644
index cc71573..0000000
--- a/node_modules/antlr4ts/atn/PredicateEvalInfo.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"PredicateEvalInfo.js","sourceRoot":"","sources":["../../../src/atn/PredicateEvalInfo.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,2DAAwD;AACxD,8CAAwC;AAKxC;;;;;;;GAOG;AACH,IAAa,iBAAiB,GAA9B,uBAA+B,SAAQ,qCAAiB;IAiBvD;;;;;;;;;;;;;;;;;;;OAmBG;IACH,YACU,KAAqB,EAC9B,QAAgB,EACP,KAAkB,EAC3B,UAAkB,EAClB,SAAiB,EACR,MAAuB,EAChC,UAAmB,EACnB,YAAoB;QAEpB,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;QACvE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;IAClC,CAAC;CACD,CAAA;AApDY,iBAAiB;IAsC3B,WAAA,oBAAO,CAAA;IAEP,WAAA,oBAAO,CAAA;IAGP,WAAA,oBAAO,CAAA;GA3CG,iBAAiB,CAoD7B;AApDY,8CAAiB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/PredicateTransition.d.ts b/node_modules/antlr4ts/atn/PredicateTransition.d.ts
deleted file mode 100644
index 7b73b07..0000000
--- a/node_modules/antlr4ts/atn/PredicateTransition.d.ts
+++ /dev/null
@@ -1,25 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { AbstractPredicateTransition } from './AbstractPredicateTransition';
-import { ATNState } from './ATNState';
-import { SemanticContext } from './SemanticContext';
-import { TransitionType } from './TransitionType';
-/** TODO: this is old comment:
- * A tree of semantic predicates from the grammar AST if label==SEMPRED.
- * In the ATN, labels will always be exactly one predicate, but the DFA
- * may have to combine a bunch of them as it collects predicates from
- * multiple ATN configurations into a single DFA state.
- */
-export declare class PredicateTransition extends AbstractPredicateTransition {
- ruleIndex: number;
- predIndex: number;
- isCtxDependent: boolean;
- constructor(target: ATNState, ruleIndex: number, predIndex: number, isCtxDependent: boolean);
- readonly serializationType: TransitionType;
- readonly isEpsilon: boolean;
- matches(symbol: number, minVocabSymbol: number, maxVocabSymbol: number): boolean;
- readonly predicate: SemanticContext.Predicate;
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/atn/PredicateTransition.js b/node_modules/antlr4ts/atn/PredicateTransition.js
deleted file mode 100644
index 8e79627..0000000
--- a/node_modules/antlr4ts/atn/PredicateTransition.js
+++ /dev/null
@@ -1,64 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:35.2826960-07:00
-const AbstractPredicateTransition_1 = require("./AbstractPredicateTransition");
-const Decorators_1 = require("../Decorators");
-const SemanticContext_1 = require("./SemanticContext");
-/** TODO: this is old comment:
- * A tree of semantic predicates from the grammar AST if label==SEMPRED.
- * In the ATN, labels will always be exactly one predicate, but the DFA
- * may have to combine a bunch of them as it collects predicates from
- * multiple ATN configurations into a single DFA state.
- */
-let PredicateTransition = class PredicateTransition extends AbstractPredicateTransition_1.AbstractPredicateTransition {
- constructor(target, ruleIndex, predIndex, isCtxDependent) {
- super(target);
- this.ruleIndex = ruleIndex;
- this.predIndex = predIndex;
- this.isCtxDependent = isCtxDependent;
- }
- get serializationType() {
- return 4 /* PREDICATE */;
- }
- get isEpsilon() { return true; }
- matches(symbol, minVocabSymbol, maxVocabSymbol) {
- return false;
- }
- get predicate() {
- return new SemanticContext_1.SemanticContext.Predicate(this.ruleIndex, this.predIndex, this.isCtxDependent);
- }
- toString() {
- return "pred_" + this.ruleIndex + ":" + this.predIndex;
- }
-};
-__decorate([
- Decorators_1.Override
-], PredicateTransition.prototype, "serializationType", null);
-__decorate([
- Decorators_1.Override
-], PredicateTransition.prototype, "isEpsilon", null);
-__decorate([
- Decorators_1.Override
-], PredicateTransition.prototype, "matches", null);
-__decorate([
- Decorators_1.Override,
- Decorators_1.NotNull
-], PredicateTransition.prototype, "toString", null);
-PredicateTransition = __decorate([
- __param(0, Decorators_1.NotNull)
-], PredicateTransition);
-exports.PredicateTransition = PredicateTransition;
-//# sourceMappingURL=PredicateTransition.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/PredicateTransition.js.map b/node_modules/antlr4ts/atn/PredicateTransition.js.map
deleted file mode 100644
index 05c9ea7..0000000
--- a/node_modules/antlr4ts/atn/PredicateTransition.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"PredicateTransition.js","sourceRoot":"","sources":["../../../src/atn/PredicateTransition.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,+EAA4E;AAE5E,8CAAkD;AAClD,uDAAoD;AAGpD;;;;;GAKG;AACH,IAAa,mBAAmB,GAAhC,yBAAiC,SAAQ,yDAA2B;IAKnE,YAAqB,MAAgB,EAAE,SAAiB,EAAE,SAAiB,EAAE,cAAuB;QACnG,KAAK,CAAC,MAAM,CAAC,CAAC;QACd,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;IACtC,CAAC;IAGD,IAAI,iBAAiB;QACpB,MAAM,mBAA0B;IACjC,CAAC;IAGD,IAAI,SAAS,KAAc,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAGzC,OAAO,CAAC,MAAc,EAAE,cAAsB,EAAE,cAAsB;QACrE,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED,IAAI,SAAS;QACZ,MAAM,CAAC,IAAI,iCAAe,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;IAC3F,CAAC;IAID,QAAQ;QACP,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,GAAG,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC;IACxD,CAAC;CACD,CAAA;AArBA;IADC,qBAAQ;4DAGR;AAGD;IADC,qBAAQ;oDACgC;AAGzC;IADC,qBAAQ;kDAGR;AAQD;IAFC,qBAAQ;IACR,oBAAO;mDAGP;AAjCW,mBAAmB;IAKlB,WAAA,oBAAO,CAAA;GALR,mBAAmB,CAkC/B;AAlCY,kDAAmB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/PredictionContext.d.ts b/node_modules/antlr4ts/atn/PredictionContext.d.ts
deleted file mode 100644
index d57cf22..0000000
--- a/node_modules/antlr4ts/atn/PredictionContext.d.ts
+++ /dev/null
@@ -1,89 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Array2DHashMap } from '../misc/Array2DHashMap';
-import { ATN } from './ATN';
-import { EqualityComparator } from '../misc/EqualityComparator';
-import { Equatable } from '../misc/Stubs';
-import { PredictionContextCache } from './PredictionContextCache';
-import { Recognizer } from '../Recognizer';
-import { RuleContext } from '../RuleContext';
-export declare abstract class PredictionContext implements Equatable {
- /**
- * Stores the computed hash code of this {@link PredictionContext}. The hash
- * code is computed in parts to match the following reference algorithm.
- *
- *
- * private int referenceHashCode() {
- * int hash = {@link MurmurHash#initialize MurmurHash.initialize}({@link #INITIAL_HASH});
- *
- * for (int i = 0; i < this.size; i++) {
- * hash = {@link MurmurHash#update MurmurHash.update}(hash, {@link #getParent getParent}(i));
- * }
- *
- * for (int i = 0; i < this.size; i++) {
- * hash = {@link MurmurHash#update MurmurHash.update}(hash, {@link #getReturnState getReturnState}(i));
- * }
- *
- * hash = {@link MurmurHash#finish MurmurHash.finish}(hash, 2 * this.size);
- * return hash;
- * }
- *
- */
- private readonly cachedHashCode;
- constructor(cachedHashCode: number);
- protected static calculateEmptyHashCode(): number;
- protected static calculateSingleHashCode(parent: PredictionContext, returnState: number): number;
- protected static calculateHashCode(parents: PredictionContext[], returnStates: number[]): number;
- readonly abstract size: number;
- abstract getReturnState(index: number): number;
- abstract findReturnState(returnState: number): number;
- abstract getParent(index: number): PredictionContext;
- protected abstract addEmptyContext(): PredictionContext;
- protected abstract removeEmptyContext(): PredictionContext;
- static fromRuleContext(atn: ATN, outerContext: RuleContext, fullContext?: boolean): PredictionContext;
- private static addEmptyContext(context);
- private static removeEmptyContext(context);
- static join(context0: PredictionContext, context1: PredictionContext, contextCache?: PredictionContextCache): PredictionContext;
- static isEmptyLocal(context: PredictionContext): boolean;
- static getCachedContext(context: PredictionContext, contextCache: Array2DHashMap, visited: PredictionContext.IdentityHashMap): PredictionContext;
- appendSingleContext(returnContext: number, contextCache: PredictionContextCache): PredictionContext;
- abstract appendContext(suffix: PredictionContext, contextCache: PredictionContextCache): PredictionContext;
- getChild(returnState: number): PredictionContext;
- readonly abstract isEmpty: boolean;
- readonly abstract hasEmpty: boolean;
- hashCode(): number;
- abstract equals(o: any): boolean;
- toStrings(recognizer: Recognizer | undefined, currentState: number, stop?: PredictionContext): string[];
-}
-export declare class SingletonPredictionContext extends PredictionContext {
- parent: PredictionContext;
- returnState: number;
- constructor(parent: PredictionContext, returnState: number);
- getParent(index: number): PredictionContext;
- getReturnState(index: number): number;
- findReturnState(returnState: number): number;
- readonly size: number;
- readonly isEmpty: boolean;
- readonly hasEmpty: boolean;
- appendContext(suffix: PredictionContext, contextCache: PredictionContextCache): PredictionContext;
- protected addEmptyContext(): PredictionContext;
- protected removeEmptyContext(): PredictionContext;
- equals(o: any): boolean;
-}
-export declare namespace PredictionContext {
- const EMPTY_LOCAL: PredictionContext;
- const EMPTY_FULL: PredictionContext;
- const EMPTY_LOCAL_STATE_KEY: number;
- const EMPTY_FULL_STATE_KEY: number;
- class IdentityHashMap extends Array2DHashMap {
- constructor();
- }
- class IdentityEqualityComparator implements EqualityComparator {
- static readonly INSTANCE: IdentityEqualityComparator;
- private IdentityEqualityComparator();
- hashCode(obj: PredictionContext): number;
- equals(a: PredictionContext, b: PredictionContext): boolean;
- }
-}
diff --git a/node_modules/antlr4ts/atn/PredictionContext.js b/node_modules/antlr4ts/atn/PredictionContext.js
deleted file mode 100644
index 4e8236c..0000000
--- a/node_modules/antlr4ts/atn/PredictionContext.js
+++ /dev/null
@@ -1,688 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:35.3812636-07:00
-const Array2DHashMap_1 = require("../misc/Array2DHashMap");
-const Array2DHashSet_1 = require("../misc/Array2DHashSet");
-const Arrays_1 = require("../misc/Arrays");
-const MurmurHash_1 = require("../misc/MurmurHash");
-const Decorators_1 = require("../Decorators");
-const PredictionContextCache_1 = require("./PredictionContextCache");
-const assert = require("assert");
-const INITIAL_HASH = 1;
-class PredictionContext {
- constructor(cachedHashCode) {
- this.cachedHashCode = cachedHashCode;
- }
- static calculateEmptyHashCode() {
- let hash = MurmurHash_1.MurmurHash.initialize(INITIAL_HASH);
- hash = MurmurHash_1.MurmurHash.finish(hash, 0);
- return hash;
- }
- static calculateSingleHashCode(parent, returnState) {
- let hash = MurmurHash_1.MurmurHash.initialize(INITIAL_HASH);
- hash = MurmurHash_1.MurmurHash.update(hash, parent);
- hash = MurmurHash_1.MurmurHash.update(hash, returnState);
- hash = MurmurHash_1.MurmurHash.finish(hash, 2);
- return hash;
- }
- static calculateHashCode(parents, returnStates) {
- let hash = MurmurHash_1.MurmurHash.initialize(INITIAL_HASH);
- for (let parent of parents) {
- hash = MurmurHash_1.MurmurHash.update(hash, parent);
- }
- for (let returnState of returnStates) {
- hash = MurmurHash_1.MurmurHash.update(hash, returnState);
- }
- hash = MurmurHash_1.MurmurHash.finish(hash, 2 * parents.length);
- return hash;
- }
- static fromRuleContext(atn, outerContext, fullContext = true) {
- if (outerContext.isEmpty) {
- return fullContext ? PredictionContext.EMPTY_FULL : PredictionContext.EMPTY_LOCAL;
- }
- let parent;
- if (outerContext._parent) {
- parent = PredictionContext.fromRuleContext(atn, outerContext._parent, fullContext);
- }
- else {
- parent = fullContext ? PredictionContext.EMPTY_FULL : PredictionContext.EMPTY_LOCAL;
- }
- let state = atn.states[outerContext.invokingState];
- let transition = state.transition(0);
- return parent.getChild(transition.followState.stateNumber);
- }
- static addEmptyContext(context) {
- return context.addEmptyContext();
- }
- static removeEmptyContext(context) {
- return context.removeEmptyContext();
- }
- static join(context0, context1, contextCache = PredictionContextCache_1.PredictionContextCache.UNCACHED) {
- if (context0 == context1) {
- return context0;
- }
- if (context0.isEmpty) {
- return PredictionContext.isEmptyLocal(context0) ? context0 : PredictionContext.addEmptyContext(context1);
- }
- else if (context1.isEmpty) {
- return PredictionContext.isEmptyLocal(context1) ? context1 : PredictionContext.addEmptyContext(context0);
- }
- let context0size = context0.size;
- let context1size = context1.size;
- if (context0size === 1 && context1size === 1 && context0.getReturnState(0) === context1.getReturnState(0)) {
- let merged = contextCache.join(context0.getParent(0), context1.getParent(0));
- if (merged === context0.getParent(0)) {
- return context0;
- }
- else if (merged === context1.getParent(0)) {
- return context1;
- }
- else {
- return merged.getChild(context0.getReturnState(0));
- }
- }
- let count = 0;
- let parentsList = new Array(context0size + context1size);
- let returnStatesList = new Array(parentsList.length);
- let leftIndex = 0;
- let rightIndex = 0;
- let canReturnLeft = true;
- let canReturnRight = true;
- while (leftIndex < context0size && rightIndex < context1size) {
- if (context0.getReturnState(leftIndex) === context1.getReturnState(rightIndex)) {
- parentsList[count] = contextCache.join(context0.getParent(leftIndex), context1.getParent(rightIndex));
- returnStatesList[count] = context0.getReturnState(leftIndex);
- canReturnLeft = canReturnLeft && parentsList[count] === context0.getParent(leftIndex);
- canReturnRight = canReturnRight && parentsList[count] === context1.getParent(rightIndex);
- leftIndex++;
- rightIndex++;
- }
- else if (context0.getReturnState(leftIndex) < context1.getReturnState(rightIndex)) {
- parentsList[count] = context0.getParent(leftIndex);
- returnStatesList[count] = context0.getReturnState(leftIndex);
- canReturnRight = false;
- leftIndex++;
- }
- else {
- assert(context1.getReturnState(rightIndex) < context0.getReturnState(leftIndex));
- parentsList[count] = context1.getParent(rightIndex);
- returnStatesList[count] = context1.getReturnState(rightIndex);
- canReturnLeft = false;
- rightIndex++;
- }
- count++;
- }
- while (leftIndex < context0size) {
- parentsList[count] = context0.getParent(leftIndex);
- returnStatesList[count] = context0.getReturnState(leftIndex);
- leftIndex++;
- canReturnRight = false;
- count++;
- }
- while (rightIndex < context1size) {
- parentsList[count] = context1.getParent(rightIndex);
- returnStatesList[count] = context1.getReturnState(rightIndex);
- rightIndex++;
- canReturnLeft = false;
- count++;
- }
- if (canReturnLeft) {
- return context0;
- }
- else if (canReturnRight) {
- return context1;
- }
- if (count < parentsList.length) {
- parentsList = parentsList.slice(0, count);
- returnStatesList = returnStatesList.slice(0, count);
- }
- if (parentsList.length === 0) {
- // if one of them was EMPTY_LOCAL, it would be empty and handled at the beginning of the method
- return PredictionContext.EMPTY_FULL;
- }
- else if (parentsList.length === 1) {
- return new SingletonPredictionContext(parentsList[0], returnStatesList[0]);
- }
- else {
- return new ArrayPredictionContext(parentsList, returnStatesList);
- }
- }
- static isEmptyLocal(context) {
- return context === PredictionContext.EMPTY_LOCAL;
- }
- static getCachedContext(context, contextCache, visited) {
- if (context.isEmpty) {
- return context;
- }
- let existing = visited.get(context);
- if (existing) {
- return existing;
- }
- existing = contextCache.get(context);
- if (existing) {
- visited.put(context, existing);
- return existing;
- }
- let changed = false;
- let parents = new Array(context.size);
- for (let i = 0; i < parents.length; i++) {
- let parent = PredictionContext.getCachedContext(context.getParent(i), contextCache, visited);
- if (changed || parent !== context.getParent(i)) {
- if (!changed) {
- parents = new Array(context.size);
- for (let j = 0; j < context.size; j++) {
- parents[j] = context.getParent(j);
- }
- changed = true;
- }
- parents[i] = parent;
- }
- }
- if (!changed) {
- existing = contextCache.putIfAbsent(context, context);
- visited.put(context, existing != null ? existing : context);
- return context;
- }
- // We know parents.length>0 because context.isEmpty is checked at the beginning of the method.
- let updated;
- if (parents.length === 1) {
- updated = new SingletonPredictionContext(parents[0], context.getReturnState(0));
- }
- else {
- let returnStates = new Array(context.size);
- for (let i = 0; i < context.size; i++) {
- returnStates[i] = context.getReturnState(i);
- }
- updated = new ArrayPredictionContext(parents, returnStates, context.hashCode());
- }
- existing = contextCache.putIfAbsent(updated, updated);
- visited.put(updated, existing || updated);
- visited.put(context, existing || updated);
- return updated;
- }
- appendSingleContext(returnContext, contextCache) {
- return this.appendContext(PredictionContext.EMPTY_FULL.getChild(returnContext), contextCache);
- }
- getChild(returnState) {
- return new SingletonPredictionContext(this, returnState);
- }
- hashCode() {
- return this.cachedHashCode;
- }
- toStrings(recognizer, currentState, stop = PredictionContext.EMPTY_FULL) {
- let result = [];
- outer: for (let perm = 0;; perm++) {
- let offset = 0;
- let last = true;
- let p = this;
- let stateNumber = currentState;
- let localBuffer = "";
- localBuffer += "[";
- while (!p.isEmpty && p !== stop) {
- let index = 0;
- if (p.size > 0) {
- let bits = 1;
- while (((1 << bits) >>> 0) < p.size) {
- bits++;
- }
- let mask = ((1 << bits) >>> 0) - 1;
- index = (perm >> offset) & mask;
- last = last && index >= p.size - 1;
- if (index >= p.size) {
- continue outer;
- }
- offset += bits;
- }
- if (recognizer) {
- if (localBuffer.length > 1) {
- // first char is '[', if more than that this isn't the first rule
- localBuffer += ' ';
- }
- let atn = recognizer.atn;
- let s = atn.states[stateNumber];
- let ruleName = recognizer.ruleNames[s.ruleIndex];
- localBuffer += ruleName;
- }
- else if (p.getReturnState(index) !== PredictionContext.EMPTY_FULL_STATE_KEY) {
- if (!p.isEmpty) {
- if (localBuffer.length > 1) {
- // first char is '[', if more than that this isn't the first rule
- localBuffer += ' ';
- }
- localBuffer += p.getReturnState(index);
- }
- }
- stateNumber = p.getReturnState(index);
- p = p.getParent(index);
- }
- localBuffer += "]";
- result.push(localBuffer);
- if (last) {
- break;
- }
- }
- return result;
- }
-}
-__decorate([
- Decorators_1.Override
-], PredictionContext.prototype, "hashCode", null);
-__decorate([
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.NotNull), __param(2, Decorators_1.NotNull)
-], PredictionContext, "join", null);
-__decorate([
- __param(0, Decorators_1.NotNull),
- __param(1, Decorators_1.NotNull),
- __param(2, Decorators_1.NotNull)
-], PredictionContext, "getCachedContext", null);
-exports.PredictionContext = PredictionContext;
-class EmptyPredictionContext extends PredictionContext {
- constructor(fullContext) {
- super(PredictionContext.calculateEmptyHashCode());
- this.fullContext = fullContext;
- }
- get isFullContext() {
- return this.fullContext;
- }
- addEmptyContext() {
- return this;
- }
- removeEmptyContext() {
- throw new Error("Cannot remove the empty context from itself.");
- }
- getParent(index) {
- throw new Error("index out of bounds");
- }
- getReturnState(index) {
- throw new Error("index out of bounds");
- }
- findReturnState(returnState) {
- return -1;
- }
- get size() {
- return 0;
- }
- appendSingleContext(returnContext, contextCache) {
- return contextCache.getChild(this, returnContext);
- }
- appendContext(suffix, contextCache) {
- return suffix;
- }
- get isEmpty() {
- return true;
- }
- get hasEmpty() {
- return true;
- }
- equals(o) {
- return this === o;
- }
- toStrings(recognizer, currentState, stop) {
- return ["[]"];
- }
-}
-__decorate([
- Decorators_1.Override
-], EmptyPredictionContext.prototype, "addEmptyContext", null);
-__decorate([
- Decorators_1.Override
-], EmptyPredictionContext.prototype, "removeEmptyContext", null);
-__decorate([
- Decorators_1.Override
-], EmptyPredictionContext.prototype, "getParent", null);
-__decorate([
- Decorators_1.Override
-], EmptyPredictionContext.prototype, "getReturnState", null);
-__decorate([
- Decorators_1.Override
-], EmptyPredictionContext.prototype, "findReturnState", null);
-__decorate([
- Decorators_1.Override
-], EmptyPredictionContext.prototype, "size", null);
-__decorate([
- Decorators_1.Override
-], EmptyPredictionContext.prototype, "appendSingleContext", null);
-__decorate([
- Decorators_1.Override
-], EmptyPredictionContext.prototype, "appendContext", null);
-__decorate([
- Decorators_1.Override
-], EmptyPredictionContext.prototype, "isEmpty", null);
-__decorate([
- Decorators_1.Override
-], EmptyPredictionContext.prototype, "hasEmpty", null);
-__decorate([
- Decorators_1.Override
-], EmptyPredictionContext.prototype, "equals", null);
-__decorate([
- Decorators_1.Override
-], EmptyPredictionContext.prototype, "toStrings", null);
-let ArrayPredictionContext = class ArrayPredictionContext extends PredictionContext {
- constructor(parents, returnStates, hashCode) {
- super(hashCode || PredictionContext.calculateHashCode(parents, returnStates));
- assert(parents.length === returnStates.length);
- assert(returnStates.length > 1 || returnStates[0] !== PredictionContext.EMPTY_FULL_STATE_KEY, "Should be using PredictionContext.EMPTY instead.");
- this.parents = parents;
- this.returnStates = returnStates;
- }
- getParent(index) {
- return this.parents[index];
- }
- getReturnState(index) {
- return this.returnStates[index];
- }
- findReturnState(returnState) {
- return Arrays_1.Arrays.binarySearch(this.returnStates, returnState);
- }
- get size() {
- return this.returnStates.length;
- }
- get isEmpty() {
- return false;
- }
- get hasEmpty() {
- return this.returnStates[this.returnStates.length - 1] === PredictionContext.EMPTY_FULL_STATE_KEY;
- }
- addEmptyContext() {
- if (this.hasEmpty) {
- return this;
- }
- let parents2 = this.parents.slice(0);
- let returnStates2 = this.returnStates.slice(0);
- parents2.push(PredictionContext.EMPTY_FULL);
- returnStates2.push(PredictionContext.EMPTY_FULL_STATE_KEY);
- return new ArrayPredictionContext(parents2, returnStates2);
- }
- removeEmptyContext() {
- if (!this.hasEmpty) {
- return this;
- }
- if (this.returnStates.length === 2) {
- return new SingletonPredictionContext(this.parents[0], this.returnStates[0]);
- }
- else {
- let parents2 = this.parents.slice(0, this.parents.length - 1);
- let returnStates2 = this.returnStates.slice(0, this.returnStates.length - 1);
- return new ArrayPredictionContext(parents2, returnStates2);
- }
- }
- appendContext(suffix, contextCache) {
- return ArrayPredictionContext.appendContextImpl(this, suffix, new PredictionContext.IdentityHashMap());
- }
- static appendContextImpl(context, suffix, visited) {
- if (suffix.isEmpty) {
- if (PredictionContext.isEmptyLocal(suffix)) {
- if (context.hasEmpty) {
- return PredictionContext.EMPTY_LOCAL;
- }
- throw new Error("what to do here?");
- }
- return context;
- }
- if (suffix.size !== 1) {
- throw new Error("Appending a tree suffix is not yet supported.");
- }
- let result = visited.get(context);
- if (!result) {
- if (context.isEmpty) {
- result = suffix;
- }
- else {
- let parentCount = context.size;
- if (context.hasEmpty) {
- parentCount--;
- }
- let updatedParents = new Array(parentCount);
- let updatedReturnStates = new Array(parentCount);
- for (let i = 0; i < parentCount; i++) {
- updatedReturnStates[i] = context.getReturnState(i);
- }
- for (let i = 0; i < parentCount; i++) {
- updatedParents[i] = ArrayPredictionContext.appendContextImpl(context.getParent(i), suffix, visited);
- }
- if (updatedParents.length === 1) {
- result = new SingletonPredictionContext(updatedParents[0], updatedReturnStates[0]);
- }
- else {
- assert(updatedParents.length > 1);
- result = new ArrayPredictionContext(updatedParents, updatedReturnStates);
- }
- if (context.hasEmpty) {
- result = PredictionContext.join(result, suffix);
- }
- }
- visited.put(context, result);
- }
- return result;
- }
- equals(o) {
- if (this === o) {
- return true;
- }
- else if (!(o instanceof ArrayPredictionContext)) {
- return false;
- }
- if (this.hashCode() !== o.hashCode()) {
- // can't be same if hash is different
- return false;
- }
- let other = o;
- return this.equalsImpl(other, new Array2DHashSet_1.Array2DHashSet());
- }
- equalsImpl(other, visited) {
- let selfWorkList = [];
- let otherWorkList = [];
- selfWorkList.push(this);
- otherWorkList.push(other);
- while (true) {
- let currentSelf = selfWorkList.pop();
- let currentOther = otherWorkList.pop();
- if (!currentSelf || !currentOther) {
- break;
- }
- let operands = new PredictionContextCache_1.PredictionContextCache.IdentityCommutativePredictionContextOperands(currentSelf, currentOther);
- if (!visited.add(operands)) {
- continue;
- }
- let selfSize = operands.x.size;
- if (selfSize === 0) {
- if (!operands.x.equals(operands.y)) {
- return false;
- }
- continue;
- }
- let otherSize = operands.y.size;
- if (selfSize !== otherSize) {
- return false;
- }
- for (let i = 0; i < selfSize; i++) {
- if (operands.x.getReturnState(i) !== operands.y.getReturnState(i)) {
- return false;
- }
- let selfParent = operands.x.getParent(i);
- let otherParent = operands.y.getParent(i);
- if (selfParent.hashCode() !== otherParent.hashCode()) {
- return false;
- }
- if (selfParent !== otherParent) {
- selfWorkList.push(selfParent);
- otherWorkList.push(otherParent);
- }
- }
- }
- return true;
- }
-};
-__decorate([
- Decorators_1.NotNull
-], ArrayPredictionContext.prototype, "parents", void 0);
-__decorate([
- Decorators_1.NotNull
-], ArrayPredictionContext.prototype, "returnStates", void 0);
-__decorate([
- Decorators_1.Override
-], ArrayPredictionContext.prototype, "getParent", null);
-__decorate([
- Decorators_1.Override
-], ArrayPredictionContext.prototype, "getReturnState", null);
-__decorate([
- Decorators_1.Override
-], ArrayPredictionContext.prototype, "findReturnState", null);
-__decorate([
- Decorators_1.Override
-], ArrayPredictionContext.prototype, "size", null);
-__decorate([
- Decorators_1.Override
-], ArrayPredictionContext.prototype, "isEmpty", null);
-__decorate([
- Decorators_1.Override
-], ArrayPredictionContext.prototype, "hasEmpty", null);
-__decorate([
- Decorators_1.Override
-], ArrayPredictionContext.prototype, "addEmptyContext", null);
-__decorate([
- Decorators_1.Override
-], ArrayPredictionContext.prototype, "removeEmptyContext", null);
-__decorate([
- Decorators_1.Override
-], ArrayPredictionContext.prototype, "appendContext", null);
-__decorate([
- Decorators_1.Override
-], ArrayPredictionContext.prototype, "equals", null);
-ArrayPredictionContext = __decorate([
- __param(0, Decorators_1.NotNull)
-], ArrayPredictionContext);
-let SingletonPredictionContext = class SingletonPredictionContext extends PredictionContext {
- constructor(parent, returnState) {
- super(PredictionContext.calculateSingleHashCode(parent, returnState));
- // assert(returnState != PredictionContext.EMPTY_FULL_STATE_KEY && returnState != PredictionContext.EMPTY_LOCAL_STATE_KEY);
- this.parent = parent;
- this.returnState = returnState;
- }
- getParent(index) {
- // assert(index == 0);
- return this.parent;
- }
- getReturnState(index) {
- // assert(index == 0);
- return this.returnState;
- }
- findReturnState(returnState) {
- return this.returnState === returnState ? 0 : -1;
- }
- get size() {
- return 1;
- }
- get isEmpty() {
- return false;
- }
- get hasEmpty() {
- return false;
- }
- appendContext(suffix, contextCache) {
- return contextCache.getChild(this.parent.appendContext(suffix, contextCache), this.returnState);
- }
- addEmptyContext() {
- let parents = [this.parent, PredictionContext.EMPTY_FULL];
- let returnStates = [this.returnState, PredictionContext.EMPTY_FULL_STATE_KEY];
- return new ArrayPredictionContext(parents, returnStates);
- }
- removeEmptyContext() {
- return this;
- }
- equals(o) {
- if (o === this) {
- return true;
- }
- else if (!(o instanceof SingletonPredictionContext)) {
- return false;
- }
- let other = o;
- if (this.hashCode() !== other.hashCode()) {
- return false;
- }
- return this.returnState === other.returnState
- && this.parent.equals(other.parent);
- }
-};
-__decorate([
- Decorators_1.NotNull
-], SingletonPredictionContext.prototype, "parent", void 0);
-__decorate([
- Decorators_1.Override
-], SingletonPredictionContext.prototype, "getParent", null);
-__decorate([
- Decorators_1.Override
-], SingletonPredictionContext.prototype, "getReturnState", null);
-__decorate([
- Decorators_1.Override
-], SingletonPredictionContext.prototype, "findReturnState", null);
-__decorate([
- Decorators_1.Override
-], SingletonPredictionContext.prototype, "size", null);
-__decorate([
- Decorators_1.Override
-], SingletonPredictionContext.prototype, "isEmpty", null);
-__decorate([
- Decorators_1.Override
-], SingletonPredictionContext.prototype, "hasEmpty", null);
-__decorate([
- Decorators_1.Override
-], SingletonPredictionContext.prototype, "appendContext", null);
-__decorate([
- Decorators_1.Override
-], SingletonPredictionContext.prototype, "addEmptyContext", null);
-__decorate([
- Decorators_1.Override
-], SingletonPredictionContext.prototype, "removeEmptyContext", null);
-__decorate([
- Decorators_1.Override
-], SingletonPredictionContext.prototype, "equals", null);
-SingletonPredictionContext = __decorate([
- __param(0, Decorators_1.NotNull)
-], SingletonPredictionContext);
-exports.SingletonPredictionContext = SingletonPredictionContext;
-(function (PredictionContext) {
- PredictionContext.EMPTY_LOCAL = new EmptyPredictionContext(false);
- PredictionContext.EMPTY_FULL = new EmptyPredictionContext(true);
- PredictionContext.EMPTY_LOCAL_STATE_KEY = -((1 << 31) >>> 0);
- PredictionContext.EMPTY_FULL_STATE_KEY = ((1 << 31) >>> 0) - 1;
- class IdentityHashMap extends Array2DHashMap_1.Array2DHashMap {
- constructor() {
- super(IdentityEqualityComparator.INSTANCE);
- }
- }
- PredictionContext.IdentityHashMap = IdentityHashMap;
- class IdentityEqualityComparator {
- IdentityEqualityComparator() {
- }
- hashCode(obj) {
- return obj.hashCode();
- }
- equals(a, b) {
- return a === b;
- }
- }
- IdentityEqualityComparator.INSTANCE = new IdentityEqualityComparator();
- __decorate([
- Decorators_1.Override
- ], IdentityEqualityComparator.prototype, "hashCode", null);
- __decorate([
- Decorators_1.Override
- ], IdentityEqualityComparator.prototype, "equals", null);
- PredictionContext.IdentityEqualityComparator = IdentityEqualityComparator;
-})(PredictionContext = exports.PredictionContext || (exports.PredictionContext = {}));
-//# sourceMappingURL=PredictionContext.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/PredictionContext.js.map b/node_modules/antlr4ts/atn/PredictionContext.js.map
deleted file mode 100644
index 7dd1673..0000000
--- a/node_modules/antlr4ts/atn/PredictionContext.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"PredictionContext.js","sourceRoot":"","sources":["../../../src/atn/PredictionContext.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAGxD,2DAAwD;AACxD,2DAAwD;AACxD,2CAAwC;AAIxC,mDAAgD;AAChD,8CAAkD;AAElD,qEAAkE;AAKlE,iCAAiC;AAEjC,MAAM,YAAY,GAAW,CAAC,CAAC;AAE/B;IAwBC,YAAY,cAAsB;QACjC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;IACtC,CAAC;IAES,MAAM,CAAC,sBAAsB;QACtC,IAAI,IAAI,GAAW,uBAAU,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;QACvD,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAES,MAAM,CAAC,uBAAuB,CAAC,MAAyB,EAAE,WAAmB;QACtF,IAAI,IAAI,GAAW,uBAAU,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;QACvD,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACvC,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAC5C,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAES,MAAM,CAAC,iBAAiB,CAAC,OAA4B,EAAE,YAAsB;QACtF,IAAI,IAAI,GAAW,uBAAU,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;QAEvD,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC;YAC5B,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACxC,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,WAAW,IAAI,YAAY,CAAC,CAAC,CAAC;YACtC,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAC7C,CAAC;QAED,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;QACnD,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAeD,MAAM,CAAC,eAAe,CAAC,GAAQ,EAAE,YAAyB,EAAE,cAAuB,IAAI;QACtF,EAAE,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,WAAW,GAAG,iBAAiB,CAAC,UAAU,GAAG,iBAAiB,CAAC,WAAW,CAAC;QACnF,CAAC;QAED,IAAI,MAAyB,CAAC;QAC9B,EAAE,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC;YAC1B,MAAM,GAAG,iBAAiB,CAAC,eAAe,CAAC,GAAG,EAAE,YAAY,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QACpF,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,MAAM,GAAG,WAAW,GAAG,iBAAiB,CAAC,UAAU,GAAG,iBAAiB,CAAC,WAAW,CAAC;QACrF,CAAC;QAED,IAAI,KAAK,GAAa,GAAG,CAAC,MAAM,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;QAC7D,IAAI,UAAU,GAAmB,KAAK,CAAC,UAAU,CAAC,CAAC,CAAmB,CAAC;QACvE,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;IAC5D,CAAC;IAEO,MAAM,CAAC,eAAe,CAAC,OAA0B;QACxD,MAAM,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC;IAClC,CAAC;IAEO,MAAM,CAAC,kBAAkB,CAAC,OAA0B;QAC3D,MAAM,CAAC,OAAO,CAAC,kBAAkB,EAAE,CAAC;IACrC,CAAC;IAED,MAAM,CAAC,IAAI,CAAU,QAA2B,EAAW,QAA2B,EAAW,eAAuC,+CAAsB,CAAC,QAAQ;QACtK,EAAE,CAAC,CAAC,QAAQ,IAAI,QAAQ,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,QAAQ,CAAC;QACjB,CAAC;QAED,EAAE,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC;YACtB,MAAM,CAAC,iBAAiB,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAG,QAAQ,GAAG,iBAAiB,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;QAC1G,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,iBAAiB,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAG,QAAQ,GAAG,iBAAiB,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;QAC1G,CAAC;QAED,IAAI,YAAY,GAAW,QAAQ,CAAC,IAAI,CAAC;QACzC,IAAI,YAAY,GAAW,QAAQ,CAAC,IAAI,CAAC;QACzC,EAAE,CAAC,CAAC,YAAY,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,IAAI,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3G,IAAI,MAAM,GAAsB,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YAChG,EAAE,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,QAAQ,CAAC;YACjB,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,CAAC,QAAQ,CAAC;YACjB,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YACpD,CAAC;QACF,CAAC;QAED,IAAI,KAAK,GAAW,CAAC,CAAC;QACtB,IAAI,WAAW,GAAwB,IAAI,KAAK,CAAoB,YAAY,GAAG,YAAY,CAAC,CAAC;QACjG,IAAI,gBAAgB,GAAa,IAAI,KAAK,CAAS,WAAW,CAAC,MAAM,CAAC,CAAC;QACvE,IAAI,SAAS,GAAW,CAAC,CAAC;QAC1B,IAAI,UAAU,GAAW,CAAC,CAAC;QAC3B,IAAI,aAAa,GAAY,IAAI,CAAC;QAClC,IAAI,cAAc,GAAY,IAAI,CAAC;QACnC,OAAO,SAAS,GAAG,YAAY,IAAI,UAAU,GAAG,YAAY,EAAE,CAAC;YAC9D,EAAE,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC,SAAS,CAAC,KAAK,QAAQ,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBAChF,WAAW,CAAC,KAAK,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,QAAQ,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC;gBACtG,gBAAgB,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;gBAC7D,aAAa,GAAG,aAAa,IAAI,WAAW,CAAC,KAAK,CAAC,KAAK,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;gBACtF,cAAc,GAAG,cAAc,IAAI,WAAW,CAAC,KAAK,CAAC,KAAK,QAAQ,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;gBACzF,SAAS,EAAE,CAAC;gBACZ,UAAU,EAAE,CAAC;YACd,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC,SAAS,CAAC,GAAG,QAAQ,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBACrF,WAAW,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;gBACnD,gBAAgB,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;gBAC7D,cAAc,GAAG,KAAK,CAAC;gBACvB,SAAS,EAAE,CAAC;YACb,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,MAAM,CAAC,QAAQ,CAAC,cAAc,CAAC,UAAU,CAAC,GAAG,QAAQ,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,CAAC;gBACjF,WAAW,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;gBACpD,gBAAgB,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;gBAC9D,aAAa,GAAG,KAAK,CAAC;gBACtB,UAAU,EAAE,CAAC;YACd,CAAC;YAED,KAAK,EAAE,CAAC;QACT,CAAC;QAED,OAAO,SAAS,GAAG,YAAY,EAAE,CAAC;YACjC,WAAW,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;YACnD,gBAAgB,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;YAC7D,SAAS,EAAE,CAAC;YACZ,cAAc,GAAG,KAAK,CAAC;YACvB,KAAK,EAAE,CAAC;QACT,CAAC;QAED,OAAO,UAAU,GAAG,YAAY,EAAE,CAAC;YAClC,WAAW,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;YACpD,gBAAgB,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;YAC9D,UAAU,EAAE,CAAC;YACb,aAAa,GAAG,KAAK,CAAC;YACtB,KAAK,EAAE,CAAC;QACT,CAAC;QAED,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC;YACnB,MAAM,CAAC,QAAQ,CAAC;QACjB,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,QAAQ,CAAC;QACjB,CAAC;QAED,EAAE,CAAC,CAAC,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;YAChC,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAC1C,gBAAgB,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACrD,CAAC;QAED,EAAE,CAAC,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;YAC9B,+FAA+F;YAC/F,MAAM,CAAC,iBAAiB,CAAC,UAAU,CAAC;QACrC,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,IAAI,0BAA0B,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5E,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,MAAM,CAAC,IAAI,sBAAsB,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAAC;QAClE,CAAC;IACF,CAAC;IAED,MAAM,CAAC,YAAY,CAAC,OAA0B;QAC7C,MAAM,CAAC,OAAO,KAAK,iBAAiB,CAAC,WAAW,CAAC;IAClD,CAAC;IAED,MAAM,CAAC,gBAAgB,CACb,OAA0B,EAC1B,YAAkE,EAClE,OAA0C;QACnD,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;YACrB,MAAM,CAAC,OAAO,CAAC;QAChB,CAAC;QAED,IAAI,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACpC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,QAAQ,CAAC;QACjB,CAAC;QAED,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACrC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;YACd,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;YAC/B,MAAM,CAAC,QAAQ,CAAC;QACjB,CAAC;QAED,IAAI,OAAO,GAAY,KAAK,CAAC;QAC7B,IAAI,OAAO,GAAwB,IAAI,KAAK,CAAoB,OAAO,CAAC,IAAI,CAAC,CAAC;QAC9E,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,MAAM,GAAsB,iBAAiB,CAAC,gBAAgB,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,OAAO,CAAC,CAAC;YAChH,EAAE,CAAC,CAAC,OAAO,IAAI,MAAM,KAAK,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChD,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;oBACd,OAAO,GAAG,IAAI,KAAK,CAAoB,OAAO,CAAC,IAAI,CAAC,CAAC;oBACrD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;wBACvC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;oBACnC,CAAC;oBAED,OAAO,GAAG,IAAI,CAAC;gBAChB,CAAC;gBAED,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;YACrB,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YACd,QAAQ,GAAG,YAAY,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACtD,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,IAAI,IAAI,GAAG,QAAQ,GAAG,OAAO,CAAC,CAAC;YAC5D,MAAM,CAAC,OAAO,CAAC;QAChB,CAAC;QAED,8FAA8F;QAC9F,IAAI,OAA0B,CAAC;QAC/B,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1B,OAAO,GAAG,IAAI,0BAA0B,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;QACjF,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,YAAY,GAAa,IAAI,KAAK,CAAS,OAAO,CAAC,IAAI,CAAC,CAAC;YAC7D,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;YAC7C,CAAC;YAED,OAAO,GAAG,IAAI,sBAAsB,CAAC,OAAO,EAAE,YAAY,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;QACjF,CAAC;QAED,QAAQ,GAAG,YAAY,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACtD,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,IAAI,OAAO,CAAC,CAAC;QAC1C,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,IAAI,OAAO,CAAC,CAAC;QAE1C,MAAM,CAAC,OAAO,CAAC;IAChB,CAAC;IAED,mBAAmB,CAAC,aAAqB,EAAE,YAAoC;QAC9E,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC,UAAU,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,YAAY,CAAC,CAAC;IAC/F,CAAC;IAID,QAAQ,CAAC,WAAmB;QAC3B,MAAM,CAAC,IAAI,0BAA0B,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IAC1D,CAAC;IAOD,QAAQ;QACP,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC;IAC5B,CAAC;IAKD,SAAS,CAAC,UAA4C,EAAE,YAAoB,EAAE,OAA0B,iBAAiB,CAAC,UAAU;QACnI,IAAI,MAAM,GAAa,EAAE,CAAC;QAE1B,KAAK,EACL,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,GAAI,IAAI,EAAE,EAAE,CAAC;YAC7B,IAAI,MAAM,GAAW,CAAC,CAAC;YACvB,IAAI,IAAI,GAAY,IAAI,CAAC;YACzB,IAAI,CAAC,GAAsB,IAAI,CAAC;YAChC,IAAI,WAAW,GAAW,YAAY,CAAC;YACvC,IAAI,WAAW,GAAW,EAAE,CAAC;YAC7B,WAAW,IAAI,GAAG,CAAC;YACnB,OAAO,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACjC,IAAI,KAAK,GAAW,CAAC,CAAC;gBACtB,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;oBAChB,IAAI,IAAI,GAAW,CAAC,CAAC;oBACrB,OAAO,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;wBACrC,IAAI,EAAE,CAAC;oBACR,CAAC;oBAED,IAAI,IAAI,GAAW,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;oBAC3C,KAAK,GAAG,CAAC,IAAI,IAAI,MAAM,CAAC,GAAG,IAAI,CAAC;oBAChC,IAAI,GAAG,IAAI,IAAI,KAAK,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;oBACnC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;wBACrB,QAAQ,CAAC,KAAK,CAAC;oBAChB,CAAC;oBAED,MAAM,IAAI,IAAI,CAAC;gBAChB,CAAC;gBAED,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;oBAChB,EAAE,CAAC,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;wBAC5B,iEAAiE;wBACjE,WAAW,IAAI,GAAG,CAAC;oBACpB,CAAC;oBAED,IAAI,GAAG,GAAQ,UAAU,CAAC,GAAG,CAAC;oBAC9B,IAAI,CAAC,GAAa,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;oBAC1C,IAAI,QAAQ,GAAW,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;oBACzD,WAAW,IAAI,QAAQ,CAAC;gBACzB,CAAC;gBAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,KAAK,iBAAiB,CAAC,oBAAoB,CAAC,CAAC,CAAC;oBAC/E,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;wBAChB,EAAE,CAAC,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;4BAC5B,iEAAiE;4BACjE,WAAW,IAAI,GAAG,CAAC;wBACpB,CAAC;wBAED,WAAW,IAAI,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;oBACxC,CAAC;gBACF,CAAC;gBAED,WAAW,GAAG,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;gBACtC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;YAED,WAAW,IAAI,GAAG,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAEzB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBACV,KAAK,CAAC;YACP,CAAC;QACF,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;CACD;AAvEA;IADC,qBAAQ;iDAGR;AAhLD;IAAa,WAAA,oBAAO,CAAA,EAA+B,WAAA,oBAAO,CAAA,EAA+B,WAAA,oBAAO,CAAA;mCA0F/F;AAMD;IACE,WAAA,oBAAO,CAAA;IACP,WAAA,oBAAO,CAAA;IACP,WAAA,oBAAO,CAAA;+CA0DR;AA5PF,8CAoVC;AAED,4BAA6B,SAAQ,iBAAiB;IAGrD,YAAY,WAAoB;QAC/B,KAAK,CAAC,iBAAiB,CAAC,sBAAsB,EAAE,CAAC,CAAC;QAClD,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IAChC,CAAC;IAED,IAAI,aAAa;QAChB,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC;IACzB,CAAC;IAGS,eAAe;QACxB,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAGS,kBAAkB;QAC3B,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;IACjE,CAAC;IAGD,SAAS,CAAC,KAAa;QACtB,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;IACxC,CAAC;IAGD,cAAc,CAAC,KAAa;QAC3B,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;IACxC,CAAC;IAGD,eAAe,CAAC,WAAmB;QAClC,MAAM,CAAC,CAAC,CAAC,CAAC;IACX,CAAC;IAGD,IAAI,IAAI;QACP,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAGD,mBAAmB,CAAC,aAAqB,EAAE,YAAoC;QAC9E,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACnD,CAAC;IAGD,aAAa,CAAC,MAAyB,EAAE,YAAoC;QAC5E,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAGD,IAAI,OAAO;QACV,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAGD,IAAI,QAAQ;QACX,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAGD,MAAM,CAAC,CAAM;QACZ,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC;IACnB,CAAC;IAGD,SAAS,CAAC,UAAe,EAAE,YAAoB,EAAE,IAAwB;QACxE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;IACf,CAAC;CAED;AA3DA;IADC,qBAAQ;6DAGR;AAGD;IADC,qBAAQ;gEAGR;AAGD;IADC,qBAAQ;uDAGR;AAGD;IADC,qBAAQ;4DAGR;AAGD;IADC,qBAAQ;6DAGR;AAGD;IADC,qBAAQ;kDAGR;AAGD;IADC,qBAAQ;iEAGR;AAGD;IADC,qBAAQ;2DAGR;AAGD;IADC,qBAAQ;qDAGR;AAGD;IADC,qBAAQ;sDAGR;AAGD;IADC,qBAAQ;oDAGR;AAGD;IADC,qBAAQ;uDAGR;AAIF,IAAM,sBAAsB,GAA5B,4BAA6B,SAAQ,iBAAiB;IAOrD,YAAsB,OAA4B,EAAE,YAAsB,EAAE,QAAiB;QAC5F,KAAK,CAAC,QAAQ,IAAI,iBAAiB,CAAC,iBAAiB,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC;QAC9E,MAAM,CAAC,OAAO,CAAC,MAAM,KAAK,YAAY,CAAC,MAAM,CAAC,CAAC;QAC/C,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,iBAAiB,CAAC,oBAAoB,EAAE,kDAAkD,CAAC,CAAC;QAElJ,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;IAClC,CAAC;IAGD,SAAS,CAAC,KAAa;QACtB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAGD,cAAc,CAAC,KAAa;QAC3B,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAGD,eAAe,CAAC,WAAmB;QAClC,MAAM,CAAC,eAAM,CAAC,YAAY,CAAC,IAAI,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC;IAC5D,CAAC;IAGD,IAAI,IAAI;QACP,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;IACjC,CAAC;IAGD,IAAI,OAAO;QACV,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAGD,IAAI,QAAQ;QACX,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,iBAAiB,CAAC,oBAAoB,CAAC;IACnG,CAAC;IAGS,eAAe;QACxB,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAED,IAAI,QAAQ,GAAwB,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1D,IAAI,aAAa,GAAa,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACzD,QAAQ,CAAC,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;QAC5C,aAAa,CAAC,IAAI,CAAC,iBAAiB,CAAC,oBAAoB,CAAC,CAAC;QAC3D,MAAM,CAAC,IAAI,sBAAsB,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;IAC5D,CAAC;IAGS,kBAAkB;QAC3B,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAED,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,CAAC,IAAI,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9E,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,QAAQ,GAAwB,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACnF,IAAI,aAAa,GAAa,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACvF,MAAM,CAAC,IAAI,sBAAsB,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;QAC5D,CAAC;IACF,CAAC;IAGD,aAAa,CAAC,MAAyB,EAAE,YAAoC;QAC5E,MAAM,CAAC,sBAAsB,CAAC,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,iBAAiB,CAAC,eAAe,EAAE,CAAC,CAAC;IACxG,CAAC;IAEO,MAAM,CAAC,iBAAiB,CAAC,OAA0B,EAAE,MAAyB,EAAE,OAA0C;QACjI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;YACpB,EAAE,CAAC,CAAC,iBAAiB,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC5C,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;oBACtB,MAAM,CAAC,iBAAiB,CAAC,WAAW,CAAC;gBACtC,CAAC;gBAED,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAC;YACrC,CAAC;YAED,MAAM,CAAC,OAAO,CAAC;QAChB,CAAC;QAED,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;QAClE,CAAC;QAED,IAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAClC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YACb,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;gBACrB,MAAM,GAAG,MAAM,CAAC;YACjB,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,IAAI,WAAW,GAAW,OAAO,CAAC,IAAI,CAAC;gBACvC,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;oBACtB,WAAW,EAAE,CAAC;gBACf,CAAC;gBAED,IAAI,cAAc,GAAwB,IAAI,KAAK,CAAoB,WAAW,CAAC,CAAC;gBACpF,IAAI,mBAAmB,GAAa,IAAI,KAAK,CAAS,WAAW,CAAC,CAAC;gBACnE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;oBACtC,mBAAmB,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;gBACpD,CAAC;gBAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;oBACtC,cAAc,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,iBAAiB,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACrG,CAAC;gBAED,EAAE,CAAC,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;oBACjC,MAAM,GAAG,IAAI,0BAA0B,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpF,CAAC;gBAAC,IAAI,CAAC,CAAC;oBACP,MAAM,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBAClC,MAAM,GAAG,IAAI,sBAAsB,CAAC,cAAc,EAAE,mBAAmB,CAAC,CAAC;gBAC1E,CAAC;gBAED,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;oBACtB,MAAM,GAAG,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBACjD,CAAC;YACF,CAAC;YAED,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAC9B,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAGD,MAAM,CAAC,CAAM;QACZ,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,sBAAsB,CAAC,CAAC,CAAC,CAAC;YACnD,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YACtC,qCAAqC;YACrC,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,IAAI,KAAK,GAA2B,CAAC,CAAC;QACtC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,+BAAc,EAAuE,CAAC,CAAC;IAC1H,CAAC;IAEO,UAAU,CAAC,KAA6B,EAAE,OAAqF;QACtI,IAAI,YAAY,GAAwB,EAAE,CAAC;QAC3C,IAAI,aAAa,GAAwB,EAAE,CAAC;QAC5C,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1B,OAAO,IAAI,EAAE,CAAC;YACb,IAAI,WAAW,GAAG,YAAY,CAAC,GAAG,EAAE,CAAC;YACrC,IAAI,YAAY,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC;YACvC,EAAE,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;gBACnC,KAAK,CAAC;YACP,CAAC;YAED,IAAI,QAAQ,GAAwE,IAAI,+CAAsB,CAAC,4CAA4C,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;YACvL,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC5B,QAAQ,CAAC;YACV,CAAC;YAED,IAAI,QAAQ,GAAW,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;YACvC,EAAE,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC;gBACpB,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACpC,MAAM,CAAC,KAAK,CAAC;gBACd,CAAC;gBAED,QAAQ,CAAC;YACV,CAAC;YAED,IAAI,SAAS,GAAW,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;YACxC,EAAE,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC;gBAC5B,MAAM,CAAC,KAAK,CAAC;YACd,CAAC;YAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnE,MAAM,CAAC,KAAK,CAAC;gBACd,CAAC;gBAED,IAAI,UAAU,GAAsB,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAC5D,IAAI,WAAW,GAAsB,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAC7D,EAAE,CAAC,CAAC,UAAU,CAAC,QAAQ,EAAE,KAAK,WAAW,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;oBACtD,MAAM,CAAC,KAAK,CAAC;gBACd,CAAC;gBAED,EAAE,CAAC,CAAC,UAAU,KAAK,WAAW,CAAC,CAAC,CAAC;oBAChC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAC9B,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBACjC,CAAC;YACF,CAAC;QACF,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;CACD,CAAA;AAxMA;IADC,oBAAO;uDACqB;AAG7B;IADC,oBAAO;4DACe;AAYvB;IADC,qBAAQ;uDAGR;AAGD;IADC,qBAAQ;4DAGR;AAGD;IADC,qBAAQ;6DAGR;AAGD;IADC,qBAAQ;kDAGR;AAGD;IADC,qBAAQ;qDAGR;AAGD;IADC,qBAAQ;sDAGR;AAGD;IADC,qBAAQ;6DAWR;AAGD;IADC,qBAAQ;gEAaR;AAGD;IADC,qBAAQ;2DAGR;AA0DD;IADC,qBAAQ;oDAeR;AArJI,sBAAsB;IAOb,WAAA,oBAAO,CAAA;GAPhB,sBAAsB,CA0M3B;AAED,IAAa,0BAA0B,GAAvC,gCAAwC,SAAQ,iBAAiB;IAMhE,YAAqB,MAAyB,EAAE,WAAmB;QAClE,KAAK,CAAC,iBAAiB,CAAC,uBAAuB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC;QACtE,2HAA2H;QAC3H,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IAChC,CAAC;IAGD,SAAS,CAAC,KAAa;QACtB,sBAAsB;QACtB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IAGD,cAAc,CAAC,KAAa;QAC3B,sBAAsB;QACtB,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC;IACzB,CAAC;IAGD,eAAe,CAAC,WAAmB;QAClC,MAAM,CAAC,IAAI,CAAC,WAAW,KAAK,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAClD,CAAC;IAGD,IAAI,IAAI;QACP,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAGD,IAAI,OAAO;QACV,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAGD,IAAI,QAAQ;QACX,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAGD,aAAa,CAAC,MAAyB,EAAE,YAAoC;QAC5E,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,EAAE,YAAY,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IACjG,CAAC;IAGS,eAAe;QACxB,IAAI,OAAO,GAAwB,CAAC,IAAI,CAAC,MAAM,EAAE,iBAAiB,CAAC,UAAU,CAAC,CAAC;QAC/E,IAAI,YAAY,GAAa,CAAC,IAAI,CAAC,WAAW,EAAE,iBAAiB,CAAC,oBAAoB,CAAC,CAAC;QACxF,MAAM,CAAC,IAAI,sBAAsB,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;IAC1D,CAAC;IAGS,kBAAkB;QAC3B,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAGD,MAAM,CAAC,CAAM;QACZ,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,0BAA0B,CAAC,CAAC,CAAC,CAAC;YACvD,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,IAAI,KAAK,GAA+B,CAAC,CAAC;QAC1C,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,WAAW,KAAK,KAAK,CAAC,WAAW;eACzC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;CACD,CAAA;AA3EA;IADC,oBAAO;0DACkB;AAW1B;IADC,qBAAQ;2DAIR;AAGD;IADC,qBAAQ;gEAIR;AAGD;IADC,qBAAQ;iEAGR;AAGD;IADC,qBAAQ;sDAGR;AAGD;IADC,qBAAQ;yDAGR;AAGD;IADC,qBAAQ;0DAGR;AAGD;IADC,qBAAQ;+DAGR;AAGD;IADC,qBAAQ;iEAKR;AAGD;IADC,qBAAQ;oEAGR;AAGD;IADC,qBAAQ;wDAeR;AA7EW,0BAA0B;IAMzB,WAAA,oBAAO,CAAA;GANR,0BAA0B,CA8EtC;AA9EY,gEAA0B;AAgFvC,WAAiB,iBAAiB;IACpB,6BAAW,GAAsB,IAAI,sBAAsB,CAAC,KAAK,CAAC,CAAA;IAClE,4BAAU,GAAsB,IAAI,sBAAsB,CAAC,IAAI,CAAC,CAAC;IACjE,uCAAqB,GAAW,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;IACnD,sCAAoB,GAAW,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;IAElE,qBAA6B,SAAQ,+BAAoD;QACxF;YACC,KAAK,CAAC,0BAA0B,CAAC,QAAQ,CAAC,CAAC;QAC5C,CAAC;KACD;IAJY,iCAAe,kBAI3B,CAAA;IAED;QAGS,0BAA0B;QAClC,CAAC;QAGD,QAAQ,CAAC,GAAsB;YAC9B,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACvB,CAAC;QAGD,MAAM,CAAC,CAAoB,EAAE,CAAoB;YAChD,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC;QAChB,CAAC;;IAbe,mCAAQ,GAA+B,IAAI,0BAA0B,EAAE,CAAC;IAMxF;QADC,qBAAQ;8DAGR;IAGD;QADC,qBAAQ;4DAGR;IAdW,4CAA0B,6BAetC,CAAA;AACF,CAAC,EA5BgB,iBAAiB,GAAjB,yBAAiB,KAAjB,yBAAiB,QA4BjC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/PredictionContextCache.d.ts b/node_modules/antlr4ts/atn/PredictionContextCache.d.ts
deleted file mode 100644
index 390640c..0000000
--- a/node_modules/antlr4ts/atn/PredictionContextCache.d.ts
+++ /dev/null
@@ -1,40 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { PredictionContext } from './PredictionContext';
-/** Used to cache {@link PredictionContext} objects. Its used for the shared
- * context cash associated with contexts in DFA states. This cache
- * can be used for both lexers and parsers.
- *
- * @author Sam Harwell
- */
-export declare class PredictionContextCache {
- static UNCACHED: PredictionContextCache;
- private contexts;
- private childContexts;
- private joinContexts;
- private enableCache;
- constructor(enableCache?: boolean);
- getAsCached(context: PredictionContext): PredictionContext;
- getChild(context: PredictionContext, invokingState: number): PredictionContext;
- join(x: PredictionContext, y: PredictionContext): PredictionContext;
-}
-export declare namespace PredictionContextCache {
- class PredictionContextAndInt {
- private obj;
- private value;
- constructor(obj: PredictionContext, value: number);
- equals(obj: any): boolean;
- hashCode(): number;
- }
- class IdentityCommutativePredictionContextOperands {
- private _x;
- private _y;
- constructor(x: PredictionContext, y: PredictionContext);
- readonly x: PredictionContext;
- readonly y: PredictionContext;
- equals(o: any): boolean;
- hashCode(): number;
- }
-}
diff --git a/node_modules/antlr4ts/atn/PredictionContextCache.js b/node_modules/antlr4ts/atn/PredictionContextCache.js
deleted file mode 100644
index 87a3557..0000000
--- a/node_modules/antlr4ts/atn/PredictionContextCache.js
+++ /dev/null
@@ -1,139 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:35.6390614-07:00
-const Array2DHashMap_1 = require("../misc/Array2DHashMap");
-const Decorators_1 = require("../Decorators");
-const ObjectEqualityComparator_1 = require("../misc/ObjectEqualityComparator");
-const PredictionContext_1 = require("./PredictionContext");
-const assert = require("assert");
-/** Used to cache {@link PredictionContext} objects. Its used for the shared
- * context cash associated with contexts in DFA states. This cache
- * can be used for both lexers and parsers.
- *
- * @author Sam Harwell
- */
-class PredictionContextCache {
- constructor(enableCache = true) {
- this.contexts = new Array2DHashMap_1.Array2DHashMap(ObjectEqualityComparator_1.ObjectEqualityComparator.INSTANCE);
- this.childContexts = new Array2DHashMap_1.Array2DHashMap(ObjectEqualityComparator_1.ObjectEqualityComparator.INSTANCE);
- this.joinContexts = new Array2DHashMap_1.Array2DHashMap(ObjectEqualityComparator_1.ObjectEqualityComparator.INSTANCE);
- this.enableCache = enableCache;
- }
- getAsCached(context) {
- if (!this.enableCache) {
- return context;
- }
- let result = this.contexts.get(context);
- if (!result) {
- result = context;
- this.contexts.put(context, context);
- }
- return result;
- }
- getChild(context, invokingState) {
- if (!this.enableCache) {
- return context.getChild(invokingState);
- }
- let operands = new PredictionContextCache.PredictionContextAndInt(context, invokingState);
- let result = this.childContexts.get(operands);
- if (!result) {
- result = context.getChild(invokingState);
- result = this.getAsCached(result);
- this.childContexts.put(operands, result);
- }
- return result;
- }
- join(x, y) {
- if (!this.enableCache) {
- return PredictionContext_1.PredictionContext.join(x, y, this);
- }
- let operands = new PredictionContextCache.IdentityCommutativePredictionContextOperands(x, y);
- let result = this.joinContexts.get(operands);
- if (result) {
- return result;
- }
- result = PredictionContext_1.PredictionContext.join(x, y, this);
- result = this.getAsCached(result);
- this.joinContexts.put(operands, result);
- return result;
- }
-}
-PredictionContextCache.UNCACHED = new PredictionContextCache(false);
-exports.PredictionContextCache = PredictionContextCache;
-(function (PredictionContextCache) {
- class PredictionContextAndInt {
- constructor(obj, value) {
- this.obj = obj;
- this.value = value;
- }
- equals(obj) {
- if (!(obj instanceof PredictionContextAndInt)) {
- return false;
- }
- else if (obj == this) {
- return true;
- }
- let other = obj;
- return this.value === other.value
- && (this.obj === other.obj || (this.obj != null && this.obj.equals(other.obj)));
- }
- hashCode() {
- let hashCode = 5;
- hashCode = 7 * hashCode + (this.obj != null ? this.obj.hashCode() : 0);
- hashCode = 7 * hashCode + this.value;
- return hashCode;
- }
- }
- __decorate([
- Decorators_1.Override
- ], PredictionContextAndInt.prototype, "equals", null);
- __decorate([
- Decorators_1.Override
- ], PredictionContextAndInt.prototype, "hashCode", null);
- PredictionContextCache.PredictionContextAndInt = PredictionContextAndInt;
- class IdentityCommutativePredictionContextOperands {
- constructor(x, y) {
- assert(x != null);
- assert(y != null);
- this._x = x;
- this._y = y;
- }
- get x() {
- return this._x;
- }
- get y() {
- return this._y;
- }
- equals(o) {
- if (!(o instanceof IdentityCommutativePredictionContextOperands)) {
- return false;
- }
- else if (this === o) {
- return true;
- }
- let other = o;
- return (this._x === other._x && this._y === other._y) || (this._x === other._y && this._y === other._x);
- }
- hashCode() {
- return this._x.hashCode() ^ this._y.hashCode();
- }
- }
- __decorate([
- Decorators_1.Override
- ], IdentityCommutativePredictionContextOperands.prototype, "equals", null);
- __decorate([
- Decorators_1.Override
- ], IdentityCommutativePredictionContextOperands.prototype, "hashCode", null);
- PredictionContextCache.IdentityCommutativePredictionContextOperands = IdentityCommutativePredictionContextOperands;
-})(PredictionContextCache = exports.PredictionContextCache || (exports.PredictionContextCache = {}));
-//# sourceMappingURL=PredictionContextCache.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/PredictionContextCache.js.map b/node_modules/antlr4ts/atn/PredictionContextCache.js.map
deleted file mode 100644
index 72119b1..0000000
--- a/node_modules/antlr4ts/atn/PredictionContextCache.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"PredictionContextCache.js","sourceRoot":"","sources":["../../../src/atn/PredictionContextCache.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAEH,wDAAwD;AAExD,2DAAwD;AACxD,8CAAyC;AAEzC,+EAA4E;AAC5E,2DAAwD;AACxD,iCAAiC;AAEjC;;;;;GAKG;AACH;IAYC,YAAY,cAAuB,IAAI;QAT/B,aAAQ,GACf,IAAI,+BAAc,CAAuC,mDAAwB,CAAC,QAAQ,CAAC,CAAC;QACrF,kBAAa,GACpB,IAAI,+BAAc,CAAoE,mDAAwB,CAAC,QAAQ,CAAC,CAAC;QAClH,iBAAY,GACnB,IAAI,+BAAc,CAAyF,mDAAwB,CAAC,QAAQ,CAAC,CAAC;QAK9I,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IAChC,CAAC;IAED,WAAW,CAAC,OAA0B;QACrC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YACvB,MAAM,CAAC,OAAO,CAAC;QAChB,CAAC;QAED,IAAI,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACxC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YACb,MAAM,GAAG,OAAO,CAAC;YACjB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACrC,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAED,QAAQ,CAAC,OAA0B,EAAE,aAAqB;QACzD,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YACvB,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;QACxC,CAAC;QAED,IAAI,QAAQ,GAAmD,IAAI,sBAAsB,CAAC,uBAAuB,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;QAC1I,IAAI,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC9C,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YACb,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;YACzC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAClC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAC1C,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAED,IAAI,CAAC,CAAoB,EAAE,CAAoB;QAC9C,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YACvB,MAAM,CAAC,qCAAiB,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAC3C,CAAC;QAED,IAAI,QAAQ,GAAwE,IAAI,sBAAsB,CAAC,4CAA4C,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClK,IAAI,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC7C,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAED,MAAM,GAAG,qCAAiB,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAC5C,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACxC,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;;AA5DM,+BAAQ,GAA2B,IAAI,sBAAsB,CAAC,KAAK,CAAC,CAAC;AAD7E,wDA8DC;AAED,WAAiB,sBAAsB;IACtC;QAIC,YAAY,GAAsB,EAAE,KAAa;YAChD,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;YACf,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACpB,CAAC;QAGD,MAAM,CAAC,GAAQ;YACd,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,uBAAuB,CAAC,CAAC,CAAC,CAAC;gBAC/C,MAAM,CAAC,KAAK,CAAC;YACd,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC;gBACxB,MAAM,CAAC,IAAI,CAAC;YACb,CAAC;YAED,IAAI,KAAK,GAA4B,GAAG,CAAC;YACzC,MAAM,CAAC,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK;mBAC7B,CAAC,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClF,CAAC;QAGD,QAAQ;YACP,IAAI,QAAQ,GAAW,CAAC,CAAC;YACzB,QAAQ,GAAG,CAAC,GAAG,QAAQ,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC;YACvE,QAAQ,GAAG,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YACrC,MAAM,CAAC,QAAQ,CAAC;QACjB,CAAC;KACD;IAnBA;QADC,qBAAQ;yDAWR;IAGD;QADC,qBAAQ;2DAMR;IA5BW,8CAAuB,0BA6BnC,CAAA;IAED;QAIC,YAAY,CAAoB,EAAE,CAAoB;YACrD,MAAM,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;YAClB,MAAM,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;YAClB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;YACZ,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACb,CAAC;QAED,IAAI,CAAC;YACJ,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QAChB,CAAC;QAED,IAAI,CAAC;YACJ,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QAChB,CAAC;QAGD,MAAM,CAAC,CAAM;YACZ,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,4CAA4C,CAAC,CAAC,CAAC,CAAC;gBAClE,MAAM,CAAC,KAAK,CAAC;YACd,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;gBACvB,MAAM,CAAC,IAAI,CAAC;YACb,CAAC;YAED,IAAI,KAAK,GAAiD,CAAC,CAAC;YAC5D,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,CAAC,CAAC;QACzG,CAAC;QAGD,QAAQ;YACP,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC;QAChD,CAAC;KACD;IAfA;QADC,qBAAQ;8EAUR;IAGD;QADC,qBAAQ;gFAGR;IAlCW,mEAA4C,+CAmCxD,CAAA;AACF,CAAC,EApEgB,sBAAsB,GAAtB,8BAAsB,KAAtB,8BAAsB,QAoEtC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/PredictionMode.d.ts b/node_modules/antlr4ts/atn/PredictionMode.d.ts
deleted file mode 100644
index bc69ca3..0000000
--- a/node_modules/antlr4ts/atn/PredictionMode.d.ts
+++ /dev/null
@@ -1,95 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNConfigSet } from './ATNConfigSet';
-/**
- * This enumeration defines the prediction modes available in ANTLR 4 along with
- * utility methods for analyzing configuration sets for conflicts and/or
- * ambiguities.
- */
-export declare enum PredictionMode {
- /**
- * The SLL(*) prediction mode. This prediction mode ignores the current
- * parser context when making predictions. This is the fastest prediction
- * mode, and provides correct results for many grammars. This prediction
- * mode is more powerful than the prediction mode provided by ANTLR 3, but
- * may result in syntax errors for grammar and input combinations which are
- * not SLL.
- *
- *
- * When using this prediction mode, the parser will either return a correct
- * parse tree (i.e. the same parse tree that would be returned with the
- * {@link #LL} prediction mode), or it will report a syntax error. If a
- * syntax error is encountered when using the {@link #SLL} prediction mode,
- * it may be due to either an actual syntax error in the input or indicate
- * that the particular combination of grammar and input requires the more
- * powerful {@link #LL} prediction abilities to complete successfully.
- *
- *
- * This prediction mode does not provide any guarantees for prediction
- * behavior for syntactically-incorrect inputs.
- */
- SLL = 0,
- /**
- * The LL(*) prediction mode. This prediction mode allows the current parser
- * context to be used for resolving SLL conflicts that occur during
- * prediction. This is the fastest prediction mode that guarantees correct
- * parse results for all combinations of grammars with syntactically correct
- * inputs.
- *
- *
- * When using this prediction mode, the parser will make correct decisions
- * for all syntactically-correct grammar and input combinations. However, in
- * cases where the grammar is truly ambiguous this prediction mode might not
- * report a precise answer for exactly which alternatives are
- * ambiguous.
- *
- *
- * This prediction mode does not provide any guarantees for prediction
- * behavior for syntactically-incorrect inputs.
- */
- LL = 1,
- /**
- * The LL(*) prediction mode with exact ambiguity detection. In addition to
- * the correctness guarantees provided by the {@link #LL} prediction mode,
- * this prediction mode instructs the prediction algorithm to determine the
- * complete and exact set of ambiguous alternatives for every ambiguous
- * decision encountered while parsing.
- *
- *
- * This prediction mode may be used for diagnosing ambiguities during
- * grammar development. Due to the performance overhead of calculating sets
- * of ambiguous alternatives, this prediction mode should be avoided when
- * the exact results are not necessary.
- *
- *
- * This prediction mode does not provide any guarantees for prediction
- * behavior for syntactically-incorrect inputs.
- */
- LL_EXACT_AMBIG_DETECTION = 2,
-}
-export declare namespace PredictionMode {
- /**
- * Checks if any configuration in {@code configs} is in a
- * {@link RuleStopState}. Configurations meeting this condition have reached
- * the end of the decision rule (local context) or end of start rule (full
- * context).
- *
- * @param configs the configuration set to test
- * @return {@code true} if any configuration in {@code configs} is in a
- * {@link RuleStopState}, otherwise {@code false}
- */
- function hasConfigInRuleStopState(configs: ATNConfigSet): boolean;
- /**
- * Checks if all configurations in {@code configs} are in a
- * {@link RuleStopState}. Configurations meeting this condition have reached
- * the end of the decision rule (local context) or end of start rule (full
- * context).
- *
- * @param configs the configuration set to test
- * @return {@code true} if all configurations in {@code configs} are in a
- * {@link RuleStopState}, otherwise {@code false}
- */
- function allConfigsInRuleStopStates(configs: ATNConfigSet): boolean;
-}
diff --git a/node_modules/antlr4ts/atn/PredictionMode.js b/node_modules/antlr4ts/atn/PredictionMode.js
deleted file mode 100644
index 2d4a81c..0000000
--- a/node_modules/antlr4ts/atn/PredictionMode.js
+++ /dev/null
@@ -1,163 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:36.2673893-07:00
-const Array2DHashMap_1 = require("../misc/Array2DHashMap");
-const Stubs_1 = require("../misc/Stubs");
-const MurmurHash_1 = require("../misc/MurmurHash");
-const Decorators_1 = require("../Decorators");
-const RuleStopState_1 = require("./RuleStopState");
-/**
- * This enumeration defines the prediction modes available in ANTLR 4 along with
- * utility methods for analyzing configuration sets for conflicts and/or
- * ambiguities.
- */
-var PredictionMode;
-(function (PredictionMode) {
- /**
- * The SLL(*) prediction mode. This prediction mode ignores the current
- * parser context when making predictions. This is the fastest prediction
- * mode, and provides correct results for many grammars. This prediction
- * mode is more powerful than the prediction mode provided by ANTLR 3, but
- * may result in syntax errors for grammar and input combinations which are
- * not SLL.
- *
- *
- * When using this prediction mode, the parser will either return a correct
- * parse tree (i.e. the same parse tree that would be returned with the
- * {@link #LL} prediction mode), or it will report a syntax error. If a
- * syntax error is encountered when using the {@link #SLL} prediction mode,
- * it may be due to either an actual syntax error in the input or indicate
- * that the particular combination of grammar and input requires the more
- * powerful {@link #LL} prediction abilities to complete successfully.
- *
- *
- * This prediction mode does not provide any guarantees for prediction
- * behavior for syntactically-incorrect inputs.
- */
- PredictionMode[PredictionMode["SLL"] = 0] = "SLL";
- /**
- * The LL(*) prediction mode. This prediction mode allows the current parser
- * context to be used for resolving SLL conflicts that occur during
- * prediction. This is the fastest prediction mode that guarantees correct
- * parse results for all combinations of grammars with syntactically correct
- * inputs.
- *
- *
- * When using this prediction mode, the parser will make correct decisions
- * for all syntactically-correct grammar and input combinations. However, in
- * cases where the grammar is truly ambiguous this prediction mode might not
- * report a precise answer for exactly which alternatives are
- * ambiguous.
- *
- *
- * This prediction mode does not provide any guarantees for prediction
- * behavior for syntactically-incorrect inputs.
- */
- PredictionMode[PredictionMode["LL"] = 1] = "LL";
- /**
- * The LL(*) prediction mode with exact ambiguity detection. In addition to
- * the correctness guarantees provided by the {@link #LL} prediction mode,
- * this prediction mode instructs the prediction algorithm to determine the
- * complete and exact set of ambiguous alternatives for every ambiguous
- * decision encountered while parsing.
- *
- *
- * This prediction mode may be used for diagnosing ambiguities during
- * grammar development. Due to the performance overhead of calculating sets
- * of ambiguous alternatives, this prediction mode should be avoided when
- * the exact results are not necessary.
- *
- *
- * This prediction mode does not provide any guarantees for prediction
- * behavior for syntactically-incorrect inputs.
- */
- PredictionMode[PredictionMode["LL_EXACT_AMBIG_DETECTION"] = 2] = "LL_EXACT_AMBIG_DETECTION";
-})(PredictionMode = exports.PredictionMode || (exports.PredictionMode = {}));
-(function (PredictionMode) {
- /** A Map that uses just the state and the stack context as the key. */
- // NOTE: Base type used to be FlexibleHashMap
- class AltAndContextMap extends Array2DHashMap_1.Array2DHashMap {
- constructor() {
- super(AltAndContextConfigEqualityComparator.INSTANCE);
- }
- }
- class AltAndContextConfigEqualityComparator {
- AltAndContextConfigEqualityComparator() {
- }
- /**
- * The hash code is only a function of the {@link ATNState#stateNumber}
- * and {@link ATNConfig#context}.
- */
- hashCode(o) {
- let hashCode = MurmurHash_1.MurmurHash.initialize(7);
- hashCode = MurmurHash_1.MurmurHash.update(hashCode, o.state.stateNumber);
- hashCode = MurmurHash_1.MurmurHash.update(hashCode, o.context);
- hashCode = MurmurHash_1.MurmurHash.finish(hashCode, 2);
- return hashCode;
- }
- equals(a, b) {
- if (a === b)
- return true;
- if (a == null || b == null)
- return false;
- return a.state.stateNumber == b.state.stateNumber
- && a.context.equals(b.context);
- }
- }
- AltAndContextConfigEqualityComparator.INSTANCE = new AltAndContextConfigEqualityComparator();
- __decorate([
- Decorators_1.Override
- ], AltAndContextConfigEqualityComparator.prototype, "hashCode", null);
- __decorate([
- Decorators_1.Override
- ], AltAndContextConfigEqualityComparator.prototype, "equals", null);
- /**
- * Checks if any configuration in {@code configs} is in a
- * {@link RuleStopState}. Configurations meeting this condition have reached
- * the end of the decision rule (local context) or end of start rule (full
- * context).
- *
- * @param configs the configuration set to test
- * @return {@code true} if any configuration in {@code configs} is in a
- * {@link RuleStopState}, otherwise {@code false}
- */
- function hasConfigInRuleStopState(configs) {
- for (let c of Stubs_1.asIterable(configs)) {
- if (c.state instanceof RuleStopState_1.RuleStopState) {
- return true;
- }
- }
- return false;
- }
- PredictionMode.hasConfigInRuleStopState = hasConfigInRuleStopState;
- /**
- * Checks if all configurations in {@code configs} are in a
- * {@link RuleStopState}. Configurations meeting this condition have reached
- * the end of the decision rule (local context) or end of start rule (full
- * context).
- *
- * @param configs the configuration set to test
- * @return {@code true} if all configurations in {@code configs} are in a
- * {@link RuleStopState}, otherwise {@code false}
- */
- function allConfigsInRuleStopStates(/*@NotNull*/ configs) {
- for (let config of Stubs_1.asIterable(configs)) {
- if (!(config.state instanceof RuleStopState_1.RuleStopState)) {
- return false;
- }
- }
- return true;
- }
- PredictionMode.allConfigsInRuleStopStates = allConfigsInRuleStopStates;
-})(PredictionMode = exports.PredictionMode || (exports.PredictionMode = {}));
-//# sourceMappingURL=PredictionMode.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/PredictionMode.js.map b/node_modules/antlr4ts/atn/PredictionMode.js.map
deleted file mode 100644
index 2d41878..0000000
--- a/node_modules/antlr4ts/atn/PredictionMode.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"PredictionMode.js","sourceRoot":"","sources":["../../../src/atn/PredictionMode.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAEH,wDAAwD;AAExD,2DAAwD;AACxD,yCAA2C;AAQ3C,mDAAgD;AAEhD,8CAAyC;AACzC,mDAAgD;AAGhD;;;;GAIG;AACH,IAAY,cA4DX;AA5DD,WAAY,cAAc;IACzB;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,iDAAG,CAAA;IACH;;;;;;;;;;;;;;;;;OAiBG;IACH,+CAAE,CAAA;IACF;;;;;;;;;;;;;;;;OAgBG;IACH,2FAAwB,CAAA;AACzB,CAAC,EA5DW,cAAc,GAAd,sBAAc,KAAd,sBAAc,QA4DzB;AAED,WAAiB,cAAc;IAC9B,uEAAuE;IACvE,gEAAgE;IAChE,sBAAuB,SAAQ,+BAAiC;QAC/D;YACC,KAAK,CAAC,qCAAqC,CAAC,QAAQ,CAAC,CAAC;QACvD,CAAC;KACD;IAED;QAGS,qCAAqC;QAC7C,CAAC;QAED;;;WAGG;QAEH,QAAQ,CAAC,CAAY;YACpB,IAAI,QAAQ,GAAW,uBAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAChD,QAAQ,GAAG,uBAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAC5D,QAAQ,GAAG,uBAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;YAClD,QAAQ,GAAG,uBAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,QAAQ,CAAC;QACjB,CAAC;QAGD,MAAM,CAAC,CAAY,EAAE,CAAY;YAChC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAAC,MAAM,CAAC,IAAI,CAAC;YACzB,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC;gBAAC,MAAM,CAAC,KAAK,CAAC;YACzC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC,KAAK,CAAC,WAAW;mBAC7C,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACjC,CAAC;;IAxBe,8CAAQ,GAA0C,IAAI,qCAAqC,EAAE,CAAC;IAU9G;QADC,qBAAQ;yEAOR;IAGD;QADC,qBAAQ;uEAMR;IAGF;;;;;;;;;OASG;IACH,kCAAyC,OAAqB;QAC7D,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,kBAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,YAAY,6BAAa,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,IAAI,CAAC;YACb,CAAC;QACF,CAAC;QAED,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IARe,uCAAwB,2BAQvC,CAAA;IAED;;;;;;;;;OASG;IACH,oCAA2C,YAAY,CAAC,OAAqB;QAC5E,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,kBAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACxC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,YAAY,6BAAa,CAAC,CAAC,CAAC,CAAC;gBAC9C,MAAM,CAAC,KAAK,CAAC;YACd,CAAC;QACF,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IARe,yCAA0B,6BAQzC,CAAA;AACF,CAAC,EA5EgB,cAAc,GAAd,sBAAc,KAAd,sBAAc,QA4E9B"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ProfilingATNSimulator.d.ts b/node_modules/antlr4ts/atn/ProfilingATNSimulator.d.ts
deleted file mode 100644
index eb420fd..0000000
--- a/node_modules/antlr4ts/atn/ProfilingATNSimulator.d.ts
+++ /dev/null
@@ -1,54 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNConfigSet } from './ATNConfigSet';
-import { BitSet } from '../misc/BitSet';
-import { DecisionInfo } from './DecisionInfo';
-import { DFA } from '../dfa/DFA';
-import { DFAState } from '../dfa/DFAState';
-import { Parser } from '../Parser';
-import { ParserATNSimulator } from './ParserATNSimulator';
-import { ParserRuleContext } from '../ParserRuleContext';
-import { PredictionContextCache } from './PredictionContextCache';
-import { SemanticContext } from './SemanticContext';
-import { SimulatorState } from './SimulatorState';
-import { TokenStream } from '../TokenStream';
-/**
- * @since 4.3
- */
-export declare class ProfilingATNSimulator extends ParserATNSimulator {
- protected decisions: DecisionInfo[];
- protected numDecisions: number;
- protected _input: TokenStream | undefined;
- protected _startIndex: number;
- protected _sllStopIndex: number;
- protected _llStopIndex: number;
- protected currentDecision: number;
- protected currentState: SimulatorState | undefined;
- /** At the point of LL failover, we record how SLL would resolve the conflict so that
- * we can determine whether or not a decision / input pair is context-sensitive.
- * If LL gives a different result than SLL's predicted alternative, we have a
- * context sensitivity for sure. The converse is not necessarily true, however.
- * It's possible that after conflict resolution chooses minimum alternatives,
- * SLL could get the same answer as LL. Regardless of whether or not the result indicates
- * an ambiguity, it is not treated as a context sensitivity because LL prediction
- * was not required in order to produce a correct prediction for this decision and input sequence.
- * It may in fact still be a context sensitivity but we don't know by looking at the
- * minimum alternatives for the current input.
- */
- protected conflictingAltResolvedBySLL: number;
- constructor(parser: Parser);
- adaptivePredict(input: TokenStream, decision: number, outerContext: ParserRuleContext): number;
- protected getStartState(dfa: DFA, input: TokenStream, outerContext: ParserRuleContext, useContext: boolean): SimulatorState | undefined;
- protected computeStartState(dfa: DFA, globalContext: ParserRuleContext, useContext: boolean): SimulatorState;
- protected computeReachSet(dfa: DFA, previous: SimulatorState, t: number, contextCache: PredictionContextCache): SimulatorState | undefined;
- protected getExistingTargetState(previousD: DFAState, t: number): DFAState | undefined;
- protected computeTargetState(dfa: DFA, s: DFAState, remainingGlobalContext: ParserRuleContext, t: number, useContext: boolean, contextCache: PredictionContextCache): [DFAState, ParserRuleContext | undefined];
- protected evalSemanticContextImpl(pred: SemanticContext, parserCallStack: ParserRuleContext, alt: number): boolean;
- protected reportContextSensitivity(dfa: DFA, prediction: number, acceptState: SimulatorState, startIndex: number, stopIndex: number): void;
- protected reportAttemptingFullContext(dfa: DFA, conflictingAlts: BitSet, conflictState: SimulatorState, startIndex: number, stopIndex: number): void;
- protected reportAmbiguity(dfa: DFA, D: DFAState, startIndex: number, stopIndex: number, exact: boolean, ambigAlts: BitSet, configs: ATNConfigSet): void;
- getDecisionInfo(): DecisionInfo[];
- getCurrentState(): SimulatorState | undefined;
-}
diff --git a/node_modules/antlr4ts/atn/ProfilingATNSimulator.js b/node_modules/antlr4ts/atn/ProfilingATNSimulator.js
deleted file mode 100644
index b758b1b..0000000
--- a/node_modules/antlr4ts/atn/ProfilingATNSimulator.js
+++ /dev/null
@@ -1,261 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:36.4188352-07:00
-const AmbiguityInfo_1 = require("./AmbiguityInfo");
-const ATN_1 = require("./ATN");
-const ATNSimulator_1 = require("./ATNSimulator");
-const ContextSensitivityInfo_1 = require("./ContextSensitivityInfo");
-const DecisionInfo_1 = require("./DecisionInfo");
-const ErrorInfo_1 = require("./ErrorInfo");
-const Decorators_1 = require("../Decorators");
-const LookaheadEventInfo_1 = require("./LookaheadEventInfo");
-const ParserATNSimulator_1 = require("./ParserATNSimulator");
-const PredicateEvalInfo_1 = require("./PredicateEvalInfo");
-const SemanticContext_1 = require("./SemanticContext");
-const SimulatorState_1 = require("./SimulatorState");
-/**
- * @since 4.3
- */
-class ProfilingATNSimulator extends ParserATNSimulator_1.ParserATNSimulator {
- constructor(parser) {
- super(parser.interpreter.atn, parser);
- this._startIndex = 0;
- this._sllStopIndex = 0;
- this._llStopIndex = 0;
- this.currentDecision = 0;
- /** At the point of LL failover, we record how SLL would resolve the conflict so that
- * we can determine whether or not a decision / input pair is context-sensitive.
- * If LL gives a different result than SLL's predicted alternative, we have a
- * context sensitivity for sure. The converse is not necessarily true, however.
- * It's possible that after conflict resolution chooses minimum alternatives,
- * SLL could get the same answer as LL. Regardless of whether or not the result indicates
- * an ambiguity, it is not treated as a context sensitivity because LL prediction
- * was not required in order to produce a correct prediction for this decision and input sequence.
- * It may in fact still be a context sensitivity but we don't know by looking at the
- * minimum alternatives for the current input.
- */
- this.conflictingAltResolvedBySLL = 0;
- this.optimize_ll1 = false;
- this.reportAmbiguities = true;
- this.numDecisions = this.atn.decisionToState.length;
- this.decisions = [];
- for (let i = 0; i < this.numDecisions; i++) {
- this.decisions.push(new DecisionInfo_1.DecisionInfo(i));
- }
- }
- adaptivePredict(input, decision, outerContext) {
- try {
- this._input = input;
- this._startIndex = input.index;
- // it's possible for SLL to reach a conflict state without consuming any input
- this._sllStopIndex = this._startIndex - 1;
- this._llStopIndex = -1;
- this.currentDecision = decision;
- this.currentState = undefined;
- this.conflictingAltResolvedBySLL = ATN_1.ATN.INVALID_ALT_NUMBER;
- let start = process.hrtime();
- let alt = super.adaptivePredict(input, decision, outerContext);
- let stop = process.hrtime();
- let nanoseconds = (stop[0] - start[0]) * 1000000000;
- if (nanoseconds === 0) {
- nanoseconds = stop[1] - start[1];
- }
- else {
- // Add nanoseconds from start to end of that second, plus start of the end second to end
- nanoseconds += (1000000000 - start[1]) + stop[1];
- }
- this.decisions[decision].timeInPrediction += nanoseconds;
- this.decisions[decision].invocations++;
- let SLL_k = this._sllStopIndex - this._startIndex + 1;
- this.decisions[decision].SLL_TotalLook += SLL_k;
- this.decisions[decision].SLL_MinLook = this.decisions[decision].SLL_MinLook === 0 ? SLL_k : Math.min(this.decisions[decision].SLL_MinLook, SLL_k);
- if (SLL_k > this.decisions[decision].SLL_MaxLook) {
- this.decisions[decision].SLL_MaxLook = SLL_k;
- this.decisions[decision].SLL_MaxLookEvent =
- new LookaheadEventInfo_1.LookaheadEventInfo(decision, undefined, alt, input, this._startIndex, this._sllStopIndex, false);
- }
- if (this._llStopIndex >= 0) {
- let LL_k = this._llStopIndex - this._startIndex + 1;
- this.decisions[decision].LL_TotalLook += LL_k;
- this.decisions[decision].LL_MinLook = this.decisions[decision].LL_MinLook == 0 ? LL_k : Math.min(this.decisions[decision].LL_MinLook, LL_k);
- if (LL_k > this.decisions[decision].LL_MaxLook) {
- this.decisions[decision].LL_MaxLook = LL_k;
- this.decisions[decision].LL_MaxLookEvent =
- new LookaheadEventInfo_1.LookaheadEventInfo(decision, undefined, alt, input, this._startIndex, this._llStopIndex, true);
- }
- }
- return alt;
- }
- finally {
- this._input = undefined;
- this.currentDecision = -1;
- }
- }
- getStartState(dfa, input, outerContext, useContext) {
- let state = super.getStartState(dfa, input, outerContext, useContext);
- this.currentState = state;
- return state;
- }
- computeStartState(dfa, globalContext, useContext) {
- let state = super.computeStartState(dfa, globalContext, useContext);
- this.currentState = state;
- return state;
- }
- computeReachSet(dfa, previous, t, contextCache) {
- if (this._input === undefined) {
- throw new Error("Invalid state");
- }
- let reachState = super.computeReachSet(dfa, previous, t, contextCache);
- if (reachState == null) {
- // no reach on current lookahead symbol. ERROR.
- this.decisions[this.currentDecision].errors.push(new ErrorInfo_1.ErrorInfo(this.currentDecision, previous, this._input, this._startIndex, this._input.index));
- }
- this.currentState = reachState;
- return reachState;
- }
- getExistingTargetState(previousD, t) {
- if (this.currentState === undefined || this._input === undefined) {
- throw new Error("Invalid state");
- }
- // this method is called after each time the input position advances
- if (this.currentState.useContext) {
- this._llStopIndex = this._input.index;
- }
- else {
- this._sllStopIndex = this._input.index;
- }
- let existingTargetState = super.getExistingTargetState(previousD, t);
- if (existingTargetState != null) {
- // this method is directly called by execDFA; must construct a SimulatorState
- // to represent the current state for this case
- this.currentState = new SimulatorState_1.SimulatorState(this.currentState.outerContext, existingTargetState, this.currentState.useContext, this.currentState.remainingOuterContext);
- if (this.currentState.useContext) {
- this.decisions[this.currentDecision].LL_DFATransitions++;
- }
- else {
- this.decisions[this.currentDecision].SLL_DFATransitions++; // count only if we transition over a DFA state
- }
- if (existingTargetState === ATNSimulator_1.ATNSimulator.ERROR) {
- let state = new SimulatorState_1.SimulatorState(this.currentState.outerContext, previousD, this.currentState.useContext, this.currentState.remainingOuterContext);
- this.decisions[this.currentDecision].errors.push(new ErrorInfo_1.ErrorInfo(this.currentDecision, state, this._input, this._startIndex, this._input.index));
- }
- }
- return existingTargetState;
- }
- computeTargetState(dfa, s, remainingGlobalContext, t, useContext, contextCache) {
- let targetState = super.computeTargetState(dfa, s, remainingGlobalContext, t, useContext, contextCache);
- if (useContext) {
- this.decisions[this.currentDecision].LL_ATNTransitions++;
- }
- else {
- this.decisions[this.currentDecision].SLL_ATNTransitions++;
- }
- return targetState;
- }
- evalSemanticContextImpl(pred, parserCallStack, alt) {
- if (this.currentState === undefined || this._input === undefined) {
- throw new Error("Invalid state");
- }
- let result = super.evalSemanticContextImpl(pred, parserCallStack, alt);
- if (!(pred instanceof SemanticContext_1.SemanticContext.PrecedencePredicate)) {
- let fullContext = this._llStopIndex >= 0;
- let stopIndex = fullContext ? this._llStopIndex : this._sllStopIndex;
- this.decisions[this.currentDecision].predicateEvals.push(new PredicateEvalInfo_1.PredicateEvalInfo(this.currentState, this.currentDecision, this._input, this._startIndex, stopIndex, pred, result, alt));
- }
- return result;
- }
- reportContextSensitivity(dfa, prediction, acceptState, startIndex, stopIndex) {
- if (this._input === undefined) {
- throw new Error("Invalid state");
- }
- if (prediction !== this.conflictingAltResolvedBySLL) {
- this.decisions[this.currentDecision].contextSensitivities.push(new ContextSensitivityInfo_1.ContextSensitivityInfo(this.currentDecision, acceptState, this._input, startIndex, stopIndex));
- }
- super.reportContextSensitivity(dfa, prediction, acceptState, startIndex, stopIndex);
- }
- reportAttemptingFullContext(dfa, conflictingAlts, conflictState, startIndex, stopIndex) {
- if (conflictingAlts != null) {
- this.conflictingAltResolvedBySLL = conflictingAlts.nextSetBit(0);
- }
- else {
- this.conflictingAltResolvedBySLL = conflictState.s0.configs.getRepresentedAlternatives().nextSetBit(0);
- }
- this.decisions[this.currentDecision].LL_Fallback++;
- super.reportAttemptingFullContext(dfa, conflictingAlts, conflictState, startIndex, stopIndex);
- }
- reportAmbiguity(dfa, D, startIndex, stopIndex, exact, ambigAlts, configs) {
- if (this.currentState === undefined || this._input === undefined) {
- throw new Error("Invalid state");
- }
- let prediction;
- if (ambigAlts != null) {
- prediction = ambigAlts.nextSetBit(0);
- }
- else {
- prediction = configs.getRepresentedAlternatives().nextSetBit(0);
- }
- if (this.conflictingAltResolvedBySLL !== ATN_1.ATN.INVALID_ALT_NUMBER && prediction !== this.conflictingAltResolvedBySLL) {
- // Even though this is an ambiguity we are reporting, we can
- // still detect some context sensitivities. Both SLL and LL
- // are showing a conflict, hence an ambiguity, but if they resolve
- // to different minimum alternatives we have also identified a
- // context sensitivity.
- this.decisions[this.currentDecision].contextSensitivities.push(new ContextSensitivityInfo_1.ContextSensitivityInfo(this.currentDecision, this.currentState, this._input, startIndex, stopIndex));
- }
- this.decisions[this.currentDecision].ambiguities.push(new AmbiguityInfo_1.AmbiguityInfo(this.currentDecision, this.currentState, ambigAlts, this._input, startIndex, stopIndex));
- super.reportAmbiguity(dfa, D, startIndex, stopIndex, exact, ambigAlts, configs);
- }
- // ---------------------------------------------------------------------
- getDecisionInfo() {
- return this.decisions;
- }
- getCurrentState() {
- return this.currentState;
- }
-}
-__decorate([
- Decorators_1.Override
-], ProfilingATNSimulator.prototype, "adaptivePredict", null);
-__decorate([
- Decorators_1.Override
-], ProfilingATNSimulator.prototype, "getStartState", null);
-__decorate([
- Decorators_1.Override
-], ProfilingATNSimulator.prototype, "computeStartState", null);
-__decorate([
- Decorators_1.Override
-], ProfilingATNSimulator.prototype, "computeReachSet", null);
-__decorate([
- Decorators_1.Override
-], ProfilingATNSimulator.prototype, "getExistingTargetState", null);
-__decorate([
- Decorators_1.Override
-], ProfilingATNSimulator.prototype, "computeTargetState", null);
-__decorate([
- Decorators_1.Override
-], ProfilingATNSimulator.prototype, "evalSemanticContextImpl", null);
-__decorate([
- Decorators_1.Override
-], ProfilingATNSimulator.prototype, "reportContextSensitivity", null);
-__decorate([
- Decorators_1.Override
-], ProfilingATNSimulator.prototype, "reportAttemptingFullContext", null);
-__decorate([
- Decorators_1.Override,
- __param(0, Decorators_1.NotNull), __param(5, Decorators_1.NotNull), __param(6, Decorators_1.NotNull)
-], ProfilingATNSimulator.prototype, "reportAmbiguity", null);
-exports.ProfilingATNSimulator = ProfilingATNSimulator;
-//# sourceMappingURL=ProfilingATNSimulator.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/ProfilingATNSimulator.js.map b/node_modules/antlr4ts/atn/ProfilingATNSimulator.js.map
deleted file mode 100644
index 91efdca..0000000
--- a/node_modules/antlr4ts/atn/ProfilingATNSimulator.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ProfilingATNSimulator.js","sourceRoot":"","sources":["../../../src/atn/ProfilingATNSimulator.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,mDAAgD;AAChD,+BAA4B;AAE5B,iDAA8C;AAE9C,qEAAkE;AAClE,iDAA8C;AAG9C,2CAAwC;AACxC,8CAAkD;AAClD,6DAA0D;AAE1D,6DAA0D;AAE1D,2DAAwD;AAExD,uDAAoD;AACpD,qDAAkD;AAGlD;;GAEG;AACH,2BAAmC,SAAQ,uCAAkB;IAyB5D,YAAY,MAAc;QACzB,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QArB7B,gBAAW,GAAW,CAAC,CAAC;QACxB,kBAAa,GAAW,CAAC,CAAC;QAC1B,iBAAY,GAAW,CAAC,CAAC;QAEzB,oBAAe,GAAW,CAAC,CAAC;QAGtC;;;;;;;;;;WAUG;QACO,gCAA2B,GAAW,CAAC,CAAC;QAIjD,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;QAC1B,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC;QAC9B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,MAAM,CAAC;QACpD,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,2BAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;IACF,CAAC;IAGD,eAAe,CAAC,KAAkB,EAAE,QAAgB,EAAE,YAA+B;QACpF,IAAI,CAAC;YACJ,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;YACpB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC;YAC/B,8EAA8E;YAC9E,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;YAC1C,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;YACvB,IAAI,CAAC,eAAe,GAAG,QAAQ,CAAC;YAChC,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC;YAC9B,IAAI,CAAC,2BAA2B,GAAG,SAAG,CAAC,kBAAkB,CAAC;YAC1D,IAAI,KAAK,GAAa,OAAO,CAAC,MAAM,EAAE,CAAC;YACvC,IAAI,GAAG,GAAW,KAAK,CAAC,eAAe,CAAC,KAAK,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;YACvE,IAAI,IAAI,GAAa,OAAO,CAAC,MAAM,EAAE,CAAC;YAEtC,IAAI,WAAW,GAAW,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;YAC5D,EAAE,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC;gBACvB,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,wFAAwF;gBACxF,WAAW,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAClD,CAAC;YAED,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,gBAAgB,IAAI,WAAW,CAAC;YACzD,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,WAAW,EAAE,CAAC;YAEvC,IAAI,KAAK,GAAW,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;YAC9D,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,aAAa,IAAI,KAAK,CAAC;YAChD,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,WAAW,KAAK,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;YAClJ,EAAE,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;gBAClD,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,WAAW,GAAG,KAAK,CAAC;gBAC7C,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,gBAAgB;oBACxC,IAAI,uCAAkB,CAAC,QAAQ,EAAE,SAAS,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;YACvG,CAAC;YAED,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,IAAI,GAAW,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;gBAC5D,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,YAAY,IAAI,IAAI,CAAC;gBAC9C,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,UAAU,IAAI,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;gBAC5I,EAAE,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;oBAChD,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC;oBAC3C,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,eAAe;wBACvC,IAAI,uCAAkB,CAAC,QAAQ,EAAE,SAAS,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;gBACrG,CAAC;YACF,CAAC;YAED,MAAM,CAAC,GAAG,CAAC;QACZ,CAAC;gBACO,CAAC;YACR,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;YACxB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;QAC3B,CAAC;IACF,CAAC;IAGS,aAAa,CAAC,GAAQ,EAAE,KAAkB,EAAE,YAA+B,EAAE,UAAmB;QACzG,IAAI,KAAK,GAA+B,KAAK,CAAC,aAAa,CAAC,GAAG,EAAE,KAAK,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;QAClG,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;QAC1B,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAGS,iBAAiB,CAAC,GAAQ,EAAE,aAAgC,EAAE,UAAmB;QAC1F,IAAI,KAAK,GAAmB,KAAK,CAAC,iBAAiB,CAAC,GAAG,EAAE,aAAa,EAAE,UAAU,CAAC,CAAC;QACpF,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;QAC1B,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAGS,eAAe,CAAC,GAAQ,EAAE,QAAwB,EAAE,CAAS,EAAE,YAAoC;QAC5G,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;QAClC,CAAC;QAED,IAAI,UAAU,GAA+B,KAAK,CAAC,eAAe,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;QACnG,EAAE,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC;YACxB,+CAA+C;YAC/C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,IAAI,CAC/C,IAAI,qBAAS,CAAC,IAAI,CAAC,eAAe,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAC/F,CAAC;QACH,CAAC;QAED,IAAI,CAAC,YAAY,GAAG,UAAU,CAAC;QAC/B,MAAM,CAAC,UAAU,CAAC;IACnB,CAAC;IAGS,sBAAsB,CAAC,SAAmB,EAAE,CAAS;QAC9D,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC;YAClE,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;QAClC,CAAC;QAED,oEAAoE;QACpE,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;QACvC,CAAC;QACD,IAAI,CAAC,CAAC;YACL,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;QACxC,CAAC;QAED,IAAI,mBAAmB,GAAyB,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QAC3F,EAAE,CAAC,CAAC,mBAAmB,IAAI,IAAI,CAAC,CAAC,CAAC;YACjC,6EAA6E;YAC7E,+CAA+C;YAC/C,IAAI,CAAC,YAAY,GAAG,IAAI,+BAAc,CAAC,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,mBAAmB,EAAE,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,IAAI,CAAC,YAAY,CAAC,qBAAqB,CAAC,CAAC;YAEnK,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC;gBAClC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,iBAAiB,EAAE,CAAC;YAC1D,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,kBAAkB,EAAE,CAAC,CAAC,+CAA+C;YAC3G,CAAC;YAED,EAAE,CAAC,CAAC,mBAAmB,KAAK,2BAAY,CAAC,KAAK,CAAC,CAAC,CAAC;gBAChD,IAAI,KAAK,GAAmB,IAAI,+BAAc,CAAC,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,SAAS,EAAE,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,IAAI,CAAC,YAAY,CAAC,qBAAqB,CAAC,CAAC;gBACjK,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,IAAI,CAC/C,IAAI,qBAAS,CAAC,IAAI,CAAC,eAAe,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAC5F,CAAC;YACH,CAAC;QACF,CAAC;QAED,MAAM,CAAC,mBAAmB,CAAC;IAC5B,CAAC;IAGS,kBAAkB,CAAC,GAAQ,EAAE,CAAW,EAAE,sBAAyC,EAAE,CAAS,EAAE,UAAmB,EAAE,YAAoC;QAClK,IAAI,WAAW,GAA8C,KAAK,CAAC,kBAAkB,CAAC,GAAG,EAAE,CAAC,EAAE,sBAAsB,EAAE,CAAC,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;QAEnJ,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,iBAAiB,EAAE,CAAC;QAC1D,CAAC;QACD,IAAI,CAAC,CAAC;YACL,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,kBAAkB,EAAE,CAAC;QAC3D,CAAC;QAED,MAAM,CAAC,WAAW,CAAC;IACpB,CAAC;IAGS,uBAAuB,CAAC,IAAqB,EAAE,eAAkC,EAAE,GAAW;QACvG,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC;YAClE,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;QAClC,CAAC;QAED,IAAI,MAAM,GAAY,KAAK,CAAC,uBAAuB,CAAC,IAAI,EAAE,eAAe,EAAE,GAAG,CAAC,CAAC;QAChF,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,YAAY,iCAAe,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;YAC5D,IAAI,WAAW,GAAY,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC;YAClD,IAAI,SAAS,GAAW,WAAW,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC;YAC7E,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,cAAc,CAAC,IAAI,CACvD,IAAI,qCAAiB,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,eAAe,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,WAAW,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,CAC3H,CAAC;QACH,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAGS,wBAAwB,CAAC,GAAQ,EAAE,UAAkB,EAAE,WAA2B,EAAE,UAAkB,EAAE,SAAiB;QAClI,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;QAClC,CAAC;QAED,EAAE,CAAC,CAAC,UAAU,KAAK,IAAI,CAAC,2BAA2B,CAAC,CAAC,CAAC;YACrD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,oBAAoB,CAAC,IAAI,CAC7D,IAAI,+CAAsB,CAAC,IAAI,CAAC,eAAe,EAAE,WAAW,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,SAAS,CAAC,CACjG,CAAC;QACH,CAAC;QACD,KAAK,CAAC,wBAAwB,CAAC,GAAG,EAAE,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;IACrF,CAAC;IAGS,2BAA2B,CAAC,GAAQ,EAAE,eAAuB,EAAE,aAA6B,EAAE,UAAkB,EAAE,SAAiB;QAC5I,EAAE,CAAC,CAAC,eAAe,IAAI,IAAI,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,2BAA2B,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAClE,CAAC;QACD,IAAI,CAAC,CAAC;YACL,IAAI,CAAC,2BAA2B,GAAG,aAAa,CAAC,EAAE,CAAC,OAAO,CAAC,0BAA0B,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACxG,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,WAAW,EAAE,CAAC;QACnD,KAAK,CAAC,2BAA2B,CAAC,GAAG,EAAE,eAAe,EAAE,aAAa,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;IAC/F,CAAC;IAGS,eAAe,CAAU,GAAQ,EAAE,CAAW,EAAE,UAAkB,EAAE,SAAiB,EAAE,KAAc,EAAW,SAAiB,EAAW,OAAqB;QAC1K,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC;YAClE,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;QAClC,CAAC;QAED,IAAI,UAAkB,CAAC;QACvB,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC;YACvB,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,IAAI,CAAC,CAAC;YACL,UAAU,GAAG,OAAO,CAAC,0BAA0B,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACjE,CAAC;QACD,EAAE,CAAC,CAAC,IAAI,CAAC,2BAA2B,KAAK,SAAG,CAAC,kBAAkB,IAAI,UAAU,KAAK,IAAI,CAAC,2BAA2B,CAAC,CAAC,CAAC;YACpH,4DAA4D;YAC5D,4DAA4D;YAC5D,kEAAkE;YAClE,8DAA8D;YAC9D,uBAAuB;YACvB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,oBAAoB,CAAC,IAAI,CAC7D,IAAI,+CAAsB,CAAC,IAAI,CAAC,eAAe,EAAE,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,SAAS,CAAC,CACvG,CAAC;QACH,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,WAAW,CAAC,IAAI,CACpD,IAAI,6BAAa,CAAC,IAAI,CAAC,eAAe,EAAE,IAAI,CAAC,YAAY,EAAE,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,SAAS,CAAC,CACzG,CAAC;QACF,KAAK,CAAC,eAAe,CAAC,GAAG,EAAE,CAAC,EAAE,UAAU,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;IACjF,CAAC;IAED,wEAAwE;IAExE,eAAe;QACd,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;IACvB,CAAC;IAED,eAAe;QACd,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC;IAC1B,CAAC;CACD;AA3NA;IADC,qBAAQ;4DAoDR;AAGD;IADC,qBAAQ;0DAKR;AAGD;IADC,qBAAQ;8DAKR;AAGD;IADC,qBAAQ;4DAgBR;AAGD;IADC,qBAAQ;mEAoCR;AAGD;IADC,qBAAQ;+DAYR;AAGD;IADC,qBAAQ;oEAgBR;AAGD;IADC,qBAAQ;qEAYR;AAGD;IADC,qBAAQ;wEAUR;AAGD;IADC,qBAAQ;IACkB,WAAA,oBAAO,CAAA,EAAgF,WAAA,oBAAO,CAAA,EAAqB,WAAA,oBAAO,CAAA;4DA0BpJ;AArPF,sDAgQC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/RangeTransition.d.ts b/node_modules/antlr4ts/atn/RangeTransition.d.ts
deleted file mode 100644
index 74b7e9c..0000000
--- a/node_modules/antlr4ts/atn/RangeTransition.d.ts
+++ /dev/null
@@ -1,17 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { IntervalSet } from '../misc/IntervalSet';
-import { Transition } from './Transition';
-import { TransitionType } from './TransitionType';
-export declare class RangeTransition extends Transition {
- from: number;
- to: number;
- constructor(target: ATNState, from: number, to: number);
- readonly serializationType: TransitionType;
- readonly label: IntervalSet;
- matches(symbol: number, minVocabSymbol: number, maxVocabSymbol: number): boolean;
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/atn/RangeTransition.js b/node_modules/antlr4ts/atn/RangeTransition.js
deleted file mode 100644
index e3ae384..0000000
--- a/node_modules/antlr4ts/atn/RangeTransition.js
+++ /dev/null
@@ -1,56 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const IntervalSet_1 = require("../misc/IntervalSet");
-const Decorators_1 = require("../Decorators");
-const Transition_1 = require("./Transition");
-let RangeTransition = class RangeTransition extends Transition_1.Transition {
- constructor(target, from, to) {
- super(target);
- this.from = from;
- this.to = to;
- }
- get serializationType() {
- return 2 /* RANGE */;
- }
- get label() {
- return IntervalSet_1.IntervalSet.of(this.from, this.to);
- }
- matches(symbol, minVocabSymbol, maxVocabSymbol) {
- return symbol >= this.from && symbol <= this.to;
- }
- toString() {
- return "'" + String.fromCharCode(this.from) + "'..'" + String.fromCharCode(this.to) + "'";
- }
-};
-__decorate([
- Decorators_1.Override
-], RangeTransition.prototype, "serializationType", null);
-__decorate([
- Decorators_1.Override,
- Decorators_1.NotNull
-], RangeTransition.prototype, "label", null);
-__decorate([
- Decorators_1.Override
-], RangeTransition.prototype, "matches", null);
-__decorate([
- Decorators_1.Override,
- Decorators_1.NotNull
-], RangeTransition.prototype, "toString", null);
-RangeTransition = __decorate([
- __param(0, Decorators_1.NotNull)
-], RangeTransition);
-exports.RangeTransition = RangeTransition;
-//# sourceMappingURL=RangeTransition.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/RangeTransition.js.map b/node_modules/antlr4ts/atn/RangeTransition.js.map
deleted file mode 100644
index 9b7a793..0000000
--- a/node_modules/antlr4ts/atn/RangeTransition.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"RangeTransition.js","sourceRoot":"","sources":["../../../src/atn/RangeTransition.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAKH,qDAAiD;AACjD,8CAAkD;AAClD,6CAA0C;AAG1C,IAAa,eAAe,GAA5B,qBAA6B,SAAQ,uBAAU;IAI9C,YAAqB,MAAgB,EAAE,IAAY,EAAE,EAAU;QAC9D,KAAK,CAAC,MAAM,CAAC,CAAC;QACd,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;IACd,CAAC;IAGD,IAAI,iBAAiB;QACpB,MAAM,eAAsB;IAC7B,CAAC;IAID,IAAI,KAAK;QACR,MAAM,CAAC,yBAAW,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;IAC3C,CAAC;IAGD,OAAO,CAAC,MAAc,EAAE,cAAsB,EAAE,cAAsB;QACrE,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,IAAI,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;IACjD,CAAC;IAID,QAAQ;QACP,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;IAC3F,CAAC;CACD,CAAA;AApBA;IADC,qBAAQ;wDAGR;AAID;IAFC,qBAAQ;IACR,oBAAO;4CAGP;AAGD;IADC,qBAAQ;8CAGR;AAID;IAFC,qBAAQ;IACR,oBAAO;+CAGP;AA9BW,eAAe;IAId,WAAA,oBAAO,CAAA;GAJR,eAAe,CA+B3B;AA/BY,0CAAe"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/RuleStartState.d.ts b/node_modules/antlr4ts/atn/RuleStartState.d.ts
deleted file mode 100644
index da2a414..0000000
--- a/node_modules/antlr4ts/atn/RuleStartState.d.ts
+++ /dev/null
@@ -1,13 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { ATNStateType } from './ATNStateType';
-import { RuleStopState } from './RuleStopState';
-export declare class RuleStartState extends ATNState {
- stopState: RuleStopState;
- isPrecedenceRule: boolean;
- leftFactored: boolean;
- readonly stateType: ATNStateType;
-}
diff --git a/node_modules/antlr4ts/atn/RuleStartState.js b/node_modules/antlr4ts/atn/RuleStartState.js
deleted file mode 100644
index 471cee8..0000000
--- a/node_modules/antlr4ts/atn/RuleStartState.js
+++ /dev/null
@@ -1,30 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:36.6806851-07:00
-const ATNState_1 = require("./ATNState");
-const Decorators_1 = require("../Decorators");
-class RuleStartState extends ATNState_1.ATNState {
- constructor() {
- super(...arguments);
- this.isPrecedenceRule = false;
- this.leftFactored = false;
- }
- get stateType() {
- return 2 /* RULE_START */;
- }
-}
-__decorate([
- Decorators_1.Override
-], RuleStartState.prototype, "stateType", null);
-exports.RuleStartState = RuleStartState;
-//# sourceMappingURL=RuleStartState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/RuleStartState.js.map b/node_modules/antlr4ts/atn/RuleStartState.js.map
deleted file mode 100644
index 8a5619a..0000000
--- a/node_modules/antlr4ts/atn/RuleStartState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"RuleStartState.js","sourceRoot":"","sources":["../../../src/atn/RuleStartState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAEH,wDAAwD;AAExD,yCAAsC;AAEtC,8CAAyC;AAGzC,oBAA4B,SAAQ,mBAAQ;IAA5C;;QAEC,qBAAgB,GAAY,KAAK,CAAC;QAClC,iBAAY,GAAY,KAAK,CAAC;IAM/B,CAAC;IAHA,IAAI,SAAS;QACZ,MAAM,oBAAyB;IAChC,CAAC;CACD;AAHA;IADC,qBAAQ;+CAGR;AARF,wCASC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/RuleStopState.d.ts b/node_modules/antlr4ts/atn/RuleStopState.d.ts
deleted file mode 100644
index 3d6ca13..0000000
--- a/node_modules/antlr4ts/atn/RuleStopState.d.ts
+++ /dev/null
@@ -1,15 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { ATNStateType } from './ATNStateType';
-/** The last node in the ATN for a rule, unless that rule is the start symbol.
- * In that case, there is one transition to EOF. Later, we might encode
- * references to all calls to this rule to compute FOLLOW sets for
- * error handling.
- */
-export declare class RuleStopState extends ATNState {
- readonly nonStopStateNumber: number;
- readonly stateType: ATNStateType;
-}
diff --git a/node_modules/antlr4ts/atn/RuleStopState.js b/node_modules/antlr4ts/atn/RuleStopState.js
deleted file mode 100644
index 1a620b2..0000000
--- a/node_modules/antlr4ts/atn/RuleStopState.js
+++ /dev/null
@@ -1,36 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:36.7513856-07:00
-const ATNState_1 = require("./ATNState");
-const Decorators_1 = require("../Decorators");
-/** The last node in the ATN for a rule, unless that rule is the start symbol.
- * In that case, there is one transition to EOF. Later, we might encode
- * references to all calls to this rule to compute FOLLOW sets for
- * error handling.
- */
-class RuleStopState extends ATNState_1.ATNState {
- get nonStopStateNumber() {
- return -1;
- }
- get stateType() {
- return 7 /* RULE_STOP */;
- }
-}
-__decorate([
- Decorators_1.Override
-], RuleStopState.prototype, "nonStopStateNumber", null);
-__decorate([
- Decorators_1.Override
-], RuleStopState.prototype, "stateType", null);
-exports.RuleStopState = RuleStopState;
-//# sourceMappingURL=RuleStopState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/RuleStopState.js.map b/node_modules/antlr4ts/atn/RuleStopState.js.map
deleted file mode 100644
index 8e8b8f7..0000000
--- a/node_modules/antlr4ts/atn/RuleStopState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"RuleStopState.js","sourceRoot":"","sources":["../../../src/atn/RuleStopState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAEH,wDAAwD;AAExD,yCAAsC;AAEtC,8CAAyC;AAEzC;;;;GAIG;AACH,mBAA2B,SAAQ,mBAAQ;IAG1C,IAAI,kBAAkB;QACrB,MAAM,CAAC,CAAC,CAAC,CAAC;IACX,CAAC;IAGD,IAAI,SAAS;QACZ,MAAM,mBAAwB;IAC/B,CAAC;CAED;AATA;IADC,qBAAQ;uDAGR;AAGD;IADC,qBAAQ;8CAGR;AAVF,sCAYC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/RuleTransition.d.ts b/node_modules/antlr4ts/atn/RuleTransition.d.ts
deleted file mode 100644
index 46f713e..0000000
--- a/node_modules/antlr4ts/atn/RuleTransition.d.ts
+++ /dev/null
@@ -1,22 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { RuleStartState } from './RuleStartState';
-import { Transition } from './Transition';
-import { TransitionType } from './TransitionType';
-/** */
-export declare class RuleTransition extends Transition {
- /** Ptr to the rule definition object for this rule ref */
- ruleIndex: number;
- precedence: number;
- /** What node to begin computations following ref to rule */
- followState: ATNState;
- tailCall: boolean;
- optimizedTailCall: boolean;
- constructor(ruleStart: RuleStartState, ruleIndex: number, precedence: number, followState: ATNState);
- readonly serializationType: TransitionType;
- readonly isEpsilon: boolean;
- matches(symbol: number, minVocabSymbol: number, maxVocabSymbol: number): boolean;
-}
diff --git a/node_modules/antlr4ts/atn/RuleTransition.js b/node_modules/antlr4ts/atn/RuleTransition.js
deleted file mode 100644
index 898c2b3..0000000
--- a/node_modules/antlr4ts/atn/RuleTransition.js
+++ /dev/null
@@ -1,54 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const Decorators_1 = require("../Decorators");
-const Transition_1 = require("./Transition");
-/** */
-let RuleTransition = class RuleTransition extends Transition_1.Transition {
- constructor(ruleStart, ruleIndex, precedence, followState) {
- super(ruleStart);
- this.tailCall = false;
- this.optimizedTailCall = false;
- this.ruleIndex = ruleIndex;
- this.precedence = precedence;
- this.followState = followState;
- }
- get serializationType() {
- return 3 /* RULE */;
- }
- get isEpsilon() {
- return true;
- }
- matches(symbol, minVocabSymbol, maxVocabSymbol) {
- return false;
- }
-};
-__decorate([
- Decorators_1.NotNull
-], RuleTransition.prototype, "followState", void 0);
-__decorate([
- Decorators_1.Override
-], RuleTransition.prototype, "serializationType", null);
-__decorate([
- Decorators_1.Override
-], RuleTransition.prototype, "isEpsilon", null);
-__decorate([
- Decorators_1.Override
-], RuleTransition.prototype, "matches", null);
-RuleTransition = __decorate([
- __param(0, Decorators_1.NotNull), __param(3, Decorators_1.NotNull)
-], RuleTransition);
-exports.RuleTransition = RuleTransition;
-//# sourceMappingURL=RuleTransition.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/RuleTransition.js.map b/node_modules/antlr4ts/atn/RuleTransition.js.map
deleted file mode 100644
index 7703076..0000000
--- a/node_modules/antlr4ts/atn/RuleTransition.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"RuleTransition.js","sourceRoot":"","sources":["../../../src/atn/RuleTransition.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAKH,8CAAkD;AAElD,6CAA0C;AAG1C,MAAM;AACN,IAAa,cAAc,GAA3B,oBAA4B,SAAQ,uBAAU;IAa7C,YAAqB,SAAyB,EAAE,SAAiB,EAAE,UAAkB,EAAW,WAAqB;QACpH,KAAK,CAAC,SAAS,CAAC,CAAC;QAJlB,aAAQ,GAAY,KAAK,CAAC;QAC1B,sBAAiB,GAAY,KAAK,CAAC;QAIlC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IAChC,CAAC;IAGD,IAAI,iBAAiB;QACpB,MAAM,cAAqB;IAC5B,CAAC;IAGD,IAAI,SAAS;QACZ,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAGD,OAAO,CAAC,MAAc,EAAE,cAAsB,EAAE,cAAsB;QACrE,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;CACD,CAAA;AA1BA;IADC,oBAAO;mDACc;AAatB;IADC,qBAAQ;uDAGR;AAGD;IADC,qBAAQ;+CAGR;AAGD;IADC,qBAAQ;6CAGR;AAjCW,cAAc;IAab,WAAA,oBAAO,CAAA,EAAoE,WAAA,oBAAO,CAAA;GAbnF,cAAc,CAkC1B;AAlCY,wCAAc"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/SemanticContext.d.ts b/node_modules/antlr4ts/atn/SemanticContext.d.ts
deleted file mode 100644
index 6161623..0000000
--- a/node_modules/antlr4ts/atn/SemanticContext.d.ts
+++ /dev/null
@@ -1,146 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Comparable } from '../misc/Stubs';
-import { Equatable } from '../misc/Stubs';
-import { Recognizer } from '../Recognizer';
-import { RuleContext } from '../RuleContext';
-/** A tree structure used to record the semantic context in which
- * an ATN configuration is valid. It's either a single predicate,
- * a conjunction {@code p1&&p2}, or a sum of products {@code p1||p2}.
- *
- * I have scoped the {@link AND}, {@link OR}, and {@link Predicate} subclasses of
- * {@link SemanticContext} within the scope of this outer class.
- */
-export declare abstract class SemanticContext implements Equatable {
- private static _NONE;
- /**
- * The default {@link SemanticContext}, which is semantically equivalent to
- * a predicate of the form {@code {true}?}.
- */
- static readonly NONE: SemanticContext;
- /**
- * For context independent predicates, we evaluate them without a local
- * context (i.e., null context). That way, we can evaluate them without
- * having to create proper rule-specific context during prediction (as
- * opposed to the parser, which creates them naturally). In a practical
- * sense, this avoids a cast exception from RuleContext to myruleContext.
- *
- * For context dependent predicates, we must pass in a local context so that
- * references such as $arg evaluate properly as _localctx.arg. We only
- * capture context dependent predicates in the context in which we begin
- * prediction, so we passed in the outer context here in case of context
- * dependent predicate evaluation.
- */
- abstract eval(parser: Recognizer, parserCallStack: RuleContext): boolean;
- /**
- * Evaluate the precedence predicates for the context and reduce the result.
- *
- * @param parser The parser instance.
- * @param parserCallStack
- * @return The simplified semantic context after precedence predicates are
- * evaluated, which will be one of the following values.
- *
- * - {@link #NONE}: if the predicate simplifies to {@code true} after
- * precedence predicates are evaluated.
- * - {@code null}: if the predicate simplifies to {@code false} after
- * precedence predicates are evaluated.
- * - {@code this}: if the semantic context is not changed as a result of
- * precedence predicate evaluation.
- * - A non-{@code null} {@link SemanticContext}: the new simplified
- * semantic context after precedence predicates are evaluated.
- *
- */
- evalPrecedence(parser: Recognizer, parserCallStack: RuleContext): SemanticContext | undefined;
- abstract hashCode(): number;
- abstract equals(obj: any): boolean;
- static and(a: SemanticContext | undefined, b: SemanticContext): SemanticContext;
- /**
- *
- * @see ParserATNSimulator#getPredsForAmbigAlts
- */
- static or(a: SemanticContext | undefined, b: SemanticContext): SemanticContext;
-}
-export declare namespace SemanticContext {
- class Predicate extends SemanticContext {
- ruleIndex: number;
- predIndex: number;
- isCtxDependent: boolean;
- constructor();
- constructor(ruleIndex: number, predIndex: number, isCtxDependent: boolean);
- eval(parser: Recognizer, parserCallStack: RuleContext): boolean;
- hashCode(): number;
- equals(obj: any): boolean;
- toString(): string;
- }
- class PrecedencePredicate extends SemanticContext implements Comparable {
- precedence: number;
- constructor(precedence: number);
- eval(parser: Recognizer, parserCallStack: RuleContext): boolean;
- evalPrecedence(parser: Recognizer, parserCallStack: RuleContext): SemanticContext | undefined;
- compareTo(o: PrecedencePredicate): number;
- hashCode(): number;
- equals(obj: any): boolean;
- toString(): string;
- }
- /**
- * This is the base class for semantic context "operators", which operate on
- * a collection of semantic context "operands".
- *
- * @since 4.3
- */
- abstract class Operator extends SemanticContext {
- /**
- * Gets the operands for the semantic context operator.
- *
- * @return a collection of {@link SemanticContext} operands for the
- * operator.
- *
- * @since 4.3
- */
- readonly abstract operands: Iterable;
- }
- /**
- * A semantic context which is true whenever none of the contained contexts
- * is false.
- */
- class AND extends Operator {
- opnds: SemanticContext[];
- constructor(a: SemanticContext, b: SemanticContext);
- readonly operands: Iterable;
- equals(obj: any): boolean;
- hashCode(): number;
- /**
- * {@inheritDoc}
- *
- *
- * The evaluation of predicates by this context is short-circuiting, but
- * unordered.
- */
- eval(parser: Recognizer, parserCallStack: RuleContext): boolean;
- evalPrecedence(parser: Recognizer, parserCallStack: RuleContext): SemanticContext | undefined;
- toString(): string;
- }
- /**
- * A semantic context which is true whenever at least one of the contained
- * contexts is true.
- */
- class OR extends Operator {
- opnds: SemanticContext[];
- constructor(a: SemanticContext, b: SemanticContext);
- readonly operands: Iterable;
- equals(obj: any): boolean;
- hashCode(): number;
- /**
- * {@inheritDoc}
- *
- *
- * The evaluation of predicates by this context is short-circuiting, but
- * unordered.
- */
- eval(parser: Recognizer, parserCallStack: RuleContext): boolean;
- evalPrecedence(parser: Recognizer, parserCallStack: RuleContext): SemanticContext | undefined;
- toString(): string;
- }
-}
diff --git a/node_modules/antlr4ts/atn/SemanticContext.js b/node_modules/antlr4ts/atn/SemanticContext.js
deleted file mode 100644
index 39108d1..0000000
--- a/node_modules/antlr4ts/atn/SemanticContext.js
+++ /dev/null
@@ -1,464 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:36.9521478-07:00
-const Array2DHashSet_1 = require("../misc/Array2DHashSet");
-const ArrayEqualityComparator_1 = require("../misc/ArrayEqualityComparator");
-const MurmurHash_1 = require("../misc/MurmurHash");
-const Decorators_1 = require("../Decorators");
-const ObjectEqualityComparator_1 = require("../misc/ObjectEqualityComparator");
-const Utils = require("../misc/Utils");
-function max(items) {
- let result;
- for (let current of items) {
- if (result === undefined) {
- result = current;
- continue;
- }
- let comparison = result.compareTo(current);
- if (comparison < 0) {
- result = current;
- }
- }
- return result;
-}
-function min(items) {
- let result;
- for (let current of items) {
- if (result === undefined) {
- result = current;
- continue;
- }
- let comparison = result.compareTo(current);
- if (comparison > 0) {
- result = current;
- }
- }
- return result;
-}
-/** A tree structure used to record the semantic context in which
- * an ATN configuration is valid. It's either a single predicate,
- * a conjunction {@code p1&&p2}, or a sum of products {@code p1||p2}.
- *
- * I have scoped the {@link AND}, {@link OR}, and {@link Predicate} subclasses of
- * {@link SemanticContext} within the scope of this outer class.
- */
-class SemanticContext {
- /**
- * The default {@link SemanticContext}, which is semantically equivalent to
- * a predicate of the form {@code {true}?}.
- */
- static get NONE() {
- if (SemanticContext._NONE === undefined) {
- SemanticContext._NONE = new SemanticContext.Predicate();
- }
- return SemanticContext._NONE;
- }
- /**
- * Evaluate the precedence predicates for the context and reduce the result.
- *
- * @param parser The parser instance.
- * @param parserCallStack
- * @return The simplified semantic context after precedence predicates are
- * evaluated, which will be one of the following values.
- *
- * - {@link #NONE}: if the predicate simplifies to {@code true} after
- * precedence predicates are evaluated.
- * - {@code null}: if the predicate simplifies to {@code false} after
- * precedence predicates are evaluated.
- * - {@code this}: if the semantic context is not changed as a result of
- * precedence predicate evaluation.
- * - A non-{@code null} {@link SemanticContext}: the new simplified
- * semantic context after precedence predicates are evaluated.
- *
- */
- evalPrecedence(parser, parserCallStack) {
- return this;
- }
- static and(a, b) {
- if (!a || a === SemanticContext.NONE)
- return b;
- if (b === SemanticContext.NONE)
- return a;
- let result = new SemanticContext.AND(a, b);
- if (result.opnds.length === 1) {
- return result.opnds[0];
- }
- return result;
- }
- /**
- *
- * @see ParserATNSimulator#getPredsForAmbigAlts
- */
- static or(a, b) {
- if (!a) {
- return b;
- }
- if (a === SemanticContext.NONE || b === SemanticContext.NONE)
- return SemanticContext.NONE;
- let result = new SemanticContext.OR(a, b);
- if (result.opnds.length === 1) {
- return result.opnds[0];
- }
- return result;
- }
-}
-exports.SemanticContext = SemanticContext;
-(function (SemanticContext) {
- /**
- * This random 30-bit prime represents the value of `AND.class.hashCode()`.
- */
- const AND_HASHCODE = 40363613;
- /**
- * This random 30-bit prime represents the value of `OR.class.hashCode()`.
- */
- const OR_HASHCODE = 486279973;
- function filterPrecedencePredicates(collection) {
- let result = [];
- for (let i = 0; i < collection.length; i++) {
- let context = collection[i];
- if (context instanceof SemanticContext.PrecedencePredicate) {
- result.push(context);
- // Remove the item from 'collection' and move i back so we look at the same index again
- collection.splice(i, 1);
- i--;
- }
- }
- return result;
- }
- class Predicate extends SemanticContext {
- constructor(ruleIndex = -1, predIndex = -1, isCtxDependent = false) {
- super();
- this.ruleIndex = ruleIndex;
- this.predIndex = predIndex;
- this.isCtxDependent = isCtxDependent;
- }
- eval(parser, parserCallStack) {
- let localctx = this.isCtxDependent ? parserCallStack : undefined;
- return parser.sempred(localctx, this.ruleIndex, this.predIndex);
- }
- hashCode() {
- let hashCode = MurmurHash_1.MurmurHash.initialize();
- hashCode = MurmurHash_1.MurmurHash.update(hashCode, this.ruleIndex);
- hashCode = MurmurHash_1.MurmurHash.update(hashCode, this.predIndex);
- hashCode = MurmurHash_1.MurmurHash.update(hashCode, this.isCtxDependent ? 1 : 0);
- hashCode = MurmurHash_1.MurmurHash.finish(hashCode, 3);
- return hashCode;
- }
- equals(obj) {
- if (!(obj instanceof Predicate))
- return false;
- if (this === obj)
- return true;
- return this.ruleIndex === obj.ruleIndex &&
- this.predIndex === obj.predIndex &&
- this.isCtxDependent === obj.isCtxDependent;
- }
- toString() {
- return "{" + this.ruleIndex + ":" + this.predIndex + "}?";
- }
- }
- __decorate([
- Decorators_1.Override
- ], Predicate.prototype, "eval", null);
- __decorate([
- Decorators_1.Override
- ], Predicate.prototype, "hashCode", null);
- __decorate([
- Decorators_1.Override
- ], Predicate.prototype, "equals", null);
- __decorate([
- Decorators_1.Override
- ], Predicate.prototype, "toString", null);
- SemanticContext.Predicate = Predicate;
- class PrecedencePredicate extends SemanticContext {
- constructor(precedence) {
- super();
- this.precedence = precedence;
- }
- eval(parser, parserCallStack) {
- return parser.precpred(parserCallStack, this.precedence);
- }
- evalPrecedence(parser, parserCallStack) {
- if (parser.precpred(parserCallStack, this.precedence)) {
- return SemanticContext.NONE;
- }
- else {
- return undefined;
- }
- }
- compareTo(o) {
- return this.precedence - o.precedence;
- }
- hashCode() {
- let hashCode = 1;
- hashCode = 31 * hashCode + this.precedence;
- return hashCode;
- }
- equals(obj) {
- if (!(obj instanceof PrecedencePredicate)) {
- return false;
- }
- if (this === obj) {
- return true;
- }
- return this.precedence === obj.precedence;
- }
- // precedence >= _precedenceStack.peek()
- toString() {
- return "{" + this.precedence + ">=prec}?";
- }
- }
- __decorate([
- Decorators_1.Override
- ], PrecedencePredicate.prototype, "eval", null);
- __decorate([
- Decorators_1.Override
- ], PrecedencePredicate.prototype, "evalPrecedence", null);
- __decorate([
- Decorators_1.Override
- ], PrecedencePredicate.prototype, "compareTo", null);
- __decorate([
- Decorators_1.Override
- ], PrecedencePredicate.prototype, "hashCode", null);
- __decorate([
- Decorators_1.Override
- ], PrecedencePredicate.prototype, "equals", null);
- __decorate([
- Decorators_1.Override
- // precedence >= _precedenceStack.peek()
- ], PrecedencePredicate.prototype, "toString", null);
- SemanticContext.PrecedencePredicate = PrecedencePredicate;
- /**
- * This is the base class for semantic context "operators", which operate on
- * a collection of semantic context "operands".
- *
- * @since 4.3
- */
- class Operator extends SemanticContext {
- }
- SemanticContext.Operator = Operator;
- /**
- * A semantic context which is true whenever none of the contained contexts
- * is false.
- */
- let AND = class AND extends Operator {
- constructor(a, b) {
- super();
- let operands = new Array2DHashSet_1.Array2DHashSet(ObjectEqualityComparator_1.ObjectEqualityComparator.INSTANCE);
- if (a instanceof AND)
- operands.addAll(a.opnds);
- else
- operands.add(a);
- if (b instanceof AND)
- operands.addAll(b.opnds);
- else
- operands.add(b);
- this.opnds = operands.toArray();
- let precedencePredicates = filterPrecedencePredicates(this.opnds);
- // interested in the transition with the lowest precedence
- let reduced = min(precedencePredicates);
- if (reduced) {
- this.opnds.push(reduced);
- }
- }
- get operands() {
- return this.opnds;
- }
- equals(obj) {
- if (this === obj)
- return true;
- if (!(obj instanceof AND))
- return false;
- return ArrayEqualityComparator_1.ArrayEqualityComparator.INSTANCE.equals(this.opnds, obj.opnds);
- }
- hashCode() {
- return MurmurHash_1.MurmurHash.hashCode(this.opnds, AND_HASHCODE);
- }
- /**
- * {@inheritDoc}
- *
- *
- * The evaluation of predicates by this context is short-circuiting, but
- * unordered.
- */
- eval(parser, parserCallStack) {
- for (let opnd of this.opnds) {
- if (!opnd.eval(parser, parserCallStack))
- return false;
- }
- return true;
- }
- evalPrecedence(parser, parserCallStack) {
- let differs = false;
- let operands = [];
- for (let context of this.opnds) {
- let evaluated = context.evalPrecedence(parser, parserCallStack);
- differs = differs || (evaluated !== context);
- if (evaluated == null) {
- // The AND context is false if any element is false
- return undefined;
- }
- else if (evaluated !== SemanticContext.NONE) {
- // Reduce the result by skipping true elements
- operands.push(evaluated);
- }
- }
- if (!differs) {
- return this;
- }
- if (operands.length === 0) {
- // all elements were true, so the AND context is true
- return SemanticContext.NONE;
- }
- let result = operands[0];
- for (let i = 1; i < operands.length; i++) {
- result = SemanticContext.and(result, operands[i]);
- }
- return result;
- }
- toString() {
- return Utils.join(this.opnds, "&&");
- }
- };
- __decorate([
- Decorators_1.Override
- ], AND.prototype, "operands", null);
- __decorate([
- Decorators_1.Override
- ], AND.prototype, "equals", null);
- __decorate([
- Decorators_1.Override
- ], AND.prototype, "hashCode", null);
- __decorate([
- Decorators_1.Override
- ], AND.prototype, "eval", null);
- __decorate([
- Decorators_1.Override
- ], AND.prototype, "evalPrecedence", null);
- __decorate([
- Decorators_1.Override
- ], AND.prototype, "toString", null);
- AND = __decorate([
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.NotNull)
- ], AND);
- SemanticContext.AND = AND;
- /**
- * A semantic context which is true whenever at least one of the contained
- * contexts is true.
- */
- let OR = class OR extends Operator {
- constructor(a, b) {
- super();
- let operands = new Array2DHashSet_1.Array2DHashSet(ObjectEqualityComparator_1.ObjectEqualityComparator.INSTANCE);
- if (a instanceof OR)
- operands.addAll(a.opnds);
- else
- operands.add(a);
- if (b instanceof OR)
- operands.addAll(b.opnds);
- else
- operands.add(b);
- this.opnds = operands.toArray();
- let precedencePredicates = filterPrecedencePredicates(this.opnds);
- // interested in the transition with the highest precedence
- let reduced = max(precedencePredicates);
- if (reduced) {
- this.opnds.push(reduced);
- }
- }
- get operands() {
- return this.opnds;
- }
- equals(obj) {
- if (this === obj)
- return true;
- if (!(obj instanceof OR))
- return false;
- return ArrayEqualityComparator_1.ArrayEqualityComparator.INSTANCE.equals(this.opnds, obj.opnds);
- }
- hashCode() {
- return MurmurHash_1.MurmurHash.hashCode(this.opnds, OR_HASHCODE);
- }
- /**
- * {@inheritDoc}
- *
- *
- * The evaluation of predicates by this context is short-circuiting, but
- * unordered.
- */
- eval(parser, parserCallStack) {
- for (let opnd of this.opnds) {
- if (opnd.eval(parser, parserCallStack))
- return true;
- }
- return false;
- }
- evalPrecedence(parser, parserCallStack) {
- let differs = false;
- let operands = [];
- for (let context of this.opnds) {
- let evaluated = context.evalPrecedence(parser, parserCallStack);
- differs = differs || (evaluated !== context);
- if (evaluated === SemanticContext.NONE) {
- // The OR context is true if any element is true
- return SemanticContext.NONE;
- }
- else if (evaluated) {
- // Reduce the result by skipping false elements
- operands.push(evaluated);
- }
- }
- if (!differs) {
- return this;
- }
- if (operands.length === 0) {
- // all elements were false, so the OR context is false
- return undefined;
- }
- let result = operands[0];
- for (let i = 1; i < operands.length; i++) {
- result = SemanticContext.or(result, operands[i]);
- }
- return result;
- }
- toString() {
- return Utils.join(this.opnds, "||");
- }
- };
- __decorate([
- Decorators_1.Override
- ], OR.prototype, "operands", null);
- __decorate([
- Decorators_1.Override
- ], OR.prototype, "equals", null);
- __decorate([
- Decorators_1.Override
- ], OR.prototype, "hashCode", null);
- __decorate([
- Decorators_1.Override
- ], OR.prototype, "eval", null);
- __decorate([
- Decorators_1.Override
- ], OR.prototype, "evalPrecedence", null);
- __decorate([
- Decorators_1.Override
- ], OR.prototype, "toString", null);
- OR = __decorate([
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.NotNull)
- ], OR);
- SemanticContext.OR = OR;
-})(SemanticContext = exports.SemanticContext || (exports.SemanticContext = {}));
-//# sourceMappingURL=SemanticContext.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/SemanticContext.js.map b/node_modules/antlr4ts/atn/SemanticContext.js.map
deleted file mode 100644
index 0e2aa62..0000000
--- a/node_modules/antlr4ts/atn/SemanticContext.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"SemanticContext.js","sourceRoot":"","sources":["../../../src/atn/SemanticContext.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,2DAAwD;AACxD,6EAA0E;AAG1E,mDAAgD;AAChD,8CAAkD;AAClD,+EAA4E;AAG5E,uCAAuC;AAEvC,aAAsC,KAAkB;IACvD,IAAI,MAAqB,CAAC;IAC1B,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC;QAC3B,EAAE,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC;YAC1B,MAAM,GAAG,OAAO,CAAC;YACjB,QAAQ,CAAC;QACV,CAAC;QAED,IAAI,UAAU,GAAG,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAC3C,EAAE,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,GAAG,OAAO,CAAC;QAClB,CAAC;IACF,CAAC;IAED,MAAM,CAAC,MAAM,CAAC;AACf,CAAC;AAED,aAAsC,KAAkB;IACvD,IAAI,MAAqB,CAAC;IAC1B,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC;QAC3B,EAAE,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC;YAC1B,MAAM,GAAG,OAAO,CAAC;YACjB,QAAQ,CAAC;QACV,CAAC;QAED,IAAI,UAAU,GAAG,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAC3C,EAAE,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,GAAG,OAAO,CAAC;QAClB,CAAC;IACF,CAAC;IAED,MAAM,CAAC,MAAM,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH;IAGC;;;OAGG;IACH,MAAM,KAAK,IAAI;QACd,EAAE,CAAC,CAAC,eAAe,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC;YACzC,eAAe,CAAC,KAAK,GAAG,IAAI,eAAe,CAAC,SAAS,EAAE,CAAC;QACzD,CAAC;QAED,MAAM,CAAC,eAAe,CAAC,KAAK,CAAC;IAC9B,CAAC;IAiBD;;;;;;;;;;;;;;;;;OAiBG;IACH,cAAc,CAAC,MAA4B,EAAE,eAA4B;QACxE,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAMD,MAAM,CAAC,GAAG,CAAC,CAA8B,EAAE,CAAkB;QAC5D,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,eAAe,CAAC,IAAI,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC;QAC/C,EAAE,CAAC,CAAC,CAAC,KAAK,eAAe,CAAC,IAAI,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC;QACzC,IAAI,MAAM,GAAwB,IAAI,eAAe,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChE,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,EAAE,CAAC,CAA8B,EAAE,CAAkB;QAC3D,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACR,MAAM,CAAC,CAAC,CAAC;QACV,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,KAAK,eAAe,CAAC,IAAI,IAAI,CAAC,KAAK,eAAe,CAAC,IAAI,CAAC;YAAC,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC;QAC1F,IAAI,MAAM,GAAuB,IAAI,eAAe,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9D,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;CACD;AApFD,0CAoFC;AAED,WAAiB,eAAe;IAC/B;;OAEG;IACH,MAAM,YAAY,GAAG,QAAQ,CAAC;IAC9B;;OAEG;IACH,MAAM,WAAW,GAAG,SAAS,CAAC;IAE9B,oCAAoC,UAA6B;QAChE,IAAI,MAAM,GAA0C,EAAE,CAAC;QACvD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,IAAI,OAAO,GAAoB,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7C,EAAE,CAAC,CAAC,OAAO,YAAY,eAAe,CAAC,mBAAmB,CAAC,CAAC,CAAC;gBAC5D,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAErB,uFAAuF;gBACvF,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACxB,CAAC,EAAE,CAAC;YACL,CAAC;QACF,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAED,eAAuB,SAAQ,eAAe;QAQ7C,YAAY,YAAoB,CAAC,CAAC,EAAE,YAAoB,CAAC,CAAC,EAAE,iBAA0B,KAAK;YAC1F,KAAK,EAAE,CAAC;YACR,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACtC,CAAC;QAGD,IAAI,CAAI,MAA0B,EAAE,eAA4B;YAC/D,IAAI,QAAQ,GAA4B,IAAI,CAAC,cAAc,GAAG,eAAe,GAAG,SAAS,CAAC;YAC1F,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QACjE,CAAC;QAGD,QAAQ;YACP,IAAI,QAAQ,GAAW,uBAAU,CAAC,UAAU,EAAE,CAAC;YAC/C,QAAQ,GAAG,uBAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YACvD,QAAQ,GAAG,uBAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YACvD,QAAQ,GAAG,uBAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,cAAc,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACpE,QAAQ,GAAG,uBAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,QAAQ,CAAC;QACjB,CAAC;QAGD,MAAM,CAAC,GAAQ;YACd,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,SAAS,CAAC,CAAC;gBAAC,MAAM,CAAC,KAAK,CAAC;YAC9C,EAAE,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC;gBAAC,MAAM,CAAC,IAAI,CAAC;YAC9B,MAAM,CAAC,IAAI,CAAC,SAAS,KAAK,GAAG,CAAC,SAAS;gBACtC,IAAI,CAAC,SAAS,KAAK,GAAG,CAAC,SAAS;gBAChC,IAAI,CAAC,cAAc,KAAK,GAAG,CAAC,cAAc,CAAC;QAC7C,CAAC;QAGD,QAAQ;YACP,MAAM,CAAC,GAAG,GAAG,IAAI,CAAC,SAAS,GAAG,GAAG,GAAG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QAC3D,CAAC;KACD;IA5BA;QADC,qBAAQ;yCAIR;IAGD;QADC,qBAAQ;6CAQR;IAGD;QADC,qBAAQ;2CAOR;IAGD;QADC,qBAAQ;6CAGR;IA3CW,yBAAS,YA4CrB,CAAA;IAED,yBAAiC,SAAQ,eAAe;QAGvD,YAAY,UAAkB;YAC7B,KAAK,EAAE,CAAC;YACR,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC9B,CAAC;QAGD,IAAI,CAAI,MAA0B,EAAE,eAA4B;YAC/D,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,eAAe,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1D,CAAC;QAGD,cAAc,CAAC,MAA4B,EAAE,eAA4B;YACxE,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,eAAe,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBACvD,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC;YAC7B,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,MAAM,CAAC,SAAS,CAAC;YAClB,CAAC;QACF,CAAC;QAGD,SAAS,CAAC,CAAsB;YAC/B,MAAM,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;QACvC,CAAC;QAGD,QAAQ;YACP,IAAI,QAAQ,GAAW,CAAC,CAAC;YACzB,QAAQ,GAAG,EAAE,GAAG,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC;YAC3C,MAAM,CAAC,QAAQ,CAAC;QACjB,CAAC;QAGD,MAAM,CAAC,GAAQ;YACd,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,mBAAmB,CAAC,CAAC,CAAC,CAAC;gBAC3C,MAAM,CAAC,KAAK,CAAC;YACd,CAAC;YAED,EAAE,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;gBAClB,MAAM,CAAC,IAAI,CAAC;YACb,CAAC;YAED,MAAM,CAAC,IAAI,CAAC,UAAU,KAAK,GAAG,CAAC,UAAU,CAAC;QAC3C,CAAC;QAID,AADA,wCAAwC;QACxC,QAAQ;YACP,MAAM,CAAC,GAAG,GAAG,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC3C,CAAC;KACD;IA5CA;QADC,qBAAQ;mDAGR;IAGD;QADC,qBAAQ;6DAQR;IAGD;QADC,qBAAQ;wDAGR;IAGD;QADC,qBAAQ;uDAKR;IAGD;QADC,qBAAQ;qDAWR;IAID;QAFC,qBAAQ;QACT,wCAAwC;uDAGvC;IApDW,mCAAmB,sBAqD/B,CAAA;IAED;;;;;OAKG;IACH,cAA+B,SAAQ,eAAe;KAWrD;IAXqB,wBAAQ,WAW7B,CAAA;IAED;;;OAGG;IACH,IAAa,GAAG,GAAhB,SAAiB,SAAQ,QAAQ;QAGhC,YAAqB,CAAkB,EAAW,CAAkB;YACnE,KAAK,EAAE,CAAA;YAEP,IAAI,QAAQ,GAAoC,IAAI,+BAAc,CAAkB,mDAAwB,CAAC,QAAQ,CAAC,CAAC;YACvH,EAAE,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC;gBAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAC/C,IAAI;gBAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACrB,EAAE,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC;gBAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAC/C,IAAI;gBAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAErB,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;YAChC,IAAI,oBAAoB,GAA0B,0BAA0B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAEzF,0DAA0D;YAC1D,IAAI,OAAO,GAAG,GAAG,CAAC,oBAAoB,CAAC,CAAC;YACxC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;gBACb,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1B,CAAC;QACF,CAAC;QAGD,IAAI,QAAQ;YACX,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;QACnB,CAAC;QAGD,MAAM,CAAC,GAAQ;YACd,EAAE,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC;gBAAC,MAAM,CAAC,IAAI,CAAC;YAC9B,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,GAAG,CAAC,CAAC;gBAAC,MAAM,CAAC,KAAK,CAAC;YACxC,MAAM,CAAC,iDAAuB,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QACvE,CAAC;QAGD,QAAQ;YACP,MAAM,CAAC,uBAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;QACtD,CAAC;QAED;;;;;;WAMG;QAEH,IAAI,CAAI,MAA0B,EAAE,eAA4B;YAC/D,GAAG,CAAC,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBAC7B,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;oBAAC,MAAM,CAAC,KAAK,CAAC;YACvD,CAAC;YAED,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAGD,cAAc,CAAC,MAA4B,EAAE,eAA4B;YACxE,IAAI,OAAO,GAAY,KAAK,CAAC;YAC7B,IAAI,QAAQ,GAAsB,EAAE,CAAC;YACrC,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBAChC,IAAI,SAAS,GAAgC,OAAO,CAAC,cAAc,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;gBAC7F,OAAO,GAAG,OAAO,IAAI,CAAC,SAAS,KAAK,OAAO,CAAC,CAAC;gBAC7C,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC;oBACvB,mDAAmD;oBACnD,MAAM,CAAC,SAAS,CAAC;gBAClB,CAAC;gBACD,IAAI,CAAC,EAAE,CAAC,CAAC,SAAS,KAAK,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;oBAC7C,8CAA8C;oBAC9C,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC1B,CAAC;YACF,CAAC;YAED,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;gBACd,MAAM,CAAC,IAAI,CAAC;YACb,CAAC;YAED,EAAE,CAAC,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC3B,qDAAqD;gBACrD,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC;YAC7B,CAAC;YAED,IAAI,MAAM,GAAoB,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACnD,CAAC;YAED,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAGD,QAAQ;YACP,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACrC,CAAC;KACD,CAAA;IAtEA;QADC,qBAAQ;uCAGR;IAGD;QADC,qBAAQ;qCAKR;IAGD;QADC,qBAAQ;uCAGR;IAUD;QADC,qBAAQ;mCAOR;IAGD;QADC,qBAAQ;6CAgCR;IAGD;QADC,qBAAQ;uCAGR;IA5FW,GAAG;QAGF,WAAA,oBAAO,CAAA,EAAsB,WAAA,oBAAO,CAAA;OAHrC,GAAG,CA6Ff;IA7FY,mBAAG,MA6Ff,CAAA;IAED;;;OAGG;IACH,IAAa,EAAE,GAAf,QAAgB,SAAQ,QAAQ;QAG/B,YAAqB,CAAkB,EAAW,CAAkB;YACnE,KAAK,EAAE,CAAC;YAER,IAAI,QAAQ,GAAoC,IAAI,+BAAc,CAAkB,mDAAwB,CAAC,QAAQ,CAAC,CAAC;YACvH,EAAE,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC;gBAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAC9C,IAAI;gBAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACrB,EAAE,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC;gBAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAC9C,IAAI;gBAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAErB,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;YAChC,IAAI,oBAAoB,GAA0B,0BAA0B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAEzF,2DAA2D;YAC3D,IAAI,OAAO,GAAG,GAAG,CAAC,oBAAoB,CAAC,CAAC;YACxC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;gBACb,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1B,CAAC;QACF,CAAC;QAGD,IAAI,QAAQ;YACX,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;QACnB,CAAC;QAGD,MAAM,CAAC,GAAQ;YACd,EAAE,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC;gBAAC,MAAM,CAAC,IAAI,CAAC;YAC9B,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,EAAE,CAAC,CAAC;gBAAC,MAAM,CAAC,KAAK,CAAC;YACvC,MAAM,CAAC,iDAAuB,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QACvE,CAAC;QAGD,QAAQ;YACP,MAAM,CAAC,uBAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QACrD,CAAC;QAED;;;;;;WAMG;QAEH,IAAI,CAAI,MAA0B,EAAE,eAA4B;YAC/D,GAAG,CAAC,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;oBAAC,MAAM,CAAC,IAAI,CAAC;YACrD,CAAC;YAED,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAGD,cAAc,CAAC,MAA4B,EAAE,eAA4B;YACxE,IAAI,OAAO,GAAY,KAAK,CAAC;YAC7B,IAAI,QAAQ,GAAsB,EAAE,CAAC;YACrC,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBAChC,IAAI,SAAS,GAAgC,OAAO,CAAC,cAAc,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;gBAC7F,OAAO,GAAG,OAAO,IAAI,CAAC,SAAS,KAAK,OAAO,CAAC,CAAC;gBAC7C,EAAE,CAAC,CAAC,SAAS,KAAK,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;oBACxC,gDAAgD;oBAChD,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC;gBAC7B,CAAC;gBAAC,IAAI,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;oBACtB,+CAA+C;oBAC/C,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC1B,CAAC;YACF,CAAC;YAED,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;gBACd,MAAM,CAAC,IAAI,CAAC;YACb,CAAC;YAED,EAAE,CAAC,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC3B,sDAAsD;gBACtD,MAAM,CAAC,SAAS,CAAC;YAClB,CAAC;YAED,IAAI,MAAM,GAAoB,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,GAAG,eAAe,CAAC,EAAE,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAClD,CAAC;YAED,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAGD,QAAQ;YACP,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACrC,CAAC;KACD,CAAA;IArEA;QADC,qBAAQ;sCAGR;IAGD;QADC,qBAAQ;oCAKR;IAGD;QADC,qBAAQ;sCAGR;IAUD;QADC,qBAAQ;kCAOR;IAGD;QADC,qBAAQ;4CA+BR;IAGD;QADC,qBAAQ;sCAGR;IA3FW,EAAE;QAGD,WAAA,oBAAO,CAAA,EAAsB,WAAA,oBAAO,CAAA;OAHrC,EAAE,CA4Fd;IA5FY,kBAAE,KA4Fd,CAAA;AACF,CAAC,EAtVgB,eAAe,GAAf,uBAAe,KAAf,uBAAe,QAsV/B"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/SetTransition.d.ts b/node_modules/antlr4ts/atn/SetTransition.d.ts
deleted file mode 100644
index 93a751b..0000000
--- a/node_modules/antlr4ts/atn/SetTransition.d.ts
+++ /dev/null
@@ -1,17 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { IntervalSet } from '../misc/IntervalSet';
-import { Transition } from './Transition';
-import { TransitionType } from './TransitionType';
-/** A transition containing a set of values. */
-export declare class SetTransition extends Transition {
- set: IntervalSet;
- constructor(target: ATNState, set: IntervalSet);
- readonly serializationType: TransitionType;
- readonly label: IntervalSet;
- matches(symbol: number, minVocabSymbol: number, maxVocabSymbol: number): boolean;
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/atn/SetTransition.js b/node_modules/antlr4ts/atn/SetTransition.js
deleted file mode 100644
index e06f52f..0000000
--- a/node_modules/antlr4ts/atn/SetTransition.js
+++ /dev/null
@@ -1,64 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const IntervalSet_1 = require("../misc/IntervalSet");
-const Decorators_1 = require("../Decorators");
-const Token_1 = require("../Token");
-const Transition_1 = require("./Transition");
-/** A transition containing a set of values. */
-let SetTransition = class SetTransition extends Transition_1.Transition {
- // TODO (sam): should we really allow null here?
- constructor(target, set) {
- super(target);
- if (set == null) {
- set = IntervalSet_1.IntervalSet.of(Token_1.Token.INVALID_TYPE);
- }
- this.set = set;
- }
- get serializationType() {
- return 7 /* SET */;
- }
- get label() {
- return this.set;
- }
- matches(symbol, minVocabSymbol, maxVocabSymbol) {
- return this.set.contains(symbol);
- }
- toString() {
- return this.set.toString();
- }
-};
-__decorate([
- Decorators_1.NotNull
-], SetTransition.prototype, "set", void 0);
-__decorate([
- Decorators_1.Override
-], SetTransition.prototype, "serializationType", null);
-__decorate([
- Decorators_1.Override,
- Decorators_1.NotNull
-], SetTransition.prototype, "label", null);
-__decorate([
- Decorators_1.Override
-], SetTransition.prototype, "matches", null);
-__decorate([
- Decorators_1.Override,
- Decorators_1.NotNull
-], SetTransition.prototype, "toString", null);
-SetTransition = __decorate([
- __param(0, Decorators_1.NotNull), __param(1, Decorators_1.Nullable)
-], SetTransition);
-exports.SetTransition = SetTransition;
-//# sourceMappingURL=SetTransition.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/SetTransition.js.map b/node_modules/antlr4ts/atn/SetTransition.js.map
deleted file mode 100644
index 71ed055..0000000
--- a/node_modules/antlr4ts/atn/SetTransition.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"SetTransition.js","sourceRoot":"","sources":["../../../src/atn/SetTransition.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAKH,qDAAkD;AAClD,8CAA4D;AAC5D,oCAAiC;AACjC,6CAA0C;AAG1C,+CAA+C;AAC/C,IAAa,aAAa,GAA1B,mBAA2B,SAAQ,uBAAU;IAI5C,gDAAgD;IAChD,YAAqB,MAAgB,EAAY,GAAgB;QAChE,KAAK,CAAC,MAAM,CAAC,CAAC;QACd,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC;YACjB,GAAG,GAAG,yBAAW,CAAC,EAAE,CAAC,aAAK,CAAC,YAAY,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IAChB,CAAC;IAGD,IAAI,iBAAiB;QACpB,MAAM,aAAoB;IAC3B,CAAC;IAID,IAAI,KAAK;QACR,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;IACjB,CAAC;IAGD,OAAO,CAAC,MAAc,EAAE,cAAsB,EAAE,cAAsB;QACrE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;IAID,QAAQ;QACP,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC5B,CAAC;CACD,CAAA;AAjCA;IADC,oBAAO;0CACS;AAajB;IADC,qBAAQ;sDAGR;AAID;IAFC,qBAAQ;IACR,oBAAO;0CAGP;AAGD;IADC,qBAAQ;4CAGR;AAID;IAFC,qBAAQ;IACR,oBAAO;6CAGP;AAlCW,aAAa;IAKZ,WAAA,oBAAO,CAAA,EAAoB,WAAA,qBAAQ,CAAA;GALpC,aAAa,CAmCzB;AAnCY,sCAAa"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/SimulatorState.d.ts b/node_modules/antlr4ts/atn/SimulatorState.d.ts
deleted file mode 100644
index 93bb1d1..0000000
--- a/node_modules/antlr4ts/atn/SimulatorState.d.ts
+++ /dev/null
@@ -1,17 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { DFAState } from '../dfa/DFAState';
-import { ParserRuleContext } from '../ParserRuleContext';
-/**
- *
- * @author Sam Harwell
- */
-export declare class SimulatorState {
- outerContext: ParserRuleContext;
- s0: DFAState;
- useContext: boolean;
- remainingOuterContext: ParserRuleContext | undefined;
- constructor(outerContext: ParserRuleContext, s0: DFAState, useContext: boolean, remainingOuterContext: ParserRuleContext | undefined);
-}
diff --git a/node_modules/antlr4ts/atn/SimulatorState.js b/node_modules/antlr4ts/atn/SimulatorState.js
deleted file mode 100644
index 425d2cc..0000000
--- a/node_modules/antlr4ts/atn/SimulatorState.js
+++ /dev/null
@@ -1,34 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const Decorators_1 = require("../Decorators");
-const ParserRuleContext_1 = require("../ParserRuleContext");
-/**
- *
- * @author Sam Harwell
- */
-let SimulatorState = class SimulatorState {
- constructor(outerContext, s0, useContext, remainingOuterContext) {
- this.outerContext = outerContext != null ? outerContext : ParserRuleContext_1.ParserRuleContext.emptyContext();
- this.s0 = s0;
- this.useContext = useContext;
- this.remainingOuterContext = remainingOuterContext;
- }
-};
-SimulatorState = __decorate([
- __param(1, Decorators_1.NotNull)
-], SimulatorState);
-exports.SimulatorState = SimulatorState;
-//# sourceMappingURL=SimulatorState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/SimulatorState.js.map b/node_modules/antlr4ts/atn/SimulatorState.js.map
deleted file mode 100644
index c6722ca..0000000
--- a/node_modules/antlr4ts/atn/SimulatorState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"SimulatorState.js","sourceRoot":"","sources":["../../../src/atn/SimulatorState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAKH,8CAAwC;AACxC,4DAAyD;AAEzD;;;GAGG;AACH,IAAa,cAAc,GAA3B;IAQC,YAAY,YAA+B,EAAW,EAAY,EAAE,UAAmB,EAAE,qBAAoD;QAC5I,IAAI,CAAC,YAAY,GAAG,YAAY,IAAI,IAAI,GAAG,YAAY,GAAG,qCAAiB,CAAC,YAAY,EAAE,CAAC;QAC3F,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,qBAAqB,GAAG,qBAAqB,CAAC;IACpD,CAAC;CACD,CAAA;AAdY,cAAc;IAQoB,WAAA,oBAAO,CAAA;GARzC,cAAc,CAc1B;AAdY,wCAAc"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/StarBlockStartState.d.ts b/node_modules/antlr4ts/atn/StarBlockStartState.d.ts
deleted file mode 100644
index 3232742..0000000
--- a/node_modules/antlr4ts/atn/StarBlockStartState.d.ts
+++ /dev/null
@@ -1,10 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNStateType } from './ATNStateType';
-import { BlockStartState } from './BlockStartState';
-/** The block that begins a closure loop. */
-export declare class StarBlockStartState extends BlockStartState {
- readonly stateType: ATNStateType;
-}
diff --git a/node_modules/antlr4ts/atn/StarBlockStartState.js b/node_modules/antlr4ts/atn/StarBlockStartState.js
deleted file mode 100644
index 9e8e44c..0000000
--- a/node_modules/antlr4ts/atn/StarBlockStartState.js
+++ /dev/null
@@ -1,25 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const BlockStartState_1 = require("./BlockStartState");
-const Decorators_1 = require("../Decorators");
-/** The block that begins a closure loop. */
-class StarBlockStartState extends BlockStartState_1.BlockStartState {
- get stateType() {
- return 5 /* STAR_BLOCK_START */;
- }
-}
-__decorate([
- Decorators_1.Override
-], StarBlockStartState.prototype, "stateType", null);
-exports.StarBlockStartState = StarBlockStartState;
-//# sourceMappingURL=StarBlockStartState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/StarBlockStartState.js.map b/node_modules/antlr4ts/atn/StarBlockStartState.js.map
deleted file mode 100644
index 81e2ed5..0000000
--- a/node_modules/antlr4ts/atn/StarBlockStartState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"StarBlockStartState.js","sourceRoot":"","sources":["../../../src/atn/StarBlockStartState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAMH,uDAAoD;AACpD,8CAAyC;AAEzC,4CAA4C;AAC5C,yBAAiC,SAAQ,iCAAe;IAGvD,IAAI,SAAS;QACZ,MAAM,0BAA+B;IACtC,CAAC;CACD;AAHA;IADC,qBAAQ;oDAGR;AALF,kDAMC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/StarLoopEntryState.d.ts b/node_modules/antlr4ts/atn/StarLoopEntryState.d.ts
deleted file mode 100644
index a460fcc..0000000
--- a/node_modules/antlr4ts/atn/StarLoopEntryState.d.ts
+++ /dev/null
@@ -1,39 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNStateType } from './ATNStateType';
-import { BitSet } from '../misc/BitSet';
-import { DecisionState } from './DecisionState';
-import { StarLoopbackState } from './StarLoopbackState';
-export declare class StarLoopEntryState extends DecisionState {
- loopBackState: StarLoopbackState;
- /**
- * Indicates whether this state can benefit from a precedence DFA during SLL
- * decision making.
- *
- * This is a computed property that is calculated during ATN deserialization
- * and stored for use in {@link ParserATNSimulator} and
- * {@link ParserInterpreter}.
- *
- * @see `DFA.isPrecedenceDfa`
- */
- precedenceRuleDecision: boolean;
- /**
- * For precedence decisions, this set marks states S which have all
- * of the following characteristics:
- *
- *
- * - One or more invocation sites of the current rule returns to
- * S.
- * - The closure from S includes the current decision without
- * passing through any rule invocations or stepping out of the current
- * rule.
- *
- *
- * This field is not used when {@link #isPrecedenceDecision} is
- * {@code false}.
- */
- precedenceLoopbackStates: BitSet;
- readonly stateType: ATNStateType;
-}
diff --git a/node_modules/antlr4ts/atn/StarLoopEntryState.js b/node_modules/antlr4ts/atn/StarLoopEntryState.js
deleted file mode 100644
index c775c29..0000000
--- a/node_modules/antlr4ts/atn/StarLoopEntryState.js
+++ /dev/null
@@ -1,55 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const BitSet_1 = require("../misc/BitSet");
-const DecisionState_1 = require("./DecisionState");
-const Decorators_1 = require("../Decorators");
-class StarLoopEntryState extends DecisionState_1.DecisionState {
- constructor() {
- super(...arguments);
- /**
- * Indicates whether this state can benefit from a precedence DFA during SLL
- * decision making.
- *
- * This is a computed property that is calculated during ATN deserialization
- * and stored for use in {@link ParserATNSimulator} and
- * {@link ParserInterpreter}.
- *
- * @see `DFA.isPrecedenceDfa`
- */
- this.precedenceRuleDecision = false;
- /**
- * For precedence decisions, this set marks states S which have all
- * of the following characteristics:
- *
- *
- * - One or more invocation sites of the current rule returns to
- * S.
- * - The closure from S includes the current decision without
- * passing through any rule invocations or stepping out of the current
- * rule.
- *
- *
- * This field is not used when {@link #isPrecedenceDecision} is
- * {@code false}.
- */
- this.precedenceLoopbackStates = new BitSet_1.BitSet();
- }
- get stateType() {
- return 10 /* STAR_LOOP_ENTRY */;
- }
-}
-__decorate([
- Decorators_1.Override
-], StarLoopEntryState.prototype, "stateType", null);
-exports.StarLoopEntryState = StarLoopEntryState;
-//# sourceMappingURL=StarLoopEntryState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/StarLoopEntryState.js.map b/node_modules/antlr4ts/atn/StarLoopEntryState.js.map
deleted file mode 100644
index f4e41d3..0000000
--- a/node_modules/antlr4ts/atn/StarLoopEntryState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"StarLoopEntryState.js","sourceRoot":"","sources":["../../../src/atn/StarLoopEntryState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAKH,2CAAwC;AACxC,mDAAgD;AAChD,8CAAyC;AAGzC,wBAAgC,SAAQ,6BAAa;IAArD;;QAGC;;;;;;;;;WASG;QACH,2BAAsB,GAAY,KAAK,CAAC;QAExC;;;;;;;;;;;;;;WAcG;QACH,6BAAwB,GAAW,IAAI,eAAM,EAAE,CAAC;IAMjD,CAAC;IAHA,IAAI,SAAS;QACZ,MAAM,0BAA8B;IACrC,CAAC;CACD;AAHA;IADC,qBAAQ;mDAGR;AAnCF,gDAoCC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/StarLoopbackState.d.ts b/node_modules/antlr4ts/atn/StarLoopbackState.d.ts
deleted file mode 100644
index 9a6e8b6..0000000
--- a/node_modules/antlr4ts/atn/StarLoopbackState.d.ts
+++ /dev/null
@@ -1,11 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { ATNStateType } from './ATNStateType';
-import { StarLoopEntryState } from './StarLoopEntryState';
-export declare class StarLoopbackState extends ATNState {
- readonly loopEntryState: StarLoopEntryState;
- readonly stateType: ATNStateType;
-}
diff --git a/node_modules/antlr4ts/atn/StarLoopbackState.js b/node_modules/antlr4ts/atn/StarLoopbackState.js
deleted file mode 100644
index b511026..0000000
--- a/node_modules/antlr4ts/atn/StarLoopbackState.js
+++ /dev/null
@@ -1,28 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:37.6368726-07:00
-const ATNState_1 = require("./ATNState");
-const Decorators_1 = require("../Decorators");
-class StarLoopbackState extends ATNState_1.ATNState {
- get loopEntryState() {
- return this.transition(0).target;
- }
- get stateType() {
- return 9 /* STAR_LOOP_BACK */;
- }
-}
-__decorate([
- Decorators_1.Override
-], StarLoopbackState.prototype, "stateType", null);
-exports.StarLoopbackState = StarLoopbackState;
-//# sourceMappingURL=StarLoopbackState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/StarLoopbackState.js.map b/node_modules/antlr4ts/atn/StarLoopbackState.js.map
deleted file mode 100644
index a04fd16..0000000
--- a/node_modules/antlr4ts/atn/StarLoopbackState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"StarLoopbackState.js","sourceRoot":"","sources":["../../../src/atn/StarLoopbackState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAEH,wDAAwD;AAExD,yCAAsC;AAEtC,8CAAyC;AAGzC,uBAA+B,SAAQ,mBAAQ;IAC9C,IAAI,cAAc;QACjB,MAAM,CAAqB,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACtD,CAAC;IAGD,IAAI,SAAS;QACZ,MAAM,wBAA6B;IACpC,CAAC;CACD;AAHA;IADC,qBAAQ;kDAGR;AARF,8CASC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/TokensStartState.d.ts b/node_modules/antlr4ts/atn/TokensStartState.d.ts
deleted file mode 100644
index da954a7..0000000
--- a/node_modules/antlr4ts/atn/TokensStartState.d.ts
+++ /dev/null
@@ -1,10 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNStateType } from './ATNStateType';
-import { DecisionState } from './DecisionState';
-/** The Tokens rule start state linking to each lexer rule start state */
-export declare class TokensStartState extends DecisionState {
- readonly stateType: ATNStateType;
-}
diff --git a/node_modules/antlr4ts/atn/TokensStartState.js b/node_modules/antlr4ts/atn/TokensStartState.js
deleted file mode 100644
index aca45c3..0000000
--- a/node_modules/antlr4ts/atn/TokensStartState.js
+++ /dev/null
@@ -1,25 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const DecisionState_1 = require("./DecisionState");
-const Decorators_1 = require("../Decorators");
-/** The Tokens rule start state linking to each lexer rule start state */
-class TokensStartState extends DecisionState_1.DecisionState {
- get stateType() {
- return 6 /* TOKEN_START */;
- }
-}
-__decorate([
- Decorators_1.Override
-], TokensStartState.prototype, "stateType", null);
-exports.TokensStartState = TokensStartState;
-//# sourceMappingURL=TokensStartState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/TokensStartState.js.map b/node_modules/antlr4ts/atn/TokensStartState.js.map
deleted file mode 100644
index 8aaeb20..0000000
--- a/node_modules/antlr4ts/atn/TokensStartState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"TokensStartState.js","sourceRoot":"","sources":["../../../src/atn/TokensStartState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAKH,mDAAgD;AAChD,8CAAyC;AAEzC,yEAAyE;AACzE,sBAA8B,SAAQ,6BAAa;IAGlD,IAAI,SAAS;QACZ,MAAM,qBAA0B;IACjC,CAAC;CACD;AAHA;IADC,qBAAQ;iDAGR;AALF,4CAMC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/Transition.d.ts b/node_modules/antlr4ts/atn/Transition.d.ts
deleted file mode 100644
index 7e323a1..0000000
--- a/node_modules/antlr4ts/atn/Transition.d.ts
+++ /dev/null
@@ -1,38 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { IntervalSet } from '../misc/IntervalSet';
-import { TransitionType } from './TransitionType';
-/** An ATN transition between any two ATN states. Subclasses define
- * atom, set, epsilon, action, predicate, rule transitions.
- *
- * This is a one way link. It emanates from a state (usually via a list of
- * transitions) and has a target state.
- *
- * Since we never have to change the ATN transitions once we construct it,
- * we can fix these transitions as specific classes. The DFA transitions
- * on the other hand need to update the labels as it adds transitions to
- * the states. We'll use the term Edge for the DFA to distinguish them from
- * ATN transitions.
- */
-export declare abstract class Transition {
- static readonly serializationNames: string[];
- /** The target of this transition. */
- target: ATNState;
- constructor(target: ATNState);
- readonly abstract serializationType: TransitionType;
- /**
- * Determines if the transition is an "epsilon" transition.
- *
- * The default implementation returns {@code false}.
- *
- * @return {@code true} if traversing this transition in the ATN does not
- * consume an input symbol; otherwise, {@code false} if traversing this
- * transition consumes (matches) an input symbol.
- */
- readonly isEpsilon: boolean;
- readonly label: IntervalSet | undefined;
- abstract matches(symbol: number, minVocabSymbol: number, maxVocabSymbol: number): boolean;
-}
diff --git a/node_modules/antlr4ts/atn/Transition.js b/node_modules/antlr4ts/atn/Transition.js
deleted file mode 100644
index ce18e91..0000000
--- a/node_modules/antlr4ts/atn/Transition.js
+++ /dev/null
@@ -1,72 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const Decorators_1 = require("../Decorators");
-/** An ATN transition between any two ATN states. Subclasses define
- * atom, set, epsilon, action, predicate, rule transitions.
- *
- * This is a one way link. It emanates from a state (usually via a list of
- * transitions) and has a target state.
- *
- * Since we never have to change the ATN transitions once we construct it,
- * we can fix these transitions as specific classes. The DFA transitions
- * on the other hand need to update the labels as it adds transitions to
- * the states. We'll use the term Edge for the DFA to distinguish them from
- * ATN transitions.
- */
-let Transition = class Transition {
- constructor(target) {
- if (target == null) {
- throw new Error("target cannot be null.");
- }
- this.target = target;
- }
- /**
- * Determines if the transition is an "epsilon" transition.
- *
- * The default implementation returns {@code false}.
- *
- * @return {@code true} if traversing this transition in the ATN does not
- * consume an input symbol; otherwise, {@code false} if traversing this
- * transition consumes (matches) an input symbol.
- */
- get isEpsilon() {
- return false;
- }
- get label() {
- return undefined;
- }
-};
-Transition.serializationNames = [
- "INVALID",
- "EPSILON",
- "RANGE",
- "RULE",
- "PREDICATE",
- "ATOM",
- "ACTION",
- "SET",
- "NOT_SET",
- "WILDCARD",
- "PRECEDENCE"
-];
-__decorate([
- Decorators_1.NotNull
-], Transition.prototype, "target", void 0);
-Transition = __decorate([
- __param(0, Decorators_1.NotNull)
-], Transition);
-exports.Transition = Transition;
-//# sourceMappingURL=Transition.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/Transition.js.map b/node_modules/antlr4ts/atn/Transition.js.map
deleted file mode 100644
index e87c3b2..0000000
--- a/node_modules/antlr4ts/atn/Transition.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"Transition.js","sourceRoot":"","sources":["../../../src/atn/Transition.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAMH,8CAAwC;AAGxC;;;;;;;;;;;GAWG;AACH,IAAsB,UAAU,GAAhC;IAkCC,YAAqB,MAAgB;QACpC,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;QAC3C,CAAC;QAED,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACtB,CAAC;IAID;;;;;;;;OAQG;IACH,IAAI,SAAS;QACZ,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED,IAAI,KAAK;QACR,MAAM,CAAC,SAAS,CAAC;IAClB,CAAC;CAGD,CAAA;AA7DgB,6BAAkB,GAAa;IAC9C,SAAS;IACT,SAAS;IACT,OAAO;IACP,MAAM;IACN,WAAW;IACX,MAAM;IACN,QAAQ;IACR,KAAK;IACL,SAAS;IACT,UAAU;IACV,YAAY;CACZ,CAAC;AAmBF;IADC,oBAAO;0CACS;AAhCI,UAAU;IAkClB,WAAA,oBAAO,CAAA;GAlCC,UAAU,CA8D/B;AA9DqB,gCAAU"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/TransitionType.d.ts b/node_modules/antlr4ts/atn/TransitionType.d.ts
deleted file mode 100644
index 0edb144..0000000
--- a/node_modules/antlr4ts/atn/TransitionType.d.ts
+++ /dev/null
@@ -1,16 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-export declare const enum TransitionType {
- EPSILON = 1,
- RANGE = 2,
- RULE = 3,
- PREDICATE = 4,
- ATOM = 5,
- ACTION = 6,
- SET = 7,
- NOT_SET = 8,
- WILDCARD = 9,
- PRECEDENCE = 10,
-}
diff --git a/node_modules/antlr4ts/atn/TransitionType.js b/node_modules/antlr4ts/atn/TransitionType.js
deleted file mode 100644
index 6eceeae..0000000
--- a/node_modules/antlr4ts/atn/TransitionType.js
+++ /dev/null
@@ -1,22 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:37.8530496-07:00
-var TransitionType;
-(function (TransitionType) {
- // constants for serialization
- TransitionType[TransitionType["EPSILON"] = 1] = "EPSILON";
- TransitionType[TransitionType["RANGE"] = 2] = "RANGE";
- TransitionType[TransitionType["RULE"] = 3] = "RULE";
- TransitionType[TransitionType["PREDICATE"] = 4] = "PREDICATE";
- TransitionType[TransitionType["ATOM"] = 5] = "ATOM";
- TransitionType[TransitionType["ACTION"] = 6] = "ACTION";
- TransitionType[TransitionType["SET"] = 7] = "SET";
- TransitionType[TransitionType["NOT_SET"] = 8] = "NOT_SET";
- TransitionType[TransitionType["WILDCARD"] = 9] = "WILDCARD";
- TransitionType[TransitionType["PRECEDENCE"] = 10] = "PRECEDENCE";
-})(TransitionType = exports.TransitionType || (exports.TransitionType = {}));
-//# sourceMappingURL=TransitionType.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/TransitionType.js.map b/node_modules/antlr4ts/atn/TransitionType.js.map
deleted file mode 100644
index f28cd17..0000000
--- a/node_modules/antlr4ts/atn/TransitionType.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"TransitionType.js","sourceRoot":"","sources":["../../../src/atn/TransitionType.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,wDAAwD;AAExD,IAAkB,cAYjB;AAZD,WAAkB,cAAc;IAC/B,8BAA8B;IAC9B,yDAAW,CAAA;IACX,qDAAS,CAAA;IACT,mDAAQ,CAAA;IACR,6DAAa,CAAA;IACb,mDAAQ,CAAA;IACR,uDAAU,CAAA;IACV,iDAAO,CAAA;IACP,yDAAW,CAAA;IACX,2DAAY,CAAA;IACZ,gEAAe,CAAA;AAChB,CAAC,EAZiB,cAAc,GAAd,sBAAc,KAAd,sBAAc,QAY/B"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/WildcardTransition.d.ts b/node_modules/antlr4ts/atn/WildcardTransition.d.ts
deleted file mode 100644
index 52ebf24..0000000
--- a/node_modules/antlr4ts/atn/WildcardTransition.d.ts
+++ /dev/null
@@ -1,13 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATNState } from './ATNState';
-import { Transition } from './Transition';
-import { TransitionType } from './TransitionType';
-export declare class WildcardTransition extends Transition {
- constructor(target: ATNState);
- readonly serializationType: TransitionType;
- matches(symbol: number, minVocabSymbol: number, maxVocabSymbol: number): boolean;
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/atn/WildcardTransition.js b/node_modules/antlr4ts/atn/WildcardTransition.js
deleted file mode 100644
index 68ebafe..0000000
--- a/node_modules/antlr4ts/atn/WildcardTransition.js
+++ /dev/null
@@ -1,46 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const Decorators_1 = require("../Decorators");
-const Transition_1 = require("./Transition");
-let WildcardTransition = class WildcardTransition extends Transition_1.Transition {
- constructor(target) {
- super(target);
- }
- get serializationType() {
- return 9 /* WILDCARD */;
- }
- matches(symbol, minVocabSymbol, maxVocabSymbol) {
- return symbol >= minVocabSymbol && symbol <= maxVocabSymbol;
- }
- toString() {
- return ".";
- }
-};
-__decorate([
- Decorators_1.Override
-], WildcardTransition.prototype, "serializationType", null);
-__decorate([
- Decorators_1.Override
-], WildcardTransition.prototype, "matches", null);
-__decorate([
- Decorators_1.Override,
- Decorators_1.NotNull
-], WildcardTransition.prototype, "toString", null);
-WildcardTransition = __decorate([
- __param(0, Decorators_1.NotNull)
-], WildcardTransition);
-exports.WildcardTransition = WildcardTransition;
-//# sourceMappingURL=WildcardTransition.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/WildcardTransition.js.map b/node_modules/antlr4ts/atn/WildcardTransition.js.map
deleted file mode 100644
index 3737efb..0000000
--- a/node_modules/antlr4ts/atn/WildcardTransition.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"WildcardTransition.js","sourceRoot":"","sources":["../../../src/atn/WildcardTransition.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAKH,8CAAkD;AAClD,6CAA0C;AAG1C,IAAa,kBAAkB,GAA/B,wBAAgC,SAAQ,uBAAU;IACjD,YAAqB,MAAgB;QACpC,KAAK,CAAC,MAAM,CAAC,CAAC;IACf,CAAC;IAGD,IAAI,iBAAiB;QACpB,MAAM,kBAAyB;IAChC,CAAC;IAGD,OAAO,CAAC,MAAc,EAAE,cAAsB,EAAE,cAAsB;QACrE,MAAM,CAAC,MAAM,IAAI,cAAc,IAAI,MAAM,IAAI,cAAc,CAAC;IAC7D,CAAC;IAID,QAAQ;QACP,MAAM,CAAC,GAAG,CAAC;IACZ,CAAC;CACD,CAAA;AAdA;IADC,qBAAQ;2DAGR;AAGD;IADC,qBAAQ;iDAGR;AAID;IAFC,qBAAQ;IACR,oBAAO;kDAGP;AAnBW,kBAAkB;IACjB,WAAA,oBAAO,CAAA;GADR,kBAAkB,CAoB9B;AApBY,gDAAkB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/index.d.ts b/node_modules/antlr4ts/atn/index.d.ts
deleted file mode 100644
index 56900a9..0000000
--- a/node_modules/antlr4ts/atn/index.d.ts
+++ /dev/null
@@ -1,72 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-export * from './AbstractPredicateTransition';
-export * from './ActionTransition';
-export * from './AmbiguityInfo';
-export * from './ATN';
-export * from './ATNConfig';
-export * from './ATNConfigSet';
-export * from './ATNDeserializationOptions';
-export * from './ATNDeserializer';
-export * from './ATNSimulator';
-export * from './ATNState';
-export * from './ATNStateType';
-export * from './ATNType';
-export * from './AtomTransition';
-export * from './BasicBlockStartState';
-export * from './BasicState';
-export * from './BlockEndState';
-export * from './BlockStartState';
-export * from './ConflictInfo';
-export * from './ContextSensitivityInfo';
-export * from './DecisionEventInfo';
-export * from './DecisionInfo';
-export * from './DecisionState';
-export * from './EpsilonTransition';
-export * from './ErrorInfo';
-export * from './InvalidState';
-export * from './LexerAction';
-export * from './LexerActionExecutor';
-export * from './LexerActionType';
-export * from './LexerATNSimulator';
-export * from './LexerChannelAction';
-export * from './LexerCustomAction';
-export * from './LexerIndexedCustomAction';
-export * from './LexerModeAction';
-export * from './LexerMoreAction';
-export * from './LexerPopModeAction';
-export * from './LexerPushModeAction';
-export * from './LexerSkipAction';
-export * from './LexerTypeAction';
-export * from './LL1Analyzer';
-export * from './LookaheadEventInfo';
-export * from './LoopEndState';
-export * from './NotSetTransition';
-export * from './OrderedATNConfigSet';
-export * from './ParseInfo';
-export * from './ParserATNSimulator';
-export * from './PlusBlockStartState';
-export * from './PlusLoopbackState';
-export * from './PrecedencePredicateTransition';
-export * from './PredicateEvalInfo';
-export * from './PredicateTransition';
-export * from './PredictionContext';
-export * from './PredictionContextCache';
-export * from './PredictionMode';
-export * from './ProfilingATNSimulator';
-export * from './RangeTransition';
-export * from './RuleStartState';
-export * from './RuleStopState';
-export * from './RuleTransition';
-export * from './SemanticContext';
-export * from './SetTransition';
-export * from './SimulatorState';
-export * from './StarBlockStartState';
-export * from './StarLoopbackState';
-export * from './StarLoopEntryState';
-export * from './TokensStartState';
-export * from './Transition';
-export * from './TransitionType';
-export * from './WildcardTransition';
diff --git a/node_modules/antlr4ts/atn/index.js b/node_modules/antlr4ts/atn/index.js
deleted file mode 100644
index 88f634a..0000000
--- a/node_modules/antlr4ts/atn/index.js
+++ /dev/null
@@ -1,78 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-function __export(m) {
- for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];
-}
-Object.defineProperty(exports, "__esModule", { value: true });
-__export(require("./AbstractPredicateTransition"));
-__export(require("./ActionTransition"));
-__export(require("./AmbiguityInfo"));
-__export(require("./ATN"));
-__export(require("./ATNConfig"));
-__export(require("./ATNConfigSet"));
-__export(require("./ATNDeserializationOptions"));
-__export(require("./ATNDeserializer"));
-// export * from './ATNSerializer';
-__export(require("./ATNSimulator"));
-__export(require("./ATNState"));
-__export(require("./ATNStateType"));
-__export(require("./ATNType"));
-__export(require("./AtomTransition"));
-__export(require("./BasicBlockStartState"));
-__export(require("./BasicState"));
-__export(require("./BlockEndState"));
-__export(require("./BlockStartState"));
-__export(require("./ConflictInfo"));
-__export(require("./ContextSensitivityInfo"));
-__export(require("./DecisionEventInfo"));
-__export(require("./DecisionInfo"));
-__export(require("./DecisionState"));
-__export(require("./EpsilonTransition"));
-__export(require("./ErrorInfo"));
-__export(require("./InvalidState"));
-__export(require("./LexerActionExecutor"));
-__export(require("./LexerActionType"));
-__export(require("./LexerATNSimulator"));
-__export(require("./LexerChannelAction"));
-__export(require("./LexerCustomAction"));
-__export(require("./LexerIndexedCustomAction"));
-__export(require("./LexerModeAction"));
-__export(require("./LexerMoreAction"));
-__export(require("./LexerPopModeAction"));
-__export(require("./LexerPushModeAction"));
-__export(require("./LexerSkipAction"));
-__export(require("./LexerTypeAction"));
-__export(require("./LL1Analyzer"));
-__export(require("./LookaheadEventInfo"));
-__export(require("./LoopEndState"));
-__export(require("./NotSetTransition"));
-__export(require("./OrderedATNConfigSet"));
-__export(require("./ParseInfo"));
-__export(require("./ParserATNSimulator"));
-__export(require("./PlusBlockStartState"));
-__export(require("./PlusLoopbackState"));
-__export(require("./PrecedencePredicateTransition"));
-__export(require("./PredicateEvalInfo"));
-__export(require("./PredicateTransition"));
-__export(require("./PredictionContext"));
-__export(require("./PredictionContextCache"));
-__export(require("./PredictionMode"));
-__export(require("./ProfilingATNSimulator"));
-__export(require("./RangeTransition"));
-__export(require("./RuleStartState"));
-__export(require("./RuleStopState"));
-__export(require("./RuleTransition"));
-__export(require("./SemanticContext"));
-__export(require("./SetTransition"));
-__export(require("./SimulatorState"));
-__export(require("./StarBlockStartState"));
-__export(require("./StarLoopbackState"));
-__export(require("./StarLoopEntryState"));
-__export(require("./TokensStartState"));
-__export(require("./Transition"));
-__export(require("./TransitionType"));
-__export(require("./WildcardTransition"));
-//# sourceMappingURL=index.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/atn/index.js.map b/node_modules/antlr4ts/atn/index.js.map
deleted file mode 100644
index 8e6d307..0000000
--- a/node_modules/antlr4ts/atn/index.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/atn/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;AAEH,mDAA8C;AAC9C,wCAAmC;AACnC,qCAAgC;AAChC,2BAAsB;AACtB,iCAA4B;AAC5B,oCAA+B;AAC/B,iDAA4C;AAC5C,uCAAkC;AAClC,mCAAmC;AACnC,oCAA+B;AAC/B,gCAA2B;AAC3B,oCAA+B;AAC/B,+BAA0B;AAC1B,sCAAiC;AACjC,4CAAuC;AACvC,kCAA6B;AAC7B,qCAAgC;AAChC,uCAAkC;AAClC,oCAA+B;AAC/B,8CAAyC;AACzC,yCAAoC;AACpC,oCAA+B;AAC/B,qCAAgC;AAChC,yCAAoC;AACpC,iCAA4B;AAC5B,oCAA+B;AAE/B,2CAAsC;AACtC,uCAAkC;AAClC,yCAAoC;AACpC,0CAAqC;AACrC,yCAAoC;AACpC,gDAA2C;AAC3C,uCAAkC;AAClC,uCAAkC;AAClC,0CAAqC;AACrC,2CAAsC;AACtC,uCAAkC;AAClC,uCAAkC;AAClC,mCAA8B;AAC9B,0CAAqC;AACrC,oCAA+B;AAC/B,wCAAmC;AACnC,2CAAsC;AACtC,iCAA4B;AAC5B,0CAAqC;AACrC,2CAAsC;AACtC,yCAAoC;AACpC,qDAAgD;AAChD,yCAAoC;AACpC,2CAAsC;AACtC,yCAAoC;AACpC,8CAAyC;AACzC,sCAAiC;AACjC,6CAAwC;AACxC,uCAAkC;AAClC,sCAAiC;AACjC,qCAAgC;AAChC,sCAAiC;AACjC,uCAAkC;AAClC,qCAAgC;AAChC,sCAAiC;AACjC,2CAAsC;AACtC,yCAAoC;AACpC,0CAAqC;AACrC,wCAAmC;AACnC,kCAA6B;AAC7B,sCAAiC;AACjC,0CAAqC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/dfa/AcceptStateInfo.d.ts b/node_modules/antlr4ts/dfa/AcceptStateInfo.d.ts
deleted file mode 100644
index 3cd8848..0000000
--- a/node_modules/antlr4ts/dfa/AcceptStateInfo.d.ts
+++ /dev/null
@@ -1,33 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { LexerActionExecutor } from '../atn/LexerActionExecutor';
-/**
- * Stores information about a {@link DFAState} which is an accept state under
- * some condition. Certain settings, such as
- * {@link ParserATNSimulator#getPredictionMode()}, may be used in addition to
- * this information to determine whether or not a particular state is an accept
- * state.
- *
- * @author Sam Harwell
- */
-export declare class AcceptStateInfo {
- private readonly _prediction;
- private readonly _lexerActionExecutor?;
- constructor(prediction: number);
- constructor(prediction: number, lexerActionExecutor: LexerActionExecutor | undefined);
- /**
- * Gets the prediction made by this accept state. Note that this value
- * assumes the predicates, if any, in the {@link DFAState} evaluate to
- * {@code true}. If predicate evaluation is enabled, the final prediction of
- * the accept state will be determined by the result of predicate
- * evaluation.
- */
- readonly prediction: number;
- /**
- * Gets the {@link LexerActionExecutor} which can be used to execute actions
- * and/or commands after the lexer matches a token.
- */
- readonly lexerActionExecutor: LexerActionExecutor | undefined;
-}
diff --git a/node_modules/antlr4ts/dfa/AcceptStateInfo.js b/node_modules/antlr4ts/dfa/AcceptStateInfo.js
deleted file mode 100644
index 7e357a6..0000000
--- a/node_modules/antlr4ts/dfa/AcceptStateInfo.js
+++ /dev/null
@@ -1,40 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-/**
- * Stores information about a {@link DFAState} which is an accept state under
- * some condition. Certain settings, such as
- * {@link ParserATNSimulator#getPredictionMode()}, may be used in addition to
- * this information to determine whether or not a particular state is an accept
- * state.
- *
- * @author Sam Harwell
- */
-class AcceptStateInfo {
- constructor(prediction, lexerActionExecutor) {
- this._prediction = prediction;
- this._lexerActionExecutor = lexerActionExecutor;
- }
- /**
- * Gets the prediction made by this accept state. Note that this value
- * assumes the predicates, if any, in the {@link DFAState} evaluate to
- * {@code true}. If predicate evaluation is enabled, the final prediction of
- * the accept state will be determined by the result of predicate
- * evaluation.
- */
- get prediction() {
- return this._prediction;
- }
- /**
- * Gets the {@link LexerActionExecutor} which can be used to execute actions
- * and/or commands after the lexer matches a token.
- */
- get lexerActionExecutor() {
- return this._lexerActionExecutor;
- }
-}
-exports.AcceptStateInfo = AcceptStateInfo;
-//# sourceMappingURL=AcceptStateInfo.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/dfa/AcceptStateInfo.js.map b/node_modules/antlr4ts/dfa/AcceptStateInfo.js.map
deleted file mode 100644
index 16bfc2f..0000000
--- a/node_modules/antlr4ts/dfa/AcceptStateInfo.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"AcceptStateInfo.js","sourceRoot":"","sources":["../../../src/dfa/AcceptStateInfo.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAMH;;;;;;;;GAQG;AACH;IAMC,YAAY,UAAkB,EAAE,mBAAyC;QACxE,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,CAAC,oBAAoB,GAAG,mBAAmB,CAAC;IACjD,CAAC;IAED;;;;;;OAMG;IACH,IAAI,UAAU;QACb,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,IAAI,mBAAmB;QACtB,MAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC;IAClC,CAAC;CACD;AA7BD,0CA6BC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/dfa/DFA.d.ts b/node_modules/antlr4ts/dfa/DFA.d.ts
deleted file mode 100644
index f2b5e27..0000000
--- a/node_modules/antlr4ts/dfa/DFA.d.ts
+++ /dev/null
@@ -1,94 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Array2DHashSet } from '../misc/Array2DHashSet';
-import { ATN } from '../atn/ATN';
-import { ATNState } from '../atn/ATNState';
-import { DecisionState } from '../atn/DecisionState';
-import { DFAState } from './DFAState';
-import { TokensStartState } from '../atn/TokensStartState';
-import { Vocabulary } from '../Vocabulary';
-export declare class DFA {
- /**
- * A set of all states in the `DFA`.
- *
- * Note that this collection of states holds the DFA states for both SLL and LL prediction. Only the start state
- * needs to be differentiated for these cases, which is tracked by the `s0` and `s0full` fields.
- */
- readonly states: Array2DHashSet;
- s0: DFAState | undefined;
- s0full: DFAState | undefined;
- readonly decision: number;
- /** From which ATN state did we create this DFA? */
- atnStartState: ATNState;
- /**
- * Note: this field is accessed as `atnStartState.atn` in other targets. The TypeScript target keeps a separate copy
- * to avoid a number of additional null/undefined checks each time the ATN is accessed.
- */
- atn: ATN;
- private nextStateNumber;
- /**
- * {@code true} if this DFA is for a precedence decision; otherwise,
- * {@code false}. This is the backing field for {@link #isPrecedenceDfa}.
- */
- private precedenceDfa;
- /**
- * Constructs a `DFA` instance associated with a lexer mode.
- *
- * The start state for a `DFA` constructed with this constructor should be a `TokensStartState`, which is the start
- * state for a lexer mode. The prediction made by this DFA determines the lexer rule which matches the current
- * input.
- *
- * @param atnStartState The start state for the mode.
- */
- constructor(atnStartState: TokensStartState);
- /**
- * Constructs a `DFA` instance associated with a decision.
- *
- * @param atnStartState The decision associated with this DFA.
- * @param decision The decision number.
- */
- constructor(atnStartState: DecisionState, decision: number);
- /**
- * Gets whether this DFA is a precedence DFA. Precedence DFAs use a special
- * start state {@link #s0} which is not stored in {@link #states}. The
- * {@link DFAState#edges} array for this start state contains outgoing edges
- * supplying individual start states corresponding to specific precedence
- * values.
- *
- * @return {@code true} if this is a precedence DFA; otherwise,
- * {@code false}.
- * @see Parser.precedence
- */
- readonly isPrecedenceDfa: boolean;
- /**
- * Get the start state for a specific precedence value.
- *
- * @param precedence The current precedence.
- * @return The start state corresponding to the specified precedence, or
- * {@code null} if no start state exists for the specified precedence.
- *
- * @ if this is not a precedence DFA.
- * @see `isPrecedenceDfa`
- */
- getPrecedenceStartState(precedence: number, fullContext: boolean): DFAState | undefined;
- /**
- * Set the start state for a specific precedence value.
- *
- * @param precedence The current precedence.
- * @param startState The start state corresponding to the specified
- * precedence.
- *
- * @ if this is not a precedence DFA.
- * @see `isPrecedenceDfa`
- */
- setPrecedenceStartState(precedence: number, fullContext: boolean, startState: DFAState): void;
- readonly isEmpty: boolean;
- readonly isContextSensitive: boolean;
- addState(state: DFAState): DFAState;
- toString(): string;
- toString(vocabulary: Vocabulary): string;
- toString(vocabulary: Vocabulary, ruleNames: string[] | undefined): string;
- toLexerString(): string;
-}
diff --git a/node_modules/antlr4ts/dfa/DFA.js b/node_modules/antlr4ts/dfa/DFA.js
deleted file mode 100644
index 03c41ab..0000000
--- a/node_modules/antlr4ts/dfa/DFA.js
+++ /dev/null
@@ -1,173 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:38.3567094-07:00
-const Array2DHashSet_1 = require("../misc/Array2DHashSet");
-const ATNConfigSet_1 = require("../atn/ATNConfigSet");
-const DFASerializer_1 = require("./DFASerializer");
-const DFAState_1 = require("./DFAState");
-const LexerDFASerializer_1 = require("./LexerDFASerializer");
-const Decorators_1 = require("../Decorators");
-const ObjectEqualityComparator_1 = require("../misc/ObjectEqualityComparator");
-const StarLoopEntryState_1 = require("../atn/StarLoopEntryState");
-const VocabularyImpl_1 = require("../VocabularyImpl");
-let DFA = class DFA {
- constructor(atnStartState, decision = 0) {
- /**
- * A set of all states in the `DFA`.
- *
- * Note that this collection of states holds the DFA states for both SLL and LL prediction. Only the start state
- * needs to be differentiated for these cases, which is tracked by the `s0` and `s0full` fields.
- */
- this.states = new Array2DHashSet_1.Array2DHashSet(ObjectEqualityComparator_1.ObjectEqualityComparator.INSTANCE);
- this.nextStateNumber = 0;
- if (!atnStartState.atn) {
- throw new Error("The ATNState must be associated with an ATN");
- }
- this.atnStartState = atnStartState;
- this.atn = atnStartState.atn;
- this.decision = decision;
- // Precedence DFAs are associated with the special precedence decision created for left-recursive rules which
- // evaluate their alternatives using a precedence hierarchy. When such a decision is encountered, we mark this
- // DFA instance as a precedence DFA and initialize the initial states s0 and s0full to special DFAState
- // instances which use outgoing edges to link to the actual start state used for each precedence level.
- let isPrecedenceDfa = false;
- if (atnStartState instanceof StarLoopEntryState_1.StarLoopEntryState) {
- if (atnStartState.precedenceRuleDecision) {
- isPrecedenceDfa = true;
- this.s0 = new DFAState_1.DFAState(new ATNConfigSet_1.ATNConfigSet());
- this.s0full = new DFAState_1.DFAState(new ATNConfigSet_1.ATNConfigSet());
- }
- }
- this.precedenceDfa = isPrecedenceDfa;
- }
- /**
- * Gets whether this DFA is a precedence DFA. Precedence DFAs use a special
- * start state {@link #s0} which is not stored in {@link #states}. The
- * {@link DFAState#edges} array for this start state contains outgoing edges
- * supplying individual start states corresponding to specific precedence
- * values.
- *
- * @return {@code true} if this is a precedence DFA; otherwise,
- * {@code false}.
- * @see Parser.precedence
- */
- get isPrecedenceDfa() {
- return this.precedenceDfa;
- }
- /**
- * Get the start state for a specific precedence value.
- *
- * @param precedence The current precedence.
- * @return The start state corresponding to the specified precedence, or
- * {@code null} if no start state exists for the specified precedence.
- *
- * @ if this is not a precedence DFA.
- * @see `isPrecedenceDfa`
- */
- getPrecedenceStartState(precedence, fullContext) {
- if (!this.isPrecedenceDfa) {
- throw new Error("Only precedence DFAs may contain a precedence start state.");
- }
- // s0 and s0full are never null for a precedence DFA
- if (fullContext) {
- return this.s0full.getTarget(precedence);
- }
- else {
- return this.s0.getTarget(precedence);
- }
- }
- /**
- * Set the start state for a specific precedence value.
- *
- * @param precedence The current precedence.
- * @param startState The start state corresponding to the specified
- * precedence.
- *
- * @ if this is not a precedence DFA.
- * @see `isPrecedenceDfa`
- */
- setPrecedenceStartState(precedence, fullContext, startState) {
- if (!this.isPrecedenceDfa) {
- throw new Error("Only precedence DFAs may contain a precedence start state.");
- }
- if (precedence < 0) {
- return;
- }
- if (fullContext) {
- // s0full is never null for a precedence DFA
- this.s0full.setTarget(precedence, startState);
- }
- else {
- // s0 is never null for a precedence DFA
- this.s0.setTarget(precedence, startState);
- }
- }
- get isEmpty() {
- if (this.isPrecedenceDfa) {
- // s0 and s0full are never null for a precedence DFA
- return this.s0.getEdgeMap().size === 0 && this.s0full.getEdgeMap().size === 0;
- }
- return this.s0 == null && this.s0full == null;
- }
- get isContextSensitive() {
- if (this.isPrecedenceDfa) {
- // s0full is never null for a precedence DFA
- return this.s0full.getEdgeMap().size > 0;
- }
- return this.s0full != null;
- }
- addState(state) {
- state.stateNumber = this.nextStateNumber++;
- return this.states.getOrAdd(state);
- }
- toString(vocabulary, ruleNames) {
- if (!vocabulary) {
- vocabulary = VocabularyImpl_1.VocabularyImpl.EMPTY_VOCABULARY;
- }
- if (!this.s0) {
- return "";
- }
- let serializer;
- if (ruleNames) {
- serializer = new DFASerializer_1.DFASerializer(this, vocabulary, ruleNames, this.atnStartState.atn);
- }
- else {
- serializer = new DFASerializer_1.DFASerializer(this, vocabulary);
- }
- return serializer.toString();
- }
- toLexerString() {
- if (!this.s0) {
- return "";
- }
- let serializer = new LexerDFASerializer_1.LexerDFASerializer(this);
- return serializer.toString();
- }
-};
-__decorate([
- Decorators_1.NotNull
-], DFA.prototype, "states", void 0);
-__decorate([
- Decorators_1.NotNull
-], DFA.prototype, "atnStartState", void 0);
-__decorate([
- Decorators_1.NotNull
-], DFA.prototype, "atn", void 0);
-DFA = __decorate([
- __param(0, Decorators_1.NotNull)
-], DFA);
-exports.DFA = DFA;
-//# sourceMappingURL=DFA.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/dfa/DFA.js.map b/node_modules/antlr4ts/dfa/DFA.js.map
deleted file mode 100644
index 76529d0..0000000
--- a/node_modules/antlr4ts/dfa/DFA.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"DFA.js","sourceRoot":"","sources":["../../../src/dfa/DFA.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,2DAAwD;AAExD,sDAAmD;AAInD,mDAAgD;AAChD,yCAAsC;AAEtC,6DAA0D;AAC1D,8CAAwC;AACxC,+EAA4E;AAC5E,kEAA+D;AAI/D,sDAAmD;AAEnD,IAAa,GAAG,GAAhB;IAmDC,YAAqB,aAAuB,EAAE,WAAmB,CAAC;QAlDlE;;;;;WAKG;QAEM,WAAM,GAA6B,IAAI,+BAAc,CAAW,mDAAwB,CAAC,QAAQ,CAAC,CAAC;QAkBpG,oBAAe,GAAW,CAAC,CAAC;QA0BnC,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;QAChE,CAAC;QAED,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC;QAC7B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QAEzB,6GAA6G;QAC7G,8GAA8G;QAC9G,uGAAuG;QACvG,uGAAuG;QACvG,IAAI,eAAe,GAAY,KAAK,CAAC;QACrC,EAAE,CAAC,CAAC,aAAa,YAAY,uCAAkB,CAAC,CAAC,CAAC;YACjD,EAAE,CAAC,CAAC,aAAa,CAAC,sBAAsB,CAAC,CAAC,CAAC;gBAC1C,eAAe,GAAG,IAAI,CAAC;gBACvB,IAAI,CAAC,EAAE,GAAG,IAAI,mBAAQ,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;gBAC3C,IAAI,CAAC,MAAM,GAAG,IAAI,mBAAQ,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;YAChD,CAAC;QACF,CAAC;QAED,IAAI,CAAC,aAAa,GAAG,eAAe,CAAC;IACtC,CAAC;IAED;;;;;;;;;;OAUG;IACH,IAAI,eAAe;QAClB,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC;IAC3B,CAAC;IAED;;;;;;;;;OASG;IACH,uBAAuB,CAAC,UAAkB,EAAE,WAAoB;QAC/D,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;YAC3B,MAAM,IAAI,KAAK,CAAC,4DAA4D,CAAC,CAAC;QAC/E,CAAC;QAED,oDAAoD;QACpD,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;YACjB,MAAM,CAAY,IAAI,CAAC,MAAO,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QACtD,CAAC;QACD,IAAI,CAAC,CAAC;YACL,MAAM,CAAY,IAAI,CAAC,EAAG,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAClD,CAAC;IACF,CAAC;IAED;;;;;;;;;OASG;IACH,uBAAuB,CAAC,UAAkB,EAAE,WAAoB,EAAE,UAAoB;QACrF,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;YAC3B,MAAM,IAAI,KAAK,CAAC,4DAA4D,CAAC,CAAC;QAC/E,CAAC;QAED,EAAE,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC;QACR,CAAC;QAED,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;YACjB,4CAA4C;YACjC,IAAI,CAAC,MAAO,CAAC,SAAS,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;QAC3D,CAAC;QACD,IAAI,CAAC,CAAC;YACL,wCAAwC;YAC7B,IAAI,CAAC,EAAG,CAAC,SAAS,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;QACvD,CAAC;IACF,CAAC;IAED,IAAI,OAAO;QACV,EAAE,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;YAC1B,oDAAoD;YACpD,MAAM,CAAC,IAAI,CAAC,EAAG,CAAC,UAAU,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,MAAO,CAAC,UAAU,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC;QACjF,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC;IAC/C,CAAC;IAED,IAAI,kBAAkB;QACrB,EAAE,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;YAC1B,4CAA4C;YAC5C,MAAM,CAAY,IAAI,CAAC,MAAO,CAAC,UAAU,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC;QACtD,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC;IAC5B,CAAC;IAED,QAAQ,CAAC,KAAe;QACvB,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QAC3C,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IAKD,QAAQ,CAAC,UAAuB,EAAE,SAAoB;QACrD,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;YACjB,UAAU,GAAG,+BAAc,CAAC,gBAAgB,CAAC;QAC9C,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,EAAE,CAAC;QACX,CAAC;QAED,IAAI,UAAyB,CAAC;QAC9B,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YACf,UAAU,GAAG,IAAI,6BAAa,CAAC,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;QACrF,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,UAAU,GAAG,IAAI,6BAAa,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAClD,CAAC;QAED,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC;IAC9B,CAAC;IAED,aAAa;QACZ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,EAAE,CAAC;QACX,CAAC;QAED,IAAI,UAAU,GAAkB,IAAI,uCAAkB,CAAC,IAAI,CAAC,CAAC;QAC7D,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC;IAC9B,CAAC;CACD,CAAA;AA7LA;IADC,oBAAO;mCACoG;AAU5G;IADC,oBAAO;0CACgB;AAMxB;IADC,oBAAO;gCACC;AAxBG,GAAG;IAmDF,WAAA,oBAAO,CAAA;GAnDR,GAAG,CAqMf;AArMY,kBAAG"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/dfa/DFASerializer.d.ts b/node_modules/antlr4ts/dfa/DFASerializer.d.ts
deleted file mode 100644
index 39f0007..0000000
--- a/node_modules/antlr4ts/dfa/DFASerializer.d.ts
+++ /dev/null
@@ -1,23 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { ATN } from '../atn/ATN';
-import { DFA } from './DFA';
-import { DFAState } from './DFAState';
-import { Recognizer } from '../Recognizer';
-import { Vocabulary } from '../Vocabulary';
-/** A DFA walker that knows how to dump them to serialized strings. */
-export declare class DFASerializer {
- private dfa;
- private vocabulary;
- ruleNames?: string[];
- atn?: ATN;
- constructor(dfa: DFA, vocabulary: Vocabulary);
- constructor(dfa: DFA, parser: Recognizer | undefined);
- constructor(dfa: DFA, vocabulary: Vocabulary, ruleNames: string[] | undefined, atn: ATN | undefined);
- toString(): string;
- protected getContextLabel(i: number): string;
- protected getEdgeLabel(i: number): string;
- getStateString(s: DFAState): string;
-}
diff --git a/node_modules/antlr4ts/dfa/DFASerializer.js b/node_modules/antlr4ts/dfa/DFASerializer.js
deleted file mode 100644
index ffafda0..0000000
--- a/node_modules/antlr4ts/dfa/DFASerializer.js
+++ /dev/null
@@ -1,141 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:38.5097925-07:00
-const Stubs_1 = require("../misc/Stubs");
-const ATNSimulator_1 = require("../atn/ATNSimulator");
-const Decorators_1 = require("../Decorators");
-const PredictionContext_1 = require("../atn/PredictionContext");
-const Recognizer_1 = require("../Recognizer");
-const VocabularyImpl_1 = require("../VocabularyImpl");
-/** A DFA walker that knows how to dump them to serialized strings. */
-class DFASerializer {
- constructor(dfa, vocabulary, ruleNames, atn) {
- if (vocabulary instanceof Recognizer_1.Recognizer) {
- ruleNames = vocabulary.ruleNames;
- atn = vocabulary.atn;
- vocabulary = vocabulary.vocabulary;
- }
- else if (!vocabulary) {
- vocabulary = VocabularyImpl_1.VocabularyImpl.EMPTY_VOCABULARY;
- }
- this.dfa = dfa;
- this.vocabulary = vocabulary;
- this.ruleNames = ruleNames;
- this.atn = atn;
- }
- toString() {
- if (!this.dfa.s0) {
- return "";
- }
- let buf = "";
- if (this.dfa.states) {
- let states = new Array(...this.dfa.states.toArray());
- states.sort((o1, o2) => o1.stateNumber - o2.stateNumber);
- for (let s of states) {
- let edges = s.getEdgeMap();
- let edgeKeys = [...edges.keys()].sort((a, b) => a - b);
- let contextEdges = s.getContextEdgeMap();
- let contextEdgeKeys = [...contextEdges.keys()].sort((a, b) => a - b);
- for (let entry of edgeKeys) {
- let value = edges.get(entry);
- if ((value == null || value === ATNSimulator_1.ATNSimulator.ERROR) && !s.isContextSymbol(entry)) {
- continue;
- }
- let contextSymbol = false;
- buf += (this.getStateString(s)) + ("-") + (this.getEdgeLabel(entry)) + ("->");
- if (s.isContextSymbol(entry)) {
- buf += ("!");
- contextSymbol = true;
- }
- let t = value;
- if (t && t.stateNumber !== ATNSimulator_1.ATNSimulator.ERROR.stateNumber) {
- buf += (this.getStateString(t)) + ('\n');
- }
- else if (contextSymbol) {
- buf += ("ctx\n");
- }
- }
- if (s.isContextSensitive) {
- for (let entry of contextEdgeKeys) {
- buf += (this.getStateString(s))
- + ("-")
- + (this.getContextLabel(entry))
- + ("->")
- + (this.getStateString(contextEdges.get(entry)))
- + ("\n");
- }
- }
- }
- }
- let output = buf;
- if (output.length === 0)
- return "";
- //return Utils.sortLinesInString(output);
- return output;
- }
- getContextLabel(i) {
- if (i === PredictionContext_1.PredictionContext.EMPTY_FULL_STATE_KEY) {
- return "ctx:EMPTY_FULL";
- }
- else if (i === PredictionContext_1.PredictionContext.EMPTY_LOCAL_STATE_KEY) {
- return "ctx:EMPTY_LOCAL";
- }
- if (this.atn && i > 0 && i <= this.atn.states.length) {
- let state = this.atn.states[i];
- let ruleIndex = state.ruleIndex;
- if (this.ruleNames && ruleIndex >= 0 && ruleIndex < this.ruleNames.length) {
- return "ctx:" + String(i) + "(" + this.ruleNames[ruleIndex] + ")";
- }
- }
- return "ctx:" + String(i);
- }
- getEdgeLabel(i) {
- return this.vocabulary.getDisplayName(i);
- }
- getStateString(s) {
- if (s === ATNSimulator_1.ATNSimulator.ERROR) {
- return "ERROR";
- }
- let n = s.stateNumber;
- let stateStr = "s" + n;
- if (s.isAcceptState) {
- if (s.predicates) {
- stateStr = ":s" + n + "=>" + s.predicates;
- }
- else {
- stateStr = ":s" + n + "=>" + s.prediction;
- }
- }
- if (s.isContextSensitive) {
- stateStr += "*";
- for (let config of Stubs_1.asIterable(s.configs)) {
- if (config.reachesIntoOuterContext) {
- stateStr += "*";
- break;
- }
- }
- }
- return stateStr;
- }
-}
-__decorate([
- Decorators_1.NotNull
-], DFASerializer.prototype, "dfa", void 0);
-__decorate([
- Decorators_1.NotNull
-], DFASerializer.prototype, "vocabulary", void 0);
-__decorate([
- Decorators_1.Override
-], DFASerializer.prototype, "toString", null);
-exports.DFASerializer = DFASerializer;
-//# sourceMappingURL=DFASerializer.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/dfa/DFASerializer.js.map b/node_modules/antlr4ts/dfa/DFASerializer.js.map
deleted file mode 100644
index 833e798..0000000
--- a/node_modules/antlr4ts/dfa/DFASerializer.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"DFASerializer.js","sourceRoot":"","sources":["../../../src/dfa/DFASerializer.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAEH,wDAAwD;AAExD,yCAA2C;AAE3C,sDAAmD;AAInD,8CAAkD;AAClD,gEAA6D;AAC7D,8CAA2C;AAE3C,sDAAmD;AAEnD,sEAAsE;AACtE;IAaC,YAAY,GAAQ,EAAE,UAAyD,EAAE,SAAoB,EAAE,GAAS;QAC/G,EAAE,CAAC,CAAC,UAAU,YAAY,uBAAU,CAAC,CAAC,CAAC;YACtC,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC;YACjC,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC;YACrB,UAAU,GAAG,UAAU,CAAC,UAAU,CAAC;QACpC,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;YACxB,UAAU,GAAG,+BAAc,CAAC,gBAAgB,CAAC;QAC9C,CAAC;QAED,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IAChB,CAAC;IAGD,QAAQ;QACP,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,EAAE,CAAC;QACX,CAAC;QAED,IAAI,GAAG,GAAG,EAAE,CAAC;QAEb,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YACrB,IAAI,MAAM,GAAe,IAAI,KAAK,CAAW,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;YAC3E,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,WAAW,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;YAEzD,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC;gBACtB,IAAI,KAAK,GAA0B,CAAC,CAAC,UAAU,EAAE,CAAC;gBAClD,IAAI,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBACvD,IAAI,YAAY,GAA0B,CAAC,CAAC,iBAAiB,EAAE,CAAC;gBAChE,IAAI,eAAe,GAAG,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrE,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,QAAQ,CAAC,CAAC,CAAC;oBAC5B,IAAI,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBAC7B,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,IAAI,KAAK,KAAK,2BAAY,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;wBAClF,QAAQ,CAAC;oBACV,CAAC;oBAED,IAAI,aAAa,GAAY,KAAK,CAAC;oBACnC,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAC9E,EAAE,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;wBAC9B,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;wBACb,aAAa,GAAG,IAAI,CAAC;oBACtB,CAAC;oBAED,IAAI,CAAC,GAAyB,KAAK,CAAC;oBACpC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,WAAW,KAAK,2BAAY,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;wBAC3D,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAC1C,CAAC;oBACD,IAAI,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC;wBACxB,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;oBAClB,CAAC;gBACF,CAAC;gBAED,EAAE,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC;oBAC1B,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,eAAe,CAAC,CAAC,CAAC;wBACnC,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;8BAC5B,CAAC,GAAG,CAAC;8BACL,CAAC,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;8BAC7B,CAAC,IAAI,CAAC;8BACN,CAAC,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAC;8BAC/C,CAAC,IAAI,CAAC,CAAC;oBACX,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;QACD,IAAI,MAAM,GAAW,GAAG,CAAC;QACzB,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC;YAAC,MAAM,CAAC,EAAE,CAAC;QACnC,yCAAyC;QACzC,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAES,eAAe,CAAC,CAAS;QAClC,EAAE,CAAC,CAAC,CAAC,KAAK,qCAAiB,CAAC,oBAAoB,CAAC,CAAC,CAAC;YAClD,MAAM,CAAC,gBAAgB,CAAC;QACzB,CAAC;QACD,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,qCAAiB,CAAC,qBAAqB,CAAC,CAAC,CAAC;YACxD,MAAM,CAAC,iBAAiB,CAAC;QAC1B,CAAC;QAED,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACtD,IAAI,KAAK,GAAa,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACzC,IAAI,SAAS,GAAW,KAAK,CAAC,SAAS,CAAC;YACxC,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,IAAI,SAAS,IAAI,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3E,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC;YACnE,CAAC;QACF,CAAC;QAED,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;IAES,YAAY,CAAC,CAAS;QAC/B,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,cAAc,CAAC,CAAW;QACzB,EAAE,CAAC,CAAC,CAAC,KAAK,2BAAY,CAAC,KAAK,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,OAAO,CAAC;QAChB,CAAC;QAED,IAAI,CAAC,GAAW,CAAC,CAAC,WAAW,CAAC;QAC9B,IAAI,QAAQ,GAAW,GAAG,GAAG,CAAC,CAAC;QAC/B,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC;YACrB,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;gBAClB,QAAQ,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC;YAC3C,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,QAAQ,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC;YAC3C,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC;YAC1B,QAAQ,IAAI,GAAG,CAAC;YAChB,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,kBAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC1C,EAAE,CAAC,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC;oBACpC,QAAQ,IAAI,GAAG,CAAC;oBAChB,KAAK,CAAC;gBACP,CAAC;YACF,CAAC;QACF,CAAC;QACD,MAAM,CAAC,QAAQ,CAAC;IACjB,CAAC;CACD;AArIA;IADC,oBAAO;0CACS;AAEjB;IADC,oBAAO;iDACuB;AAyB/B;IADC,qBAAQ;6CAuDR;AAnFF,sCAuIC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/dfa/DFAState.d.ts b/node_modules/antlr4ts/dfa/DFAState.d.ts
deleted file mode 100644
index 4018862..0000000
--- a/node_modules/antlr4ts/dfa/DFAState.d.ts
+++ /dev/null
@@ -1,94 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { AcceptStateInfo } from './AcceptStateInfo';
-import { ATN } from '../atn/ATN';
-import { ATNConfigSet } from '../atn/ATNConfigSet';
-import { LexerActionExecutor } from '../atn/LexerActionExecutor';
-import { SemanticContext } from '../atn/SemanticContext';
-/** A DFA state represents a set of possible ATN configurations.
- * As Aho, Sethi, Ullman p. 117 says "The DFA uses its state
- * to keep track of all possible states the ATN can be in after
- * reading each input symbol. That is to say, after reading
- * input a1a2..an, the DFA is in a state that represents the
- * subset T of the states of the ATN that are reachable from the
- * ATN's start state along some path labeled a1a2..an."
- * In conventional NFA→DFA conversion, therefore, the subset T
- * would be a bitset representing the set of states the
- * ATN could be in. We need to track the alt predicted by each
- * state as well, however. More importantly, we need to maintain
- * a stack of states, tracking the closure operations as they
- * jump from rule to rule, emulating rule invocations (method calls).
- * I have to add a stack to simulate the proper lookahead sequences for
- * the underlying LL grammar from which the ATN was derived.
- *
- * I use a set of ATNConfig objects not simple states. An ATNConfig
- * is both a state (ala normal conversion) and a RuleContext describing
- * the chain of rules (if any) followed to arrive at that state.
- *
- * A DFA state may have multiple references to a particular state,
- * but with different ATN contexts (with same or different alts)
- * meaning that state was reached via a different set of rule invocations.
- */
-export declare class DFAState {
- stateNumber: number;
- configs: ATNConfigSet;
- /** {@code edges.get(symbol)} points to target of symbol.
- */
- private readonly edges;
- private _acceptStateInfo;
- /** These keys for these edges are the top level element of the global context. */
- private readonly contextEdges;
- /** Symbols in this set require a global context transition before matching an input symbol. */
- private contextSymbols;
- /**
- * This list is computed by {@link ParserATNSimulator#predicateDFAState}.
- */
- predicates: DFAState.PredPrediction[] | undefined;
- /**
- * Constructs a new `DFAState`.
- *
- * @param configs The set of ATN configurations defining this state.
- */
- constructor(configs: ATNConfigSet);
- readonly isContextSensitive: boolean;
- isContextSymbol(symbol: number): boolean;
- setContextSymbol(symbol: number): void;
- setContextSensitive(atn: ATN): void;
- acceptStateInfo: AcceptStateInfo | undefined;
- readonly isAcceptState: boolean;
- readonly prediction: number;
- readonly lexerActionExecutor: LexerActionExecutor | undefined;
- getTarget(symbol: number): DFAState | undefined;
- setTarget(symbol: number, target: DFAState): void;
- getEdgeMap(): Map;
- getContextTarget(invokingState: number): DFAState | undefined;
- setContextTarget(invokingState: number, target: DFAState): void;
- getContextEdgeMap(): Map;
- hashCode(): number;
- /**
- * Two {@link DFAState} instances are equal if their ATN configuration sets
- * are the same. This method is used to see if a state already exists.
- *
- * Because the number of alternatives and number of ATN configurations are
- * finite, there is a finite number of DFA states that can be processed.
- * This is necessary to show that the algorithm terminates.
- *
- * Cannot test the DFA state numbers here because in
- * {@link ParserATNSimulator#addDFAState} we need to know if any other state
- * exists that has this exact set of ATN configurations. The
- * {@link #stateNumber} is irrelevant.
- */
- equals(o: any): boolean;
- toString(): string;
-}
-export declare namespace DFAState {
- /** Map a predicate to a predicted alternative. */
- class PredPrediction {
- pred: SemanticContext;
- alt: number;
- constructor(pred: SemanticContext, alt: number);
- toString(): string;
- }
-}
diff --git a/node_modules/antlr4ts/dfa/DFAState.js b/node_modules/antlr4ts/dfa/DFAState.js
deleted file mode 100644
index 6c2c18d..0000000
--- a/node_modules/antlr4ts/dfa/DFAState.js
+++ /dev/null
@@ -1,228 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const ATN_1 = require("../atn/ATN");
-const BitSet_1 = require("../misc/BitSet");
-const MurmurHash_1 = require("../misc/MurmurHash");
-const Decorators_1 = require("../Decorators");
-const PredictionContext_1 = require("../atn/PredictionContext");
-const assert = require("assert");
-/** A DFA state represents a set of possible ATN configurations.
- * As Aho, Sethi, Ullman p. 117 says "The DFA uses its state
- * to keep track of all possible states the ATN can be in after
- * reading each input symbol. That is to say, after reading
- * input a1a2..an, the DFA is in a state that represents the
- * subset T of the states of the ATN that are reachable from the
- * ATN's start state along some path labeled a1a2..an."
- * In conventional NFA→DFA conversion, therefore, the subset T
- * would be a bitset representing the set of states the
- * ATN could be in. We need to track the alt predicted by each
- * state as well, however. More importantly, we need to maintain
- * a stack of states, tracking the closure operations as they
- * jump from rule to rule, emulating rule invocations (method calls).
- * I have to add a stack to simulate the proper lookahead sequences for
- * the underlying LL grammar from which the ATN was derived.
- *
- * I use a set of ATNConfig objects not simple states. An ATNConfig
- * is both a state (ala normal conversion) and a RuleContext describing
- * the chain of rules (if any) followed to arrive at that state.
- *
- * A DFA state may have multiple references to a particular state,
- * but with different ATN contexts (with same or different alts)
- * meaning that state was reached via a different set of rule invocations.
- */
-class DFAState {
- /**
- * Constructs a new `DFAState`.
- *
- * @param configs The set of ATN configurations defining this state.
- */
- constructor(configs) {
- this.stateNumber = -1;
- this.configs = configs;
- this.edges = new Map();
- this.contextEdges = new Map();
- }
- get isContextSensitive() {
- return !!this.contextSymbols;
- }
- isContextSymbol(symbol) {
- if (!this.isContextSensitive) {
- return false;
- }
- return this.contextSymbols.get(symbol);
- }
- setContextSymbol(symbol) {
- assert(this.isContextSensitive);
- this.contextSymbols.set(symbol);
- }
- setContextSensitive(atn) {
- assert(!this.configs.isOutermostConfigSet);
- if (this.isContextSensitive) {
- return;
- }
- if (!this.contextSymbols) {
- this.contextSymbols = new BitSet_1.BitSet();
- }
- }
- get acceptStateInfo() {
- return this._acceptStateInfo;
- }
- set acceptStateInfo(acceptStateInfo) {
- this._acceptStateInfo = acceptStateInfo;
- }
- get isAcceptState() {
- return !!this._acceptStateInfo;
- }
- get prediction() {
- if (!this._acceptStateInfo) {
- return ATN_1.ATN.INVALID_ALT_NUMBER;
- }
- return this._acceptStateInfo.prediction;
- }
- get lexerActionExecutor() {
- if (!this._acceptStateInfo) {
- return undefined;
- }
- return this._acceptStateInfo.lexerActionExecutor;
- }
- getTarget(symbol) {
- return this.edges.get(symbol);
- }
- setTarget(symbol, target) {
- this.edges.set(symbol, target);
- }
- getEdgeMap() {
- return this.edges;
- }
- getContextTarget(invokingState) {
- if (invokingState === PredictionContext_1.PredictionContext.EMPTY_FULL_STATE_KEY) {
- invokingState = -1;
- }
- return this.contextEdges.get(invokingState);
- }
- setContextTarget(invokingState, target) {
- if (!this.isContextSensitive) {
- throw new Error("The state is not context sensitive.");
- }
- if (invokingState === PredictionContext_1.PredictionContext.EMPTY_FULL_STATE_KEY) {
- invokingState = -1;
- }
- this.contextEdges.set(invokingState, target);
- }
- getContextEdgeMap() {
- let map = new Map(this.contextEdges);
- let existing = map.get(-1);
- if (existing !== undefined) {
- if (map.size === 1) {
- let result = new Map();
- result.set(PredictionContext_1.PredictionContext.EMPTY_FULL_STATE_KEY, existing);
- return result;
- }
- else {
- map.delete(-1);
- map.set(PredictionContext_1.PredictionContext.EMPTY_FULL_STATE_KEY, existing);
- }
- }
- return map;
- }
- hashCode() {
- let hash = MurmurHash_1.MurmurHash.initialize(7);
- hash = MurmurHash_1.MurmurHash.update(hash, this.configs.hashCode());
- hash = MurmurHash_1.MurmurHash.finish(hash, 1);
- return hash;
- }
- /**
- * Two {@link DFAState} instances are equal if their ATN configuration sets
- * are the same. This method is used to see if a state already exists.
- *
- * Because the number of alternatives and number of ATN configurations are
- * finite, there is a finite number of DFA states that can be processed.
- * This is necessary to show that the algorithm terminates.
- *
- * Cannot test the DFA state numbers here because in
- * {@link ParserATNSimulator#addDFAState} we need to know if any other state
- * exists that has this exact set of ATN configurations. The
- * {@link #stateNumber} is irrelevant.
- */
- equals(o) {
- // compare set of ATN configurations in this set with other
- if (this === o)
- return true;
- if (!(o instanceof DFAState)) {
- return false;
- }
- let other = o;
- let sameSet = this.configs.equals(other.configs);
- // System.out.println("DFAState.equals: "+configs+(sameSet?"==":"!=")+other.configs);
- return sameSet;
- }
- toString() {
- let buf = "";
- buf += (this.stateNumber) + (":") + (this.configs);
- if (this.isAcceptState) {
- buf += ("=>");
- if (this.predicates) {
- buf += this.predicates;
- }
- else {
- buf += (this.prediction);
- }
- }
- return buf.toString();
- }
-}
-__decorate([
- Decorators_1.NotNull
-], DFAState.prototype, "configs", void 0);
-__decorate([
- Decorators_1.NotNull
-], DFAState.prototype, "edges", void 0);
-__decorate([
- Decorators_1.NotNull
-], DFAState.prototype, "contextEdges", void 0);
-__decorate([
- Decorators_1.Override
-], DFAState.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], DFAState.prototype, "equals", null);
-__decorate([
- Decorators_1.Override
-], DFAState.prototype, "toString", null);
-exports.DFAState = DFAState;
-(function (DFAState) {
- /** Map a predicate to a predicted alternative. */
- let PredPrediction = class PredPrediction {
- constructor(pred, alt) {
- this.alt = alt;
- this.pred = pred;
- }
- toString() {
- return "(" + this.pred + ", " + this.alt + ")";
- }
- };
- __decorate([
- Decorators_1.NotNull
- ], PredPrediction.prototype, "pred", void 0);
- __decorate([
- Decorators_1.Override
- ], PredPrediction.prototype, "toString", null);
- PredPrediction = __decorate([
- __param(0, Decorators_1.NotNull)
- ], PredPrediction);
- DFAState.PredPrediction = PredPrediction;
-})(DFAState = exports.DFAState || (exports.DFAState = {}));
-//# sourceMappingURL=DFAState.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/dfa/DFAState.js.map b/node_modules/antlr4ts/dfa/DFAState.js.map
deleted file mode 100644
index 9839f64..0000000
--- a/node_modules/antlr4ts/dfa/DFAState.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"DFAState.js","sourceRoot":"","sources":["../../../src/dfa/DFAState.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAKH,oCAAiC;AAEjC,2CAAwC;AAExC,mDAAgD;AAChD,8CAAkD;AAClD,gEAA6D;AAG7D,iCAAiC;AAEjC;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH;IAyBC;;;;OAIG;IACH,YAAY,OAAqB;QA7BjC,gBAAW,GAAW,CAAC,CAAC,CAAC;QA8BxB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;QACzC,IAAI,CAAC,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;IACjD,CAAC;IAED,IAAI,kBAAkB;QACrB,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;IAC9B,CAAC;IAED,eAAe,CAAC,MAAc;QAC7B,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,cAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACzC,CAAC;IAED,gBAAgB,CAAC,MAAc;QAC9B,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QAChC,IAAI,CAAC,cAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;IAED,mBAAmB,CAAC,GAAQ;QAC3B,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,oBAAoB,CAAC,CAAC;QAC3C,EAAE,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC;QACR,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC;YAC1B,IAAI,CAAC,cAAc,GAAG,IAAI,eAAM,EAAE,CAAC;QACpC,CAAC;IACF,CAAC;IAED,IAAI,eAAe;QAClB,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC;IAC9B,CAAC;IAED,IAAI,eAAe,CAAC,eAA4C;QAC/D,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC;IACzC,CAAC;IAED,IAAI,aAAa;QAChB,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC;IAChC,CAAC;IAED,IAAI,UAAU;QACb,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,SAAG,CAAC,kBAAkB,CAAC;QAC/B,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC;IACzC,CAAC;IAED,IAAI,mBAAmB;QACtB,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,mBAAmB,CAAC;IAClD,CAAC;IAED,SAAS,CAAC,MAAc;QACvB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED,SAAS,CAAC,MAAc,EAAE,MAAgB;QACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChC,CAAC;IAED,UAAU;QACT,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED,gBAAgB,CAAC,aAAqB;QACrC,EAAE,CAAC,CAAC,aAAa,KAAK,qCAAiB,CAAC,oBAAoB,CAAC,CAAC,CAAC;YAC9D,aAAa,GAAG,CAAC,CAAC,CAAC;QACpB,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IAC7C,CAAC;IAED,gBAAgB,CAAC,aAAqB,EAAE,MAAgB;QACvD,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC;YAC9B,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;QACxD,CAAC;QAED,EAAE,CAAC,CAAC,aAAa,KAAK,qCAAiB,CAAC,oBAAoB,CAAC,CAAC,CAAC;YAC9D,aAAa,GAAG,CAAC,CAAC,CAAC;QACpB,CAAC;QAED,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;IAC9C,CAAC;IAED,iBAAiB;QAChB,IAAI,GAAG,GAAG,IAAI,GAAG,CAAmB,IAAI,CAAC,YAAY,CAAC,CAAC;QACvD,IAAI,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,EAAE,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC;YAC5B,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;gBACpB,IAAI,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;gBACzC,MAAM,CAAC,GAAG,CAAC,qCAAiB,CAAC,oBAAoB,EAAE,QAAQ,CAAC,CAAC;gBAC7D,MAAM,CAAC,MAAM,CAAC;YACf,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBACf,GAAG,CAAC,GAAG,CAAC,qCAAiB,CAAC,oBAAoB,EAAE,QAAQ,CAAC,CAAC;YAC3D,CAAC;QACF,CAAC;QAED,MAAM,CAAC,GAAG,CAAC;IACZ,CAAC;IAGD,QAAQ;QACP,IAAI,IAAI,GAAW,uBAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5C,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;QACxD,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAED;;;;;;;;;;;;OAYG;IAEH,MAAM,CAAC,CAAM;QACZ,2DAA2D;QAC3D,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC;YAAC,MAAM,CAAC,IAAI,CAAC;QAE5B,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,IAAI,KAAK,GAAa,CAAC,CAAC;QACxB,IAAI,OAAO,GAAY,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC5D,sFAAsF;QACpF,MAAM,CAAC,OAAO,CAAC;IAChB,CAAC;IAGD,QAAQ;QACP,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACnD,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;YACxB,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;YACd,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;gBACrB,GAAG,IAAI,IAAI,CAAC,UAAU,CAAC;YACxB,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC1B,CAAC;QACF,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IACvB,CAAC;CACD;AA7LA;IADC,oBAAO;yCACc;AAKtB;IADC,oBAAO;uCACsC;AAM9C;IADC,oBAAO;8CAC6C;AAgIrD;IADC,qBAAQ;wCAMR;AAgBD;IADC,qBAAQ;sCAaR;AAGD;IADC,qBAAQ;wCAcR;AAhMF,4BAiMC;AAED,WAAiB,QAAQ;IACxB,kDAAkD;IAClD,IAAa,cAAc,GAA3B;QAIC,YAAqB,IAAqB,EAAE,GAAW;YACtD,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;YACf,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QAClB,CAAC;QAGD,QAAQ;YACP,MAAM,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QAChD,CAAC;KACD,CAAA;IAXA;QADC,oBAAO;gDACc;IAQtB;QADC,qBAAQ;kDAGR;IAZW,cAAc;QAIb,WAAA,oBAAO,CAAA;OAJR,cAAc,CAa1B;IAbY,uBAAc,iBAa1B,CAAA;AACF,CAAC,EAhBgB,QAAQ,GAAR,gBAAQ,KAAR,gBAAQ,QAgBxB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/dfa/LexerDFASerializer.d.ts b/node_modules/antlr4ts/dfa/LexerDFASerializer.d.ts
deleted file mode 100644
index 160be1e..0000000
--- a/node_modules/antlr4ts/dfa/LexerDFASerializer.d.ts
+++ /dev/null
@@ -1,10 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { DFA } from './DFA';
-import { DFASerializer } from './DFASerializer';
-export declare class LexerDFASerializer extends DFASerializer {
- constructor(dfa: DFA);
- protected getEdgeLabel(i: number): string;
-}
diff --git a/node_modules/antlr4ts/dfa/LexerDFASerializer.js b/node_modules/antlr4ts/dfa/LexerDFASerializer.js
deleted file mode 100644
index 72c06be..0000000
--- a/node_modules/antlr4ts/dfa/LexerDFASerializer.js
+++ /dev/null
@@ -1,35 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const DFASerializer_1 = require("./DFASerializer");
-const Decorators_1 = require("../Decorators");
-const VocabularyImpl_1 = require("../VocabularyImpl");
-let LexerDFASerializer = class LexerDFASerializer extends DFASerializer_1.DFASerializer {
- constructor(dfa) {
- super(dfa, VocabularyImpl_1.VocabularyImpl.EMPTY_VOCABULARY);
- }
- getEdgeLabel(i) {
- return "'" + String.fromCharCode(i) + "'";
- }
-};
-__decorate([
- Decorators_1.Override,
- Decorators_1.NotNull
-], LexerDFASerializer.prototype, "getEdgeLabel", null);
-LexerDFASerializer = __decorate([
- __param(0, Decorators_1.NotNull)
-], LexerDFASerializer);
-exports.LexerDFASerializer = LexerDFASerializer;
-//# sourceMappingURL=LexerDFASerializer.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/dfa/LexerDFASerializer.js.map b/node_modules/antlr4ts/dfa/LexerDFASerializer.js.map
deleted file mode 100644
index 7dc5ced..0000000
--- a/node_modules/antlr4ts/dfa/LexerDFASerializer.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LexerDFASerializer.js","sourceRoot":"","sources":["../../../src/dfa/LexerDFASerializer.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAKH,mDAAgD;AAChD,8CAAkD;AAClD,sDAAmD;AAEnD,IAAa,kBAAkB,GAA/B,wBAAgC,SAAQ,6BAAa;IACpD,YAAsB,GAAQ;QAC7B,KAAK,CAAC,GAAG,EAAE,+BAAc,CAAC,gBAAgB,CAAC,CAAC;IAC7C,CAAC;IAIS,YAAY,CAAC,CAAS;QAC/B,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IAC3C,CAAC;CACD,CAAA;AAHA;IAFC,qBAAQ;IACR,oBAAO;sDAGP;AATW,kBAAkB;IAChB,WAAA,oBAAO,CAAA;GADT,kBAAkB,CAU9B;AAVY,gDAAkB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/dfa/index.d.ts b/node_modules/antlr4ts/dfa/index.d.ts
deleted file mode 100644
index dcd5e9a..0000000
--- a/node_modules/antlr4ts/dfa/index.d.ts
+++ /dev/null
@@ -1,9 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-export * from './AcceptStateInfo';
-export * from './DFA';
-export * from './DFASerializer';
-export * from './DFAState';
-export * from './LexerDFASerializer';
diff --git a/node_modules/antlr4ts/dfa/index.js b/node_modules/antlr4ts/dfa/index.js
deleted file mode 100644
index af2db59..0000000
--- a/node_modules/antlr4ts/dfa/index.js
+++ /dev/null
@@ -1,15 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-function __export(m) {
- for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];
-}
-Object.defineProperty(exports, "__esModule", { value: true });
-__export(require("./AcceptStateInfo"));
-__export(require("./DFA"));
-__export(require("./DFASerializer"));
-__export(require("./DFAState"));
-__export(require("./LexerDFASerializer"));
-//# sourceMappingURL=index.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/dfa/index.js.map b/node_modules/antlr4ts/dfa/index.js.map
deleted file mode 100644
index 21562c4..0000000
--- a/node_modules/antlr4ts/dfa/index.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/dfa/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;AAEH,uCAAkC;AAClC,2BAAsB;AACtB,qCAAgC;AAChC,gCAA2B;AAC3B,0CAAqC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/index.d.ts b/node_modules/antlr4ts/index.d.ts
deleted file mode 100644
index 3f1798f..0000000
--- a/node_modules/antlr4ts/index.d.ts
+++ /dev/null
@@ -1,46 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-export * from './ANTLRErrorListener';
-export * from './ANTLRErrorStrategy';
-export * from './ANTLRInputStream';
-export * from './BailErrorStrategy';
-export * from './BufferedTokenStream';
-export * from './CharStream';
-export * from './CommonToken';
-export * from './CommonTokenFactory';
-export * from './CommonTokenStream';
-export * from './ConsoleErrorListener';
-export * from './DefaultErrorStrategy';
-export * from './Dependents';
-export * from './DiagnosticErrorListener';
-export * from './FailedPredicateException';
-export * from './InputMismatchException';
-export * from './InterpreterRuleContext';
-export * from './IntStream';
-export * from './Lexer';
-export * from './LexerInterpreter';
-export * from './LexerNoViableAltException';
-export * from './ListTokenSource';
-export * from './NoViableAltException';
-export * from './Parser';
-export * from './ParserErrorListener';
-export * from './ParserInterpreter';
-export * from './ParserRuleContext';
-export * from './ProxyErrorListener';
-export * from './ProxyParserErrorListener';
-export * from './RecognitionException';
-export * from './Recognizer';
-export * from './RuleContext';
-export * from './RuleContextWithAltNum';
-export * from './RuleDependency';
-export * from './RuleVersion';
-export * from './Token';
-export * from './TokenFactory';
-export * from './TokenSource';
-export * from './TokenStream';
-export * from './TokenStreamRewriter';
-export * from './Vocabulary';
-export * from './VocabularyImpl';
-export * from './WritableToken';
diff --git a/node_modules/antlr4ts/index.js b/node_modules/antlr4ts/index.js
deleted file mode 100644
index e081b6e..0000000
--- a/node_modules/antlr4ts/index.js
+++ /dev/null
@@ -1,44 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-function __export(m) {
- for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];
-}
-Object.defineProperty(exports, "__esModule", { value: true });
-// export * from './ANTLRFileStream';
-__export(require("./ANTLRInputStream"));
-__export(require("./BailErrorStrategy"));
-__export(require("./BufferedTokenStream"));
-__export(require("./CommonToken"));
-__export(require("./CommonTokenFactory"));
-__export(require("./CommonTokenStream"));
-__export(require("./ConsoleErrorListener"));
-__export(require("./DefaultErrorStrategy"));
-__export(require("./Dependents"));
-__export(require("./DiagnosticErrorListener"));
-__export(require("./FailedPredicateException"));
-__export(require("./InputMismatchException"));
-__export(require("./InterpreterRuleContext"));
-__export(require("./IntStream"));
-__export(require("./Lexer"));
-__export(require("./LexerInterpreter"));
-__export(require("./LexerNoViableAltException"));
-__export(require("./ListTokenSource"));
-__export(require("./NoViableAltException"));
-__export(require("./Parser"));
-__export(require("./ParserInterpreter"));
-__export(require("./ParserRuleContext"));
-__export(require("./ProxyErrorListener"));
-__export(require("./ProxyParserErrorListener"));
-__export(require("./RecognitionException"));
-__export(require("./Recognizer"));
-__export(require("./RuleContext"));
-__export(require("./RuleContextWithAltNum"));
-__export(require("./RuleDependency"));
-__export(require("./RuleVersion"));
-__export(require("./Token"));
-__export(require("./TokenStreamRewriter"));
-__export(require("./VocabularyImpl"));
-//# sourceMappingURL=index.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/index.js.map b/node_modules/antlr4ts/index.js.map
deleted file mode 100644
index 13fcc34..0000000
--- a/node_modules/antlr4ts/index.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;AAIH,qCAAqC;AACrC,wCAAmC;AACnC,yCAAoC;AACpC,2CAAsC;AAEtC,mCAA8B;AAC9B,0CAAqC;AACrC,yCAAoC;AACpC,4CAAuC;AACvC,4CAAuC;AACvC,kCAA6B;AAC7B,+CAA0C;AAC1C,gDAA2C;AAC3C,8CAAyC;AACzC,8CAAyC;AACzC,iCAA4B;AAC5B,6BAAwB;AACxB,wCAAmC;AACnC,iDAA4C;AAC5C,uCAAkC;AAClC,4CAAuC;AACvC,8BAAyB;AAEzB,yCAAoC;AACpC,yCAAoC;AACpC,0CAAqC;AACrC,gDAA2C;AAC3C,4CAAuC;AACvC,kCAA6B;AAC7B,mCAA8B;AAC9B,6CAAwC;AACxC,sCAAiC;AACjC,mCAA8B;AAC9B,6BAAwB;AAIxB,2CAAsC;AAItC,sCAAiC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/Args.d.ts b/node_modules/antlr4ts/misc/Args.d.ts
deleted file mode 100644
index da8f5ac..0000000
--- a/node_modules/antlr4ts/misc/Args.d.ts
+++ /dev/null
@@ -1,13 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-/**
- * Validates that an argument is not `null` or `undefined`.
- *
- * @param parameterName The name of the parameter
- * @param value The argument value
- *
- * @throws `TypeError` if `value` is `null` or `undefined`.
- */
-export declare function notNull(parameterName: string, value: any): void;
diff --git a/node_modules/antlr4ts/misc/Args.js b/node_modules/antlr4ts/misc/Args.js
deleted file mode 100644
index e21dde7..0000000
--- a/node_modules/antlr4ts/misc/Args.js
+++ /dev/null
@@ -1,22 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:39.6568608-07:00
-/**
- * Validates that an argument is not `null` or `undefined`.
- *
- * @param parameterName The name of the parameter
- * @param value The argument value
- *
- * @throws `TypeError` if `value` is `null` or `undefined`.
- */
-function notNull(parameterName, value) {
- if (value == null) {
- throw new TypeError(parameterName + " cannot be null.");
- }
-}
-exports.notNull = notNull;
-//# sourceMappingURL=Args.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/Args.js.map b/node_modules/antlr4ts/misc/Args.js.map
deleted file mode 100644
index ad790b1..0000000
--- a/node_modules/antlr4ts/misc/Args.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"Args.js","sourceRoot":"","sources":["../../../src/misc/Args.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,wDAAwD;AAExD;;;;;;;GAOG;AACH,iBAAwB,aAAqB,EAAE,KAAU;IACxD,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC;QACnB,MAAM,IAAI,SAAS,CAAC,aAAa,GAAG,kBAAkB,CAAC,CAAC;IACzD,CAAC;AACF,CAAC;AAJD,0BAIC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/Array2DHashMap.d.ts b/node_modules/antlr4ts/misc/Array2DHashMap.d.ts
deleted file mode 100644
index a51a9a3..0000000
--- a/node_modules/antlr4ts/misc/Array2DHashMap.d.ts
+++ /dev/null
@@ -1,26 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { EqualityComparator } from './EqualityComparator';
-import { JavaCollection, JavaMap, JavaSet } from './Stubs';
-export declare class Array2DHashMap implements JavaMap {
- private backingStore;
- constructor(keyComparer: EqualityComparator);
- constructor(map: Array2DHashMap);
- clear(): void;
- containsKey(key: K): boolean;
- containsValue(value: V): boolean;
- entrySet(): JavaSet>;
- get(key: K): V | undefined;
- readonly isEmpty: boolean;
- keySet(): JavaSet;
- put(key: K, value: V): V | undefined;
- putIfAbsent(key: K, value: V): V | undefined;
- putAll(m: JavaMap): void;
- remove(key: K): V | undefined;
- readonly size: number;
- values(): JavaCollection;
- hashCode(): number;
- equals(o: any): boolean;
-}
diff --git a/node_modules/antlr4ts/misc/Array2DHashMap.js b/node_modules/antlr4ts/misc/Array2DHashMap.js
deleted file mode 100644
index b37e24d..0000000
--- a/node_modules/antlr4ts/misc/Array2DHashMap.js
+++ /dev/null
@@ -1,317 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-const Array2DHashSet_1 = require("./Array2DHashSet");
-const Stubs_1 = require("./Stubs");
-const DefaultEqualityComparator_1 = require("./DefaultEqualityComparator");
-class MapKeyEqualityComparator {
- constructor(keyComparator) {
- this.keyComparator = keyComparator;
- }
- hashCode(obj) {
- return this.keyComparator.hashCode(obj.key);
- }
- equals(a, b) {
- return this.keyComparator.equals(a.key, b.key);
- }
-}
-class Array2DHashMap {
- constructor(keyComparer) {
- if (keyComparer instanceof Array2DHashMap) {
- this.backingStore = new Array2DHashSet_1.Array2DHashSet(keyComparer.backingStore);
- }
- else {
- this.backingStore = new Array2DHashSet_1.Array2DHashSet(new MapKeyEqualityComparator(keyComparer));
- }
- }
- clear() {
- this.backingStore.clear();
- }
- containsKey(key) {
- return this.backingStore.contains({ key });
- }
- containsValue(value) {
- return this.values().contains(value);
- }
- entrySet() {
- return new EntrySet(this, this.backingStore);
- }
- get(key) {
- let bucket = this.backingStore.get({ key });
- if (!bucket) {
- return undefined;
- }
- return bucket.value;
- }
- get isEmpty() {
- return this.backingStore.isEmpty;
- }
- keySet() {
- return new KeySet(this, this.backingStore);
- }
- put(key, value) {
- let element = this.backingStore.get({ key, value });
- let result;
- if (!element) {
- this.backingStore.add({ key, value });
- }
- else {
- result = element.value;
- element.value = value;
- }
- return result;
- }
- putIfAbsent(key, value) {
- let element = this.backingStore.get({ key, value });
- let result;
- if (!element) {
- this.backingStore.add({ key, value });
- }
- else {
- result = element.value;
- }
- return result;
- }
- putAll(m) {
- for (let entry of Stubs_1.asIterable(m.entrySet())) {
- this.put(entry.getKey(), entry.getValue());
- }
- }
- remove(key) {
- let value = this.get(key);
- this.backingStore.remove({ key });
- return value;
- }
- get size() {
- return this.backingStore.size;
- }
- values() {
- return new ValueCollection(this, this.backingStore);
- }
- hashCode() {
- return this.backingStore.hashCode();
- }
- equals(o) {
- if (!(o instanceof Array2DHashMap)) {
- return false;
- }
- return this.backingStore.equals(o.backingStore);
- }
-}
-exports.Array2DHashMap = Array2DHashMap;
-class EntrySet {
- constructor(map, backingStore) {
- this.map = map;
- this.backingStore = backingStore;
- }
- add(e) {
- throw new Error("Not implemented");
- }
- addAll(collection) {
- throw new Error("Not implemented");
- }
- clear() {
- this.map.clear();
- }
- contains(o) {
- throw new Error("Not implemented");
- }
- containsAll(collection) {
- for (let key of Stubs_1.asIterable(collection)) {
- if (!this.contains(key)) {
- return false;
- }
- }
- return true;
- }
- equals(o) {
- if (o === this) {
- return true;
- }
- else if (!(o instanceof EntrySet)) {
- return false;
- }
- return this.backingStore.equals(o.backingStore);
- }
- hashCode() {
- return this.backingStore.hashCode();
- }
- get isEmpty() {
- return this.backingStore.isEmpty;
- }
- iterator() {
- throw new Error("Not implemented");
- }
- remove(o) {
- throw new Error("Not implemented");
- }
- removeAll(collection) {
- let removedAny = false;
- for (let key of Stubs_1.asIterable(collection)) {
- removedAny = this.remove(key) || removedAny;
- }
- return removedAny;
- }
- retainAll(collection) {
- throw new Error("Not implemented");
- }
- get size() {
- return this.backingStore.size;
- }
- toArray(a) {
- throw new Error("Not implemented");
- }
-}
-class KeySet {
- constructor(map, backingStore) {
- this.map = map;
- this.backingStore = backingStore;
- }
- add(e) {
- throw new Error("Not supported");
- }
- addAll(collection) {
- throw new Error("Not supported");
- }
- clear() {
- this.map.clear();
- }
- contains(o) {
- return this.backingStore.contains({ key: o });
- }
- containsAll(collection) {
- for (let key of Stubs_1.asIterable(collection)) {
- if (!this.contains(key)) {
- return false;
- }
- }
- return true;
- }
- equals(o) {
- if (o === this) {
- return true;
- }
- else if (!(o instanceof KeySet)) {
- return false;
- }
- return this.backingStore.equals(o.backingStore);
- }
- hashCode() {
- return this.backingStore.hashCode();
- }
- get isEmpty() {
- return this.backingStore.isEmpty;
- }
- iterator() {
- throw new Error("Not implemented");
- }
- remove(o) {
- return this.backingStore.remove({ key: o });
- }
- removeAll(collection) {
- let removedAny = false;
- for (let key of Stubs_1.asIterable(collection)) {
- removedAny = this.remove(key) || removedAny;
- }
- return removedAny;
- }
- retainAll(collection) {
- throw new Error("Not implemented");
- }
- get size() {
- return this.backingStore.size;
- }
- toArray(a) {
- throw new Error("Not implemented");
- }
-}
-class ValueCollection {
- constructor(map, backingStore) {
- this.map = map;
- this.backingStore = backingStore;
- }
- add(e) {
- throw new Error("Not supported");
- }
- addAll(collection) {
- throw new Error("Not supported");
- }
- clear() {
- this.map.clear();
- }
- contains(o) {
- for (let bucket of Stubs_1.asIterable(this.backingStore)) {
- if (DefaultEqualityComparator_1.DefaultEqualityComparator.INSTANCE.equals(o, bucket.value)) {
- return true;
- }
- }
- return false;
- }
- containsAll(collection) {
- for (let key of Stubs_1.asIterable(collection)) {
- if (!this.contains(key)) {
- return false;
- }
- }
- return true;
- }
- equals(o) {
- if (o === this) {
- return true;
- }
- else if (!(o instanceof ValueCollection)) {
- return false;
- }
- return this.backingStore.equals(o.backingStore);
- }
- hashCode() {
- return this.backingStore.hashCode();
- }
- get isEmpty() {
- return this.backingStore.isEmpty;
- }
- iterator() {
- let delegate = this.backingStore.iterator();
- return {
- hasNext() {
- return delegate.hasNext();
- },
- next() {
- return delegate.next().value;
- },
- remove() {
- throw new Error("Not supported");
- }
- };
- }
- remove(o) {
- throw new Error("Not implemented");
- }
- removeAll(collection) {
- let removedAny = false;
- for (let key of Stubs_1.asIterable(collection)) {
- removedAny = this.remove(key) || removedAny;
- }
- return removedAny;
- }
- retainAll(collection) {
- throw new Error("Not implemented");
- }
- get size() {
- return this.backingStore.size;
- }
- toArray(a) {
- if (a === undefined || a.length < this.backingStore.size) {
- a = new Array(this.backingStore.size);
- }
- let i = 0;
- for (let bucket of Stubs_1.asIterable(this.backingStore)) {
- a[i++] = bucket.value;
- }
- return a;
- }
-}
-//# sourceMappingURL=Array2DHashMap.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/Array2DHashMap.js.map b/node_modules/antlr4ts/misc/Array2DHashMap.js.map
deleted file mode 100644
index 37dda5b..0000000
--- a/node_modules/antlr4ts/misc/Array2DHashMap.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"Array2DHashMap.js","sourceRoot":"","sources":["../../../src/misc/Array2DHashMap.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,qDAAkD;AAClD,mCAAqC;AAErC,2EAAwE;AASxE;IAGC,YAAY,aAAoC;QAC/C,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACpC,CAAC;IAED,QAAQ,CAAC,GAAiB;QACzB,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7C,CAAC;IAED,MAAM,CAAC,CAAe,EAAE,CAAe;QACtC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IAChD,CAAC;CACD;AAED;IAKC,YAAY,WAAyD;QACpE,EAAE,CAAC,CAAC,WAAW,YAAY,cAAc,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,YAAY,GAAG,IAAI,+BAAc,CAAe,WAAW,CAAC,YAAY,CAAC,CAAC;QAChF,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,YAAY,GAAG,IAAI,+BAAc,CAAe,IAAI,wBAAwB,CAAO,WAAW,CAAC,CAAC,CAAC;QACvG,CAAC;IACF,CAAC;IAED,KAAK;QACJ,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IAED,WAAW,CAAC,GAAM;QACjB,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED,aAAa,CAAC,KAAQ;QACrB,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC;IAED,QAAQ;QACP,MAAM,CAAC,IAAI,QAAQ,CAAO,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;IACpD,CAAC;IAED,GAAG,CAAC,GAAM;QACT,IAAI,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QAC5C,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YACb,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAED,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;IACrB,CAAC;IAED,IAAI,OAAO;QACV,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC;IAClC,CAAC;IAED,MAAM;QACL,MAAM,CAAC,IAAI,MAAM,CAAO,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;IAClD,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QACnB,IAAI,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;QACpD,IAAI,MAAqB,CAAC;QAC1B,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YACd,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;QACvC,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC;YACvB,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC;QACvB,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAED,WAAW,CAAC,GAAM,EAAE,KAAQ;QAC3B,IAAI,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;QACpD,IAAI,MAAqB,CAAC;QAC1B,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YACd,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;QACvC,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC;QACxB,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAED,MAAM,CAA6B,CAAkB;QACpD,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,kBAAU,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5C,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;QAC5C,CAAC;IACF,CAAC;IAED,MAAM,CAAC,GAAM;QACZ,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QAClC,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED,IAAI,IAAI;QACP,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;IAC/B,CAAC;IAED,MAAM;QACL,MAAM,CAAC,IAAI,eAAe,CAAO,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;IAC3D,CAAC;IAED,QAAQ;QACP,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC;IACrC,CAAC;IAED,MAAM,CAAC,CAAM;QACZ,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,cAAc,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IACjD,CAAC;CACD;AAtGD,wCAsGC;AAED;IAIC,YAAY,GAAyB,EAAE,YAA0C;QAChF,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;IAClC,CAAC;IAED,GAAG,CAAC,CAAsB;QACzB,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACpC,CAAC;IAED,MAAM,CAAC,UAA2C;QACjD,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACpC,CAAC;IAED,KAAK;QACJ,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC;IAED,QAAQ,CAAC,CAAM;QACd,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACpC,CAAC;IAED,WAAW,CAAC,UAA2B;QACtC,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,kBAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACxC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM,CAAC,KAAK,CAAC;YACd,CAAC;QACF,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAED,MAAM,CAAC,CAAM;QACZ,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,QAAQ,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IACjD,CAAC;IAED,QAAQ;QACP,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC;IACrC,CAAC;IAED,IAAI,OAAO;QACV,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC;IAClC,CAAC;IAED,QAAQ;QACP,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACpC,CAAC;IAED,MAAM,CAAC,CAAM;QACZ,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACpC,CAAC;IAED,SAAS,CAAC,UAA2B;QACpC,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,kBAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACxC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC;QAC7C,CAAC;QAED,MAAM,CAAC,UAAU,CAAC;IACnB,CAAC;IAED,SAAS,CAAC,UAA2B;QACpC,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACpC,CAAC;IAED,IAAI,IAAI;QACP,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;IAC/B,CAAC;IAID,OAAO,CAAC,CAAyB;QAChC,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACpC,CAAC;CACD;AAED;IAIC,YAAY,GAAyB,EAAE,YAA0C;QAChF,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;IAClC,CAAC;IAED,GAAG,CAAC,CAAI;QACP,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;IAClC,CAAC;IAED,MAAM,CAAC,UAAyB;QAC/B,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;IAClC,CAAC;IAED,KAAK;QACJ,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC;IAED,QAAQ,CAAC,CAAM;QACd,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC/C,CAAC;IAED,WAAW,CAAC,UAA2B;QACtC,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,kBAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACxC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM,CAAC,KAAK,CAAC;YACd,CAAC;QACF,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAED,MAAM,CAAC,CAAM;QACZ,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,MAAM,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IACjD,CAAC;IAED,QAAQ;QACP,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC;IACrC,CAAC;IAED,IAAI,OAAO;QACV,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC;IAClC,CAAC;IAED,QAAQ;QACP,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACpC,CAAC;IAED,MAAM,CAAC,CAAM;QACZ,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC7C,CAAC;IAED,SAAS,CAAC,UAA2B;QACpC,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,kBAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACxC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC;QAC7C,CAAC;QAED,MAAM,CAAC,UAAU,CAAC;IACnB,CAAC;IAED,SAAS,CAAC,UAA2B;QACpC,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACpC,CAAC;IAED,IAAI,IAAI;QACP,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;IAC/B,CAAC;IAID,OAAO,CAAC,CAAO;QACd,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACpC,CAAC;CACD;AAED;IAIC,YAAY,GAAyB,EAAE,YAA0C;QAChF,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;IAClC,CAAC;IAED,GAAG,CAAC,CAAI;QACP,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;IAClC,CAAC;IAED,MAAM,CAAC,UAAyB;QAC/B,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;IAClC,CAAC;IAED,KAAK;QACJ,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC;IAED,QAAQ,CAAC,CAAM;QACd,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,kBAAU,CAAe,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAChE,EAAE,CAAC,CAAC,qDAAyB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,IAAI,CAAC;YACb,CAAC;QACF,CAAC;QAED,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED,WAAW,CAAC,UAA2B;QACtC,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,kBAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACxC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM,CAAC,KAAK,CAAC;YACd,CAAC;QACF,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAED,MAAM,CAAC,CAAM;QACZ,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,eAAe,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IACjD,CAAC;IAED,QAAQ;QACP,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC;IACrC,CAAC;IAED,IAAI,OAAO;QACV,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC;IAClC,CAAC;IAED,QAAQ;QACP,IAAI,QAAQ,GAA+B,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC;QACxE,MAAM,CAAC;YACN,OAAO;gBACN,MAAM,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;YAC3B,CAAC;YAED,IAAI;gBACH,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAM,CAAC;YAC/B,CAAC;YAED,MAAM;gBACL,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;YAClC,CAAC;SACD,CAAC;IACH,CAAC;IAED,MAAM,CAAC,CAAM;QACZ,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACpC,CAAC;IAED,SAAS,CAAC,UAA2B;QACpC,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,kBAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACxC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC;QAC7C,CAAC;QAED,MAAM,CAAC,UAAU,CAAC;IACnB,CAAC;IAED,SAAS,CAAC,UAA2B;QACpC,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACpC,CAAC;IAED,IAAI,IAAI;QACP,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;IAC/B,CAAC;IAID,OAAO,CAAC,CAAO;QACd,EAAE,CAAC,CAAC,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;YAC1D,CAAC,GAAG,IAAI,KAAK,CAAI,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,kBAAU,CAAe,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAChE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,KAAM,CAAC;QACxB,CAAC;QAED,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;CACD"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/Array2DHashSet.d.ts b/node_modules/antlr4ts/misc/Array2DHashSet.d.ts
deleted file mode 100644
index c4847c3..0000000
--- a/node_modules/antlr4ts/misc/Array2DHashSet.d.ts
+++ /dev/null
@@ -1,64 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { EqualityComparator } from './EqualityComparator';
-import { Collection, JavaIterator, JavaCollection, JavaSet } from './Stubs';
-export declare class Array2DHashSet implements JavaSet {
- protected comparator: EqualityComparator;
- protected buckets: (T[] | undefined)[];
- /** How many elements in set */
- protected n: number;
- protected threshold: number;
- constructor(comparator?: EqualityComparator, initialCapacity?: number);
- constructor(set: Array2DHashSet);
- /**
- * Add {@code o} to set if not there; return existing value if already
- * there. This method performs the same operation as {@link #add} aside from
- * the return value.
- */
- getOrAdd(o: T): T;
- protected getOrAddImpl(o: T): T;
- get(o: T): T | undefined;
- protected getBucket(o: T): number;
- hashCode(): number;
- equals(o: any): boolean;
- protected expand(): void;
- add(t: T): boolean;
- readonly size: number;
- readonly isEmpty: boolean;
- contains(o: any): boolean;
- containsFast(obj: T): boolean;
- iterator(): JavaIterator;
- toArray(a?: any[]): T[];
- remove(o: any): boolean;
- removeFast(obj: T): boolean;
- containsAll(collection: JavaCollection): boolean;
- addAll(c: Collection): boolean;
- retainAll(c: JavaCollection): boolean;
- removeAll(c: Collection): boolean;
- clear(): void;
- toString(): string;
- toTableString(): string;
- /**
- * Return {@code o} as an instance of the element type {@code T}. If
- * {@code o} is non-null but known to not be an instance of {@code T}, this
- * method returns {@code null}. The base implementation does not perform any
- * type checks; override this method to provide strong type checks for the
- * {@link #contains} and {@link #remove} methods to ensure the arguments to
- * the {@link EqualityComparator} for the set always have the expected
- * types.
- *
- * @param o the object to try and cast to the element type of the set
- * @return {@code o} if it could be an instance of {@code T}, otherwise
- * {@code null}.
- */
- protected asElementType(o: any): T;
- /**
- * Return an array of {@code T[]} with length {@code capacity}.
- *
- * @param capacity the length of the array to return
- * @return the newly constructed array
- */
- protected createBuckets(capacity: number): (T[] | undefined)[];
-}
diff --git a/node_modules/antlr4ts/misc/Array2DHashSet.js b/node_modules/antlr4ts/misc/Array2DHashSet.js
deleted file mode 100644
index b1caa46..0000000
--- a/node_modules/antlr4ts/misc/Array2DHashSet.js
+++ /dev/null
@@ -1,449 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-03T02:09:41.7434086-07:00
-const assert = require("assert");
-const DefaultEqualityComparator_1 = require("./DefaultEqualityComparator");
-const Decorators_1 = require("../Decorators");
-const Stubs_1 = require("./Stubs");
-const MurmurHash_1 = require("./MurmurHash");
-/** {@link Set} implementation with closed hashing (open addressing). */
-// NOTE: JavaScript's Set interface has on significant different diffrence from Java's:
-// e.g. the return type of add() differs!
-// For this reason I've commented tweaked the implements clause
-const INITAL_CAPACITY = 16; // must be power of 2
-const LOAD_FACTOR = 0.75;
-class Array2DHashSet {
- constructor(comparatorOrSet, initialCapacity = INITAL_CAPACITY) {
- /** How many elements in set */
- this.n = 0;
- this.threshold = Math.floor(INITAL_CAPACITY * LOAD_FACTOR); // when to expand
- if (comparatorOrSet instanceof Array2DHashSet) {
- this.comparator = comparatorOrSet.comparator;
- this.buckets = comparatorOrSet.buckets.slice(0);
- for (let i = 0; i < this.buckets.length; i++) {
- let bucket = this.buckets[i];
- if (bucket) {
- this.buckets[i] = bucket.slice(0);
- }
- }
- this.n = comparatorOrSet.n;
- this.threshold = comparatorOrSet.threshold;
- }
- else {
- this.comparator = comparatorOrSet || DefaultEqualityComparator_1.DefaultEqualityComparator.INSTANCE;
- this.buckets = this.createBuckets(initialCapacity);
- }
- }
- /**
- * Add {@code o} to set if not there; return existing value if already
- * there. This method performs the same operation as {@link #add} aside from
- * the return value.
- */
- getOrAdd(o) {
- if (this.n > this.threshold)
- this.expand();
- return this.getOrAddImpl(o);
- }
- getOrAddImpl(o) {
- let b = this.getBucket(o);
- let bucket = this.buckets[b];
- // NEW BUCKET
- if (!bucket) {
- bucket = [o];
- this.buckets[b] = bucket;
- this.n++;
- return o;
- }
- // LOOK FOR IT IN BUCKET
- for (let i = 0; i < bucket.length; i++) {
- let existing = bucket[i];
- if (this.comparator.equals(existing, o)) {
- return existing; // found existing, quit
- }
- }
- // FULL BUCKET, expand and add to end
- bucket.push(o);
- this.n++;
- return o;
- }
- get(o) {
- if (o == null)
- return o;
- let b = this.getBucket(o);
- let bucket = this.buckets[b];
- if (!bucket) {
- // no bucket
- return undefined;
- }
- for (let e of bucket) {
- if (this.comparator.equals(e, o)) {
- return e;
- }
- }
- return undefined;
- }
- getBucket(o) {
- let hash = this.comparator.hashCode(o);
- let b = hash & (this.buckets.length - 1); // assumes len is power of 2
- return b;
- }
- hashCode() {
- let hash = MurmurHash_1.MurmurHash.initialize();
- for (let bucket of this.buckets) {
- if (bucket == null)
- continue;
- for (let o of bucket) {
- if (o == null)
- break;
- hash = MurmurHash_1.MurmurHash.update(hash, this.comparator.hashCode(o));
- }
- }
- hash = MurmurHash_1.MurmurHash.finish(hash, this.size);
- return hash;
- }
- equals(o) {
- if (o === this)
- return true;
- if (!(o instanceof Array2DHashSet))
- return false;
- if (o.size !== this.size)
- return false;
- let same = this.containsAll(o);
- return same;
- }
- expand() {
- let old = this.buckets;
- let newCapacity = this.buckets.length * 2;
- let newTable = this.createBuckets(newCapacity);
- this.buckets = newTable;
- this.threshold = Math.floor(newCapacity * LOAD_FACTOR);
- // System.out.println("new size="+newCapacity+", thres="+threshold);
- // rehash all existing entries
- let oldSize = this.size;
- for (let bucket of old) {
- if (!bucket) {
- continue;
- }
- for (let o of bucket) {
- let b = this.getBucket(o);
- let newBucket = this.buckets[b];
- if (!newBucket) {
- newBucket = [];
- this.buckets[b] = newBucket;
- }
- newBucket.push(o);
- }
- }
- assert(this.n === oldSize);
- }
- add(t) {
- let existing = this.getOrAdd(t);
- return existing === t;
- }
- get size() {
- return this.n;
- }
- get isEmpty() {
- return this.n === 0;
- }
- contains(o) {
- return this.containsFast(this.asElementType(o));
- }
- containsFast(obj) {
- if (obj == null) {
- return false;
- }
- return this.get(obj) != null;
- }
- iterator() {
- return new SetIterator(this.toArray(), this);
- }
- toArray(a) {
- // Check if the array argument was provided
- if (!a || a.length < this.size) {
- a = new Array(this.size);
- }
- // Copy elements from the nested arrays into the destination array
- let i = 0; // Position within destination array
- for (let bucket of this.buckets) {
- if (bucket == null) {
- continue;
- }
- for (let o of bucket) {
- if (o == null) {
- break;
- }
- a[i++] = o;
- }
- }
- return a;
- }
- remove(o) {
- return this.removeFast(this.asElementType(o));
- }
- removeFast(obj) {
- if (obj == null) {
- return false;
- }
- let b = this.getBucket(obj);
- let bucket = this.buckets[b];
- if (!bucket) {
- // no bucket
- return false;
- }
- for (let i = 0; i < bucket.length; i++) {
- let e = bucket[i];
- if (this.comparator.equals(e, obj)) {
- // shift all elements to the right down one
- bucket.copyWithin(i, i + 1);
- bucket.length--;
- this.n--;
- return true;
- }
- }
- return false;
- }
- containsAll(collection) {
- if (collection instanceof Array2DHashSet) {
- let s = collection;
- for (let bucket of s.buckets) {
- if (bucket == null)
- continue;
- for (let o of bucket) {
- if (o == null)
- break;
- if (!this.containsFast(this.asElementType(o)))
- return false;
- }
- }
- }
- else {
- for (let o of Stubs_1.asIterable(collection)) {
- if (!this.containsFast(this.asElementType(o)))
- return false;
- }
- }
- return true;
- }
- addAll(c) {
- let changed = false;
- for (let o of Stubs_1.asIterable(c)) {
- let existing = this.getOrAdd(o);
- if (existing !== o)
- changed = true;
- }
- return changed;
- }
- retainAll(c) {
- let newsize = 0;
- for (let bucket of this.buckets) {
- if (bucket == null) {
- continue;
- }
- let i;
- let j;
- for (i = 0, j = 0; i < bucket.length; i++) {
- if (bucket[i] == null) {
- break;
- }
- if (!c.contains(bucket[i])) {
- // removed
- continue;
- }
- // keep
- if (i !== j) {
- bucket[j] = bucket[i];
- }
- j++;
- newsize++;
- }
- newsize += j;
- bucket.length = j;
- }
- let changed = newsize != this.n;
- this.n = newsize;
- return changed;
- }
- removeAll(c) {
- let changed = false;
- for (let o of Stubs_1.asIterable(c)) {
- if (this.removeFast(this.asElementType(o)))
- changed = true;
- }
- return changed;
- }
- clear() {
- this.buckets = this.createBuckets(INITAL_CAPACITY);
- this.n = 0;
- this.threshold = Math.floor(INITAL_CAPACITY * LOAD_FACTOR);
- }
- toString() {
- if (this.size === 0)
- return "{}";
- let buf = '{';
- let first = true;
- for (let bucket of this.buckets) {
- if (bucket == null)
- continue;
- for (let o of bucket) {
- if (o == null)
- break;
- if (first)
- first = false;
- else
- buf += ", ";
- buf += o.toString();
- }
- }
- buf += '}';
- return buf;
- }
- toTableString() {
- let buf = "";
- for (let bucket of this.buckets) {
- if (bucket == null) {
- buf += "null\n";
- continue;
- }
- buf += '[';
- let first = true;
- for (let o of bucket) {
- if (first)
- first = false;
- else
- buf += " ";
- if (o == null)
- buf += "_";
- else
- buf += o.toString();
- }
- buf += "]\n";
- }
- return buf;
- }
- /**
- * Return {@code o} as an instance of the element type {@code T}. If
- * {@code o} is non-null but known to not be an instance of {@code T}, this
- * method returns {@code null}. The base implementation does not perform any
- * type checks; override this method to provide strong type checks for the
- * {@link #contains} and {@link #remove} methods to ensure the arguments to
- * the {@link EqualityComparator} for the set always have the expected
- * types.
- *
- * @param o the object to try and cast to the element type of the set
- * @return {@code o} if it could be an instance of {@code T}, otherwise
- * {@code null}.
- */
- asElementType(o) {
- return o;
- }
- /**
- * Return an array of {@code T[]} with length {@code capacity}.
- *
- * @param capacity the length of the array to return
- * @return the newly constructed array
- */
- createBuckets(capacity) {
- return new Array(capacity);
- }
-}
-__decorate([
- Decorators_1.NotNull
-], Array2DHashSet.prototype, "comparator", void 0);
-__decorate([
- Decorators_1.Override
-], Array2DHashSet.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], Array2DHashSet.prototype, "equals", null);
-__decorate([
- Decorators_1.Override
-], Array2DHashSet.prototype, "add", null);
-__decorate([
- Decorators_1.Override
-], Array2DHashSet.prototype, "size", null);
-__decorate([
- Decorators_1.Override
-], Array2DHashSet.prototype, "isEmpty", null);
-__decorate([
- Decorators_1.Override
-], Array2DHashSet.prototype, "contains", null);
-__decorate([
- __param(0, Decorators_1.Nullable)
-], Array2DHashSet.prototype, "containsFast", null);
-__decorate([
- Decorators_1.Override
-], Array2DHashSet.prototype, "iterator", null);
-__decorate([
- Decorators_1.Override
-], Array2DHashSet.prototype, "toArray", null);
-__decorate([
- Decorators_1.Override
-], Array2DHashSet.prototype, "remove", null);
-__decorate([
- __param(0, Decorators_1.Nullable)
-], Array2DHashSet.prototype, "removeFast", null);
-__decorate([
- Decorators_1.Override
-], Array2DHashSet.prototype, "containsAll", null);
-__decorate([
- Decorators_1.Override
-], Array2DHashSet.prototype, "addAll", null);
-__decorate([
- Decorators_1.Override
-], Array2DHashSet.prototype, "retainAll", null);
-__decorate([
- Decorators_1.Override
-], Array2DHashSet.prototype, "removeAll", null);
-__decorate([
- Decorators_1.Override
-], Array2DHashSet.prototype, "clear", null);
-__decorate([
- Decorators_1.Override
-], Array2DHashSet.prototype, "toString", null);
-__decorate([
- Decorators_1.SuppressWarnings("unchecked")
-], Array2DHashSet.prototype, "asElementType", null);
-__decorate([
- Decorators_1.SuppressWarnings("unchecked")
-], Array2DHashSet.prototype, "createBuckets", null);
-exports.Array2DHashSet = Array2DHashSet;
-class SetIterator {
- constructor(data, set) {
- this.data = data;
- this.set = set;
- this.nextIndex = 0;
- this.removed = true;
- }
- hasNext() {
- return this.nextIndex < this.data.length;
- }
- next() {
- if (this.nextIndex >= this.data.length)
- throw new RangeError("Attempted to iterate past end.");
- this.removed = false;
- return this.data[this.nextIndex++];
- }
- // Note: this is an untested extension to the JavaScript iterator interface
- remove() {
- if (this.removed) {
- throw new Error("This entry has already been removed");
- }
- this.set.remove(this.data[this.nextIndex - 1]);
- this.removed = true;
- }
-}
-//# sourceMappingURL=Array2DHashSet.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/Array2DHashSet.js.map b/node_modules/antlr4ts/misc/Array2DHashSet.js.map
deleted file mode 100644
index dc3400a..0000000
--- a/node_modules/antlr4ts/misc/Array2DHashSet.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"Array2DHashSet.js","sourceRoot":"","sources":["../../../src/misc/Array2DHashSet.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,iCAAiC;AACjC,2EAAwE;AAExE,8CAA8E;AAC9E,mCAAsG;AAEtG,6CAA0C;AAE1C,wEAAwE;AAExE,wFAAwF;AACxF,6CAA6C;AAC7C,sEAAsE;AAEtE,MAAM,eAAe,GAAW,EAAE,CAAC,CAAC,qBAAqB;AACzD,MAAM,WAAW,GAAW,IAAI,CAAC;AAEjC;IAaC,YACC,eAA2D,EAC3D,kBAA0B,eAAe;QAT1C,+BAA+B;QACrB,MAAC,GAAW,CAAC,CAAC;QAEd,cAAS,GAAW,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,WAAW,CAAC,CAAC,CAAC,iBAAiB;QAQzF,EAAE,CAAC,CAAC,eAAe,YAAY,cAAc,CAAC,CAAC,CAAC;YAC/C,IAAI,CAAC,UAAU,GAAG,eAAe,CAAC,UAAU,CAAC;YAC7C,IAAI,CAAC,OAAO,GAAG,eAAe,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAChD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9C,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC7B,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;oBACZ,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACnC,CAAC;YACF,CAAC;YAED,IAAI,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC;YAC3B,IAAI,CAAC,SAAS,GAAG,eAAe,CAAC,SAAS,CAAC;QAC5C,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,UAAU,GAAG,eAAe,IAAI,qDAAyB,CAAC,QAAQ,CAAC;YACxE,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,CAAC;QACpD,CAAC;IACF,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,CAAI;QACZ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;YAAC,IAAI,CAAC,MAAM,EAAE,CAAC;QAC3C,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IAES,YAAY,CAAC,CAAI;QAC1B,IAAI,CAAC,GAAW,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAE7B,aAAa;QACb,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YACb,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;YACzB,IAAI,CAAC,CAAC,EAAE,CAAC;YACT,MAAM,CAAC,CAAC,CAAC;QACV,CAAC;QAED,wBAAwB;QACxB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,IAAI,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzC,MAAM,CAAC,QAAQ,CAAC,CAAC,uBAAuB;YACzC,CAAC;QACF,CAAC;QAED,qCAAqC;QACrC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACf,IAAI,CAAC,CAAC,EAAE,CAAC;QACT,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAED,GAAG,CAAC,CAAI;QACP,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,GAAW,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC7B,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YACb,YAAY;YACZ,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC;YACtB,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,CAAC,CAAC,CAAC;YACV,CAAC;QACF,CAAC;QAED,MAAM,CAAC,SAAS,CAAC;IAClB,CAAC;IAES,SAAS,CAAC,CAAI;QACvB,IAAI,IAAI,GAAW,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAI,CAAC,GAAW,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,4BAA4B;QAC9E,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAGD,QAAQ;QACP,IAAI,IAAI,GAAW,uBAAU,CAAC,UAAU,EAAE,CAAC;QAC3C,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;YACjC,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC;gBAAC,QAAQ,CAAC;YAC7B,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC;gBACtB,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;oBAAC,KAAK,CAAC;gBACrB,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7D,CAAC;QACF,CAAC;QAED,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAGD,MAAM,CAAC,CAAM;QACZ,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;YAAC,MAAM,CAAC,IAAI,CAAC;QAC5B,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,cAAc,CAAC,CAAC;YAAC,MAAM,CAAC,KAAK,CAAC;QACjD,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;YAAC,MAAM,CAAC,KAAK,CAAC;QACvC,IAAI,IAAI,GAAY,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAES,MAAM;QACf,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC;QACvB,IAAI,WAAW,GAAW,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAClD,IAAI,QAAQ,GAAwB,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QACpE,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC;QACxB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC;QACzD,qEAAqE;QACnE,8BAA8B;QAC9B,IAAI,OAAO,GAAW,IAAI,CAAC,IAAI,CAAC;QAChC,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC;YACxB,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;gBACb,QAAQ,CAAC;YACV,CAAC;YAED,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC;gBACtB,IAAI,CAAC,GAAW,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAClC,IAAI,SAAS,GAAoB,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACjD,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;oBAChB,SAAS,GAAG,EAAE,CAAC;oBACf,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;gBAC7B,CAAC;gBAED,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACnB,CAAC;QACF,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC;IAC5B,CAAC;IAGD,GAAG,CAAC,CAAI;QACP,IAAI,QAAQ,GAAM,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,QAAQ,KAAK,CAAC,CAAC;IACvB,CAAC;IAGD,IAAI,IAAI;QACP,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IACf,CAAC;IAGD,IAAI,OAAO;QACV,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;IACrB,CAAC;IAGD,QAAQ,CAAC,CAAM;QACd,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC;IAED,YAAY,CAAW,GAAM;QAC5B,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;IAC9B,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,IAAI,WAAW,CAAI,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,CAAC,CAAC;IACjD,CAAC;IAGD,OAAO,CAAC,CAAS;QAEhB,2CAA2C;QAC3C,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAChC,CAAC,GAAG,IAAI,KAAK,CAAI,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;QAED,kEAAkE;QAClE,IAAI,CAAC,GAAW,CAAC,CAAC,CAAC,oCAAoC;QACvD,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;YACjC,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC;gBACpB,QAAQ,CAAC;YACV,CAAC;YAED,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC;gBACtB,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;oBACf,KAAK,CAAC;gBACP,CAAC;gBACD,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YACZ,CAAC;QACF,CAAC;QACD,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAGD,MAAM,CAAC,CAAM;QACZ,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED,UAAU,CAAW,GAAM;QAC1B,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,IAAI,CAAC,GAAW,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC7B,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YACb,YAAY;YACZ,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAClB,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;gBACpC,2CAA2C;gBAC3C,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC5B,MAAM,CAAC,MAAM,EAAE,CAAC;gBAChB,IAAI,CAAC,CAAC,EAAE,CAAC;gBACT,MAAM,CAAC,IAAI,CAAC;YACb,CAAC;QACF,CAAC;QAED,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAGD,WAAW,CAAC,UAA6B;QACxC,EAAE,CAAC,CAAC,UAAU,YAAY,cAAc,CAAC,CAAC,CAAC;YAC1C,IAAI,CAAC,GAAG,UAAsC,CAAC;YAC/C,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;gBAC9B,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC;oBAAC,QAAQ,CAAC;gBAC7B,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC;oBACtB,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;wBAAC,KAAK,CAAC;oBACrB,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;wBAAC,MAAM,CAAC,KAAK,CAAC;gBAC7D,CAAC;YACF,CAAC;QACF,CAAC;QACD,IAAI,CAAC,CAAC;YACL,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,kBAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBACtC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAC,MAAM,CAAC,KAAK,CAAC;YAC7D,CAAC;QACF,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAGD,MAAM,CAAC,CAAgB;QACtB,IAAI,OAAO,GAAY,KAAK,CAAC;QAE7B,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,kBAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,QAAQ,GAAM,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACnC,EAAE,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC;gBAAC,OAAO,GAAG,IAAI,CAAC;QACpC,CAAC;QACD,MAAM,CAAC,OAAO,CAAC;IAChB,CAAC;IAGD,SAAS,CAAC,CAAoB;QAC7B,IAAI,OAAO,GAAW,CAAC,CAAC;QACxB,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;YACjC,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC;gBACpB,QAAQ,CAAC;YACV,CAAC;YAED,IAAI,CAAS,CAAC;YACd,IAAI,CAAS,CAAC;YACd,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;oBACvB,KAAK,CAAC;gBACP,CAAC;gBAED,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC5B,UAAU;oBACV,QAAQ,CAAC;gBACV,CAAC;gBAED,OAAO;gBACP,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACb,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACvB,CAAC;gBAED,CAAC,EAAE,CAAC;gBACJ,OAAO,EAAE,CAAC;YACX,CAAC;YAED,OAAO,IAAI,CAAC,CAAC;YACb,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACnB,CAAC;QAED,IAAI,OAAO,GAAY,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC;QACjB,MAAM,CAAC,OAAO,CAAC;IAChB,CAAC;IAGD,SAAS,CAAC,CAAgB;QACzB,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,kBAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAC,OAAO,GAAG,IAAI,CAAC;QAC5D,CAAC;QAED,MAAM,CAAC,OAAO,CAAC;IAChB,CAAC;IAGD,KAAK;QACJ,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,CAAC;QACnD,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,WAAW,CAAC,CAAC;IAC5D,CAAC;IAGD,QAAQ;QACP,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;YAAC,MAAM,CAAC,IAAI,CAAC;QAEjC,IAAI,GAAG,GAAG,GAAG,CAAC;QACd,IAAI,KAAK,GAAY,IAAI,CAAC;QAC1B,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;YACjC,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC;gBAAC,QAAQ,CAAC;YAC7B,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC;gBACtB,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;oBAAC,KAAK,CAAC;gBACrB,EAAE,CAAC,CAAC,KAAK,CAAC;oBAAC,KAAK,GAAG,KAAK,CAAC;gBACzB,IAAI;oBAAC,GAAG,IAAI,IAAI,CAAC;gBACjB,GAAG,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YACrB,CAAC;QACF,CAAC;QACD,GAAG,IAAI,GAAG,CAAC;QACX,MAAM,CAAC,GAAG,CAAC;IACZ,CAAC;IAED,aAAa;QACZ,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;YACjC,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC;gBACpB,GAAG,IAAI,QAAQ,CAAC;gBAChB,QAAQ,CAAC;YACV,CAAC;YACD,GAAG,IAAI,GAAG,CAAC;YACX,IAAI,KAAK,GAAY,IAAI,CAAC;YAC1B,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC;gBACtB,EAAE,CAAC,CAAC,KAAK,CAAC;oBAAC,KAAK,GAAG,KAAK,CAAC;gBACzB,IAAI;oBAAC,GAAG,IAAI,GAAG,CAAC;gBAChB,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;oBAAC,GAAG,IAAI,GAAG,CAAC;gBAC1B,IAAI;oBAAC,GAAG,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC1B,CAAC;YACD,GAAG,IAAI,KAAK,CAAC;QACd,CAAC;QACD,MAAM,CAAC,GAAG,CAAC;IACZ,CAAC;IAED;;;;;;;;;;;;OAYG;IAGO,aAAa,CAAC,CAAM;QAC7B,MAAM,CAAC,CAAM,CAAC;IACf,CAAC;IAED;;;;;OAKG;IAEO,aAAa,CAAC,QAAgB;QACvC,MAAM,CAAC,IAAI,KAAK,CAAM,QAAQ,CAAC,CAAC;IACjC,CAAC;CACD;AAtYA;IADC,oBAAO;kDACoC;AA8F5C;IADC,qBAAQ;8CAaR;AAGD;IADC,qBAAQ;4CAOR;AAgCD;IADC,qBAAQ;yCAIR;AAGD;IADC,qBAAQ;0CAGR;AAGD;IADC,qBAAQ;6CAGR;AAGD;IADC,qBAAQ;8CAGR;AAED;IAAc,WAAA,qBAAQ,CAAA;kDAMrB;AAGD;IADC,qBAAQ;8CAGR;AAGD;IADC,qBAAQ;6CAuBR;AAGD;IADC,qBAAQ;4CAGR;AAED;IAAY,WAAA,qBAAQ,CAAA;gDAwBnB;AAGD;IADC,qBAAQ;iDAkBR;AAGD;IADC,qBAAQ;4CASR;AAGD;IADC,qBAAQ;+CAoCR;AAGD;IADC,qBAAQ;+CAQR;AAGD;IADC,qBAAQ;2CAKR;AAGD;IADC,qBAAQ;8CAiBR;AAqCD;IADC,6BAAgB,CAAC,WAAW,CAAC;mDAG7B;AASD;IADC,6BAAgB,CAAC,WAAW,CAAC;mDAG7B;AAvYF,wCAwYC;AAED;IAIC,YAAoB,IAAS,EAAU,GAAsB;QAAzC,SAAI,GAAJ,IAAI,CAAK;QAAU,QAAG,GAAH,GAAG,CAAmB;QAH7D,cAAS,GAAW,CAAC,CAAC;QACtB,YAAO,GAAY,IAAI,CAAC;IAEyC,CAAC;IAE3D,OAAO;QACb,MAAM,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1C,CAAC;IAED,IAAI;QACH,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;YAAC,MAAM,IAAI,UAAU,CAAC,gCAAgC,CAAC,CAAA;QAC9F,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;QACrB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;IACpC,CAAC;IAED,2EAA2E;IAC3E,MAAM;QACL,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;QACxD,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;IACrB,CAAC;CACD"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/ArrayEqualityComparator.d.ts b/node_modules/antlr4ts/misc/ArrayEqualityComparator.d.ts
deleted file mode 100644
index 15e7d03..0000000
--- a/node_modules/antlr4ts/misc/ArrayEqualityComparator.d.ts
+++ /dev/null
@@ -1,32 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { EqualityComparator } from './EqualityComparator';
-import { Equatable } from './Stubs';
-/**
- * This default implementation of {@link EqualityComparator} uses object equality
- * for comparisons by calling {@link Object#hashCode} and {@link Object#equals}.
- *
- * @author Sam Harwell
- */
-export declare class ArrayEqualityComparator implements EqualityComparator {
- static readonly INSTANCE: ArrayEqualityComparator;
- /**
- * {@inheritDoc}
- *
- * This implementation returns
- * {@code obj.}{@link Object#hashCode hashCode()}.
- */
- hashCode(obj: Equatable[]): number;
- /**
- * {@inheritDoc}
- *
- * This implementation relies on object equality. If both objects are
- * {@code null}, this method returns {@code true}. Otherwise if only
- * {@code a} is {@code null}, this method returns {@code false}. Otherwise,
- * this method returns the result of
- * {@code a.}{@link Object#equals equals}{@code (b)}.
- */
- equals(a: Equatable[], b: Equatable[]): boolean;
-}
diff --git a/node_modules/antlr4ts/misc/ArrayEqualityComparator.js b/node_modules/antlr4ts/misc/ArrayEqualityComparator.js
deleted file mode 100644
index 2df1431..0000000
--- a/node_modules/antlr4ts/misc/ArrayEqualityComparator.js
+++ /dev/null
@@ -1,70 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const Decorators_1 = require("../Decorators");
-const MurmurHash_1 = require("./MurmurHash");
-const ObjectEqualityComparator_1 = require("./ObjectEqualityComparator");
-/**
- * This default implementation of {@link EqualityComparator} uses object equality
- * for comparisons by calling {@link Object#hashCode} and {@link Object#equals}.
- *
- * @author Sam Harwell
- */
-class ArrayEqualityComparator {
- /**
- * {@inheritDoc}
- *
- * This implementation returns
- * {@code obj.}{@link Object#hashCode hashCode()}.
- */
- hashCode(obj) {
- if (obj == null) {
- return 0;
- }
- return MurmurHash_1.MurmurHash.hashCode(obj, 0);
- }
- /**
- * {@inheritDoc}
- *
- * This implementation relies on object equality. If both objects are
- * {@code null}, this method returns {@code true}. Otherwise if only
- * {@code a} is {@code null}, this method returns {@code false}. Otherwise,
- * this method returns the result of
- * {@code a.}{@link Object#equals equals}{@code (b)}.
- */
- equals(a, b) {
- if (a == null) {
- return b == null;
- }
- else if (b == null) {
- return false;
- }
- if (a.length !== b.length) {
- return false;
- }
- for (let i = 0; i < a.length; i++) {
- if (!ObjectEqualityComparator_1.ObjectEqualityComparator.INSTANCE.equals(a[i], b[i])) {
- return false;
- }
- }
- return true;
- }
-}
-ArrayEqualityComparator.INSTANCE = new ArrayEqualityComparator();
-__decorate([
- Decorators_1.Override
-], ArrayEqualityComparator.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], ArrayEqualityComparator.prototype, "equals", null);
-exports.ArrayEqualityComparator = ArrayEqualityComparator;
-//# sourceMappingURL=ArrayEqualityComparator.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/ArrayEqualityComparator.js.map b/node_modules/antlr4ts/misc/ArrayEqualityComparator.js.map
deleted file mode 100644
index 43f7179..0000000
--- a/node_modules/antlr4ts/misc/ArrayEqualityComparator.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ArrayEqualityComparator.js","sourceRoot":"","sources":["../../../src/misc/ArrayEqualityComparator.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAIH,8CAAwC;AAExC,6CAA0C;AAC1C,yEAAsE;AAEtE;;;;;GAKG;AACH;IAGC;;;;;OAKG;IAEH,QAAQ,CAAC,GAAgB;QACxB,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,CAAC,CAAC;QACV,CAAC;QAED,MAAM,CAAC,uBAAU,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACpC,CAAC;IAED;;;;;;;;OAQG;IAEH,MAAM,CAAC,CAAc,EAAE,CAAc;QACpC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,CAAC,IAAI,IAAI,CAAC;QAClB,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YACtB,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,EAAE,CAAC,CAAC,CAAC,mDAAwB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3D,MAAM,CAAC,KAAK,CAAC;YACd,CAAC;QACF,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;;AA7Ce,gCAAQ,GAA4B,IAAI,uBAAuB,EAAE,CAAC;AASlF;IADC,qBAAQ;uDAOR;AAYD;IADC,qBAAQ;qDAmBR;AA9CF,0DAgDC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/Arrays.d.ts b/node_modules/antlr4ts/misc/Arrays.d.ts
deleted file mode 100644
index 79a4197..0000000
--- a/node_modules/antlr4ts/misc/Arrays.d.ts
+++ /dev/null
@@ -1,18 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-export declare namespace Arrays {
- /**
- * Searches the specified array of numbers for the specified value using the binary search algorithm. The array must
- * be sorted prior to making this call. If it is not sorted, the results are unspecified. If the array contains
- * multiple elements with the specified value, there is no guarantee which one will be found.
- *
- * @return index of the search key, if it is contained in the array; otherwise, (-(insertion point) - 1). The
- * insertion point is defined as the point at which the key would be inserted into the array: the index of the first
- * element greater than the key, or array.length if all elements in the array are less than the specified key. Note
- * that this guarantees that the return value will be >= 0 if and only if the key is found.
- */
- function binarySearch(array: ArrayLike, key: number, fromIndex?: number, toIndex?: number): number;
- function toString(array: ArrayLike): string;
-}
diff --git a/node_modules/antlr4ts/misc/Arrays.js b/node_modules/antlr4ts/misc/Arrays.js
deleted file mode 100644
index 5b635db..0000000
--- a/node_modules/antlr4ts/misc/Arrays.js
+++ /dev/null
@@ -1,69 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-var Arrays;
-(function (Arrays) {
- /**
- * Searches the specified array of numbers for the specified value using the binary search algorithm. The array must
- * be sorted prior to making this call. If it is not sorted, the results are unspecified. If the array contains
- * multiple elements with the specified value, there is no guarantee which one will be found.
- *
- * @return index of the search key, if it is contained in the array; otherwise, (-(insertion point) - 1). The
- * insertion point is defined as the point at which the key would be inserted into the array: the index of the first
- * element greater than the key, or array.length if all elements in the array are less than the specified key. Note
- * that this guarantees that the return value will be >= 0 if and only if the key is found.
- */
- function binarySearch(array, key, fromIndex, toIndex) {
- return binarySearch0(array, fromIndex !== undefined ? fromIndex : 0, toIndex !== undefined ? toIndex : array.length, key);
- }
- Arrays.binarySearch = binarySearch;
- function binarySearch0(array, fromIndex, toIndex, key) {
- let low = fromIndex;
- let high = toIndex - 1;
- while (low <= high) {
- let mid = (low + high) >>> 1;
- let midVal = array[mid];
- if (midVal < key) {
- low = mid + 1;
- }
- else if (midVal > key) {
- high = mid - 1;
- }
- else {
- // key found
- return mid;
- }
- }
- // key not found.
- return -(low + 1);
- }
- function toString(array) {
- let result = "[";
- let first = true;
- for (let i = 0; i < array.length; i++) {
- if (first) {
- first = false;
- }
- else {
- result += ", ";
- }
- let element = array[i];
- if (element === null) {
- result += "null";
- }
- else if (element === undefined) {
- result += "undefined";
- }
- else {
- result += element;
- }
- }
- result += "]";
- return result;
- }
- Arrays.toString = toString;
-})(Arrays = exports.Arrays || (exports.Arrays = {}));
-//# sourceMappingURL=Arrays.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/Arrays.js.map b/node_modules/antlr4ts/misc/Arrays.js.map
deleted file mode 100644
index b97dd28..0000000
--- a/node_modules/antlr4ts/misc/Arrays.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"Arrays.js","sourceRoot":"","sources":["../../../src/misc/Arrays.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,IAAiB,MAAM,CA6DtB;AA7DD,WAAiB,MAAM;IACtB;;;;;;;;;OASG;IACH,sBAA6B,KAAwB,EAAE,GAAW,EAAE,SAAkB,EAAE,OAAgB;QACvG,MAAM,CAAC,aAAa,CAAC,KAAK,EAAE,SAAS,KAAK,SAAS,GAAG,SAAS,GAAG,CAAC,EAAE,OAAO,KAAK,SAAS,GAAG,OAAO,GAAG,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAC3H,CAAC;IAFe,mBAAY,eAE3B,CAAA;IAED,uBAAuB,KAAwB,EAAE,SAAiB,EAAE,OAAe,EAAE,GAAW;QAC/F,IAAI,GAAG,GAAW,SAAS,CAAC;QAC5B,IAAI,IAAI,GAAW,OAAO,GAAG,CAAC,CAAC;QAE/B,OAAO,GAAG,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,GAAG,GAAW,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;YACrC,IAAI,MAAM,GAAW,KAAK,CAAC,GAAG,CAAC,CAAC;YAEhC,EAAE,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC;gBAClB,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;YACf,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC;gBACzB,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;YAChB,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,YAAY;gBACZ,MAAM,CAAC,GAAG,CAAC;YACZ,CAAC;QACF,CAAC;QAED,iBAAiB;QACjB,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IACnB,CAAC;IAED,kBAA4B,KAAmB;QAC9C,IAAI,MAAM,GAAG,GAAG,CAAC;QAEjB,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBACX,KAAK,GAAG,KAAK,CAAC;YACf,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,MAAM,IAAI,IAAI,CAAC;YAChB,CAAC;YAED,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACvB,EAAE,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC;gBACtB,MAAM,IAAI,MAAM,CAAC;YAClB,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC;gBAClC,MAAM,IAAI,WAAW,CAAC;YACvB,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,MAAM,IAAI,OAAO,CAAC;YACnB,CAAC;QACF,CAAC;QAED,MAAM,IAAI,GAAG,CAAC;QACd,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAvBe,eAAQ,WAuBvB,CAAA;AACF,CAAC,EA7DgB,MAAM,GAAN,cAAM,KAAN,cAAM,QA6DtB"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/BitSet.d.ts b/node_modules/antlr4ts/misc/BitSet.d.ts
deleted file mode 100644
index 7464922..0000000
--- a/node_modules/antlr4ts/misc/BitSet.d.ts
+++ /dev/null
@@ -1,266 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-export declare class BitSet implements Iterable {
- private data;
- /**
- * Creates a new bit set. All bits are initially `false`.
- */
- constructor();
- /**
- * Creates a bit set whose initial size is large enough to explicitly represent bits with indices in the range `0`
- * through `nbits-1`. All bits are initially `false`.
- */
- constructor(nbits: number);
- /**
- * Creates a bit set from a iterable list of numbers (including another BitSet);
- */
- constructor(numbers: Iterable);
- /**
- * Performs a logical **AND** of this target bit set with the argument bit set. This bit set is modified so that
- * each bit in it has the value `true` if and only if it both initially had the value `true` and the corresponding
- * bit in the bit set argument also had the value `true`.
- */
- and(set: BitSet): void;
- /**
- * Clears all of the bits in this `BitSet` whose corresponding bit is set in the specified `BitSet`.
- */
- andNot(set: BitSet): void;
- /**
- * Returns the number of bits set to `true` in this `BitSet`.
- */
- cardinality(): number;
- /**
- * Sets all of the bits in this `BitSet` to `false`.
- */
- clear(): void;
- /**
- * Sets the bit specified by the index to `false`.
- *
- * @param bitIndex the index of the bit to be cleared
- *
- * @throws RangeError if the specified index is negative
- */
- clear(bitIndex: number): void;
- /**
- * Sets the bits from the specified `fromIndex` (inclusive) to the specified `toIndex` (exclusive) to `false`.
- *
- * @param fromIndex index of the first bit to be cleared
- * @param toIndex index after the last bit to be cleared
- *
- * @throws RangeError if `fromIndex` is negative, or `toIndex` is negative, or `fromIndex` is larger than `toIndex`
- */
- clear(fromIndex: number, toIndex: number): void;
- /**
- * Sets the bit at the specified index to the complement of its current value.
- *
- * @param bitIndex the index of the bit to flip
- *
- * @throws RangeError if the specified index is negative
- */
- flip(bitIndex: number): void;
- /**
- * Sets each bit from the specified `fromIndex` (inclusive) to the specified `toIndex` (exclusive) to the complement
- * of its current value.
- *
- * @param fromIndex index of the first bit to flip
- * @param toIndex index after the last bit to flip
- *
- * @throws RangeError if `fromIndex` is negative, or `toIndex` is negative, or `fromIndex` is larger than `toIndex`
- */
- flip(fromIndex: number, toIndex: number): void;
- /**
- * Returns the value of the bit with the specified index. The value is `true` if the bit with the index `bitIndex`
- * is currently set in this `BitSet`; otherwise, the result is `false`.
- *
- * @param bitIndex the bit index
- *
- * @throws RangeError if the specified index is negative
- */
- get(bitIndex: number): boolean;
- /**
- * Returns a new `BitSet` composed of bits from this `BitSet` from `fromIndex` (inclusive) to `toIndex` (exclusive).
- *
- * @param fromIndex index of the first bit to include
- * @param toIndex index after the last bit to include
- *
- * @throws RangeError if `fromIndex` is negative, or `toIndex` is negative, or `fromIndex` is larger than `toIndex`
- */
- get(fromIndex: number, toIndex: number): BitSet;
- /**
- * Returns true if the specified `BitSet` has any bits set to `true` that are also set to `true` in this `BitSet`.
- *
- * @param set `BitSet` to intersect with
- */
- intersects(set: BitSet): boolean;
- /**
- * Returns true if this `BitSet` contains no bits that are set to `true`.
- */
- readonly isEmpty: boolean;
- /**
- * Returns the "logical size" of this `BitSet`: the index of the highest set bit in the `BitSet` plus one. Returns
- * zero if the `BitSet` contains no set bits.
- */
- length(): number;
- /**
- * Returns the index of the first bit that is set to `false` that occurs on or after the specified starting index,
- * If no such bit exists then `-1` is returned.
- *
- * @param fromIndex the index to start checking from (inclusive)
- *
- * @throws RangeError if the specified index is negative
- */
- nextClearBit(fromIndex: number): number;
- /**
- * Returns the index of the first bit that is set to `true` that occurs on or after the specified starting index.
- * If no such bit exists then `-1` is returned.
- *
- * To iterate over the `true` bits in a `BitSet`, use the following loop:
- *
- * ```
- * for (let i = bs.nextSetBit(0); i >= 0; i = bs.nextSetBit(i + 1)) {
- * // operate on index i here
- * }
- * ```
- *
- * @param fromIndex the index to start checking from (inclusive)
- *
- * @throws RangeError if the specified index is negative
- */
- nextSetBit(fromIndex: number): number;
- /**
- * Performs a logical **OR** of this bit set with the bit set argument. This bit set is modified so that a bit in it
- * has the value `true` if and only if it either already had the value `true` or the corresponding bit in the bit
- * set argument has the value `true`.
- */
- or(set: BitSet): void;
- /**
- * Returns the index of the nearest bit that is set to `false` that occurs on or before the specified starting
- * index. If no such bit exists, or if `-1` is given as the starting index, then `-1` is returned.
- *
- * @param fromIndex the index to start checking from (inclusive)
- *
- * @throws RangeError if the specified index is less than `-1`
- */
- previousClearBit(fromIndex: number): number;
- /**
- * Returns the index of the nearest bit that is set to `true` that occurs on or before the specified starting index.
- * If no such bit exists, or if `-1` is given as the starting index, then `-1` is returned.
- *
- * To iterate over the `true` bits in a `BitSet`, use the following loop:
- *
- * ```
- * for (let i = bs.length(); (i = bs.previousSetBit(i-1)) >= 0; ) {
- * // operate on index i here
- * }
- * ```
- *
- * @param fromIndex the index to start checking from (inclusive)
- *
- * @throws RangeError if the specified index is less than `-1`
- */
- previousSetBit(fromIndex: number): number;
- /**
- * Sets the bit at the specified index to `true`.
- *
- * @param bitIndex a bit index
- *
- * @throws RangeError if the specified index is negative
- */
- set(bitIndex: number): void;
- /**
- * Sets the bit at the specified index to the specified value.
- *
- * @param bitIndex a bit index
- * @param value a boolean value to set
- *
- * @throws RangeError if the specified index is negative
- */
- set(bitIndex: number, value: boolean): void;
- /**
- * Sets the bits from the specified `fromIndex` (inclusive) to the specified `toIndex` (exclusive) to `true`.
- *
- * @param fromIndex index of the first bit to be set
- * @param toIndex index after the last bit to be set
- *
- * @throws RangeError if `fromIndex` is negative, or `toIndex` is negative, or `fromIndex` is larger than `toIndex`
- */
- set(fromIndex: number, toIndex: number): void;
- /**
- * Sets the bits from the specified `fromIndex` (inclusive) to the specified `toIndex` (exclusive) to the specified
- * value.
- *
- * @param fromIndex index of the first bit to be set
- * @param toIndex index after the last bit to be set
- * @param value value to set the selected bits to
- *
- * @throws RangeError if `fromIndex` is negative, or `toIndex` is negative, or `fromIndex` is larger than `toIndex`
- */
- set(fromIndex: number, toIndex: number, value: boolean): void;
- private _setBits(word, value, mask);
- /**
- * Returns the number of bits of space actually in use by this `BitSet` to represent bit values. The maximum element
- * in the set is the size - 1st element.
- */
- readonly size: number;
- /**
- * Returns a new byte array containing all the bits in this bit set.
- *
- * More precisely, if
- * `let bytes = s.toByteArray();`
- * then `bytes.length === (s.length()+7)/8` and `s.get(n) === ((bytes[n/8] & (1<<(n%8))) != 0)` for all
- * `n < 8 * bytes.length`.
- */
- /**
- * Returns a new integer array containing all the bits in this bit set.
- *
- * More precisely, if
- * `let integers = s.toIntegerArray();`
- * then `integers.length === (s.length()+31)/32` and `s.get(n) === ((integers[n/32] & (1<<(n%32))) != 0)` for all
- * `n < 32 * integers.length`.
- */
- hashCode(): number;
- /**
- * Compares this object against the specified object. The result is `true` if and only if the argument is not `null`
- * and is a `Bitset` object that has exactly the same set of bits set to `true` as this bit set. That is, for every
- * nonnegative index `k`,
- *
- * ((BitSet)obj).get(k) == this.get(k)
- *
- * must be true. The current sizes of the two bit sets are not compared.
- */
- equals(obj: any): boolean;
- /**
- * Returns a string representation of this bit set. For every index for which this `BitSet` contains a bit in the
- * set state, the decimal representation of that index is included in the result. Such indices are listed in order
- * from lowest to highest, separated by ", " (a comma and a space) and surrounded by braces, resulting in the usual
- * mathematical notation for a set of integers.
- *
- * Example:
- *
- * BitSet drPepper = new BitSet();
- *
- * Now `drPepper.toString()` returns `"{}"`.
- *
- * drPepper.set(2);
- *
- * Now `drPepper.toString()` returns `"{2}"`.
- *
- * drPepper.set(4);
- * drPepper.set(10);
- *
- * Now `drPepper.toString()` returns `"{2, 4, 10}"`.
- */
- toString(): string;
- /**
- * Performs a logical **XOR** of this bit set with the bit set argument. This bit set is modified so that a bit in
- * it has the value `true` if and only if one of the following statements holds:
- *
- * * The bit initially has the value `true`, and the corresponding bit in the argument has the value `false`.
- * * The bit initially has the value `false`, and the corresponding bit in the argument has the value `true`.
- */
- xor(set: BitSet): void;
- clone(): BitSet;
- [Symbol.iterator](): IterableIterator;
-}
diff --git a/node_modules/antlr4ts/misc/BitSet.js b/node_modules/antlr4ts/misc/BitSet.js
deleted file mode 100644
index 48c50df..0000000
--- a/node_modules/antlr4ts/misc/BitSet.js
+++ /dev/null
@@ -1,639 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-const util = require("util");
-const MurmurHash_1 = require("./MurmurHash");
-/**
- * Private empty array used to construct empty BitSets
- */
-const EMPTY_DATA = new Uint16Array(0);
-/**
- * Gets the word index of the `UInt16` element in `BitSet.data` containing the bit with the specified index.
- */
-function getIndex(bitNumber) {
- return bitNumber >>> 4;
-}
-/**
- * Convert a word index into the bit index of the LSB of that word
- */
-function unIndex(n) {
- return n * 16;
-}
-/**
- * Get's the bit number of the least signficant bit set LSB which is set in a word non-zero word;
- * Bit numbers run from LSB to MSB starting with 0.
- */
-function findLSBSet(word) {
- let bit = 1;
- for (let i = 0; i < 16; i++) {
- if ((word & bit) !== 0)
- return i;
- bit = (bit << 1) >>> 0;
- }
- throw new RangeError("No specified bit found");
-}
-function findMSBSet(word) {
- let bit = (1 << 15) >>> 0;
- for (let i = 15; i >= 0; i--) {
- if ((word & bit) !== 0)
- return i;
- bit = bit >>> 1;
- }
- throw new RangeError("No specified bit found");
-}
-/**
- * Gets a 16-bit mask with bit numbers fromBit to toBit (inclusive) set.
- * Bit numbers run from LSB to MSB starting with 0.
- */
-function bitsFor(fromBit, toBit) {
- fromBit &= 0xF;
- toBit &= 0xF;
- if (fromBit === toBit)
- return (1 << fromBit) >>> 0;
- return ((0xFFFF >>> (15 - toBit)) ^ (0xFFFF >>> (16 - fromBit)));
-}
-/**
- * A lookup table for number of set bits in a 16-bit integer. This is used to quickly count the cardinality (number of unique elements) of a BitSet.
- */
-const POP_CNT = new Uint8Array(65536);
-for (let i = 0; i < 16; i++) {
- const stride = (1 << i) >>> 0;
- let index = 0;
- while (index < POP_CNT.length) {
- // skip the numbers where the bit isn't set
- index += stride;
- // increment the ones where the bit is set
- for (let j = 0; j < stride; j++) {
- POP_CNT[index]++;
- index++;
- }
- }
-}
-class BitSet {
- /*
- ** constructor implementation
- */
- constructor(arg) {
- if (!arg) {
- // covering the case of unspecified and nbits===0
- this.data = EMPTY_DATA;
- }
- else if (typeof arg === "number") {
- if (arg < 0) {
- throw new RangeError("nbits cannot be negative");
- }
- else {
- this.data = new Uint16Array(getIndex(arg - 1) + 1);
- }
- }
- else {
- if (arg instanceof BitSet) {
- this.data = arg.data.slice(0); // Clone the data
- }
- else {
- let max = -1;
- for (let v of arg) {
- if (max < v)
- max = v;
- }
- this.data = new Uint16Array(getIndex(max - 1) + 1);
- for (let v of arg) {
- this.set(v);
- }
- }
- }
- }
- /**
- * Performs a logical **AND** of this target bit set with the argument bit set. This bit set is modified so that
- * each bit in it has the value `true` if and only if it both initially had the value `true` and the corresponding
- * bit in the bit set argument also had the value `true`.
- */
- and(set) {
- const data = this.data;
- const other = set.data;
- const words = Math.min(data.length, other.length);
- let lastWord = -1; // Keep track of index of last non-zero word
- for (let i = 0; i < words; i++) {
- if ((data[i] &= other[i]) !== 0) {
- lastWord = i;
- ;
- }
- }
- if (lastWord === -1) {
- this.data = EMPTY_DATA;
- }
- if (lastWord < data.length - 1) {
- this.data = data.slice(0, lastWord + 1);
- }
- }
- /**
- * Clears all of the bits in this `BitSet` whose corresponding bit is set in the specified `BitSet`.
- */
- andNot(set) {
- const data = this.data;
- const other = set.data;
- const words = Math.min(data.length, other.length);
- let lastWord = -1; // Keep track of index of last non-zero word
- for (let i = 0; i < words; i++) {
- if ((data[i] &= (other[i] ^ 0xFFFF)) !== 0) {
- lastWord = i;
- ;
- }
- }
- if (lastWord === -1) {
- this.data = EMPTY_DATA;
- }
- if (lastWord < data.length - 1) {
- this.data = data.slice(0, lastWord + 1);
- }
- }
- /**
- * Returns the number of bits set to `true` in this `BitSet`.
- */
- cardinality() {
- if (this.isEmpty) {
- return 0;
- }
- const data = this.data;
- const length = data.length;
- let result = 0;
- for (let i = 0; i < length; i++) {
- result += POP_CNT[data[i]];
- }
- return result;
- }
- clear(fromIndex, toIndex) {
- if (fromIndex == null) {
- this.data.fill(0);
- }
- else if (toIndex == null) {
- this.set(fromIndex, false);
- }
- else {
- this.set(fromIndex, toIndex, false);
- }
- }
- flip(fromIndex, toIndex) {
- if (toIndex == null) {
- toIndex = fromIndex;
- }
- if (fromIndex < 0 || toIndex < fromIndex)
- throw new RangeError();
- let word = getIndex(fromIndex);
- const lastWord = getIndex(toIndex);
- if (word === lastWord) {
- this.data[word] ^= bitsFor(fromIndex, toIndex);
- }
- else {
- this.data[word++] ^= bitsFor(fromIndex, 15);
- while (word < lastWord) {
- this.data[word++] ^= 0xFFFF;
- }
- this.data[word++] ^= bitsFor(0, toIndex);
- }
- }
- get(fromIndex, toIndex) {
- if (toIndex === undefined) {
- return !!(this.data[getIndex(fromIndex)] & bitsFor(fromIndex, fromIndex));
- }
- else {
- // return a BitSet
- let result = new BitSet(toIndex + 1);
- for (let i = fromIndex; i <= toIndex; i++) {
- result.set(i, this.get(i));
- }
- return result;
- }
- }
- /**
- * Returns true if the specified `BitSet` has any bits set to `true` that are also set to `true` in this `BitSet`.
- *
- * @param set `BitSet` to intersect with
- */
- intersects(set) {
- let smallerLength = Math.min(this.length(), set.length());
- if (smallerLength === 0) {
- return false;
- }
- let bound = getIndex(smallerLength - 1);
- for (let i = 0; i <= bound; i++) {
- if ((this.data[i] & set.data[i]) !== 0) {
- return true;
- }
- }
- return false;
- }
- /**
- * Returns true if this `BitSet` contains no bits that are set to `true`.
- */
- get isEmpty() {
- return this.length() === 0;
- }
- /**
- * Returns the "logical size" of this `BitSet`: the index of the highest set bit in the `BitSet` plus one. Returns
- * zero if the `BitSet` contains no set bits.
- */
- length() {
- if (!this.data.length)
- return 0;
- return this.previousSetBit(unIndex(this.data.length) - 1) + 1;
- }
- /**
- * Returns the index of the first bit that is set to `false` that occurs on or after the specified starting index,
- * If no such bit exists then `-1` is returned.
- *
- * @param fromIndex the index to start checking from (inclusive)
- *
- * @throws RangeError if the specified index is negative
- */
- nextClearBit(fromIndex) {
- if (fromIndex < 0) {
- throw new RangeError("fromIndex cannot be negative");
- }
- const data = this.data;
- const length = data.length;
- let word = getIndex(fromIndex);
- if (word > length)
- return -1;
- let ignore = 0xFFFF ^ bitsFor(fromIndex, 15);
- if ((data[word] | ignore) === 0xFFFF) {
- word++;
- ignore = 0;
- for (; word < length; word++) {
- if (data[word] !== 0xFFFF)
- break;
- }
- if (word === length)
- return -1; // Hit the end
- }
- return unIndex(word) + findLSBSet((data[word] | ignore) ^ 0xFFFF);
- }
- /**
- * Returns the index of the first bit that is set to `true` that occurs on or after the specified starting index.
- * If no such bit exists then `-1` is returned.
- *
- * To iterate over the `true` bits in a `BitSet`, use the following loop:
- *
- * ```
- * for (let i = bs.nextSetBit(0); i >= 0; i = bs.nextSetBit(i + 1)) {
- * // operate on index i here
- * }
- * ```
- *
- * @param fromIndex the index to start checking from (inclusive)
- *
- * @throws RangeError if the specified index is negative
- */
- nextSetBit(fromIndex) {
- if (fromIndex < 0) {
- throw new RangeError("fromIndex cannot be negative");
- }
- const data = this.data;
- const length = data.length;
- let word = getIndex(fromIndex);
- if (word > length)
- return -1;
- let mask = bitsFor(fromIndex, 15);
- if ((data[word] & mask) === 0) {
- word++;
- mask = 0xFFFF;
- for (; word < length; word++) {
- if (data[word] !== 0)
- break;
- }
- if (word >= length)
- return -1;
- }
- return unIndex(word) + findLSBSet(data[word] & mask);
- }
- /**
- * Performs a logical **OR** of this bit set with the bit set argument. This bit set is modified so that a bit in it
- * has the value `true` if and only if it either already had the value `true` or the corresponding bit in the bit
- * set argument has the value `true`.
- */
- or(set) {
- const data = this.data;
- const other = set.data;
- const minWords = Math.min(data.length, other.length);
- const words = Math.max(data.length, other.length);
- const dest = data.length === words ? data : new Uint16Array(words);
- let lastWord = -1;
- // Or those words both sets have in common
- for (let i = 0; i < minWords; i++) {
- if ((dest[i] = data[i] | other[i]) !== 0)
- lastWord = i;
- }
- // Copy words from larger set (if there is one)
- const longer = data.length > other.length ? data : other;
- for (let i = minWords; i < words; i++) {
- if ((dest[i] = longer[i]) !== 0)
- lastWord = i;
- }
- if (lastWord === -1) {
- this.data = EMPTY_DATA;
- }
- else if (dest.length === lastWord + 1) {
- this.data = dest;
- }
- else {
- this.data = dest.slice(0, lastWord);
- }
- }
- /**
- * Returns the index of the nearest bit that is set to `false` that occurs on or before the specified starting
- * index. If no such bit exists, or if `-1` is given as the starting index, then `-1` is returned.
- *
- * @param fromIndex the index to start checking from (inclusive)
- *
- * @throws RangeError if the specified index is less than `-1`
- */
- previousClearBit(fromIndex) {
- if (fromIndex < 0) {
- throw new RangeError("fromIndex cannot be negative");
- }
- const data = this.data;
- const length = data.length;
- let word = getIndex(fromIndex);
- if (word >= length)
- word = length - 1;
- let ignore = 0xFFFF ^ bitsFor(0, fromIndex);
- if ((data[word] | ignore) === 0xFFFF) {
- ignore = 0;
- word--;
- for (; word >= 0; word--) {
- if (data[word] !== 0xFFFF)
- break;
- }
- if (word < 0)
- return -1; // Hit the end
- }
- return unIndex(word) + findMSBSet((data[word] | ignore) ^ 0xFFFF);
- }
- /**
- * Returns the index of the nearest bit that is set to `true` that occurs on or before the specified starting index.
- * If no such bit exists, or if `-1` is given as the starting index, then `-1` is returned.
- *
- * To iterate over the `true` bits in a `BitSet`, use the following loop:
- *
- * ```
- * for (let i = bs.length(); (i = bs.previousSetBit(i-1)) >= 0; ) {
- * // operate on index i here
- * }
- * ```
- *
- * @param fromIndex the index to start checking from (inclusive)
- *
- * @throws RangeError if the specified index is less than `-1`
- */
- previousSetBit(fromIndex) {
- if (fromIndex < 0) {
- throw new RangeError("fromIndex cannot be negative");
- }
- const data = this.data;
- const length = data.length;
- let word = getIndex(fromIndex);
- if (word >= length)
- word = length - 1;
- let mask = bitsFor(0, fromIndex);
- if ((data[word] & mask) === 0) {
- word--;
- mask = 0xFFFF;
- for (; word >= 0; word--) {
- if (data[word] !== 0)
- break;
- }
- if (word < 0)
- return -1;
- }
- return unIndex(word) + findMSBSet(data[word] & mask);
- }
- set(fromIndex, toIndex, value) {
- if (toIndex === undefined) {
- toIndex = fromIndex;
- value = true;
- }
- else if (typeof toIndex === 'boolean') {
- value = toIndex;
- toIndex = fromIndex;
- }
- if (value === undefined) {
- value = true;
- }
- if (fromIndex < 0 || fromIndex > toIndex) {
- throw new RangeError();
- }
- let word = getIndex(fromIndex);
- let lastWord = getIndex(toIndex);
- if (value && lastWord >= this.data.length) {
- // Grow array "just enough" for bits we need to set
- var temp = new Uint16Array(lastWord + 1);
- this.data.forEach((value, index) => temp[index] = value);
- this.data = temp;
- }
- else if (!value) {
- // But there is no need to grow array to clear bits.
- if (word >= this.data.length)
- return; // Early exit
- if (lastWord >= this.data.length) {
- // Adjust work to fit array
- lastWord = this.data.length - 1;
- toIndex = this.data.length * 16 - 1;
- }
- }
- if (word === lastWord) {
- this._setBits(word, value, bitsFor(fromIndex, toIndex));
- }
- else {
- this._setBits(word++, value, bitsFor(fromIndex, 15));
- while (word < lastWord) {
- this.data[word++] = value ? 0xFFFF : 0;
- }
- this._setBits(word, value, bitsFor(0, toIndex));
- }
- }
- _setBits(word, value, mask) {
- if (value) {
- this.data[word] |= mask;
- }
- else {
- this.data[word] &= 0xFFFF ^ mask;
- }
- }
- /**
- * Returns the number of bits of space actually in use by this `BitSet` to represent bit values. The maximum element
- * in the set is the size - 1st element.
- */
- get size() {
- return this.data.byteLength * 8;
- }
- /**
- * Returns a new byte array containing all the bits in this bit set.
- *
- * More precisely, if
- * `let bytes = s.toByteArray();`
- * then `bytes.length === (s.length()+7)/8` and `s.get(n) === ((bytes[n/8] & (1<<(n%8))) != 0)` for all
- * `n < 8 * bytes.length`.
- */
- // toByteArray(): Int8Array {
- // throw new Error("NOT IMPLEMENTED");
- // }
- /**
- * Returns a new integer array containing all the bits in this bit set.
- *
- * More precisely, if
- * `let integers = s.toIntegerArray();`
- * then `integers.length === (s.length()+31)/32` and `s.get(n) === ((integers[n/32] & (1<<(n%32))) != 0)` for all
- * `n < 32 * integers.length`.
- */
- // toIntegerArray(): Int32Array {
- // throw new Error("NOT IMPLEMENTED");
- // }
- hashCode() {
- return MurmurHash_1.MurmurHash.hashCode(this.data, 22);
- }
- /**
- * Compares this object against the specified object. The result is `true` if and only if the argument is not `null`
- * and is a `Bitset` object that has exactly the same set of bits set to `true` as this bit set. That is, for every
- * nonnegative index `k`,
- *
- * ((BitSet)obj).get(k) == this.get(k)
- *
- * must be true. The current sizes of the two bit sets are not compared.
- */
- equals(obj) {
- if (obj === this) {
- return true;
- }
- else if (!(obj instanceof BitSet)) {
- return false;
- }
- const len = this.length();
- if (len !== obj.length()) {
- return false;
- }
- if (len === 0) {
- return true;
- }
- let bound = getIndex(len - 1);
- for (let i = 0; i <= bound; i++) {
- if (this.data[i] !== obj.data[i]) {
- return false;
- }
- }
- return true;
- }
- /**
- * Returns a string representation of this bit set. For every index for which this `BitSet` contains a bit in the
- * set state, the decimal representation of that index is included in the result. Such indices are listed in order
- * from lowest to highest, separated by ", " (a comma and a space) and surrounded by braces, resulting in the usual
- * mathematical notation for a set of integers.
- *
- * Example:
- *
- * BitSet drPepper = new BitSet();
- *
- * Now `drPepper.toString()` returns `"{}"`.
- *
- * drPepper.set(2);
- *
- * Now `drPepper.toString()` returns `"{2}"`.
- *
- * drPepper.set(4);
- * drPepper.set(10);
- *
- * Now `drPepper.toString()` returns `"{2, 4, 10}"`.
- */
- toString() {
- let result = "{";
- let first = true;
- for (let i = this.nextSetBit(0); i >= 0; i = this.nextSetBit(i + 1)) {
- if (first) {
- first = false;
- }
- else {
- result += ", ";
- }
- result += i;
- }
- result += "}";
- return result;
- }
- // static valueOf(bytes: Int8Array): BitSet;
- // static valueOf(buffer: ArrayBuffer): BitSet;
- // static valueOf(integers: Int32Array): BitSet;
- // static valueOf(data: Int8Array | Int32Array | ArrayBuffer): BitSet {
- // throw new Error("NOT IMPLEMENTED");
- // }
- /**
- * Performs a logical **XOR** of this bit set with the bit set argument. This bit set is modified so that a bit in
- * it has the value `true` if and only if one of the following statements holds:
- *
- * * The bit initially has the value `true`, and the corresponding bit in the argument has the value `false`.
- * * The bit initially has the value `false`, and the corresponding bit in the argument has the value `true`.
- */
- xor(set) {
- const data = this.data;
- const other = set.data;
- const minWords = Math.min(data.length, other.length);
- const words = Math.max(data.length, other.length);
- const dest = data.length === words ? data : new Uint16Array(words);
- let lastWord = -1;
- // Xor those words both sets have in common
- for (let i = 0; i < minWords; i++) {
- if ((dest[i] = data[i] ^ other[i]) !== 0)
- lastWord = i;
- }
- // Copy words from larger set (if there is one)
- const longer = data.length > other.length ? data : other;
- for (let i = minWords; i < words; i++) {
- if ((dest[i] = longer[i]) !== 0)
- lastWord = i;
- }
- if (lastWord === -1) {
- this.data = EMPTY_DATA;
- }
- else if (dest.length === lastWord + 1) {
- this.data = dest;
- }
- else {
- this.data = dest.slice(0, lastWord + 1);
- }
- }
- clone() {
- return new BitSet(this);
- }
- [Symbol.iterator]() {
- return new BitSetIterator(this.data);
- }
- // Overrides formatting for nodejs assert etc.
- [util.inspect.custom]() {
- return "BitSet " + this.toString();
- }
-}
-exports.BitSet = BitSet;
-class BitSetIterator {
- constructor(data) {
- this.data = data;
- this.index = 0;
- this.mask = 0xFFFF;
- }
- next() {
- while (this.index < this.data.length) {
- const bits = this.data[this.index] & this.mask;
- ;
- if (bits !== 0) {
- const bitNumber = unIndex(this.index) + findLSBSet(bits);
- this.mask = bitsFor(bitNumber + 1, 15);
- return { done: false, value: bitNumber };
- }
- this.index++;
- this.mask = 0xFFFF;
- }
- return { done: true, value: -1 };
- }
- [Symbol.iterator]() { return this; }
-}
-//# sourceMappingURL=BitSet.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/BitSet.js.map b/node_modules/antlr4ts/misc/BitSet.js.map
deleted file mode 100644
index ee514bd..0000000
--- a/node_modules/antlr4ts/misc/BitSet.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"BitSet.js","sourceRoot":"","sources":["../../../src/misc/BitSet.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAGH,6BAA6B;AAC7B,6CAA0C;AAE1C;;GAEG;AACH,MAAM,UAAU,GAAgB,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;AAEnD;;GAEG;AACH,kBAAkB,SAAiB;IAClC,MAAM,CAAC,SAAS,KAAK,CAAC,CAAC;AACxB,CAAC;AAED;;GAEG;AAEH,iBAAiB,CAAS;IACzB,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,oBAAoB,IAAY;IAC/B,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC;QACjC,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IACD,MAAM,IAAI,UAAU,CAAC,wBAAwB,CAAC,CAAC;AAChD,CAAC;AAED,oBAAoB,IAAY;IAC/B,IAAI,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC;IAC1B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC;QACjC,GAAG,GAAG,GAAG,KAAK,CAAC,CAAC;IACjB,CAAC;IACD,MAAM,IAAI,UAAU,CAAC,wBAAwB,CAAC,CAAC;AAChD,CAAC;AAED;;;GAGG;AACH,iBAAiB,OAAe,EAAE,KAAa;IAC9C,OAAO,IAAI,GAAG,CAAC;IACf,KAAK,IAAI,GAAG,CAAA;IACZ,EAAE,CAAC,CAAC,OAAO,KAAK,KAAK,CAAC;QAAC,MAAM,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC;IACnD,MAAM,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AAClE,CAAC;AAED;;GAEG;AACH,MAAM,OAAO,GAAe,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;AAClD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;IAC7B,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;IAC9B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,OAAO,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,2CAA2C;QAC3C,KAAK,IAAI,MAAM,CAAC;QAEhB,0CAA0C;QAC1C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACjB,KAAK,EAAE,CAAC;QACT,CAAC;IACF,CAAC;AACF,CAAC;AAED;IAmBC;;MAEE;IACF,YAAY,GAA+B;QAC1C,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACV,iDAAiD;YACjD,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC;QACxB,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC;YACpC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACb,MAAM,IAAI,UAAU,CAAC,0BAA0B,CAAC,CAAC;YAClD,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,IAAI,CAAC,IAAI,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpD,CAAC;QACF,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,EAAE,CAAC,CAAC,GAAG,YAAY,MAAM,CAAC,CAAC,CAAC;gBAC3B,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,iBAAiB;YACjD,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;gBACb,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;oBACnB,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;wBAAC,GAAG,GAAG,CAAC,CAAC;gBACtB,CAAC;gBACD,IAAI,CAAC,IAAI,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACnD,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;oBACnB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACb,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,GAAW;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAElD,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,4CAA4C;QAE/D,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACjC,QAAQ,GAAG,CAAC,CAAC;gBAAA,CAAC;YACf,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC;QACxB,CAAC;QAED,EAAE,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;QACzC,CAAC;IACF,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,GAAW;QACjB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAElD,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,4CAA4C;QAE/D,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC5C,QAAQ,GAAG,CAAC,CAAC;gBAAA,CAAC;YACf,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC;QACxB,CAAC;QAED,EAAE,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;QACzC,CAAC;IACF,CAAC;IAGD;;OAEG;IACH,WAAW;QACV,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,CAAC,CAAC;QACV,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAyBD,KAAK,CAAC,SAAkB,EAAE,OAAgB;QACzC,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAC5B,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QACrC,CAAC;IACF,CAAC;IAqBD,IAAI,CAAC,SAAiB,EAAE,OAAgB;QACvC,EAAE,CAAC,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC;YACrB,OAAO,GAAG,SAAS,CAAC;QACrB,CAAC;QACD,EAAE,CAAC,CAAC,SAAS,GAAG,CAAC,IAAI,OAAO,GAAG,SAAS,CAAC;YAAC,MAAM,IAAI,UAAU,EAAE,CAAC;QAEjE,IAAI,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC/B,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;QAEnC,EAAE,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAChD,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YAC5C,OAAO,IAAI,GAAG,QAAQ,EAAE,CAAC;gBACxB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,MAAM,CAAC;YAC7B,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;QACzC,CAAC;IACF,CAAC;IAqBD,GAAG,CAAC,SAAiB,EAAE,OAAgB;QACtC,EAAE,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,GAAG,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;QAC3E,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,kBAAkB;YAClB,IAAI,MAAM,GAAG,IAAI,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;YACrC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC;YACD,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;IACF,CAAC;IAED;;;;OAIG;IACH,UAAU,CAAC,GAAW;QACrB,IAAI,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;QAC1D,EAAE,CAAC,CAAC,aAAa,KAAK,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,IAAI,KAAK,GAAG,QAAQ,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;QACxC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,IAAI,CAAC;YACb,CAAC;QACF,CAAC;QAED,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED;;OAEG;IACH,IAAI,OAAO;QACV,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACH,MAAM;QACL,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/D,CAAC;IAED;;;;;;;OAOG;IACH,YAAY,CAAC,SAAiB;QAC7B,EAAE,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,IAAI,UAAU,CAAC,8BAA8B,CAAC,CAAC;QACtD,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC/B,EAAE,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAE7B,IAAI,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QAE7C,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC;YACtC,IAAI,EAAE,CAAC;YACP,MAAM,GAAG,CAAC,CAAC;YACX,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;gBAC9B,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC;oBAAC,KAAK,CAAC;YAClC,CAAC;YACD,EAAE,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC;gBAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc;QAC/C,CAAC;QACD,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;IACnE,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,UAAU,CAAC,SAAiB;QAC3B,EAAE,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,IAAI,UAAU,CAAC,8BAA8B,CAAC,CAAC;QACtD,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC/B,EAAE,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,IAAI,GAAG,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QAElC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,EAAE,CAAC;YACP,IAAI,GAAG,MAAM,CAAC;YACd,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;gBAC9B,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAAC,KAAK,CAAC;YAC7B,CAAC;YACD,EAAE,CAAC,CAAC,IAAI,IAAI,MAAM,CAAC;gBAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC;QACD,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;IACtD,CAAC;IAED;;;;OAIG;IACH,EAAE,CAAC,GAAW;QACb,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC;QACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,KAAK,KAAK,GAAG,IAAI,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;QAEnE,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;QAElB,0CAA0C;QAE1C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAAC,QAAQ,GAAG,CAAC,CAAC;QACxD,CAAC;QAED,+CAA+C;QAE/C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,IAAI,GAAG,KAAK,CAAC;QACzD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAAC,QAAQ,GAAG,CAAC,CAAC;QAC/C,CAAC;QAED,EAAE,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC;QACxB,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;YACzC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QAClB,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrC,CAAC;IACF,CAAC;IAED;;;;;;;OAOG;IACH,gBAAgB,CAAC,SAAiB;QACjC,EAAE,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,IAAI,UAAU,CAAC,8BAA8B,CAAC,CAAC;QACtD,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC/B,EAAE,CAAC,CAAC,IAAI,IAAI,MAAM,CAAC;YAAC,IAAI,GAAG,MAAM,GAAG,CAAC,CAAC;QAEtC,IAAI,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QAE5C,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC;YACtC,MAAM,GAAG,CAAC,CAAC;YACX,IAAI,EAAE,CAAC;YACP,GAAG,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;gBAC1B,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC;oBAAC,KAAK,CAAC;YAClC,CAAC;YACD,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;gBAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc;QACxC,CAAC;QACD,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;IACnE,CAAC;IAGD;;;;;;;;;;;;;;;OAeG;IACH,cAAc,CAAC,SAAiB;QAC/B,EAAE,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,IAAI,UAAU,CAAC,8BAA8B,CAAC,CAAC;QACtD,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC/B,EAAE,CAAC,CAAC,IAAI,IAAI,MAAM,CAAC;YAAC,IAAI,GAAG,MAAM,GAAG,CAAC,CAAC;QAEtC,IAAI,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QAEjC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,EAAE,CAAC;YACP,IAAI,GAAG,MAAM,CAAC;YACd,GAAG,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;gBAC1B,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAAC,KAAK,CAAC;YAC7B,CAAC;YACD,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;gBAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,CAAC;QACD,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;IACtD,CAAC;IA0CD,GAAG,CAAC,SAAiB,EAAE,OAA0B,EAAE,KAAe;QACjE,EAAE,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC;YAC3B,OAAO,GAAG,SAAS,CAAC;YACpB,KAAK,GAAG,IAAI,CAAC;QACd,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC;YACzC,KAAK,GAAG,OAAO,CAAC;YAChB,OAAO,GAAG,SAAS,CAAC;QACrB,CAAC;QAED,EAAE,CAAC,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC;YACzB,KAAK,GAAG,IAAI,CAAC;QACd,CAAC;QAED,EAAE,CAAC,CAAC,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC;YAC1C,MAAM,IAAI,UAAU,EAAE,CAAC;QACxB,CAAC;QAED,IAAI,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC/B,IAAI,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;QAEjC,EAAE,CAAC,CAAC,KAAK,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;YAC3C,mDAAmD;YACnD,IAAI,IAAI,GAAG,IAAI,WAAW,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;YACzC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;YACzD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QAClB,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YACnB,oDAAoD;YACpD,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;gBAC5B,MAAM,CAAC,CAAC,aAAa;YACtB,EAAE,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;gBAClC,2BAA2B;gBAC3B,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;gBAChC,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,CAAC,CAAC;YACrC,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC;YACvB,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC;QACzD,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;YACrD,OAAO,IAAI,GAAG,QAAQ,EAAE,CAAC;gBACxB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC;YACxC,CAAC;YACD,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;QACjD,CAAC;IACF,CAAC;IAEO,QAAQ,CAAC,IAAY,EAAE,KAAc,EAAE,IAAY;QAC1D,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;QACzB,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,GAAG,IAAI,CAAC;QAClC,CAAC;IACF,CAAC;IAED;;;OAGG;IACH,IAAI,IAAI;QACP,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;IACjC,CAAC;IAED;;;;;;;OAOG;IACH,6BAA6B;IAC7B,uCAAuC;IACvC,IAAI;IAEJ;;;;;;;OAOG;IACH,iCAAiC;IACjC,uCAAuC;IACvC,IAAI;IAEJ,QAAQ;QACP,MAAM,CAAC,uBAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAC3C,CAAC;IAED;;;;;;;;OAQG;IACH,MAAM,CAAC,GAAQ;QACd,EAAE,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,MAAM,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAE1B,EAAE,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAED,IAAI,KAAK,GAAG,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAC9B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,CAAC,KAAK,CAAC;YACd,CAAC;QACF,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAED;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,QAAQ;QACP,IAAI,MAAM,GAAG,GAAG,CAAC;QAEjB,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YACrE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBACX,KAAK,GAAG,KAAK,CAAC;YACf,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,MAAM,IAAI,IAAI,CAAC;YAChB,CAAC;YAED,MAAM,IAAI,CAAC,CAAC;QACb,CAAC;QAED,MAAM,IAAI,GAAG,CAAC;QACd,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAED,4CAA4C;IAC5C,+CAA+C;IAC/C,gDAAgD;IAChD,uEAAuE;IACvE,uCAAuC;IACvC,IAAI;IAEJ;;;;;;OAMG;IACH,GAAG,CAAC,GAAW;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC;QACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,KAAK,KAAK,GAAG,IAAI,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;QAEnE,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;QAElB,2CAA2C;QAE3C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAAC,QAAQ,GAAG,CAAC,CAAC;QACxD,CAAC;QAED,+CAA+C;QAE/C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,IAAI,GAAG,KAAK,CAAC;QACzD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAAC,QAAQ,GAAG,CAAC,CAAC;QAC/C,CAAC;QAED,EAAE,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC;QACxB,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;YACzC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QAClB,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;QACzC,CAAC;IACF,CAAC;IAED,KAAK;QACJ,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QAChB,MAAM,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC;IAED,8CAA8C;IAC9C,CAAE,IAAI,CAAC,OAAe,CAAC,MAAM,CAAC;QAC7B,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;IACpC,CAAC;CACD;AA3rBD,wBA2rBC;AAED;IAIC,YAAoB,IAAiB;QAAjB,SAAI,GAAJ,IAAI,CAAa;QAH7B,UAAK,GAAG,CAAC,CAAC;QACV,SAAI,GAAG,MAAM,CAAC;IAEmB,CAAC;IAE1C,IAAI;QACH,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YAAA,CAAC;YAChD,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;gBAChB,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;gBACzD,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,SAAS,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;gBACvC,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;YAC1C,CAAC;YACD,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;QACpB,CAAC;QACD,MAAM,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC;IAClC,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC,KAA+B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;CAC9D"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/DefaultEqualityComparator.d.ts b/node_modules/antlr4ts/misc/DefaultEqualityComparator.d.ts
deleted file mode 100644
index 0b25f99..0000000
--- a/node_modules/antlr4ts/misc/DefaultEqualityComparator.d.ts
+++ /dev/null
@@ -1,31 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { EqualityComparator } from './EqualityComparator';
-/**
- * This default implementation of {@link EqualityComparator} uses object equality
- * for comparisons by calling {@link Object#hashCode} and {@link Object#equals}.
- *
- * @author Sam Harwell
- */
-export declare class DefaultEqualityComparator implements EqualityComparator {
- static readonly INSTANCE: DefaultEqualityComparator;
- /**
- * {@inheritDoc}
- *
- * This implementation returns
- * {@code obj.}{@link Object#hashCode hashCode()}.
- */
- hashCode(obj: any): number;
- /**
- * {@inheritDoc}
- *
- * This implementation relies on object equality. If both objects are
- * {@code null}, this method returns {@code true}. Otherwise if only
- * {@code a} is {@code null}, this method returns {@code false}. Otherwise,
- * this method returns the result of
- * {@code a.}{@link Object#equals equals}{@code (b)}.
- */
- equals(a: any, b: any): boolean;
-}
diff --git a/node_modules/antlr4ts/misc/DefaultEqualityComparator.js b/node_modules/antlr4ts/misc/DefaultEqualityComparator.js
deleted file mode 100644
index 14a8af8..0000000
--- a/node_modules/antlr4ts/misc/DefaultEqualityComparator.js
+++ /dev/null
@@ -1,69 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const Decorators_1 = require("../Decorators");
-const MurmurHash_1 = require("./MurmurHash");
-const ObjectEqualityComparator_1 = require("./ObjectEqualityComparator");
-/**
- * This default implementation of {@link EqualityComparator} uses object equality
- * for comparisons by calling {@link Object#hashCode} and {@link Object#equals}.
- *
- * @author Sam Harwell
- */
-class DefaultEqualityComparator {
- /**
- * {@inheritDoc}
- *
- * This implementation returns
- * {@code obj.}{@link Object#hashCode hashCode()}.
- */
- hashCode(obj) {
- if (obj == null) {
- return 0;
- }
- else if (typeof obj === 'string' || typeof obj === 'number') {
- return MurmurHash_1.MurmurHash.hashCode([obj]);
- }
- else {
- return ObjectEqualityComparator_1.ObjectEqualityComparator.INSTANCE.hashCode(obj);
- }
- }
- /**
- * {@inheritDoc}
- *
- * This implementation relies on object equality. If both objects are
- * {@code null}, this method returns {@code true}. Otherwise if only
- * {@code a} is {@code null}, this method returns {@code false}. Otherwise,
- * this method returns the result of
- * {@code a.}{@link Object#equals equals}{@code (b)}.
- */
- equals(a, b) {
- if (a == null) {
- return b == null;
- }
- else if (typeof a === 'string' || typeof a === 'number') {
- return a === b;
- }
- else {
- return ObjectEqualityComparator_1.ObjectEqualityComparator.INSTANCE.equals(a, b);
- }
- }
-}
-DefaultEqualityComparator.INSTANCE = new DefaultEqualityComparator();
-__decorate([
- Decorators_1.Override
-], DefaultEqualityComparator.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], DefaultEqualityComparator.prototype, "equals", null);
-exports.DefaultEqualityComparator = DefaultEqualityComparator;
-//# sourceMappingURL=DefaultEqualityComparator.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/DefaultEqualityComparator.js.map b/node_modules/antlr4ts/misc/DefaultEqualityComparator.js.map
deleted file mode 100644
index 1e097f4..0000000
--- a/node_modules/antlr4ts/misc/DefaultEqualityComparator.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"DefaultEqualityComparator.js","sourceRoot":"","sources":["../../../src/misc/DefaultEqualityComparator.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAGH,8CAAyC;AAEzC,6CAA0C;AAC1C,yEAAsE;AAEtE;;;;;GAKG;AACH;IAGC;;;;;OAKG;IAEH,QAAQ,CAAC,GAAQ;QAChB,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,CAAC,CAAC;QACV,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC;YAC/D,MAAM,CAAC,uBAAU,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,MAAM,CAAC,mDAAwB,CAAC,QAAQ,CAAC,QAAQ,CAAY,GAAG,CAAC,CAAC;QACnE,CAAC;IACF,CAAC;IAED;;;;;;;;OAQG;IAEH,MAAM,CAAC,CAAM,EAAE,CAAM;QACpB,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,CAAC,IAAI,IAAI,CAAC;QAClB,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC;YAC3D,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC;QAChB,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,MAAM,CAAC,mDAAwB,CAAC,QAAQ,CAAC,MAAM,CAAY,CAAC,EAAa,CAAC,CAAC,CAAC;QAC7E,CAAC;IACF,CAAC;;AArCe,kCAAQ,GAA8B,IAAI,yBAAyB,EAAE,CAAC;AAStF;IADC,qBAAQ;yDASR;AAYD;IADC,qBAAQ;uDASR;AAtCF,8DAuCC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/EqualityComparator.d.ts b/node_modules/antlr4ts/misc/EqualityComparator.d.ts
deleted file mode 100644
index 0044abc..0000000
--- a/node_modules/antlr4ts/misc/EqualityComparator.d.ts
+++ /dev/null
@@ -1,29 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-/**
- * This interface provides an abstract concept of object equality independent of
- * {@link Object#equals} (object equality) and the {@code ==} operator
- * (reference equality). It can be used to provide algorithm-specific unordered
- * comparisons without requiring changes to the object itself.
- *
- * @author Sam Harwell
- */
-export interface EqualityComparator {
- /**
- * This method returns a hash code for the specified object.
- *
- * @param obj The object.
- * @return The hash code for {@code obj}.
- */
- hashCode(obj: T): number;
- /**
- * This method tests if two objects are equal.
- *
- * @param a The first object to compare.
- * @param b The second object to compare.
- * @return {@code true} if {@code a} equals {@code b}, otherwise {@code false}.
- */
- equals(a: T, b: T): boolean;
-}
diff --git a/node_modules/antlr4ts/misc/EqualityComparator.js b/node_modules/antlr4ts/misc/EqualityComparator.js
deleted file mode 100644
index 6a19939..0000000
--- a/node_modules/antlr4ts/misc/EqualityComparator.js
+++ /dev/null
@@ -1,7 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=EqualityComparator.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/EqualityComparator.js.map b/node_modules/antlr4ts/misc/EqualityComparator.js.map
deleted file mode 100644
index 6418709..0000000
--- a/node_modules/antlr4ts/misc/EqualityComparator.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"EqualityComparator.js","sourceRoot":"","sources":["../../../src/misc/EqualityComparator.ts"],"names":[],"mappings":";AAAA;;;GAGG"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/IntSet.d.ts b/node_modules/antlr4ts/misc/IntSet.d.ts
deleted file mode 100644
index 54fbaf1..0000000
--- a/node_modules/antlr4ts/misc/IntSet.d.ts
+++ /dev/null
@@ -1,142 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-/**
- * A generic set of integers.
- *
- * @see IntervalSet
- */
-export interface IntSet {
- /**
- * Adds the specified value to the current set.
- *
- * @param el the value to add
- *
- * @exception IllegalStateException if the current set is read-only
- */
- add(el: number): void;
- /**
- * Modify the current {@link IntSet} object to contain all elements that are
- * present in itself, the specified {@code set}, or both.
- *
- * @param set The set to add to the current set. A {@code null} argument is
- * treated as though it were an empty set.
- * @return {@code this} (to support chained calls)
- *
- * @exception IllegalStateException if the current set is read-only
- */
- addAll(set: IntSet): IntSet;
- /**
- * Return a new {@link IntSet} object containing all elements that are
- * present in both the current set and the specified set {@code a}.
- *
- * @param a The set to intersect with the current set.
- * @return A new {@link IntSet} instance containing the intersection of the
- * current set and {@code a}.
- */
- and(a: IntSet): IntSet;
- /**
- * Return a new {@link IntSet} object containing all elements that are
- * present in {@code elements} but not present in the current set. The
- * following expressions are equivalent for input non-null {@link IntSet}
- * instances {@code x} and {@code y}.
- *
- *
- * - {@code x.complement(y)}
- * - {@code y.subtract(x)}
- *
- *
- * @param elements The set to compare with the current set.
- * @return A new {@link IntSet} instance containing the elements present in
- * {@code elements} but not present in the current set.
- */
- complement(elements: IntSet): IntSet;
- /**
- * Return a new {@link IntSet} object containing all elements that are
- * present in the current set, the specified set {@code a}, or both.
- *
- *
- * This method is similar to {@link #addAll(IntSet)}, but returns a new
- * {@link IntSet} instance instead of modifying the current set.
- *
- * @param a The set to union with the current set. A {@code null} argument
- * is treated as though it were an empty set.
- * @return A new {@link IntSet} instance containing the union of the current
- * set and {@code a}. The value {@code null} may be returned in place of an
- * empty result set.
- */
- or(a: IntSet): IntSet;
- /**
- * Return a new {@link IntSet} object containing all elements that are
- * present in the current set but not present in the input set {@code a}.
- * The following expressions are equivalent for input non-null
- * {@link IntSet} instances {@code x} and {@code y}.
- *
- *
- * - {@code y.subtract(x)}
- * - {@code x.complement(y)}
- *
- *
- * @param a The set to compare with the current set. A {@code null}
- * argument is treated as though it were an empty set.
- * @return A new {@link IntSet} instance containing the elements present in
- * {@code elements} but not present in the current set. The value
- * {@code null} may be returned in place of an empty result set.
- */
- subtract(a: IntSet): IntSet;
- /**
- * Return the total number of elements represented by the current set.
- *
- * @return the total number of elements represented by the current set,
- * regardless of the manner in which the elements are stored.
- */
- readonly size: number;
- /**
- * Returns {@code true} if this set contains no elements.
- *
- * @return {@code true} if the current set contains no elements; otherwise,
- * {@code false}.
- */
- readonly isNil: boolean;
- /**
- * {@inheritDoc}
- */
- equals(obj: any): boolean;
- /**
- * Returns the single value contained in the set, if {@link #size} is 1;
- * otherwise, returns {@link Token#INVALID_TYPE}.
- *
- * @return the single value contained in the set, if {@link #size} is 1;
- * otherwise, returns {@link Token#INVALID_TYPE}.
- */
- getSingleElement(): number;
- /**
- * Returns {@code true} if the set contains the specified element.
- *
- * @param el The element to check for.
- * @return {@code true} if the set contains {@code el}; otherwise {@code false}.
- */
- contains(el: number): boolean;
- /**
- * Removes the specified value from the current set. If the current set does
- * not contain the element, no changes are made.
- *
- * @param el the value to remove
- *
- * @exception IllegalStateException if the current set is read-only
- */
- remove(el: number): void;
- /**
- * Return a list containing the elements represented by the current set. The
- * list is returned in ascending numerical order.
- *
- * @return A list containing all element present in the current set, sorted
- * in ascending numerical order.
- */
- toList(): number[];
- /**
- * {@inheritDoc}
- */
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/misc/IntSet.js b/node_modules/antlr4ts/misc/IntSet.js
deleted file mode 100644
index fba977c..0000000
--- a/node_modules/antlr4ts/misc/IntSet.js
+++ /dev/null
@@ -1,7 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=IntSet.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/IntSet.js.map b/node_modules/antlr4ts/misc/IntSet.js.map
deleted file mode 100644
index dc35cf7..0000000
--- a/node_modules/antlr4ts/misc/IntSet.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"IntSet.js","sourceRoot":"","sources":["../../../src/misc/IntSet.ts"],"names":[],"mappings":";AAAA;;;GAGG"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/IntegerList.d.ts b/node_modules/antlr4ts/misc/IntegerList.d.ts
deleted file mode 100644
index f7735d4..0000000
--- a/node_modules/antlr4ts/misc/IntegerList.d.ts
+++ /dev/null
@@ -1,62 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { JavaCollection } from './Stubs';
-/**
- *
- * @author Sam Harwell
- */
-export declare class IntegerList {
- private _data;
- private _size;
- constructor(arg?: number | IntegerList | Iterable);
- add(value: number): void;
- addAll(list: number[] | IntegerList | JavaCollection): void;
- get(index: number): number;
- contains(value: number): boolean;
- set(index: number, value: number): number;
- removeAt(index: number): number;
- removeRange(fromIndex: number, toIndex: number): void;
- readonly isEmpty: boolean;
- readonly size: number;
- trimToSize(): void;
- clear(): void;
- toArray(): number[];
- sort(): void;
- /**
- * Compares the specified object with this list for equality. Returns
- * {@code true} if and only if the specified object is also an {@link IntegerList},
- * both lists have the same size, and all corresponding pairs of elements in
- * the two lists are equal. In other words, two lists are defined to be
- * equal if they contain the same elements in the same order.
- *
- * This implementation first checks if the specified object is this
- * list. If so, it returns {@code true}; if not, it checks if the
- * specified object is an {@link IntegerList}. If not, it returns {@code false};
- * if so, it checks the size of both lists. If the lists are not the same size,
- * it returns {@code false}; otherwise it iterates over both lists, comparing
- * corresponding pairs of elements. If any comparison returns {@code false},
- * this method returns {@code false}.
- *
- * @param o the object to be compared for equality with this list
- * @return {@code true} if the specified object is equal to this list
- */
- equals(o: any): boolean;
- /**
- * Returns the hash code value for this list.
- *
- *
This implementation uses exactly the code that is used to define the
- * list hash function in the documentation for the {@link List#hashCode}
- * method.
- *
- * @return the hash code value for this list
- */
- hashCode(): number;
- /**
- * Returns a string representation of this list.
- */
- toString(): string;
- binarySearch(key: number, fromIndex?: number, toIndex?: number): number;
- private ensureCapacity(capacity);
-}
diff --git a/node_modules/antlr4ts/misc/IntegerList.js b/node_modules/antlr4ts/misc/IntegerList.js
deleted file mode 100644
index acaebe1..0000000
--- a/node_modules/antlr4ts/misc/IntegerList.js
+++ /dev/null
@@ -1,253 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:40.5099429-07:00
-const Arrays_1 = require("./Arrays");
-const Decorators_1 = require("../Decorators");
-const EMPTY_DATA = new Int32Array(0);
-const INITIAL_SIZE = 4;
-const MAX_ARRAY_SIZE = (((1 << 31) >>> 0) - 1) - 8;
-/**
- *
- * @author Sam Harwell
- */
-class IntegerList {
- constructor(arg) {
- if (!arg) {
- this._data = EMPTY_DATA;
- this._size = 0;
- }
- else if (arg instanceof IntegerList) {
- this._data = arg._data.slice(0);
- this._size = arg._size;
- }
- else if (typeof arg === 'number') {
- if (arg === 0) {
- this._data = EMPTY_DATA;
- this._size = 0;
- }
- else {
- this._data = new Int32Array(arg);
- this._size = 0;
- }
- }
- else {
- // arg is Iterable
- this._data = EMPTY_DATA;
- this._size = 0;
- for (let value of arg) {
- this.add(value);
- }
- }
- }
- add(value) {
- if (this._data.length === this._size) {
- this.ensureCapacity(this._size + 1);
- }
- this._data[this._size] = value;
- this._size++;
- }
- addAll(list) {
- if (Array.isArray(list)) {
- this.ensureCapacity(this._size + list.length);
- this._data.subarray(this._size, this._size + list.length).set(list);
- this._size += list.length;
- }
- else if (list instanceof IntegerList) {
- this.ensureCapacity(this._size + list._size);
- this._data.subarray(this._size, this._size + list.size).set(list._data);
- this._size += list._size;
- }
- else {
- // list is JavaCollection
- this.ensureCapacity(this._size + list.size);
- let current = 0;
- for (let xi = list.iterator(); xi.hasNext();) {
- this._data[this._size + current] = xi.next();
- current++;
- }
- this._size += list.size;
- }
- }
- get(index) {
- if (index < 0 || index >= this._size) {
- throw RangeError();
- }
- return this._data[index];
- }
- contains(value) {
- for (let i = 0; i < this._size; i++) {
- if (this._data[i] === value) {
- return true;
- }
- }
- return false;
- }
- set(index, value) {
- if (index < 0 || index >= this._size) {
- throw RangeError();
- }
- let previous = this._data[index];
- this._data[index] = value;
- return previous;
- }
- removeAt(index) {
- let value = this.get(index);
- this._data.copyWithin(index, index + 1, this._size);
- this._data[this._size - 1] = 0;
- this._size--;
- return value;
- }
- removeRange(fromIndex, toIndex) {
- if (fromIndex < 0 || toIndex < 0 || fromIndex > this._size || toIndex > this._size) {
- throw RangeError();
- }
- if (fromIndex > toIndex) {
- throw RangeError();
- }
- this._data.copyWithin(toIndex, fromIndex, this._size);
- this._data.fill(0, this._size - (toIndex - fromIndex), this._size);
- this._size -= (toIndex - fromIndex);
- }
- get isEmpty() {
- return this._size === 0;
- }
- get size() {
- return this._size;
- }
- trimToSize() {
- if (this._data.length === this._size) {
- return;
- }
- this._data = this._data.slice(0, this._size);
- }
- clear() {
- this._data.fill(0, 0, this._size);
- this._size = 0;
- }
- toArray() {
- if (this._size === 0) {
- return [];
- }
- return Array.from(this._data.subarray(0, this._size));
- }
- sort() {
- this._data.subarray(0, this._size).sort();
- }
- /**
- * Compares the specified object with this list for equality. Returns
- * {@code true} if and only if the specified object is also an {@link IntegerList},
- * both lists have the same size, and all corresponding pairs of elements in
- * the two lists are equal. In other words, two lists are defined to be
- * equal if they contain the same elements in the same order.
- *
- * This implementation first checks if the specified object is this
- * list. If so, it returns {@code true}; if not, it checks if the
- * specified object is an {@link IntegerList}. If not, it returns {@code false};
- * if so, it checks the size of both lists. If the lists are not the same size,
- * it returns {@code false}; otherwise it iterates over both lists, comparing
- * corresponding pairs of elements. If any comparison returns {@code false},
- * this method returns {@code false}.
- *
- * @param o the object to be compared for equality with this list
- * @return {@code true} if the specified object is equal to this list
- */
- equals(o) {
- if (o === this) {
- return true;
- }
- if (!(o instanceof IntegerList)) {
- return false;
- }
- if (this._size !== o._size) {
- return false;
- }
- for (let i = 0; i < this._size; i++) {
- if (this._data[i] !== o._data[i]) {
- return false;
- }
- }
- return true;
- }
- /**
- * Returns the hash code value for this list.
- *
- *
This implementation uses exactly the code that is used to define the
- * list hash function in the documentation for the {@link List#hashCode}
- * method.
- *
- * @return the hash code value for this list
- */
- hashCode() {
- let hashCode = 1;
- for (let i = 0; i < this._size; i++) {
- hashCode = 31 * hashCode + this._data[i];
- }
- return hashCode;
- }
- /**
- * Returns a string representation of this list.
- */
- toString() {
- return this._data.toString();
- }
- binarySearch(key, fromIndex, toIndex) {
- if (fromIndex === undefined) {
- fromIndex = 0;
- }
- if (toIndex === undefined) {
- toIndex = this._size;
- }
- if (fromIndex < 0 || toIndex < 0 || fromIndex > this._size || toIndex > this._size) {
- throw new RangeError();
- }
- if (fromIndex > toIndex) {
- throw new RangeError();
- }
- return Arrays_1.Arrays.binarySearch(this._data, key, fromIndex, toIndex);
- }
- ensureCapacity(capacity) {
- if (capacity < 0 || capacity > MAX_ARRAY_SIZE) {
- throw new RangeError();
- }
- let newLength;
- if (this._data.length === 0) {
- newLength = INITIAL_SIZE;
- }
- else {
- newLength = this._data.length;
- }
- while (newLength < capacity) {
- newLength = newLength * 2;
- if (newLength < 0 || newLength > MAX_ARRAY_SIZE) {
- newLength = MAX_ARRAY_SIZE;
- }
- }
- let tmp = new Int32Array(newLength);
- tmp.set(this._data);
- this._data = tmp;
- }
-}
-__decorate([
- Decorators_1.NotNull
-], IntegerList.prototype, "_data", void 0);
-__decorate([
- Decorators_1.Override
-], IntegerList.prototype, "equals", null);
-__decorate([
- Decorators_1.Override
-], IntegerList.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], IntegerList.prototype, "toString", null);
-exports.IntegerList = IntegerList;
-//# sourceMappingURL=IntegerList.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/IntegerList.js.map b/node_modules/antlr4ts/misc/IntegerList.js.map
deleted file mode 100644
index bad297b..0000000
--- a/node_modules/antlr4ts/misc/IntegerList.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"IntegerList.js","sourceRoot":"","sources":["../../../src/misc/IntegerList.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAEH,wDAAwD;AAExD,qCAAkC;AAClC,8CAAkD;AAGlD,MAAM,UAAU,GAAe,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;AAEjD,MAAM,YAAY,GAAW,CAAC,CAAC;AAC/B,MAAM,cAAc,GAAW,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AAE3D;;;GAGG;AACH;IAMC,YAAY,GAA6C;QACxD,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACV,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC;YACxB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QAChB,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,YAAY,WAAW,CAAC,CAAC,CAAC;YACvC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC;YACpC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACf,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC;gBACxB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YAChB,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,IAAI,CAAC,KAAK,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;gBACjC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YAChB,CAAC;QACF,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,0BAA0B;YAC1B,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC;YACxB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YACf,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC;gBACvB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACjB,CAAC;QACF,CAAC;IACF,CAAC;IAED,GAAG,CAAC,KAAa;QAChB,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACtC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACrC,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;QAC/B,IAAI,CAAC,KAAK,EAAE,CAAC;IACd,CAAC;IAED,MAAM,CAAC,IAAqD;QAC3D,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpE,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC;QAC3B,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,YAAY,WAAW,CAAC,CAAC,CAAC;YACxC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7C,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxE,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC;QAC1B,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,iCAAiC;YACjC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5C,IAAI,OAAO,GAAW,CAAC,CAAC;YACxB,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,GAAa,CAAC;gBACxD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC;gBAC7C,OAAO,EAAE,CAAC;YACX,CAAC;YAED,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC;QACzB,CAAC;IACF,CAAC;IAED,GAAG,CAAC,KAAa;QAChB,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACtC,MAAM,UAAU,EAAE,CAAC;QACpB,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED,QAAQ,CAAC,KAAa;QACrB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;gBAC7B,MAAM,CAAC,IAAI,CAAC;YACb,CAAC;QACF,CAAC;QAED,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED,GAAG,CAAC,KAAa,EAAE,KAAa;QAC/B,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACtC,MAAM,UAAU,EAAE,CAAC;QACpB,CAAC;QAED,IAAI,QAAQ,GAAW,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;QAC1B,MAAM,CAAC,QAAQ,CAAC;IACjB,CAAC;IAED,QAAQ,CAAC,KAAa;QACrB,IAAI,KAAK,GAAW,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACpD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;IAED,WAAW,CAAC,SAAiB,EAAE,OAAe;QAC7C,EAAE,CAAC,CAAC,SAAS,GAAG,CAAC,IAAI,OAAO,GAAG,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,KAAK,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACpF,MAAM,UAAU,EAAE,CAAC;QACpB,CAAC;QAED,EAAE,CAAC,CAAC,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC;YACzB,MAAM,UAAU,EAAE,CAAC;QACpB,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACtD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,OAAO,GAAG,SAAS,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACnE,IAAI,CAAC,KAAK,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC,CAAC;IACrC,CAAC;IAED,IAAI,OAAO;QACV,MAAM,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,IAAI,IAAI;QACP,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED,UAAU;QACT,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC;QACR,CAAC;QAED,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9C,CAAC;IAED,KAAK;QACJ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IAChB,CAAC;IAED,OAAO;QACN,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,CAAC,EAAE,CAAC;QACX,CAAC;QAED,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,IAAI;QACH,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IAC3C,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IAEH,MAAM,CAAC,CAAM;QACZ,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,WAAW,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,CAAC,KAAK,CAAC;YACd,CAAC;QACF,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAED;;;;;;;;OAQG;IAEH,QAAQ;QACP,IAAI,QAAQ,GAAW,CAAC,CAAC;QACzB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,QAAQ,GAAG,EAAE,GAAG,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;QAED,MAAM,CAAC,QAAQ,CAAC;IACjB,CAAC;IAED;;OAEG;IAEH,QAAQ;QACP,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;IAC9B,CAAC;IAED,YAAY,CAAC,GAAW,EAAE,SAAkB,EAAE,OAAgB;QAC7D,EAAE,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC;YAC7B,SAAS,GAAG,CAAC,CAAC;QACf,CAAC;QAED,EAAE,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC;YAC3B,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,CAAC;QAED,EAAE,CAAC,CAAC,SAAS,GAAG,CAAC,IAAI,OAAO,GAAG,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,KAAK,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACpF,MAAM,IAAI,UAAU,EAAE,CAAC;QACxB,CAAC;QAED,EAAE,CAAC,CAAC,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC;YACzB,MAAM,IAAI,UAAU,EAAE,CAAC;QACxB,CAAC;QAED,MAAM,CAAC,eAAM,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;IACjE,CAAC;IAEO,cAAc,CAAC,QAAgB;QACtC,EAAE,CAAC,CAAC,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,cAAc,CAAC,CAAC,CAAC;YAC/C,MAAM,IAAI,UAAU,EAAE,CAAC;QACxB,CAAC;QAED,IAAI,SAAiB,CAAC;QACtB,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;YAC7B,SAAS,GAAG,YAAY,CAAC;QAC1B,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC/B,CAAC;QAED,OAAO,SAAS,GAAG,QAAQ,EAAE,CAAC;YAC7B,SAAS,GAAG,SAAS,GAAG,CAAC,CAAC;YAC1B,EAAE,CAAC,CAAC,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,cAAc,CAAC,CAAC,CAAC;gBACjD,SAAS,GAAG,cAAc,CAAC;YAC5B,CAAC;QACF,CAAC;QAED,IAAI,GAAG,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;QACpC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;IAClB,CAAC;CAED;AA/PA;IADC,oBAAO;0CACkB;AAkK1B;IADC,qBAAQ;yCAqBR;AAYD;IADC,qBAAQ;2CAQR;AAMD;IADC,qBAAQ;2CAGR;AAnNF,kCAiQC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/IntegerStack.d.ts b/node_modules/antlr4ts/misc/IntegerStack.d.ts
deleted file mode 100644
index 1fefbac..0000000
--- a/node_modules/antlr4ts/misc/IntegerStack.d.ts
+++ /dev/null
@@ -1,15 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { IntegerList } from './IntegerList';
-/**
- *
- * @author Sam Harwell
- */
-export declare class IntegerStack extends IntegerList {
- constructor(arg?: number | IntegerStack);
- push(value: number): void;
- pop(): number;
- peek(): number;
-}
diff --git a/node_modules/antlr4ts/misc/IntegerStack.js b/node_modules/antlr4ts/misc/IntegerStack.js
deleted file mode 100644
index 7d55386..0000000
--- a/node_modules/antlr4ts/misc/IntegerStack.js
+++ /dev/null
@@ -1,28 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:40.6647101-07:00
-const IntegerList_1 = require("./IntegerList");
-/**
- *
- * @author Sam Harwell
- */
-class IntegerStack extends IntegerList_1.IntegerList {
- constructor(arg) {
- super(arg);
- }
- push(value) {
- this.add(value);
- }
- pop() {
- return this.removeAt(this.size - 1);
- }
- peek() {
- return this.get(this.size - 1);
- }
-}
-exports.IntegerStack = IntegerStack;
-//# sourceMappingURL=IntegerStack.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/IntegerStack.js.map b/node_modules/antlr4ts/misc/IntegerStack.js.map
deleted file mode 100644
index 081733f..0000000
--- a/node_modules/antlr4ts/misc/IntegerStack.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"IntegerStack.js","sourceRoot":"","sources":["../../../src/misc/IntegerStack.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,wDAAwD;AAExD,+CAA4C;AAE5C;;;GAGG;AACH,kBAA0B,SAAQ,yBAAW;IAE5C,YAAY,GAA2B;QACtC,KAAK,CAAC,GAAG,CAAC,CAAC;IACZ,CAAC;IAED,IAAI,CAAC,KAAa;QACjB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACjB,CAAC;IAED,GAAG;QACF,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IACrC,CAAC;IAED,IAAI;QACH,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IAChC,CAAC;CAED;AAlBD,oCAkBC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/Interval.d.ts b/node_modules/antlr4ts/misc/Interval.d.ts
deleted file mode 100644
index 13f3dbc..0000000
--- a/node_modules/antlr4ts/misc/Interval.d.ts
+++ /dev/null
@@ -1,57 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Equatable } from './Stubs';
-/** An immutable inclusive interval a..b */
-export declare class Interval implements Equatable {
- a: number;
- b: number;
- private static _INVALID;
- static readonly INVALID: Interval;
- private static readonly cache;
- /**
- * @param a The start of the interval
- * @param b The end of the interval (inclusive)
- */
- constructor(a: number, b: number);
- /** Interval objects are used readonly so share all with the
- * same single value a==b up to some max size. Use an array as a perfect hash.
- * Return shared object for 0..INTERVAL_POOL_MAX_VALUE or a new
- * Interval object with a..a in it. On Java.g4, 218623 IntervalSets
- * have a..a (set with 1 element).
- */
- static of(a: number, b: number): Interval;
- /** return number of elements between a and b inclusively. x..x is length 1.
- * if b < a, then length is 0. 9..10 has length 2.
- */
- readonly length: number;
- equals(o: any): boolean;
- hashCode(): number;
- /** Does this start completely before other? Disjoint */
- startsBeforeDisjoint(other: Interval): boolean;
- /** Does this start at or before other? Nondisjoint */
- startsBeforeNonDisjoint(other: Interval): boolean;
- /** Does this.a start after other.b? May or may not be disjoint */
- startsAfter(other: Interval): boolean;
- /** Does this start completely after other? Disjoint */
- startsAfterDisjoint(other: Interval): boolean;
- /** Does this start after other? NonDisjoint */
- startsAfterNonDisjoint(other: Interval): boolean;
- /** Are both ranges disjoint? I.e., no overlap? */
- disjoint(other: Interval): boolean;
- /** Are two intervals adjacent such as 0..41 and 42..42? */
- adjacent(other: Interval): boolean;
- properlyContains(other: Interval): boolean;
- /** Return the interval computed from combining this and other */
- union(other: Interval): Interval;
- /** Return the interval in common between this and o */
- intersection(other: Interval): Interval;
- /** Return the interval with elements from {@code this} not in {@code other};
- * {@code other} must not be totally enclosed (properly contained)
- * within {@code this}, which would result in two disjoint intervals
- * instead of the single one returned by this method.
- */
- differenceNotProperlyContained(other: Interval): Interval | undefined;
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/misc/Interval.js b/node_modules/antlr4ts/misc/Interval.js
deleted file mode 100644
index a5d53d4..0000000
--- a/node_modules/antlr4ts/misc/Interval.js
+++ /dev/null
@@ -1,142 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:40.7402214-07:00
-const Decorators_1 = require("../Decorators");
-const INTERVAL_POOL_MAX_VALUE = 1000;
-/** An immutable inclusive interval a..b */
-class Interval {
- /**
- * @param a The start of the interval
- * @param b The end of the interval (inclusive)
- */
- constructor(a, b) {
- this.a = a;
- this.b = b;
- }
- static get INVALID() {
- return Interval._INVALID;
- }
- /** Interval objects are used readonly so share all with the
- * same single value a==b up to some max size. Use an array as a perfect hash.
- * Return shared object for 0..INTERVAL_POOL_MAX_VALUE or a new
- * Interval object with a..a in it. On Java.g4, 218623 IntervalSets
- * have a..a (set with 1 element).
- */
- static of(a, b) {
- // cache just a..a
- if (a !== b || a < 0 || a > INTERVAL_POOL_MAX_VALUE) {
- return new Interval(a, b);
- }
- if (Interval.cache[a] == null) {
- Interval.cache[a] = new Interval(a, a);
- }
- return Interval.cache[a];
- }
- /** return number of elements between a and b inclusively. x..x is length 1.
- * if b < a, then length is 0. 9..10 has length 2.
- */
- get length() {
- if (this.b < this.a) {
- return 0;
- }
- return this.b - this.a + 1;
- }
- equals(o) {
- if (o === this) {
- return true;
- }
- else if (!(o instanceof Interval)) {
- return false;
- }
- let other = o;
- return this.a === other.a && this.b === other.b;
- }
- hashCode() {
- let hash = 23;
- hash = hash * 31 + this.a;
- hash = hash * 31 + this.b;
- return hash;
- }
- /** Does this start completely before other? Disjoint */
- startsBeforeDisjoint(other) {
- return this.a < other.a && this.b < other.a;
- }
- /** Does this start at or before other? Nondisjoint */
- startsBeforeNonDisjoint(other) {
- return this.a <= other.a && this.b >= other.a;
- }
- /** Does this.a start after other.b? May or may not be disjoint */
- startsAfter(other) {
- return this.a > other.a;
- }
- /** Does this start completely after other? Disjoint */
- startsAfterDisjoint(other) {
- return this.a > other.b;
- }
- /** Does this start after other? NonDisjoint */
- startsAfterNonDisjoint(other) {
- return this.a > other.a && this.a <= other.b; // this.b>=other.b implied
- }
- /** Are both ranges disjoint? I.e., no overlap? */
- disjoint(other) {
- return this.startsBeforeDisjoint(other) || this.startsAfterDisjoint(other);
- }
- /** Are two intervals adjacent such as 0..41 and 42..42? */
- adjacent(other) {
- return this.a === other.b + 1 || this.b === other.a - 1;
- }
- properlyContains(other) {
- return other.a >= this.a && other.b <= this.b;
- }
- /** Return the interval computed from combining this and other */
- union(other) {
- return Interval.of(Math.min(this.a, other.a), Math.max(this.b, other.b));
- }
- /** Return the interval in common between this and o */
- intersection(other) {
- return Interval.of(Math.max(this.a, other.a), Math.min(this.b, other.b));
- }
- /** Return the interval with elements from {@code this} not in {@code other};
- * {@code other} must not be totally enclosed (properly contained)
- * within {@code this}, which would result in two disjoint intervals
- * instead of the single one returned by this method.
- */
- differenceNotProperlyContained(other) {
- let diff;
- if (other.startsBeforeNonDisjoint(this)) {
- // other.a to left of this.a (or same)
- diff = Interval.of(Math.max(this.a, other.b + 1), this.b);
- }
- else if (other.startsAfterNonDisjoint(this)) {
- // other.a to right of this.a
- diff = Interval.of(this.a, other.a - 1);
- }
- return diff;
- }
- toString() {
- return this.a + ".." + this.b;
- }
-}
-Interval._INVALID = new Interval(-1, -2);
-Interval.cache = new Array(INTERVAL_POOL_MAX_VALUE + 1);
-__decorate([
- Decorators_1.Override
-], Interval.prototype, "equals", null);
-__decorate([
- Decorators_1.Override
-], Interval.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], Interval.prototype, "toString", null);
-exports.Interval = Interval;
-//# sourceMappingURL=Interval.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/Interval.js.map b/node_modules/antlr4ts/misc/Interval.js.map
deleted file mode 100644
index e06e061..0000000
--- a/node_modules/antlr4ts/misc/Interval.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"Interval.js","sourceRoot":"","sources":["../../../src/misc/Interval.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAEH,wDAAwD;AAExD,8CAAyC;AAGzC,MAAM,uBAAuB,GAAW,IAAI,CAAC;AAE7C,2CAA2C;AAC3C;IAQC;;;OAGG;IACH,YAAmB,CAAS,EAAS,CAAS;QAA3B,MAAC,GAAD,CAAC,CAAQ;QAAS,MAAC,GAAD,CAAC,CAAQ;IAC9C,CAAC;IAXD,MAAM,KAAK,OAAO;QACjB,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC;IAC1B,CAAC;IAWD;;;;;OAKG;IACH,MAAM,CAAC,EAAE,CAAC,CAAS,EAAE,CAAS;QAC7B,kBAAkB;QAClB,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,uBAAuB,CAAC,CAAC,CAAC;YACrD,MAAM,CAAC,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,CAAC;QAED,EAAE,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YAC/B,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxC,CAAC;QAED,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,IAAI,MAAM;QACT,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,CAAC,CAAC,CAAC;QACV,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAGD,MAAM,CAAC,CAAM;QACZ,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QACD,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,QAAQ,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,IAAI,KAAK,GAAG,CAAa,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;IACjD,CAAC;IAGD,QAAQ;QACP,IAAI,IAAI,GAAW,EAAE,CAAC;QACtB,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAC1B,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAED,wDAAwD;IACxD,oBAAoB,CAAC,KAAe;QACnC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,sDAAsD;IACtD,uBAAuB,CAAC,KAAe;QACtC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED,kEAAkE;IAClE,WAAW,CAAC,KAAe;QAC1B,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IACzB,CAAC;IAED,uDAAuD;IACvD,mBAAmB,CAAC,KAAe;QAClC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IACzB,CAAC;IAED,+CAA+C;IAC/C,sBAAsB,CAAC,KAAe;QACrC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,0BAA0B;IACzE,CAAC;IAED,kDAAkD;IAClD,QAAQ,CAAC,KAAe;QACvB,MAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;IAC5E,CAAC;IAED,2DAA2D;IAC3D,QAAQ,CAAC,KAAe;QACvB,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;IACzD,CAAC;IAED,gBAAgB,CAAC,KAAe;QAC/B,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED,iEAAiE;IACjE,KAAK,CAAC,KAAe;QACpB,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED,uDAAuD;IACvD,YAAY,CAAC,KAAe;QAC3B,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED;;;;OAIG;IACH,8BAA8B,CAAC,KAAe;QAC7C,IAAI,IAA0B,CAAC;QAC/B,EAAE,CAAC,CAAC,KAAK,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,sCAAsC;YACtC,IAAI,GAAG,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3D,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/C,6BAA6B;YAC7B,IAAI,GAAG,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAGD,QAAQ;QACP,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC;IAC/B,CAAC;;AAvIc,iBAAQ,GAAa,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAKjC,cAAK,GAAe,IAAI,KAAK,CAAW,uBAAuB,GAAG,CAAC,CAAC,CAAC;AAwC7F;IADC,qBAAQ;sCAWR;AAGD;IADC,qBAAQ;wCAMR;AAsED;IADC,qBAAQ;wCAGR;AAxIF,4BAyIC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/IntervalSet.d.ts b/node_modules/antlr4ts/misc/IntervalSet.d.ts
deleted file mode 100644
index 657d064..0000000
--- a/node_modules/antlr4ts/misc/IntervalSet.d.ts
+++ /dev/null
@@ -1,100 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { IntegerList } from './IntegerList';
-import { Interval } from './Interval';
-import { IntSet } from './IntSet';
-import { Vocabulary } from '../Vocabulary';
-/**
- * This class implements the {@link IntSet} backed by a sorted array of
- * non-overlapping intervals. It is particularly efficient for representing
- * large collections of numbers, where the majority of elements appear as part
- * of a sequential range of numbers that are all part of the set. For example,
- * the set { 1, 2, 3, 4, 7, 8 } may be represented as { [1, 4], [7, 8] }.
- *
- *
- * This class is able to represent sets containing any combination of values in
- * the range {@link Integer#MIN_VALUE} to {@link Integer#MAX_VALUE}
- * (inclusive).
- */
-export declare class IntervalSet implements IntSet {
- private static _COMPLETE_CHAR_SET;
- static readonly COMPLETE_CHAR_SET: IntervalSet;
- private static _EMPTY_SET;
- static readonly EMPTY_SET: IntervalSet;
- /** The list of sorted, disjoint intervals. */
- private _intervals;
- private readonly;
- constructor(intervals?: Interval[]);
- /**
- * Create a set with all ints within range [a..b] (inclusive). If b is omitted, the set contains the single element
- * a.
- */
- static of(a: number, b?: number): IntervalSet;
- clear(): void;
- /** Add interval; i.e., add all integers from a to b to set.
- * If b<a, do nothing.
- * Keep list in sorted order (by left range value).
- * If overlap, combine ranges. For example,
- * If this is {1..5, 10..20}, adding 6..7 yields
- * {1..5, 6..7, 10..20}. Adding 4..8 yields {1..8, 10..20}.
- */
- add(a: number, b?: number): void;
- protected addRange(addition: Interval): void;
- /** combine all sets in the array returned the or'd value */
- static or(sets: IntervalSet[]): IntervalSet;
- addAll(set: IntSet): IntervalSet;
- complementRange(minElement: number, maxElement: number): IntervalSet;
- /** {@inheritDoc} */
- complement(vocabulary: IntSet): IntervalSet;
- subtract(a: IntSet): IntervalSet;
- /**
- * Compute the set difference between two interval sets. The specific
- * operation is {@code left - right}.
- */
- static subtract(left: IntervalSet, right: IntervalSet): IntervalSet;
- or(a: IntSet): IntervalSet;
- /** {@inheritDoc} */
- and(other: IntSet): IntervalSet;
- /** {@inheritDoc} */
- contains(el: number): boolean;
- /** {@inheritDoc} */
- readonly isNil: boolean;
- /** {@inheritDoc} */
- getSingleElement(): number;
- /**
- * Returns the maximum value contained in the set.
- *
- * @return the maximum value contained in the set. If the set is empty, this
- * method returns {@link Token#INVALID_TYPE}.
- */
- readonly maxElement: number;
- /**
- * Returns the minimum value contained in the set.
- *
- * @return the minimum value contained in the set. If the set is empty, this
- * method returns {@link Token#INVALID_TYPE}.
- */
- readonly minElement: number;
- /** Return a list of Interval objects. */
- readonly intervals: Interval[];
- hashCode(): number;
- /** Are two IntervalSets equal? Because all intervals are sorted
- * and disjoint, equals is a simple linear walk over both lists
- * to make sure they are the same. Interval.equals() is used
- * by the List.equals() method to check the ranges.
- */
- equals(o: any): boolean;
- toString(elemAreChar?: boolean): string;
- toStringVocabulary(vocabulary: Vocabulary): string;
- protected elementName(vocabulary: Vocabulary, a: number): string;
- readonly size: number;
- toIntegerList(): IntegerList;
- toList(): number[];
- toSet(): Set;
- toArray(): number[];
- remove(el: number): void;
- readonly isReadonly: boolean;
- setReadonly(readonly: boolean): void;
-}
diff --git a/node_modules/antlr4ts/misc/IntervalSet.js b/node_modules/antlr4ts/misc/IntervalSet.js
deleted file mode 100644
index bd4f413..0000000
--- a/node_modules/antlr4ts/misc/IntervalSet.js
+++ /dev/null
@@ -1,670 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-var __param = (this && this.__param) || function (paramIndex, decorator) {
- return function (target, key) { decorator(target, key, paramIndex); }
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:40.8683480-07:00
-const ArrayEqualityComparator_1 = require("./ArrayEqualityComparator");
-const IntegerList_1 = require("./IntegerList");
-const Interval_1 = require("./Interval");
-const Lexer_1 = require("../Lexer");
-const MurmurHash_1 = require("./MurmurHash");
-const Decorators_1 = require("../Decorators");
-const Token_1 = require("../Token");
-/**
- * This class implements the {@link IntSet} backed by a sorted array of
- * non-overlapping intervals. It is particularly efficient for representing
- * large collections of numbers, where the majority of elements appear as part
- * of a sequential range of numbers that are all part of the set. For example,
- * the set { 1, 2, 3, 4, 7, 8 } may be represented as { [1, 4], [7, 8] }.
- *
- *
- * This class is able to represent sets containing any combination of values in
- * the range {@link Integer#MIN_VALUE} to {@link Integer#MAX_VALUE}
- * (inclusive).
- */
-class IntervalSet {
- constructor(intervals) {
- this.readonly = false;
- if (intervals != null) {
- this._intervals = intervals.slice(0);
- }
- else {
- this._intervals = [];
- }
- }
- static get COMPLETE_CHAR_SET() {
- if (IntervalSet._COMPLETE_CHAR_SET === undefined) {
- IntervalSet._COMPLETE_CHAR_SET = IntervalSet.of(Lexer_1.Lexer.MIN_CHAR_VALUE, Lexer_1.Lexer.MAX_CHAR_VALUE);
- IntervalSet._COMPLETE_CHAR_SET.setReadonly(true);
- }
- return IntervalSet._COMPLETE_CHAR_SET;
- }
- static get EMPTY_SET() {
- if (IntervalSet._EMPTY_SET == null) {
- IntervalSet._EMPTY_SET = new IntervalSet();
- IntervalSet._EMPTY_SET.setReadonly(true);
- }
- return IntervalSet._EMPTY_SET;
- }
- /**
- * Create a set with all ints within range [a..b] (inclusive). If b is omitted, the set contains the single element
- * a.
- */
- static of(a, b = a) {
- let s = new IntervalSet();
- s.add(a, b);
- return s;
- }
- clear() {
- if (this.readonly) {
- throw new Error("can't alter readonly IntervalSet");
- }
- this._intervals.length = 0;
- }
- /** Add interval; i.e., add all integers from a to b to set.
- * If b<a, do nothing.
- * Keep list in sorted order (by left range value).
- * If overlap, combine ranges. For example,
- * If this is {1..5, 10..20}, adding 6..7 yields
- * {1..5, 6..7, 10..20}. Adding 4..8 yields {1..8, 10..20}.
- */
- add(a, b = a) {
- this.addRange(Interval_1.Interval.of(a, b));
- }
- // copy on write so we can cache a..a intervals and sets of that
- addRange(addition) {
- if (this.readonly) {
- throw new Error("can't alter readonly IntervalSet");
- }
- //System.out.println("add "+addition+" to "+intervals.toString());
- if (addition.b < addition.a) {
- return;
- }
- // find position in list
- // Use iterators as we modify list in place
- for (let i = 0; i < this._intervals.length; i++) {
- let r = this._intervals[i];
- if (addition.equals(r)) {
- return;
- }
- if (addition.adjacent(r) || !addition.disjoint(r)) {
- // next to each other, make a single larger interval
- let bigger = addition.union(r);
- this._intervals[i] = bigger;
- // make sure we didn't just create an interval that
- // should be merged with next interval in list
- while (i < this._intervals.length - 1) {
- i++;
- let next = this._intervals[i];
- if (!bigger.adjacent(next) && bigger.disjoint(next)) {
- break;
- }
- // if we bump up against or overlap next, merge
- // remove this one
- this._intervals.splice(i, 1);
- i--;
- // move backwards to what we just set
- this._intervals[i] = bigger.union(next);
- // set to 3 merged ones
- }
- // first call to next after previous duplicates the result
- return;
- }
- if (addition.startsBeforeDisjoint(r)) {
- // insert before r
- this._intervals.splice(i, 0, addition);
- return;
- }
- // if disjoint and after r, a future iteration will handle it
- }
- // ok, must be after last interval (and disjoint from last interval)
- // just add it
- this._intervals.push(addition);
- }
- /** combine all sets in the array returned the or'd value */
- static or(sets) {
- let r = new IntervalSet();
- for (let s of sets) {
- r.addAll(s);
- }
- return r;
- }
- addAll(set) {
- if (set == null) {
- return this;
- }
- if (set instanceof IntervalSet) {
- let other = set;
- // walk set and add each interval
- let n = other._intervals.length;
- for (let i = 0; i < n; i++) {
- let I = other._intervals[i];
- this.add(I.a, I.b);
- }
- }
- else {
- for (let value of set.toList()) {
- this.add(value);
- }
- }
- return this;
- }
- complementRange(minElement, maxElement) {
- return this.complement(IntervalSet.of(minElement, maxElement));
- }
- /** {@inheritDoc} */
- complement(vocabulary) {
- if (vocabulary.isNil) {
- // nothing in common with null set
- return IntervalSet.EMPTY_SET;
- }
- let vocabularyIS;
- if (vocabulary instanceof IntervalSet) {
- vocabularyIS = vocabulary;
- }
- else {
- vocabularyIS = new IntervalSet();
- vocabularyIS.addAll(vocabulary);
- }
- return vocabularyIS.subtract(this);
- }
- subtract(a) {
- if (a == null || a.isNil) {
- return new IntervalSet(this._intervals);
- }
- if (a instanceof IntervalSet) {
- return IntervalSet.subtract(this, a);
- }
- let other = new IntervalSet();
- other.addAll(a);
- return IntervalSet.subtract(this, other);
- }
- /**
- * Compute the set difference between two interval sets. The specific
- * operation is {@code left - right}.
- */
- static subtract(left, right) {
- if (left.isNil) {
- return new IntervalSet();
- }
- let result = new IntervalSet(left._intervals);
- if (right.isNil) {
- // right set has no elements; just return the copy of the current set
- return result;
- }
- let resultI = 0;
- let rightI = 0;
- while (resultI < result._intervals.length && rightI < right._intervals.length) {
- let resultInterval = result._intervals[resultI];
- let rightInterval = right._intervals[rightI];
- // operation: (resultInterval - rightInterval) and update indexes
- if (rightInterval.b < resultInterval.a) {
- rightI++;
- continue;
- }
- if (rightInterval.a > resultInterval.b) {
- resultI++;
- continue;
- }
- let beforeCurrent;
- let afterCurrent;
- if (rightInterval.a > resultInterval.a) {
- beforeCurrent = new Interval_1.Interval(resultInterval.a, rightInterval.a - 1);
- }
- if (rightInterval.b < resultInterval.b) {
- afterCurrent = new Interval_1.Interval(rightInterval.b + 1, resultInterval.b);
- }
- if (beforeCurrent) {
- if (afterCurrent) {
- // split the current interval into two
- result._intervals[resultI] = beforeCurrent;
- result._intervals.splice(resultI + 1, 0, afterCurrent);
- resultI++;
- rightI++;
- continue;
- }
- else {
- // replace the current interval
- result._intervals[resultI] = beforeCurrent;
- resultI++;
- continue;
- }
- }
- else {
- if (afterCurrent) {
- // replace the current interval
- result._intervals[resultI] = afterCurrent;
- rightI++;
- continue;
- }
- else {
- // remove the current interval (thus no need to increment resultI)
- result._intervals.splice(resultI, 1);
- continue;
- }
- }
- }
- // If rightI reached right.intervals.size, no more intervals to subtract from result.
- // If resultI reached result.intervals.size, we would be subtracting from an empty set.
- // Either way, we are done.
- return result;
- }
- or(a) {
- let o = new IntervalSet();
- o.addAll(this);
- o.addAll(a);
- return o;
- }
- /** {@inheritDoc} */
- and(other) {
- if (other.isNil) {
- // nothing in common with null set
- return new IntervalSet();
- }
- let myIntervals = this._intervals;
- let theirIntervals = other._intervals;
- let intersection;
- let mySize = myIntervals.length;
- let theirSize = theirIntervals.length;
- let i = 0;
- let j = 0;
- // iterate down both interval lists looking for nondisjoint intervals
- while (i < mySize && j < theirSize) {
- let mine = myIntervals[i];
- let theirs = theirIntervals[j];
- //System.out.println("mine="+mine+" and theirs="+theirs);
- if (mine.startsBeforeDisjoint(theirs)) {
- // move this iterator looking for interval that might overlap
- i++;
- }
- else if (theirs.startsBeforeDisjoint(mine)) {
- // move other iterator looking for interval that might overlap
- j++;
- }
- else if (mine.properlyContains(theirs)) {
- // overlap, add intersection, get next theirs
- if (!intersection) {
- intersection = new IntervalSet();
- }
- intersection.addRange(mine.intersection(theirs));
- j++;
- }
- else if (theirs.properlyContains(mine)) {
- // overlap, add intersection, get next mine
- if (!intersection) {
- intersection = new IntervalSet();
- }
- intersection.addRange(mine.intersection(theirs));
- i++;
- }
- else if (!mine.disjoint(theirs)) {
- // overlap, add intersection
- if (!intersection) {
- intersection = new IntervalSet();
- }
- intersection.addRange(mine.intersection(theirs));
- // Move the iterator of lower range [a..b], but not
- // the upper range as it may contain elements that will collide
- // with the next iterator. So, if mine=[0..115] and
- // theirs=[115..200], then intersection is 115 and move mine
- // but not theirs as theirs may collide with the next range
- // in thisIter.
- // move both iterators to next ranges
- if (mine.startsAfterNonDisjoint(theirs)) {
- j++;
- }
- else if (theirs.startsAfterNonDisjoint(mine)) {
- i++;
- }
- }
- }
- if (!intersection) {
- return new IntervalSet();
- }
- return intersection;
- }
- /** {@inheritDoc} */
- contains(el) {
- let n = this._intervals.length;
- for (let i = 0; i < n; i++) {
- let I = this._intervals[i];
- let a = I.a;
- let b = I.b;
- if (el < a) {
- // list is sorted and el is before this interval; not here
- break;
- }
- if (el >= a && el <= b) {
- // found in this interval
- return true;
- }
- }
- return false;
- /*
- for (ListIterator iter = intervals.listIterator(); iter.hasNext();) {
- let I: Interval = (Interval) iter.next();
- if ( el=I.a && el<=I.b ) {
- return true; // found in this interval
- }
- }
- return false;
- */
- }
- /** {@inheritDoc} */
- get isNil() {
- return this._intervals == null || this._intervals.length === 0;
- }
- /** {@inheritDoc} */
- getSingleElement() {
- if (this._intervals != null && this._intervals.length === 1) {
- let I = this._intervals[0];
- if (I.a === I.b) {
- return I.a;
- }
- }
- return Token_1.Token.INVALID_TYPE;
- }
- /**
- * Returns the maximum value contained in the set.
- *
- * @return the maximum value contained in the set. If the set is empty, this
- * method returns {@link Token#INVALID_TYPE}.
- */
- get maxElement() {
- if (this.isNil) {
- return Token_1.Token.INVALID_TYPE;
- }
- let last = this._intervals[this._intervals.length - 1];
- return last.b;
- }
- /**
- * Returns the minimum value contained in the set.
- *
- * @return the minimum value contained in the set. If the set is empty, this
- * method returns {@link Token#INVALID_TYPE}.
- */
- get minElement() {
- if (this.isNil) {
- return Token_1.Token.INVALID_TYPE;
- }
- return this._intervals[0].a;
- }
- /** Return a list of Interval objects. */
- get intervals() {
- return this._intervals;
- }
- hashCode() {
- let hash = MurmurHash_1.MurmurHash.initialize();
- for (let I of this._intervals) {
- hash = MurmurHash_1.MurmurHash.update(hash, I.a);
- hash = MurmurHash_1.MurmurHash.update(hash, I.b);
- }
- hash = MurmurHash_1.MurmurHash.finish(hash, this._intervals.length * 2);
- return hash;
- }
- /** Are two IntervalSets equal? Because all intervals are sorted
- * and disjoint, equals is a simple linear walk over both lists
- * to make sure they are the same. Interval.equals() is used
- * by the List.equals() method to check the ranges.
- */
- equals(o) {
- if (o == null || !(o instanceof IntervalSet)) {
- return false;
- }
- return ArrayEqualityComparator_1.ArrayEqualityComparator.INSTANCE.equals(this._intervals, o._intervals);
- }
- toString(elemAreChar = false) {
- let buf = "";
- if (this._intervals == null || this._intervals.length === 0) {
- return "{}";
- }
- if (this.size > 1) {
- buf += "{";
- }
- let first = true;
- for (let I of this._intervals) {
- if (first) {
- first = false;
- }
- else {
- buf += ", ";
- }
- let a = I.a;
- let b = I.b;
- if (a === b) {
- if (a == Token_1.Token.EOF) {
- buf += "";
- }
- else if (elemAreChar) {
- buf += "'" + String.fromCharCode(a) + "'";
- }
- else {
- buf += a;
- }
- }
- else {
- if (elemAreChar) {
- buf += "'" + String.fromCharCode(a) + "'..'" + String.fromCharCode(b) + "'";
- }
- else {
- buf += a + ".." + b;
- }
- }
- }
- if (this.size > 1) {
- buf += "}";
- }
- return buf;
- }
- toStringVocabulary(vocabulary) {
- if (this._intervals == null || this._intervals.length === 0) {
- return "{}";
- }
- let buf = "";
- if (this.size > 1) {
- buf += "{";
- }
- let first = true;
- for (let I of this._intervals) {
- if (first) {
- first = false;
- }
- else {
- buf += ", ";
- }
- let a = I.a;
- let b = I.b;
- if (a === b) {
- buf += this.elementName(vocabulary, a);
- }
- else {
- for (let i = a; i <= b; i++) {
- if (i > a) {
- buf += ", ";
- }
- buf += this.elementName(vocabulary, i);
- }
- }
- }
- if (this.size > 1) {
- buf += "}";
- }
- return buf;
- }
- elementName(vocabulary, a) {
- if (a === Token_1.Token.EOF) {
- return "";
- }
- else if (a === Token_1.Token.EPSILON) {
- return "";
- }
- else {
- return vocabulary.getDisplayName(a);
- }
- }
- get size() {
- let n = 0;
- let numIntervals = this._intervals.length;
- if (numIntervals == 1) {
- let firstInterval = this._intervals[0];
- return firstInterval.b - firstInterval.a + 1;
- }
- for (let i = 0; i < numIntervals; i++) {
- let I = this._intervals[i];
- n += (I.b - I.a + 1);
- }
- return n;
- }
- toIntegerList() {
- let values = new IntegerList_1.IntegerList(this.size);
- let n = this._intervals.length;
- for (let i = 0; i < n; i++) {
- let I = this._intervals[i];
- let a = I.a;
- let b = I.b;
- for (let v = a; v <= b; v++) {
- values.add(v);
- }
- }
- return values;
- }
- toList() {
- let values = new Array();
- let n = this._intervals.length;
- for (let i = 0; i < n; i++) {
- let I = this._intervals[i];
- let a = I.a;
- let b = I.b;
- for (let v = a; v <= b; v++) {
- values.push(v);
- }
- }
- return values;
- }
- toSet() {
- let s = new Set();
- for (let I of this._intervals) {
- let a = I.a;
- let b = I.b;
- for (let v = a; v <= b; v++) {
- s.add(v);
- }
- }
- return s;
- }
- toArray() {
- return this.toList();
- }
- remove(el) {
- if (this.readonly) {
- throw new Error("can't alter readonly IntervalSet");
- }
- let n = this._intervals.length;
- for (let i = 0; i < n; i++) {
- let I = this._intervals[i];
- let a = I.a;
- let b = I.b;
- if (el < a) {
- break; // list is sorted and el is before this interval; not here
- }
- // if whole interval x..x, rm
- if (el === a && el === b) {
- this._intervals.splice(i, 1);
- break;
- }
- // if on left edge x..b, adjust left
- if (el === a) {
- this._intervals[i] = Interval_1.Interval.of(I.a + 1, I.b);
- break;
- }
- // if on right edge a..x, adjust right
- if (el === b) {
- this._intervals[i] = Interval_1.Interval.of(I.a, I.b - 1);
- break;
- }
- // if in middle a..x..b, split interval
- if (el > a && el < b) {
- let oldb = I.b;
- this._intervals[i] = Interval_1.Interval.of(I.a, el - 1); // [a..x-1]
- this.add(el + 1, oldb); // add [x+1..b]
- }
- }
- }
- get isReadonly() {
- return this.readonly;
- }
- setReadonly(readonly) {
- if (this.readonly && !readonly) {
- throw new Error("can't alter readonly IntervalSet");
- }
- this.readonly = readonly;
- }
-}
-__decorate([
- Decorators_1.Override
-], IntervalSet.prototype, "addAll", null);
-__decorate([
- Decorators_1.Override
-], IntervalSet.prototype, "complement", null);
-__decorate([
- Decorators_1.Override
-], IntervalSet.prototype, "subtract", null);
-__decorate([
- Decorators_1.Override
-], IntervalSet.prototype, "or", null);
-__decorate([
- Decorators_1.Override
-], IntervalSet.prototype, "and", null);
-__decorate([
- Decorators_1.Override
-], IntervalSet.prototype, "contains", null);
-__decorate([
- Decorators_1.Override
-], IntervalSet.prototype, "isNil", null);
-__decorate([
- Decorators_1.Override
-], IntervalSet.prototype, "getSingleElement", null);
-__decorate([
- Decorators_1.Override
-], IntervalSet.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], IntervalSet.prototype, "equals", null);
-__decorate([
- __param(0, Decorators_1.NotNull)
-], IntervalSet.prototype, "toStringVocabulary", null);
-__decorate([
- Decorators_1.NotNull,
- __param(0, Decorators_1.NotNull)
-], IntervalSet.prototype, "elementName", null);
-__decorate([
- Decorators_1.Override
-], IntervalSet.prototype, "size", null);
-__decorate([
- Decorators_1.Override
-], IntervalSet.prototype, "toList", null);
-__decorate([
- Decorators_1.Override
-], IntervalSet.prototype, "remove", null);
-__decorate([
- Decorators_1.NotNull
-], IntervalSet, "of", null);
-__decorate([
- Decorators_1.NotNull
-], IntervalSet, "subtract", null);
-exports.IntervalSet = IntervalSet;
-//# sourceMappingURL=IntervalSet.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/IntervalSet.js.map b/node_modules/antlr4ts/misc/IntervalSet.js.map
deleted file mode 100644
index 1d84bc8..0000000
--- a/node_modules/antlr4ts/misc/IntervalSet.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"IntervalSet.js","sourceRoot":"","sources":["../../../src/misc/IntervalSet.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;AAEH,wDAAwD;AAExD,uEAAoE;AACpE,+CAA4C;AAC5C,yCAAsC;AAEtC,oCAAiC;AACjC,6CAA0C;AAC1C,8CAAkD;AAClD,oCAAiC;AAGjC;;;;;;;;;;;GAWG;AACH;IA0BC,YAAY,SAAsB;QAF1B,aAAQ,GAAY,KAAK,CAAC;QAGjC,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC;YACvB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QACtB,CAAC;IACF,CAAC;IA9BD,MAAM,KAAK,iBAAiB;QAC3B,EAAE,CAAC,CAAC,WAAW,CAAC,kBAAkB,KAAK,SAAS,CAAC,CAAC,CAAC;YAClD,WAAW,CAAC,kBAAkB,GAAG,WAAW,CAAC,EAAE,CAAC,aAAK,CAAC,cAAc,EAAE,aAAK,CAAC,cAAc,CAAC,CAAC;YAC5F,WAAW,CAAC,kBAAkB,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAClD,CAAC;QAED,MAAM,CAAC,WAAW,CAAC,kBAAkB,CAAC;IACvC,CAAC;IAGD,MAAM,KAAK,SAAS;QACnB,EAAE,CAAC,CAAC,WAAW,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC;YACpC,WAAW,CAAC,UAAU,GAAG,IAAI,WAAW,EAAE,CAAC;YAC3C,WAAW,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC;QAED,MAAM,CAAC,WAAW,CAAC,UAAU,CAAC;IAC/B,CAAC;IAeD;;;OAGG;IAEH,MAAM,CAAC,EAAE,CAAC,CAAS,EAAE,IAAY,CAAC;QACjC,IAAI,CAAC,GAAgB,IAAI,WAAW,EAAE,CAAC;QACvC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACZ,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAED,KAAK;QACJ,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACrD,CAAC;QAED,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED;;;;;;OAMG;IACH,GAAG,CAAC,CAAS,EAAE,IAAY,CAAC;QAC3B,IAAI,CAAC,QAAQ,CAAC,mBAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,gEAAgE;IACtD,QAAQ,CAAC,QAAkB;QACpC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACrD,CAAC;QAED,kEAAkE;QAClE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC;QACR,CAAC;QAED,wBAAwB;QACxB,2CAA2C;QAC3C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzD,IAAI,CAAC,GAAa,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,EAAE,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxB,MAAM,CAAC;YACR,CAAC;YAED,EAAE,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACnD,oDAAoD;gBACpD,IAAI,MAAM,GAAa,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACzC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;gBAC5B,mDAAmD;gBACnD,8CAA8C;gBAC9C,OAAO,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACvC,CAAC,EAAE,CAAC;oBACJ,IAAI,IAAI,GAAa,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;oBACxC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBACrD,KAAK,CAAC;oBACP,CAAC;oBAED,+CAA+C;oBAC/C,kBAAkB;oBAClB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC7B,CAAC,EAAE,CAAC;oBACJ,qCAAqC;oBACrC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;oBACxC,uBAAuB;gBACxB,CAAC;gBAED,0DAA0D;gBAC1D,MAAM,CAAC;YACR,CAAC;YAED,EAAE,CAAC,CAAC,QAAQ,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtC,kBAAkB;gBAClB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;gBACvC,MAAM,CAAC;YACR,CAAC;YAED,6DAA6D;QAC9D,CAAC;QAED,oEAAoE;QACpE,cAAc;QACd,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IAED,4DAA4D;IAC5D,MAAM,CAAC,EAAE,CAAC,IAAmB;QAC5B,IAAI,CAAC,GAAgB,IAAI,WAAW,EAAE,CAAC;QACvC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YACpB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACb,CAAC;QAED,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAGD,MAAM,CAAC,GAAW;QACjB,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAED,EAAE,CAAC,CAAC,GAAG,YAAY,WAAW,CAAC,CAAC,CAAC;YAChC,IAAI,KAAK,GAAgB,GAAG,CAAC;YAC7B,iCAAiC;YACjC,IAAI,CAAC,GAAW,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC;YACxC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5B,IAAI,CAAC,GAAa,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBACtC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC;QACF,CAAC;QACD,IAAI,CAAC,CAAC;YACL,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBAChC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACjB,CAAC;QACF,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAED,eAAe,CAAC,UAAkB,EAAE,UAAkB;QACrD,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC;IAChE,CAAC;IAED,oBAAoB;IAEpB,UAAU,CAAC,UAAkB;QAC5B,EAAE,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC;YACtB,kCAAkC;YAClC,MAAM,CAAC,WAAW,CAAC,SAAS,CAAC;QAC9B,CAAC;QAED,IAAI,YAAyB,CAAC;QAC9B,EAAE,CAAC,CAAC,UAAU,YAAY,WAAW,CAAC,CAAC,CAAC;YACvC,YAAY,GAAG,UAAU,CAAC;QAC3B,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,YAAY,GAAG,IAAI,WAAW,EAAE,CAAC;YACjC,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QACjC,CAAC;QAED,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAGD,QAAQ,CAAC,CAAS;QACjB,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACzC,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,YAAY,WAAW,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACtC,CAAC;QAED,IAAI,KAAK,GAAgB,IAAI,WAAW,EAAE,CAAC;QAC3C,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChB,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC1C,CAAC;IAED;;;OAGG;IAEH,MAAM,CAAC,QAAQ,CAAC,IAAiB,EAAE,KAAkB;QACpD,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC1B,CAAC;QAED,IAAI,MAAM,GAAgB,IAAI,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC3D,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACjB,qEAAqE;YACrE,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAED,IAAI,OAAO,GAAW,CAAC,CAAC;QACxB,IAAI,MAAM,GAAW,CAAC,CAAC;QACvB,OAAO,OAAO,GAAG,MAAM,CAAC,UAAU,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;YAC/E,IAAI,cAAc,GAAa,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAC1D,IAAI,aAAa,GAAa,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAEvD,iEAAiE;YAEjE,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,EAAE,CAAC;gBACT,QAAQ,CAAC;YACV,CAAC;YAED,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxC,OAAO,EAAE,CAAC;gBACV,QAAQ,CAAC;YACV,CAAC;YAED,IAAI,aAAmC,CAAC;YACxC,IAAI,YAAkC,CAAC;YACvC,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxC,aAAa,GAAG,IAAI,mBAAQ,CAAC,cAAc,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACrE,CAAC;YAED,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxC,YAAY,GAAG,IAAI,mBAAQ,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;YACpE,CAAC;YAED,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC;gBACnB,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;oBAClB,sCAAsC;oBACtC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,aAAa,CAAC;oBAC3C,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;oBACvD,OAAO,EAAE,CAAC;oBACV,MAAM,EAAE,CAAC;oBACT,QAAQ,CAAC;gBACV,CAAC;gBACD,IAAI,CAAC,CAAC;oBACL,+BAA+B;oBAC/B,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,aAAa,CAAC;oBAC3C,OAAO,EAAE,CAAC;oBACV,QAAQ,CAAC;gBACV,CAAC;YACF,CAAC;YACD,IAAI,CAAC,CAAC;gBACL,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;oBAClB,+BAA+B;oBAC/B,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,YAAY,CAAC;oBAC1C,MAAM,EAAE,CAAC;oBACT,QAAQ,CAAC;gBACV,CAAC;gBACD,IAAI,CAAC,CAAC;oBACL,kEAAkE;oBAClE,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;oBACrC,QAAQ,CAAC;gBACV,CAAC;YACF,CAAC;QACF,CAAC;QAED,qFAAqF;QACrF,uFAAuF;QACvF,2BAA2B;QAC3B,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAGD,EAAE,CAAC,CAAS;QACX,IAAI,CAAC,GAAgB,IAAI,WAAW,EAAE,CAAC;QACvC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACf,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACZ,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAED,oBAAoB;IAEpB,GAAG,CAAC,KAAa;QAChB,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACjB,kCAAkC;YAClC,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC1B,CAAC;QAED,IAAI,WAAW,GAAe,IAAI,CAAC,UAAU,CAAC;QAC9C,IAAI,cAAc,GAAgB,KAAqB,CAAC,UAAU,CAAC;QACnE,IAAI,YAAqC,CAAC;QAC1C,IAAI,MAAM,GAAW,WAAW,CAAC,MAAM,CAAC;QACxC,IAAI,SAAS,GAAW,cAAc,CAAC,MAAM,CAAC;QAC9C,IAAI,CAAC,GAAW,CAAC,CAAC;QAClB,IAAI,CAAC,GAAW,CAAC,CAAC;QAClB,qEAAqE;QACrE,OAAO,CAAC,GAAG,MAAM,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC;YACpC,IAAI,IAAI,GAAa,WAAW,CAAC,CAAC,CAAC,CAAC;YACpC,IAAI,MAAM,GAAa,cAAc,CAAC,CAAC,CAAC,CAAC;YACzC,yDAAyD;YACzD,EAAE,CAAC,CAAC,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACvC,6DAA6D;gBAC7D,CAAC,EAAE,CAAC;YACL,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC5C,8DAA8D;gBAC9D,CAAC,EAAE,CAAC;YACL,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,6CAA6C;gBAC7C,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;oBACnB,YAAY,GAAG,IAAI,WAAW,EAAE,CAAC;gBAClC,CAAC;gBAED,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;gBACjD,CAAC,EAAE,CAAC;YACL,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACxC,2CAA2C;gBAC3C,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;oBACnB,YAAY,GAAG,IAAI,WAAW,EAAE,CAAC;gBAClC,CAAC;gBAED,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;gBACjD,CAAC,EAAE,CAAC;YACL,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACjC,4BAA4B;gBAC5B,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;oBACnB,YAAY,GAAG,IAAI,WAAW,EAAE,CAAC;gBAClC,CAAC;gBAED,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;gBACjD,mDAAmD;gBACnD,+DAA+D;gBAC/D,mDAAmD;gBACnD,4DAA4D;gBAC5D,2DAA2D;gBAC3D,eAAe;gBACf,qCAAqC;gBACrC,EAAE,CAAC,CAAC,IAAI,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBACzC,CAAC,EAAE,CAAC;gBACL,CAAC;gBACD,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAC9C,CAAC,EAAE,CAAC;gBACL,CAAC;YACF,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;YACnB,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC1B,CAAC;QAED,MAAM,CAAC,YAAY,CAAC;IACrB,CAAC;IAED,oBAAoB;IAEpB,QAAQ,CAAC,EAAU;QAClB,IAAI,CAAC,GAAW,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QACvC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,CAAC,GAAa,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,CAAC,GAAW,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,GAAW,CAAC,CAAC,CAAC,CAAC;YACpB,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;gBACZ,0DAA0D;gBAC1D,KAAK,CAAC;YACP,CAAC;YACD,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;gBACxB,yBAAyB;gBACzB,MAAM,CAAC,IAAI,CAAC;YACb,CAAC;QACF,CAAC;QACD,MAAM,CAAC,KAAK,CAAC;QACb;;;;;;;;;;;kBAWI;IACL,CAAC;IAED,oBAAoB;IAEpB,IAAI,KAAK;QACR,MAAM,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC;IAChE,CAAC;IAED,oBAAoB;IAEpB,gBAAgB;QACf,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;YAC7D,IAAI,CAAC,GAAa,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjB,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACZ,CAAC;QACF,CAAC;QAED,MAAM,CAAC,aAAK,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;;;;OAKG;IACH,IAAI,UAAU;QACb,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,aAAK,CAAC,YAAY,CAAC;QAC3B,CAAC;QAED,IAAI,IAAI,GAAa,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACH,IAAI,UAAU;QACb,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,aAAK,CAAC,YAAY,CAAC;QAC3B,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,yCAAyC;IACzC,IAAI,SAAS;QACZ,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC;IACxB,CAAC;IAGD,QAAQ;QACP,IAAI,IAAI,GAAW,uBAAU,CAAC,UAAU,EAAE,CAAC;QAC3C,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YAC/B,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACpC,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC;QAED,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC3D,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAED;;;;OAIM;IAEN,MAAM,CAAC,CAAM;QACZ,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,WAAW,CAAC,CAAC,CAAC,CAAC;YAC9C,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,iDAAuB,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC;IAC/E,CAAC;IAED,QAAQ,CAAC,cAAuB,KAAK;QACpC,IAAI,GAAG,GAAW,EAAE,CAAC;QACrB,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;YAC7D,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAED,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;YACnB,GAAG,IAAI,GAAG,CAAC;QACZ,CAAC;QAED,IAAI,KAAK,GAAY,IAAI,CAAC;QAC1B,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YAC/B,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBACX,KAAK,GAAG,KAAK,CAAC;YACf,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,GAAG,IAAI,IAAI,CAAC;YACb,CAAC;YAED,IAAI,CAAC,GAAW,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,GAAW,CAAC,CAAC,CAAC,CAAC;YACpB,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACb,EAAE,CAAC,CAAC,CAAC,IAAI,aAAK,CAAC,GAAG,CAAC,CAAC,CAAC;oBACpB,GAAG,IAAI,OAAO,CAAC;gBAChB,CAAC;gBAAC,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;oBACxB,GAAG,IAAI,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBAC3C,CAAC;gBAAC,IAAI,CAAC,CAAC;oBACP,GAAG,IAAI,CAAC,CAAC;gBACV,CAAC;YACF,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;oBACjB,GAAG,IAAI,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBAC7E,CAAC;gBAAC,IAAI,CAAC,CAAC;oBACP,GAAG,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;gBACrB,CAAC;YACF,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;YACnB,GAAG,IAAI,GAAG,CAAC;QACZ,CAAC;QAED,MAAM,CAAC,GAAG,CAAC;IACZ,CAAC;IAED,kBAAkB,CAAW,UAAsB;QAClD,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;YAC7D,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAED,IAAI,GAAG,GAAW,EAAE,CAAC;QACrB,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;YACnB,GAAG,IAAI,GAAG,CAAC;QACZ,CAAC;QAED,IAAI,KAAK,GAAY,IAAI,CAAC;QAC1B,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YAC/B,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBACX,KAAK,GAAG,KAAK,CAAC;YACf,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,GAAG,IAAI,IAAI,CAAC;YACb,CAAC;YAED,IAAI,CAAC,GAAW,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,GAAW,CAAC,CAAC,CAAC,CAAC;YACpB,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACb,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;YACxC,CAAC;YAAC,IAAI,CAAC,CAAC;gBACP,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;wBACX,GAAG,IAAI,IAAI,CAAC;oBACb,CAAC;oBAED,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;gBACxC,CAAC;YACF,CAAC;QACF,CAAC;QAED,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;YACnB,GAAG,IAAI,GAAG,CAAC;QACZ,CAAC;QAED,MAAM,CAAC,GAAG,CAAC;IACZ,CAAC;IAGS,WAAW,CAAW,UAAsB,EAAE,CAAS;QAChE,EAAE,CAAC,CAAC,CAAC,KAAK,aAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YACrB,MAAM,CAAC,OAAO,CAAC;QAChB,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,aAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC;QACpB,CAAC;QAAC,IAAI,CAAC,CAAC;YACP,MAAM,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC;IACF,CAAC;IAGD,IAAI,IAAI;QACP,IAAI,CAAC,GAAW,CAAC,CAAC;QAClB,IAAI,YAAY,GAAW,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAClD,EAAE,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,aAAa,GAAa,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACjD,MAAM,CAAC,aAAa,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC;QAC9C,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,GAAa,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtB,CAAC;QAED,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAED,aAAa;QACZ,IAAI,MAAM,GAAgB,IAAI,yBAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrD,IAAI,CAAC,GAAW,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QACvC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,CAAC,GAAa,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,CAAC,GAAW,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,GAAW,CAAC,CAAC,CAAC,CAAC;YACpB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACf,CAAC;QACF,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAGD,MAAM;QACL,IAAI,MAAM,GAAa,IAAI,KAAK,EAAU,CAAC;QAC3C,IAAI,CAAC,GAAW,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QACvC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,CAAC,GAAa,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,CAAC,GAAW,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,GAAW,CAAC,CAAC,CAAC,CAAC;YACpB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;QACF,CAAC;QAED,MAAM,CAAC,MAAM,CAAC;IACf,CAAC;IAED,KAAK;QACJ,IAAI,CAAC,GAAgB,IAAI,GAAG,EAAU,CAAC;QACvC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,GAAW,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,GAAW,CAAC,CAAC,CAAC,CAAC;YACpB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACV,CAAC;QACF,CAAC;QAED,MAAM,CAAC,CAAC,CAAC;IACV,CAAC;IAED,OAAO;QACN,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;IACtB,CAAC;IAGD,MAAM,CAAC,EAAU;QAChB,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACrD,CAAC;QAED,IAAI,CAAC,GAAW,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QACvC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,CAAC,GAAa,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,CAAC,GAAW,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,GAAW,CAAC,CAAC,CAAC,CAAC;YACpB,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;gBACZ,KAAK,CAAC,CAAC,0DAA0D;YAClE,CAAC;YACD,6BAA6B;YAC7B,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC1B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC7B,KAAK,CAAC;YACP,CAAC;YACD,oCAAoC;YACpC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;gBACd,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,mBAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/C,KAAK,CAAC;YACP,CAAC;YACD,sCAAsC;YACtC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;gBACd,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,mBAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/C,KAAK,CAAC;YACP,CAAC;YACD,uCAAuC;YACvC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;gBACtB,IAAI,IAAI,GAAW,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,mBAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW;gBAC1D,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,eAAe;YACxC,CAAC;QACF,CAAC;IACF,CAAC;IAED,IAAI,UAAU;QACb,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC;IACtB,CAAC;IAED,WAAW,CAAC,QAAiB;QAC5B,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAChC,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACrD,CAAC;QAED,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC1B,CAAC;CACD;AAliBA;IADC,qBAAQ;yCAsBR;AAQD;IADC,qBAAQ;6CAgBR;AAGD;IADC,qBAAQ;2CAaR;AAoFD;IADC,qBAAQ;qCAMR;AAID;IADC,qBAAQ;sCAyER;AAID;IADC,qBAAQ;2CA6BR;AAID;IADC,qBAAQ;wCAGR;AAID;IADC,qBAAQ;mDAUR;AAqCD;IADC,qBAAQ;2CAUR;AAQD;IADC,qBAAQ;yCAOR;AA8CD;IAAqB,WAAA,oBAAO,CAAA;qDAsC3B;AAGD;IADC,oBAAO;IACgB,WAAA,oBAAO,CAAA;8CAQ9B;AAGD;IADC,qBAAQ;uCAeR;AAkBD;IADC,qBAAQ;yCAcR;AAoBD;IADC,qBAAQ;yCAoCR;AApnBD;IADC,oBAAO;2BAKP;AA6JD;IADC,oBAAO;iCA2EP;AAlRF,kCAwqBC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/MultiMap.d.ts b/node_modules/antlr4ts/misc/MultiMap.d.ts
deleted file mode 100644
index 16833f5..0000000
--- a/node_modules/antlr4ts/misc/MultiMap.d.ts
+++ /dev/null
@@ -1,9 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-export declare class MultiMap extends Map {
- constructor();
- map(key: K, value: V): void;
- getPairs(): [K, V][];
-}
diff --git a/node_modules/antlr4ts/misc/MultiMap.js b/node_modules/antlr4ts/misc/MultiMap.js
deleted file mode 100644
index 6da3928..0000000
--- a/node_modules/antlr4ts/misc/MultiMap.js
+++ /dev/null
@@ -1,31 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:42.1346951-07:00
-class MultiMap extends Map {
- constructor() {
- super();
- }
- map(key, value) {
- let elementsForKey = super.get(key);
- if (!elementsForKey) {
- elementsForKey = [];
- super.set(key, elementsForKey);
- }
- elementsForKey.push(value);
- }
- getPairs() {
- let pairs = [];
- this.forEach((values, key) => {
- values.forEach(v => {
- pairs.push([key, v]);
- });
- });
- return pairs;
- }
-}
-exports.MultiMap = MultiMap;
-//# sourceMappingURL=MultiMap.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/MultiMap.js.map b/node_modules/antlr4ts/misc/MultiMap.js.map
deleted file mode 100644
index 5cb506f..0000000
--- a/node_modules/antlr4ts/misc/MultiMap.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"MultiMap.js","sourceRoot":"","sources":["../../../src/misc/MultiMap.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,wDAAwD;AAExD,cAA4B,SAAQ,GAAW;IAC9C;QACC,KAAK,EAAE,CAAC;IACT,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QACnB,IAAI,cAAc,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;YACrB,cAAc,GAAG,EAAS,CAAC;YAC3B,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,cAAc,CAAC,CAAC;QAChC,CAAC;QACD,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,QAAQ;QACP,IAAI,KAAK,GAAa,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,CAAC,MAAW,EAAE,GAAM;YAChC,MAAM,CAAC,OAAO,CAAC,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;YACrB,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC;IACd,CAAC;CACD;AAvBD,4BAuBC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/MurmurHash.d.ts b/node_modules/antlr4ts/misc/MurmurHash.d.ts
deleted file mode 100644
index 75e843a..0000000
--- a/node_modules/antlr4ts/misc/MurmurHash.d.ts
+++ /dev/null
@@ -1,45 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Equatable } from './Stubs';
-/**
- *
- * @author Sam Harwell
- */
-export declare namespace MurmurHash {
- /**
- * Initialize the hash using the specified {@code seed}.
- *
- * @param seed the seed (optional)
- * @return the intermediate hash value
- */
- function initialize(seed?: number): number;
- /**
- * Update the intermediate hash value for the next input {@code value}.
- *
- * @param hash the intermediate hash value
- * @param value the value to add to the current hash
- * @return the updated intermediate hash value
- */
- function update(hash: number, value: number | string | Equatable | null | undefined): number;
- /**
- * Apply the final computation steps to the intermediate value {@code hash}
- * to form the final result of the MurmurHash 3 hash function.
- *
- * @param hash the intermediate hash value
- * @param numberOfWords the number of integer values added to the hash
- * @return the final hash result
- */
- function finish(hash: number, numberOfWords: number): number;
- /**
- * Utility function to compute the hash code of an array using the
- * MurmurHash algorithm.
- *
- * @param the array element type
- * @param data the array data
- * @param seed the seed for the MurmurHash algorithm
- * @return the hash code of the data
- */
- function hashCode(data: Iterable, seed?: number): number;
-}
diff --git a/node_modules/antlr4ts/misc/MurmurHash.js b/node_modules/antlr4ts/misc/MurmurHash.js
deleted file mode 100644
index 8dbccb6..0000000
--- a/node_modules/antlr4ts/misc/MurmurHash.js
+++ /dev/null
@@ -1,113 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-/**
- *
- * @author Sam Harwell
- */
-var MurmurHash;
-(function (MurmurHash) {
- const DEFAULT_SEED = 0;
- /**
- * Initialize the hash using the specified {@code seed}.
- *
- * @param seed the seed (optional)
- * @return the intermediate hash value
- */
- function initialize(seed = DEFAULT_SEED) {
- return seed;
- }
- MurmurHash.initialize = initialize;
- /**
- * Update the intermediate hash value for the next input {@code value}.
- *
- * @param hash the intermediate hash value
- * @param value the value to add to the current hash
- * @return the updated intermediate hash value
- */
- function update(hash, value) {
- const c1 = 0xCC9E2D51;
- const c2 = 0x1B873593;
- const r1 = 15;
- const r2 = 13;
- const m = 5;
- const n = 0xE6546B64;
- if (value == null) {
- value = 0;
- }
- else if (typeof value === 'string') {
- value = hashString(value);
- }
- else if (typeof value === 'object') {
- value = value.hashCode();
- }
- let k = value;
- k = Math.imul(k, c1);
- k = (k << r1) | (k >>> (32 - r1));
- k = Math.imul(k, c2);
- hash = hash ^ k;
- hash = (hash << r2) | (hash >>> (32 - r2));
- hash = Math.imul(hash, m) + n;
- return hash & 0xFFFFFFFF;
- }
- MurmurHash.update = update;
- /**
- * Apply the final computation steps to the intermediate value {@code hash}
- * to form the final result of the MurmurHash 3 hash function.
- *
- * @param hash the intermediate hash value
- * @param numberOfWords the number of integer values added to the hash
- * @return the final hash result
- */
- function finish(hash, numberOfWords) {
- hash = hash ^ (numberOfWords * 4);
- hash = hash ^ (hash >>> 16);
- hash = Math.imul(hash, 0x85EBCA6B);
- hash = hash ^ (hash >>> 13);
- hash = Math.imul(hash, 0xC2B2AE35);
- hash = hash ^ (hash >>> 16);
- return hash;
- }
- MurmurHash.finish = finish;
- /**
- * Utility function to compute the hash code of an array using the
- * MurmurHash algorithm.
- *
- * @param the array element type
- * @param data the array data
- * @param seed the seed for the MurmurHash algorithm
- * @return the hash code of the data
- */
- function hashCode(data, seed = DEFAULT_SEED) {
- let hash = initialize(seed);
- let length = 0;
- for (let value of data) {
- hash = update(hash, value);
- length++;
- }
- hash = finish(hash, length);
- return hash;
- }
- MurmurHash.hashCode = hashCode;
- /**
- * Function to hash a string. Based on the implementation found here:
- * http://stackoverflow.com/a/7616484
- */
- function hashString(str) {
- let len = str.length;
- if (len === 0) {
- return 0;
- }
- let hash = 0;
- for (let i = 0; i < len; i++) {
- let c = str.charCodeAt(i);
- hash = (((hash << 5) >>> 0) - hash) + c;
- hash |= 0;
- }
- return hash;
- }
-})(MurmurHash = exports.MurmurHash || (exports.MurmurHash = {}));
-//# sourceMappingURL=MurmurHash.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/MurmurHash.js.map b/node_modules/antlr4ts/misc/MurmurHash.js.map
deleted file mode 100644
index aa1dfc2..0000000
--- a/node_modules/antlr4ts/misc/MurmurHash.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"MurmurHash.js","sourceRoot":"","sources":["../../../src/misc/MurmurHash.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAKH;;;GAGG;AAEH,IAAiB,UAAU,CA4G1B;AA5GD,WAAiB,UAAU;IAE1B,MAAM,YAAY,GAAW,CAAC,CAAC;IAE/B;;;;;OAKG;IACH,oBAA2B,OAAe,YAAY;QACrD,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAFe,qBAAU,aAEzB,CAAA;IAED;;;;;;OAMG;IACH,gBAAuB,IAAY,EAAE,KAAqD;QACzF,MAAM,EAAE,GAAW,UAAU,CAAC;QAC9B,MAAM,EAAE,GAAW,UAAU,CAAC;QAC9B,MAAM,EAAE,GAAW,EAAE,CAAC;QACtB,MAAM,EAAE,GAAW,EAAE,CAAC;QACtB,MAAM,CAAC,GAAW,CAAC,CAAC;QACpB,MAAM,CAAC,GAAW,UAAU,CAAC;QAE7B,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC;YACnB,KAAK,GAAG,CAAC,CAAC;QACX,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC;YACtC,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC3B,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC;YACtC,KAAK,GAAI,KAAmB,CAAC,QAAQ,EAAE,CAAC;QACzC,CAAC;QAED,IAAI,CAAC,GAAW,KAAK,CAAC;QACtB,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACrB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAErB,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC;QAChB,IAAI,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QAC3C,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAE9B,MAAM,CAAC,IAAI,GAAG,UAAU,CAAC;IAC1B,CAAC;IA1Be,iBAAM,SA0BrB,CAAA;IAGD;;;;;;;OAOG;IACH,gBAAuB,IAAY,EAAE,aAAqB;QACzD,IAAI,GAAG,IAAI,GAAG,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;QAClC,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC;QAC5B,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QACnC,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC;QAC5B,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QACnC,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IARe,iBAAM,SAQrB,CAAA;IAED;;;;;;;;OAQG;IACH,kBAAgE,IAAiB,EAAE,OAAe,YAAY;QAC7G,IAAI,IAAI,GAAW,UAAU,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC;YACxB,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC3B,MAAM,EAAE,CAAC;QACV,CAAC;QAED,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;IAVe,mBAAQ,WAUvB,CAAA;IAED;;;OAGG;IACH,oBAAoB,GAAW;QAC9B,IAAI,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC;QACrB,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,CAAC,CAAC;QACV,CAAC;QAED,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YACxC,IAAI,IAAI,CAAC,CAAC;QACX,CAAC;QAED,MAAM,CAAC,IAAI,CAAC;IACb,CAAC;AACF,CAAC,EA5GgB,UAAU,GAAV,kBAAU,KAAV,kBAAU,QA4G1B"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/ObjectEqualityComparator.d.ts b/node_modules/antlr4ts/misc/ObjectEqualityComparator.d.ts
deleted file mode 100644
index 5c9c1bd..0000000
--- a/node_modules/antlr4ts/misc/ObjectEqualityComparator.d.ts
+++ /dev/null
@@ -1,32 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { EqualityComparator } from './EqualityComparator';
-import { Equatable } from './Stubs';
-/**
- * This default implementation of {@link EqualityComparator} uses object equality
- * for comparisons by calling {@link Object#hashCode} and {@link Object#equals}.
- *
- * @author Sam Harwell
- */
-export declare class ObjectEqualityComparator implements EqualityComparator {
- static readonly INSTANCE: ObjectEqualityComparator;
- /**
- * {@inheritDoc}
- *
- * This implementation returns
- * {@code obj.}{@link Object#hashCode hashCode()}.
- */
- hashCode(obj: Equatable | null | undefined): number;
- /**
- * {@inheritDoc}
- *
- * This implementation relies on object equality. If both objects are
- * {@code null}, this method returns {@code true}. Otherwise if only
- * {@code a} is {@code null}, this method returns {@code false}. Otherwise,
- * this method returns the result of
- * {@code a.}{@link Object#equals equals}{@code (b)}.
- */
- equals(a: Equatable | null | undefined, b: Equatable | null | undefined): boolean;
-}
diff --git a/node_modules/antlr4ts/misc/ObjectEqualityComparator.js b/node_modules/antlr4ts/misc/ObjectEqualityComparator.js
deleted file mode 100644
index bc55c29..0000000
--- a/node_modules/antlr4ts/misc/ObjectEqualityComparator.js
+++ /dev/null
@@ -1,57 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
- var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
- if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
- else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
- return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const Decorators_1 = require("../Decorators");
-/**
- * This default implementation of {@link EqualityComparator} uses object equality
- * for comparisons by calling {@link Object#hashCode} and {@link Object#equals}.
- *
- * @author Sam Harwell
- */
-class ObjectEqualityComparator {
- /**
- * {@inheritDoc}
- *
- * This implementation returns
- * {@code obj.}{@link Object#hashCode hashCode()}.
- */
- hashCode(obj) {
- if (obj == null) {
- return 0;
- }
- return obj.hashCode();
- }
- /**
- * {@inheritDoc}
- *
- * This implementation relies on object equality. If both objects are
- * {@code null}, this method returns {@code true}. Otherwise if only
- * {@code a} is {@code null}, this method returns {@code false}. Otherwise,
- * this method returns the result of
- * {@code a.}{@link Object#equals equals}{@code (b)}.
- */
- equals(a, b) {
- if (a == null) {
- return b == null;
- }
- return a.equals(b);
- }
-}
-ObjectEqualityComparator.INSTANCE = new ObjectEqualityComparator();
-__decorate([
- Decorators_1.Override
-], ObjectEqualityComparator.prototype, "hashCode", null);
-__decorate([
- Decorators_1.Override
-], ObjectEqualityComparator.prototype, "equals", null);
-exports.ObjectEqualityComparator = ObjectEqualityComparator;
-//# sourceMappingURL=ObjectEqualityComparator.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/ObjectEqualityComparator.js.map b/node_modules/antlr4ts/misc/ObjectEqualityComparator.js.map
deleted file mode 100644
index 2dcb3d3..0000000
--- a/node_modules/antlr4ts/misc/ObjectEqualityComparator.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ObjectEqualityComparator.js","sourceRoot":"","sources":["../../../src/misc/ObjectEqualityComparator.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;AAIH,8CAAyC;AAGzC;;;;;GAKG;AACH;IAGC;;;;;OAKG;IAEH,QAAQ,CAAC,GAAiC;QACzC,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,CAAC,CAAC;QACV,CAAC;QAED,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IACvB,CAAC;IAED;;;;;;;;OAQG;IAEH,MAAM,CAAC,CAA+B,EAAE,CAA+B;QACtE,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,CAAC,IAAI,IAAI,CAAC;QAClB,CAAC;QAED,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC;;AAjCe,iCAAQ,GAA6B,IAAI,wBAAwB,EAAE,CAAC;AASpF;IADC,qBAAQ;wDAOR;AAYD;IADC,qBAAQ;sDAOR;AAlCF,4DAoCC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/ParseCancellationException.d.ts b/node_modules/antlr4ts/misc/ParseCancellationException.d.ts
deleted file mode 100644
index 38416d2..0000000
--- a/node_modules/antlr4ts/misc/ParseCancellationException.d.ts
+++ /dev/null
@@ -1,18 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-/**
- * This exception is thrown to cancel a parsing operation. This exception does
- * not extend {@link RecognitionException}, allowing it to bypass the standard
- * error recovery mechanisms. {@link BailErrorStrategy} throws this exception in
- * response to a parse error.
- *
- * @author Sam Harwell
- */
-export declare class ParseCancellationException extends Error {
- cause: Error;
- readonly stack?: string;
- constructor(cause: Error);
- getCause(): Error;
-}
diff --git a/node_modules/antlr4ts/misc/ParseCancellationException.js b/node_modules/antlr4ts/misc/ParseCancellationException.js
deleted file mode 100644
index e2e0873..0000000
--- a/node_modules/antlr4ts/misc/ParseCancellationException.js
+++ /dev/null
@@ -1,27 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-// ConvertTo-TS run at 2016-10-04T11:26:42.5447085-07:00
-/**
- * This exception is thrown to cancel a parsing operation. This exception does
- * not extend {@link RecognitionException}, allowing it to bypass the standard
- * error recovery mechanisms. {@link BailErrorStrategy} throws this exception in
- * response to a parse error.
- *
- * @author Sam Harwell
- */
-class ParseCancellationException extends Error {
- constructor(cause) {
- super(cause.message);
- this.cause = cause;
- this.stack = cause.stack;
- }
- getCause() {
- return this.cause;
- }
-}
-exports.ParseCancellationException = ParseCancellationException;
-//# sourceMappingURL=ParseCancellationException.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/ParseCancellationException.js.map b/node_modules/antlr4ts/misc/ParseCancellationException.js.map
deleted file mode 100644
index 2752b56..0000000
--- a/node_modules/antlr4ts/misc/ParseCancellationException.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ParseCancellationException.js","sourceRoot":"","sources":["../../../src/misc/ParseCancellationException.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,wDAAwD;AAExD;;;;;;;GAOG;AACH,gCAAwC,SAAQ,KAAK;IAIpD,YAAmB,KAAY;QAC9B,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QADH,UAAK,GAAL,KAAK,CAAO;QAE9B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAC1B,CAAC;IAED,QAAQ;QACP,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;CACD;AAZD,gEAYC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/Stubs.d.ts b/node_modules/antlr4ts/misc/Stubs.d.ts
deleted file mode 100644
index fc836db..0000000
--- a/node_modules/antlr4ts/misc/Stubs.d.ts
+++ /dev/null
@@ -1,67 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-export interface Equatable {
- equals(other: any): boolean;
- hashCode(): number;
-}
-export interface Comparable {
- compareTo(o: T): number;
-}
-export interface JavaIterator {
- hasNext(): boolean;
- next(): E;
- remove(): void;
-}
-export interface JavaIterable {
- iterator(): JavaIterator;
-}
-export interface JavaCollection extends JavaIterable {
- add(e: E): boolean;
- addAll(collection: Collection): boolean;
- clear(): void;
- contains(o: any): boolean;
- containsAll(collection: Collection): boolean;
- equals(o: any): boolean;
- hashCode(): number;
- readonly isEmpty: boolean;
- iterator(): JavaIterator;
- remove(o: any): boolean;
- removeAll(collection: Collection): boolean;
- retainAll(collection: Collection): boolean;
- readonly size: number;
- toArray(): any[];
- toArray(a: E[]): E[];
-}
-export interface JavaSet extends JavaCollection {
-}
-export interface JavaMap extends Equatable {
- clear(): void;
- containsKey(key: K): boolean;
- containsValue(value: V): boolean;
- entrySet(): JavaSet>;
- get(key: K): V | undefined;
- readonly isEmpty: boolean;
- keySet(): JavaSet;
- put(key: K, value: V): V | undefined;
- putAll(m: JavaMap): void;
- remove(key: K): V | undefined;
- readonly size: number;
- values(): JavaCollection;
-}
-export declare namespace JavaMap {
- interface Entry extends Equatable {
- getKey(): K;
- getValue(): V;
- setValue(value: V): V;
- }
-}
-/**
- * Collection is a hybrid type can accept either JavaCollection or JavaScript Iterable
- */
-export declare type Collection = JavaCollection | Iterable;
-/**
- * This adapter function allows Collection arguments to be used in JavaScript for...of loops
- */
-export declare function asIterable(collection: Collection): Iterable;
diff --git a/node_modules/antlr4ts/misc/Stubs.js b/node_modules/antlr4ts/misc/Stubs.js
deleted file mode 100644
index cba5428..0000000
--- a/node_modules/antlr4ts/misc/Stubs.js
+++ /dev/null
@@ -1,30 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-/**
- * This adapter function allows Collection arguments to be used in JavaScript for...of loops
- */
-function asIterable(collection) {
- if (collection[Symbol.iterator])
- return collection;
- return new IterableAdapter(collection);
-}
-exports.asIterable = asIterable;
-// implementation detail of above...
-class IterableAdapter {
- constructor(collection) {
- this.collection = collection;
- }
- [Symbol.iterator]() { this._iterator = this.collection.iterator(); return this; }
- next() {
- if (!this._iterator.hasNext()) {
- // A bit of a hack needed here, tracking under https://github.com/Microsoft/TypeScript/issues/11375
- return { done: true, value: undefined };
- }
- return { done: false, value: this._iterator.next() };
- }
-}
-//# sourceMappingURL=Stubs.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/Stubs.js.map b/node_modules/antlr4ts/misc/Stubs.js.map
deleted file mode 100644
index 9de5439..0000000
--- a/node_modules/antlr4ts/misc/Stubs.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"Stubs.js","sourceRoot":"","sources":["../../../src/misc/Stubs.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AA0FH;;GAEG;AAEH,oBAA8B,UAAyB;IACtD,EAAE,CAAC,CAAE,UAAkB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAAC,MAAM,CAAC,UAAyB,CAAC;IAC3E,MAAM,CAAC,IAAI,eAAe,CAAC,UAA+B,CAAC,CAAC;AAC7D,CAAC;AAHD,gCAGC;AAED,oCAAoC;AAEpC;IAEC,YAAoB,UAA6B;QAA7B,eAAU,GAAV,UAAU,CAAmB;IAAI,CAAC;IAEtD,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAEjF,IAAI;QACH,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YAC/B,mGAAmG;YACnG,MAAM,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAA8B,CAAC;QACrE,CAAC;QAED,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAA;IACrD,CAAC;CACD"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/UUID.d.ts b/node_modules/antlr4ts/misc/UUID.d.ts
deleted file mode 100644
index daa08bb..0000000
--- a/node_modules/antlr4ts/misc/UUID.d.ts
+++ /dev/null
@@ -1,13 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-import { Equatable } from './Stubs';
-export declare class UUID implements Equatable {
- private readonly data;
- constructor(mostSigBits: number, moreSigBits: number, lessSigBits: number, leastSigBits: number);
- static fromString(data: string): UUID;
- hashCode(): number;
- equals(obj: any): boolean;
- toString(): string;
-}
diff --git a/node_modules/antlr4ts/misc/UUID.js b/node_modules/antlr4ts/misc/UUID.js
deleted file mode 100644
index f19d932..0000000
--- a/node_modules/antlr4ts/misc/UUID.js
+++ /dev/null
@@ -1,52 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-const MurmurHash_1 = require("./MurmurHash");
-class UUID {
- constructor(mostSigBits, moreSigBits, lessSigBits, leastSigBits) {
- this.data = new Uint32Array(4);
- this.data[0] = mostSigBits;
- this.data[1] = moreSigBits;
- this.data[2] = lessSigBits;
- this.data[3] = leastSigBits;
- }
- static fromString(data) {
- if (!/^[a-fA-F0-9]{8}-[a-fA-F0-9]{4}-[a-fA-F0-9]{4}-[a-fA-F0-9]{4}-[a-fA-F0-9]{12}$/.test(data)) {
- throw new Error("Incorrectly formatted UUID");
- }
- let segments = data.split('-');
- let mostSigBits = parseInt(segments[0], 16);
- let moreSigBits = ((parseInt(segments[1], 16) << 16) >>> 0) + parseInt(segments[2], 16);
- let lessSigBits = ((parseInt(segments[3], 16) << 16) >>> 0) + parseInt(segments[4].substr(0, 4), 16);
- let leastSigBits = parseInt(segments[4].substr(-8), 16);
- return new UUID(mostSigBits, moreSigBits, lessSigBits, leastSigBits);
- }
- hashCode() {
- return MurmurHash_1.MurmurHash.hashCode([this.data[0], this.data[1], this.data[2], this.data[3]]);
- }
- equals(obj) {
- if (obj === this) {
- return true;
- }
- else if (!(obj instanceof UUID)) {
- return false;
- }
- return this.data[0] === obj.data[0]
- && this.data[1] === obj.data[1]
- && this.data[2] === obj.data[2]
- && this.data[3] === obj.data[3];
- }
- toString() {
- return ("00000000" + this.data[0].toString(16)).substr(-8)
- + "-" + ("0000" + (this.data[1] >>> 16).toString(16)).substr(-4)
- + "-" + ("0000" + this.data[1].toString(16)).substr(-4)
- + "-" + ("0000" + (this.data[2] >>> 16).toString(16)).substr(-4)
- + "-" + ("0000" + this.data[2].toString(16)).substr(-4)
- + ("00000000" + this.data[3].toString(16)).substr(-8);
- }
-}
-exports.UUID = UUID;
-//# sourceMappingURL=UUID.js.map
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/UUID.js.map b/node_modules/antlr4ts/misc/UUID.js.map
deleted file mode 100644
index 345d6f7..0000000
--- a/node_modules/antlr4ts/misc/UUID.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"UUID.js","sourceRoot":"","sources":["../../../src/misc/UUID.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAGH,6CAA0C;AAE1C;IAGC,YAAY,WAAmB,EAAE,WAAmB,EAAE,WAAmB,EAAE,YAAoB;QAC9F,IAAI,CAAC,IAAI,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC;IAC7B,CAAC;IAED,MAAM,CAAC,UAAU,CAAC,IAAY;QAC7B,EAAE,CAAC,CAAC,CAAC,+EAA+E,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjG,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;QAC/C,CAAC;QAED,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,WAAW,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5C,IAAI,WAAW,GAAG,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACxF,IAAI,WAAW,GAAG,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACrG,IAAI,YAAY,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACxD,MAAM,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,YAAY,CAAC,CAAC;IACtE,CAAC;IAED,QAAQ;QACP,MAAM,CAAC,uBAAU,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtF,CAAC;IAED,MAAM,CAAC,GAAQ;QACd,EAAE,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,IAAI,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;eAC/B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;eAC5B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;eAC5B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,QAAQ;QACP,MAAM,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;cACvD,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;cAC9D,GAAG,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;cACrD,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;cAC9D,GAAG,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;cACrD,CAAC,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;CACD;AAjDD,oBAiDC"}
\ No newline at end of file
diff --git a/node_modules/antlr4ts/misc/Utils.d.ts b/node_modules/antlr4ts/misc/Utils.d.ts
deleted file mode 100644
index 672a229..0000000
--- a/node_modules/antlr4ts/misc/Utils.d.ts
+++ /dev/null
@@ -1,12 +0,0 @@
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-export declare function escapeWhitespace(s: string, escapeSpaces: boolean): string;
-export declare function join(collection: Iterable, separator: string): string;
-export declare function equals(x: any, y: any): boolean;
-/** Convert array of strings to string→index map. Useful for
- * converting rulenames to name→ruleindex map.
- */
-export declare function toMap(keys: string[]): Map;
-export declare function toCharArray(str: string): Uint16Array;
diff --git a/node_modules/antlr4ts/misc/Utils.js b/node_modules/antlr4ts/misc/Utils.js
deleted file mode 100644
index a796760..0000000
--- a/node_modules/antlr4ts/misc/Utils.js
+++ /dev/null
@@ -1,168 +0,0 @@
-"use strict";
-/*!
- * Copyright 2016 The ANTLR Project. All rights reserved.
- * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-function escapeWhitespace(s, escapeSpaces) {
- return escapeSpaces ? s.replace(/ /, '\u00B7') : s
- .replace(/\t/, "\\t")
- .replace(/\n/, "\\n")
- .replace(/\r/, "\\r");
-}
-exports.escapeWhitespace = escapeWhitespace;
-// Seriously: why isn't this built in to java? ugh!
-function join(collection, separator) {
- let buf = "";
- let first = true;
- for (let current of collection) {
- if (first) {
- first = false;
- }
- else {
- buf += separator;
- }
- buf += current;
- }
- return buf;
-}
-exports.join = join;
-function equals(x, y) {
- if (x === y) {
- return true;
- }
- if (x == null || y == null) {
- return false;
- }
- return x.equals(y);
-}
-exports.equals = equals;
-// export function numNonnull(data: any[]): number {
-// let n: number = 0;
-// if ( data == null ) return n;
-// for (let o of data) {
-// if ( o!=null ) n++;
-// }
-// return n;
-// }
-// export function removeAllElements(data: Collection, value: T): void {
-// if ( data==null ) return;
-// while ( data.contains(value) ) data.remove(value);
-// }
-// export function writeFile(@NotNull fileName: string, @NotNull content: string): void {
-// writeFile(fileName, content, null);
-// }
-// export function writeFile(@NotNull fileName: string, @NotNull content: string, @Nullable encoding: string): void {
-// let f: File = new File(fileName);
-// let fos: FileOutputStream = new FileOutputStream(f);
-// let osw: OutputStreamWriter;
-// if (encoding != null) {
-// osw = new OutputStreamWriter(fos, encoding);
-// }
-// else {
-// osw = new OutputStreamWriter(fos);
-// }
-// try {
-// osw.write(content);
-// }
-// finally {
-// osw.close();
-// }
-// }
-// @NotNull
-// export function readFile(@NotNull fileName: string): char[] {
-// return readFile(fileName, null);
-// }
-// @NotNull
-// export function readFile(@NotNull fileName: string, @Nullable encoding: string): char[] {
-// let f: File = new File(fileName);
-// let size: number = (int)f.length();
-// let isr: InputStreamReader;
-// let fis: FileInputStream = new FileInputStream(fileName);
-// if ( encoding!=null ) {
-// isr = new InputStreamReader(fis, encoding);
-// }
-// else {
-// isr = new InputStreamReader(fis);
-// }
-// let data: char[] = null;
-// try {
-// data = new char[size];
-// let n: number = isr.read(data);
-// if (n < data.length) {
-// data = Arrays.copyOf(data, n);
-// }
-// }
-// finally {
-// isr.close();
-// }
-// return data;
-// }
-// export function removeAll(@NotNull predicate: List list,@NotNull Predicate super T>): void {
-// let j: number = 0;
-// for (let i = 0; i < list.size; i++) {
-// let item: T = list.get(i);
-// if (!predicate.eval(item)) {
-// if (j != i) {
-// list.set(j, item);
-// }
-// j++;
-// }
-// }
-// if (j < list.size) {
-// list.subList(j, list.size).clear();
-// }
-// }
-// export function removeAll(@NotNull predicate: Iterable iterable,@NotNull Predicate super T>): void {
-// if (iterable instanceof List>) {
-// removeAll((List)iterable, predicate);
-// return;
-// }
-// for (Iterator iterator = iterable.iterator(); iterator.hasNext(); ) {
-// let item: T = iterator.next();
-// if (predicate.eval(item)) {
-// iterator.remove();
-// }
-// }
-// }
-/** Convert array of strings to string→index map. Useful for
- * converting rulenames to name→ruleindex map.
- */
-function toMap(keys) {
- let m = new Map();
- for (let i = 0; i < keys.length; i++) {
- m.set(keys[i], i);
- }
- return m;
-}
-exports.toMap = toMap;
-function toCharArray(str) {
- let result = new Uint16Array(str.length);
- for (let i = 0; i < str.length; i++) {
- result[i] = str.charCodeAt(i);
- }
- return result;
-}
-exports.toCharArray = toCharArray;
-// export function toCharArray(data: IntegerList): char[] {
-// if ( data==null ) return null;
-// let cdata: char[] = new char[data.size];
-// for (let i=0; i