Icon-Architecture/16/Arch_Amazon-Cognito

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.

*/ evaluate(e, t) { } /** * Evaluate the precedence predicates for the context and reduce the result. * * @param parser The parser instance. * @param outerContext The current parser context object. * @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(e, t) { return this; } static andContext(e, t) { if (e === null || e === h1.NONE) return t; if (t === null || t === h1.NONE) return e; const i = new z5(e, t); return i.opnds.length === 1 ? i.opnds[0] : i; } static orContext(e, t) { if (e === null) return t; if (t === null) return e; if (e === h1.NONE || t === h1.NONE) return h1.NONE; const i = new H5(e, t); return i.opnds.length === 1 ? i.opnds[0] : i; } } class z5 extends h1 { /** * A semantic context which is true whenever none of the contained contexts * is false */ constructor(e, t) { super(); const i = new D3(); e instanceof z5 ? e.opnds.map(function(l) { i.add(l); }) : i.add(e), t instanceof z5 ? t.opnds.map(function(l) { i.add(l); }) : i.add(t); const s = NE(i); if (s.length > 0) { let l = null; s.map(function(c) { (l === null || c.precedence < l.precedence) && (l = c); }), i.add(l); } this.opnds = Array.from(i.values()); } equals(e) { return this === e ? !0 : e instanceof z5 ? h0(this.opnds, e.opnds) : !1; } updateHashCode(e) { e.update(this.opnds, "AND"); } /** * {@inheritDoc} * *

* The evaluation of predicates by this context is short-circuiting, but * unordered.

*/ evaluate(e, t) { for (let i = 0; i < this.opnds.length; i++) if (!this.opnds[i].evaluate(e, t)) return !1; return !0; } evalPrecedence(e, t) { let i = !1; const s = []; for (let c = 0; c < this.opnds.length; c++) { const d = this.opnds[c], L = d.evalPrecedence(e, t); if (i |= L !== d, L === null) return null; L !== h1.NONE && s.push(L); } if (!i) return this; if (s.length === 0) return h1.NONE; let l = null; return s.map(function(c) { l = l === null ? c : h1.andContext(l, c); }), l; } toString() { const e = this.opnds.map((t) => t.toString()); return (e.length > 3 ? e.slice(3) : e).join("&&"); } } class H5 extends h1 { /** * A semantic context which is true whenever at least one of the contained * contexts is true */ constructor(e, t) { super(); const i = new D3(); e instanceof H5 ? e.opnds.map(function(l) { i.add(l); }) : i.add(e), t instanceof H5 ? t.opnds.map(function(l) { i.add(l); }) : i.add(t); const s = NE(i); if (s.length > 0) { const l = s.sort(function(d, L) { return d.compareTo(L); }), c = l[l.length - 1]; i.add(c); } this.opnds = Array.from(i.values()); } equals(e) { return this === e ? !0 : e instanceof H5 ? h0(this.opnds, e.opnds) : !1; } updateHashCode(e) { e.update(this.opnds, "OR"); } /** *

* The evaluation of predicates by this context is short-circuiting, but * unordered.

*/ evaluate(e, t) { for (let i = 0; i < this.opnds.length; i++) if (this.opnds[i].evaluate(e, t)) return !0; return !1; } evalPrecedence(e, t) { let i = !1; const s = []; for (let c = 0; c < this.opnds.length; c++) { const d = this.opnds[c], L = d.evalPrecedence(e, t); if (i |= L !== d, L === h1.NONE) return h1.NONE; L !== null && s.push(L); } return i ? (s.length === 0, null) : this; } toString() { const e = this.opnds.map((t) => t.toString()); return (e.length > 3 ? e.slice(3) : e).join("||"); } } function NE(n) { const e = []; return n.values().map(function(t) { t instanceof h1.PrecedencePredicate && e.push(t); }), e; } function U_(n, e) { if (n === null) { const t = { state: null, alt: null, context: null, semanticContext: null }; return e && (t.reachesIntoOuterContext = 0), t; } else { const t = {}; return t.state = n.state || null, t.alt = n.alt === void 0 ? null : n.alt, t.context = n.context || null, t.semanticContext = n.semanticContext || null, e && (t.reachesIntoOuterContext = n.reachesIntoOuterContext || 0, t.precedenceFilterSuppressed = n.precedenceFilterSuppressed || !1), t; } } class X1 { /** * @param {Object} params A tuple: (ATN state, predicted alt, syntactic, semantic context). * The syntactic context is a graph-structured stack node whose * path(s) to the root is the rule invocation(s) * chain used to arrive at the state. The semantic context is * the tree of semantic predicates encountered before reaching * an ATN state */ constructor(e, t) { this.checkContext(e, t), e = U_(e), t = U_(t, !0), this.state = e.state !== null ? e.state : t.state, this.alt = e.alt !== null ? e.alt : t.alt, this.context = e.context !== null ? e.context : t.context, this.semanticContext = e.semanticContext !== null ? e.semanticContext : t.semanticContext !== null ? t.semanticContext : h1.NONE, this.reachesIntoOuterContext = t.reachesIntoOuterContext, this.precedenceFilterSuppressed = t.precedenceFilterSuppressed; } checkContext(e, t) { (e.context === null || e.context === void 0) && (t === null || t.context === null || t.context === void 0) && (this.context = null); } hashCode() { const e = new F3(); return this.updateHashCode(e), e.finish(); } updateHashCode(e) { e.update(this.state.stateNumber, this.alt, this.context, this.semanticContext); } /** * 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(e) { return this === e ? !0 : e instanceof X1 ? this.state.stateNumber === e.state.stateNumber && this.alt === e.alt && (this.context === null ? e.context === null : this.context.equals(e.context)) && this.semanticContext.equals(e.semanticContext) && this.precedenceFilterSuppressed === e.precedenceFilterSuppressed : !1; } hashCodeForConfigSet() { const e = new F3(); return e.update(this.state.stateNumber, this.alt, this.semanticContext), e.finish(); } equalsForConfigSet(e) { return this === e ? !0 : e instanceof X1 ? this.state.stateNumber === e.state.stateNumber && this.alt === e.alt && this.semanticContext.equals(e.semanticContext) : !1; } toString() { return "(" + this.state + "," + this.alt + (this.context !== null ? ",[" + this.context.toString() + "]" : "") + (this.semanticContext !== h1.NONE ? "," + this.semanticContext.toString() : "") + (this.reachesIntoOuterContext > 0 ? ",up=" + this.reachesIntoOuterContext : "") + ")"; } } class m1 { constructor(e, t) { this.start = e, this.stop = t; } clone() { return new m1(this.start, this.stop); } contains(e) { return e >= this.start && e < this.stop; } toString() { return this.start === this.stop - 1 ? this.start.toString() : this.start.toString() + ".." + (this.stop - 1).toString(); } get length() { return this.stop - this.start; } } m1.INVALID_INTERVAL = new m1(-1, -2); class X3 { constructor() { this.intervals = null, this.readOnly = !1; } first(e) { return this.intervals === null || this.intervals.length === 0 ? m2.INVALID_TYPE : this.intervals[0].start; } addOne(e) { this.addInterval(new m1(e, e + 1)); } addRange(e, t) { this.addInterval(new m1(e, t + 1)); } addInterval(e) { if (this.intervals === null) this.intervals = [], this.intervals.push(e.clone()); else { for (let t = 0; t < this.intervals.length; t++) { const i = this.intervals[t]; if (e.stop < i.start) { this.intervals.splice(t, 0, e); return; } else if (e.stop === i.start) { this.intervals[t] = new m1(e.start, i.stop); return; } else if (e.start <= i.stop) { this.intervals[t] = new m1(Math.min(i.start, e.start), Math.max(i.stop, e.stop)), this.reduce(t); return; } } this.intervals.push(e.clone()); } } addSet(e) { return e.intervals !== null && e.intervals.forEach((t) => this.addInterval(t), this), this; } reduce(e) { if (e < this.intervals.length - 1) { const t = this.intervals[e], i = this.intervals[e + 1]; t.stop >= i.stop ? (this.intervals.splice(e + 1, 1), this.reduce(e)) : t.stop >= i.start && (this.intervals[e] = new m1(t.start, i.stop), this.intervals.splice(e + 1, 1)); } } complement(e, t) { const i = new X3(); return i.addInterval(new m1(e, t + 1)), this.intervals !== null && this.intervals.forEach((s) => i.removeRange(s)), i; } contains(e) { if (this.intervals === null) return !1; for (let t = 0; t < this.intervals.length; t++) if (this.intervals[t].contains(e)) return !0; return !1; } removeRange(e) { if (e.start === e.stop - 1) this.removeOne(e.start); else if (this.intervals !== null) { let t = 0; for (let i = 0; i < this.intervals.length; i++) { const s = this.intervals[t]; if (e.stop <= s.start) return; if (e.start > s.start && e.stop < s.stop) { this.intervals[t] = new m1(s.start, e.start); const l = new m1(e.stop, s.stop); this.intervals.splice(t, 0, l); return; } else e.start <= s.start && e.stop >= s.stop ? (this.intervals.splice(t, 1), t = t - 1) : e.start < s.stop ? this.intervals[t] = new m1(s.start, e.start) : e.stop < s.stop && (this.intervals[t] = new m1(e.stop, s.stop)); t += 1; } } } removeOne(e) { if (this.intervals !== null) for (let t = 0; t < this.intervals.length; t++) { const i = this.intervals[t]; if (e < i.start) return; if (e === i.start && e === i.stop - 1) { this.intervals.splice(t, 1); return; } else if (e === i.start) { this.intervals[t] = new m1(i.start + 1, i.stop); return; } else if (e === i.stop - 1) { this.intervals[t] = new m1(i.start, i.stop - 1); return; } else if (e < i.stop - 1) { const s = new m1(i.start, e); i.start = e + 1, this.intervals.splice(t, 0, s); return; } } } toString(e, t, i) { return e = e || null, t = t || null, i = i || !1, this.intervals === null ? "{}" : e !== null || t !== null ? this.toTokenString(e, t) : i ? this.toCharString() : this.toIndexString(); } toCharString() { const e = []; for (let t = 0; t < this.intervals.length; t++) { const i = this.intervals[t]; i.stop === i.start + 1 ? i.start === m2.EOF ? e.push("") : e.push("'" + String.fromCharCode(i.start) + "'") : e.push("'" + String.fromCharCode(i.start) + "'..'" + String.fromCharCode(i.stop - 1) + "'"); } return e.length > 1 ? "{" + e.join(", ") + "}" : e[0]; } toIndexString() { const e = []; for (let t = 0; t < this.intervals.length; t++) { const i = this.intervals[t]; i.stop === i.start + 1 ? i.start === m2.EOF ? e.push("") : e.push(i.start.toString()) : e.push(i.start.toString() + ".." + (i.stop - 1).toString()); } return e.length > 1 ? "{" + e.join(", ") + "}" : e[0]; } toTokenString(e, t) { const i = []; for (let s = 0; s < this.intervals.length; s++) { const l = this.intervals[s]; for (let c = l.start; c < l.stop; c++) i.push(this.elementName(e, t, c)); } return i.length > 1 ? "{" + i.join(", ") + "}" : i[0]; } elementName(e, t, i) { return i === m2.EOF ? "" : i === m2.EPSILON ? "" : e[i] || t[i]; } get length() { return this.intervals.map((e) => e.length).reduce((e, t) => e + t); } } class O2 { constructor() { this.atn = null, this.stateNumber = O2.INVALID_STATE_NUMBER, this.stateType = null, this.ruleIndex = 0, this.epsilonOnlyTransitions = !1, this.transitions = [], this.nextTokenWithinRule = null; } toString() { return this.stateNumber; } equals(e) { return e instanceof O2 ? this.stateNumber === e.stateNumber : !1; } isNonGreedyExitState() { return !1; } addTransition(e, t) { t === void 0 && (t = -1), this.transitions.length === 0 ? this.epsilonOnlyTransitions = e.isEpsilon : this.epsilonOnlyTransitions !== e.isEpsilon && (this.epsilonOnlyTransitions = !1), t === -1 ? this.transitions.push(e) : this.transitions.splice(t, 1, e); } } O2.INVALID_TYPE = 0; O2.BASIC = 1; O2.RULE_START = 2; O2.BLOCK_START = 3; O2.PLUS_BLOCK_START = 4; O2.STAR_BLOCK_START = 5; O2.TOKEN_START = 6; O2.RULE_STOP = 7; O2.BLOCK_END = 8; O2.STAR_LOOP_BACK = 9; O2.STAR_LOOP_ENTRY = 10; O2.PLUS_LOOP_BACK = 11; O2.LOOP_END = 12; O2.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" ]; O2.INVALID_STATE_NUMBER = -1; class We extends O2 { constructor() { return super(), this.stateType = O2.RULE_STOP, this; } } class b2 { constructor(e) { if (e == null) throw "target cannot be null."; this.target = e, this.isEpsilon = !1, this.label = null; } } b2.EPSILON = 1; b2.RANGE = 2; b2.RULE = 3; b2.PREDICATE = 4; b2.ATOM = 5; b2.ACTION = 6; b2.SET = 7; b2.NOT_SET = 8; b2.WILDCARD = 9; b2.PRECEDENCE = 10; b2.serializationNames = [ "INVALID", "EPSILON", "RANGE", "RULE", "PREDICATE", "ATOM", "ACTION", "SET", "NOT_SET", "WILDCARD", "PRECEDENCE" ]; b2.serializationTypes = { EpsilonTransition: b2.EPSILON, RangeTransition: b2.RANGE, RuleTransition: b2.RULE, PredicateTransition: b2.PREDICATE, AtomTransition: b2.ATOM, ActionTransition: b2.ACTION, SetTransition: b2.SET, NotSetTransition: b2.NOT_SET, WildcardTransition: b2.WILDCARD, PrecedencePredicateTransition: b2.PRECEDENCE }; class J8 extends b2 { constructor(e, t, i, s) { super(e), this.ruleIndex = t, this.precedence = i, this.followState = s, this.serializationType = b2.RULE, this.isEpsilon = !0; } matches(e, t, i) { return !1; } } class wc extends b2 { constructor(e, t) { super(e), this.serializationType = b2.SET, t != null ? this.label = t : (this.label = new X3(), this.label.addOne(m2.INVALID_TYPE)); } matches(e, t, i) { return this.label.contains(e); } toString() { return this.label.toString(); } } class Mc extends wc { constructor(e, t) { super(e, t), this.serializationType = b2.NOT_SET; } matches(e, t, i) { return e >= t && e <= i && !super.matches(e, t, i); } toString() { return "~" + super.toString(); } } class OE extends b2 { constructor(e) { super(e), this.serializationType = b2.WILDCARD; } matches(e, t, i) { return e >= t && e <= i; } toString() { return "."; } } class Ac extends b2 { constructor(e) { super(e); } } class vx { } class Rx extends vx { } class IE extends Rx { } class e6 extends IE { getRuleContext() { throw new Error("missing interface implementation"); } } class nt extends IE { } class E6 extends nt { } function bx(n, e) { return n = n.replace(/\t/g, "\\t").replace(/\n/g, "\\n").replace(/\r/g, "\\r"), n; } const x4 = { /** * Print out a whole tree in LISP form. {@link //getNodeText} is used on the * node payloads to get the text for the nodes. Detect * parse trees and extract data appropriately. */ toStringTree: function(n, e, t) { e = e || null, t = t || null, t !== null && (e = t.ruleNames); let i = x4.getNodeText(n, e); i = bx(i); const s = n.getChildCount(); if (s === 0) return i; let l = "(" + i + " "; s > 0 && (i = x4.toStringTree(n.getChild(0), e), l = l.concat(i)); for (let c = 1; c < s; c++) i = x4.toStringTree(n.getChild(c), e), l = l.concat(" " + i); return l = l.concat(")"), l; }, getNodeText: function(n, e, t) { if (e = e || null, t = t || null, t !== null && (e = t.ruleNames), e !== null) if (n instanceof e6) { const l = n.getRuleContext().getAltNumber(); return l != 0 ? e[n.ruleIndex] + ":" + l : e[n.ruleIndex]; } else { if (n instanceof E6) return n.toString(); if (n instanceof nt && n.symbol !== null) return n.symbol.text; } const i = n.getPayload(); return i instanceof m2 ? i.text : n.getPayload().toString(); }, /** * Return ordered list of all children of this node */ getChildren: function(n) { const e = []; for (let t = 0; t < n.getChildCount(); t++) e.push(n.getChild(t)); return e; }, /** * Return a list of all ancestors of this node. The first node of * list is the root and the last is the parent of this node. */ getAncestors: function(n) { let e = []; for (n = n.getParent(); n !== null; ) e = [n].concat(e), n = n.getParent(); return e; }, findAllTokenNodes: function(n, e) { return x4.findAllNodes(n, e, !0); }, findAllRuleNodes: function(n, e) { return x4.findAllNodes(n, e, !1); }, findAllNodes: function(n, e, t) { const i = []; return x4._findAllNodes(n, e, t, i), i; }, _findAllNodes: function(n, e, t, i) { t && n instanceof nt ? n.symbol.type === e && i.push(n) : !t && n instanceof e6 && n.ruleIndex === e && i.push(n); for (let s = 0; s < n.getChildCount(); s++) x4._findAllNodes(n.getChild(s), e, t, i); }, descendants: function(n) { let e = [n]; for (let t = 0; t < n.getChildCount(); t++) e = e.concat(x4.descendants(n.getChild(t))); return e; } }; class f0 extends e6 { /** A rule context is a record of a single rule invocation. It knows * which context invoked it, if any. If there is no parent context, then * naturally the invoking state is not valid. The parent link * provides a chain upwards from the current rule invocation to the root * of the invocation tree, forming a stack. We actually carry no * information about the rule associated with this context (except * when parsing). We keep only the state number of the invoking state from * the ATN submachine that invoked this. Contrast this with the s * pointer inside ParserRuleContext that tracks the current state * being "executed" for the current rule. * * 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 */ constructor(e, t) { super(), this.parentCtx = e || null, this.invokingState = t || -1; } depth() { let e = 0, t = this; for (; t !== null; ) t = t.parentCtx, e += 1; return e; } /** * A context is empty if there is no invoking state; meaning nobody call * current context. */ isEmpty() { return this.invokingState === -1; } // satisfy the ParseTree / SyntaxTree interface getSourceInterval() { return m1.INVALID_INTERVAL; } getRuleContext() { return this; } getPayload() { 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. */ getText() { return this.getChildCount() === 0 ? "" : this.children.map(function(e) { return e.getText(); }).join(""); } /** * 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. */ getAltNumber() { return 0; } /** * 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. */ setAltNumber(e) { } getChild(e) { return null; } getChildCount() { return 0; } accept(e) { return e.visitChildren(this); } /** * 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(e, t) { return x4.toStringTree(this, e, t); } toString(e, t) { e = e || null, t = t || null; let i = this, s = "["; for (; i !== null && i !== t; ) { if (e === null) i.isEmpty() || (s += i.invokingState); else { const l = i.ruleIndex, c = l >= 0 && l < e.length ? e[l] : "" + l; s += c; } i.parentCtx !== null && (e !== null || !i.parentCtx.isEmpty()) && (s += " "), i = i.parentCtx; } return s += "]", s; } } class t1 { constructor(e) { this.cachedHashCode = e; } /** * 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 < {@link //size()}; i++) {
   * hash = {@link MurmurHash//update MurmurHash.update}(hash, {@link //getParent
   * getParent}(i));
   * }
   *
   * for (int i = 0; i < {@link //size()}; i++) {
   * hash = {@link MurmurHash//update MurmurHash.update}(hash, {@link
   * //getReturnState getReturnState}(i));
   * }
   *
   * hash = {@link MurmurHash//finish MurmurHash.finish}(hash, 2// {@link
   * //size()});
   * return hash;
   * }
   *

* This means only the {@link //EMPTY} context is in set. */ isEmpty() { return this === t1.EMPTY; } hasEmptyPath() { return this.getReturnState(this.length - 1) === t1.EMPTY_RETURN_STATE; } hashCode() { return this.cachedHashCode; } updateHashCode(e) { e.update(this.cachedHashCode); } } t1.EMPTY = null; t1.EMPTY_RETURN_STATE = 2147483647; t1.globalNodeCount = 1; t1.id = t1.globalNodeCount; class N4 extends t1 { constructor(e, t) { const i = new F3(); i.update(e, t); const s = i.finish(); return super(s), this.parents = e, this.returnStates = t, this; } isEmpty() { return this.returnStates[0] === t1.EMPTY_RETURN_STATE; } getParent(e) { return this.parents[e]; } getReturnState(e) { return this.returnStates[e]; } equals(e) { return this === e ? !0 : e instanceof N4 ? this.hashCode() !== e.hashCode() ? !1 : h0(this.returnStates, e.returnStates) && h0(this.parents, e.parents) : !1; } toString() { if (this.isEmpty()) return "[]"; { let e = "["; for (let t = 0; t < this.returnStates.length; t++) { if (t > 0 && (e = e + ", "), this.returnStates[t] === t1.EMPTY_RETURN_STATE) { e = e + "$"; continue; } e = e + this.returnStates[t], this.parents[t] !== null ? e = e + " " + this.parents[t] : e = e + "null"; } return e + "]"; } } get length() { return this.returnStates.length; } } class $e extends t1 { constructor(e, t) { let i = 0; const s = new F3(); e !== null ? s.update(e, t) : s.update(1), i = s.finish(), super(i), this.parentCtx = e, this.returnState = t; } getParent(e) { return this.parentCtx; } getReturnState(e) { return this.returnState; } equals(e) { return this === e ? !0 : e instanceof $e ? this.hashCode() !== e.hashCode() || this.returnState !== e.returnState ? !1 : this.parentCtx == null ? e.parentCtx == null : this.parentCtx.equals(e.parentCtx) : !1; } toString() { const e = this.parentCtx === null ? "" : this.parentCtx.toString(); return e.length === 0 ? this.returnState === t1.EMPTY_RETURN_STATE ? "$" : "" + this.returnState : "" + this.returnState + " " + e; } get length() { return 1; } static create(e, t) { return t === t1.EMPTY_RETURN_STATE && e === null ? t1.EMPTY : new $e(e, t); } } class Zl extends $e { constructor() { super(null, t1.EMPTY_RETURN_STATE); } isEmpty() { return !0; } getParent(e) { return null; } getReturnState(e) { return this.returnState; } equals(e) { return this === e; } toString() { return "$"; } } t1.EMPTY = new Zl(); const A5 = "h-"; class ln { constructor(e, t) { this.data = {}, this.hashFunction = e || AE, this.equalsFunction = t || yE; } set(e, t) { const i = A5 + this.hashFunction(e); if (i in this.data) { const s = this.data[i]; for (let l = 0; l < s.length; l++) { const c = s[l]; if (this.equalsFunction(e, c.key)) { const d = c.value; return c.value = t, d; } } return s.push({ key: e, value: t }), t; } else return this.data[i] = [{ key: e, value: t }], t; } containsKey(e) { const t = A5 + this.hashFunction(e); if (t in this.data) { const i = this.data[t]; for (let s = 0; s < i.length; s++) { const l = i[s]; if (this.equalsFunction(e, l.key)) return !0; } } return !1; } get(e) { const t = A5 + this.hashFunction(e); if (t in this.data) { const i = this.data[t]; for (let s = 0; s < i.length; s++) { const l = i[s]; if (this.equalsFunction(e, l.key)) return l.value; } } return null; } entries() { return Object.keys(this.data).filter((e) => e.startsWith(A5)).flatMap((e) => this.data[e], this); } getKeys() { return this.entries().map((e) => e.key); } getValues() { return this.entries().map((e) => e.value); } toString() { return "[" + this.entries().map((t) => "{" + t.key + ":" + t.value + "}").join(", ") + "]"; } get length() { return Object.keys(this.data).filter((e) => e.startsWith(A5)).map((e) => this.data[e].length, this).reduce((e, t) => e + t, 0); } } function yc(n, e) { if (e == null && (e = f0.EMPTY), e.parentCtx === null || e === f0.EMPTY) return t1.EMPTY; const t = yc(n, e.parentCtx), s = n.states[e.invokingState].transitions[0]; return $e.create(t, s.followState.stateNumber); } function DE(n, e, t) { if (n.isEmpty()) return n; let i = t.get(n) || null; if (i !== null) return i; if (i = e.get(n), i !== null) return t.set(n, i), i; let s = !1, l = []; for (let d = 0; d < l.length; d++) { const L = DE(n.getParent(d), e, t); if (s || L !== n.getParent(d)) { if (!s) { l = []; for (let _ = 0; _ < n.length; _++) l[_] = n.getParent(_); s = !0; } l[d] = L; } } if (!s) return e.add(n), t.set(n, n), n; let c = null; return l.length === 0 ? c = t1.EMPTY : l.length === 1 ? c = $e.create(l[0], n.getReturnState(0)) : c = new N4(l, n.returnStates), e.add(c), t.set(c, c), t.set(n, c), c; } function Nc(n, e, t, i) { if (n === e) return n; if (n instanceof $e && e instanceof $e) return Mx(n, e, t, i); if (t) { if (n instanceof Zl) return n; if (e instanceof Zl) return e; } return n instanceof $e && (n = new N4([n.getParent()], [n.returnState])), e instanceof $e && (e = new N4([e.getParent()], [e.returnState])), xx(n, e, t, i); } function xx(n, e, t, i) { if (i !== null) { let p = i.get(n, e); if (p !== null || (p = i.get(e, n), p !== null)) return p; } let s = 0, l = 0, c = 0, d = [], L = []; for (; s < n.returnStates.length && l < e.returnStates.length; ) { const p = n.parents[s], m = e.parents[l]; if (n.returnStates[s] === e.returnStates[l]) { const f = n.returnStates[s]; f === t1.EMPTY_RETURN_STATE && p === null && m === null || p !== null && m !== null && p === m ? (L[c] = p, d[c] = f) : (L[c] = Nc(p, m, t, i), d[c] = f), s += 1, l += 1; } else n.returnStates[s] < e.returnStates[l] ? (L[c] = p, d[c] = n.returnStates[s], s += 1) : (L[c] = m, d[c] = e.returnStates[l], l += 1); c += 1; } if (s < n.returnStates.length) for (let p = s; p < n.returnStates.length; p++) L[c] = n.parents[p], d[c] = n.returnStates[p], c += 1; else for (let p = l; p < e.returnStates.length; p++) L[c] = e.parents[p], d[c] = e.returnStates[p], c += 1; if (c < L.length) { if (c === 1) { const p = $e.create( L[0], d[0] ); return i !== null && i.set(n, e, p), p; } L = L.slice(0, c), d = d.slice(0, c); } const _ = new N4(L, d); return _ === n ? (i !== null && i.set(n, e, n), n) : _ === e ? (i !== null && i.set(n, e, e), e) : (wx(L), i !== null && i.set(n, e, _), _); } function wx(n) { const e = new ln(); for (let t = 0; t < n.length; t++) { const i = n[t]; e.containsKey(i) || e.set(i, i); } for (let t = 0; t < n.length; t++) n[t] = e.get(n[t]); } function Mx(n, e, t, i) { if (i !== null) { let l = i.get(n, e); if (l !== null || (l = i.get(e, n), l !== null)) return l; } const s = Ax(n, e, t); if (s !== null) return i !== null && i.set(n, e, s), s; if (n.returnState === e.returnState) { const l = Nc(n.parentCtx, e.parentCtx, t, i); if (l === n.parentCtx) return n; if (l === e.parentCtx) return e; const c = $e.create(l, n.returnState); return i !== null && i.set(n, e, c), c; } else { let l = null; if ((n === e || n.parentCtx !== null && n.parentCtx === e.parentCtx) && (l = n.parentCtx), l !== null) { const _ = [n.returnState, e.returnState]; n.returnState > e.returnState && (_[0] = e.returnState, _[1] = n.returnState); const p = [l, l], m = new N4(p, _); return i !== null && i.set(n, e, m), m; } const c = [n.returnState, e.returnState]; let d = [n.parentCtx, e.parentCtx]; n.returnState > e.returnState && (c[0] = e.returnState, c[1] = n.returnState, d = [e.parentCtx, n.parentCtx]); const L = new N4(d, c); return i !== null && i.set(n, e, L), L; } } function Ax(n, e, t) { if (t) { if (n === t1.EMPTY || e === t1.EMPTY) return t1.EMPTY; } else { if (n === t1.EMPTY && e === t1.EMPTY) return t1.EMPTY; if (n === t1.EMPTY) { const i = [ e.returnState, t1.EMPTY_RETURN_STATE ], s = [e.parentCtx, null]; return new N4(s, i); } else if (e === t1.EMPTY) { const i = [n.returnState, t1.EMPTY_RETURN_STATE], s = [n.parentCtx, null]; return new N4(s, i); } } return null; } class M4 { constructor() { this.data = []; } add(e) { this.data[e] = !0; } or(e) { Object.keys(e.data).map((t) => this.add(t), this); } remove(e) { delete this.data[e]; } has(e) { return this.data[e] === !0; } values() { return Object.keys(this.data); } minValue() { return Math.min.apply(null, this.values()); } hashCode() { return F3.hashStuff(this.values()); } equals(e) { return e instanceof M4 && h0(this.data, e.data); } toString() { return "{" + this.values().join(", ") + "}"; } get length() { return this.values().length; } } class E0 { constructor(e) { this.atn = e; } /** * 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(e) { if (e === null) return null; const t = e.transitions.length, i = []; for (let s = 0; s < t; s++) { i[s] = new X3(); const l = new D3(); this._LOOK( e.transition(s).target, null, t1.EMPTY, i[s], l, new M4(), !1, !1 ), (i[s].length === 0 || i[s].contains(E0.HIT_PRED)) && (i[s] = null); } return i; } /** * 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 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(e, t, i) { const s = new X3(), l = !0; i = i || null; const c = i !== null ? yc(e.atn, i) : null; return this._LOOK(e, t, c, s, new D3(), new M4(), l, !0), s; } /** * Compute set of tokens that can follow {@code s} in the ATN in the * specified {@code ctx}. * *

If {@code ctx} is {@code null} 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 {@code null} 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 {@code null} 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 CustomizedSet} 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 {@code null}. */ _LOOK(e, t, i, s, l, c, d, L) { const _ = new X1({ state: e, alt: 0, context: i }, null); if (!l.has(_)) { if (l.add(_), e === t) { if (i === null) { s.addOne(m2.EPSILON); return; } else if (i.isEmpty() && L) { s.addOne(m2.EOF); return; } } if (e instanceof We) { if (i === null) { s.addOne(m2.EPSILON); return; } else if (i.isEmpty() && L) { s.addOne(m2.EOF); return; } if (i !== t1.EMPTY) { const p = c.has(e.ruleIndex); try { c.remove(e.ruleIndex); for (let m = 0; m < i.length; m++) { const f = this.atn.states[i.getReturnState(m)]; this._LOOK(f, t, i.getParent(m), s, l, c, d, L); } } finally { p && c.add(e.ruleIndex); } return; } } for (let p = 0; p < e.transitions.length; p++) { const m = e.transitions[p]; if (m.constructor === J8) { if (c.has(m.target.ruleIndex)) continue; const f = $e.create(i, m.followState.stateNumber); try { c.add(m.target.ruleIndex), this._LOOK(m.target, t, f, s, l, c, d, L); } finally { c.remove(m.target.ruleIndex); } } else if (m instanceof Ac) d ? this._LOOK(m.target, t, i, s, l, c, d, L) : s.addOne(E0.HIT_PRED); else if (m.isEpsilon) this._LOOK(m.target, t, i, s, l, c, d, L); else if (m.constructor === OE) s.addRange(m2.MIN_USER_TOKEN_TYPE, this.atn.maxTokenType); else { let f = m.label; f !== null && (m instanceof Mc && (f = f.complement(m2.MIN_USER_TOKEN_TYPE, this.atn.maxTokenType)), s.addSet(f)); } } } } } E0.HIT_PRED = m2.INVALID_TYPE; class G1 { constructor(e, t) { this.grammarType = e, this.maxTokenType = t, this.states = [], this.decisionToState = [], this.ruleToStartState = [], this.ruleToStopState = null, this.modeNameToStartState = {}, this.ruleToTokenType = null, this.lexerActions = null, this.modeToStartState = []; } /** * Compute the set of valid tokens that can occur starting in state {@code s}. * If {@code ctx} is null, 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 */ nextTokensInContext(e, t) { return new E0(this).LOOK(e, null, t); } /** * 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 */ nextTokensNoContext(e) { return e.nextTokenWithinRule !== null || (e.nextTokenWithinRule = this.nextTokensInContext(e, null), e.nextTokenWithinRule.readOnly = !0), e.nextTokenWithinRule; } nextTokens(e, t) { return t === void 0 ? this.nextTokensNoContext(e) : this.nextTokensInContext(e, t); } addState(e) { e !== null && (e.atn = this, e.stateNumber = this.states.length), this.states.push(e); } removeState(e) { this.states[e.stateNumber] = null; } defineDecisionState(e) { return this.decisionToState.push(e), e.decision = this.decisionToState.length - 1, e.decision; } getDecisionState(e) { return this.decisionToState.length === 0 ? null : this.decisionToState[e]; } /** * 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}.

* * @param stateNumber the ATN state number * @param ctx the full parse context * * @return {IntervalSet} The set of potentially valid input symbols which could follow the * specified state in the specified context. * * @throws IllegalArgumentException if the ATN does not contain a state with * number {@code stateNumber} */ getExpectedTokens(e, t) { if (e < 0 || e >= this.states.length) throw "Invalid state number."; const i = this.states[e]; let s = this.nextTokens(i); if (!s.contains(m2.EPSILON)) return s; const l = new X3(); for (l.addSet(s), l.removeOne(m2.EPSILON); t !== null && t.invokingState >= 0 && s.contains(m2.EPSILON); ) { const d = this.states[t.invokingState].transitions[0]; s = this.nextTokens(d.followState), l.addSet(s), l.removeOne(m2.EPSILON), t = t.parentCtx; } return s.contains(m2.EPSILON) && l.addOne(m2.EOF), l; } } G1.INVALID_ALT_NUMBER = 0; const A8 = { LEXER: 0, PARSER: 1 }; class Z_ extends O2 { constructor() { super(), this.stateType = O2.BASIC; } } class x0 extends O2 { constructor() { return super(), this.decision = -1, this.nonGreedy = !1, this; } } class _0 extends x0 { constructor() { return super(), this.endState = null, this; } } class dr extends O2 { constructor() { return super(), this.stateType = O2.BLOCK_END, this.startState = null, this; } } class l0 extends O2 { constructor() { return super(), this.stateType = O2.LOOP_END, this.loopBackState = null, this; } } class B_ extends O2 { constructor() { return super(), this.stateType = O2.RULE_START, this.stopState = null, this.isPrecedenceRule = !1, this; } } class yx extends x0 { constructor() { return super(), this.stateType = O2.TOKEN_START, this; } } class G_ extends x0 { constructor() { return super(), this.stateType = O2.PLUS_LOOP_BACK, this; } } class Lr extends O2 { constructor() { return super(), this.stateType = O2.STAR_LOOP_BACK, this; } } class h9 extends x0 { constructor() { return super(), this.stateType = O2.STAR_LOOP_ENTRY, this.loopBackState = null, this.isPrecedenceDecision = null, this; } } class Cr extends _0 { constructor() { return super(), this.stateType = O2.PLUS_BLOCK_START, this.loopBackState = null, this; } } class _r extends _0 { constructor() { return super(), this.stateType = O2.STAR_BLOCK_START, this; } } class z_ extends _0 { constructor() { return super(), this.stateType = O2.BLOCK_START, this; } } class H8 extends b2 { constructor(e, t) { super(e), this.label_ = t, this.label = this.makeLabel(), this.serializationType = b2.ATOM; } makeLabel() { const e = new X3(); return e.addOne(this.label_), e; } matches(e, t, i) { return this.label_ === e; } toString() { return this.label_; } } class H_ extends b2 { constructor(e, t, i) { super(e), this.serializationType = b2.RANGE, this.start = t, this.stop = i, this.label = this.makeLabel(); } makeLabel() { const e = new X3(); return e.addRange(this.start, this.stop), e; } matches(e, t, i) { return e >= this.start && e <= this.stop; } toString() { return "'" + String.fromCharCode(this.start) + "'..'" + String.fromCharCode(this.stop) + "'"; } } class kE extends b2 { constructor(e, t, i, s) { super(e), this.serializationType = b2.ACTION, this.ruleIndex = t, this.actionIndex = i === void 0 ? -1 : i, this.isCtxDependent = s === void 0 ? !1 : s, this.isEpsilon = !0; } matches(e, t, i) { return !1; } toString() { return "action_" + this.ruleIndex + ":" + this.actionIndex; } } class y5 extends b2 { constructor(e, t) { super(e), this.serializationType = b2.EPSILON, this.isEpsilon = !0, this.outermostPrecedenceReturn = t; } matches(e, t, i) { return !1; } toString() { return "epsilon"; } } class S6 extends h1 { constructor(e, t, i) { super(), this.ruleIndex = e === void 0 ? -1 : e, this.predIndex = t === void 0 ? -1 : t, this.isCtxDependent = i === void 0 ? !1 : i; } evaluate(e, t) { const i = this.isCtxDependent ? t : null; return e.sempred(i, this.ruleIndex, this.predIndex); } updateHashCode(e) { e.update(this.ruleIndex, this.predIndex, this.isCtxDependent); } equals(e) { return this === e ? !0 : e instanceof S6 ? this.ruleIndex === e.ruleIndex && this.predIndex === e.predIndex && this.isCtxDependent === e.isCtxDependent : !1; } toString() { return "{" + this.ruleIndex + ":" + this.predIndex + "}?"; } } h1.NONE = new S6(); class PE extends Ac { constructor(e, t, i, s) { super(e), this.serializationType = b2.PREDICATE, this.ruleIndex = t, this.predIndex = i, this.isCtxDependent = s, this.isEpsilon = !0; } matches(e, t, i) { return !1; } getPredicate() { return new S6(this.ruleIndex, this.predIndex, this.isCtxDependent); } toString() { return "pred_" + this.ruleIndex + ":" + this.predIndex; } } class T6 extends h1 { constructor(e) { super(), this.precedence = e === void 0 ? 0 : e; } evaluate(e, t) { return e.precpred(t, this.precedence); } evalPrecedence(e, t) { return e.precpred(t, this.precedence) ? h1.NONE : null; } compareTo(e) { return this.precedence - e.precedence; } updateHashCode(e) { e.update(this.precedence); } equals(e) { return this === e ? !0 : e instanceof T6 ? this.precedence === e.precedence : !1; } toString() { return "{" + this.precedence + ">=prec}?"; } } h1.PrecedencePredicate = T6; class Nx extends Ac { constructor(e, t) { super(e), this.serializationType = b2.PRECEDENCE, this.precedence = t, this.isEpsilon = !0; } matches(e, t, i) { return !1; } getPredicate() { return new T6(this.precedence); } toString() { return this.precedence + " >= _p"; } } class J5 { constructor(e) { e === void 0 && (e = null), this.readOnly = !1, this.verifyATN = e === null ? !0 : e.verifyATN, this.generateRuleBypassTransitions = e === null ? !1 : e.generateRuleBypassTransitions; } } J5.defaultOptions = new J5(); J5.defaultOptions.readOnly = !0; const Ue = { // 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 }; class rt { constructor(e) { this.actionType = e, this.isPositionDependent = !1; } hashCode() { const e = new F3(); return this.updateHashCode(e), e.finish(); } updateHashCode(e) { e.update(this.actionType); } equals(e) { return this === e; } } class Bl extends rt { constructor() { super(Ue.SKIP); } execute(e) { e.skip(); } toString() { return "skip"; } } Bl.INSTANCE = new Bl(); class Oc extends rt { constructor(e) { super(Ue.CHANNEL), this.channel = e; } /** *

This action is implemented by calling {@link Lexer//setChannel} with the * value provided by {@link //getChannel}.

*/ execute(e) { e._channel = this.channel; } updateHashCode(e) { e.update(this.actionType, this.channel); } equals(e) { return this === e ? !0 : e instanceof Oc ? this.channel === e.channel : !1; } toString() { return "channel(" + this.channel + ")"; } } class Ic extends rt { /** * 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(e, t) { super(Ue.CUSTOM), this.ruleIndex = e, this.actionIndex = t, this.isPositionDependent = !0; } /** *

Custom actions are implemented by calling {@link Lexer//action} with the * appropriate rule and action indexes.

*/ execute(e) { e.action(null, this.ruleIndex, this.actionIndex); } updateHashCode(e) { e.update(this.actionType, this.ruleIndex, this.actionIndex); } equals(e) { return this === e ? !0 : e instanceof Ic ? this.ruleIndex === e.ruleIndex && this.actionIndex === e.actionIndex : !1; } } class Gl extends rt { constructor() { super(Ue.MORE); } /** *

This action is implemented by calling {@link Lexer//popMode}.

*/ execute(e) { e.more(); } toString() { return "more"; } } Gl.INSTANCE = new Gl(); class Dc extends rt { constructor(e) { super(Ue.TYPE), this.type = e; } execute(e) { e.type = this.type; } updateHashCode(e) { e.update(this.actionType, this.type); } equals(e) { return this === e ? !0 : e instanceof Dc ? this.type === e.type : !1; } toString() { return "type(" + this.type + ")"; } } class kc extends rt { constructor(e) { super(Ue.PUSH_MODE), this.mode = e; } /** *

This action is implemented by calling {@link Lexer//pushMode} with the * value provided by {@link //getMode}.

*/ execute(e) { e.pushMode(this.mode); } updateHashCode(e) { e.update(this.actionType, this.mode); } equals(e) { return this === e ? !0 : e instanceof kc ? this.mode === e.mode : !1; } toString() { return "pushMode(" + this.mode + ")"; } } class zl extends rt { constructor() { super(Ue.POP_MODE); } /** *

This action is implemented by calling {@link Lexer//popMode}.

*/ execute(e) { e.popMode(); } toString() { return "popMode"; } } zl.INSTANCE = new zl(); class Pc extends rt { constructor(e) { super(Ue.MODE), this.mode = e; } /** *

This action is implemented by calling {@link Lexer//mode} with the * value provided by {@link //getMode}.

*/ execute(e) { e.mode(this.mode); } updateHashCode(e) { e.update(this.actionType, this.mode); } equals(e) { return this === e ? !0 : e instanceof Pc ? this.mode === e.mode : !1; } toString() { return "mode(" + this.mode + ")"; } } const gr = 4; function y8(n, e) { const t = []; return t[n - 1] = e, t.map(function(i) { return e; }); } class FE { constructor(e) { e == null && (e = J5.defaultOptions), this.deserializationOptions = e, this.stateFactories = null, this.actionFactories = null; } deserialize(e) { const t = this.reset(e); this.checkVersion(t), t && this.skipUUID(); const i = this.readATN(); this.readStates(i, t), this.readRules(i, t), this.readModes(i); const s = []; return this.readSets(i, s, this.readInt.bind(this)), t && this.readSets(i, s, this.readInt32.bind(this)), this.readEdges(i, s), this.readDecisions(i), this.readLexerActions(i, t), this.markPrecedenceDecisions(i), this.verifyATN(i), this.deserializationOptions.generateRuleBypassTransitions && i.grammarType === A8.PARSER && (this.generateRuleBypassTransitions(i), this.verifyATN(i)), i; } reset(e) { if ((e.charCodeAt ? e.charCodeAt(0) : e[0]) === gr - 1) { const i = function(l) { const c = l.charCodeAt(0); return c > 1 ? c - 2 : c + 65534; }, s = e.split("").map(i); return s[0] = e.charCodeAt(0), this.data = s, this.pos = 0, !0; } else return this.data = e, this.pos = 0, !1; } skipUUID() { let e = 0; for (; e++ < 8; ) this.readInt(); } checkVersion(e) { const t = this.readInt(); if (!e && t !== gr) throw "Could not deserialize ATN with version " + t + " (expected " + gr + ")."; } readATN() { const e = this.readInt(), t = this.readInt(); return new G1(e, t); } readStates(e, t) { let i, s, l; const c = [], d = [], L = this.readInt(); for (let m = 0; m < L; m++) { const f = this.readInt(); if (f === O2.INVALID_TYPE) { e.addState(null); continue; } let h = this.readInt(); t && h === 65535 && (h = -1); const v = this.stateFactory(f, h); if (f === O2.LOOP_END) { const R = this.readInt(); c.push([v, R]); } else if (v instanceof _0) { const R = this.readInt(); d.push([v, R]); } e.addState(v); } for (i = 0; i < c.length; i++) s = c[i], s[0].loopBackState = e.states[s[1]]; for (i = 0; i < d.length; i++) s = d[i], s[0].endState = e.states[s[1]]; let _ = this.readInt(); for (i = 0; i < _; i++) l = this.readInt(), e.states[l].nonGreedy = !0; let p = this.readInt(); for (i = 0; i < p; i++) l = this.readInt(), e.states[l].isPrecedenceRule = !0; } readRules(e, t) { let i; const s = this.readInt(); for (e.grammarType === A8.LEXER && (e.ruleToTokenType = y8(s, 0)), e.ruleToStartState = y8(s, 0), i = 0; i < s; i++) { const l = this.readInt(); if (e.ruleToStartState[i] = e.states[l], e.grammarType === A8.LEXER) { let c = this.readInt(); t && c === 65535 && (c = m2.EOF), e.ruleToTokenType[i] = c; } } for (e.ruleToStopState = y8(s, 0), i = 0; i < e.states.length; i++) { const l = e.states[i]; l instanceof We && (e.ruleToStopState[l.ruleIndex] = l, e.ruleToStartState[l.ruleIndex].stopState = l); } } readModes(e) { const t = this.readInt(); for (let i = 0; i < t; i++) { let s = this.readInt(); e.modeToStartState.push(e.states[s]); } } readSets(e, t, i) { const s = this.readInt(); for (let l = 0; l < s; l++) { const c = new X3(); t.push(c); const d = this.readInt(); this.readInt() !== 0 && c.addOne(-1); for (let _ = 0; _ < d; _++) { const p = i(), m = i(); c.addRange(p, m); } } } readEdges(e, t) { let i, s, l, c, d; const L = this.readInt(); for (i = 0; i < L; i++) { const _ = this.readInt(), p = this.readInt(), m = this.readInt(), f = this.readInt(), h = this.readInt(), v = this.readInt(); c = this.edgeFactory(e, m, _, p, f, h, v, t), e.states[_].addTransition(c); } for (i = 0; i < e.states.length; i++) for (l = e.states[i], s = 0; s < l.transitions.length; s++) { const _ = l.transitions[s]; if (!(_ instanceof J8)) continue; let p = -1; e.ruleToStartState[_.target.ruleIndex].isPrecedenceRule && _.precedence === 0 && (p = _.target.ruleIndex), c = new y5(_.followState, p), e.ruleToStopState[_.target.ruleIndex].addTransition(c); } for (i = 0; i < e.states.length; i++) { if (l = e.states[i], l instanceof _0) { if (l.endState === null || l.endState.startState !== null) throw "IllegalState"; l.endState.startState = l; } if (l instanceof G_) for (s = 0; s < l.transitions.length; s++) d = l.transitions[s].target, d instanceof Cr && (d.loopBackState = l); else if (l instanceof Lr) for (s = 0; s < l.transitions.length; s++) d = l.transitions[s].target, d instanceof h9 && (d.loopBackState = l); } } readDecisions(e) { const t = this.readInt(); for (let i = 0; i < t; i++) { const s = this.readInt(), l = e.states[s]; e.decisionToState.push(l), l.decision = i; } } readLexerActions(e, t) { if (e.grammarType === A8.LEXER) { const i = this.readInt(); e.lexerActions = y8(i, null); for (let s = 0; s < i; s++) { const l = this.readInt(); let c = this.readInt(); t && c === 65535 && (c = -1); let d = this.readInt(); t && d === 65535 && (d = -1), e.lexerActions[s] = this.lexerActionFactory(l, c, d); } } } generateRuleBypassTransitions(e) { let t; const i = e.ruleToStartState.length; for (t = 0; t < i; t++) e.ruleToTokenType[t] = e.maxTokenType + t + 1; for (t = 0; t < i; t++) this.generateRuleBypassTransition(e, t); } generateRuleBypassTransition(e, t) { let i, s; const l = new z_(); l.ruleIndex = t, e.addState(l); const c = new dr(); c.ruleIndex = t, e.addState(c), l.endState = c, e.defineDecisionState(l), c.startState = l; let d = null, L = null; if (e.ruleToStartState[t].isPrecedenceRule) { for (L = null, i = 0; i < e.states.length; i++) if (s = e.states[i], this.stateIsEndStateFor(s, t)) { L = s, d = s.loopBackState.transitions[0]; break; } if (d === null) throw "Couldn't identify final state of the precedence rule prefix section."; } else L = e.ruleToStopState[t]; for (i = 0; i < e.states.length; i++) { s = e.states[i]; for (let f = 0; f < s.transitions.length; f++) { const h = s.transitions[f]; h !== d && h.target === L && (h.target = c); } } const _ = e.ruleToStartState[t], p = _.transitions.length; for (; p > 0; ) l.addTransition(_.transitions[p - 1]), _.transitions = _.transitions.slice(-1); e.ruleToStartState[t].addTransition(new y5(l)), c.addTransition(new y5(L)); const m = new Z_(); e.addState(m), m.addTransition(new H8(c, e.ruleToTokenType[t])), l.addTransition(new y5(m)); } stateIsEndStateFor(e, t) { if (e.ruleIndex !== t || !(e instanceof h9)) return null; const i = e.transitions[e.transitions.length - 1].target; return i instanceof l0 && i.epsilonOnlyTransitions && i.transitions[0].target instanceof We ? e : null; } /** * Analyze the {@link StarLoopEntryState} states in the specified ATN to set * the {@link StarLoopEntryState//isPrecedenceDecision} field to the * correct value. * @param atn The ATN. */ markPrecedenceDecisions(e) { for (let t = 0; t < e.states.length; t++) { const i = e.states[t]; if (i instanceof h9 && e.ruleToStartState[i.ruleIndex].isPrecedenceRule) { const s = i.transitions[i.transitions.length - 1].target; s instanceof l0 && s.epsilonOnlyTransitions && s.transitions[0].target instanceof We && (i.isPrecedenceDecision = !0); } } } verifyATN(e) { if (this.deserializationOptions.verifyATN) for (let t = 0; t < e.states.length; t++) { const i = e.states[t]; if (i !== null) if (this.checkCondition(i.epsilonOnlyTransitions || i.transitions.length <= 1), i instanceof Cr) this.checkCondition(i.loopBackState !== null); else if (i instanceof h9) if (this.checkCondition(i.loopBackState !== null), this.checkCondition(i.transitions.length === 2), i.transitions[0].target instanceof _r) this.checkCondition(i.transitions[1].target instanceof l0), this.checkCondition(!i.nonGreedy); else if (i.transitions[0].target instanceof l0) this.checkCondition(i.transitions[1].target instanceof _r), this.checkCondition(i.nonGreedy); else throw "IllegalState"; else i instanceof Lr ? (this.checkCondition(i.transitions.length === 1), this.checkCondition(i.transitions[0].target instanceof h9)) : i instanceof l0 ? this.checkCondition(i.loopBackState !== null) : i instanceof B_ ? this.checkCondition(i.stopState !== null) : i instanceof _0 ? this.checkCondition(i.endState !== null) : i instanceof dr ? this.checkCondition(i.startState !== null) : i instanceof x0 ? this.checkCondition(i.transitions.length <= 1 || i.decision >= 0) : this.checkCondition(i.transitions.length <= 1 || i instanceof We); } } checkCondition(e, t) { if (!e) throw t == null && (t = "IllegalState"), t; } readInt() { return this.data[this.pos++]; } readInt32() { const e = this.readInt(), t = this.readInt(); return e | t << 16; } edgeFactory(e, t, i, s, l, c, d, L) { const _ = e.states[s]; switch (t) { case b2.EPSILON: return new y5(_); case b2.RANGE: return d !== 0 ? new H_(_, m2.EOF, c) : new H_(_, l, c); case b2.RULE: return new J8(e.states[l], c, d, _); case b2.PREDICATE: return new PE(_, l, c, d !== 0); case b2.PRECEDENCE: return new Nx(_, l); case b2.ATOM: return d !== 0 ? new H8(_, m2.EOF) : new H8(_, l); case b2.ACTION: return new kE(_, l, c, d !== 0); case b2.SET: return new wc(_, L[l]); case b2.NOT_SET: return new Mc(_, L[l]); case b2.WILDCARD: return new OE(_); default: throw "The specified transition type: " + t + " is not valid."; } } stateFactory(e, t) { if (this.stateFactories === null) { const i = []; i[O2.INVALID_TYPE] = null, i[O2.BASIC] = () => new Z_(), i[O2.RULE_START] = () => new B_(), i[O2.BLOCK_START] = () => new z_(), i[O2.PLUS_BLOCK_START] = () => new Cr(), i[O2.STAR_BLOCK_START] = () => new _r(), i[O2.TOKEN_START] = () => new yx(), i[O2.RULE_STOP] = () => new We(), i[O2.BLOCK_END] = () => new dr(), i[O2.STAR_LOOP_BACK] = () => new Lr(), i[O2.STAR_LOOP_ENTRY] = () => new h9(), i[O2.PLUS_LOOP_BACK] = () => new G_(), i[O2.LOOP_END] = () => new l0(), this.stateFactories = i; } if (e > this.stateFactories.length || this.stateFactories[e] === null) throw "The specified state type " + e + " is not valid."; { const i = this.stateFactories[e](); if (i !== null) return i.ruleIndex = t, i; } } lexerActionFactory(e, t, i) { if (this.actionFactories === null) { const s = []; s[Ue.CHANNEL] = (l, c) => new Oc(l), s[Ue.CUSTOM] = (l, c) => new Ic(l, c), s[Ue.MODE] = (l, c) => new Pc(l), s[Ue.MORE] = (l, c) => Gl.INSTANCE, s[Ue.POP_MODE] = (l, c) => zl.INSTANCE, s[Ue.PUSH_MODE] = (l, c) => new kc(l), s[Ue.SKIP] = (l, c) => Bl.INSTANCE, s[Ue.TYPE] = (l, c) => new Dc(l), this.actionFactories = s; } if (e > this.actionFactories.length || this.actionFactories[e] === null) throw "The specified lexer action type " + e + " is not valid."; return this.actionFactories[e](t, i); } } class v6 { syntaxError(e, t, i, s, l, c) { } reportAmbiguity(e, t, i, s, l, c, d) { } reportAttemptingFullContext(e, t, i, s, l, c) { } reportContextSensitivity(e, t, i, s, l, c) { } } class Hl extends v6 { constructor() { super(); } syntaxError(e, t, i, s, l, c) { console.error("line " + i + ":" + s + " " + l); } } Hl.INSTANCE = new Hl(); class Ox extends v6 { constructor(e) { if (super(), e === null) throw "delegates"; return this.delegates = e, this; } syntaxError(e, t, i, s, l, c) { this.delegates.map((d) => d.syntaxError(e, t, i, s, l, c)); } reportAmbiguity(e, t, i, s, l, c, d) { this.delegates.map((L) => L.reportAmbiguity(e, t, i, s, l, c, d)); } reportAttemptingFullContext(e, t, i, s, l, c) { this.delegates.map((d) => d.reportAttemptingFullContext(e, t, i, s, l, c)); } reportContextSensitivity(e, t, i, s, l, c) { this.delegates.map((d) => d.reportContextSensitivity(e, t, i, s, l, c)); } } class R6 { constructor() { this._listeners = [Hl.INSTANCE], this._interp = null, this._stateNumber = -1; } checkVersion(e) { const t = "4.11.0"; t !== e && console.log("ANTLR runtime and generated code versions disagree: " + t + "!=" + e); } addErrorListener(e) { this._listeners.push(e); } removeErrorListeners() { this._listeners = []; } getLiteralNames() { return Object.getPrototypeOf(this).constructor.literalNames || []; } getSymbolicNames() { return Object.getPrototypeOf(this).constructor.symbolicNames || []; } getTokenNames() { if (!this.tokenNames) { const e = this.getLiteralNames(), t = this.getSymbolicNames(), i = e.length > t.length ? e.length : t.length; this.tokenNames = []; for (let s = 0; s < i; s++) this.tokenNames[s] = e[s] || t[s] || "Used for XPath and tree pattern compilation.

*/ getRuleIndexMap() { const e = this.ruleNames; if (e === null) throw "The current recognizer does not provide a list of rule names."; let t = this.ruleIndexMapCache[e]; return t === void 0 && (t = e.reduce(function(i, s, l) { i[s] = l; }), this.ruleIndexMapCache[e] = t), t; } getTokenType(e) { const t = this.getTokenTypeMap()[e]; return t !== void 0 ? t : m2.INVALID_TYPE; } // What is the error header, normally line/character position information? getErrorHeader(e) { const t = e.getOffendingToken().line, i = e.getOffendingToken().column; return "line " + t + ":" + i; } /** * How should a token be displayed in an error message? The default * is to display just the text, but during development you might * want to have a lot of information spit out. Override in that case * to use t.toString() (which, for CommonToken, dumps everything about * the token). This is better than forcing you to override a method in * your token objects because you don't have to go modify your lexer * so that it creates a new Java type. * * @deprecated This method is not called by the ANTLR 4 Runtime. Specific * implementations of {@link ANTLRErrorStrategy} may provide a similar * feature when necessary. For example, see * {@link DefaultErrorStrategy//getTokenErrorDisplay}.*/ getTokenErrorDisplay(e) { if (e === null) return ""; let t = e.text; return t === null && (e.type === m2.EOF ? t = "" : t = "<" + e.type + ">"), t = t.replace(` `, "\\n").replace("\r", "\\r").replace(" ", "\\t"), "'" + t + "'"; } getErrorListenerDispatch() { return new Ox(this._listeners); } /** * subclass needs to override these if there are sempreds or actions * that the ATN interp needs to execute */ sempred(e, t, i) { return !0; } precpred(e, t) { return !0; } get state() { return this._stateNumber; } set state(e) { this._stateNumber = e; } } R6.tokenTypeMapCache = {}; R6.ruleIndexMapCache = {}; class b9 extends m2 { constructor(e, t, i, s, l) { super(), this.source = e !== void 0 ? e : b9.EMPTY_SOURCE, this.type = t !== void 0 ? t : null, this.channel = i !== void 0 ? i : m2.DEFAULT_CHANNEL, this.start = s !== void 0 ? s : -1, this.stop = l !== void 0 ? l : -1, this.tokenIndex = -1, this.source[0] !== null ? (this.line = e[0].line, this.column = e[0].column) : this.column = -1; } /** * Constructs a new {@link CommonToken} as a copy of another {@link Token}. * *

* If {@code oldToken} is also a {@link CommonToken} instance, the newly * constructed token will share a reference to the {@link //text} field and * the {@link Pair} stored in {@link //source}. Otherwise, {@link //text} will * be assigned the result of calling {@link //getText}, and {@link //source} * will be constructed from the result of {@link Token//getTokenSource} and * {@link Token//getInputStream}.

* * @param oldToken The token to copy. */ clone() { const e = new b9(this.source, this.type, this.channel, this.start, this.stop); return e.tokenIndex = this.tokenIndex, e.line = this.line, e.column = this.column, e.text = this.text, e; } toString() { let e = this.text; return e !== null ? e = e.replace(/\n/g, "\\n").replace(/\r/g, "\\r").replace(/\t/g, "\\t") : e = "", "[@" + this.tokenIndex + "," + this.start + ":" + this.stop + "='" + e + "',<" + this.type + ">" + (this.channel > 0 ? ",channel=" + this.channel : "") + "," + this.line + ":" + this.column + "]"; } get text() { if (this._text !== null) return this._text; const e = this.getInputStream(); if (e === null) return null; const t = e.size; return this.start < t && this.stop < t ? e.getText(this.start, this.stop) : ""; } set text(e) { this._text = e; } } b9.EMPTY_SOURCE = [null, null]; class Ix { } class Yl extends Ix { constructor(e) { super(), this.copyText = e === void 0 ? !1 : e; } create(e, t, i, s, l, c, d, L) { const _ = new b9(e, t, s, l, c); return _.line = d, _.column = L, i !== null ? _.text = i : this.copyText && e[1] !== null && (_.text = e[1].getText(l, c)), _; } createThin(e, t) { const i = new b9(null, e); return i.text = t, i; } } Yl.DEFAULT = new Yl(); class Kt extends Error { constructor(e) { super(e.message), Error.captureStackTrace && Error.captureStackTrace(this, Kt), this.message = e.message, this.recognizer = e.recognizer, this.input = e.input, this.ctx = e.ctx, this.offendingToken = null, this.offendingState = -1, this.recognizer !== null && (this.offendingState = this.recognizer.state); } /** * Gets the set of input symbols which could potentially follow the * previously matched symbol at the time this exception was thrown. * *

If the set of expected tokens is not known and could not be computed, * this method returns {@code null}.

* * @return The set of token types that could potentially follow the current * state in the ATN, or {@code null} if the information is not available. */ getExpectedTokens() { return this.recognizer !== null ? this.recognizer.atn.getExpectedTokens(this.offendingState, this.ctx) : null; } //

If the state number is not known, this method returns -1.

toString() { return this.message; } } class Fc extends Kt { constructor(e, t, i, s) { super({ message: "", recognizer: e, input: t, ctx: null }), this.startIndex = i, this.deadEndConfigs = s; } toString() { let e = ""; return this.startIndex >= 0 && this.startIndex < this.input.size && (e = this.input.getText(new m1(this.startIndex, this.startIndex))), "LexerNoViableAltException" + e; } } let Ke = class Ft extends R6 { constructor(e) { super(), this._input = e, this._factory = Yl.DEFAULT, this._tokenFactorySourcePair = [this, e], this._interp = null, this._token = null, this._tokenStartCharIndex = -1, this._tokenStartLine = -1, this._tokenStartColumn = -1, this._hitEOF = !1, this._channel = m2.DEFAULT_CHANNEL, this._type = m2.INVALID_TYPE, this._modeStack = [], this._mode = Ft.DEFAULT_MODE, this._text = null; } reset() { this._input !== null && this._input.seek(0), this._token = null, this._type = m2.INVALID_TYPE, this._channel = m2.DEFAULT_CHANNEL, this._tokenStartCharIndex = -1, this._tokenStartColumn = -1, this._tokenStartLine = -1, this._text = null, this._hitEOF = !1, this._mode = Ft.DEFAULT_MODE, this._modeStack = [], this._interp.reset(); } // Return a token from this source; i.e., match a token on the char stream. nextToken() { if (this._input === null) throw "nextToken requires a non-null input stream."; const e = this._input.mark(); try { for (; ; ) { if (this._hitEOF) return this.emitEOF(), this._token; this._token = null, this._channel = m2.DEFAULT_CHANNEL, this._tokenStartCharIndex = this._input.index, this._tokenStartColumn = this._interp.column, this._tokenStartLine = this._interp.line, this._text = null; let t = !1; for (; ; ) { this._type = m2.INVALID_TYPE; let i = Ft.SKIP; try { i = this._interp.match(this._input, this._mode); } catch (s) { if (s instanceof Kt) this.notifyListeners(s), this.recover(s); else throw console.log(s.stack), s; } if (this._input.LA(1) === m2.EOF && (this._hitEOF = !0), this._type === m2.INVALID_TYPE && (this._type = i), this._type === Ft.SKIP) { t = !0; break; } if (this._type !== Ft.MORE) break; } if (!t) return this._token === null && this.emit(), this._token; } } finally { this._input.release(e); } } /** * Instruct the lexer to skip creating a token for current lexer rule * and look for another token. nextToken() knows to keep looking when * a lexer rule finishes with token set to SKIP_TOKEN. Recall that * if token==null at end of any token rule, it creates one for you * and emits it. */ skip() { this._type = Ft.SKIP; } more() { this._type = Ft.MORE; } mode(e) { this._mode = e; } pushMode(e) { this._interp.debug && console.log("pushMode " + e), this._modeStack.push(this._mode), this.mode(e); } popMode() { if (this._modeStack.length === 0) throw "Empty Stack"; return this._interp.debug && console.log("popMode back to " + this._modeStack.slice(0, -1)), this.mode(this._modeStack.pop()), this._mode; } /** * By default does not support multiple emits per nextToken invocation * for efficiency reasons. Subclass and override this method, nextToken, * and getToken (to push tokens into a list and pull from that list * rather than a single variable as this implementation does). */ emitToken(e) { this._token = e; } /** * The standard method called to automatically emit a token at the * outermost lexical rule. The token object should point into the * char buffer start..stop. If there is a text override in 'text', * use that to set the token's text. Override this method to emit * custom Token objects or provide a new factory. */ emit() { const e = this._factory.create( this._tokenFactorySourcePair, this._type, this._text, this._channel, this._tokenStartCharIndex, this.getCharIndex() - 1, this._tokenStartLine, this._tokenStartColumn ); return this.emitToken(e), e; } emitEOF() { const e = this.column, t = this.line, i = this._factory.create( this._tokenFactorySourcePair, m2.EOF, null, m2.DEFAULT_CHANNEL, this._input.index, this._input.index - 1, t, e ); return this.emitToken(i), i; } // What is the index of the current character of lookahead?/// getCharIndex() { return this._input.index; } /** * Return a list of all Token objects in input char stream. * Forces load of all tokens. Does not include EOF token. */ getAllTokens() { const e = []; let t = this.nextToken(); for (; t.type !== m2.EOF; ) e.push(t), t = this.nextToken(); return e; } notifyListeners(e) { const t = this._tokenStartCharIndex, i = this._input.index, s = this._input.getText(t, i), l = "token recognition error at: '" + this.getErrorDisplay(s) + "'"; this.getErrorListenerDispatch().syntaxError( this, null, this._tokenStartLine, this._tokenStartColumn, l, e ); } getErrorDisplay(e) { const t = []; for (let i = 0; i < e.length; i++) t.push(e[i]); return t.join(""); } getErrorDisplayForChar(e) { return e.charCodeAt(0) === m2.EOF ? "" : e === ` ` ? "\\n" : e === " " ? "\\t" : e === "\r" ? "\\r" : e; } getCharErrorDisplay(e) { return "'" + this.getErrorDisplayForChar(e) + "'"; } /** * Lexers can normally match any char in it's vocabulary after matching * a token, so do the easy thing and just kill a character and hope * it all works out. You can instead use the rule invocation stack * to do sophisticated error recovery if you are in a fragment rule. */ recover(e) { this._input.LA(1) !== m2.EOF && (e instanceof Fc ? this._interp.consume(this._input) : this._input.consume()); } get inputStream() { return this._input; } set inputStream(e) { this._input = null, this._tokenFactorySourcePair = [this, this._input], this.reset(), this._input = e, this._tokenFactorySourcePair = [this, this._input]; } get sourceName() { return this._input.sourceName; } get type() { return this._type; } set type(e) { this._type = e; } get line() { return this._interp.line; } set line(e) { this._interp.line = e; } get column() { return this._interp.column; } set column(e) { this._interp.column = e; } get text() { return this._text !== null ? this._text : this._interp.getText(this._input); } set text(e) { this._text = e; } }; Ke.DEFAULT_MODE = 0; Ke.MORE = -2; Ke.SKIP = -3; Ke.DEFAULT_TOKEN_CHANNEL = m2.DEFAULT_CHANNEL; Ke.HIDDEN = m2.HIDDEN_CHANNEL; Ke.MIN_CHAR_VALUE = 0; Ke.MAX_CHAR_VALUE = 1114111; function Dx(n) { return n.hashCodeForConfigSet(); } function kx(n, e) { return n === e ? !0 : n === null || e === null ? !1 : n.equalsForConfigSet(e); } class qe { constructor(e) { this.configLookup = new D3(Dx, kx), this.fullCtx = e === void 0 ? !0 : e, this.readOnly = !1, this.configs = [], this.uniqueAlt = 0, this.conflictingAlts = null, this.hasSemanticContext = !1, this.dipsIntoOuterContext = !1, this.cachedHashCode = -1; } /** * Adding a new config means merging contexts with existing configs for * {@code (s, i, pi, _)}, where {@code s} is the * {@link ATNConfig//state}, {@code i} is the {@link ATNConfig//alt}, and * {@code pi} is the {@link ATNConfig//semanticContext}. We use * {@code (s,i,pi)} as key. * *

This method updates {@link //dipsIntoOuterContext} and * {@link //hasSemanticContext} when necessary.

*/ add(e, t) { if (t === void 0 && (t = null), this.readOnly) throw "This set is readonly"; e.semanticContext !== h1.NONE && (this.hasSemanticContext = !0), e.reachesIntoOuterContext > 0 && (this.dipsIntoOuterContext = !0); const i = this.configLookup.add(e); if (i === e) return this.cachedHashCode = -1, this.configs.push(e), !0; const s = !this.fullCtx, l = Nc(i.context, e.context, s, t); return i.reachesIntoOuterContext = Math.max(i.reachesIntoOuterContext, e.reachesIntoOuterContext), e.precedenceFilterSuppressed && (i.precedenceFilterSuppressed = !0), i.context = l, !0; } getStates() { const e = new D3(); for (let t = 0; t < this.configs.length; t++) e.add(this.configs[t].state); return e; } getPredicates() { const e = []; for (let t = 0; t < this.configs.length; t++) { const i = this.configs[t].semanticContext; i !== h1.NONE && e.push(i.semanticContext); } return e; } optimizeConfigs(e) { if (this.readOnly) throw "This set is readonly"; if (this.configLookup.length !== 0) for (let t = 0; t < this.configs.length; t++) { const i = this.configs[t]; i.context = e.getCachedContext(i.context); } } addAll(e) { for (let t = 0; t < e.length; t++) this.add(e[t]); return !1; } equals(e) { return this === e || e instanceof qe && h0(this.configs, e.configs) && this.fullCtx === e.fullCtx && this.uniqueAlt === e.uniqueAlt && this.conflictingAlts === e.conflictingAlts && this.hasSemanticContext === e.hasSemanticContext && this.dipsIntoOuterContext === e.dipsIntoOuterContext; } hashCode() { const e = new F3(); return e.update(this.configs), e.finish(); } updateHashCode(e) { this.readOnly ? (this.cachedHashCode === -1 && (this.cachedHashCode = this.hashCode()), e.update(this.cachedHashCode)) : e.update(this.hashCode()); } isEmpty() { return this.configs.length === 0; } contains(e) { if (this.configLookup === null) throw "This method is not implemented for readonly sets."; return this.configLookup.contains(e); } containsFast(e) { if (this.configLookup === null) throw "This method is not implemented for readonly sets."; return this.configLookup.containsFast(e); } clear() { if (this.readOnly) throw "This set is readonly"; this.configs = [], this.cachedHashCode = -1, this.configLookup = new D3(); } setReadonly(e) { this.readOnly = e, e && (this.configLookup = null); } toString() { return Gt(this.configs) + (this.hasSemanticContext ? ",hasSemanticContext=" + this.hasSemanticContext : "") + (this.uniqueAlt !== G1.INVALID_ALT_NUMBER ? ",uniqueAlt=" + this.uniqueAlt : "") + (this.conflictingAlts !== null ? ",conflictingAlts=" + this.conflictingAlts : "") + (this.dipsIntoOuterContext ? ",dipsIntoOuterContext" : ""); } get items() { return this.configs; } get length() { return this.configs.length; } } class J4 { constructor(e, t) { return e === null && (e = -1), t === null && (t = new qe()), this.stateNumber = e, this.configs = t, this.edges = null, this.isAcceptState = !1, this.prediction = 0, this.lexerActionExecutor = null, this.requiresFullContext = !1, this.predicates = null, this; } /** * Get the set of all alts mentioned by all ATN configurations in this * DFA state. */ getAltSet() { const e = new D3(); if (this.configs !== null) for (let t = 0; t < this.configs.length; t++) { const i = this.configs[t]; e.add(i.alt); } return e.length === 0 ? null : e; } /** * 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(e) { return this === e || e instanceof J4 && this.configs.equals(e.configs); } toString() { let e = "" + this.stateNumber + ":" + this.configs; return this.isAcceptState && (e = e + "=>", this.predicates !== null ? e = e + this.predicates : e = e + this.prediction), e; } hashCode() { const e = new F3(); return e.update(this.configs), e.finish(); } } class w4 { constructor(e, t) { return this.atn = e, this.sharedContextCache = t, this; } getCachedContext(e) { if (this.sharedContextCache === null) return e; const t = new ln(); return DE(e, this.sharedContextCache, t); } } w4.ERROR = new J4(2147483647, new qe()); class Y_ extends qe { constructor() { super(), this.configLookup = new D3(); } } class d3 extends X1 { constructor(e, t) { super(e, t); const i = e.lexerActionExecutor || null; return this.lexerActionExecutor = i || (t !== null ? t.lexerActionExecutor : null), this.passedThroughNonGreedyDecision = t !== null ? this.checkNonGreedyDecision(t, this.state) : !1, this.hashCodeForConfigSet = d3.prototype.hashCode, this.equalsForConfigSet = d3.prototype.equals, this; } updateHashCode(e) { e.update(this.state.stateNumber, this.alt, this.context, this.semanticContext, this.passedThroughNonGreedyDecision, this.lexerActionExecutor); } equals(e) { return this === e || e instanceof d3 && this.passedThroughNonGreedyDecision === e.passedThroughNonGreedyDecision && (this.lexerActionExecutor ? this.lexerActionExecutor.equals(e.lexerActionExecutor) : !e.lexerActionExecutor) && super.equals(e); } checkNonGreedyDecision(e, t) { return e.passedThroughNonGreedyDecision || t instanceof x0 && t.nonGreedy; } } class Y5 extends rt { constructor(e, t) { super(t.actionType), this.offset = e, this.action = t, this.isPositionDependent = !0; } /** *

This method calls {@link //execute} on the result of {@link //getAction} * using the provided {@code lexer}.

*/ execute(e) { this.action.execute(e); } updateHashCode(e) { e.update(this.actionType, this.offset, this.action); } equals(e) { return this === e ? !0 : e instanceof Y5 ? this.offset === e.offset && this.action === e.action : !1; } } class L0 { /** * 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.

*/ constructor(e) { return this.lexerActions = e === null ? [] : e, this.cachedHashCode = F3.hashStuff(e), this; } /** * 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 {LexerActionExecutor} A {@link LexerActionExecutor} which stores input stream offsets * for all position-dependent lexer actions. */ fixOffsetBeforeMatch(e) { let t = null; for (let i = 0; i < this.lexerActions.length; i++) this.lexerActions[i].isPositionDependent && !(this.lexerActions[i] instanceof Y5) && (t === null && (t = this.lexerActions.concat([])), t[i] = new Y5( e, this.lexerActions[i] )); return t === null ? this : new L0(t); } /** * 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(e, t, i) { let s = !1; const l = t.index; try { for (let c = 0; c < this.lexerActions.length; c++) { let d = this.lexerActions[c]; if (d instanceof Y5) { const L = d.offset; t.seek(i + L), d = d.action, s = i + L !== l; } else d.isPositionDependent && (t.seek(l), s = !1); d.execute(e); } } finally { s && t.seek(l); } } hashCode() { return this.cachedHashCode; } updateHashCode(e) { e.update(this.cachedHashCode); } equals(e) { if (this === e) return !0; if (e instanceof L0) { if (this.cachedHashCode != e.cachedHashCode) return !1; if (this.lexerActions.length != e.lexerActions.length) return !1; { const t = this.lexerActions.length; for (let i = 0; i < t; ++i) if (!this.lexerActions[i].equals(e.lexerActions[i])) return !1; return !0; } } else return !1; } /** * 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 LexerATNConfig}. 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 {LexerActionExecutor} A {@link LexerActionExecutor} for executing the combine actions * of {@code lexerActionExecutor} and {@code lexerAction}. */ static append(e, t) { if (e === null) return new L0([t]); const i = e.lexerActions.concat([t]); return new L0(i); } } function V_(n) { n.index = -1, n.line = 0, n.column = -1, n.dfaState = null; } class Px { constructor() { V_(this); } reset() { V_(this); } } class q1 extends w4 { /** * 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.

*/ constructor(e, t, i, s) { super(t, s), this.decisionToDFA = i, this.recog = e, this.startIndex = -1, this.line = 1, this.column = 0, this.mode = Ke.DEFAULT_MODE, this.prevAccept = new Px(); } copyState(e) { this.column = e.column, this.line = e.line, this.mode = e.mode, this.startIndex = e.startIndex; } match(e, t) { this.mode = t; const i = e.mark(); try { this.startIndex = e.index, this.prevAccept.reset(); const s = this.decisionToDFA[t]; return s.s0 === null ? this.matchATN(e) : this.execATN(e, s.s0); } finally { e.release(i); } } reset() { this.prevAccept.reset(), this.startIndex = -1, this.line = 1, this.column = 0, this.mode = Ke.DEFAULT_MODE; } matchATN(e) { const t = this.atn.modeToStartState[this.mode]; q1.debug && console.log("matchATN mode " + this.mode + " start: " + t); const i = this.mode, s = this.computeStartState(e, t), l = s.hasSemanticContext; s.hasSemanticContext = !1; const c = this.addDFAState(s); l || (this.decisionToDFA[this.mode].s0 = c); const d = this.execATN(e, c); return q1.debug && console.log("DFA after matchATN: " + this.decisionToDFA[i].toLexerString()), d; } execATN(e, t) { q1.debug && console.log("start state closure=" + t.configs), t.isAcceptState && this.captureSimState(this.prevAccept, e, t); let i = e.LA(1), s = t; for (; ; ) { q1.debug && console.log("execATN loop starting closure: " + s.configs); let l = this.getExistingTargetState(s, i); if (l === null && (l = this.computeTargetState(e, s, i)), l === w4.ERROR || (i !== m2.EOF && this.consume(e), l.isAcceptState && (this.captureSimState(this.prevAccept, e, l), i === m2.EOF))) break; i = e.LA(1), s = l; } return this.failOrAccept(this.prevAccept, e, s.configs, i); } /** * 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(e, t) { if (e.edges === null || t < q1.MIN_DFA_EDGE || t > q1.MAX_DFA_EDGE) return null; let i = e.edges[t - q1.MIN_DFA_EDGE]; return i === void 0 && (i = null), q1.debug && i !== null && console.log("reuse state " + e.stateNumber + " edge to " + i.stateNumber), i; } /** * 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(e, t, i) { const s = new Y_(); return this.getReachableConfigSet(e, t.configs, s, i), s.items.length === 0 ? (s.hasSemanticContext || this.addDFAEdge(t, i, w4.ERROR), w4.ERROR) : this.addDFAEdge(t, i, null, s); } failOrAccept(e, t, i, s) { if (this.prevAccept.dfaState !== null) { const l = e.dfaState.lexerActionExecutor; return this.accept( t, l, this.startIndex, e.index, e.line, e.column ), e.dfaState.prediction; } else { if (s === m2.EOF && t.index === this.startIndex) return m2.EOF; throw new Fc(this.recog, t, this.startIndex, i); } } /** * 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(e, t, i, s) { let l = G1.INVALID_ALT_NUMBER; for (let c = 0; c < t.items.length; c++) { const d = t.items[c], L = d.alt === l; if (!(L && d.passedThroughNonGreedyDecision)) { q1.debug && console.log(`testing %s at %s `, this.getTokenName(s), d.toString(this.recog, !0)); for (let _ = 0; _ < d.state.transitions.length; _++) { const p = d.state.transitions[_], m = this.getReachableTarget(p, s); if (m !== null) { let f = d.lexerActionExecutor; f !== null && (f = f.fixOffsetBeforeMatch(e.index - this.startIndex)); const h = s === m2.EOF, v = new d3({ state: m, lexerActionExecutor: f }, d); this.closure( e, v, i, L, !0, h ) && (l = d.alt); } } } } } accept(e, t, i, s, l, c) { q1.debug && console.log(`ACTION %s `, t), e.seek(s), this.line = l, this.column = c, t !== null && this.recog !== null && t.execute(this.recog, e, i); } getReachableTarget(e, t) { return e.matches(t, 0, Ke.MAX_CHAR_VALUE) ? e.target : null; } computeStartState(e, t) { const i = t1.EMPTY, s = new Y_(); for (let l = 0; l < t.transitions.length; l++) { const c = t.transitions[l].target, d = new d3({ state: c, alt: l + 1, context: i }, null); this.closure(e, d, s, !1, !1, !1); } return s; } /** * 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 {Boolean} {@code true} if an accept state is reached, otherwise * {@code false}. */ closure(e, t, i, s, l, c) { let d = null; if (q1.debug && console.log("closure(" + t.toString(this.recog, !0) + ")"), t.state instanceof We) { if (q1.debug && (this.recog !== null ? console.log(`closure at %s rule stop %s `, this.recog.ruleNames[t.state.ruleIndex], t) : console.log(`closure at rule stop %s `, t)), t.context === null || t.context.hasEmptyPath()) { if (t.context === null || t.context.isEmpty()) return i.add(t), !0; i.add(new d3({ state: t.state, context: t1.EMPTY }, t)), s = !0; } if (t.context !== null && !t.context.isEmpty()) { for (let L = 0; L < t.context.length; L++) if (t.context.getReturnState(L) !== t1.EMPTY_RETURN_STATE) { const _ = t.context.getParent(L), p = this.atn.states[t.context.getReturnState(L)]; d = new d3({ state: p, context: _ }, t), s = this.closure( e, d, i, s, l, c ); } } return s; } t.state.epsilonOnlyTransitions || (!s || !t.passedThroughNonGreedyDecision) && i.add(t); for (let L = 0; L < t.state.transitions.length; L++) { const _ = t.state.transitions[L]; d = this.getEpsilonTarget(e, t, _, i, l, c), d !== null && (s = this.closure( e, d, i, s, l, c )); } return s; } // side-effect: can alter configs.hasSemanticContext getEpsilonTarget(e, t, i, s, l, c) { let d = null; if (i.serializationType === b2.RULE) { const L = $e.create(t.context, i.followState.stateNumber); d = new d3({ state: i.target, context: L }, t); } else { if (i.serializationType === b2.PRECEDENCE) throw "Precedence predicates are not supported in lexers."; if (i.serializationType === b2.PREDICATE) q1.debug && console.log("EVAL rule " + i.ruleIndex + ":" + i.predIndex), s.hasSemanticContext = !0, this.evaluatePredicate(e, i.ruleIndex, i.predIndex, l) && (d = new d3({ state: i.target }, t)); else if (i.serializationType === b2.ACTION) if (t.context === null || t.context.hasEmptyPath()) { const L = L0.append( t.lexerActionExecutor, this.atn.lexerActions[i.actionIndex] ); d = new d3({ state: i.target, lexerActionExecutor: L }, t); } else d = new d3({ state: i.target }, t); else i.serializationType === b2.EPSILON ? d = new d3({ state: i.target }, t) : (i.serializationType === b2.ATOM || i.serializationType === b2.RANGE || i.serializationType === b2.SET) && c && i.matches(m2.EOF, 0, Ke.MAX_CHAR_VALUE) && (d = new d3({ state: i.target }, t)); } return d; } /** * 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//getcolumn}, 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(e, t, i, s) { if (this.recog === null) return !0; if (!s) return this.recog.sempred(null, t, i); const l = this.column, c = this.line, d = e.index, L = e.mark(); try { return this.consume(e), this.recog.sempred(null, t, i); } finally { this.column = l, this.line = c, e.seek(d), e.release(L); } } captureSimState(e, t, i) { e.index = t.index, e.line = this.line, e.column = this.column, e.dfaState = i; } addDFAEdge(e, t, i, s) { if (i === void 0 && (i = null), s === void 0 && (s = null), i === null && s !== null) { const l = s.hasSemanticContext; if (s.hasSemanticContext = !1, i = this.addDFAState(s), l) return i; } return t < q1.MIN_DFA_EDGE || t > q1.MAX_DFA_EDGE || (q1.debug && console.log("EDGE " + e + " -> " + i + " upon " + t), e.edges === null && (e.edges = []), e.edges[t - q1.MIN_DFA_EDGE] = i), i; } /** * 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(e) { const t = new J4(null, e); let i = null; for (let d = 0; d < e.items.length; d++) { const L = e.items[d]; if (L.state instanceof We) { i = L; break; } } i !== null && (t.isAcceptState = !0, t.lexerActionExecutor = i.lexerActionExecutor, t.prediction = this.atn.ruleToTokenType[i.state.ruleIndex]); const s = this.decisionToDFA[this.mode], l = s.states.get(t); if (l !== null) return l; const c = t; return c.stateNumber = s.states.length, e.setReadonly(!0), c.configs = e, s.states.add(c), c; } getDFA(e) { return this.decisionToDFA[e]; } // Get the text matched so far for the current token. getText(e) { return e.getText(this.startIndex, e.index - 1); } consume(e) { e.LA(1) === 10 ? (this.line += 1, this.column = 0) : this.column += 1, e.consume(); } getTokenName(e) { return e === -1 ? "EOF" : "'" + String.fromCharCode(e) + "'"; } } q1.debug = !1; q1.dfa_debug = !1; q1.MIN_DFA_EDGE = 0; q1.MAX_DFA_EDGE = 127; class UE { constructor(e, t) { this.alt = t, this.pred = e; } toString() { return "(" + this.pred + ", " + this.alt + ")"; } } class Fx { constructor() { this.data = {}; } get(e) { return this.data["k-" + e] || null; } set(e, t) { this.data["k-" + e] = t; } values() { return Object.keys(this.data).filter((e) => e.startsWith("k-")).map((e) => this.data[e], this); } } const y1 = { /** * 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, /** * * Computes the SLL prediction termination condition. * *

* This method computes the SLL prediction termination condition for both of * the following cases.

* *

The usual SLL+LL fallback upon SLL conflict
Pure SLL without LL fallback

* *

COMBINED SLL+LL PARSING

* *

When LL-fallback is enabled upon SLL conflict, correct predictions are * ensured regardless of how the termination condition is computed by this * method. Due to the substantially higher cost of LL prediction, the * prediction should only fall back to LL when the additional lookahead * cannot lead to a unique SLL prediction.

* *

Assuming combined SLL+LL parsing, an SLL configuration set with only * conflicting subsets should fall back to full LL, even if the * configuration sets don't resolve to the same alternative (e.g. * {@code {1,2}} and {@code {3,4}}. If there is at least one non-conflicting * configuration, SLL could continue with the hopes that more lookahead will * resolve via one of those non-conflicting configurations.

* *

Here's the prediction termination rule them: SLL (for SLL+LL parsing) * stops when it sees only conflicting configuration subsets. In contrast, * full LL keeps going when there is uncertainty.

* *

HEURISTIC

* *

As a heuristic, we stop prediction when we see any conflicting subset * unless we see a state that only has one alternative associated with it. * The single-alt-state thing lets prediction continue upon rules like * (otherwise, it would admit defeat too soon):

* *

{@code [12|1|[], 6|2|[], 12|2|[]]. s : (ID | ID ID?) ';' ;}

* *

When the ATN simulation reaches the state before {@code ';'}, it has a * DFA state that looks like: {@code [12|1|[], 6|2|[], 12|2|[]]}. Naturally * {@code 12|1|[]} and {@code 12|2|[]} conflict, but we cannot stop * processing this node because alternative to has another way to continue, * via {@code [6|2|[]]}.

* *

It also let's us continue for this rule:

* *

{@code [1|1|[], 1|2|[], 8|3|[]] a : A | A | A B ;}

* *

After matching input A, we reach the stop state for rule A, state 1. * State 8 is the state right before B. Clearly alternatives 1 and 2 * conflict and no amount of further lookahead will separate the two. * However, alternative 3 will be able to continue and so we do not stop * working on this state. In the previous example, we're concerned with * states associated with the conflicting alternatives. Here alt 3 is not * associated with the conflicting configs, but since we can continue * looking for input reasonably, don't declare the state done.

* *

PURE SLL PARSING

* *

To handle pure SLL parsing, all we have to do is make sure that we * combine stack contexts for configurations that differ only by semantic * predicate. From there, we can do the usual SLL termination heuristic.

* *

PREDICATES IN SLL+LL PARSING

* *

SLL decisions don't evaluate predicates until after they reach DFA stop * states because they need to create the DFA cache that works in all * semantic situations. In contrast, full LL evaluates predicates collected * during start state computation so it can ignore predicates thereafter. * This means that SLL termination detection can totally ignore semantic * predicates.

* *

Implementation-wise, {@link ATNConfigSet} combines stack contexts but not * semantic predicate contexts so we might see two configurations like the * following.

* *

{@code (s, 1, x, {}), (s, 1, x', {p})}

* *

Before testing these configurations against others, we have to merge * {@code x} and {@code x'} (without modifying the existing configurations). * For example, we test {@code (x+x')==x''} when looking for conflicts in * the following configurations.

* *

{@code (s, 1, x, {}), (s, 1, x', {p}), (s, 2, x'', {})}

* *

If the configuration set has predicates (as indicated by * {@link ATNConfigSet//hasSemanticContext}), this algorithm makes a copy of * the configurations to strip out all of the predicates so that a standard * {@link ATNConfigSet} will merge everything ignoring predicates.

*/ hasSLLConflictTerminatingPrediction: function(n, e) { if (y1.allConfigsInRuleStopStates(e)) return !0; if (n === y1.SLL && e.hasSemanticContext) { const i = new qe(); for (let s = 0; s < e.items.length; s++) { let l = e.items[s]; l = new X1({ semanticContext: h1.NONE }, l), i.add(l); } e = i; } const t = y1.getConflictingAltSubsets(e); return y1.hasConflictingAltSet(t) && !y1.hasStateAssociatedWithOneAlt(e); }, /** * 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} */ hasConfigInRuleStopState: function(n) { for (let e = 0; e < n.items.length; e++) if (n.items[e].state instanceof We) return !0; return !1; }, /** * 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} */ allConfigsInRuleStopStates: function(n) { for (let e = 0; e < n.items.length; e++) if (!(n.items[e].state instanceof We)) return !1; return !0; }, /** * * Full LL prediction termination. * *

Can we stop looking ahead during ATN simulation or is there some * uncertainty as to which alternative we will ultimately pick, after * consuming more input? Even if there are partial conflicts, we might know * that everything is going to resolve to the same minimum alternative. That * means we can stop since no more lookahead will change that fact. On the * other hand, there might be multiple conflicts that resolve to different * minimums. That means we need more look ahead to decide which of those * alternatives we should predict.

* *

The basic idea is to split the set of configurations {@code C}, into * conflicting subsets {@code (s, _, ctx, _)} and singleton subsets with * non-conflicting configurations. Two configurations conflict if they have * identical {@link ATNConfig//state} and {@link ATNConfig//context} values * but different {@link ATNConfig//alt} value, e.g. {@code (s, i, ctx, _)} * and {@code (s, j, ctx, _)} for {@code i!=j}.

* *

Reduce these configuration subsets to the set of possible alternatives. * You can compute the alternative subsets in one pass as follows:

* *

{@code A_s,ctx = {i | (s, i, ctx, _)}} for each configuration in * {@code C} holding {@code s} and {@code ctx} fixed.

* *

Or in pseudo-code, for each configuration {@code c} in {@code C}:

* *

   * map[c] U= c.{@link ATNConfig//alt alt} // map hash/equals uses s and x, not
   * alt and not pred
   *

* *

The values in {@code map} are the set of {@code A_s,ctx} sets.

* *

If {@code |A_s,ctx|=1} then there is no conflict associated with * {@code s} and {@code ctx}.

* *

Reduce the subsets to singletons by choosing a minimum of each subset. If * the union of these alternative subsets is a singleton, then no amount of * more lookahead will help us. We will always pick that alternative. If, * however, there is more than one alternative, then we are uncertain which * alternative to predict and must continue looking for resolution. We may * or may not discover an ambiguity in the future, even if there are no * conflicting subsets this round.

* *

The biggest sin is to terminate early because it means we've made a * decision but were uncertain as to the eventual outcome. We haven't used * enough lookahead. On the other hand, announcing a conflict too late is no * big deal; you will still have the conflict. It's just inefficient. It * might even look until the end of file.

* *

No special consideration for semantic predicates is required because * predicates are evaluated on-the-fly for full LL prediction, ensuring that * no configuration contains a semantic context during the termination * check.

* *

CONFLICTING CONFIGS

* *

Two configurations {@code (s, i, x)} and {@code (s, j, x')}, conflict * when {@code i!=j} but {@code x=x'}. Because we merge all * {@code (s, i, _)} configurations together, that means that there are at * most {@code n} configurations associated with state {@code s} for * {@code n} possible alternatives in the decision. The merged stacks * complicate the comparison of configuration contexts {@code x} and * {@code x'}. Sam checks to see if one is a subset of the other by calling * merge and checking to see if the merged result is either {@code x} or * {@code x'}. If the {@code x} associated with lowest alternative {@code i} * is the superset, then {@code i} is the only possible prediction since the * others resolve to {@code min(i)} as well. However, if {@code x} is * associated with {@code j>i} then at least one stack configuration for * {@code j} is not in conflict with alternative {@code i}. The algorithm * should keep going, looking for more lookahead due to the uncertainty.

* *

For simplicity, I'm doing a equality check between {@code x} and * {@code x'} that lets the algorithm continue to consume lookahead longer * than necessary. The reason I like the equality is of course the * simplicity but also because that is the test you need to detect the * alternatives that are actually in conflict.

* *

CONTINUE/STOP RULE

* *

Continue if union of resolved alternative sets from non-conflicting and * conflicting alternative subsets has more than one alternative. We are * uncertain about which alternative to predict.

* *

The complete set of alternatives, {@code [i for (_,i,_)]}, tells us which * alternatives are still in the running for the amount of input we've * consumed at this point. The conflicting sets let us to strip away * configurations that won't lead to more states because we resolve * conflicts to the configuration with a minimum alternate for the * conflicting set.

* *

CASES

* *

no conflicts and more than 1 alternative in set => continue
{@code (s, 1, x)}, {@code (s, 2, x)}, {@code (s, 3, z)}, * {@code (s', 1, y)}, {@code (s', 2, y)} yields non-conflicting set * {@code {3}} U conflicting sets {@code min({1,2})} U {@code min({1,2})} = * {@code {1,3}} => continue *
{@code (s, 1, x)}, {@code (s, 2, x)}, {@code (s', 1, y)}, * {@code (s', 2, y)}, {@code (s'', 1, z)} yields non-conflicting set * {@code {1}} U conflicting sets {@code min({1,2})} U {@code min({1,2})} = * {@code {1}} => stop and predict 1
{@code (s, 1, x)}, {@code (s, 2, x)}, {@code (s', 1, y)}, * {@code (s', 2, y)} yields conflicting, reduced sets {@code {1}} U * {@code {1}} = {@code {1}} => stop and predict 1, can announce * ambiguity {@code {1,2}}
{@code (s, 1, x)}, {@code (s, 2, x)}, {@code (s', 2, y)}, * {@code (s', 3, y)} yields conflicting, reduced sets {@code {1}} U * {@code {2}} = {@code {1,2}} => continue
{@code (s, 1, x)}, {@code (s, 2, x)}, {@code (s', 3, y)}, * {@code (s', 4, y)} yields conflicting, reduced sets {@code {1}} U * {@code {3}} = {@code {1,3}} => continue

* *

EXACT AMBIGUITY DETECTION

* *

If all states report the same conflicting set of alternatives, then we * know we have the exact ambiguity set.

* *

|A_i|>1 and * A_i = A_j for all i, j.

* *

In other words, we continue examining lookahead until all {@code A_i} * have more than one alternative and all {@code A_i} are the same. If * {@code A={{1,2}, {1,3}}}, then regular LL prediction would terminate * because the resolved set is {@code {1}}. To determine what the real * ambiguity is, we have to know whether the ambiguity is between one and * two or one and three so we keep going. We can only stop prediction when * we need exact ambiguity detection when the sets look like * {@code A={{1,2}}} or {@code {{1,2},{1,2}}}, etc...

*/ resolvesToJustOneViableAlt: function(n) { return y1.getSingleViableAlt(n); }, /** * Determines if every alternative subset in {@code altsets} contains more * than one alternative. * * @param altsets a collection of alternative subsets * @return {@code true} if every {@link BitSet} in {@code altsets} has * {@link BitSet//cardinality cardinality} > 1, otherwise {@code false} */ allSubsetsConflict: function(n) { return !y1.hasNonConflictingAltSet(n); }, /** * Determines if any single alternative subset in {@code altsets} contains * exactly one alternative. * * @param altsets a collection of alternative subsets * @return {@code true} if {@code altsets} contains a {@link BitSet} with * {@link BitSet//cardinality cardinality} 1, otherwise {@code false} */ hasNonConflictingAltSet: function(n) { for (let e = 0; e < n.length; e++) if (n[e].length === 1) return !0; return !1; }, /** * Determines if any single alternative subset in {@code altsets} contains * more than one alternative. * * @param altsets a collection of alternative subsets * @return {@code true} if {@code altsets} contains a {@link BitSet} with * {@link BitSet//cardinality cardinality} > 1, otherwise {@code false} */ hasConflictingAltSet: function(n) { for (let e = 0; e < n.length; e++) if (n[e].length > 1) return !0; return !1; }, /** * Determines if every alternative subset in {@code altsets} is equivalent. * * @param altsets a collection of alternative subsets * @return {@code true} if every member of {@code altsets} is equal to the * others, otherwise {@code false} */ allSubsetsEqual: function(n) { let e = null; for (let t = 0; t < n.length; t++) { const i = n[t]; if (e === null) e = i; else if (i !== e) return !1; } return !0; }, /** * Returns the unique alternative predicted by all alternative subsets in * {@code altsets}. If no such alternative exists, this method returns * {@link ATN//INVALID_ALT_NUMBER}. * * @param altsets a collection of alternative subsets */ getUniqueAlt: function(n) { const e = y1.getAlts(n); return e.length === 1 ? e.minValue() : G1.INVALID_ALT_NUMBER; }, /** * Gets the complete set of represented alternatives for a collection of * alternative subsets. This method returns the union of each {@link BitSet} * in {@code altsets}. * * @param altsets a collection of alternative subsets * @return the set of represented alternatives in {@code altsets} */ getAlts: function(n) { const e = new M4(); return n.map(function(t) { e.or(t); }), e; }, /** * This function gets the conflicting alt subsets from a configuration set. * For each configuration {@code c} in {@code configs}: * *

   * map[c] U= c.{@link ATNConfig//alt alt} // map hash/equals uses s and x, not
   * alt and not pred
   *

*/ getConflictingAltSubsets: function(n) { const e = new ln(); return e.hashFunction = function(t) { F3.hashStuff(t.state.stateNumber, t.context); }, e.equalsFunction = function(t, i) { return t.state.stateNumber === i.state.stateNumber && t.context.equals(i.context); }, n.items.map(function(t) { let i = e.get(t); i === null && (i = new M4(), e.set(t, i)), i.add(t.alt); }), e.getValues(); }, /** * Get a map from state to alt subset from a configuration set. For each * configuration {@code c} in {@code configs}: * *

   * map[c.{@link ATNConfig//state state}] U= c.{@link ATNConfig//alt alt}
   *

*/ getStateToAltMap: function(n) { const e = new Fx(); return n.items.map(function(t) { let i = e.get(t.state); i === null && (i = new M4(), e.set(t.state, i)), i.add(t.alt); }), e; }, hasStateAssociatedWithOneAlt: function(n) { const e = y1.getStateToAltMap(n).values(); for (let t = 0; t < e.length; t++) if (e[t].length === 1) return !0; return !1; }, getSingleViableAlt: function(n) { let e = null; for (let t = 0; t < n.length; t++) { const s = n[t].minValue(); if (e === null) e = s; else if (e !== s) return G1.INVALID_ALT_NUMBER; } return e; } }; class Uc extends Kt { constructor(e, t, i, s, l, c) { c = c || e._ctx, s = s || e.getCurrentToken(), i = i || e.getCurrentToken(), t = t || e.getInputStream(), super({ message: "", recognizer: e, input: t, ctx: c }), this.deadEndConfigs = l, this.startToken = i, this.offendingToken = s; } } class Ux { constructor(e) { this.defaultMapCtor = e || ln, this.cacheMap = new this.defaultMapCtor(); } get(e, t) { const i = this.cacheMap.get(e) || null; return i === null ? null : i.get(t) || null; } set(e, t, i) { let s = this.cacheMap.get(e) || null; s === null && (s = new this.defaultMapCtor(), this.cacheMap.set(e, s)), s.set(t, i); } } class Zx extends w4 { constructor(e, t, i, s) { super(t, s), this.parser = e, this.decisionToDFA = i, this.predictionMode = y1.LL, this._input = null, this._startIndex = 0, this._outerContext = null, this._dfa = null, this.mergeCache = null, this.debug = !1, this.debug_closure = !1, this.debug_add = !1, this.debug_list_atn_decisions = !1, this.dfa_debug = !1, this.retry_debug = !1; } reset() { } adaptivePredict(e, t, i) { (this.debug || this.debug_list_atn_decisions) && console.log("adaptivePredict decision " + t + " exec LA(1)==" + this.getLookaheadName(e) + " line " + e.LT(1).line + ":" + e.LT(1).column), this._input = e, this._startIndex = e.index, this._outerContext = i; const s = this.decisionToDFA[t]; this._dfa = s; const l = e.mark(), c = e.index; try { let d; if (s.precedenceDfa ? d = s.getPrecedenceStartState(this.parser.getPrecedence()) : d = s.s0, d === null) { i === null && (i = f0.EMPTY), (this.debug || this.debug_list_atn_decisions) && console.log("predictATN decision " + s.decision + " exec LA(1)==" + this.getLookaheadName(e) + ", outerContext=" + i.toString(this.parser.ruleNames)); let p = this.computeStartState(s.atnStartState, f0.EMPTY, !1); s.precedenceDfa ? (s.s0.configs = p, p = this.applyPrecedenceFilter(p), d = this.addDFAState(s, new J4(null, p)), s.setPrecedenceStartState(this.parser.getPrecedence(), d)) : (d = this.addDFAState(s, new J4(null, p)), s.s0 = d); } const L = this.execATN(s, d, e, c, i); return this.debug && console.log("DFA after predictATN: " + s.toString(this.parser.literalNames, this.parser.symbolicNames)), L; } finally { this._dfa = null, this.mergeCache = null, e.seek(c), e.release(l); } } /** * 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? * * 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 * * cover these cases: * dead end * single alt * single alt + preds * conflict * conflict + preds * */ execATN(e, t, i, s, l) { (this.debug || this.debug_list_atn_decisions) && console.log("execATN decision " + e.decision + " exec LA(1)==" + this.getLookaheadName(i) + " line " + i.LT(1).line + ":" + i.LT(1).column); let c, d = t; this.debug && console.log("s0 = " + t); let L = i.LA(1); for (; ; ) { let _ = this.getExistingTargetState(d, L); if (_ === null && (_ = this.computeTargetState(e, d, L)), _ === w4.ERROR) { const p = this.noViableAlt(i, l, d.configs, s); if (i.seek(s), c = this.getSynValidOrSemInvalidAltThatFinishedDecisionEntryRule(d.configs, l), c !== G1.INVALID_ALT_NUMBER) return c; throw p; } if (_.requiresFullContext && this.predictionMode !== y1.SLL) { let p = null; if (_.predicates !== null) { this.debug && console.log("DFA state has preds in DFA sim LL failover"); const h = i.index; if (h !== s && i.seek(s), p = this.evalSemanticContext(_.predicates, l, !0), p.length === 1) return this.debug && console.log("Full LL avoided"), p.minValue(); h !== s && i.seek(h); } this.dfa_debug && console.log("ctx sensitive state " + l + " in " + _); const f = this.computeStartState(e.atnStartState, l, !0); return this.reportAttemptingFullContext(e, p, _.configs, s, i.index), c = this.execATNWithFullContext(e, _, f, i, s, l), c; } if (_.isAcceptState) { if (_.predicates === null) return _.prediction; const p = i.index; i.seek(s); const m = this.evalSemanticContext(_.predicates, l, !0); if (m.length === 0) throw this.noViableAlt(i, l, _.configs, s); return m.length === 1 || this.reportAmbiguity(e, _, s, p, !1, m, _.configs), m.minValue(); } d = _, L !== m2.EOF && (i.consume(), L = i.LA(1)); } } /** * 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 previousD 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(e, t) { const i = e.edges; return i === null ? null : i[t + 1] || null; } /** * 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 The DFA * @param previousD 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(e, t, i) { const s = this.computeReachSet(t.configs, i, !1); if (s === null) return this.addDFAEdge(e, t, i, w4.ERROR), w4.ERROR; let l = new J4(null, s); const c = this.getUniqueAlt(s); if (this.debug) { const d = y1.getConflictingAltSubsets(s); console.log("SLL altSubSets=" + Gt(d) + /*", previous=" + previousD.configs + */ ", configs=" + s + ", predict=" + c + ", allSubsetsConflict=" + y1.allSubsetsConflict(d) + ", conflictingAlts=" + this.getConflictingAlts(s)); } return c !== G1.INVALID_ALT_NUMBER ? (l.isAcceptState = !0, l.configs.uniqueAlt = c, l.prediction = c) : y1.hasSLLConflictTerminatingPrediction(this.predictionMode, s) && (l.configs.conflictingAlts = this.getConflictingAlts(s), l.requiresFullContext = !0, l.isAcceptState = !0, l.prediction = l.configs.conflictingAlts.minValue()), l.isAcceptState && l.configs.hasSemanticContext && (this.predicateDFAState(l, this.atn.getDecisionState(e.decision)), l.predicates !== null && (l.prediction = G1.INVALID_ALT_NUMBER)), l = this.addDFAEdge(e, t, i, l), l; } predicateDFAState(e, t) { const i = t.transitions.length, s = this.getConflictingAltsOrUniqueAlt(e.configs), l = this.getPredsForAmbigAlts(s, e.configs, i); l !== null ? (e.predicates = this.getPredicatePredictions(s, l), e.prediction = G1.INVALID_ALT_NUMBER) : e.prediction = s.minValue(); } // comes back with reach.uniqueAlt set to a valid alt execATNWithFullContext(e, t, i, s, l, c) { (this.debug || this.debug_list_atn_decisions) && console.log("execATNWithFullContext " + i); const d = !0; let L = !1, _, p = i; s.seek(l); let m = s.LA(1), f = -1; for (; ; ) { if (_ = this.computeReachSet(p, m, d), _ === null) { const v = this.noViableAlt(s, c, p, l); s.seek(l); const R = this.getSynValidOrSemInvalidAltThatFinishedDecisionEntryRule(p, c); if (R !== G1.INVALID_ALT_NUMBER) return R; throw v; } const h = y1.getConflictingAltSubsets(_); if (this.debug && console.log("LL altSubSets=" + h + ", predict=" + y1.getUniqueAlt(h) + ", resolvesToJustOneViableAlt=" + y1.resolvesToJustOneViableAlt(h)), _.uniqueAlt = this.getUniqueAlt(_), _.uniqueAlt !== G1.INVALID_ALT_NUMBER) { f = _.uniqueAlt; break; } else if (this.predictionMode !== y1.LL_EXACT_AMBIG_DETECTION) { if (f = y1.resolvesToJustOneViableAlt(h), f !== G1.INVALID_ALT_NUMBER) break; } else if (y1.allSubsetsConflict(h) && y1.allSubsetsEqual(h)) { L = !0, f = y1.getSingleViableAlt(h); break; } p = _, m !== m2.EOF && (s.consume(), m = s.LA(1)); } return _.uniqueAlt !== G1.INVALID_ALT_NUMBER ? (this.reportContextSensitivity(e, f, _, l, s.index), f) : (this.reportAmbiguity(e, t, l, s.index, L, null, _), f); } computeReachSet(e, t, i) { this.debug && console.log("in computeReachSet, starting closure: " + e), this.mergeCache === null && (this.mergeCache = new Ux()); const s = new qe(i); let l = null; for (let d = 0; d < e.items.length; d++) { const L = e.items[d]; if (this.debug && console.log("testing " + this.getTokenName(t) + " at " + L), L.state instanceof We) { (i || t === m2.EOF) && (l === null && (l = []), l.push(L), this.debug_add && console.log("added " + L + " to skippedStopStates")); continue; } for (let _ = 0; _ < L.state.transitions.length; _++) { const p = L.state.transitions[_], m = this.getReachableTarget(p, t); if (m !== null) { const f = new X1({ state: m }, L); s.add(f, this.mergeCache), this.debug_add && console.log("added " + f + " to intermediate"); } } } let c = null; if (l === null && t !== m2.EOF && (s.items.length === 1 || this.getUniqueAlt(s) !== G1.INVALID_ALT_NUMBER) && (c = s), c === null) { c = new qe(i); const d = new D3(), L = t === m2.EOF; for (let _ = 0; _ < s.items.length; _++) this.closure(s.items[_], c, d, !1, i, L); } if (t === m2.EOF && (c = this.removeAllConfigsNotInRuleStopState(c, c === s)), l !== null && (!i || !y1.hasConfigInRuleStopState(c))) for (let d = 0; d < l.length; d++) c.add(l[d], this.mergeCache); return c.items.length === 0 ? null : c; } /** * 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}. * *

When {@code lookToEndOfRule} is true, this method uses * {@link ATN//nextTokens} for each configuration in {@code configs} which is * not already in a rule stop state to see if a rule stop state is reachable * from the configuration via epsilon-only transitions.

* * @param configs the configuration set to update * @param lookToEndOfRule when true, this method checks for rule stop states * reachable by epsilon-only transitions from each configuration in * {@code configs}. * * @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(e, t) { if (y1.allConfigsInRuleStopStates(e)) return e; const i = new qe(e.fullCtx); for (let s = 0; s < e.items.length; s++) { const l = e.items[s]; if (l.state instanceof We) { i.add(l, this.mergeCache); continue; } if (t && l.state.epsilonOnlyTransitions && this.atn.nextTokens(l.state).contains(m2.EPSILON)) { const d = this.atn.ruleToStopState[l.state.ruleIndex]; i.add(new X1({ state: d }, l), this.mergeCache); } } return i; } computeStartState(e, t, i) { const s = yc(this.atn, t), l = new qe(i); for (let c = 0; c < e.transitions.length; c++) { const d = e.transitions[c].target, L = new X1({ state: d, alt: c + 1, context: s }, null), _ = new D3(); this.closure(L, l, _, !0, i, !1); } return l; } /** * 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}.
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 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(e) { let t; const i = [], s = new qe(e.fullCtx); for (let l = 0; l < e.items.length; l++) { if (t = e.items[l], t.alt !== 1) continue; const c = t.semanticContext.evalPrecedence(this.parser, this._outerContext); c !== null && (i[t.state.stateNumber] = t.context, c !== t.semanticContext ? s.add(new X1({ semanticContext: c }, t), this.mergeCache) : s.add(t, this.mergeCache)); } for (let l = 0; l < e.items.length; l++) if (t = e.items[l], t.alt !== 1) { if (!t.precedenceFilterSuppressed) { const c = i[t.state.stateNumber] || null; if (c !== null && c.equals(t.context)) continue; } s.add(t, this.mergeCache); } return s; } getReachableTarget(e, t) { return e.matches(t, 0, this.atn.maxTokenType) ? e.target : null; } getPredsForAmbigAlts(e, t, i) { let s = []; for (let c = 0; c < t.items.length; c++) { const d = t.items[c]; e.has(d.alt) && (s[d.alt] = h1.orContext(s[d.alt] || null, d.semanticContext)); } let l = 0; for (let c = 1; c < i + 1; c++) { const d = s[c] || null; d === null ? s[c] = h1.NONE : d !== h1.NONE && (l += 1); } return l === 0 && (s = null), this.debug && console.log("getPredsForAmbigAlts result " + Gt(s)), s; } getPredicatePredictions(e, t) { const i = []; let s = !1; for (let l = 1; l < t.length; l++) { const c = t[l]; e !== null && e.has(l) && i.push(new UE(c, l)), c !== h1.NONE && (s = !0); } return s ? i : null; } /** * 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 a syntactically valid path or paths reach the end of the decision rule and * they are semantically valid if predicated, return the min associated alt.
Else, if a semantically invalid but syntactically valid path exist * or paths exist, return the minimum associated alt. *
Otherwise, return {@link ATN//INVALID_ALT_NUMBER}.

* *

* In some scenarios, the algorithm described above could predict an * alternative which will result in a {@link FailedPredicateException} in * the 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 configs The ATN configurations which were valid immediately before * the {@link //ERROR} state was reached * @param outerContext The is the \gamma_0 initial parser context from the paper * or the parser stack at the instant before prediction commences. * * @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 */ getSynValidOrSemInvalidAltThatFinishedDecisionEntryRule(e, t) { const i = this.splitAccordingToSemanticValidity(e, t), s = i[0], l = i[1]; let c = this.getAltThatFinishedDecisionEntryRule(s); return c !== G1.INVALID_ALT_NUMBER || l.items.length > 0 && (c = this.getAltThatFinishedDecisionEntryRule(l), c !== G1.INVALID_ALT_NUMBER) ? c : G1.INVALID_ALT_NUMBER; } getAltThatFinishedDecisionEntryRule(e) { const t = []; for (let i = 0; i < e.items.length; i++) { const s = e.items[i]; (s.reachesIntoOuterContext > 0 || s.state instanceof We && s.context.hasEmptyPath()) && t.indexOf(s.alt) < 0 && t.push(s.alt); } return t.length === 0 ? G1.INVALID_ALT_NUMBER : Math.min.apply(null, t); } /** * Walk the list of configurations and split them according to * those that have preds evaluating to true/false. If no pred, assume * true pred and include in succeeded set. Returns Pair of sets. * * Create a new set so as not to alter the incoming parameter. * * Assumption: the input stream has been restored to the starting point * prediction, which is where predicates need to evaluate.*/ splitAccordingToSemanticValidity(e, t) { const i = new qe(e.fullCtx), s = new qe(e.fullCtx); for (let l = 0; l < e.items.length; l++) { const c = e.items[l]; c.semanticContext !== h1.NONE ? c.semanticContext.evaluate(this.parser, t) ? i.add(c) : s.add(c) : i.add(c); } return [i, s]; } /** * Look through a list of predicate/alt pairs, returning alts for the * pairs that win. A {@code NONE} predicate indicates an alt containing an * unpredicated config which behaves as "always true." If !complete * then we stop at the first predicate that evaluates to true. This * includes pairs with null predicates. */ evalSemanticContext(e, t, i) { const s = new M4(); for (let l = 0; l < e.length; l++) { const c = e[l]; if (c.pred === h1.NONE) { if (s.add(c.alt), !i) break; continue; } const d = c.pred.evaluate(this.parser, t); if ((this.debug || this.dfa_debug) && console.log("eval pred " + c + "=" + d), d && ((this.debug || this.dfa_debug) && console.log("PREDICT " + c.alt), s.add(c.alt), !i)) break; } return s; } // 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(e, t, i, s, l, c) { this.closureCheckingStopState( e, t, i, s, l, 0, c ); } closureCheckingStopState(e, t, i, s, l, c, d) { if ((this.debug || this.debug_closure) && (console.log("closure(" + e.toString(this.parser, !0) + ")"), e.reachesIntoOuterContext > 50)) throw "problem"; if (e.state instanceof We) if (e.context.isEmpty()) if (l) { t.add(e, this.mergeCache); return; } else this.debug && console.log("FALLING off rule " + this.getRuleName(e.state.ruleIndex)); else { for (let L = 0; L < e.context.length; L++) { if (e.context.getReturnState(L) === t1.EMPTY_RETURN_STATE) { if (l) { t.add(new X1({ state: e.state, context: t1.EMPTY }, e), this.mergeCache); continue; } else this.debug && console.log("FALLING off rule " + this.getRuleName(e.state.ruleIndex)), this.closure_( e, t, i, s, l, c, d ); continue; } const _ = this.atn.states[e.context.getReturnState(L)], p = e.context.getParent(L), m = { state: _, alt: e.alt, context: p, semanticContext: e.semanticContext }, f = new X1(m, null); f.reachesIntoOuterContext = e.reachesIntoOuterContext, this.closureCheckingStopState(f, t, i, s, l, c - 1, d); } return; } this.closure_(e, t, i, s, l, c, d); } // Do the actual work of walking epsilon edges// closure_(e, t, i, s, l, c, d) { const L = e.state; L.epsilonOnlyTransitions || t.add(e, this.mergeCache); for (let _ = 0; _ < L.transitions.length; _++) { if (_ === 0 && this.canDropLoopEntryEdgeInLeftRecursiveRule(e)) continue; const p = L.transitions[_], m = s && !(p instanceof kE), f = this.getEpsilonTarget(e, p, m, c === 0, l, d); if (f !== null) { let h = c; if (e.state instanceof We) { if (this._dfa !== null && this._dfa.precedenceDfa && p.outermostPrecedenceReturn === this._dfa.atnStartState.ruleIndex && (f.precedenceFilterSuppressed = !0), f.reachesIntoOuterContext += 1, i.add(f) !== f) continue; t.dipsIntoOuterContext = !0, h -= 1, this.debug && console.log("dips into outer ctx: " + f); } else { if (!p.isEpsilon && i.add(f) !== f) continue; p instanceof J8 && h >= 0 && (h += 1); } this.closureCheckingStopState(f, t, i, m, l, h, d); } } } canDropLoopEntryEdgeInLeftRecursiveRule(e) { const t = e.state; if (t.stateType !== O2.STAR_LOOP_ENTRY || t.stateType !== O2.STAR_LOOP_ENTRY || !t.isPrecedenceDecision || e.context.isEmpty() || e.context.hasEmptyPath()) return !1; const i = e.context.length; for (let d = 0; d < i; d++) if (this.atn.states[e.context.getReturnState(d)].ruleIndex !== t.ruleIndex) return !1; const l = t.transitions[0].target.endState.stateNumber, c = this.atn.states[l]; for (let d = 0; d < i; d++) { const L = e.context.getReturnState(d), _ = this.atn.states[L]; if (_.transitions.length !== 1 || !_.transitions[0].isEpsilon) return !1; const p = _.transitions[0].target; if (!(_.stateType === O2.BLOCK_END && p === t) && _ !== c && p !== c && !(p.stateType === O2.BLOCK_END && p.transitions.length === 1 && p.transitions[0].isEpsilon && p.transitions[0].target === t)) return !1; } return !0; } getRuleName(e) { return this.parser !== null && e >= 0 ? this.parser.ruleNames[e] : ""; } getEpsilonTarget(e, t, i, s, l, c) { switch (t.serializationType) { case b2.RULE: return this.ruleTransition(e, t); case b2.PRECEDENCE: return this.precedenceTransition(e, t, i, s, l); case b2.PREDICATE: return this.predTransition(e, t, i, s, l); case b2.ACTION: return this.actionTransition(e, t); case b2.EPSILON: return new X1({ state: t.target }, e); case b2.ATOM: case b2.RANGE: case b2.SET: return c && t.matches(m2.EOF, 0, 1) ? new X1({ state: t.target }, e) : null; default: return null; } } actionTransition(e, t) { if (this.debug) { const i = t.actionIndex === -1 ? 65535 : t.actionIndex; console.log("ACTION edge " + t.ruleIndex + ":" + i); } return new X1({ state: t.target }, e); } precedenceTransition(e, t, i, s, l) { this.debug && (console.log("PRED (collectPredicates=" + i + ") " + t.precedence + ">=_p, ctx dependent=true"), this.parser !== null && console.log("context surrounding pred is " + Gt(this.parser.getRuleInvocationStack()))); let c = null; if (i && s) if (l) { const d = this._input.index; this._input.seek(this._startIndex); const L = t.getPredicate().evaluate(this.parser, this._outerContext); this._input.seek(d), L && (c = new X1({ state: t.target }, e)); } else { const d = h1.andContext(e.semanticContext, t.getPredicate()); c = new X1({ state: t.target, semanticContext: d }, e); } else c = new X1({ state: t.target }, e); return this.debug && console.log("config from pred transition=" + c), c; } predTransition(e, t, i, s, l) { this.debug && (console.log("PRED (collectPredicates=" + i + ") " + t.ruleIndex + ":" + t.predIndex + ", ctx dependent=" + t.isCtxDependent), this.parser !== null && console.log("context surrounding pred is " + Gt(this.parser.getRuleInvocationStack()))); let c = null; if (i && (t.isCtxDependent && s || !t.isCtxDependent)) if (l) { const d = this._input.index; this._input.seek(this._startIndex); const L = t.getPredicate().evaluate(this.parser, this._outerContext); this._input.seek(d), L && (c = new X1({ state: t.target }, e)); } else { const d = h1.andContext(e.semanticContext, t.getPredicate()); c = new X1({ state: t.target, semanticContext: d }, e); } else c = new X1({ state: t.target }, e); return this.debug && console.log("config from pred transition=" + c), c; } ruleTransition(e, t) { this.debug && console.log("CALL rule " + this.getRuleName(t.target.ruleIndex) + ", ctx=" + e.context); const i = t.followState, s = $e.create(e.context, i.stateNumber); return new X1({ state: t.target, context: s }, e); } getConflictingAlts(e) { const t = y1.getConflictingAltSubsets(e); return y1.getAlts(t); } /** * Sam pointed out a problem with the previous definition, v3, of * ambiguous states. If we have another state associated with conflicting * alternatives, we should keep going. For example, the following grammar * * s : (ID | ID ID?) ';' ; * * When the ATN simulation reaches the state before ';', it has a DFA * state that looks like: [12|1|[], 6|2|[], 12|2|[]]. Naturally * 12|1|[] and 12|2|[] conflict, but we cannot stop processing this node * because alternative to has another way to continue, via [6|2|[]]. * The key is that we have a single state that has config's only associated * with a single alternative, 2, and crucially the state transitions * among the configurations are all non-epsilon transitions. That means * we don't consider any conflicts that include alternative 2. So, we * ignore the conflict between alts 1 and 2. We ignore a set of * conflicting alts when there is an intersection with an alternative * associated with a single alt state in the state→config-list map. * * It's also the case that we might have two conflicting configurations but * also a 3rd nonconflicting configuration for a different alternative: * [1|1|[], 1|2|[], 8|3|[]]. This can come about from grammar: * * a : A | A | A B ; * * After matching input A, we reach the stop state for rule A, state 1. * State 8 is the state right before B. Clearly alternatives 1 and 2 * conflict and no amount of further lookahead will separate the two. * However, alternative 3 will be able to continue and so we do not * stop working on this state. In the previous example, we're concerned * with states associated with the conflicting alternatives. Here alt * 3 is not associated with the conflicting configs, but since we can continue * looking for input reasonably, I don't declare the state done. We * ignore a set of conflicting alts when we have an alternative * that we still need to pursue */ getConflictingAltsOrUniqueAlt(e) { let t = null; return e.uniqueAlt !== G1.INVALID_ALT_NUMBER ? (t = new M4(), t.add(e.uniqueAlt)) : t = e.conflictingAlts, t; } getTokenName(e) { if (e === m2.EOF) return "EOF"; if (this.parser !== null && this.parser.literalNames !== null) if (e >= this.parser.literalNames.length && e >= this.parser.symbolicNames.length) console.log("" + e + " ttype out of range: " + this.parser.literalNames), console.log("" + this.parser.getInputStream().getTokens()); else return (this.parser.literalNames[e] || this.parser.symbolicNames[e]) + "<" + e + ">"; return "" + e; } getLookaheadName(e) { return this.getTokenName(e.LA(1)); } /** * Used for debugging in adaptivePredict around execATN but I cut * it out for clarity now that alg. works well. We can leave this * "dead" code for a bit */ dumpDeadEndConfigs(e) { console.log("dead end configs: "); const t = e.getDeadEndConfigs(); for (let i = 0; i < t.length; i++) { const s = t[i]; let l = "no edges"; if (s.state.transitions.length > 0) { const c = s.state.transitions[0]; c instanceof H8 ? l = "Atom " + this.getTokenName(c.label) : c instanceof wc && (l = (c instanceof Mc ? "~" : "") + "Set " + c.set); } console.error(s.toString(this.parser, !0) + ":" + l); } } noViableAlt(e, t, i, s) { return new Uc(this.parser, e, e.get(s), e.LT(1), i, t); } getUniqueAlt(e) { let t = G1.INVALID_ALT_NUMBER; for (let i = 0; i < e.items.length; i++) { const s = e.items[i]; if (t === G1.INVALID_ALT_NUMBER) t = s.alt; else if (s.alt !== t) return G1.INVALID_ALT_NUMBER; } return t; } /** * Add an edge to the DFA, if possible. This method calls * {@link //addDFAState} to ensure the {@code to} state is present in the * DFA. If {@code from} is {@code null}, or if {@code t} is outside the * range of edges that can be represented in the DFA tables, this method * returns without adding the edge to the DFA. * *

If {@code to} is {@code null}, this method returns {@code null}. * Otherwise, this method returns the {@link DFAState} returned by calling * {@link //addDFAState} for the {@code to} state.

* * @param dfa The DFA * @param from_ The source state for the edge * @param t The input symbol * @param to The target state for the edge * * @return If {@code to} is {@code null}, this method returns {@code null}; * otherwise this method returns the result of calling {@link //addDFAState} * on {@code to} */ addDFAEdge(e, t, i, s) { if (this.debug && console.log("EDGE " + t + " -> " + s + " upon " + this.getTokenName(i)), s === null) return null; if (s = this.addDFAState(e, s), t === null || i < -1 || i > this.atn.maxTokenType) return s; if (t.edges === null && (t.edges = []), t.edges[i + 1] = s, this.debug) { const l = this.parser === null ? null : this.parser.literalNames, c = this.parser === null ? null : this.parser.symbolicNames; console.log(`DFA= ` + e.toString(l, c)); } return s; } /** * Add state {@code D} to the DFA if it is not already present, and return * the actual instance stored in the DFA. If a state equivalent to {@code D} * is already in the DFA, the existing state is returned. Otherwise this * method returns {@code D} after adding it to the DFA. * *

If {@code D} is {@link //ERROR}, this method returns {@link //ERROR} and * does not change the DFA.

* * @param dfa The dfa * @param D The DFA state to add * @return The state stored in the DFA. This will be either the existing * state if {@code D} is already in the DFA, or {@code D} itself if the * state was not already present */ addDFAState(e, t) { if (t === w4.ERROR) return t; const i = e.states.get(t); return i !== null ? i : (t.stateNumber = e.states.length, t.configs.readOnly || (t.configs.optimizeConfigs(this), t.configs.setReadonly(!0)), e.states.add(t), this.debug && console.log("adding new DFA state: " + t), t); } reportAttemptingFullContext(e, t, i, s, l) { if (this.debug || this.retry_debug) { const c = new m1(s, l + 1); console.log("reportAttemptingFullContext decision=" + e.decision + ":" + i + ", input=" + this.parser.getTokenStream().getText(c)); } this.parser !== null && this.parser.getErrorListenerDispatch().reportAttemptingFullContext(this.parser, e, s, l, t, i); } reportContextSensitivity(e, t, i, s, l) { if (this.debug || this.retry_debug) { const c = new m1(s, l + 1); console.log("reportContextSensitivity decision=" + e.decision + ":" + i + ", input=" + this.parser.getTokenStream().getText(c)); } this.parser !== null && this.parser.getErrorListenerDispatch().reportContextSensitivity(this.parser, e, s, l, t, i); } // If context sensitive parsing, we know it's ambiguity not conflict// reportAmbiguity(e, t, i, s, l, c, d) { if (this.debug || this.retry_debug) { const L = new m1(i, s + 1); console.log("reportAmbiguity " + c + ":" + d + ", input=" + this.parser.getTokenStream().getText(L)); } this.parser !== null && this.parser.getErrorListenerDispatch().reportAmbiguity(this.parser, e, i, s, l, c, d); } } const Bx = { ATN: G1, ATNDeserializer: FE, LexerATNSimulator: q1, ParserATNSimulator: Zx, PredictionMode: y1 }; class Zc { constructor(e, t, i) { this.dfa = e, this.literalNames = t || [], this.symbolicNames = i || []; } toString() { if (this.dfa.s0 === null) return null; let e = ""; const t = this.dfa.sortedStates(); for (let i = 0; i < t.length; i++) { const s = t[i]; if (s.edges !== null) { const l = s.edges.length; for (let c = 0; c < l; c++) { const d = s.edges[c] || null; d !== null && d.stateNumber !== 2147483647 && (e = e.concat(this.getStateString(s)), e = e.concat("-"), e = e.concat(this.getEdgeLabel(c)), e = e.concat("->"), e = e.concat(this.getStateString(d)), e = e.concat(` `)); } } } return e.length === 0 ? null : e; } getEdgeLabel(e) { return e === 0 ? "EOF" : this.literalNames !== null || this.symbolicNames !== null ? this.literalNames[e - 1] || this.symbolicNames[e - 1] : String.fromCharCode(e - 1); } getStateString(e) { const t = (e.isAcceptState ? ":" : "") + "s" + e.stateNumber + (e.requiresFullContext ? "^" : ""); return e.isAcceptState ? e.predicates !== null ? t + "=>" + Gt(e.predicates) : t + "=>" + e.prediction.toString() : t; } } class ZE extends Zc { constructor(e) { super(e, null); } getEdgeLabel(e) { return "'" + String.fromCharCode(e) + "'"; } } class Gx { constructor(e, t) { if (t === void 0 && (t = 0), this.atnStartState = e, this.decision = t, this._states = new D3(), this.s0 = null, this.precedenceDfa = !1, e instanceof h9 && e.isPrecedenceDecision) { this.precedenceDfa = !0; const i = new J4(null, new qe()); i.edges = [], i.isAcceptState = !1, i.requiresFullContext = !1, this.s0 = i; } } /** * 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. * * @throws IllegalStateException if this is not a precedence DFA. * @see //isPrecedenceDfa() */ getPrecedenceStartState(e) { if (!this.precedenceDfa) throw "Only precedence DFAs may contain a precedence start state."; return e < 0 || e >= this.s0.edges.length ? null : this.s0.edges[e] || null; } /** * Set the start state for a specific precedence value. * * @param precedence The current precedence. * @param startState The start state corresponding to the specified * precedence. * * @throws IllegalStateException if this is not a precedence DFA. * @see //isPrecedenceDfa() */ setPrecedenceStartState(e, t) { if (!this.precedenceDfa) throw "Only precedence DFAs may contain a precedence start state."; e < 0 || (this.s0.edges[e] = t); } /** * Sets whether this is a precedence DFA. If the specified value differs * from the current DFA configuration, the following actions are taken; * otherwise no changes are made to the current DFA. * *

The {@link //states} map is cleared
If {@code precedenceDfa} is {@code false}, the initial state * {@link //s0} is set to {@code null}; otherwise, it is initialized to a new * {@link DFAState} with an empty outgoing {@link DFAState//edges} array to * store the start states for individual precedence values.
The {@link //precedenceDfa} field is updated

* * @param precedenceDfa {@code true} if this is a precedence DFA; otherwise, * {@code false} */ setPrecedenceDfa(e) { if (this.precedenceDfa !== e) { if (this._states = new D3(), e) { const t = new J4(null, new qe()); t.edges = [], t.isAcceptState = !1, t.requiresFullContext = !1, this.s0 = t; } else this.s0 = null; this.precedenceDfa = e; } } /** * Return a list of all states in this DFA, ordered by state number. */ sortedStates() { return this._states.values().sort(function(t, i) { return t.stateNumber - i.stateNumber; }); } toString(e, t) { return e = e || null, t = t || null, this.s0 === null ? "" : new Zc(this, e, t).toString(); } toLexerString() { return this.s0 === null ? "" : new ZE(this).toString(); } get states() { return this._states; } } const zx = { DFA: Gx, DFASerializer: Zc, LexerDFASerializer: ZE, PredPrediction: UE }; class BE { visitTerminal(e) { } visitErrorNode(e) { } enterEveryRule(e) { } exitEveryRule(e) { } } class Hx { visit(e) { return Array.isArray(e) ? e.map(function(t) { return t.accept(this); }, this) : e.accept(this); } visitChildren(e) { return e.children ? this.visit(e.children) : null; } visitTerminal(e) { } visitErrorNode(e) { } } class Vl { /** * Performs a walk on the given parse tree starting at the root and going down recursively * with depth-first search. On each node, {@link ParseTreeWalker//enterRule} is called before * recursively walking down into child nodes, then * {@link ParseTreeWalker//exitRule} is called after the recursive call to wind up. * @param listener The listener used by the walker to process grammar rules * @param t The parse tree to be walked on */ walk(e, t) { if (t instanceof E6 || t.isErrorNode !== void 0 && t.isErrorNode()) e.visitErrorNode(t); else if (t instanceof nt) e.visitTerminal(t); else { this.enterRule(e, t); for (let s = 0; s < t.getChildCount(); s++) { const l = t.getChild(s); this.walk(e, l); } this.exitRule(e, t); } } /** * Enters a grammar rule by first triggering the generic event {@link ParseTreeListener//enterEveryRule} * then by triggering the event specific to the given parse tree node * @param listener The listener responding to the trigger events * @param r The grammar rule containing the rule context */ enterRule(e, t) { const i = t.getRuleContext(); e.enterEveryRule(i), i.enterRule(e); } /** * Exits a grammar rule by first triggering the event specific to the given parse tree node * then by triggering the generic event {@link ParseTreeListener//exitEveryRule} * @param listener The listener responding to the trigger events * @param r The grammar rule containing the rule context */ exitRule(e, t) { const i = t.getRuleContext(); i.exitRule(e), e.exitEveryRule(i); } } Vl.DEFAULT = new Vl(); const Yx = { Trees: x4, RuleNode: e6, ErrorNode: E6, TerminalNode: nt, ParseTreeListener: BE, ParseTreeVisitor: Hx, ParseTreeWalker: Vl }; class V5 extends Kt { constructor(e) { super({ message: "", recognizer: e, input: e.getInputStream(), ctx: e._ctx }), this.offendingToken = e.getCurrentToken(); } } class GE extends Kt { constructor(e, t, i) { super({ message: Vx(t, i || null), recognizer: e, input: e.getInputStream(), ctx: e._ctx }); const l = e._interp.atn.states[e.state].transitions[0]; l instanceof PE ? (this.ruleIndex = l.ruleIndex, this.predicateIndex = l.predIndex) : (this.ruleIndex = 0, this.predicateIndex = 0), this.predicate = t, this.offendingToken = e.getCurrentToken(); } } function Vx(n, e) { return e !== null ? e : "failed predicate: {" + n + "}?"; } class qx extends v6 { constructor(e) { super(), e = e || !0, this.exactOnly = e; } reportAmbiguity(e, t, i, s, l, c, d) { if (this.exactOnly && !l) return; const L = "reportAmbiguity d=" + this.getDecisionDescription(e, t) + ": ambigAlts=" + this.getConflictingAlts(c, d) + ", input='" + e.getTokenStream().getText(new m1(i, s)) + "'"; e.notifyErrorListeners(L); } reportAttemptingFullContext(e, t, i, s, l, c) { const d = "reportAttemptingFullContext d=" + this.getDecisionDescription(e, t) + ", input='" + e.getTokenStream().getText(new m1(i, s)) + "'"; e.notifyErrorListeners(d); } reportContextSensitivity(e, t, i, s, l, c) { const d = "reportContextSensitivity d=" + this.getDecisionDescription(e, t) + ", input='" + e.getTokenStream().getText(new m1(i, s)) + "'"; e.notifyErrorListeners(d); } getDecisionDescription(e, t) { const i = t.decision, s = t.atnStartState.ruleIndex, l = e.ruleNames; if (s < 0 || s >= l.length) return "" + i; const c = l[s] || null; return c === null || c.length === 0 ? "" + i : `${i} (${c})`; } /** * Computes the set of conflicting or ambiguous alternatives from a * configuration set, if that information was not already provided by the * parser. * * @param reportedAlts The set of conflicting or ambiguous alternatives, as * reported by the parser. * @param configs The conflicting or ambiguous configuration set. * @return Returns {@code reportedAlts} if it is not {@code null}, otherwise * returns the set of alternatives represented in {@code configs}. */ getConflictingAlts(e, t) { if (e !== null) return e; const i = new M4(); for (let s = 0; s < t.items.length; s++) i.add(t.items[s].alt); return `{${i.values().join(", ")}}`; } } class Bc extends Error { constructor() { super(), Error.captureStackTrace(this, Bc); } } class Wx { reset(e) { } recoverInline(e) { } recover(e, t) { } sync(e) { } inErrorRecoveryMode(e) { } reportError(e) { } } class Gc extends Wx { constructor() { super(), this.errorRecoveryMode = !1, this.lastErrorIndex = -1, this.lastErrorStates = null, this.nextTokensContext = null, this.nextTokenState = 0; } /** *

The default implementation simply calls {@link //endErrorCondition} to * ensure that the handler is not in error recovery mode.

*/ reset(e) { this.endErrorCondition(e); } /** * This method is called to enter error recovery mode when a recognition * exception is reported. * * @param recognizer the parser instance */ beginErrorCondition(e) { this.errorRecoveryMode = !0; } inErrorRecoveryMode(e) { return this.errorRecoveryMode; } /** * This method is called to leave error recovery mode after recovering from * a recognition exception. * @param recognizer */ endErrorCondition(e) { this.errorRecoveryMode = !1, this.lastErrorStates = null, this.lastErrorIndex = -1; } /** * {@inheritDoc} *

The default implementation simply calls {@link //endErrorCondition}.

*/ reportMatch(e) { this.endErrorCondition(e); } /** * {@inheritDoc} * *

The default implementation returns immediately if the handler is already * in error recovery mode. Otherwise, it calls {@link //beginErrorCondition} * and dispatches the reporting task based on the runtime type of {@code e} * according to the following table.

* *

{@link NoViableAltException}: Dispatches the call to * {@link //reportNoViableAlternative}
{@link InputMismatchException}: Dispatches the call to * {@link //reportInputMismatch}
{@link FailedPredicateException}: Dispatches the call to * {@link //reportFailedPredicate}
All other types: calls {@link Parser//notifyErrorListeners} to report * the exception

*/ reportError(e, t) { this.inErrorRecoveryMode(e) || (this.beginErrorCondition(e), t instanceof Uc ? this.reportNoViableAlternative(e, t) : t instanceof V5 ? this.reportInputMismatch(e, t) : t instanceof GE ? this.reportFailedPredicate(e, t) : (console.log("unknown recognition error type: " + t.constructor.name), console.log(t.stack), e.notifyErrorListeners(t.getOffendingToken(), t.getMessage(), t))); } /** * * {@inheritDoc} * *

The default implementation resynchronizes the parser by consuming tokens * until we find one in the resynchronization set--loosely the set of tokens * that can follow the current rule.

* */ recover(e, t) { this.lastErrorIndex === e.getInputStream().index && this.lastErrorStates !== null && this.lastErrorStates.indexOf(e.state) >= 0 && e.consume(), this.lastErrorIndex = e._input.index, this.lastErrorStates === null && (this.lastErrorStates = []), this.lastErrorStates.push(e.state); const i = this.getErrorRecoverySet(e); this.consumeUntil(e, i); } /** * The default implementation of {@link ANTLRErrorStrategy//sync} makes sure * that the current lookahead symbol is consistent with what were expecting * at this point in the ATN. You can call this anytime but ANTLR only * generates code to check before subrules/loops and each iteration. * *

Implements Jim Idle's magic sync mechanism in closures and optional * subrules. E.g.,

* *

   * a : sync ( stuff sync )* ;
   * sync : {consume to what can follow sync} ;
   *

* * At the start of a sub rule upon error, {@link //sync} performs single * token deletion, if possible. If it can't do that, it bails on the current * rule and uses the default error recovery, which consumes until the * resynchronization set of the current rule. * *

If the sub rule is optional ({@code (...)?}, {@code (...)*}, or block * with an empty alternative), then the expected set includes what follows * the subrule.

* *

During loop iteration, it consumes until it sees a token that can start a * sub rule or what follows loop. Yes, that is pretty aggressive. We opt to * stay in the loop as long as possible.

* *

ORIGINS

* *

Previous versions of ANTLR did a poor job of their recovery within loops. * A single mismatch token or missing token would force the parser to bail * out of the entire rules surrounding the loop. So, for rule

* *

   * classDef : 'class' ID '{' member* '}'
   *

* * input with an extra token between members would force the parser to * consume until it found the next class definition rather than the next * member definition of the current class. * *

This functionality cost a little bit of effort because the parser has to * compare token set at the start of the loop and at each iteration. If for * some reason speed is suffering for you, you can turn off this * functionality by simply overriding this method as a blank { }.

* */ sync(e) { if (this.inErrorRecoveryMode(e)) return; const t = e._interp.atn.states[e.state], i = e.getTokenStream().LA(1), s = e.atn.nextTokens(t); if (s.contains(i)) { this.nextTokensContext = null, this.nextTokenState = O2.INVALID_STATE_NUMBER; return; } else if (s.contains(m2.EPSILON)) { this.nextTokensContext === null && (this.nextTokensContext = e._ctx, this.nextTokensState = e._stateNumber); return; } switch (t.stateType) { case O2.BLOCK_START: case O2.STAR_BLOCK_START: case O2.PLUS_BLOCK_START: case O2.STAR_LOOP_ENTRY: if (this.singleTokenDeletion(e) !== null) return; throw new V5(e); case O2.PLUS_LOOP_BACK: case O2.STAR_LOOP_BACK: { this.reportUnwantedToken(e); const l = new X3(); l.addSet(e.getExpectedTokens()); const c = l.addSet(this.getErrorRecoverySet(e)); this.consumeUntil(e, c); } break; } } /** * This is called by {@link //reportError} when the exception is a * {@link NoViableAltException}. * * @see //reportError * * @param recognizer the parser instance * @param e the recognition exception */ reportNoViableAlternative(e, t) { const i = e.getTokenStream(); let s; i !== null ? t.startToken.type === m2.EOF ? s = "" : s = i.getText(new m1(t.startToken.tokenIndex, t.offendingToken.tokenIndex)) : s = ""; const l = "no viable alternative at input " + this.escapeWSAndQuote(s); e.notifyErrorListeners(l, t.offendingToken, t); } /** * This is called by {@link //reportError} when the exception is an * {@link InputMismatchException}. * * @see //reportError * * @param recognizer the parser instance * @param e the recognition exception */ reportInputMismatch(e, t) { const i = "mismatched input " + this.getTokenErrorDisplay(t.offendingToken) + " expecting " + t.getExpectedTokens().toString(e.literalNames, e.symbolicNames); e.notifyErrorListeners(i, t.offendingToken, t); } /** * This is called by {@link //reportError} when the exception is a * {@link FailedPredicateException}. * * @see //reportError * * @param recognizer the parser instance * @param e the recognition exception */ reportFailedPredicate(e, t) { const s = "rule " + e.ruleNames[e._ctx.ruleIndex] + " " + t.message; e.notifyErrorListeners(s, t.offendingToken, t); } /** * This method is called to report a syntax error which requires the removal * of a token from the input stream. At the time this method is called, the * erroneous symbol is current {@code LT(1)} symbol and has not yet been * removed from the input stream. When this method returns, * {@code recognizer} is in error recovery mode. * *

This method is called when {@link //singleTokenDeletion} identifies * single-token deletion as a viable recovery strategy for a mismatched * input error.

* *

The default implementation simply returns if the handler is already in * error recovery mode. Otherwise, it calls {@link //beginErrorCondition} to * enter error recovery mode, followed by calling * {@link Parser//notifyErrorListeners}.

* * @param recognizer the parser instance * */ reportUnwantedToken(e) { if (this.inErrorRecoveryMode(e)) return; this.beginErrorCondition(e); const t = e.getCurrentToken(), i = this.getTokenErrorDisplay(t), s = this.getExpectedTokens(e), l = "extraneous input " + i + " expecting " + s.toString(e.literalNames, e.symbolicNames); e.notifyErrorListeners(l, t, null); } /** * This method is called to report a syntax error which requires the * insertion of a missing token into the input stream. At the time this * method is called, the missing token has not yet been inserted. When this * method returns, {@code recognizer} is in error recovery mode. * *

This method is called when {@link //singleTokenInsertion} identifies * single-token insertion as a viable recovery strategy for a mismatched * input error.

* *

* * @param recognizer the parser instance */ reportMissingToken(e) { if (this.inErrorRecoveryMode(e)) return; this.beginErrorCondition(e); const t = e.getCurrentToken(), s = "missing " + this.getExpectedTokens(e).toString(e.literalNames, e.symbolicNames) + " at " + this.getTokenErrorDisplay(t); e.notifyErrorListeners(s, t, null); } /** *

The default implementation attempts to recover from the mismatched input * by using single token insertion and deletion as described below. If the * recovery attempt fails, this method throws an * {@link InputMismatchException}.

* *

EXTRA TOKEN (single token deletion)

* *

{@code LA(1)} is not what we are looking for. If {@code LA(2)} has the * right token, however, then assume {@code LA(1)} is some extra spurious * token and delete it. Then consume and return the next token (which was * the {@code LA(2)} token) as the successful result of the match operation.

* *

This recovery strategy is implemented by {@link * //singleTokenDeletion}.

* *

MISSING TOKEN (single token insertion)

* *

If current token (at {@code LA(1)}) is consistent with what could come * after the expected {@code LA(1)} token, then assume the token is missing * and use the parser's {@link TokenFactory} to create it on the fly. The * "insertion" is performed by returning the created token as the successful * result of the match operation.

* *

This recovery strategy is implemented by {@link * //singleTokenInsertion}.

* *

EXAMPLE

* *

For example, Input {@code i=(3;} is clearly missing the {@code ')'}. When * the parser returns from the nested call to {@code expr}, it will have * call chain:

* *

   * stat → expr → atom
   *

* * and it will be trying to match the {@code ')'} at this point in the * derivation: * *

   * => ID '=' '(' INT ')' ('+' atom)* ';'
   * ^
   *

* * The attempt to match {@code ')'} will fail when it sees {@code ';'} and * call {@link //recoverInline}. To recover, it sees that {@code LA(1)==';'} * is in the set of tokens that can follow the {@code ')'} token reference * in rule {@code atom}. It can assume that you forgot the {@code ')'}. */ recoverInline(e) { const t = this.singleTokenDeletion(e); if (t !== null) return e.consume(), t; if (this.singleTokenInsertion(e)) return this.getMissingSymbol(e); throw new V5(e); } /** * This method implements the single-token insertion inline error recovery * strategy. It is called by {@link //recoverInline} if the single-token * deletion strategy fails to recover from the mismatched input. If this * method returns {@code true}, {@code recognizer} will be in error recovery * mode. * *

This method determines whether or not single-token insertion is viable by * checking if the {@code LA(1)} input symbol could be successfully matched * if it were instead the {@code LA(2)} symbol. If this method returns * {@code true}, the caller is responsible for creating and inserting a * token with the correct type to produce this behavior.

* * @param recognizer the parser instance * @return {@code true} if single-token insertion is a viable recovery * strategy for the current mismatched input, otherwise {@code false} */ singleTokenInsertion(e) { const t = e.getTokenStream().LA(1), i = e._interp.atn, l = i.states[e.state].transitions[0].target; return i.nextTokens(l, e._ctx).contains(t) ? (this.reportMissingToken(e), !0) : !1; } /** * This method implements the single-token deletion inline error recovery * strategy. It is called by {@link //recoverInline} to attempt to recover * from mismatched input. If this method returns null, the parser and error * handler state will not have changed. If this method returns non-null, * {@code recognizer} will not be in error recovery mode since the * returned token was a successful match. * *

If the single-token deletion is successful, this method calls * {@link //reportUnwantedToken} to report the error, followed by * {@link Parser//consume} to actually "delete" the extraneous token. Then, * before returning {@link //reportMatch} is called to signal a successful * match.

* * @param recognizer the parser instance * @return the successfully matched {@link Token} instance if single-token * deletion successfully recovers from the mismatched input, otherwise * {@code null} */ singleTokenDeletion(e) { const t = e.getTokenStream().LA(2); if (this.getExpectedTokens(e).contains(t)) { this.reportUnwantedToken(e), e.consume(); const s = e.getCurrentToken(); return this.reportMatch(e), s; } else return null; } /** * Conjure up a missing token during error recovery. * * The recognizer attempts to recover from single missing * symbols. But, actions might refer to that missing symbol. * For example, x=ID {f($x);}. The action clearly assumes * that there has been an identifier matched previously and that * $x points at that token. If that token is missing, but * the next token in the stream is what we want we assume that * this token is missing and we keep going. Because we * have to return some token to replace the missing token, * we have to conjure one up. This method gives the user control * over the tokens returned for missing tokens. Mostly, * you will want to create something special for identifier * tokens. For literals such as '{' and ',', the default * action in the parser or tree parser works. It simply creates * a CommonToken of the appropriate type. The text will be the token. * If you change what tokens must be created by the lexer, * override this method to create the appropriate tokens. * */ getMissingSymbol(e) { const t = e.getCurrentToken(), s = this.getExpectedTokens(e).first(); let l; s === m2.EOF ? l = "" : l = ""; let c = t; const d = e.getTokenStream().LT(-1); return c.type === m2.EOF && d !== null && (c = d), e.getTokenFactory().create( c.source, s, l, m2.DEFAULT_CHANNEL, -1, -1, c.line, c.column ); } getExpectedTokens(e) { return e.getExpectedTokens(); } /** * How should a token be displayed in an error message? The default * is to display just the text, but during development you might * want to have a lot of information spit out. Override in that case * to use t.toString() (which, for CommonToken, dumps everything about * the token). This is better than forcing you to override a method in * your token objects because you don't have to go modify your lexer * so that it creates a new Java type. */ getTokenErrorDisplay(e) { if (e === null) return ""; let t = e.text; return t === null && (e.type === m2.EOF ? t = "" : t = "<" + e.type + ">"), this.escapeWSAndQuote(t); } escapeWSAndQuote(e) { return e = e.replace(/\n/g, "\\n"), e = e.replace(/\r/g, "\\r"), e = e.replace(/\t/g, "\\t"), "'" + e + "'"; } /** * Compute the error recovery set for the current rule. During * rule invocation, the parser pushes the set of tokens that can * follow that rule reference on the stack; this amounts to * computing FIRST of what follows the rule reference in the * enclosing rule. See LinearApproximator.FIRST(). * This local follow set only includes tokens * from within the rule; i.e., the FIRST computation done by * ANTLR stops at the end of a rule. * * EXAMPLE * * When you find a "no viable alt exception", the input is not * consistent with any of the alternatives for rule r. The best * thing to do is to consume tokens until you see something that * can legally follow a call to r//or* any rule that called r. * You don't want the exact set of viable next tokens because the * input might just be missing a token--you might consume the * rest of the input looking for one of the missing tokens. * * Consider grammar: * * a : '[' b ']' * | '(' b ')' * ; * b : c '^' INT ; * c : ID * | INT * ; * * At each rule invocation, the set of tokens that could follow * that rule is pushed on a stack. Here are the various * context-sensitive follow sets: * * FOLLOW(b1_in_a) = FIRST(']') = ']' * FOLLOW(b2_in_a) = FIRST(')') = ')' * FOLLOW(c_in_b) = FIRST('^') = '^' * * Upon erroneous input "[]", the call chain is * * a -> b -> c * * and, hence, the follow context stack is: * * depth follow set start of rule execution * 0 a (from main()) * 1 ']' b * 2 '^' c * * Notice that ')' is not included, because b would have to have * been called from a different context in rule a for ')' to be * included. * * For error recovery, we cannot consider FOLLOW(c) * (context-sensitive or otherwise). We need the combined set of * all context-sensitive FOLLOW sets--the set of all tokens that * could follow any reference in the call chain. We need to * resync to one of those tokens. Note that FOLLOW(c)='^' and if * we resync'd to that token, we'd consume until EOF. We need to * sync to context-sensitive FOLLOWs for a, b, and c: {']','^'}. * In this case, for input "[]", LA(1) is ']' and in the set, so we would * not consume anything. After printing an error, rule c would * return normally. Rule b would not find the required '^' though. * At this point, it gets a mismatched token error and throws an * exception (since LA(1) is not in the viable following token * set). The rule exception handler tries to recover, but finds * the same recovery set and doesn't consume anything. Rule b * exits normally returning to rule a. Now it finds the ']' (and * with the successful match exits errorRecovery mode). * * So, you can see that the parser walks up the call chain looking * for the token that was a member of the recovery set. * * Errors are not generated in errorRecovery mode. * * ANTLR's error recovery mechanism is based upon original ideas: * * "Algorithms + Data Structures = Programs" by Niklaus Wirth * * and * * "A note on error recovery in recursive descent parsers": * http://portal.acm.org/citation.cfm?id=947902.947905 * * Later, Josef Grosch had some good ideas: * * "Efficient and Comfortable Error Recovery in Recursive Descent * Parsers": * ftp://www.cocolab.com/products/cocktail/doca4.ps/ell.ps.zip * * Like Grosch I implement context-sensitive FOLLOW sets that are combined * at run-time upon error to avoid overhead during parsing. */ getErrorRecoverySet(e) { const t = e._interp.atn; let i = e._ctx; const s = new X3(); for (; i !== null && i.invokingState >= 0; ) { const c = t.states[i.invokingState].transitions[0], d = t.nextTokens(c.followState); s.addSet(d), i = i.parentCtx; } return s.removeOne(m2.EPSILON), s; } // Consume tokens until one matches the given token set.// consumeUntil(e, t) { let i = e.getTokenStream().LA(1); for (; i !== m2.EOF && !t.contains(i); ) e.consume(), i = e.getTokenStream().LA(1); } } class $x extends Gc { constructor() { super(); } /** * Instead of recovering from exception {@code e}, re-throw it wrapped * in a {@link ParseCancellationException} so it is not caught by the * rule function catches. Use {@link Exception//getCause()} to get the * original {@link RecognitionException}. */ recover(e, t) { let i = e._ctx; for (; i !== null; ) i.exception = t, i = i.parentCtx; throw new Bc(t); } /** * Make sure we don't attempt to recover inline; if the parser * successfully recovers, it won't throw an exception. */ recoverInline(e) { this.recover(e, new V5(e)); } // Make sure we don't attempt to recover from problems in subrules.// sync(e) { } } const Kx = { RecognitionException: Kt, NoViableAltException: Uc, LexerNoViableAltException: Fc, InputMismatchException: V5, FailedPredicateException: GE, DiagnosticErrorListener: qx, BailErrorStrategy: $x, DefaultErrorStrategy: Gc, ErrorListener: v6 }; class f9 { constructor(e, t) { if (this.name = "", this.strdata = e, this.decodeToUnicodeCodePoints = t || !1, this._index = 0, this.data = [], this.decodeToUnicodeCodePoints) for (let i = 0; i < this.strdata.length; ) { const s = this.strdata.codePointAt(i); this.data.push(s), i += s <= 65535 ? 1 : 2; } else { this.data = new Array(this.strdata.length); for (let i = 0; i < this.strdata.length; i++) { const s = this.strdata.charCodeAt(i); this.data[i] = s; } } this._size = this.data.length; } /** * Reset the stream so that it's in the same state it was * when the object was created *except* the data array is not * touched. */ reset() { this._index = 0; } consume() { if (this._index >= this._size) throw "cannot consume EOF"; this._index += 1; } LA(e) { if (e === 0) return 0; e < 0 && (e += 1); const t = this._index + e - 1; return t < 0 || t >= this._size ? m2.EOF : this.data[t]; } LT(e) { return this.LA(e); } // mark/release do nothing; we have entire buffer mark() { return -1; } release(e) { } /** * consume() ahead until p==_index; can't just set p=_index as we must * update line and column. If we seek backwards, just set p */ seek(e) { if (e <= this._index) { this._index = e; return; } this._index = Math.min(e, this._size); } getText(e, t) { if (t >= this._size && (t = this._size - 1), e >= this._size) return ""; if (this.decodeToUnicodeCodePoints) { let i = ""; for (let s = e; s <= t; s++) i += String.fromCodePoint(this.data[s]); return i; } else return this.strdata.slice(e, t + 1); } toString() { return this.strdata; } get index() { return this._index; } get size() { return this._size; } } const ql = {}, Qx = { // Creates an InputStream from a string. fromString: function(n) { return new f9(n, !0); }, /** * Asynchronously creates an InputStream from a blob given the * encoding of the bytes in that blob (defaults to 'utf8' if * encoding is null). * * Invokes onLoad(result) on success, onError(error) on * failure. */ fromBlob: function(n, e, t, i) { const s = new window.FileReader(); s.onload = function(l) { const c = new f9(l.target.result, !0); t(c); }, s.onerror = i, s.readAsText(n, e); }, /** * Creates an InputStream from a Buffer given the * encoding of the bytes in that buffer (defaults to 'utf8' if * encoding is null). */ fromBuffer: function(n, e) { return new f9(n.toString(e), !0); }, /** Asynchronously creates an InputStream from a file on disk given * the encoding of the bytes in that file (defaults to 'utf8' if * encoding is null). * * Invokes callback(error, result) on completion. */ fromPath: function(n, e, t) { ql.readFile(n, e, function(i, s) { let l = null; s !== null && (l = new f9(s, !0)), t(i, l); }); }, /** * Synchronously creates an InputStream given a path to a file * on disk and the encoding of the bytes in that file (defaults to * 'utf8' if encoding is null). */ fromPathSync: function(n, e) { const t = ql.readFileSync(n, e); return new f9(t, !0); } }; class jx extends f9 { constructor(e, t) { const i = ql.readFileSync(e, "utf8"); super(i, t), this.fileName = e; } } class Xx { } class Jx extends Xx { constructor(e) { super(), this.tokenSource = e, this.tokens = [], this.index = -1, this.fetchedEOF = !1; } mark() { return 0; } release(e) { } reset() { this.seek(0); } seek(e) { this.lazyInit(), this.index = this.adjustSeekIndex(e); } get(e) { return this.lazyInit(), this.tokens[e]; } consume() { let e = !1; if (this.index >= 0 ? this.fetchedEOF ? e = this.index < this.tokens.length - 1 : e = this.index < this.tokens.length : e = !1, !e && this.LA(1) === m2.EOF) throw "cannot consume EOF"; this.sync(this.index + 1) && (this.index = this.adjustSeekIndex(this.index + 1)); } /** * Make sure index {@code i} in tokens has a token. * * @return {Boolean} {@code true} if a token is located at index {@code i}, otherwise * {@code false}. * @see //get(int i) */ sync(e) { const t = e - this.tokens.length + 1; return t > 0 ? this.fetch(t) >= t : !0; } /** * Add {@code n} elements to buffer. * * @return {Number} The actual number of elements added to the buffer. */ fetch(e) { if (this.fetchedEOF) return 0; for (let t = 0; t < e; t++) { const i = this.tokenSource.nextToken(); if (i.tokenIndex = this.tokens.length, this.tokens.push(i), i.type === m2.EOF) return this.fetchedEOF = !0, t + 1; } return e; } // Get all tokens from start..stop inclusively/// getTokens(e, t, i) { if (i === void 0 && (i = null), e < 0 || t < 0) return null; this.lazyInit(); const s = []; t >= this.tokens.length && (t = this.tokens.length - 1); for (let l = e; l < t; l++) { const c = this.tokens[l]; if (c.type === m2.EOF) break; (i === null || i.contains(c.type)) && s.push(c); } return s; } LA(e) { return this.LT(e).type; } LB(e) { return this.index - e < 0 ? null : this.tokens[this.index - e]; } LT(e) { if (this.lazyInit(), e === 0) return null; if (e < 0) return this.LB(-e); const t = this.index + e - 1; return this.sync(t), t >= this.tokens.length ? this.tokens[this.tokens.length - 1] : this.tokens[t]; } /** * Allowed derived classes to modify the behavior of operations which change * the current stream position by adjusting the target token index of a seek * operation. The default implementation simply returns {@code i}. If an * exception is thrown in this method, the current stream index should not be * changed. * *

For example, {@link CommonTokenStream} overrides this method to ensure * that * the seek target is always an on-channel token.

* * @param {Number} i The target token index. * @return {Number} The adjusted target token index. */ adjustSeekIndex(e) { return e; } lazyInit() { this.index === -1 && this.setup(); } setup() { this.sync(0), this.index = this.adjustSeekIndex(0); } // Reset this token stream by setting its token source./// setTokenSource(e) { this.tokenSource = e, this.tokens = [], this.index = -1, this.fetchedEOF = !1; } /** * Given a starting index, return the index of the next token on channel. * Return i if tokens[i] is on channel. Return -1 if there are no tokens * on channel between i and EOF. */ nextTokenOnChannel(e, t) { if (this.sync(e), e >= this.tokens.length) return -1; let i = this.tokens[e]; for (; i.channel !== this.channel; ) { if (i.type === m2.EOF) return -1; e += 1, this.sync(e), i = this.tokens[e]; } return e; } /** * Given a starting index, return the index of the previous token on channel. * Return i if tokens[i] is on channel. Return -1 if there are no tokens * on channel between i and 0. */ previousTokenOnChannel(e, t) { for (; e >= 0 && this.tokens[e].channel !== t; ) e -= 1; return e; } /** * Collect all tokens on specified channel to the right of * the current token up until we see a token on DEFAULT_TOKEN_CHANNEL or * EOF. If channel is -1, find any non default channel token. */ getHiddenTokensToRight(e, t) { if (t === void 0 && (t = -1), this.lazyInit(), e < 0 || e >= this.tokens.length) throw "" + e + " not in 0.." + this.tokens.length - 1; const i = this.nextTokenOnChannel(e + 1, Ke.DEFAULT_TOKEN_CHANNEL), s = e + 1, l = i === -1 ? this.tokens.length - 1 : i; return this.filterForChannel(s, l, t); } /** * Collect all tokens on specified channel to the left of * the current token up until we see a token on DEFAULT_TOKEN_CHANNEL. * If channel is -1, find any non default channel token. */ getHiddenTokensToLeft(e, t) { if (t === void 0 && (t = -1), this.lazyInit(), e < 0 || e >= this.tokens.length) throw "" + e + " not in 0.." + this.tokens.length - 1; const i = this.previousTokenOnChannel(e - 1, Ke.DEFAULT_TOKEN_CHANNEL); if (i === e - 1) return null; const s = i + 1, l = e - 1; return this.filterForChannel(s, l, t); } filterForChannel(e, t, i) { const s = []; for (let l = e; l < t + 1; l++) { const c = this.tokens[l]; i === -1 ? c.channel !== Ke.DEFAULT_TOKEN_CHANNEL && s.push(c) : c.channel === i && s.push(c); } return s.length === 0 ? null : s; } getSourceName() { return this.tokenSource.getSourceName(); } // Get the text of all tokens in this buffer./// getText(e) { this.lazyInit(), this.fill(), e == null && (e = new m1(0, this.tokens.length - 1)); let t = e.start; t instanceof m2 && (t = t.tokenIndex); let i = e.stop; if (i instanceof m2 && (i = i.tokenIndex), t === null || i === null || t < 0 || i < 0) return ""; i >= this.tokens.length && (i = this.tokens.length - 1); let s = ""; for (let l = t; l < i + 1; l++) { const c = this.tokens[l]; if (c.type === m2.EOF) break; s = s + c.text; } return s; } // Get all tokens from lexer until EOF/// fill() { for (this.lazyInit(); this.fetch(1e3) === 1e3; ) ; } } class ew extends Jx { constructor(e, t) { super(e), this.channel = t === void 0 ? m2.DEFAULT_CHANNEL : t; } adjustSeekIndex(e) { return this.nextTokenOnChannel(e, this.channel); } LB(e) { if (e === 0 || this.index - e < 0) return null; let t = this.index, i = 1; for (; i <= e; ) t = this.previousTokenOnChannel(t - 1, this.channel), i += 1; return t < 0 ? null : this.tokens[t]; } LT(e) { if (this.lazyInit(), e === 0) return null; if (e < 0) return this.LB(-e); let t = this.index, i = 1; for (; i < e; ) this.sync(t + 1) && (t = this.nextTokenOnChannel(t + 1, this.channel)), i += 1; return this.tokens[t]; } // Count EOF just once. getNumberOfOnChannelTokens() { let e = 0; this.fill(); for (let t = 0; t < this.tokens.length; t++) { const i = this.tokens[t]; if (i.channel === this.channel && (e += 1), i.type === m2.EOF) break; } return e; } } class tw extends BE { constructor(e) { super(), this.parser = e; } enterEveryRule(e) { console.log("enter " + this.parser.ruleNames[e.ruleIndex] + ", LT(1)=" + this.parser._input.LT(1).text); } visitTerminal(e) { console.log("consume " + e.symbol + " rule " + this.parser.ruleNames[this.parser._ctx.ruleIndex]); } exitEveryRule(e) { console.log("exit " + this.parser.ruleNames[e.ruleIndex] + ", LT(1)=" + this.parser._input.LT(1).text); } } let zE = class extends R6 { /** * this is all the parsing support code essentially; most of it is error * recovery stuff. */ constructor(e) { super(), this._input = null, this._errHandler = new Gc(), this._precedenceStack = [], this._precedenceStack.push(0), this._ctx = null, this.buildParseTrees = !0, this._tracer = null, this._parseListeners = null, this._syntaxErrors = 0, this.setInputStream(e); } // reset the parser's state reset() { this._input !== null && this._input.seek(0), this._errHandler.reset(this), this._ctx = null, this._syntaxErrors = 0, this.setTrace(!1), this._precedenceStack = [], this._precedenceStack.push(0), this._interp !== null && this._interp.reset(); } /** * Match current input symbol against {@code ttype}. If the symbol type * matches, {@link ANTLRErrorStrategy//reportMatch} and {@link //consume} are * called to complete the match process. * *

If the symbol type does not match, * {@link ANTLRErrorStrategy//recoverInline} is called on the current error * strategy to attempt recovery. If {@link //getBuildParseTree} is * {@code true} and the token index of the symbol returned by * {@link ANTLRErrorStrategy//recoverInline} is -1, the symbol is added to * the parse tree by calling {@link ParserRuleContext//addErrorNode}.

* * @param ttype the token type to match * @return the matched symbol * @throws RecognitionException if the current input symbol did not match * {@code ttype} and the error strategy could not recover from the * mismatched symbol */ match(e) { let t = this.getCurrentToken(); return t.type === e ? (this._errHandler.reportMatch(this), this.consume()) : (t = this._errHandler.recoverInline(this), this.buildParseTrees && t.tokenIndex === -1 && this._ctx.addErrorNode(t)), t; } /** * Match current input symbol as a wildcard. If the symbol type matches * (i.e. has a value greater than 0), {@link ANTLRErrorStrategy//reportMatch} * and {@link //consume} are called to complete the match process. * *

* * @return the matched symbol * @throws RecognitionException if the current input symbol did not match * a wildcard and the error strategy could not recover from the mismatched * symbol */ matchWildcard() { let e = this.getCurrentToken(); return e.type > 0 ? (this._errHandler.reportMatch(this), this.consume()) : (e = this._errHandler.recoverInline(this), this._buildParseTrees && e.tokenIndex === -1 && this._ctx.addErrorNode(e)), e; } getParseListeners() { return this._parseListeners || []; } /** * Registers {@code listener} to receive events during the parsing process. * *

To support output-preserving grammar transformations (including but not * limited to left-recursion removal, automated left-factoring, and * optimized code generation), calls to listener methods during the parse * may differ substantially from calls made by * {@link ParseTreeWalker//DEFAULT} used after the parse is complete. In * particular, rule entry and exit events may occur in a different order * during the parse than after the parser. In addition, calls to certain * rule entry methods may be omitted.

* *

With the following specific exceptions, calls to listener events are * deterministic, i.e. for identical input the calls to listener * methods will be the same.

* *

Alterations to the grammar used to generate code may change the * behavior of the listener calls.
Alterations to the command line options passed to ANTLR 4 when * generating the parser may change the behavior of the listener calls.
Changing the version of the ANTLR Tool used to generate the parser * may change the behavior of the listener calls.

* * @param listener the listener to add * * @throws NullPointerException if {@code} listener is {@code null} */ addParseListener(e) { if (e === null) throw "listener"; this._parseListeners === null && (this._parseListeners = []), this._parseListeners.push(e); } /** * Remove {@code listener} from the list of parse listeners. * *

If {@code listener} is {@code null} or has not been added as a parse * listener, this method does nothing.

* @param listener the listener to remove */ removeParseListener(e) { if (this._parseListeners !== null) { const t = this._parseListeners.indexOf(e); t >= 0 && this._parseListeners.splice(t, 1), this._parseListeners.length === 0 && (this._parseListeners = null); } } // Remove all parse listeners. removeParseListeners() { this._parseListeners = null; } // Notify any parse listeners of an enter rule event. triggerEnterRuleEvent() { if (this._parseListeners !== null) { const e = this._ctx; this._parseListeners.forEach(function(t) { t.enterEveryRule(e), e.enterRule(t); }); } } /** * Notify any parse listeners of an exit rule event. * @see //addParseListener */ triggerExitRuleEvent() { if (this._parseListeners !== null) { const e = this._ctx; this._parseListeners.slice(0).reverse().forEach(function(t) { e.exitRule(t), t.exitEveryRule(e); }); } } getTokenFactory() { return this._input.tokenSource._factory; } // Tell our token source and error strategy about a new way to create tokens. setTokenFactory(e) { this._input.tokenSource._factory = e; } /** * The ATN with bypass alternatives is expensive to create so we create it * lazily. * * @throws UnsupportedOperationException if the current parser does not * implement the {@link //getSerializedATN()} method. */ getATNWithBypassAlts() { const e = this.getSerializedATN(); if (e === null) throw "The current parser does not support an ATN with bypass alternatives."; let t = this.bypassAltsAtnCache[e]; if (t === null) { const i = new J5(); i.generateRuleBypassTransitions = !0, t = new FE(i).deserialize(e), this.bypassAltsAtnCache[e] = t; } return t; } getInputStream() { return this.getTokenStream(); } setInputStream(e) { this.setTokenStream(e); } getTokenStream() { return this._input; } // Set the token stream and reset the parser. setTokenStream(e) { this._input = null, this.reset(), this._input = e; } /** * Match needs to return the current input symbol, which gets put * into the label for the associated token ref; e.g., x=ID. */ getCurrentToken() { return this._input.LT(1); } notifyErrorListeners(e, t, i) { t = t || null, i = i || null, t === null && (t = this.getCurrentToken()), this._syntaxErrors += 1; const s = t.line, l = t.column; this.getErrorListenerDispatch().syntaxError(this, t, s, l, e, i); } /** * Consume and return the {@linkplain //getCurrentToken current symbol}. * *

E.g., given the following input with {@code A} being the current * lookahead symbol, this function moves the cursor to {@code B} and returns * {@code A}.

* *

   * A B
   * ^
   *

* * If the parser is not in error recovery mode, the consumed symbol is added * to the parse tree using {@link ParserRuleContext//addChild(Token)}, and * {@link ParseTreeListener//visitTerminal} is called on any parse listeners. * If the parser is in error recovery mode, the consumed symbol is * added to the parse tree using * {@link ParserRuleContext//addErrorNode(Token)}, and * {@link ParseTreeListener//visitErrorNode} is called on any parse * listeners. */ consume() { const e = this.getCurrentToken(); e.type !== m2.EOF && this.getInputStream().consume(); const t = this._parseListeners !== null && this._parseListeners.length > 0; if (this.buildParseTrees || t) { let i; this._errHandler.inErrorRecoveryMode(this) ? i = this._ctx.addErrorNode(e) : i = this._ctx.addTokenNode(e), i.invokingState = this.state, t && this._parseListeners.forEach(function(s) { i instanceof E6 || i.isErrorNode !== void 0 && i.isErrorNode() ? s.visitErrorNode(i) : i instanceof nt && s.visitTerminal(i); }); } return e; } addContextToParseTree() { this._ctx.parentCtx !== null && this._ctx.parentCtx.addChild(this._ctx); } /** * Always called by generated parsers upon entry to a rule. Access field * {@link //_ctx} get the current context. */ enterRule(e, t, i) { this.state = t, this._ctx = e, this._ctx.start = this._input.LT(1), this.buildParseTrees && this.addContextToParseTree(), this.triggerEnterRuleEvent(); } exitRule() { this._ctx.stop = this._input.LT(-1), this.triggerExitRuleEvent(), this.state = this._ctx.invokingState, this._ctx = this._ctx.parentCtx; } enterOuterAlt(e, t) { e.setAltNumber(t), this.buildParseTrees && this._ctx !== e && this._ctx.parentCtx !== null && (this._ctx.parentCtx.removeLastChild(), this._ctx.parentCtx.addChild(e)), this._ctx = e; } /** * Get the precedence level for the top-most precedence rule. * * @return The precedence level for the top-most precedence rule, or -1 if * the parser context is not nested within a precedence rule. */ getPrecedence() { return this._precedenceStack.length === 0 ? -1 : this._precedenceStack[this._precedenceStack.length - 1]; } enterRecursionRule(e, t, i, s) { this.state = t, this._precedenceStack.push(s), this._ctx = e, this._ctx.start = this._input.LT(1), this.triggerEnterRuleEvent(); } // Like {@link //enterRule} but for recursive rules. pushNewRecursionContext(e, t, i) { const s = this._ctx; s.parentCtx = e, s.invokingState = t, s.stop = this._input.LT(-1), this._ctx = e, this._ctx.start = s.start, this.buildParseTrees && this._ctx.addChild(s), this.triggerEnterRuleEvent(); } unrollRecursionContexts(e) { this._precedenceStack.pop(), this._ctx.stop = this._input.LT(-1); const t = this._ctx, i = this.getParseListeners(); if (i !== null && i.length > 0) for (; this._ctx !== e; ) this.triggerExitRuleEvent(), this._ctx = this._ctx.parentCtx; else this._ctx = e; t.parentCtx = e, this.buildParseTrees && e !== null && e.addChild(t); } getInvokingContext(e) { let t = this._ctx; for (; t !== null; ) { if (t.ruleIndex === e) return t; t = t.parentCtx; } return null; } precpred(e, t) { return t >= this._precedenceStack[this._precedenceStack.length - 1]; } inContext(e) { return !1; } /** * Checks whether or not {@code symbol} can follow the current state in the * ATN. The behavior of this method is equivalent to the following, but is * implemented such that the complete context-sensitive follow set does not * need to be explicitly constructed. * *

   * return getExpectedTokens().contains(symbol);
   *

* * @param symbol the symbol type to check * @return {@code true} if {@code symbol} can follow the current state in * the ATN, otherwise {@code false}. */ isExpectedToken(e) { const t = this._interp.atn; let i = this._ctx; const s = t.states[this.state]; let l = t.nextTokens(s); if (l.contains(e)) return !0; if (!l.contains(m2.EPSILON)) return !1; for (; i !== null && i.invokingState >= 0 && l.contains(m2.EPSILON); ) { const d = t.states[i.invokingState].transitions[0]; if (l = t.nextTokens(d.followState), l.contains(e)) return !0; i = i.parentCtx; } return !!(l.contains(m2.EPSILON) && e === m2.EOF); } /** * Computes the set of input symbols which could follow the current parser * state and context, as given by {@link //getState} and {@link //getContext}, * respectively. * * @see ATN//getExpectedTokens(int, RuleContext) */ getExpectedTokens() { return this._interp.atn.getExpectedTokens(this.state, this._ctx); } getExpectedTokensWithinCurrentRule() { const e = this._interp.atn, t = e.states[this.state]; return e.nextTokens(t); } // Get a rule's index (i.e., {@code RULE_ruleName} field) or -1 if not found. getRuleIndex(e) { const t = this.getRuleIndexMap()[e]; return t !== null ? t : -1; } /** * Return List<String> of the rule names in your parser instance * leading up to a call to the current rule. You could override if * you want more details such as the file/line info of where * in the ATN a rule is invoked. * * this is very useful for error messages. */ getRuleInvocationStack(e) { e = e || null, e === null && (e = this._ctx); const t = []; for (; e !== null; ) { const i = e.ruleIndex; i < 0 ? t.push("n/a") : t.push(this.ruleNames[i]), e = e.parentCtx; } return t; } // For debugging and other purposes. getDFAStrings() { return this._interp.decisionToDFA.toString(); } // For debugging and other purposes. dumpDFA() { let e = !1; for (let t = 0; t < this._interp.decisionToDFA.length; t++) { const i = this._interp.decisionToDFA[t]; i.states.length > 0 && (e && console.log(), this.printer.println("Decision " + i.decision + ":"), this.printer.print(i.toString(this.literalNames, this.symbolicNames)), e = !0); } } /* " printer = function() {\r\n" + " this.println = function(s) { document.getElementById('output') += s + '\\n'; }\r\n" + " this.print = function(s) { document.getElementById('output') += s; }\r\n" + " };\r\n" + */ getSourceName() { return this._input.sourceName; } /** * During a parse is sometimes useful to listen in on the rule entry and exit * events as well as token matches. this is for quick and dirty debugging. */ setTrace(e) { e ? (this._tracer !== null && this.removeParseListener(this._tracer), this._tracer = new tw(this), this.addParseListener(this._tracer)) : (this.removeParseListener(this._tracer), this._tracer = null); } }; zE.bypassAltsAtnCache = {}; class nw { constructor() { this.cache = new ln(); } /** * Add a context to the cache and return it. If the context already exists, * return that one instead and do not add a new context to the cache. * Protect shared cache from unsafe thread access. */ add(e) { if (e === t1.EMPTY) return t1.EMPTY; const t = this.cache.get(e) || null; return t !== null ? t : (this.cache.set(e, e), e); } get(e) { return this.cache.get(e) || null; } get length() { return this.cache.length; } } class HE extends nt { constructor(e) { super(), this.parentCtx = null, this.symbol = e; } getChild(e) { return null; } getSymbol() { return this.symbol; } getParent() { return this.parentCtx; } getPayload() { return this.symbol; } getSourceInterval() { if (this.symbol === null) return m1.INVALID_INTERVAL; const e = this.symbol.tokenIndex; return new m1(e, e); } getChildCount() { return 0; } accept(e) { return e.visitTerminal(this); } getText() { return this.symbol.text; } toString() { return this.symbol.type === m2.EOF ? "" : this.symbol.text; } } class q_ extends HE { constructor(e) { super(e); } isErrorNode() { return !0; } accept(e) { return e.visitErrorNode(this); } } let YE = class extends f0 { constructor(e, t) { e = e || null, t = t || null, super(e, t), this.ruleIndex = -1, this.children = null, this.start = null, this.stop = null, this.exception = null; } // COPY a ctx (I'm deliberately not using copy constructor) copyFrom(e) { this.parentCtx = e.parentCtx, this.invokingState = e.invokingState, this.children = null, this.start = e.start, this.stop = e.stop, e.children && (this.children = [], e.children.map(function(t) { t instanceof q_ && (this.children.push(t), t.parentCtx = this); }, this)); } // Double dispatch methods for listeners enterRule(e) { } exitRule(e) { } // Does not set parent link; other add methods do that addChild(e) { return this.children === null && (this.children = []), this.children.push(e), e; } /** Used by enterOuterAlt to toss out a RuleContext previously added as * we entered a rule. If we have // label, we will need to remove * generic ruleContext object. */ removeLastChild() { this.children !== null && this.children.pop(); } addTokenNode(e) { const t = new HE(e); return this.addChild(t), t.parentCtx = this, t; } addErrorNode(e) { const t = new q_(e); return this.addChild(t), t.parentCtx = this, t; } getChild(e, t) { if (t = t || null, this.children === null || e < 0 || e >= this.children.length) return null; if (t === null) return this.children[e]; for (let i = 0; i < this.children.length; i++) { const s = this.children[i]; if (s instanceof t) { if (e === 0) return s; e -= 1; } } return null; } getToken(e, t) { if (this.children === null || t < 0 || t >= this.children.length) return null; for (let i = 0; i < this.children.length; i++) { const s = this.children[i]; if (s instanceof nt && s.symbol.type === e) { if (t === 0) return s; t -= 1; } } return null; } getTokens(e) { if (this.children === null) return []; { const t = []; for (let i = 0; i < this.children.length; i++) { const s = this.children[i]; s instanceof nt && s.symbol.type === e && t.push(s); } return t; } } getTypedRuleContext(e, t) { return this.getChild(t, e); } getTypedRuleContexts(e) { if (this.children === null) return []; { const t = []; for (let i = 0; i < this.children.length; i++) { const s = this.children[i]; s instanceof e && t.push(s); } return t; } } getChildCount() { return this.children === null ? 0 : this.children.length; } getSourceInterval() { return this.start === null || this.stop === null ? m1.INVALID_INTERVAL : new m1(this.start.tokenIndex, this.stop.tokenIndex); } }; f0.EMPTY = new YE(); const iw = { arrayToString: Gt }, K = { atn: Bx, dfa: zx, tree: Yx, error: Kx, Token: m2, CommonToken: b9, CharStreams: Qx, InputStream: f9, FileStream: jx, CommonTokenStream: ew, Lexer: Ke, Parser: zE, PredictionContextCache: nw, ParserRuleContext: YE, Interval: m1, IntervalSet: X3, LL1Analyzer: E0, Utils: iw }, rw = [ 4, 0, 71, 585, 6, -1, 6, -1, 6, -1, 2, 0, 7, 0, 2, 1, 7, 1, 2, 2, 7, 2, 2, 3, 7, 3, 2, 4, 7, 4, 2, 5, 7, 5, 2, 6, 7, 6, 2, 7, 7, 7, 2, 8, 7, 8, 2, 9, 7, 9, 2, 10, 7, 10, 2, 11, 7, 11, 2, 12, 7, 12, 2, 13, 7, 13, 2, 14, 7, 14, 2, 15, 7, 15, 2, 16, 7, 16, 2, 17, 7, 17, 2, 18, 7, 18, 2, 19, 7, 19, 2, 20, 7, 20, 2, 21, 7, 21, 2, 22, 7, 22, 2, 23, 7, 23, 2, 24, 7, 24, 2, 25, 7, 25, 2, 26, 7, 26, 2, 27, 7, 27, 2, 28, 7, 28, 2, 29, 7, 29, 2, 30, 7, 30, 2, 31, 7, 31, 2, 32, 7, 32, 2, 33, 7, 33, 2, 34, 7, 34, 2, 35, 7, 35, 2, 36, 7, 36, 2, 37, 7, 37, 2, 38, 7, 38, 2, 39, 7, 39, 2, 40, 7, 40, 2, 41, 7, 41, 2, 42, 7, 42, 2, 43, 7, 43, 2, 44, 7, 44, 2, 45, 7, 45, 2, 46, 7, 46, 2, 47, 7, 47, 2, 48, 7, 48, 2, 49, 7, 49, 2, 50, 7, 50, 2, 51, 7, 51, 2, 52, 7, 52, 2, 53, 7, 53, 2, 54, 7, 54, 2, 55, 7, 55, 2, 56, 7, 56, 2, 57, 7, 57, 2, 58, 7, 58, 2, 59, 7, 59, 2, 60, 7, 60, 2, 61, 7, 61, 2, 62, 7, 62, 2, 63, 7, 63, 2, 64, 7, 64, 2, 65, 7, 65, 2, 66, 7, 66, 2, 67, 7, 67, 2, 68, 7, 68, 2, 69, 7, 69, 2, 70, 7, 70, 2, 71, 7, 71, 2, 72, 7, 72, 2, 73, 7, 73, 2, 74, 7, 74, 1, 0, 1, 0, 1, 1, 4, 1, 157, 8, 1, 11, 1, 12, 1, 158, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 5, 1, 5, 1, 5, 1, 5, 1, 5, 1, 5, 1, 5, 1, 5, 1, 6, 1, 6, 1, 6, 1, 6, 1, 6, 1, 6, 1, 6, 1, 6, 1, 7, 1, 7, 1, 7, 1, 7, 1, 8, 1, 8, 1, 8, 1, 9, 1, 9, 1, 9, 1, 10, 1, 10, 1, 10, 1, 11, 1, 11, 1, 12, 1, 12, 4, 12, 224, 8, 12, 11, 12, 12, 12, 225, 1, 13, 1, 13, 1, 13, 1, 14, 1, 14, 1, 14, 1, 15, 1, 15, 1, 15, 1, 16, 1, 16, 1, 16, 1, 17, 1, 17, 1, 18, 1, 18, 1, 19, 1, 19, 1, 19, 1, 20, 1, 20, 1, 20, 1, 21, 1, 21, 1, 22, 1, 22, 1, 23, 1, 23, 1, 24, 1, 24, 1, 25, 1, 25, 1, 26, 1, 26, 1, 27, 1, 27, 1, 28, 1, 28, 1, 29, 1, 29, 1, 30, 1, 30, 1, 31, 1, 31, 1, 32, 1, 32, 1, 33, 1, 33, 1, 34, 1, 34, 1, 35, 1, 35, 1, 35, 1, 35, 1, 35, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 36, 1, 37, 1, 37, 1, 37, 1, 37, 1, 37, 1, 37, 1, 37, 3, 37, 296, 8, 37, 1, 38, 1, 38, 1, 38, 1, 39, 1, 39, 1, 39, 1, 39, 1, 39, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 1, 40, 3, 40, 332, 8, 40, 1, 41, 1, 41, 1, 41, 1, 41, 1, 41, 1, 41, 1, 41, 1, 42, 1, 42, 1, 42, 1, 42, 1, 43, 1, 43, 1, 43, 1, 43, 1, 44, 1, 44, 1, 44, 1, 44, 1, 44, 1, 44, 1, 45, 1, 45, 1, 45, 1, 45, 1, 46, 1, 46, 1, 46, 1, 46, 1, 46, 1, 46, 1, 46, 1, 46, 1, 46, 1, 47, 1, 47, 1, 47, 1, 47, 1, 47, 1, 47, 1, 47, 1, 47, 1, 47, 1, 47, 1, 47, 1, 47, 3, 47, 380, 8, 47, 1, 48, 1, 48, 1, 48, 1, 48, 1, 49, 1, 49, 1, 49, 1, 50, 1, 50, 1, 50, 1, 50, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 51, 1, 52, 1, 52, 1, 52, 1, 52, 1, 52, 1, 52, 1, 52, 1, 52, 1, 53, 1, 53, 1, 53, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 3, 54, 426, 8, 54, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 1, 55, 3, 55, 454, 8, 55, 1, 56, 1, 56, 5, 56, 458, 8, 56, 10, 56, 12, 56, 461, 9, 56, 1, 57, 1, 57, 1, 58, 1, 58, 5, 58, 467, 8, 58, 10, 58, 12, 58, 470, 9, 58, 1, 59, 4, 59, 473, 8, 59, 11, 59, 12, 59, 474, 1, 60, 1, 60, 1, 61, 4, 61, 480, 8, 61, 11, 61, 12, 61, 481, 1, 62, 4, 62, 485, 8, 62, 11, 62, 12, 62, 486, 1, 62, 1, 62, 5, 62, 491, 8, 62, 10, 62, 12, 62, 494, 9, 62, 1, 62, 1, 62, 4, 62, 498, 8, 62, 11, 62, 12, 62, 499, 3, 62, 502, 8, 62, 1, 63, 1, 63, 1, 63, 3, 63, 507, 8, 63, 1, 64, 1, 64, 3, 64, 511, 8, 64, 1, 64, 1, 64, 1, 65, 1, 65, 1, 65, 1, 65, 5, 65, 519, 8, 65, 10, 65, 12, 65, 522, 9, 65, 1, 65, 1, 65, 1, 66, 1, 66, 1, 66, 1, 66, 5, 66, 530, 8, 66, 10, 66, 12, 66, 533, 9, 66, 1, 67, 1, 67, 1, 67, 1, 67, 1, 68, 1, 68, 1, 68, 1, 68, 5, 68, 543, 8, 68, 10, 68, 12, 68, 546, 9, 68, 1, 68, 1, 68, 1, 69, 1, 69, 1, 70, 1, 70, 5, 70, 554, 8, 70, 10, 70, 12, 70, 557, 9, 70, 1, 70, 1, 70, 1, 70, 1, 70, 5, 70, 563, 8, 70, 10, 70, 12, 70, 566, 9, 70, 1, 71, 4, 71, 569, 8, 71, 11, 71, 12, 71, 570, 1, 72, 1, 72, 1, 72, 1, 72, 1, 73, 4, 73, 578, 8, 73, 11, 73, 12, 73, 579, 1, 74, 1, 74, 1, 74, 1, 74, 0, 0, 75, 3, 0, 5, 1, 7, 2, 9, 3, 11, 4, 13, 5, 15, 6, 17, 7, 19, 8, 21, 9, 23, 10, 25, 0, 27, 11, 29, 12, 31, 13, 33, 14, 35, 15, 37, 16, 39, 17, 41, 18, 43, 19, 45, 20, 47, 21, 49, 22, 51, 23, 53, 24, 55, 25, 57, 26, 59, 27, 61, 28, 63, 29, 65, 30, 67, 31, 69, 32, 71, 33, 73, 34, 75, 35, 77, 36, 79, 37, 81, 38, 83, 39, 85, 40, 87, 41, 89, 42, 91, 43, 93, 44, 95, 45, 97, 46, 99, 47, 101, 48, 103, 49, 105, 50, 107, 51, 109, 52, 111, 53, 113, 54, 115, 55, 117, 56, 119, 57, 121, 0, 123, 0, 125, 58, 127, 59, 129, 60, 131, 61, 133, 62, 135, 63, 137, 64, 139, 65, 141, 66, 143, 67, 145, 68, 147, 69, 149, 70, 151, 71, 3, 0, 1, 2, 9, 2, 0, 9, 9, 32, 32, 3, 0, 48, 57, 65, 70, 97, 102, 4, 0, 48, 57, 65, 90, 95, 95, 97, 122, 649, 0, 65, 90, 95, 95, 97, 122, 170, 170, 181, 181, 186, 186, 192, 214, 216, 246, 248, 705, 710, 721, 736, 740, 748, 748, 750, 750, 880, 884, 886, 887, 890, 893, 895, 895, 902, 902, 904, 906, 908, 908, 910, 929, 931, 1013, 1015, 1153, 1162, 1327, 1329, 1366, 1369, 1369, 1376, 1416, 1488, 1514, 1519, 1522, 1568, 1610, 1646, 1647, 1649, 1747, 1749, 1749, 1765, 1766, 1774, 1775, 1786, 1788, 1791, 1791, 1808, 1808, 1810, 1839, 1869, 1957, 1969, 1969, 1994, 2026, 2036, 2037, 2042, 2042, 2048, 2069, 2074, 2074, 2084, 2084, 2088, 2088, 2112, 2136, 2144, 2154, 2160, 2183, 2185, 2190, 2208, 2249, 2308, 2361, 2365, 2365, 2384, 2384, 2392, 2401, 2417, 2432, 2437, 2444, 2447, 2448, 2451, 2472, 2474, 2480, 2482, 2482, 2486, 2489, 2493, 2493, 2510, 2510, 2524, 2525, 2527, 2529, 2544, 2545, 2556, 2556, 2565, 2570, 2575, 2576, 2579, 2600, 2602, 2608, 2610, 2611, 2613, 2614, 2616, 2617, 2649, 2652, 2654, 2654, 2674, 2676, 2693, 2701, 2703, 2705, 2707, 2728, 2730, 2736, 2738, 2739, 2741, 2745, 2749, 2749, 2768, 2768, 2784, 2785, 2809, 2809, 2821, 2828, 2831, 2832, 2835, 2856, 2858, 2864, 2866, 2867, 2869, 2873, 2877, 2877, 2908, 2909, 2911, 2913, 2929, 2929, 2947, 2947, 2949, 2954, 2958, 2960, 2962, 2965, 2969, 2970, 2972, 2972, 2974, 2975, 2979, 2980, 2984, 2986, 2990, 3001, 3024, 3024, 3077, 3084, 3086, 3088, 3090, 3112, 3114, 3129, 3133, 3133, 3160, 3162, 3165, 3165, 3168, 3169, 3200, 3200, 3205, 3212, 3214, 3216, 3218, 3240, 3242, 3251, 3253, 3257, 3261, 3261, 3293, 3294, 3296, 3297, 3313, 3314, 3332, 3340, 3342, 3344, 3346, 3386, 3389, 3389, 3406, 3406, 3412, 3414, 3423, 3425, 3450, 3455, 3461, 3478, 3482, 3505, 3507, 3515, 3517, 3517, 3520, 3526, 3585, 3632, 3634, 3635, 3648, 3654, 3713, 3714, 3716, 3716, 3718, 3722, 3724, 3747, 3749, 3749, 3751, 3760, 3762, 3763, 3773, 3773, 3776, 3780, 3782, 3782, 3804, 3807, 3840, 3840, 3904, 3911, 3913, 3948, 3976, 3980, 4096, 4138, 4159, 4159, 4176, 4181, 4186, 4189, 4193, 4193, 4197, 4198, 4206, 4208, 4213, 4225, 4238, 4238, 4256, 4293, 4295, 4295, 4301, 4301, 4304, 4346, 4348, 4680, 4682, 4685, 4688, 4694, 4696, 4696, 4698, 4701, 4704, 4744, 4746, 4749, 4752, 4784, 4786, 4789, 4792, 4798, 4800, 4800, 4802, 4805, 4808, 4822, 4824, 4880, 4882, 4885, 4888, 4954, 4992, 5007, 5024, 5109, 5112, 5117, 5121, 5740, 5743, 5759, 5761, 5786, 5792, 5866, 5873, 5880, 5888, 5905, 5919, 5937, 5952, 5969, 5984, 5996, 5998, 6e3, 6016, 6067, 6103, 6103, 6108, 6108, 6176, 6264, 6272, 6276, 6279, 6312, 6314, 6314, 6320, 6389, 6400, 6430, 6480, 6509, 6512, 6516, 6528, 6571, 6576, 6601, 6656, 6678, 6688, 6740, 6823, 6823, 6917, 6963, 6981, 6988, 7043, 7072, 7086, 7087, 7098, 7141, 7168, 7203, 7245, 7247, 7258, 7293, 7296, 7304, 7312, 7354, 7357, 7359, 7401, 7404, 7406, 7411, 7413, 7414, 7418, 7418, 7424, 7615, 7680, 7957, 7960, 7965, 7968, 8005, 8008, 8013, 8016, 8023, 8025, 8025, 8027, 8027, 8029, 8029, 8031, 8061, 8064, 8116, 8118, 8124, 8126, 8126, 8130, 8132, 8134, 8140, 8144, 8147, 8150, 8155, 8160, 8172, 8178, 8180, 8182, 8188, 8305, 8305, 8319, 8319, 8336, 8348, 8450, 8450, 8455, 8455, 8458, 8467, 8469, 8469, 8473, 8477, 8484, 8484, 8486, 8486, 8488, 8488, 8490, 8493, 8495, 8505, 8508, 8511, 8517, 8521, 8526, 8526, 8579, 8580, 11264, 11492, 11499, 11502, 11506, 11507, 11520, 11557, 11559, 11559, 11565, 11565, 11568, 11623, 11631, 11631, 11648, 11670, 11680, 11686, 11688, 11694, 11696, 11702, 11704, 11710, 11712, 11718, 11720, 11726, 11728, 11734, 11736, 11742, 11823, 11823, 12293, 12294, 12337, 12341, 12347, 12348, 12353, 12438, 12445, 12447, 12449, 12538, 12540, 12543, 12549, 12591, 12593, 12686, 12704, 12735, 12784, 12799, 13312, 19903, 19968, 42124, 42192, 42237, 42240, 42508, 42512, 42527, 42538, 42539, 42560, 42606, 42623, 42653, 42656, 42725, 42775, 42783, 42786, 42888, 42891, 42954, 42960, 42961, 42963, 42963, 42965, 42969, 42994, 43009, 43011, 43013, 43015, 43018, 43020, 43042, 43072, 43123, 43138, 43187, 43250, 43255, 43259, 43259, 43261, 43262, 43274, 43301, 43312, 43334, 43360, 43388, 43396, 43442, 43471, 43471, 43488, 43492, 43494, 43503, 43514, 43518, 43520, 43560, 43584, 43586, 43588, 43595, 43616, 43638, 43642, 43642, 43646, 43695, 43697, 43697, 43701, 43702, 43705, 43709, 43712, 43712, 43714, 43714, 43739, 43741, 43744, 43754, 43762, 43764, 43777, 43782, 43785, 43790, 43793, 43798, 43808, 43814, 43816, 43822, 43824, 43866, 43868, 43881, 43888, 44002, 44032, 55203, 55216, 55238, 55243, 55291, 63744, 64109, 64112, 64217, 64256, 64262, 64275, 64279, 64285, 64285, 64287, 64296, 64298, 64310, 64312, 64316, 64318, 64318, 64320, 64321, 64323, 64324, 64326, 64433, 64467, 64829, 64848, 64911, 64914, 64967, 65008, 65019, 65136, 65140, 65142, 65276, 65313, 65338, 65345, 65370, 65382, 65470, 65474, 65479, 65482, 65487, 65490, 65495, 65498, 65500, 65536, 65547, 65549, 65574, 65576, 65594, 65596, 65597, 65599, 65613, 65616, 65629, 65664, 65786, 66176, 66204, 66208, 66256, 66304, 66335, 66349, 66368, 66370, 66377, 66384, 66421, 66432, 66461, 66464, 66499, 66504, 66511, 66560, 66717, 66736, 66771, 66776, 66811, 66816, 66855, 66864, 66915, 66928, 66938, 66940, 66954, 66956, 66962, 66964, 66965, 66967, 66977, 66979, 66993, 66995, 67001, 67003, 67004, 67072, 67382, 67392, 67413, 67424, 67431, 67456, 67461, 67463, 67504, 67506, 67514, 67584, 67589, 67592, 67592, 67594, 67637, 67639, 67640, 67644, 67644, 67647, 67669, 67680, 67702, 67712, 67742, 67808, 67826, 67828, 67829, 67840, 67861, 67872, 67897, 67968, 68023, 68030, 68031, 68096, 68096, 68112, 68115, 68117, 68119, 68121, 68149, 68192, 68220, 68224, 68252, 68288, 68295, 68297, 68324, 68352, 68405, 68416, 68437, 68448, 68466, 68480, 68497, 68608, 68680, 68736, 68786, 68800, 68850, 68864, 68899, 69248, 69289, 69296, 69297, 69376, 69404, 69415, 69415, 69424, 69445, 69488, 69505, 69552, 69572, 69600, 69622, 69635, 69687, 69745, 69746, 69749, 69749, 69763, 69807, 69840, 69864, 69891, 69926, 69956, 69956, 69959, 69959, 69968, 70002, 70006, 70006, 70019, 70066, 70081, 70084, 70106, 70106, 70108, 70108, 70144, 70161, 70163, 70187, 70272, 70278, 70280, 70280, 70282, 70285, 70287, 70301, 70303, 70312, 70320, 70366, 70405, 70412, 70415, 70416, 70419, 70440, 70442, 70448, 70450, 70451, 70453, 70457, 70461, 70461, 70480, 70480, 70493, 70497, 70656, 70708, 70727, 70730, 70751, 70753, 70784, 70831, 70852, 70853, 70855, 70855, 71040, 71086, 71128, 71131, 71168, 71215, 71236, 71236, 71296, 71338, 71352, 71352, 71424, 71450, 71488, 71494, 71680, 71723, 71840, 71903, 71935, 71942, 71945, 71945, 71948, 71955, 71957, 71958, 71960, 71983, 71999, 71999, 72001, 72001, 72096, 72103, 72106, 72144, 72161, 72161, 72163, 72163, 72192, 72192, 72203, 72242, 72250, 72250, 72272, 72272, 72284, 72329, 72349, 72349, 72368, 72440, 72704, 72712, 72714, 72750, 72768, 72768, 72818, 72847, 72960, 72966, 72968, 72969, 72971, 73008, 73030, 73030, 73056, 73061, 73063, 73064, 73066, 73097, 73112, 73112, 73440, 73458, 73648, 73648, 73728, 74649, 74880, 75075, 77712, 77808, 77824, 78894, 82944, 83526, 92160, 92728, 92736, 92766, 92784, 92862, 92880, 92909, 92928, 92975, 92992, 92995, 93027, 93047, 93053, 93071, 93760, 93823, 93952, 94026, 94032, 94032, 94099, 94111, 94176, 94177, 94179, 94179, 94208, 100343, 100352, 101589, 101632, 101640, 110576, 110579, 110581, 110587, 110589, 110590, 110592, 110882, 110928, 110930, 110948, 110951, 110960, 111355, 113664, 113770, 113776, 113788, 113792, 113800, 113808, 113817, 119808, 119892, 119894, 119964, 119966, 119967, 119970, 119970, 119973, 119974, 119977, 119980, 119982, 119993, 119995, 119995, 119997, 120003, 120005, 120069, 120071, 120074, 120077, 120084, 120086, 120092, 120094, 120121, 120123, 120126, 120128, 120132, 120134, 120134, 120138, 120144, 120146, 120485, 120488, 120512, 120514, 120538, 120540, 120570, 120572, 120596, 120598, 120628, 120630, 120654, 120656, 120686, 120688, 120712, 120714, 120744, 120746, 120770, 120772, 120779, 122624, 122654, 123136, 123180, 123191, 123197, 123214, 123214, 123536, 123565, 123584, 123627, 124896, 124902, 124904, 124907, 124909, 124910, 124912, 124926, 124928, 125124, 125184, 125251, 125259, 125259, 126464, 126467, 126469, 126495, 126497, 126498, 126500, 126500, 126503, 126503, 126505, 126514, 126516, 126519, 126521, 126521, 126523, 126523, 126530, 126530, 126535, 126535, 126537, 126537, 126539, 126539, 126541, 126543, 126545, 126546, 126548, 126548, 126551, 126551, 126553, 126553, 126555, 126555, 126557, 126557, 126559, 126559, 126561, 126562, 126564, 126564, 126567, 126570, 126572, 126578, 126580, 126583, 126585, 126588, 126590, 126590, 126592, 126601, 126603, 126619, 126625, 126627, 126629, 126633, 126635, 126651, 131072, 173791, 173824, 177976, 177984, 178205, 178208, 183969, 183984, 191456, 194560, 195101, 196608, 201546, 693, 0, 48, 57, 65, 90, 95, 95, 97, 122, 170, 170, 181, 181, 186, 186, 192, 214, 216, 246, 248, 705, 710, 721, 736, 740, 748, 748, 750, 750, 880, 884, 886, 887, 890, 893, 895, 895, 902, 902, 904, 906, 908, 908, 910, 929, 931, 1013, 1015, 1153, 1162, 1327, 1329, 1366, 1369, 1369, 1376, 1416, 1488, 1514, 1519, 1522, 1568, 1610, 1632, 1641, 1646, 1647, 1649, 1747, 1749, 1749, 1765, 1766, 1774, 1788, 1791, 1791, 1808, 1808, 1810, 1839, 1869, 1957, 1969, 1969, 1984, 2026, 2036, 2037, 2042, 2042, 2048, 2069, 2074, 2074, 2084, 2084, 2088, 2088, 2112, 2136, 2144, 2154, 2160, 2183, 2185, 2190, 2208, 2249, 2308, 2361, 2365, 2365, 2384, 2384, 2392, 2401, 2406, 2415, 2417, 2432, 2437, 2444, 2447, 2448, 2451, 2472, 2474, 2480, 2482, 2482, 2486, 2489, 2493, 2493, 2510, 2510, 2524, 2525, 2527, 2529, 2534, 2545, 2556, 2556, 2565, 2570, 2575, 2576, 2579, 2600, 2602, 2608, 2610, 2611, 2613, 2614, 2616, 2617, 2649, 2652, 2654, 2654, 2662, 2671, 2674, 2676, 2693, 2701, 2703, 2705, 2707, 2728, 2730, 2736, 2738, 2739, 2741, 2745, 2749, 2749, 2768, 2768, 2784, 2785, 2790, 2799, 2809, 2809, 2821, 2828, 2831, 2832, 2835, 2856, 2858, 2864, 2866, 2867, 2869, 2873, 2877, 2877, 2908, 2909, 2911, 2913, 2918, 2927, 2929, 2929, 2947, 2947, 2949, 2954, 2958, 2960, 2962, 2965, 2969, 2970, 2972, 2972, 2974, 2975, 2979, 2980, 2984, 2986, 2990, 3001, 3024, 3024, 3046, 3055, 3077, 3084, 3086, 3088, 3090, 3112, 3114, 3129, 3133, 3133, 3160, 3162, 3165, 3165, 3168, 3169, 3174, 3183, 3200, 3200, 3205, 3212, 3214, 3216, 3218, 3240, 3242, 3251, 3253, 3257, 3261, 3261, 3293, 3294, 3296, 3297, 3302, 3311, 3313, 3314, 3332, 3340, 3342, 3344, 3346, 3386, 3389, 3389, 3406, 3406, 3412, 3414, 3423, 3425, 3430, 3439, 3450, 3455, 3461, 3478, 3482, 3505, 3507, 3515, 3517, 3517, 3520, 3526, 3558, 3567, 3585, 3632, 3634, 3635, 3648, 3654, 3664, 3673, 3713, 3714, 3716, 3716, 3718, 3722, 3724, 3747, 3749, 3749, 3751, 3760, 3762, 3763, 3773, 3773, 3776, 3780, 3782, 3782, 3792, 3801, 3804, 3807, 3840, 3840, 3872, 3881, 3904, 3911, 3913, 3948, 3976, 3980, 4096, 4138, 4159, 4169, 4176, 4181, 4186, 4189, 4193, 4193, 4197, 4198, 4206, 4208, 4213, 4225, 4238, 4238, 4240, 4249, 4256, 4293, 4295, 4295, 4301, 4301, 4304, 4346, 4348, 4680, 4682, 4685, 4688, 4694, 4696, 4696, 4698, 4701, 4704, 4744, 4746, 4749, 4752, 4784, 4786, 4789, 4792, 4798, 4800, 4800, 4802, 4805, 4808, 4822, 4824, 4880, 4882, 4885, 4888, 4954, 4992, 5007, 5024, 5109, 5112, 5117, 5121, 5740, 5743, 5759, 5761, 5786, 5792, 5866, 5873, 5880, 5888, 5905, 5919, 5937, 5952, 5969, 5984, 5996, 5998, 6e3, 6016, 6067, 6103, 6103, 6108, 6108, 6112, 6121, 6160, 6169, 6176, 6264, 6272, 6276, 6279, 6312, 6314, 6314, 6320, 6389, 6400, 6430, 6470, 6509, 6512, 6516, 6528, 6571, 6576, 6601, 6608, 6617, 6656, 6678, 6688, 6740, 6784, 6793, 6800, 6809, 6823, 6823, 6917, 6963, 6981, 6988, 6992, 7001, 7043, 7072, 7086, 7141, 7168, 7203, 7232, 7241, 7245, 7293, 7296, 7304, 7312, 7354, 7357, 7359, 7401, 7404, 7406, 7411, 7413, 7414, 7418, 7418, 7424, 7615, 7680, 7957, 7960, 7965, 7968, 8005, 8008, 8013, 8016, 8023, 8025, 8025, 8027, 8027, 8029, 8029, 8031, 8061, 8064, 8116, 8118, 8124, 8126, 8126, 8130, 8132, 8134, 8140, 8144, 8147, 8150, 8155, 8160, 8172, 8178, 8180, 8182, 8188, 8305, 8305, 8319, 8319, 8336, 8348, 8450, 8450, 8455, 8455, 8458, 8467, 8469, 8469, 8473, 8477, 8484, 8484, 8486, 8486, 8488, 8488, 8490, 8493, 8495, 8505, 8508, 8511, 8517, 8521, 8526, 8526, 8579, 8580, 11264, 11492, 11499, 11502, 11506, 11507, 11520, 11557, 11559, 11559, 11565, 11565, 11568, 11623, 11631, 11631, 11648, 11670, 11680, 11686, 11688, 11694, 11696, 11702, 11704, 11710, 11712, 11718, 11720, 11726, 11728, 11734, 11736, 11742, 11823, 11823, 12293, 12294, 12337, 12341, 12347, 12348, 12353, 12438, 12445, 12447, 12449, 12538, 12540, 12543, 12549, 12591, 12593, 12686, 12704, 12735, 12784, 12799, 13312, 19903, 19968, 42124, 42192, 42237, 42240, 42508, 42512, 42539, 42560, 42606, 42623, 42653, 42656, 42725, 42775, 42783, 42786, 42888, 42891, 42954, 42960, 42961, 42963, 42963, 42965, 42969, 42994, 43009, 43011, 43013, 43015, 43018, 43020, 43042, 43072, 43123, 43138, 43187, 43216, 43225, 43250, 43255, 43259, 43259, 43261, 43262, 43264, 43301, 43312, 43334, 43360, 43388, 43396, 43442, 43471, 43481, 43488, 43492, 43494, 43518, 43520, 43560, 43584, 43586, 43588, 43595, 43600, 43609, 43616, 43638, 43642, 43642, 43646, 43695, 43697, 43697, 43701, 43702, 43705, 43709, 43712, 43712, 43714, 43714, 43739, 43741, 43744, 43754, 43762, 43764, 43777, 43782, 43785, 43790, 43793, 43798, 43808, 43814, 43816, 43822, 43824, 43866, 43868, 43881, 43888, 44002, 44016, 44025, 44032, 55203, 55216, 55238, 55243, 55291, 63744, 64109, 64112, 64217, 64256, 64262, 64275, 64279, 64285, 64285, 64287, 64296, 64298, 64310, 64312, 64316, 64318, 64318, 64320, 64321, 64323, 64324, 64326, 64433, 64467, 64829, 64848, 64911, 64914, 64967, 65008, 65019, 65136, 65140, 65142, 65276, 65296, 65305, 65313, 65338, 65345, 65370, 65382, 65470, 65474, 65479, 65482, 65487, 65490, 65495, 65498, 65500, 65536, 65547, 65549, 65574, 65576, 65594, 65596, 65597, 65599, 65613, 65616, 65629, 65664, 65786, 66176, 66204, 66208, 66256, 66304, 66335, 66349, 66368, 66370, 66377, 66384, 66421, 66432, 66461, 66464, 66499, 66504, 66511, 66560, 66717, 66720, 66729, 66736, 66771, 66776, 66811, 66816, 66855, 66864, 66915, 66928, 66938, 66940, 66954, 66956, 66962, 66964, 66965, 66967, 66977, 66979, 66993, 66995, 67001, 67003, 67004, 67072, 67382, 67392, 67413, 67424, 67431, 67456, 67461, 67463, 67504, 67506, 67514, 67584, 67589, 67592, 67592, 67594, 67637, 67639, 67640, 67644, 67644, 67647, 67669, 67680, 67702, 67712, 67742, 67808, 67826, 67828, 67829, 67840, 67861, 67872, 67897, 67968, 68023, 68030, 68031, 68096, 68096, 68112, 68115, 68117, 68119, 68121, 68149, 68192, 68220, 68224, 68252, 68288, 68295, 68297, 68324, 68352, 68405, 68416, 68437, 68448, 68466, 68480, 68497, 68608, 68680, 68736, 68786, 68800, 68850, 68864, 68899, 68912, 68921, 69248, 69289, 69296, 69297, 69376, 69404, 69415, 69415, 69424, 69445, 69488, 69505, 69552, 69572, 69600, 69622, 69635, 69687, 69734, 69743, 69745, 69746, 69749, 69749, 69763, 69807, 69840, 69864, 69872, 69881, 69891, 69926, 69942, 69951, 69956, 69956, 69959, 69959, 69968, 70002, 70006, 70006, 70019, 70066, 70081, 70084, 70096, 70106, 70108, 70108, 70144, 70161, 70163, 70187, 70272, 70278, 70280, 70280, 70282, 70285, 70287, 70301, 70303, 70312, 70320, 70366, 70384, 70393, 70405, 70412, 70415, 70416, 70419, 70440, 70442, 70448, 70450, 70451, 70453, 70457, 70461, 70461, 70480, 70480, 70493, 70497, 70656, 70708, 70727, 70730, 70736, 70745, 70751, 70753, 70784, 70831, 70852, 70853, 70855, 70855, 70864, 70873, 71040, 71086, 71128, 71131, 71168, 71215, 71236, 71236, 71248, 71257, 71296, 71338, 71352, 71352, 71360, 71369, 71424, 71450, 71472, 71481, 71488, 71494, 71680, 71723, 71840, 71913, 71935, 71942, 71945, 71945, 71948, 71955, 71957, 71958, 71960, 71983, 71999, 71999, 72001, 72001, 72016, 72025, 72096, 72103, 72106, 72144, 72161, 72161, 72163, 72163, 72192, 72192, 72203, 72242, 72250, 72250, 72272, 72272, 72284, 72329, 72349, 72349, 72368, 72440, 72704, 72712, 72714, 72750, 72768, 72768, 72784, 72793, 72818, 72847, 72960, 72966, 72968, 72969, 72971, 73008, 73030, 73030, 73040, 73049, 73056, 73061, 73063, 73064, 73066, 73097, 73112, 73112, 73120, 73129, 73440, 73458, 73648, 73648, 73728, 74649, 74880, 75075, 77712, 77808, 77824, 78894, 82944, 83526, 92160, 92728, 92736, 92766, 92768, 92777, 92784, 92862, 92864, 92873, 92880, 92909, 92928, 92975, 92992, 92995, 93008, 93017, 93027, 93047, 93053, 93071, 93760, 93823, 93952, 94026, 94032, 94032, 94099, 94111, 94176, 94177, 94179, 94179, 94208, 100343, 100352, 101589, 101632, 101640, 110576, 110579, 110581, 110587, 110589, 110590, 110592, 110882, 110928, 110930, 110948, 110951, 110960, 111355, 113664, 113770, 113776, 113788, 113792, 113800, 113808, 113817, 119808, 119892, 119894, 119964, 119966, 119967, 119970, 119970, 119973, 119974, 119977, 119980, 119982, 119993, 119995, 119995, 119997, 120003, 120005, 120069, 120071, 120074, 120077, 120084, 120086, 120092, 120094, 120121, 120123, 120126, 120128, 120132, 120134, 120134, 120138, 120144, 120146, 120485, 120488, 120512, 120514, 120538, 120540, 120570, 120572, 120596, 120598, 120628, 120630, 120654, 120656, 120686, 120688, 120712, 120714, 120744, 120746, 120770, 120772, 120779, 120782, 120831, 122624, 122654, 123136, 123180, 123191, 123197, 123200, 123209, 123214, 123214, 123536, 123565, 123584, 123627, 123632, 123641, 124896, 124902, 124904, 124907, 124909, 124910, 124912, 124926, 124928, 125124, 125184, 125251, 125259, 125259, 125264, 125273, 126464, 126467, 126469, 126495, 126497, 126498, 126500, 126500, 126503, 126503, 126505, 126514, 126516, 126519, 126521, 126521, 126523, 126523, 126530, 126530, 126535, 126535, 126537, 126537, 126539, 126539, 126541, 126543, 126545, 126546, 126548, 126548, 126551, 126551, 126553, 126553, 126555, 126555, 126557, 126557, 126559, 126559, 126561, 126562, 126564, 126564, 126567, 126570, 126572, 126578, 126580, 126583, 126585, 126588, 126590, 126590, 126592, 126601, 126603, 126619, 126625, 126627, 126629, 126633, 126635, 126651, 130032, 130041, 131072, 173791, 173824, 177976, 177984, 178205, 178208, 183969, 183984, 191456, 194560, 195101, 196608, 201546, 2, 0, 65, 90, 97, 122, 1, 0, 48, 57, 3, 0, 10, 10, 13, 13, 34, 34, 2, 0, 10, 10, 13, 13, 609, 0, 5, 1, 0, 0, 0, 0, 7, 1, 0, 0, 0, 0, 9, 1, 0, 0, 0, 0, 11, 1, 0, 0, 0, 0, 13, 1, 0, 0, 0, 0, 15, 1, 0, 0, 0, 0, 17, 1, 0, 0, 0, 0, 19, 1, 0, 0, 0, 0, 21, 1, 0, 0, 0, 0, 23, 1, 0, 0, 0, 0, 27, 1, 0, 0, 0, 0, 29, 1, 0, 0, 0, 0, 31, 1, 0, 0, 0, 0, 33, 1, 0, 0, 0, 0, 35, 1, 0, 0, 0, 0, 37, 1, 0, 0, 0, 0, 39, 1, 0, 0, 0, 0, 41, 1, 0, 0, 0, 0, 43, 1, 0, 0, 0, 0, 45, 1, 0, 0, 0, 0, 47, 1, 0, 0, 0, 0, 49, 1, 0, 0, 0, 0, 51, 1, 0, 0, 0, 0, 53, 1, 0, 0, 0, 0, 55, 1, 0, 0, 0, 0, 57, 1, 0, 0, 0, 0, 59, 1, 0, 0, 0, 0, 61, 1, 0, 0, 0, 0, 63, 1, 0, 0, 0, 0, 65, 1, 0, 0, 0, 0, 67, 1, 0, 0, 0, 0, 69, 1, 0, 0, 0, 0, 71, 1, 0, 0, 0, 0, 73, 1, 0, 0, 0, 0, 75, 1, 0, 0, 0, 0, 77, 1, 0, 0, 0, 0, 79, 1, 0, 0, 0, 0, 81, 1, 0, 0, 0, 0, 83, 1, 0, 0, 0, 0, 85, 1, 0, 0, 0, 0, 87, 1, 0, 0, 0, 0, 89, 1, 0, 0, 0, 0, 91, 1, 0, 0, 0, 0, 93, 1, 0, 0, 0, 0, 95, 1, 0, 0, 0, 0, 97, 1, 0, 0, 0, 0, 99, 1, 0, 0, 0, 0, 101, 1, 0, 0, 0, 0, 103, 1, 0, 0, 0, 0, 105, 1, 0, 0, 0, 0, 107, 1, 0, 0, 0, 0, 109, 1, 0, 0, 0, 0, 111, 1, 0, 0, 0, 0, 113, 1, 0, 0, 0, 0, 115, 1, 0, 0, 0, 0, 117, 1, 0, 0, 0, 0, 119, 1, 0, 0, 0, 0, 125, 1, 0, 0, 0, 0, 127, 1, 0, 0, 0, 0, 129, 1, 0, 0, 0, 0, 131, 1, 0, 0, 0, 0, 133, 1, 0, 0, 0, 0, 135, 1, 0, 0, 0, 0, 137, 1, 0, 0, 0, 0, 139, 1, 0, 0, 0, 0, 141, 1, 0, 0, 0, 0, 143, 1, 0, 0, 0, 1, 145, 1, 0, 0, 0, 1, 147, 1, 0, 0, 0, 2, 149, 1, 0, 0, 0, 2, 151, 1, 0, 0, 0, 3, 153, 1, 0, 0, 0, 5, 156, 1, 0, 0, 0, 7, 162, 1, 0, 0, 0, 9, 170, 1, 0, 0, 0, 11, 181, 1, 0, 0, 0, 13, 190, 1, 0, 0, 0, 15, 198, 1, 0, 0, 0, 17, 206, 1, 0, 0, 0, 19, 210, 1, 0, 0, 0, 21, 213, 1, 0, 0, 0, 23, 216, 1, 0, 0, 0, 25, 219, 1, 0, 0, 0, 27, 221, 1, 0, 0, 0, 29, 227, 1, 0, 0, 0, 31, 230, 1, 0, 0, 0, 33, 233, 1, 0, 0, 0, 35, 236, 1, 0, 0, 0, 37, 239, 1, 0, 0, 0, 39, 241, 1, 0, 0, 0, 41, 243, 1, 0, 0, 0, 43, 246, 1, 0, 0, 0, 45, 249, 1, 0, 0, 0, 47, 251, 1, 0, 0, 0, 49, 253, 1, 0, 0, 0, 51, 255, 1, 0, 0, 0, 53, 257, 1, 0, 0, 0, 55, 259, 1, 0, 0, 0, 57, 261, 1, 0, 0, 0, 59, 263, 1, 0, 0, 0, 61, 265, 1, 0, 0, 0, 63, 267, 1, 0, 0, 0, 65, 269, 1, 0, 0, 0, 67, 271, 1, 0, 0, 0, 69, 273, 1, 0, 0, 0, 71, 275, 1, 0, 0, 0, 73, 277, 1, 0, 0, 0, 75, 282, 1, 0, 0, 0, 77, 295, 1, 0, 0, 0, 79, 297, 1, 0, 0, 0, 81, 300, 1, 0, 0, 0, 83, 331, 1, 0, 0, 0, 85, 333, 1, 0, 0, 0, 87, 340, 1, 0, 0, 0, 89, 344, 1, 0, 0, 0, 91, 348, 1, 0, 0, 0, 93, 354, 1, 0, 0, 0, 95, 358, 1, 0, 0, 0, 97, 379, 1, 0, 0, 0, 99, 381, 1, 0, 0, 0, 101, 385, 1, 0, 0, 0, 103, 388, 1, 0, 0, 0, 105, 392, 1, 0, 0, 0, 107, 398, 1, 0, 0, 0, 109, 406, 1, 0, 0, 0, 111, 425, 1, 0, 0, 0, 113, 453, 1, 0, 0, 0, 115, 455, 1, 0, 0, 0, 117, 462, 1, 0, 0, 0, 119, 464, 1, 0, 0, 0, 121, 472, 1, 0, 0, 0, 123, 476, 1, 0, 0, 0, 125, 479, 1, 0, 0, 0, 127, 501, 1, 0, 0, 0, 129, 503, 1, 0, 0, 0, 131, 510, 1, 0, 0, 0, 133, 514, 1, 0, 0, 0, 135, 525, 1, 0, 0, 0, 137, 534, 1, 0, 0, 0, 139, 538, 1, 0, 0, 0, 141, 549, 1, 0, 0, 0, 143, 551, 1, 0, 0, 0, 145, 568, 1, 0, 0, 0, 147, 572, 1, 0, 0, 0, 149, 577, 1, 0, 0, 0, 151, 581, 1, 0, 0, 0, 153, 154, 7, 0, 0, 0, 154, 4, 1, 0, 0, 0, 155, 157, 3, 3, 0, 0, 156, 155, 1, 0, 0, 0, 157, 158, 1, 0, 0, 0, 158, 156, 1, 0, 0, 0, 158, 159, 1, 0, 0, 0, 159, 160, 1, 0, 0, 0, 160, 161, 6, 1, 0, 0, 161, 6, 1, 0, 0, 0, 162, 163, 5, 99, 0, 0, 163, 164, 5, 111, 0, 0, 164, 165, 5, 110, 0, 0, 165, 166, 5, 115, 0, 0, 166, 167, 5, 116, 0, 0, 167, 168, 1, 0, 0, 0, 168, 169, 6, 2, 1, 0, 169, 8, 1, 0, 0, 0, 170, 171, 5, 114, 0, 0, 171, 172, 5, 101, 0, 0, 172, 173, 5, 97, 0, 0, 173, 174, 5, 100, 0, 0, 174, 175, 5, 111, 0, 0, 175, 176, 5, 110, 0, 0, 176, 177, 5, 108, 0, 0, 177, 178, 5, 121, 0, 0, 178, 179, 1, 0, 0, 0, 179, 180, 6, 3, 1, 0, 180, 10, 1, 0, 0, 0, 181, 182, 5, 115, 0, 0, 182, 183, 5, 116, 0, 0, 183, 184, 5, 97, 0, 0, 184, 185, 5, 116, 0, 0, 185, 186, 5, 105, 0, 0, 186, 187, 5, 99, 0, 0, 187, 188, 1, 0, 0, 0, 188, 189, 6, 4, 1, 0, 189, 12, 1, 0, 0, 0, 190, 191, 5, 97, 0, 0, 191, 192, 5, 119, 0, 0, 192, 193, 5, 97, 0, 0, 193, 194, 5, 105, 0, 0, 194, 195, 5, 116, 0, 0, 195, 196, 1, 0, 0, 0, 196, 197, 6, 5, 1, 0, 197, 14, 1, 0, 0, 0, 198, 199, 5, 116, 0, 0, 199, 200, 5, 105, 0, 0, 200, 201, 5, 116, 0, 0, 201, 202, 5, 108, 0, 0, 202, 203, 5, 101, 0, 0, 203, 204, 1, 0, 0, 0, 204, 205, 6, 6, 2, 0, 205, 16, 1, 0, 0, 0, 206, 207, 5, 58, 0, 0, 207, 208, 1, 0, 0, 0, 208, 209, 6, 7, 3, 0, 209, 18, 1, 0, 0, 0, 210, 211, 5, 60, 0, 0, 211, 212, 5, 60, 0, 0, 212, 20, 1, 0, 0, 0, 213, 214, 5, 62, 0, 0, 214, 215, 5, 62, 0, 0, 215, 22, 1, 0, 0, 0, 216, 217, 5, 45, 0, 0, 217, 218, 5, 62, 0, 0, 218, 24, 1, 0, 0, 0, 219, 220, 7, 1, 0, 0, 220, 26, 1, 0, 0, 0, 221, 223, 5, 35, 0, 0, 222, 224, 3, 25, 11, 0, 223, 222, 1, 0, 0, 0, 224, 225, 1, 0, 0, 0, 225, 223, 1, 0, 0, 0, 225, 226, 1, 0, 0, 0, 226, 28, 1, 0, 0, 0, 227, 228, 5, 124, 0, 0, 228, 229, 5, 124, 0, 0, 229, 30, 1, 0, 0, 0, 230, 231, 5, 38, 0, 0, 231, 232, 5, 38, 0, 0, 232, 32, 1, 0, 0, 0, 233, 234, 5, 61, 0, 0, 234, 235, 5, 61, 0, 0, 235, 34, 1, 0, 0, 0, 236, 237, 5, 33, 0, 0, 237, 238, 5, 61, 0, 0, 238, 36, 1, 0, 0, 0, 239, 240, 5, 62, 0, 0, 240, 38, 1, 0, 0, 0, 241, 242, 5, 60, 0, 0, 242, 40, 1, 0, 0, 0, 243, 244, 5, 62, 0, 0, 244, 245, 5, 61, 0, 0, 245, 42, 1, 0, 0, 0, 246, 247, 5, 60, 0, 0, 247, 248, 5, 61, 0, 0, 248, 44, 1, 0, 0, 0, 249, 250, 5, 43, 0, 0, 250, 46, 1, 0, 0, 0, 251, 252, 5, 45, 0, 0, 252, 48, 1, 0, 0, 0, 253, 254, 5, 42, 0, 0, 254, 50, 1, 0, 0, 0, 255, 256, 5, 47, 0, 0, 256, 52, 1, 0, 0, 0, 257, 258, 5, 37, 0, 0, 258, 54, 1, 0, 0, 0, 259, 260, 5, 94, 0, 0, 260, 56, 1, 0, 0, 0, 261, 262, 5, 33, 0, 0, 262, 58, 1, 0, 0, 0, 263, 264, 5, 59, 0, 0, 264, 60, 1, 0, 0, 0, 265, 266, 5, 44, 0, 0, 266, 62, 1, 0, 0, 0, 267, 268, 5, 61, 0, 0, 268, 64, 1, 0, 0, 0, 269, 270, 5, 40, 0, 0, 270, 66, 1, 0, 0, 0, 271, 272, 5, 41, 0, 0, 272, 68, 1, 0, 0, 0, 273, 274, 5, 123, 0, 0, 274, 70, 1, 0, 0, 0, 275, 276, 5, 125, 0, 0, 276, 72, 1, 0, 0, 0, 277, 278, 5, 116, 0, 0, 278, 279, 5, 114, 0, 0, 279, 280, 5, 117, 0, 0, 280, 281, 5, 101, 0, 0, 281, 74, 1, 0, 0, 0, 282, 283, 5, 102, 0, 0, 283, 284, 5, 97, 0, 0, 284, 285, 5, 108, 0, 0, 285, 286, 5, 115, 0, 0, 286, 287, 5, 101, 0, 0, 287, 76, 1, 0, 0, 0, 288, 289, 5, 110, 0, 0, 289, 290, 5, 105, 0, 0, 290, 296, 5, 108, 0, 0, 291, 292, 5, 110, 0, 0, 292, 293, 5, 117, 0, 0, 293, 294, 5, 108, 0, 0, 294, 296, 5, 108, 0, 0, 295, 288, 1, 0, 0, 0, 295, 291, 1, 0, 0, 0, 296, 78, 1, 0, 0, 0, 297, 298, 5, 105, 0, 0, 298, 299, 5, 102, 0, 0, 299, 80, 1, 0, 0, 0, 300, 301, 5, 101, 0, 0, 301, 302, 5, 108, 0, 0, 302, 303, 5, 115, 0, 0, 303, 304, 5, 101, 0, 0, 304, 82, 1, 0, 0, 0, 305, 306, 5, 119, 0, 0, 306, 307, 5, 104, 0, 0, 307, 308, 5, 105, 0, 0, 308, 309, 5, 108, 0, 0, 309, 332, 5, 101, 0, 0, 310, 311, 5, 102, 0, 0, 311, 312, 5, 111, 0, 0, 312, 332, 5, 114, 0, 0, 313, 314, 5, 102, 0, 0, 314, 315, 5, 111, 0, 0, 315, 316, 5, 114, 0, 0, 316, 317, 5, 101, 0, 0, 317, 318, 5, 97, 0, 0, 318, 319, 5, 99, 0, 0, 319, 332, 5, 104, 0, 0, 320, 321, 5, 102, 0, 0, 321, 322, 5, 111, 0, 0, 322, 323, 5, 114, 0, 0, 323, 324, 5, 69, 0, 0, 324, 325, 5, 97, 0, 0, 325, 326, 5, 99, 0, 0, 326, 332, 5, 104, 0, 0, 327, 328, 5, 108, 0, 0, 328, 329, 5, 111, 0, 0, 329, 330, 5, 111, 0, 0, 330, 332, 5, 112, 0, 0, 331, 305, 1, 0, 0, 0, 331, 310, 1, 0, 0, 0, 331, 313, 1, 0, 0, 0, 331, 320, 1, 0, 0, 0, 331, 327, 1, 0, 0, 0, 332, 84, 1, 0, 0, 0, 333, 334, 5, 114, 0, 0, 334, 335, 5, 101, 0, 0, 335, 336, 5, 116, 0, 0, 336, 337, 5, 117, 0, 0, 337, 338, 5, 114, 0, 0, 338, 339, 5, 110, 0, 0, 339, 86, 1, 0, 0, 0, 340, 341, 5, 110, 0, 0, 341, 342, 5, 101, 0, 0, 342, 343, 5, 119, 0, 0, 343, 88, 1, 0, 0, 0, 344, 345, 5, 112, 0, 0, 345, 346, 5, 97, 0, 0, 346, 347, 5, 114, 0, 0, 347, 90, 1, 0, 0, 0, 348, 349, 5, 103, 0, 0, 349, 350, 5, 114, 0, 0, 350, 351, 5, 111, 0, 0, 351, 352, 5, 117, 0, 0, 352, 353, 5, 112, 0, 0, 353, 92, 1, 0, 0, 0, 354, 355, 5, 111, 0, 0, 355, 356, 5, 112, 0, 0, 356, 357, 5, 116, 0, 0, 357, 94, 1, 0, 0, 0, 358, 359, 5, 99, 0, 0, 359, 360, 5, 114, 0, 0, 360, 361, 5, 105, 0, 0, 361, 362, 5, 116, 0, 0, 362, 363, 5, 105, 0, 0, 363, 364, 5, 99, 0, 0, 364, 365, 5, 97, 0, 0, 365, 366, 5, 108, 0, 0, 366, 96, 1, 0, 0, 0, 367, 368, 5, 115, 0, 0, 368, 369, 5, 101, 0, 0, 369, 370, 5, 99, 0, 0, 370, 371, 5, 116, 0, 0, 371, 372, 5, 105, 0, 0, 372, 373, 5, 111, 0, 0, 373, 380, 5, 110, 0, 0, 374, 375, 5, 102, 0, 0, 375, 376, 5, 114, 0, 0, 376, 377, 5, 97, 0, 0, 377, 378, 5, 109, 0, 0, 378, 380, 5, 101, 0, 0, 379, 367, 1, 0, 0, 0, 379, 374, 1, 0, 0, 0, 380, 98, 1, 0, 0, 0, 381, 382, 5, 114, 0, 0, 382, 383, 5, 101, 0, 0, 383, 384, 5, 102, 0, 0, 384, 100, 1, 0, 0, 0, 385, 386, 5, 97, 0, 0, 386, 387, 5, 115, 0, 0, 387, 102, 1, 0, 0, 0, 388, 389, 5, 116, 0, 0, 389, 390, 5, 114, 0, 0, 390, 391, 5, 121, 0, 0, 391, 104, 1, 0, 0, 0, 392, 393, 5, 99, 0, 0, 393, 394, 5, 97, 0, 0, 394, 395, 5, 116, 0, 0, 395, 396, 5, 99, 0, 0, 396, 397, 5, 104, 0, 0, 397, 106, 1, 0, 0, 0, 398, 399, 5, 102, 0, 0, 399, 400, 5, 105, 0, 0, 400, 401, 5, 110, 0, 0, 401, 402, 5, 97, 0, 0, 402, 403, 5, 108, 0, 0, 403, 404, 5, 108, 0, 0, 404, 405, 5, 121, 0, 0, 405, 108, 1, 0, 0, 0, 406, 407, 5, 105, 0, 0, 407, 408, 5, 110, 0, 0, 408, 110, 1, 0, 0, 0, 409, 410, 5, 64, 0, 0, 410, 411, 5, 83, 0, 0, 411, 412, 5, 116, 0, 0, 412, 413, 5, 97, 0, 0, 413, 414, 5, 114, 0, 0, 414, 415, 5, 116, 0, 0, 415, 416, 5, 101, 0, 0, 416, 426, 5, 114, 0, 0, 417, 418, 5, 64, 0, 0, 418, 419, 5, 115, 0, 0, 419, 420, 5, 116, 0, 0, 420, 421, 5, 97, 0, 0, 421, 422, 5, 114, 0, 0, 422, 423, 5, 116, 0, 0, 423, 424, 5, 101, 0, 0, 424, 426, 5, 114, 0, 0, 425, 409, 1, 0, 0, 0, 425, 417, 1, 0, 0, 0, 426, 112, 1, 0, 0, 0, 427, 428, 5, 64, 0, 0, 428, 429, 5, 82, 0, 0, 429, 430, 5, 101, 0, 0, 430, 431, 5, 116, 0, 0, 431, 432, 5, 117, 0, 0, 432, 433, 5, 114, 0, 0, 433, 454, 5, 110, 0, 0, 434, 435, 5, 64, 0, 0, 435, 436, 5, 114, 0, 0, 436, 437, 5, 101, 0, 0, 437, 438, 5, 116, 0, 0, 438, 439, 5, 117, 0, 0, 439, 440, 5, 114, 0, 0, 440, 454, 5, 110, 0, 0, 441, 442, 5, 64, 0, 0, 442, 443, 5, 82, 0, 0, 443, 444, 5, 101, 0, 0, 444, 445, 5, 112, 0, 0, 445, 446, 5, 108, 0, 0, 446, 454, 5, 121, 0, 0, 447, 448, 5, 64, 0, 0, 448, 449, 5, 114, 0, 0, 449, 450, 5, 101, 0, 0, 450, 451, 5, 112, 0, 0, 451, 452, 5, 108, 0, 0, 452, 454, 5, 121, 0, 0, 453, 427, 1, 0, 0, 0, 453, 434, 1, 0, 0, 0, 453, 441, 1, 0, 0, 0, 453, 447, 1, 0, 0, 0, 454, 114, 1, 0, 0, 0, 455, 459, 5, 64, 0, 0, 456, 458, 7, 2, 0, 0, 457, 456, 1, 0, 0, 0, 458, 461, 1, 0, 0, 0, 459, 457, 1, 0, 0, 0, 459, 460, 1, 0, 0, 0, 460, 116, 1, 0, 0, 0, 461, 459, 1, 0, 0, 0, 462, 463, 5, 46, 0, 0, 463, 118, 1, 0, 0, 0, 464, 468, 7, 3, 0, 0, 465, 467, 7, 4, 0, 0, 466, 465, 1, 0, 0, 0, 467, 470, 1, 0, 0, 0, 468, 466, 1, 0, 0, 0, 468, 469, 1, 0, 0, 0, 469, 120, 1, 0, 0, 0, 470, 468, 1, 0, 0, 0, 471, 473, 7, 5, 0, 0, 472, 471, 1, 0, 0, 0, 473, 474, 1, 0, 0, 0, 474, 472, 1, 0, 0, 0, 474, 475, 1, 0, 0, 0, 475, 122, 1, 0, 0, 0, 476, 477, 7, 6, 0, 0, 477, 124, 1, 0, 0, 0, 478, 480, 3, 123, 60, 0, 479, 478, 1, 0, 0, 0, 480, 481, 1, 0, 0, 0, 481, 479, 1, 0, 0, 0, 481, 482, 1, 0, 0, 0, 482, 126, 1, 0, 0, 0, 483, 485, 3, 123, 60, 0, 484, 483, 1, 0, 0, 0, 485, 486, 1, 0, 0, 0, 486, 484, 1, 0, 0, 0, 486, 487, 1, 0, 0, 0, 487, 488, 1, 0, 0, 0, 488, 492, 5, 46, 0, 0, 489, 491, 3, 123, 60, 0, 490, 489, 1, 0, 0, 0, 491, 494, 1, 0, 0, 0, 492, 490, 1, 0, 0, 0, 492, 493, 1, 0, 0, 0, 493, 502, 1, 0, 0, 0, 494, 492, 1, 0, 0, 0, 495, 497, 5, 46, 0, 0, 496, 498, 3, 123, 60, 0, 497, 496, 1, 0, 0, 0, 498, 499, 1, 0, 0, 0, 499, 497, 1, 0, 0, 0, 499, 500, 1, 0, 0, 0, 500, 502, 1, 0, 0, 0, 501, 484, 1, 0, 0, 0, 501, 495, 1, 0, 0, 0, 502, 128, 1, 0, 0, 0, 503, 506, 5, 36, 0, 0, 504, 507, 3, 125, 61, 0, 505, 507, 3, 127, 62, 0, 506, 504, 1, 0, 0, 0, 506, 505, 1, 0, 0, 0, 507, 130, 1, 0, 0, 0, 508, 511, 3, 125, 61, 0, 509, 511, 3, 127, 62, 0, 510, 508, 1, 0, 0, 0, 510, 509, 1, 0, 0, 0, 511, 512, 1, 0, 0, 0, 512, 513, 3, 121, 59, 0, 513, 132, 1, 0, 0, 0, 514, 520, 5, 34, 0, 0, 515, 516, 5, 34, 0, 0, 516, 519, 5, 34, 0, 0, 517, 519, 8, 7, 0, 0, 518, 515, 1, 0, 0, 0, 518, 517, 1, 0, 0, 0, 519, 522, 1, 0, 0, 0, 520, 518, 1, 0, 0, 0, 520, 521, 1, 0, 0, 0, 521, 523, 1, 0, 0, 0, 522, 520, 1, 0, 0, 0, 523, 524, 5, 34, 0, 0, 524, 134, 1, 0, 0, 0, 525, 531, 5, 34, 0, 0, 526, 527, 5, 34, 0, 0, 527, 530, 5, 34, 0, 0, 528, 530, 8, 7, 0, 0, 529, 526, 1, 0, 0, 0, 529, 528, 1, 0, 0, 0, 530, 533, 1, 0, 0, 0, 531, 529, 1, 0, 0, 0, 531, 532, 1, 0, 0, 0, 532, 136, 1, 0, 0, 0, 533, 531, 1, 0, 0, 0, 534, 535, 7, 8, 0, 0, 535, 536, 1, 0, 0, 0, 536, 537, 6, 67, 0, 0, 537, 138, 1, 0, 0, 0, 538, 539, 5, 47, 0, 0, 539, 540, 5, 47, 0, 0, 540, 544, 1, 0, 0, 0, 541, 543, 8, 8, 0, 0, 542, 541, 1, 0, 0, 0, 543, 546, 1, 0, 0, 0, 544, 542, 1, 0, 0, 0, 544, 545, 1, 0, 0, 0, 545, 547, 1, 0, 0, 0, 546, 544, 1, 0, 0, 0, 547, 548, 6, 68, 4, 0, 548, 140, 1, 0, 0, 0, 549, 550, 9, 0, 0, 0, 550, 142, 1, 0, 0, 0, 551, 555, 4, 70, 0, 0, 552, 554, 3, 3, 0, 0, 553, 552, 1, 0, 0, 0, 554, 557, 1, 0, 0, 0, 555, 553, 1, 0, 0, 0, 555, 556, 1, 0, 0, 0, 556, 558, 1, 0, 0, 0, 557, 555, 1, 0, 0, 0, 558, 559, 5, 61, 0, 0, 559, 560, 5, 61, 0, 0, 560, 564, 1, 0, 0, 0, 561, 563, 8, 8, 0, 0, 562, 561, 1, 0, 0, 0, 563, 566, 1, 0, 0, 0, 564, 562, 1, 0, 0, 0, 564, 565, 1, 0, 0, 0, 565, 144, 1, 0, 0, 0, 566, 564, 1, 0, 0, 0, 567, 569, 8, 8, 0, 0, 568, 567, 1, 0, 0, 0, 569, 570, 1, 0, 0, 0, 570, 568, 1, 0, 0, 0, 570, 571, 1, 0, 0, 0, 571, 146, 1, 0, 0, 0, 572, 573, 7, 8, 0, 0, 573, 574, 1, 0, 0, 0, 574, 575, 6, 72, 5, 0, 575, 148, 1, 0, 0, 0, 576, 578, 8, 8, 0, 0, 577, 576, 1, 0, 0, 0, 578, 579, 1, 0, 0, 0, 579, 577, 1, 0, 0, 0, 579, 580, 1, 0, 0, 0, 580, 150, 1, 0, 0, 0, 581, 582, 7, 8, 0, 0, 582, 583, 1, 0, 0, 0, 583, 584, 6, 74, 5, 0, 584, 152, 1, 0, 0, 0, 29, 0, 1, 2, 158, 225, 295, 331, 379, 425, 453, 459, 468, 474, 481, 486, 492, 499, 501, 506, 510, 518, 520, 529, 531, 544, 555, 564, 570, 579, 6, 0, 1, 0, 0, 3, 0, 5, 2, 0, 5, 1, 0, 0, 2, 0, 4, 0, 0 ], Wl = new K.atn.ATNDeserializer().deserialize(rw), aw = Wl.decisionToState.map((n, e) => new K.dfa.DFA(n, e)); class f2 extends K.Lexer { constructor(e) { super(e), this._interp = new K.atn.LexerATNSimulator(this, Wl, aw, new K.PredictionContextCache()); } get atn() { return Wl; } } h2(f2, "grammarFileName", "sequenceLexer.g4"), h2(f2, "channelNames", [ "DEFAULT_TOKEN_CHANNEL", "HIDDEN", "COMMENT_CHANNEL", "MODIFIER_CHANNEL" ]), h2(f2, "modeNames", ["DEFAULT_MODE", "EVENT", "TITLE_MODE"]), h2(f2, "literalNames", [ null, null, "'const'", "'readonly'", "'static'", "'await'", "'title'", "':'", "'<<'", "'>>'", "'->'", null, "'||'", "'&&'", "'=='", "'!='", "'>'", "'<'", "'>='", "'<='", "'+'", "'-'", "'*'", "'/'", "'%'", "'^'", "'!'", "';'", "','", "'='", "'('", "')'", "'{'", "'}'", "'true'", "'false'", null, "'if'", "'else'", null, "'return'", "'new'", "'par'", "'group'", "'opt'", "'critical'", null, "'ref'", "'as'", "'try'", "'catch'", "'finally'", "'in'", null, null, null, "'.'" ]), h2(f2, "symbolicNames", [ null, "WS", "CONSTANT", "READONLY", "STATIC", "AWAIT", "TITLE", "COL", "SOPEN", "SCLOSE", "ARROW", "COLOR", "OR", "AND", "EQ", "NEQ", "GT", "LT", "GTEQ", "LTEQ", "PLUS", "MINUS", "MULT", "DIV", "MOD", "POW", "NOT", "SCOL", "COMMA", "ASSIGN", "OPAR", "CPAR", "OBRACE", "CBRACE", "TRUE", "FALSE", "NIL", "IF", "ELSE", "WHILE", "RETURN", "NEW", "PAR", "GROUP", "OPT", "CRITICAL", "SECTION", "REF", "AS", "TRY", "CATCH", "FINALLY", "IN", "STARTER_LXR", "ANNOTATION_RET", "ANNOTATION", "DOT", "ID", "INT", "FLOAT", "MONEY", "NUMBER_UNIT", "CSTRING", "USTRING", "CR", "COMMENT", "OTHER", "DIVIDER", "EVENT_PAYLOAD_LXR", "EVENT_END", "TITLE_CONTENT", "TITLE_END" ]), h2(f2, "ruleNames", [ "HWS", "WS", "CONSTANT", "READONLY", "STATIC", "AWAIT", "TITLE", "COL", "SOPEN", "SCLOSE", "ARROW", "HEX", "COLOR", "OR", "AND", "EQ", "NEQ", "GT", "LT", "GTEQ", "LTEQ", "PLUS", "MINUS", "MULT", "DIV", "MOD", "POW", "NOT", "SCOL", "COMMA", "ASSIGN", "OPAR", "CPAR", "OBRACE", "CBRACE", "TRUE", "FALSE", "NIL", "IF", "ELSE", "WHILE", "RETURN", "NEW", "PAR", "GROUP", "OPT", "CRITICAL", "SECTION", "REF", "AS", "TRY", "CATCH", "FINALLY", "IN", "STARTER_LXR", "ANNOTATION_RET", "ANNOTATION", "DOT", "ID", "UNIT", "DIGIT", "INT", "FLOAT", "MONEY", "NUMBER_UNIT", "CSTRING", "USTRING", "CR", "COMMENT", "OTHER", "DIVIDER", "EVENT_PAYLOAD_LXR", "EVENT_END", "TITLE_CONTENT", "TITLE_END" ]); f2.EOF = K.Token.EOF; f2.WS = 1; f2.CONSTANT = 2; f2.READONLY = 3; f2.STATIC = 4; f2.AWAIT = 5; f2.TITLE = 6; f2.COL = 7; f2.SOPEN = 8; f2.SCLOSE = 9; f2.ARROW = 10; f2.COLOR = 11; f2.OR = 12; f2.AND = 13; f2.EQ = 14; f2.NEQ = 15; f2.GT = 16; f2.LT = 17; f2.GTEQ = 18; f2.LTEQ = 19; f2.PLUS = 20; f2.MINUS = 21; f2.MULT = 22; f2.DIV = 23; f2.MOD = 24; f2.POW = 25; f2.NOT = 26; f2.SCOL = 27; f2.COMMA = 28; f2.ASSIGN = 29; f2.OPAR = 30; f2.CPAR = 31; f2.OBRACE = 32; f2.CBRACE = 33; f2.TRUE = 34; f2.FALSE = 35; f2.NIL = 36; f2.IF = 37; f2.ELSE = 38; f2.WHILE = 39; f2.RETURN = 40; f2.NEW = 41; f2.PAR = 42; f2.GROUP = 43; f2.OPT = 44; f2.CRITICAL = 45; f2.SECTION = 46; f2.REF = 47; f2.AS = 48; f2.TRY = 49; f2.CATCH = 50; f2.FINALLY = 51; f2.IN = 52; f2.STARTER_LXR = 53; f2.ANNOTATION_RET = 54; f2.ANNOTATION = 55; f2.DOT = 56; f2.ID = 57; f2.INT = 58; f2.FLOAT = 59; f2.MONEY = 60; f2.NUMBER_UNIT = 61; f2.CSTRING = 62; f2.USTRING = 63; f2.CR = 64; f2.COMMENT = 65; f2.OTHER = 66; f2.DIVIDER = 67; f2.EVENT_PAYLOAD_LXR = 68; f2.EVENT_END = 69; f2.TITLE_CONTENT = 70; f2.TITLE_END = 71; f2.COMMENT_CHANNEL = 2; f2.MODIFIER_CHANNEL = 3; f2.EVENT = 1; f2.TITLE_MODE = 2; f2.prototype.sempred = function(n, e, t) { switch (e) { case 70: return this.DIVIDER_sempred(n, t); default: throw "No registered predicate for:" + e; } }; f2.prototype.DIVIDER_sempred = function(n, e) { switch (e) { case 0: return this.column === 0; default: throw "No predicate with index:" + e; } }; class X extends K.tree.ParseTreeListener { // Enter a parse tree produced by sequenceParser#prog. enterProg(e) { } // Exit a parse tree produced by sequenceParser#prog. exitProg(e) { } // Enter a parse tree produced by sequenceParser#title. enterTitle(e) { } // Exit a parse tree produced by sequenceParser#title. exitTitle(e) { } // Enter a parse tree produced by sequenceParser#head. enterHead(e) { } // Exit a parse tree produced by sequenceParser#head. exitHead(e) { } // Enter a parse tree produced by sequenceParser#group. enterGroup(e) { } // Exit a parse tree produced by sequenceParser#group. exitGroup(e) { } // Enter a parse tree produced by sequenceParser#starterExp. enterStarterExp(e) { } // Exit a parse tree produced by sequenceParser#starterExp. exitStarterExp(e) { } // Enter a parse tree produced by sequenceParser#starter. enterStarter(e) { } // Exit a parse tree produced by sequenceParser#starter. exitStarter(e) { } // Enter a parse tree produced by sequenceParser#participant. enterParticipant(e) { } // Exit a parse tree produced by sequenceParser#participant. exitParticipant(e) { } // Enter a parse tree produced by sequenceParser#stereotype. enterStereotype(e) { } // Exit a parse tree produced by sequenceParser#stereotype. exitStereotype(e) { } // Enter a parse tree produced by sequenceParser#label. enterLabel(e) { } // Exit a parse tree produced by sequenceParser#label. exitLabel(e) { } // Enter a parse tree produced by sequenceParser#participantType. enterParticipantType(e) { } // Exit a parse tree produced by sequenceParser#participantType. exitParticipantType(e) { } // Enter a parse tree produced by sequenceParser#name. enterName(e) { } // Exit a parse tree produced by sequenceParser#name. exitName(e) { } // Enter a parse tree produced by sequenceParser#width. enterWidth(e) { } // Exit a parse tree produced by sequenceParser#width. exitWidth(e) { } // Enter a parse tree produced by sequenceParser#block. enterBlock(e) { } // Exit a parse tree produced by sequenceParser#block. exitBlock(e) { } // Enter a parse tree produced by sequenceParser#ret. enterRet(e) { } // Exit a parse tree produced by sequenceParser#ret. exitRet(e) { } // Enter a parse tree produced by sequenceParser#divider. enterDivider(e) { } // Exit a parse tree produced by sequenceParser#divider. exitDivider(e) { } // Enter a parse tree produced by sequenceParser#dividerNote. enterDividerNote(e) { } // Exit a parse tree produced by sequenceParser#dividerNote. exitDividerNote(e) { } // Enter a parse tree produced by sequenceParser#stat. enterStat(e) { } // Exit a parse tree produced by sequenceParser#stat. exitStat(e) { } // Enter a parse tree produced by sequenceParser#par. enterPar(e) { } // Exit a parse tree produced by sequenceParser#par. exitPar(e) { } // Enter a parse tree produced by sequenceParser#opt. enterOpt(e) { } // Exit a parse tree produced by sequenceParser#opt. exitOpt(e) { } // Enter a parse tree produced by sequenceParser#critical. enterCritical(e) { } // Exit a parse tree produced by sequenceParser#critical. exitCritical(e) { } // Enter a parse tree produced by sequenceParser#section. enterSection(e) { } // Exit a parse tree produced by sequenceParser#section. exitSection(e) { } // Enter a parse tree produced by sequenceParser#creation. enterCreation(e) { } // Exit a parse tree produced by sequenceParser#creation. exitCreation(e) { } // Enter a parse tree produced by sequenceParser#ref. enterRef(e) { } // Exit a parse tree produced by sequenceParser#ref. exitRef(e) { } // Enter a parse tree produced by sequenceParser#creationBody. enterCreationBody(e) { } // Exit a parse tree produced by sequenceParser#creationBody. exitCreationBody(e) { } // Enter a parse tree produced by sequenceParser#message. enterMessage(e) { } // Exit a parse tree produced by sequenceParser#message. exitMessage(e) { } // Enter a parse tree produced by sequenceParser#messageBody. enterMessageBody(e) { } // Exit a parse tree produced by sequenceParser#messageBody. exitMessageBody(e) { } // Enter a parse tree produced by sequenceParser#fromTo. enterFromTo(e) { } // Exit a parse tree produced by sequenceParser#fromTo. exitFromTo(e) { } // Enter a parse tree produced by sequenceParser#func. enterFunc(e) { } // Exit a parse tree produced by sequenceParser#func. exitFunc(e) { } // Enter a parse tree produced by sequenceParser#from. enterFrom(e) { } // Exit a parse tree produced by sequenceParser#from. exitFrom(e) { } // Enter a parse tree produced by sequenceParser#to. enterTo(e) { } // Exit a parse tree produced by sequenceParser#to. exitTo(e) { } // Enter a parse tree produced by sequenceParser#signature. enterSignature(e) { } // Exit a parse tree produced by sequenceParser#signature. exitSignature(e) { } // Enter a parse tree produced by sequenceParser#invocation. enterInvocation(e) { } // Exit a parse tree produced by sequenceParser#invocation. exitInvocation(e) { } // Enter a parse tree produced by sequenceParser#assignment. enterAssignment(e) { } // Exit a parse tree produced by sequenceParser#assignment. exitAssignment(e) { } // Enter a parse tree produced by sequenceParser#asyncMessage. enterAsyncMessage(e) { } // Exit a parse tree produced by sequenceParser#asyncMessage. exitAsyncMessage(e) { } // Enter a parse tree produced by sequenceParser#content. enterContent(e) { } // Exit a parse tree produced by sequenceParser#content. exitContent(e) { } // Enter a parse tree produced by sequenceParser#construct. enterConstruct(e) { } // Exit a parse tree produced by sequenceParser#construct. exitConstruct(e) { } // Enter a parse tree produced by sequenceParser#type. enterType(e) { } // Exit a parse tree produced by sequenceParser#type. exitType(e) { } // Enter a parse tree produced by sequenceParser#assignee. enterAssignee(e) { } // Exit a parse tree produced by sequenceParser#assignee. exitAssignee(e) { } // Enter a parse tree produced by sequenceParser#methodName. enterMethodName(e) { } // Exit a parse tree produced by sequenceParser#methodName. exitMethodName(e) { } // Enter a parse tree produced by sequenceParser#parameters. enterParameters(e) { } // Exit a parse tree produced by sequenceParser#parameters. exitParameters(e) { } // Enter a parse tree produced by sequenceParser#parameter. enterParameter(e) { } // Exit a parse tree produced by sequenceParser#parameter. exitParameter(e) { } // Enter a parse tree produced by sequenceParser#namedParameter. enterNamedParameter(e) { } // Exit a parse tree produced by sequenceParser#namedParameter. exitNamedParameter(e) { } // Enter a parse tree produced by sequenceParser#declaration. enterDeclaration(e) { } // Exit a parse tree produced by sequenceParser#declaration. exitDeclaration(e) { } // Enter a parse tree produced by sequenceParser#tcf. enterTcf(e) { } // Exit a parse tree produced by sequenceParser#tcf. exitTcf(e) { } // Enter a parse tree produced by sequenceParser#tryBlock. enterTryBlock(e) { } // Exit a parse tree produced by sequenceParser#tryBlock. exitTryBlock(e) { } // Enter a parse tree produced by sequenceParser#catchBlock. enterCatchBlock(e) { } // Exit a parse tree produced by sequenceParser#catchBlock. exitCatchBlock(e) { } // Enter a parse tree produced by sequenceParser#finallyBlock. enterFinallyBlock(e) { } // Exit a parse tree produced by sequenceParser#finallyBlock. exitFinallyBlock(e) { } // Enter a parse tree produced by sequenceParser#alt. enterAlt(e) { } // Exit a parse tree produced by sequenceParser#alt. exitAlt(e) { } // Enter a parse tree produced by sequenceParser#ifBlock. enterIfBlock(e) { } // Exit a parse tree produced by sequenceParser#ifBlock. exitIfBlock(e) { } // Enter a parse tree produced by sequenceParser#elseIfBlock. enterElseIfBlock(e) { } // Exit a parse tree produced by sequenceParser#elseIfBlock. exitElseIfBlock(e) { } // Enter a parse tree produced by sequenceParser#elseBlock. enterElseBlock(e) { } // Exit a parse tree produced by sequenceParser#elseBlock. exitElseBlock(e) { } // Enter a parse tree produced by sequenceParser#braceBlock. enterBraceBlock(e) { } // Exit a parse tree produced by sequenceParser#braceBlock. exitBraceBlock(e) { } // Enter a parse tree produced by sequenceParser#loop. enterLoop(e) { } // Exit a parse tree produced by sequenceParser#loop. exitLoop(e) { } // Enter a parse tree produced by sequenceParser#assignmentExpr. enterAssignmentExpr(e) { } // Exit a parse tree produced by sequenceParser#assignmentExpr. exitAssignmentExpr(e) { } // Enter a parse tree produced by sequenceParser#funcExpr. enterFuncExpr(e) { } // Exit a parse tree produced by sequenceParser#funcExpr. exitFuncExpr(e) { } // Enter a parse tree produced by sequenceParser#atomExpr. enterAtomExpr(e) { } // Exit a parse tree produced by sequenceParser#atomExpr. exitAtomExpr(e) { } // Enter a parse tree produced by sequenceParser#orExpr. enterOrExpr(e) { } // Exit a parse tree produced by sequenceParser#orExpr. exitOrExpr(e) { } // Enter a parse tree produced by sequenceParser#additiveExpr. enterAdditiveExpr(e) { } // Exit a parse tree produced by sequenceParser#additiveExpr. exitAdditiveExpr(e) { } // Enter a parse tree produced by sequenceParser#relationalExpr. enterRelationalExpr(e) { } // Exit a parse tree produced by sequenceParser#relationalExpr. exitRelationalExpr(e) { } // Enter a parse tree produced by sequenceParser#plusExpr. enterPlusExpr(e) { } // Exit a parse tree produced by sequenceParser#plusExpr. exitPlusExpr(e) { } // Enter a parse tree produced by sequenceParser#notExpr. enterNotExpr(e) { } // Exit a parse tree produced by sequenceParser#notExpr. exitNotExpr(e) { } // Enter a parse tree produced by sequenceParser#unaryMinusExpr. enterUnaryMinusExpr(e) { } // Exit a parse tree produced by sequenceParser#unaryMinusExpr. exitUnaryMinusExpr(e) { } // Enter a parse tree produced by sequenceParser#creationExpr. enterCreationExpr(e) { } // Exit a parse tree produced by sequenceParser#creationExpr. exitCreationExpr(e) { } // Enter a parse tree produced by sequenceParser#parenthesizedExpr. enterParenthesizedExpr(e) { } // Exit a parse tree produced by sequenceParser#parenthesizedExpr. exitParenthesizedExpr(e) { } // Enter a parse tree produced by sequenceParser#multiplicationExpr. enterMultiplicationExpr(e) { } // Exit a parse tree produced by sequenceParser#multiplicationExpr. exitMultiplicationExpr(e) { } // Enter a parse tree produced by sequenceParser#equalityExpr. enterEqualityExpr(e) { } // Exit a parse tree produced by sequenceParser#equalityExpr. exitEqualityExpr(e) { } // Enter a parse tree produced by sequenceParser#andExpr. enterAndExpr(e) { } // Exit a parse tree produced by sequenceParser#andExpr. exitAndExpr(e) { } // Enter a parse tree produced by sequenceParser#numberAtom. enterNumberAtom(e) { } // Exit a parse tree produced by sequenceParser#numberAtom. exitNumberAtom(e) { } // Enter a parse tree produced by sequenceParser#numberUnitAtom. enterNumberUnitAtom(e) { } // Exit a parse tree produced by sequenceParser#numberUnitAtom. exitNumberUnitAtom(e) { } // Enter a parse tree produced by sequenceParser#moneyAtom. enterMoneyAtom(e) { } // Exit a parse tree produced by sequenceParser#moneyAtom. exitMoneyAtom(e) { } // Enter a parse tree produced by sequenceParser#booleanAtom. enterBooleanAtom(e) { } // Exit a parse tree produced by sequenceParser#booleanAtom. exitBooleanAtom(e) { } // Enter a parse tree produced by sequenceParser#idAtom. enterIdAtom(e) { } // Exit a parse tree produced by sequenceParser#idAtom. exitIdAtom(e) { } // Enter a parse tree produced by sequenceParser#stringAtom. enterStringAtom(e) { } // Exit a parse tree produced by sequenceParser#stringAtom. exitStringAtom(e) { } // Enter a parse tree produced by sequenceParser#nilAtom. enterNilAtom(e) { } // Exit a parse tree produced by sequenceParser#nilAtom. exitNilAtom(e) { } // Enter a parse tree produced by sequenceParser#parExpr. enterParExpr(e) { } // Exit a parse tree produced by sequenceParser#parExpr. exitParExpr(e) { } // Enter a parse tree produced by sequenceParser#condition. enterCondition(e) { } // Exit a parse tree produced by sequenceParser#condition. exitCondition(e) { } // Enter a parse tree produced by sequenceParser#inExpr. enterInExpr(e) { } // Exit a parse tree produced by sequenceParser#inExpr. exitInExpr(e) { } } const sw = [ 4, 1, 71, 603, 2, 0, 7, 0, 2, 1, 7, 1, 2, 2, 7, 2, 2, 3, 7, 3, 2, 4, 7, 4, 2, 5, 7, 5, 2, 6, 7, 6, 2, 7, 7, 7, 2, 8, 7, 8, 2, 9, 7, 9, 2, 10, 7, 10, 2, 11, 7, 11, 2, 12, 7, 12, 2, 13, 7, 13, 2, 14, 7, 14, 2, 15, 7, 15, 2, 16, 7, 16, 2, 17, 7, 17, 2, 18, 7, 18, 2, 19, 7, 19, 2, 20, 7, 20, 2, 21, 7, 21, 2, 22, 7, 22, 2, 23, 7, 23, 2, 24, 7, 24, 2, 25, 7, 25, 2, 26, 7, 26, 2, 27, 7, 27, 2, 28, 7, 28, 2, 29, 7, 29, 2, 30, 7, 30, 2, 31, 7, 31, 2, 32, 7, 32, 2, 33, 7, 33, 2, 34, 7, 34, 2, 35, 7, 35, 2, 36, 7, 36, 2, 37, 7, 37, 2, 38, 7, 38, 2, 39, 7, 39, 2, 40, 7, 40, 2, 41, 7, 41, 2, 42, 7, 42, 2, 43, 7, 43, 2, 44, 7, 44, 2, 45, 7, 45, 2, 46, 7, 46, 2, 47, 7, 47, 2, 48, 7, 48, 2, 49, 7, 49, 2, 50, 7, 50, 2, 51, 7, 51, 2, 52, 7, 52, 2, 53, 7, 53, 2, 54, 7, 54, 2, 55, 7, 55, 2, 56, 7, 56, 2, 57, 7, 57, 1, 0, 3, 0, 118, 8, 0, 1, 0, 1, 0, 3, 0, 122, 8, 0, 1, 0, 1, 0, 1, 0, 1, 0, 3, 0, 128, 8, 0, 1, 0, 3, 0, 131, 8, 0, 1, 0, 1, 0, 1, 0, 3, 0, 136, 8, 0, 1, 1, 1, 1, 3, 1, 140, 8, 1, 1, 1, 3, 1, 143, 8, 1, 1, 2, 1, 2, 4, 2, 147, 8, 2, 11, 2, 12, 2, 148, 1, 2, 1, 2, 5, 2, 153, 8, 2, 10, 2, 12, 2, 156, 9, 2, 1, 2, 3, 2, 159, 8, 2, 1, 3, 1, 3, 3, 3, 163, 8, 3, 1, 3, 1, 3, 5, 3, 167, 8, 3, 10, 3, 12, 3, 170, 9, 3, 1, 3, 3, 3, 173, 8, 3, 3, 3, 175, 8, 3, 1, 4, 1, 4, 1, 4, 3, 4, 180, 8, 4, 1, 4, 3, 4, 183, 8, 4, 1, 4, 3, 4, 186, 8, 4, 1, 5, 1, 5, 1, 6, 3, 6, 191, 8, 6, 1, 6, 3, 6, 194, 8, 6, 1, 6, 1, 6, 3, 6, 198, 8, 6, 1, 6, 3, 6, 201, 8, 6, 1, 6, 3, 6, 204, 8, 6, 1, 6, 1, 6, 3, 6, 208, 8, 6, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 3, 7, 217, 8, 7, 1, 7, 1, 7, 3, 7, 221, 8, 7, 3, 7, 223, 8, 7, 1, 8, 1, 8, 1, 8, 3, 8, 228, 8, 8, 1, 9, 1, 9, 1, 10, 1, 10, 1, 11, 1, 11, 1, 12, 4, 12, 237, 8, 12, 11, 12, 12, 12, 238, 1, 13, 1, 13, 3, 13, 243, 8, 13, 1, 13, 3, 13, 246, 8, 13, 1, 13, 1, 13, 1, 13, 3, 13, 251, 8, 13, 3, 13, 253, 8, 13, 1, 14, 1, 14, 1, 15, 1, 15, 1, 16, 1, 16, 1, 16, 1, 16, 1, 16, 1, 16, 1, 16, 1, 16, 1, 16, 1, 16, 1, 16, 3, 16, 270, 8, 16, 1, 16, 1, 16, 1, 16, 3, 16, 275, 8, 16, 1, 17, 1, 17, 1, 17, 3, 17, 280, 8, 17, 1, 18, 1, 18, 1, 18, 3, 18, 285, 8, 18, 1, 19, 1, 19, 1, 19, 3, 19, 290, 8, 19, 1, 19, 3, 19, 293, 8, 19, 1, 19, 1, 19, 3, 19, 297, 8, 19, 1, 20, 1, 20, 1, 20, 3, 20, 302, 8, 20, 1, 20, 3, 20, 305, 8, 20, 1, 20, 1, 20, 1, 20, 3, 20, 310, 8, 20, 1, 21, 1, 21, 1, 21, 3, 21, 315, 8, 21, 1, 22, 1, 22, 1, 22, 1, 22, 1, 22, 5, 22, 322, 8, 22, 10, 22, 12, 22, 325, 9, 22, 5, 22, 327, 8, 22, 10, 22, 12, 22, 330, 9, 22, 1, 22, 1, 22, 3, 22, 334, 8, 22, 1, 23, 3, 23, 337, 8, 23, 1, 23, 1, 23, 1, 23, 1, 23, 3, 23, 343, 8, 23, 1, 23, 3, 23, 346, 8, 23, 1, 23, 3, 23, 349, 8, 23, 1, 23, 3, 23, 352, 8, 23, 1, 24, 1, 24, 1, 24, 3, 24, 357, 8, 24, 1, 25, 1, 25, 1, 25, 3, 25, 362, 8, 25, 1, 25, 3, 25, 365, 8, 25, 1, 25, 1, 25, 3, 25, 369, 8, 25, 1, 25, 3, 25, 372, 8, 25, 1, 26, 1, 26, 1, 26, 3, 26, 377, 8, 26, 1, 26, 1, 26, 1, 26, 1, 27, 1, 27, 1, 27, 5, 27, 385, 8, 27, 10, 27, 12, 27, 388, 9, 27, 1, 28, 1, 28, 1, 29, 1, 29, 1, 30, 1, 30, 3, 30, 396, 8, 30, 1, 31, 1, 31, 3, 31, 400, 8, 31, 1, 31, 1, 31, 1, 32, 3, 32, 405, 8, 32, 1, 32, 1, 32, 1, 32, 1, 33, 1, 33, 1, 33, 3, 33, 413, 8, 33, 1, 33, 1, 33, 1, 33, 3, 33, 418, 8, 33, 1, 33, 1, 33, 1, 33, 3, 33, 423, 8, 33, 3, 33, 425, 8, 33, 1, 34, 1, 34, 1, 35, 1, 35, 1, 36, 1, 36, 1, 37, 1, 37, 1, 37, 1, 37, 5, 37, 437, 8, 37, 10, 37, 12, 37, 440, 9, 37, 1, 37, 1, 37, 1, 37, 3, 37, 445, 8, 37, 1, 38, 1, 38, 1, 39, 1, 39, 1, 39, 5, 39, 452, 8, 39, 10, 39, 12, 39, 455, 9, 39, 1, 39, 3, 39, 458, 8, 39, 1, 40, 1, 40, 1, 40, 3, 40, 463, 8, 40, 1, 41, 1, 41, 1, 41, 3, 41, 468, 8, 41, 1, 42, 1, 42, 1, 42, 1, 43, 1, 43, 5, 43, 475, 8, 43, 10, 43, 12, 43, 478, 9, 43, 1, 43, 3, 43, 481, 8, 43, 1, 44, 1, 44, 1, 44, 1, 45, 1, 45, 3, 45, 488, 8, 45, 1, 45, 1, 45, 1, 46, 1, 46, 1, 46, 1, 47, 1, 47, 5, 47, 497, 8, 47, 10, 47, 12, 47, 500, 9, 47, 1, 47, 3, 47, 503, 8, 47, 1, 48, 1, 48, 1, 48, 1, 48, 1, 49, 1, 49, 1, 49, 1, 49, 1, 49, 1, 50, 1, 50, 1, 50, 1, 51, 1, 51, 3, 51, 519, 8, 51, 1, 51, 1, 51, 1, 52, 1, 52, 3, 52, 525, 8, 52, 1, 52, 3, 52, 528, 8, 52, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 3, 53, 539, 8, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 3, 53, 550, 8, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 1, 53, 5, 53, 573, 8, 53, 10, 53, 12, 53, 576, 9, 53, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 1, 54, 3, 54, 585, 8, 54, 1, 55, 1, 55, 3, 55, 589, 8, 55, 1, 55, 3, 55, 592, 8, 55, 1, 56, 1, 56, 1, 56, 3, 56, 597, 8, 56, 1, 57, 1, 57, 1, 57, 1, 57, 1, 57, 0, 1, 106, 58, 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 0, 11, 2, 0, 8, 8, 17, 17, 2, 0, 9, 9, 16, 16, 2, 0, 57, 57, 62, 63, 2, 0, 10, 10, 21, 21, 1, 0, 22, 24, 1, 0, 20, 21, 1, 0, 16, 19, 1, 0, 14, 15, 1, 0, 58, 59, 1, 0, 34, 35, 1, 0, 62, 63, 672, 0, 135, 1, 0, 0, 0, 2, 137, 1, 0, 0, 0, 4, 158, 1, 0, 0, 0, 6, 160, 1, 0, 0, 0, 8, 185, 1, 0, 0, 0, 10, 187, 1, 0, 0, 0, 12, 207, 1, 0, 0, 0, 14, 222, 1, 0, 0, 0, 16, 227, 1, 0, 0, 0, 18, 229, 1, 0, 0, 0, 20, 231, 1, 0, 0, 0, 22, 233, 1, 0, 0, 0, 24, 236, 1, 0, 0, 0, 26, 252, 1, 0, 0, 0, 28, 254, 1, 0, 0, 0, 30, 256, 1, 0, 0, 0, 32, 274, 1, 0, 0, 0, 34, 279, 1, 0, 0, 0, 36, 284, 1, 0, 0, 0, 38, 296, 1, 0, 0, 0, 40, 309, 1, 0, 0, 0, 42, 311, 1, 0, 0, 0, 44, 316, 1, 0, 0, 0, 46, 351, 1, 0, 0, 0, 48, 353, 1, 0, 0, 0, 50, 371, 1, 0, 0, 0, 52, 376, 1, 0, 0, 0, 54, 381, 1, 0, 0, 0, 56, 389, 1, 0, 0, 0, 58, 391, 1, 0, 0, 0, 60, 393, 1, 0, 0, 0, 62, 397, 1, 0, 0, 0, 64, 404, 1, 0, 0, 0, 66, 424, 1, 0, 0, 0, 68, 426, 1, 0, 0, 0, 70, 428, 1, 0, 0, 0, 72, 430, 1, 0, 0, 0, 74, 444, 1, 0, 0, 0, 76, 446, 1, 0, 0, 0, 78, 448, 1, 0, 0, 0, 80, 462, 1, 0, 0, 0, 82, 464, 1, 0, 0, 0, 84, 469, 1, 0, 0, 0, 86, 472, 1, 0, 0, 0, 88, 482, 1, 0, 0, 0, 90, 485, 1, 0, 0, 0, 92, 491, 1, 0, 0, 0, 94, 494, 1, 0, 0, 0, 96, 504, 1, 0, 0, 0, 98, 508, 1, 0, 0, 0, 100, 513, 1, 0, 0, 0, 102, 516, 1, 0, 0, 0, 104, 522, 1, 0, 0, 0, 106, 549, 1, 0, 0, 0, 108, 584, 1, 0, 0, 0, 110, 586, 1, 0, 0, 0, 112, 596, 1, 0, 0, 0, 114, 598, 1, 0, 0, 0, 116, 118, 3, 2, 1, 0, 117, 116, 1, 0, 0, 0, 117, 118, 1, 0, 0, 0, 118, 119, 1, 0, 0, 0, 119, 136, 5, 0, 0, 1, 120, 122, 3, 2, 1, 0, 121, 120, 1, 0, 0, 0, 121, 122, 1, 0, 0, 0, 122, 123, 1, 0, 0, 0, 123, 124, 3, 4, 2, 0, 124, 125, 5, 0, 0, 1, 125, 136, 1, 0, 0, 0, 126, 128, 3, 2, 1, 0, 127, 126, 1, 0, 0, 0, 127, 128, 1, 0, 0, 0, 128, 130, 1, 0, 0, 0, 129, 131, 3, 4, 2, 0, 130, 129, 1, 0, 0, 0, 130, 131, 1, 0, 0, 0, 131, 132, 1, 0, 0, 0, 132, 133, 3, 24, 12, 0, 133, 134, 5, 0, 0, 1, 134, 136, 1, 0, 0, 0, 135, 117, 1, 0, 0, 0, 135, 121, 1, 0, 0, 0, 135, 127, 1, 0, 0, 0, 136, 1, 1, 0, 0, 0, 137, 139, 5, 6, 0, 0, 138, 140, 5, 70, 0, 0, 139, 138, 1, 0, 0, 0, 139, 140, 1, 0, 0, 0, 140, 142, 1, 0, 0, 0, 141, 143, 5, 71, 0, 0, 142, 141, 1, 0, 0, 0, 142, 143, 1, 0, 0, 0, 143, 3, 1, 0, 0, 0, 144, 147, 3, 6, 3, 0, 145, 147, 3, 12, 6, 0, 146, 144, 1, 0, 0, 0, 146, 145, 1, 0, 0, 0, 147, 148, 1, 0, 0, 0, 148, 146, 1, 0, 0, 0, 148, 149, 1, 0, 0, 0, 149, 159, 1, 0, 0, 0, 150, 153, 3, 6, 3, 0, 151, 153, 3, 12, 6, 0, 152, 150, 1, 0, 0, 0, 152, 151, 1, 0, 0, 0, 153, 156, 1, 0, 0, 0, 154, 152, 1, 0, 0, 0, 154, 155, 1, 0, 0, 0, 155, 157, 1, 0, 0, 0, 156, 154, 1, 0, 0, 0, 157, 159, 3, 8, 4, 0, 158, 146, 1, 0, 0, 0, 158, 154, 1, 0, 0, 0, 159, 5, 1, 0, 0, 0, 160, 162, 5, 43, 0, 0, 161, 163, 3, 20, 10, 0, 162, 161, 1, 0, 0, 0, 162, 163, 1, 0, 0, 0, 163, 174, 1, 0, 0, 0, 164, 168, 5, 32, 0, 0, 165, 167, 3, 12, 6, 0, 166, 165, 1, 0, 0, 0, 167, 170, 1, 0, 0, 0, 168, 166, 1, 0, 0, 0, 168, 169, 1, 0, 0, 0, 169, 172, 1, 0, 0, 0, 170, 168, 1, 0, 0, 0, 171, 173, 5, 33, 0, 0, 172, 171, 1, 0, 0, 0, 172, 173, 1, 0, 0, 0, 173, 175, 1, 0, 0, 0, 174, 164, 1, 0, 0, 0, 174, 175, 1, 0, 0, 0, 175, 7, 1, 0, 0, 0, 176, 182, 5, 53, 0, 0, 177, 179, 5, 30, 0, 0, 178, 180, 3, 10, 5, 0, 179, 178, 1, 0, 0, 0, 179, 180, 1, 0, 0, 0, 180, 181, 1, 0, 0, 0, 181, 183, 5, 31, 0, 0, 182, 177, 1, 0, 0, 0, 182, 183, 1, 0, 0, 0, 183, 186, 1, 0, 0, 0, 184, 186, 5, 55, 0, 0, 185, 176, 1, 0, 0, 0, 185, 184, 1, 0, 0, 0, 186, 9, 1, 0, 0, 0, 187, 188, 3, 20, 10, 0, 188, 11, 1, 0, 0, 0, 189, 191, 3, 18, 9, 0, 190, 189, 1, 0, 0, 0, 190, 191, 1, 0, 0, 0, 191, 193, 1, 0, 0, 0, 192, 194, 3, 14, 7, 0, 193, 192, 1, 0, 0, 0, 193, 194, 1, 0, 0, 0, 194, 195, 1, 0, 0, 0, 195, 197, 3, 20, 10, 0, 196, 198, 3, 22, 11, 0, 197, 196, 1, 0, 0, 0, 197, 198, 1, 0, 0, 0, 198, 200, 1, 0, 0, 0, 199, 201, 3, 16, 8, 0, 200, 199, 1, 0, 0, 0, 200, 201, 1, 0, 0, 0, 201, 203, 1, 0, 0, 0, 202, 204, 5, 11, 0, 0, 203, 202, 1, 0, 0, 0, 203, 204, 1, 0, 0, 0, 204, 208, 1, 0, 0, 0, 205, 208, 3, 14, 7, 0, 206, 208, 3, 18, 9, 0, 207, 190, 1, 0, 0, 0, 207, 205, 1, 0, 0, 0, 207, 206, 1, 0, 0, 0, 208, 13, 1, 0, 0, 0, 209, 210, 5, 8, 0, 0, 210, 211, 3, 20, 10, 0, 211, 212, 5, 9, 0, 0, 212, 223, 1, 0, 0, 0, 213, 214, 5, 8, 0, 0, 214, 216, 3, 20, 10, 0, 215, 217, 5, 16, 0, 0, 216, 215, 1, 0, 0, 0, 216, 217, 1, 0, 0, 0, 217, 223, 1, 0, 0, 0, 218, 220, 7, 0, 0, 0, 219, 221, 7, 1, 0, 0, 220, 219, 1, 0, 0, 0, 220, 221, 1, 0, 0, 0, 221, 223, 1, 0, 0, 0, 222, 209, 1, 0, 0, 0, 222, 213, 1, 0, 0, 0, 222, 218, 1, 0, 0, 0, 223, 15, 1, 0, 0, 0, 224, 225, 5, 48, 0, 0, 225, 228, 3, 20, 10, 0, 226, 228, 5, 48, 0, 0, 227, 224, 1, 0, 0, 0, 227, 226, 1, 0, 0, 0, 228, 17, 1, 0, 0, 0, 229, 230, 5, 55, 0, 0, 230, 19, 1, 0, 0, 0, 231, 232, 7, 2, 0, 0, 232, 21, 1, 0, 0, 0, 233, 234, 5, 58, 0, 0, 234, 23, 1, 0, 0, 0, 235, 237, 3, 32, 16, 0, 236, 235, 1, 0, 0, 0, 237, 238, 1, 0, 0, 0, 238, 236, 1, 0, 0, 0, 238, 239, 1, 0, 0, 0, 239, 25, 1, 0, 0, 0, 240, 242, 5, 40, 0, 0, 241, 243, 3, 106, 53, 0, 242, 241, 1, 0, 0, 0, 242, 243, 1, 0, 0, 0, 243, 245, 1, 0, 0, 0, 244, 246, 5, 27, 0, 0, 245, 244, 1, 0, 0, 0, 245, 246, 1, 0, 0, 0, 246, 253, 1, 0, 0, 0, 247, 248, 5, 54, 0, 0, 248, 250, 3, 66, 33, 0, 249, 251, 5, 69, 0, 0, 250, 249, 1, 0, 0, 0, 250, 251, 1, 0, 0, 0, 251, 253, 1, 0, 0, 0, 252, 240, 1, 0, 0, 0, 252, 247, 1, 0, 0, 0, 253, 27, 1, 0, 0, 0, 254, 255, 3, 30, 15, 0, 255, 29, 1, 0, 0, 0, 256, 257, 5, 67, 0, 0, 257, 31, 1, 0, 0, 0, 258, 275, 3, 94, 47, 0, 259, 275, 3, 34, 17, 0, 260, 275, 3, 36, 18, 0, 261, 275, 3, 38, 19, 0, 262, 275, 3, 40, 20, 0, 263, 275, 3, 44, 22, 0, 264, 275, 3, 104, 52, 0, 265, 275, 3, 42, 21, 0, 266, 275, 3, 48, 24, 0, 267, 269, 3, 66, 33, 0, 268, 270, 5, 69, 0, 0, 269, 268, 1, 0, 0, 0, 269, 270, 1, 0, 0, 0, 270, 275, 1, 0, 0, 0, 271, 275, 3, 26, 13, 0, 272, 275, 3, 28, 14, 0, 273, 275, 3, 86, 43, 0, 274, 258, 1, 0, 0, 0, 274, 259, 1, 0, 0, 0, 274, 260, 1, 0, 0, 0, 274, 261, 1, 0, 0, 0, 274, 262, 1, 0, 0, 0, 274, 263, 1, 0, 0, 0, 274, 264, 1, 0, 0, 0, 274, 265, 1, 0, 0, 0, 274, 266, 1, 0, 0, 0, 274, 267, 1, 0, 0, 0, 274, 271, 1, 0, 0, 0, 274, 272, 1, 0, 0, 0, 274, 273, 1, 0, 0, 0, 275, 33, 1, 0, 0, 0, 276, 277, 5, 42, 0, 0, 277, 280, 3, 102, 51, 0, 278, 280, 5, 42, 0, 0, 279, 276, 1, 0, 0, 0, 279, 278, 1, 0, 0, 0, 280, 35, 1, 0, 0, 0, 281, 282, 5, 44, 0, 0, 282, 285, 3, 102, 51, 0, 283, 285, 5, 44, 0, 0, 284, 281, 1, 0, 0, 0, 284, 283, 1, 0, 0, 0, 285, 37, 1, 0, 0, 0, 286, 292, 5, 45, 0, 0, 287, 289, 5, 30, 0, 0, 288, 290, 3, 108, 54, 0, 289, 288, 1, 0, 0, 0, 289, 290, 1, 0, 0, 0, 290, 291, 1, 0, 0, 0, 291, 293, 5, 31, 0, 0, 292, 287, 1, 0, 0, 0, 292, 293, 1, 0, 0, 0, 293, 294, 1, 0, 0, 0, 294, 297, 3, 102, 51, 0, 295, 297, 5, 45, 0, 0, 296, 286, 1, 0, 0, 0, 296, 295, 1, 0, 0, 0, 297, 39, 1, 0, 0, 0, 298, 304, 5, 46, 0, 0, 299, 301, 5, 30, 0, 0, 300, 302, 3, 108, 54, 0, 301, 300, 1, 0, 0, 0, 301, 302, 1, 0, 0, 0, 302, 303, 1, 0, 0, 0, 303, 305, 5, 31, 0, 0, 304, 299, 1, 0, 0, 0, 304, 305, 1, 0, 0, 0, 305, 306, 1, 0, 0, 0, 306, 310, 3, 102, 51, 0, 307, 310, 3, 102, 51, 0, 308, 310, 5, 46, 0, 0, 309, 298, 1, 0, 0, 0, 309, 307, 1, 0, 0, 0, 309, 308, 1, 0, 0, 0, 310, 41, 1, 0, 0, 0, 311, 314, 3, 46, 23, 0, 312, 315, 5, 27, 0, 0, 313, 315, 3, 102, 51, 0, 314, 312, 1, 0, 0, 0, 314, 313, 1, 0, 0, 0, 314, 315, 1, 0, 0, 0, 315, 43, 1, 0, 0, 0, 316, 317, 5, 47, 0, 0, 317, 318, 5, 30, 0, 0, 318, 328, 3, 20, 10, 0, 319, 323, 5, 28, 0, 0, 320, 322, 3, 20, 10, 0, 321, 320, 1, 0, 0, 0, 322, 325, 1, 0, 0, 0, 323, 321, 1, 0, 0, 0, 323, 324, 1, 0, 0, 0, 324, 327, 1, 0, 0, 0, 325, 323, 1, 0, 0, 0, 326, 319, 1, 0, 0, 0, 327, 330, 1, 0, 0, 0, 328, 326, 1, 0, 0, 0, 328, 329, 1, 0, 0, 0, 329, 331, 1, 0, 0, 0, 330, 328, 1, 0, 0, 0, 331, 333, 5, 31, 0, 0, 332, 334, 5, 27, 0, 0, 333, 332, 1, 0, 0, 0, 333, 334, 1, 0, 0, 0, 334, 45, 1, 0, 0, 0, 335, 337, 3, 64, 32, 0, 336, 335, 1, 0, 0, 0, 336, 337, 1, 0, 0, 0, 337, 338, 1, 0, 0, 0, 338, 339, 5, 41, 0, 0, 339, 345, 3, 70, 35, 0, 340, 342, 5, 30, 0, 0, 341, 343, 3, 78, 39, 0, 342, 341, 1, 0, 0, 0, 342, 343, 1, 0, 0, 0, 343, 344, 1, 0, 0, 0, 344, 346, 5, 31, 0, 0, 345, 340, 1, 0, 0, 0, 345, 346, 1, 0, 0, 0, 346, 352, 1, 0, 0, 0, 347, 349, 3, 64, 32, 0, 348, 347, 1, 0, 0, 0, 348, 349, 1, 0, 0, 0, 349, 350, 1, 0, 0, 0, 350, 352, 5, 41, 0, 0, 351, 336, 1, 0, 0, 0, 351, 348, 1, 0, 0, 0, 352, 47, 1, 0, 0, 0, 353, 356, 3, 50, 25, 0, 354, 357, 5, 27, 0, 0, 355, 357, 3, 102, 51, 0, 356, 354, 1, 0, 0, 0, 356, 355, 1, 0, 0, 0, 356, 357, 1, 0, 0, 0, 357, 49, 1, 0, 0, 0, 358, 364, 3, 64, 32, 0, 359, 361, 3, 52, 26, 0, 360, 362, 3, 54, 27, 0, 361, 360, 1, 0, 0, 0, 361, 362, 1, 0, 0, 0, 362, 365, 1, 0, 0, 0, 363, 365, 3, 54, 27, 0, 364, 359, 1, 0, 0, 0, 364, 363, 1, 0, 0, 0, 364, 365, 1, 0, 0, 0, 365, 372, 1, 0, 0, 0, 366, 368, 3, 52, 26, 0, 367, 369, 3, 54, 27, 0, 368, 367, 1, 0, 0, 0, 368, 369, 1, 0, 0, 0, 369, 372, 1, 0, 0, 0, 370, 372, 3, 54, 27, 0, 371, 358, 1, 0, 0, 0, 371, 366, 1, 0, 0, 0, 371, 370, 1, 0, 0, 0, 372, 51, 1, 0, 0, 0, 373, 374, 3, 56, 28, 0, 374, 375, 5, 10, 0, 0, 375, 377, 1, 0, 0, 0, 376, 373, 1, 0, 0, 0, 376, 377, 1, 0, 0, 0, 377, 378, 1, 0, 0, 0, 378, 379, 3, 58, 29, 0, 379, 380, 5, 56, 0, 0, 380, 53, 1, 0, 0, 0, 381, 386, 3, 60, 30, 0, 382, 383, 5, 56, 0, 0, 383, 385, 3, 60, 30, 0, 384, 382, 1, 0, 0, 0, 385, 388, 1, 0, 0, 0, 386, 384, 1, 0, 0, 0, 386, 387, 1, 0, 0, 0, 387, 55, 1, 0, 0, 0, 388, 386, 1, 0, 0, 0, 389, 390, 3, 20, 10, 0, 390, 57, 1, 0, 0, 0, 391, 392, 3, 20, 10, 0, 392, 59, 1, 0, 0, 0, 393, 395, 3, 76, 38, 0, 394, 396, 3, 62, 31, 0, 395, 394, 1, 0, 0, 0, 395, 396, 1, 0, 0, 0, 396, 61, 1, 0, 0, 0, 397, 399, 5, 30, 0, 0, 398, 400, 3, 78, 39, 0, 399, 398, 1, 0, 0, 0, 399, 400, 1, 0, 0, 0, 400, 401, 1, 0, 0, 0, 401, 402, 5, 31, 0, 0, 402, 63, 1, 0, 0, 0, 403, 405, 3, 72, 36, 0, 404, 403, 1, 0, 0, 0, 404, 405, 1, 0, 0, 0, 405, 406, 1, 0, 0, 0, 406, 407, 3, 74, 37, 0, 407, 408, 5, 29, 0, 0, 408, 65, 1, 0, 0, 0, 409, 410, 3, 56, 28, 0, 410, 411, 5, 10, 0, 0, 411, 413, 1, 0, 0, 0, 412, 409, 1, 0, 0, 0, 412, 413, 1, 0, 0, 0, 413, 414, 1, 0, 0, 0, 414, 415, 3, 58, 29, 0, 415, 417, 5, 7, 0, 0, 416, 418, 3, 68, 34, 0, 417, 416, 1, 0, 0, 0, 417, 418, 1, 0, 0, 0, 418, 425, 1, 0, 0, 0, 419, 420, 3, 56, 28, 0, 420, 422, 7, 3, 0, 0, 421, 423, 3, 58, 29, 0, 422, 421, 1, 0, 0, 0, 422, 423, 1, 0, 0, 0, 423, 425, 1, 0, 0, 0, 424, 412, 1, 0, 0, 0, 424, 419, 1, 0, 0, 0, 425, 67, 1, 0, 0, 0, 426, 427, 5, 68, 0, 0, 427, 69, 1, 0, 0, 0, 428, 429, 3, 20, 10, 0, 429, 71, 1, 0, 0, 0, 430, 431, 3, 20, 10, 0, 431, 73, 1, 0, 0, 0, 432, 445, 3, 108, 54, 0, 433, 438, 5, 57, 0, 0, 434, 435, 5, 28, 0, 0, 435, 437, 5, 57, 0, 0, 436, 434, 1, 0, 0, 0, 437, 440, 1, 0, 0, 0, 438, 436, 1, 0, 0, 0, 438, 439, 1, 0, 0, 0, 439, 445, 1, 0, 0, 0, 440, 438, 1, 0, 0, 0, 441, 445, 5, 62, 0, 0, 442, 445, 5, 63, 0, 0, 443, 445, 5, 41, 0, 0, 444, 432, 1, 0, 0, 0, 444, 433, 1, 0, 0, 0, 444, 441, 1, 0, 0, 0, 444, 442, 1, 0, 0, 0, 444, 443, 1, 0, 0, 0, 445, 75, 1, 0, 0, 0, 446, 447, 3, 20, 10, 0, 447, 77, 1, 0, 0, 0, 448, 453, 3, 80, 40, 0, 449, 450, 5, 28, 0, 0, 450, 452, 3, 80, 40, 0, 451, 449, 1, 0, 0, 0, 452, 455, 1, 0, 0, 0, 453, 451, 1, 0, 0, 0, 453, 454, 1, 0, 0, 0, 454, 457, 1, 0, 0, 0, 455, 453, 1, 0, 0, 0, 456, 458, 5, 28, 0, 0, 457, 456, 1, 0, 0, 0, 457, 458, 1, 0, 0, 0, 458, 79, 1, 0, 0, 0, 459, 463, 3, 82, 41, 0, 460, 463, 3, 84, 42, 0, 461, 463, 3, 106, 53, 0, 462, 459, 1, 0, 0, 0, 462, 460, 1, 0, 0, 0, 462, 461, 1, 0, 0, 0, 463, 81, 1, 0, 0, 0, 464, 465, 5, 57, 0, 0, 465, 467, 5, 29, 0, 0, 466, 468, 3, 106, 53, 0, 467, 466, 1, 0, 0, 0, 467, 468, 1, 0, 0, 0, 468, 83, 1, 0, 0, 0, 469, 470, 3, 72, 36, 0, 470, 471, 5, 57, 0, 0, 471, 85, 1, 0, 0, 0, 472, 476, 3, 88, 44, 0, 473, 475, 3, 90, 45, 0, 474, 473, 1, 0, 0, 0, 475, 478, 1, 0, 0, 0, 476, 474, 1, 0, 0, 0, 476, 477, 1, 0, 0, 0, 477, 480, 1, 0, 0, 0, 478, 476, 1, 0, 0, 0, 479, 481, 3, 92, 46, 0, 480, 479, 1, 0, 0, 0, 480, 481, 1, 0, 0, 0, 481, 87, 1, 0, 0, 0, 482, 483, 5, 49, 0, 0, 483, 484, 3, 102, 51, 0, 484, 89, 1, 0, 0, 0, 485, 487, 5, 50, 0, 0, 486, 488, 3, 62, 31, 0, 487, 486, 1, 0, 0, 0, 487, 488, 1, 0, 0, 0, 488, 489, 1, 0, 0, 0, 489, 490, 3, 102, 51, 0, 490, 91, 1, 0, 0, 0, 491, 492, 5, 51, 0, 0, 492, 493, 3, 102, 51, 0, 493, 93, 1, 0, 0, 0, 494, 498, 3, 96, 48, 0, 495, 497, 3, 98, 49, 0, 496, 495, 1, 0, 0, 0, 497, 500, 1, 0, 0, 0, 498, 496, 1, 0, 0, 0, 498, 499, 1, 0, 0, 0, 499, 502, 1, 0, 0, 0, 500, 498, 1, 0, 0, 0, 501, 503, 3, 100, 50, 0, 502, 501, 1, 0, 0, 0, 502, 503, 1, 0, 0, 0, 503, 95, 1, 0, 0, 0, 504, 505, 5, 37, 0, 0, 505, 506, 3, 110, 55, 0, 506, 507, 3, 102, 51, 0, 507, 97, 1, 0, 0, 0, 508, 509, 5, 38, 0, 0, 509, 510, 5, 37, 0, 0, 510, 511, 3, 110, 55, 0, 511, 512, 3, 102, 51, 0, 512, 99, 1, 0, 0, 0, 513, 514, 5, 38, 0, 0, 514, 515, 3, 102, 51, 0, 515, 101, 1, 0, 0, 0, 516, 518, 5, 32, 0, 0, 517, 519, 3, 24, 12, 0, 518, 517, 1, 0, 0, 0, 518, 519, 1, 0, 0, 0, 519, 520, 1, 0, 0, 0, 520, 521, 5, 33, 0, 0, 521, 103, 1, 0, 0, 0, 522, 524, 5, 39, 0, 0, 523, 525, 3, 110, 55, 0, 524, 523, 1, 0, 0, 0, 524, 525, 1, 0, 0, 0, 525, 527, 1, 0, 0, 0, 526, 528, 3, 102, 51, 0, 527, 526, 1, 0, 0, 0, 527, 528, 1, 0, 0, 0, 528, 105, 1, 0, 0, 0, 529, 530, 6, 53, -1, 0, 530, 550, 3, 108, 54, 0, 531, 532, 5, 21, 0, 0, 532, 550, 3, 106, 53, 13, 533, 534, 5, 26, 0, 0, 534, 550, 3, 106, 53, 12, 535, 536, 3, 58, 29, 0, 536, 537, 5, 56, 0, 0, 537, 539, 1, 0, 0, 0, 538, 535, 1, 0, 0, 0, 538, 539, 1, 0, 0, 0, 539, 540, 1, 0, 0, 0, 540, 550, 3, 54, 27, 0, 541, 550, 3, 42, 21, 0, 542, 543, 5, 30, 0, 0, 543, 544, 3, 106, 53, 0, 544, 545, 5, 31, 0, 0, 545, 550, 1, 0, 0, 0, 546, 547, 3, 64, 32, 0, 547, 548, 3, 106, 53, 1, 548, 550, 1, 0, 0, 0, 549, 529, 1, 0, 0, 0, 549, 531, 1, 0, 0, 0, 549, 533, 1, 0, 0, 0, 549, 538, 1, 0, 0, 0, 549, 541, 1, 0, 0, 0, 549, 542, 1, 0, 0, 0, 549, 546, 1, 0, 0, 0, 550, 574, 1, 0, 0, 0, 551, 552, 10, 11, 0, 0, 552, 553, 7, 4, 0, 0, 553, 573, 3, 106, 53, 12, 554, 555, 10, 10, 0, 0, 555, 556, 7, 5, 0, 0, 556, 573, 3, 106, 53, 11, 557, 558, 10, 9, 0, 0, 558, 559, 7, 6, 0, 0, 559, 573, 3, 106, 53, 10, 560, 561, 10, 8, 0, 0, 561, 562, 7, 7, 0, 0, 562, 573, 3, 106, 53, 9, 563, 564, 10, 7, 0, 0, 564, 565, 5, 13, 0, 0, 565, 573, 3, 106, 53, 8, 566, 567, 10, 6, 0, 0, 567, 568, 5, 12, 0, 0, 568, 573, 3, 106, 53, 7, 569, 570, 10, 5, 0, 0, 570, 571, 5, 20, 0, 0, 571, 573, 3, 106, 53, 6, 572, 551, 1, 0, 0, 0, 572, 554, 1, 0, 0, 0, 572, 557, 1, 0, 0, 0, 572, 560, 1, 0, 0, 0, 572, 563, 1, 0, 0, 0, 572, 566, 1, 0, 0, 0, 572, 569, 1, 0, 0, 0, 573, 576, 1, 0, 0, 0, 574, 572, 1, 0, 0, 0, 574, 575, 1, 0, 0, 0, 575, 107, 1, 0, 0, 0, 576, 574, 1, 0, 0, 0, 577, 585, 7, 8, 0, 0, 578, 585, 5, 61, 0, 0, 579, 585, 5, 60, 0, 0, 580, 585, 7, 9, 0, 0, 581, 585, 5, 57, 0, 0, 582, 585, 7, 10, 0, 0, 583, 585, 5, 36, 0, 0, 584, 577, 1, 0, 0, 0, 584, 578, 1, 0, 0, 0, 584, 579, 1, 0, 0, 0, 584, 580, 1, 0, 0, 0, 584, 581, 1, 0, 0, 0, 584, 582, 1, 0, 0, 0, 584, 583, 1, 0, 0, 0, 585, 109, 1, 0, 0, 0, 586, 588, 5, 30, 0, 0, 587, 589, 3, 112, 56, 0, 588, 587, 1, 0, 0, 0, 588, 589, 1, 0, 0, 0, 589, 591, 1, 0, 0, 0, 590, 592, 5, 31, 0, 0, 591, 590, 1, 0, 0, 0, 591, 592, 1, 0, 0, 0, 592, 111, 1, 0, 0, 0, 593, 597, 3, 108, 54, 0, 594, 597, 3, 106, 53, 0, 595, 597, 3, 114, 57, 0, 596, 593, 1, 0, 0, 0, 596, 594, 1, 0, 0, 0, 596, 595, 1, 0, 0, 0, 597, 113, 1, 0, 0, 0, 598, 599, 5, 57, 0, 0, 599, 600, 5, 52, 0, 0, 600, 601, 5, 57, 0, 0, 601, 115, 1, 0, 0, 0, 89, 117, 121, 127, 130, 135, 139, 142, 146, 148, 152, 154, 158, 162, 168, 172, 174, 179, 182, 185, 190, 193, 197, 200, 203, 207, 216, 220, 222, 227, 238, 242, 245, 250, 252, 269, 274, 279, 284, 289, 292, 296, 301, 304, 309, 314, 323, 328, 333, 336, 342, 345, 348, 351, 356, 361, 364, 368, 371, 376, 386, 395, 399, 404, 412, 417, 422, 424, 438, 444, 453, 457, 462, 467, 476, 480, 487, 498, 502, 518, 524, 527, 538, 549, 572, 574, 584, 588, 591, 596 ], $l = new K.atn.ATNDeserializer().deserialize(sw), ow = $l.decisionToState.map((n, e) => new K.dfa.DFA(n, e)), lw = new K.PredictionContextCache(), Y = class Y extends K.Parser { constructor(e) { super(e), this._interp = new K.atn.ParserATNSimulator(this, $l, ow, lw), this.ruleNames = Y.ruleNames, this.literalNames = Y.literalNames, this.symbolicNames = Y.symbolicNames; } get atn() { return $l; } sempred(e, t, i) { switch (t) { case 53: return this.expr_sempred(e, i); default: throw "No predicate with index:" + t; } } expr_sempred(e, t) { switch (t) { case 0: return this.precpred(this._ctx, 11); case 1: return this.precpred(this._ctx, 10); case 2: return this.precpred(this._ctx, 9); case 3: return this.precpred(this._ctx, 8); case 4: return this.precpred(this._ctx, 7); case 5: return this.precpred(this._ctx, 6); case 6: return this.precpred(this._ctx, 5); default: throw "No predicate with index:" + t; } } prog() { let e = new VE(this, this._ctx, this.state); this.enterRule(e, 0, Y.RULE_prog); var t = 0; try { this.state = 135, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 4, this._ctx); switch (i) { case 1: this.enterOuterAlt(e, 1), this.state = 117, this._errHandler.sync(this), t = this._input.LA(1), t === 6 && (this.state = 116, this.title()), this.state = 119, this.match(Y.EOF); break; case 2: this.enterOuterAlt(e, 2), this.state = 121, this._errHandler.sync(this), t = this._input.LA(1), t === 6 && (this.state = 120, this.title()), this.state = 123, this.head(), this.state = 124, this.match(Y.EOF); break; case 3: this.enterOuterAlt(e, 3), this.state = 127, this._errHandler.sync(this), t = this._input.LA(1), t === 6 && (this.state = 126, this.title()), this.state = 130, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 3, this._ctx); i === 1 && (this.state = 129, this.head()), this.state = 132, this.block(), this.state = 133, this.match(Y.EOF); break; } } catch (s) { if (s instanceof K.error.RecognitionException) e.exception = s, this._errHandler.reportError(this, s), this._errHandler.recover(this, s); else throw s; } finally { this.exitRule(); } return e; } title() { let e = new zc(this, this._ctx, this.state); this.enterRule(e, 2, Y.RULE_title); var t = 0; try { this.enterOuterAlt(e, 1), this.state = 137, this.match(Y.TITLE), this.state = 139, this._errHandler.sync(this), t = this._input.LA(1), t === 70 && (this.state = 138, this.match(Y.TITLE_CONTENT)), this.state = 142, this._errHandler.sync(this), t = this._input.LA(1), t === 71 && (this.state = 141, this.match(Y.TITLE_END)); } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } head() { let e = new Hc(this, this._ctx, this.state); this.enterRule(e, 4, Y.RULE_head); try { this.state = 158, this._errHandler.sync(this); var t = this._interp.adaptivePredict(this._input, 11, this._ctx); switch (t) { case 1: this.enterOuterAlt(e, 1), this.state = 146, this._errHandler.sync(this); var i = 1; do { switch (i) { case 1: switch (this.state = 146, this._errHandler.sync(this), this._input.LA(1)) { case 43: this.state = 144, this.group(); break; case 8: case 17: case 55: case 57: case 62: case 63: this.state = 145, this.participant(); break; default: throw new K.error.NoViableAltException(this); } break; default: throw new K.error.NoViableAltException(this); } this.state = 148, this._errHandler.sync(this), i = this._interp.adaptivePredict(this._input, 8, this._ctx); } while (i != 2 && i != K.atn.ATN.INVALID_ALT_NUMBER); break; case 2: this.enterOuterAlt(e, 2), this.state = 154, this._errHandler.sync(this); for (var i = this._interp.adaptivePredict(this._input, 10, this._ctx); i != 2 && i != K.atn.ATN.INVALID_ALT_NUMBER; ) { if (i === 1) switch (this.state = 152, this._errHandler.sync(this), this._input.LA(1)) { case 43: this.state = 150, this.group(); break; case 8: case 17: case 55: case 57: case 62: case 63: this.state = 151, this.participant(); break; default: throw new K.error.NoViableAltException(this); } this.state = 156, this._errHandler.sync(this), i = this._interp.adaptivePredict(this._input, 10, this._ctx); } this.state = 157, this.starterExp(); break; } } catch (s) { if (s instanceof K.error.RecognitionException) e.exception = s, this._errHandler.reportError(this, s), this._errHandler.recover(this, s); else throw s; } finally { this.exitRule(); } return e; } group() { let e = new t6(this, this._ctx, this.state); this.enterRule(e, 6, Y.RULE_group); var t = 0; try { this.enterOuterAlt(e, 1), this.state = 160, this.match(Y.GROUP), this.state = 162, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 12, this._ctx); i === 1 && (this.state = 161, this.name()), this.state = 174, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 15, this._ctx); if (i === 1) { this.state = 164, this.match(Y.OBRACE), this.state = 168, this._errHandler.sync(this); for (var s = this._interp.adaptivePredict(this._input, 13, this._ctx); s != 2 && s != K.atn.ATN.INVALID_ALT_NUMBER; ) s === 1 && (this.state = 165, this.participant()), this.state = 170, this._errHandler.sync(this), s = this._interp.adaptivePredict(this._input, 13, this._ctx); this.state = 172, this._errHandler.sync(this), t = this._input.LA(1), t === 33 && (this.state = 171, this.match(Y.CBRACE)); } } catch (l) { if (l instanceof K.error.RecognitionException) e.exception = l, this._errHandler.reportError(this, l), this._errHandler.recover(this, l); else throw l; } finally { this.exitRule(); } return e; } starterExp() { let e = new Yc(this, this._ctx, this.state); this.enterRule(e, 8, Y.RULE_starterExp); var t = 0; try { switch (this.state = 185, this._errHandler.sync(this), this._input.LA(1)) { case 53: this.enterOuterAlt(e, 1), this.state = 176, this.match(Y.STARTER_LXR), this.state = 182, this._errHandler.sync(this), t = this._input.LA(1), t === 30 && (this.state = 177, this.match(Y.OPAR), this.state = 179, this._errHandler.sync(this), t = this._input.LA(1), (t - 57 & -32) == 0 && (1 << t - 57 & 97) !== 0 && (this.state = 178, this.starter()), this.state = 181, this.match(Y.CPAR)); break; case 55: this.enterOuterAlt(e, 2), this.state = 184, this.match(Y.ANNOTATION); break; default: throw new K.error.NoViableAltException(this); } } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } starter() { let e = new Vc(this, this._ctx, this.state); this.enterRule(e, 10, Y.RULE_starter); try { this.enterOuterAlt(e, 1), this.state = 187, this.name(); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } participant() { let e = new S0(this, this._ctx, this.state); this.enterRule(e, 12, Y.RULE_participant); var t = 0; try { this.state = 207, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 24, this._ctx); switch (i) { case 1: this.enterOuterAlt(e, 1), this.state = 190, this._errHandler.sync(this), t = this._input.LA(1), t === 55 && (this.state = 189, this.participantType()), this.state = 193, this._errHandler.sync(this), t = this._input.LA(1), (t === 8 || t === 17) && (this.state = 192, this.stereotype()), this.state = 195, this.name(), this.state = 197, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 21, this._ctx); i === 1 && (this.state = 196, this.width()), this.state = 200, this._errHandler.sync(this), t = this._input.LA(1), t === 48 && (this.state = 199, this.label()), this.state = 203, this._errHandler.sync(this), t = this._input.LA(1), t === 11 && (this.state = 202, this.match(Y.COLOR)); break; case 2: this.enterOuterAlt(e, 2), this.state = 205, this.stereotype(); break; case 3: this.enterOuterAlt(e, 3), this.state = 206, this.participantType(); break; } } catch (s) { if (s instanceof K.error.RecognitionException) e.exception = s, this._errHandler.reportError(this, s), this._errHandler.recover(this, s); else throw s; } finally { this.exitRule(); } return e; } stereotype() { let e = new qc(this, this._ctx, this.state); this.enterRule(e, 14, Y.RULE_stereotype); var t = 0; try { this.state = 222, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 27, this._ctx); switch (i) { case 1: this.enterOuterAlt(e, 1), this.state = 209, this.match(Y.SOPEN), this.state = 210, this.name(), this.state = 211, this.match(Y.SCLOSE); break; case 2: this.enterOuterAlt(e, 2), this.state = 213, this.match(Y.SOPEN), this.state = 214, this.name(), this.state = 216, this._errHandler.sync(this), t = this._input.LA(1), t === 16 && (this.state = 215, this.match(Y.GT)); break; case 3: this.enterOuterAlt(e, 3), this.state = 218, t = this._input.LA(1), t === 8 || t === 17 ? (this._errHandler.reportMatch(this), this.consume()) : this._errHandler.recoverInline(this), this.state = 220, this._errHandler.sync(this), t = this._input.LA(1), (t === 9 || t === 16) && (this.state = 219, t = this._input.LA(1), t === 9 || t === 16 ? (this._errHandler.reportMatch(this), this.consume()) : this._errHandler.recoverInline(this)); break; } } catch (s) { if (s instanceof K.error.RecognitionException) e.exception = s, this._errHandler.reportError(this, s), this._errHandler.recover(this, s); else throw s; } finally { this.exitRule(); } return e; } label() { let e = new Wc(this, this._ctx, this.state); this.enterRule(e, 16, Y.RULE_label); try { this.state = 227, this._errHandler.sync(this); var t = this._interp.adaptivePredict(this._input, 28, this._ctx); switch (t) { case 1: this.enterOuterAlt(e, 1), this.state = 224, this.match(Y.AS), this.state = 225, this.name(); break; case 2: this.enterOuterAlt(e, 2), this.state = 226, this.match(Y.AS); break; } } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } participantType() { let e = new $c(this, this._ctx, this.state); this.enterRule(e, 18, Y.RULE_participantType); try { this.enterOuterAlt(e, 1), this.state = 229, this.match(Y.ANNOTATION); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } name() { let e = new _3(this, this._ctx, this.state); this.enterRule(e, 20, Y.RULE_name); var t = 0; try { this.enterOuterAlt(e, 1), this.state = 231, t = this._input.LA(1), (t - 57 & -32) == 0 && (1 << t - 57 & 97) !== 0 ? (this._errHandler.reportMatch(this), this.consume()) : this._errHandler.recoverInline(this); } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } width() { let e = new Kc(this, this._ctx, this.state); this.enterRule(e, 22, Y.RULE_width); try { this.enterOuterAlt(e, 1), this.state = 233, this.match(Y.INT); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } block() { let e = new b6(this, this._ctx, this.state); this.enterRule(e, 24, Y.RULE_block); var t = 0; try { this.enterOuterAlt(e, 1), this.state = 236, this._errHandler.sync(this), t = this._input.LA(1); do this.state = 235, this.stat(), this.state = 238, this._errHandler.sync(this), t = this._input.LA(1); while ((t - 32 & -32) == 0 && (1 << t - 32 & 4265801661) !== 0 || t === 67); } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } ret() { let e = new Qc(this, this._ctx, this.state); this.enterRule(e, 26, Y.RULE_ret); var t = 0; try { switch (this.state = 252, this._errHandler.sync(this), this._input.LA(1)) { case 40: this.enterOuterAlt(e, 1), this.state = 240, this.match(Y.RETURN), this.state = 242, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 30, this._ctx); i === 1 && (this.state = 241, this.expr(0)), this.state = 245, this._errHandler.sync(this), t = this._input.LA(1), t === 27 && (this.state = 244, this.match(Y.SCOL)); break; case 54: this.enterOuterAlt(e, 2), this.state = 247, this.match(Y.ANNOTATION_RET), this.state = 248, this.asyncMessage(), this.state = 250, this._errHandler.sync(this), t = this._input.LA(1), t === 69 && (this.state = 249, this.match(Y.EVENT_END)); break; default: throw new K.error.NoViableAltException(this); } } catch (s) { if (s instanceof K.error.RecognitionException) e.exception = s, this._errHandler.reportError(this, s), this._errHandler.recover(this, s); else throw s; } finally { this.exitRule(); } return e; } divider() { let e = new jc(this, this._ctx, this.state); this.enterRule(e, 28, Y.RULE_divider); try { this.enterOuterAlt(e, 1), this.state = 254, this.dividerNote(); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } dividerNote() { let e = new Xc(this, this._ctx, this.state); this.enterRule(e, 30, Y.RULE_dividerNote); try { this.enterOuterAlt(e, 1), this.state = 256, this.match(Y.DIVIDER); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } stat() { let e = new n6(this, this._ctx, this.state); this.enterRule(e, 32, Y.RULE_stat); var t = 0; try { this.state = 274, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 35, this._ctx); switch (i) { case 1: this.enterOuterAlt(e, 1), this.state = 258, this.alt(); break; case 2: this.enterOuterAlt(e, 2), this.state = 259, this.par(); break; case 3: this.enterOuterAlt(e, 3), this.state = 260, this.opt(); break; case 4: this.enterOuterAlt(e, 4), this.state = 261, this.critical(); break; case 5: this.enterOuterAlt(e, 5), this.state = 262, this.section(); break; case 6: this.enterOuterAlt(e, 6), this.state = 263, this.ref(); break; case 7: this.enterOuterAlt(e, 7), this.state = 264, this.loop(); break; case 8: this.enterOuterAlt(e, 8), this.state = 265, this.creation(); break; case 9: this.enterOuterAlt(e, 9), this.state = 266, this.message(); break; case 10: this.enterOuterAlt(e, 10), this.state = 267, this.asyncMessage(), this.state = 269, this._errHandler.sync(this), t = this._input.LA(1), t === 69 && (this.state = 268, this.match(Y.EVENT_END)); break; case 11: this.enterOuterAlt(e, 11), this.state = 271, this.ret(); break; case 12: this.enterOuterAlt(e, 12), this.state = 272, this.divider(); break; case 13: this.enterOuterAlt(e, 13), this.state = 273, this.tcf(); break; } } catch (s) { if (s instanceof K.error.RecognitionException) e.exception = s, this._errHandler.reportError(this, s), this._errHandler.recover(this, s); else throw s; } finally { this.exitRule(); } return e; } par() { let e = new Jc(this, this._ctx, this.state); this.enterRule(e, 34, Y.RULE_par); try { this.state = 279, this._errHandler.sync(this); var t = this._interp.adaptivePredict(this._input, 36, this._ctx); switch (t) { case 1: this.enterOuterAlt(e, 1), this.state = 276, this.match(Y.PAR), this.state = 277, this.braceBlock(); break; case 2: this.enterOuterAlt(e, 2), this.state = 278, this.match(Y.PAR); break; } } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } opt() { let e = new eu(this, this._ctx, this.state); this.enterRule(e, 36, Y.RULE_opt); try { this.state = 284, this._errHandler.sync(this); var t = this._interp.adaptivePredict(this._input, 37, this._ctx); switch (t) { case 1: this.enterOuterAlt(e, 1), this.state = 281, this.match(Y.OPT), this.state = 282, this.braceBlock(); break; case 2: this.enterOuterAlt(e, 2), this.state = 283, this.match(Y.OPT); break; } } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } critical() { let e = new tu(this, this._ctx, this.state); this.enterRule(e, 38, Y.RULE_critical); var t = 0; try { this.state = 296, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 40, this._ctx); switch (i) { case 1: this.enterOuterAlt(e, 1), this.state = 286, this.match(Y.CRITICAL), this.state = 292, this._errHandler.sync(this), t = this._input.LA(1), t === 30 && (this.state = 287, this.match(Y.OPAR), this.state = 289, this._errHandler.sync(this), t = this._input.LA(1), (t - 34 & -32) == 0 && (1 << t - 34 & 1065353223) !== 0 && (this.state = 288, this.atom()), this.state = 291, this.match(Y.CPAR)), this.state = 294, this.braceBlock(); break; case 2: this.enterOuterAlt(e, 2), this.state = 295, this.match(Y.CRITICAL); break; } } catch (s) { if (s instanceof K.error.RecognitionException) e.exception = s, this._errHandler.reportError(this, s), this._errHandler.recover(this, s); else throw s; } finally { this.exitRule(); } return e; } section() { let e = new nu(this, this._ctx, this.state); this.enterRule(e, 40, Y.RULE_section); var t = 0; try { this.state = 309, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 43, this._ctx); switch (i) { case 1: this.enterOuterAlt(e, 1), this.state = 298, this.match(Y.SECTION), this.state = 304, this._errHandler.sync(this), t = this._input.LA(1), t === 30 && (this.state = 299, this.match(Y.OPAR), this.state = 301, this._errHandler.sync(this), t = this._input.LA(1), (t - 34 & -32) == 0 && (1 << t - 34 & 1065353223) !== 0 && (this.state = 300, this.atom()), this.state = 303, this.match(Y.CPAR)), this.state = 306, this.braceBlock(); break; case 2: this.enterOuterAlt(e, 2), this.state = 307, this.braceBlock(); break; case 3: this.enterOuterAlt(e, 3), this.state = 308, this.match(Y.SECTION); break; } } catch (s) { if (s instanceof K.error.RecognitionException) e.exception = s, this._errHandler.reportError(this, s), this._errHandler.recover(this, s); else throw s; } finally { this.exitRule(); } return e; } creation() { let e = new x6(this, this._ctx, this.state); this.enterRule(e, 42, Y.RULE_creation); try { this.enterOuterAlt(e, 1), this.state = 311, this.creationBody(), this.state = 314, this._errHandler.sync(this); var t = this._interp.adaptivePredict(this._input, 44, this._ctx); t === 1 ? (this.state = 312, this.match(Y.SCOL)) : t === 2 && (this.state = 313, this.braceBlock()); } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } ref() { let e = new iu(this, this._ctx, this.state); this.enterRule(e, 44, Y.RULE_ref); var t = 0; try { for (this.enterOuterAlt(e, 1), this.state = 316, this.match(Y.REF), this.state = 317, this.match(Y.OPAR), this.state = 318, this.name(), this.state = 328, this._errHandler.sync(this), t = this._input.LA(1); t === 28; ) { for (this.state = 319, this.match(Y.COMMA), this.state = 323, this._errHandler.sync(this), t = this._input.LA(1); (t - 57 & -32) == 0 && (1 << t - 57 & 97) !== 0; ) this.state = 320, this.name(), this.state = 325, this._errHandler.sync(this), t = this._input.LA(1); this.state = 330, this._errHandler.sync(this), t = this._input.LA(1); } this.state = 331, this.match(Y.CPAR), this.state = 333, this._errHandler.sync(this), t = this._input.LA(1), t === 27 && (this.state = 332, this.match(Y.SCOL)); } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } creationBody() { let e = new ru(this, this._ctx, this.state); this.enterRule(e, 46, Y.RULE_creationBody); var t = 0; try { this.state = 351, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 52, this._ctx); switch (i) { case 1: this.enterOuterAlt(e, 1), this.state = 336, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 48, this._ctx); i === 1 && (this.state = 335, this.assignment()), this.state = 338, this.match(Y.NEW), this.state = 339, this.construct(), this.state = 345, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 50, this._ctx); i === 1 && (this.state = 340, this.match(Y.OPAR), this.state = 342, this._errHandler.sync(this), t = this._input.LA(1), ((t & -32) == 0 && (1 << t & 1142947840) !== 0 || (t - 34 & -32) == 0 && (1 << t - 34 & 1065353351) !== 0) && (this.state = 341, this.parameters()), this.state = 344, this.match(Y.CPAR)); break; case 2: this.enterOuterAlt(e, 2), this.state = 348, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 51, this._ctx); i === 1 && (this.state = 347, this.assignment()), this.state = 350, this.match(Y.NEW); break; } } catch (s) { if (s instanceof K.error.RecognitionException) e.exception = s, this._errHandler.reportError(this, s), this._errHandler.recover(this, s); else throw s; } finally { this.exitRule(); } return e; } message() { let e = new au(this, this._ctx, this.state); this.enterRule(e, 48, Y.RULE_message); try { this.enterOuterAlt(e, 1), this.state = 353, this.messageBody(), this.state = 356, this._errHandler.sync(this); var t = this._interp.adaptivePredict(this._input, 53, this._ctx); t === 1 ? (this.state = 354, this.match(Y.SCOL)) : t === 2 && (this.state = 355, this.braceBlock()); } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } messageBody() { let e = new su(this, this._ctx, this.state); this.enterRule(e, 50, Y.RULE_messageBody); try { this.state = 371, this._errHandler.sync(this); var t = this._interp.adaptivePredict(this._input, 57, this._ctx); switch (t) { case 1: this.enterOuterAlt(e, 1), this.state = 358, this.assignment(), this.state = 364, this._errHandler.sync(this); var t = this._interp.adaptivePredict(this._input, 55, this._ctx); if (t === 1) { this.state = 359, this.fromTo(), this.state = 361, this._errHandler.sync(this); var t = this._interp.adaptivePredict(this._input, 54, this._ctx); t === 1 && (this.state = 360, this.func()); } else t === 2 && (this.state = 363, this.func()); break; case 2: this.enterOuterAlt(e, 2), this.state = 366, this.fromTo(), this.state = 368, this._errHandler.sync(this); var t = this._interp.adaptivePredict(this._input, 56, this._ctx); t === 1 && (this.state = 367, this.func()); break; case 3: this.enterOuterAlt(e, 3), this.state = 370, this.func(); break; } } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } fromTo() { let e = new ou(this, this._ctx, this.state); this.enterRule(e, 52, Y.RULE_fromTo); try { this.enterOuterAlt(e, 1), this.state = 376, this._errHandler.sync(this); var t = this._interp.adaptivePredict(this._input, 58, this._ctx); t === 1 && (this.state = 373, this.from(), this.state = 374, this.match(Y.ARROW)), this.state = 378, this.to(), this.state = 379, this.match(Y.DOT); } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } func() { let e = new w6(this, this._ctx, this.state); this.enterRule(e, 54, Y.RULE_func); try { this.enterOuterAlt(e, 1), this.state = 381, this.signature(), this.state = 386, this._errHandler.sync(this); for (var t = this._interp.adaptivePredict(this._input, 59, this._ctx); t != 2 && t != K.atn.ATN.INVALID_ALT_NUMBER; ) t === 1 && (this.state = 382, this.match(Y.DOT), this.state = 383, this.signature()), this.state = 388, this._errHandler.sync(this), t = this._interp.adaptivePredict(this._input, 59, this._ctx); } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } from() { let e = new M6(this, this._ctx, this.state); this.enterRule(e, 56, Y.RULE_from); try { this.enterOuterAlt(e, 1), this.state = 389, this.name(); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } to() { let e = new cn(this, this._ctx, this.state); this.enterRule(e, 58, Y.RULE_to); try { this.enterOuterAlt(e, 1), this.state = 391, this.name(); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } signature() { let e = new i6(this, this._ctx, this.state); this.enterRule(e, 60, Y.RULE_signature); try { this.enterOuterAlt(e, 1), this.state = 393, this.methodName(), this.state = 395, this._errHandler.sync(this); var t = this._interp.adaptivePredict(this._input, 60, this._ctx); t === 1 && (this.state = 394, this.invocation()); } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } invocation() { let e = new A6(this, this._ctx, this.state); this.enterRule(e, 62, Y.RULE_invocation); var t = 0; try { this.enterOuterAlt(e, 1), this.state = 397, this.match(Y.OPAR), this.state = 399, this._errHandler.sync(this), t = this._input.LA(1), ((t & -32) == 0 && (1 << t & 1142947840) !== 0 || (t - 34 & -32) == 0 && (1 << t - 34 & 1065353351) !== 0) && (this.state = 398, this.parameters()), this.state = 401, this.match(Y.CPAR); } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } assignment() { let e = new un(this, this._ctx, this.state); this.enterRule(e, 64, Y.RULE_assignment); try { this.enterOuterAlt(e, 1), this.state = 404, this._errHandler.sync(this); var t = this._interp.adaptivePredict(this._input, 62, this._ctx); t === 1 && (this.state = 403, this.type()), this.state = 406, this.assignee(), this.state = 407, this.match(Y.ASSIGN); } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } asyncMessage() { let e = new y6(this, this._ctx, this.state); this.enterRule(e, 66, Y.RULE_asyncMessage); var t = 0; try { this.state = 424, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 66, this._ctx); switch (i) { case 1: this.enterOuterAlt(e, 1), this.state = 412, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 63, this._ctx); i === 1 && (this.state = 409, this.from(), this.state = 410, this.match(Y.ARROW)), this.state = 414, this.to(), this.state = 415, this.match(Y.COL), this.state = 417, this._errHandler.sync(this), t = this._input.LA(1), t === 68 && (this.state = 416, this.content()); break; case 2: this.enterOuterAlt(e, 2), this.state = 419, this.from(), this.state = 420, t = this._input.LA(1), t === 10 || t === 21 ? (this._errHandler.reportMatch(this), this.consume()) : this._errHandler.recoverInline(this), this.state = 422, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 65, this._ctx); i === 1 && (this.state = 421, this.to()); break; } } catch (s) { if (s instanceof K.error.RecognitionException) e.exception = s, this._errHandler.reportError(this, s), this._errHandler.recover(this, s); else throw s; } finally { this.exitRule(); } return e; } content() { let e = new lu(this, this._ctx, this.state); this.enterRule(e, 68, Y.RULE_content); try { this.enterOuterAlt(e, 1), this.state = 426, this.match(Y.EVENT_PAYLOAD_LXR); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } construct() { let e = new cu(this, this._ctx, this.state); this.enterRule(e, 70, Y.RULE_construct); try { this.enterOuterAlt(e, 1), this.state = 428, this.name(); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } type() { let e = new N6(this, this._ctx, this.state); this.enterRule(e, 72, Y.RULE_type); try { this.enterOuterAlt(e, 1), this.state = 430, this.name(); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } assignee() { let e = new uu(this, this._ctx, this.state); this.enterRule(e, 74, Y.RULE_assignee); var t = 0; try { this.state = 444, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 68, this._ctx); switch (i) { case 1: this.enterOuterAlt(e, 1), this.state = 432, this.atom(); break; case 2: for (this.enterOuterAlt(e, 2), this.state = 433, this.match(Y.ID), this.state = 438, this._errHandler.sync(this), t = this._input.LA(1); t === 28; ) this.state = 434, this.match(Y.COMMA), this.state = 435, this.match(Y.ID), this.state = 440, this._errHandler.sync(this), t = this._input.LA(1); break; case 3: this.enterOuterAlt(e, 3), this.state = 441, this.match(Y.CSTRING); break; case 4: this.enterOuterAlt(e, 4), this.state = 442, this.match(Y.USTRING); break; case 5: this.enterOuterAlt(e, 5), this.state = 443, this.match(Y.NEW); break; } } catch (s) { if (s instanceof K.error.RecognitionException) e.exception = s, this._errHandler.reportError(this, s), this._errHandler.recover(this, s); else throw s; } finally { this.exitRule(); } return e; } methodName() { let e = new du(this, this._ctx, this.state); this.enterRule(e, 76, Y.RULE_methodName); try { this.enterOuterAlt(e, 1), this.state = 446, this.name(); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } parameters() { let e = new O6(this, this._ctx, this.state); this.enterRule(e, 78, Y.RULE_parameters); var t = 0; try { this.enterOuterAlt(e, 1), this.state = 448, this.parameter(), this.state = 453, this._errHandler.sync(this); for (var i = this._interp.adaptivePredict(this._input, 69, this._ctx); i != 2 && i != K.atn.ATN.INVALID_ALT_NUMBER; ) i === 1 && (this.state = 449, this.match(Y.COMMA), this.state = 450, this.parameter()), this.state = 455, this._errHandler.sync(this), i = this._interp.adaptivePredict(this._input, 69, this._ctx); this.state = 457, this._errHandler.sync(this), t = this._input.LA(1), t === 28 && (this.state = 456, this.match(Y.COMMA)); } catch (s) { if (s instanceof K.error.RecognitionException) e.exception = s, this._errHandler.reportError(this, s), this._errHandler.recover(this, s); else throw s; } finally { this.exitRule(); } return e; } parameter() { let e = new r6(this, this._ctx, this.state); this.enterRule(e, 80, Y.RULE_parameter); try { this.state = 462, this._errHandler.sync(this); var t = this._interp.adaptivePredict(this._input, 71, this._ctx); switch (t) { case 1: this.enterOuterAlt(e, 1), this.state = 459, this.namedParameter(); break; case 2: this.enterOuterAlt(e, 2), this.state = 460, this.declaration(); break; case 3: this.enterOuterAlt(e, 3), this.state = 461, this.expr(0); break; } } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } namedParameter() { let e = new Lu(this, this._ctx, this.state); this.enterRule(e, 82, Y.RULE_namedParameter); var t = 0; try { this.enterOuterAlt(e, 1), this.state = 464, this.match(Y.ID), this.state = 465, this.match(Y.ASSIGN), this.state = 467, this._errHandler.sync(this), t = this._input.LA(1), ((t & -32) == 0 && (1 << t & 1142947840) !== 0 || (t - 34 & -32) == 0 && (1 << t - 34 & 1065353351) !== 0) && (this.state = 466, this.expr(0)); } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } declaration() { let e = new Cu(this, this._ctx, this.state); this.enterRule(e, 84, Y.RULE_declaration); try { this.enterOuterAlt(e, 1), this.state = 469, this.type(), this.state = 470, this.match(Y.ID); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } tcf() { let e = new _u(this, this._ctx, this.state); this.enterRule(e, 86, Y.RULE_tcf); var t = 0; try { for (this.enterOuterAlt(e, 1), this.state = 472, this.tryBlock(), this.state = 476, this._errHandler.sync(this), t = this._input.LA(1); t === 50; ) this.state = 473, this.catchBlock(), this.state = 478, this._errHandler.sync(this), t = this._input.LA(1); this.state = 480, this._errHandler.sync(this), t = this._input.LA(1), t === 51 && (this.state = 479, this.finallyBlock()); } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } tryBlock() { let e = new gu(this, this._ctx, this.state); this.enterRule(e, 88, Y.RULE_tryBlock); try { this.enterOuterAlt(e, 1), this.state = 482, this.match(Y.TRY), this.state = 483, this.braceBlock(); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } catchBlock() { let e = new a6(this, this._ctx, this.state); this.enterRule(e, 90, Y.RULE_catchBlock); var t = 0; try { this.enterOuterAlt(e, 1), this.state = 485, this.match(Y.CATCH), this.state = 487, this._errHandler.sync(this), t = this._input.LA(1), t === 30 && (this.state = 486, this.invocation()), this.state = 489, this.braceBlock(); } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } finallyBlock() { let e = new pu(this, this._ctx, this.state); this.enterRule(e, 92, Y.RULE_finallyBlock); try { this.enterOuterAlt(e, 1), this.state = 491, this.match(Y.FINALLY), this.state = 492, this.braceBlock(); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } alt() { let e = new mu(this, this._ctx, this.state); this.enterRule(e, 94, Y.RULE_alt); var t = 0; try { this.enterOuterAlt(e, 1), this.state = 494, this.ifBlock(), this.state = 498, this._errHandler.sync(this); for (var i = this._interp.adaptivePredict(this._input, 76, this._ctx); i != 2 && i != K.atn.ATN.INVALID_ALT_NUMBER; ) i === 1 && (this.state = 495, this.elseIfBlock()), this.state = 500, this._errHandler.sync(this), i = this._interp.adaptivePredict(this._input, 76, this._ctx); this.state = 502, this._errHandler.sync(this), t = this._input.LA(1), t === 38 && (this.state = 501, this.elseBlock()); } catch (s) { if (s instanceof K.error.RecognitionException) e.exception = s, this._errHandler.reportError(this, s), this._errHandler.recover(this, s); else throw s; } finally { this.exitRule(); } return e; } ifBlock() { let e = new hu(this, this._ctx, this.state); this.enterRule(e, 96, Y.RULE_ifBlock); try { this.enterOuterAlt(e, 1), this.state = 504, this.match(Y.IF), this.state = 505, this.parExpr(), this.state = 506, this.braceBlock(); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } elseIfBlock() { let e = new s6(this, this._ctx, this.state); this.enterRule(e, 98, Y.RULE_elseIfBlock); try { this.enterOuterAlt(e, 1), this.state = 508, this.match(Y.ELSE), this.state = 509, this.match(Y.IF), this.state = 510, this.parExpr(), this.state = 511, this.braceBlock(); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } elseBlock() { let e = new fu(this, this._ctx, this.state); this.enterRule(e, 100, Y.RULE_elseBlock); try { this.enterOuterAlt(e, 1), this.state = 513, this.match(Y.ELSE), this.state = 514, this.braceBlock(); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } braceBlock() { let e = new e3(this, this._ctx, this.state); this.enterRule(e, 102, Y.RULE_braceBlock); var t = 0; try { this.enterOuterAlt(e, 1), this.state = 516, this.match(Y.OBRACE), this.state = 518, this._errHandler.sync(this), t = this._input.LA(1), ((t - 32 & -32) == 0 && (1 << t - 32 & 4265801661) !== 0 || t === 67) && (this.state = 517, this.block()), this.state = 520, this.match(Y.CBRACE); } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } loop() { let e = new Eu(this, this._ctx, this.state); this.enterRule(e, 104, Y.RULE_loop); var t = 0; try { this.enterOuterAlt(e, 1), this.state = 522, this.match(Y.WHILE), this.state = 524, this._errHandler.sync(this), t = this._input.LA(1), t === 30 && (this.state = 523, this.parExpr()), this.state = 527, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 80, this._ctx); i === 1 && (this.state = 526, this.braceBlock()); } catch (s) { if (s instanceof K.error.RecognitionException) e.exception = s, this._errHandler.reportError(this, s), this._errHandler.recover(this, s); else throw s; } finally { this.exitRule(); } return e; } expr(e) { e === void 0 && (e = 0); const t = this._ctx, i = this.state; let s = new $2(this, this._ctx, i), l = s; const c = 106; this.enterRecursionRule(s, 106, Y.RULE_expr, e); var d = 0; try { this.enterOuterAlt(s, 1), this.state = 549, this._errHandler.sync(this); var L = this._interp.adaptivePredict(this._input, 82, this._ctx); switch (L) { case 1: s = new $E(this, s), this._ctx = s, l = s, this.state = 530, this.atom(); break; case 2: s = new eS(this, s), this._ctx = s, l = s, this.state = 531, this.match(Y.MINUS), this.state = 532, this.expr(13); break; case 3: s = new JE(this, s), this._ctx = s, l = s, this.state = 533, this.match(Y.NOT), this.state = 534, this.expr(12); break; case 4: s = new WE(this, s), this._ctx = s, l = s, this.state = 538, this._errHandler.sync(this); var L = this._interp.adaptivePredict(this._input, 81, this._ctx); L === 1 && (this.state = 535, this.to(), this.state = 536, this.match(Y.DOT)), this.state = 540, this.func(); break; case 5: s = new tS(this, s), this._ctx = s, l = s, this.state = 541, this.creation(); break; case 6: s = new nS(this, s), this._ctx = s, l = s, this.state = 542, this.match(Y.OPAR), this.state = 543, this.expr(0), this.state = 544, this.match(Y.CPAR); break; case 7: s = new qE(this, s), this._ctx = s, l = s, this.state = 546, this.assignment(), this.state = 547, this.expr(1); break; } this._ctx.stop = this._input.LT(-1), this.state = 574, this._errHandler.sync(this); for (var _ = this._interp.adaptivePredict(this._input, 84, this._ctx); _ != 2 && _ != K.atn.ATN.INVALID_ALT_NUMBER; ) { if (_ === 1) { this._parseListeners !== null && this.triggerExitRuleEvent(), l = s, this.state = 572, this._errHandler.sync(this); var L = this._interp.adaptivePredict(this._input, 83, this._ctx); switch (L) { case 1: if (s = new iS(this, new $2(this, t, i)), this.pushNewRecursionContext(s, c, Y.RULE_expr), this.state = 551, !this.precpred(this._ctx, 11)) throw new K.error.FailedPredicateException(this, "this.precpred(this._ctx, 11)"); this.state = 552, s.op = this._input.LT(1), d = this._input.LA(1), (d & -32) == 0 && (1 << d & 29360128) !== 0 ? (this._errHandler.reportMatch(this), this.consume()) : s.op = this._errHandler.recoverInline(this), this.state = 553, this.expr(12); break; case 2: if (s = new QE(this, new $2(this, t, i)), this.pushNewRecursionContext(s, c, Y.RULE_expr), this.state = 554, !this.precpred(this._ctx, 10)) throw new K.error.FailedPredicateException(this, "this.precpred(this._ctx, 10)"); this.state = 555, s.op = this._input.LT(1), d = this._input.LA(1), d === 20 || d === 21 ? (this._errHandler.reportMatch(this), this.consume()) : s.op = this._errHandler.recoverInline(this), this.state = 556, this.expr(11); break; case 3: if (s = new jE(this, new $2(this, t, i)), this.pushNewRecursionContext(s, c, Y.RULE_expr), this.state = 557, !this.precpred(this._ctx, 9)) throw new K.error.FailedPredicateException(this, "this.precpred(this._ctx, 9)"); this.state = 558, s.op = this._input.LT(1), d = this._input.LA(1), (d & -32) == 0 && (1 << d & 983040) !== 0 ? (this._errHandler.reportMatch(this), this.consume()) : s.op = this._errHandler.recoverInline(this), this.state = 559, this.expr(10); break; case 4: if (s = new rS(this, new $2(this, t, i)), this.pushNewRecursionContext(s, c, Y.RULE_expr), this.state = 560, !this.precpred(this._ctx, 8)) throw new K.error.FailedPredicateException(this, "this.precpred(this._ctx, 8)"); this.state = 561, s.op = this._input.LT(1), d = this._input.LA(1), d === 14 || d === 15 ? (this._errHandler.reportMatch(this), this.consume()) : s.op = this._errHandler.recoverInline(this), this.state = 562, this.expr(9); break; case 5: if (s = new aS(this, new $2(this, t, i)), this.pushNewRecursionContext(s, c, Y.RULE_expr), this.state = 563, !this.precpred(this._ctx, 7)) throw new K.error.FailedPredicateException(this, "this.precpred(this._ctx, 7)"); this.state = 564, this.match(Y.AND), this.state = 565, this.expr(8); break; case 6: if (s = new KE(this, new $2(this, t, i)), this.pushNewRecursionContext(s, c, Y.RULE_expr), this.state = 566, !this.precpred(this._ctx, 6)) throw new K.error.FailedPredicateException(this, "this.precpred(this._ctx, 6)"); this.state = 567, this.match(Y.OR), this.state = 568, this.expr(7); break; case 7: if (s = new XE(this, new $2(this, t, i)), this.pushNewRecursionContext(s, c, Y.RULE_expr), this.state = 569, !this.precpred(this._ctx, 5)) throw new K.error.FailedPredicateException(this, "this.precpred(this._ctx, 5)"); this.state = 570, this.match(Y.PLUS), this.state = 571, this.expr(6); break; } } this.state = 576, this._errHandler.sync(this), _ = this._interp.adaptivePredict(this._input, 84, this._ctx); } } catch (p) { if (p instanceof K.error.RecognitionException) s.exception = p, this._errHandler.reportError(this, p), this._errHandler.recover(this, p); else throw p; } finally { this.unrollRecursionContexts(t); } return s; } atom() { let e = new g3(this, this._ctx, this.state); this.enterRule(e, 108, Y.RULE_atom); var t = 0; try { switch (this.state = 584, this._errHandler.sync(this), this._input.LA(1)) { case 58: case 59: e = new dS(this, e), this.enterOuterAlt(e, 1), this.state = 577, t = this._input.LA(1), t === 58 || t === 59 ? (this._errHandler.reportMatch(this), this.consume()) : this._errHandler.recoverInline(this); break; case 61: e = new LS(this, e), this.enterOuterAlt(e, 2), this.state = 578, this.match(Y.NUMBER_UNIT); break; case 60: e = new lS(this, e), this.enterOuterAlt(e, 3), this.state = 579, this.match(Y.MONEY); break; case 34: case 35: e = new sS(this, e), this.enterOuterAlt(e, 4), this.state = 580, t = this._input.LA(1), t === 34 || t === 35 ? (this._errHandler.reportMatch(this), this.consume()) : this._errHandler.recoverInline(this); break; case 57: e = new oS(this, e), this.enterOuterAlt(e, 5), this.state = 581, this.match(Y.ID); break; case 62: case 63: e = new cS(this, e), this.enterOuterAlt(e, 6), this.state = 582, t = this._input.LA(1), t === 62 || t === 63 ? (this._errHandler.reportMatch(this), this.consume()) : this._errHandler.recoverInline(this); break; case 36: e = new uS(this, e), this.enterOuterAlt(e, 7), this.state = 583, this.match(Y.NIL); break; default: throw new K.error.NoViableAltException(this); } } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } parExpr() { let e = new dn(this, this._ctx, this.state); this.enterRule(e, 110, Y.RULE_parExpr); var t = 0; try { this.enterOuterAlt(e, 1), this.state = 586, this.match(Y.OPAR), this.state = 588, this._errHandler.sync(this); var i = this._interp.adaptivePredict(this._input, 86, this._ctx); i === 1 && (this.state = 587, this.condition()), this.state = 591, this._errHandler.sync(this), t = this._input.LA(1), t === 31 && (this.state = 590, this.match(Y.CPAR)); } catch (s) { if (s instanceof K.error.RecognitionException) e.exception = s, this._errHandler.reportError(this, s), this._errHandler.recover(this, s); else throw s; } finally { this.exitRule(); } return e; } condition() { let e = new Su(this, this._ctx, this.state); this.enterRule(e, 112, Y.RULE_condition); try { this.state = 596, this._errHandler.sync(this); var t = this._interp.adaptivePredict(this._input, 88, this._ctx); switch (t) { case 1: this.enterOuterAlt(e, 1), this.state = 593, this.atom(); break; case 2: this.enterOuterAlt(e, 2), this.state = 594, this.expr(0); break; case 3: this.enterOuterAlt(e, 3), this.state = 595, this.inExpr(); break; } } catch (i) { if (i instanceof K.error.RecognitionException) e.exception = i, this._errHandler.reportError(this, i), this._errHandler.recover(this, i); else throw i; } finally { this.exitRule(); } return e; } inExpr() { let e = new Tu(this, this._ctx, this.state); this.enterRule(e, 114, Y.RULE_inExpr); try { this.enterOuterAlt(e, 1), this.state = 598, this.match(Y.ID), this.state = 599, this.match(Y.IN), this.state = 600, this.match(Y.ID); } catch (t) { if (t instanceof K.error.RecognitionException) e.exception = t, this._errHandler.reportError(this, t), this._errHandler.recover(this, t); else throw t; } finally { this.exitRule(); } return e; } }; h2(Y, "grammarFileName", "java-escape"), h2(Y, "literalNames", [ null, null, "'const'", "'readonly'", "'static'", "'await'", "'title'", "':'", "'<<'", "'>>'", "'->'", null, "'||'", "'&&'", "'=='", "'!='", "'>'", "'<'", "'>='", "'<='", "'+'", "'-'", "'*'", "'/'", "'%'", "'^'", "'!'", "';'", "','", "'='", "'('", "')'", "'{'", "'}'", "'true'", "'false'", null, "'if'", "'else'", null, "'return'", "'new'", "'par'", "'group'", "'opt'", "'critical'", null, "'ref'", "'as'", "'try'", "'catch'", "'finally'", "'in'", null, null, null, "'.'" ]), h2(Y, "symbolicNames", [ null, "WS", "CONSTANT", "READONLY", "STATIC", "AWAIT", "TITLE", "COL", "SOPEN", "SCLOSE", "ARROW", "COLOR", "OR", "AND", "EQ", "NEQ", "GT", "LT", "GTEQ", "LTEQ", "PLUS", "MINUS", "MULT", "DIV", "MOD", "POW", "NOT", "SCOL", "COMMA", "ASSIGN", "OPAR", "CPAR", "OBRACE", "CBRACE", "TRUE", "FALSE", "NIL", "IF", "ELSE", "WHILE", "RETURN", "NEW", "PAR", "GROUP", "OPT", "CRITICAL", "SECTION", "REF", "AS", "TRY", "CATCH", "FINALLY", "IN", "STARTER_LXR", "ANNOTATION_RET", "ANNOTATION", "DOT", "ID", "INT", "FLOAT", "MONEY", "NUMBER_UNIT", "CSTRING", "USTRING", "CR", "COMMENT", "OTHER", "DIVIDER", "EVENT_PAYLOAD_LXR", "EVENT_END", "TITLE_CONTENT", "TITLE_END" ]), h2(Y, "ruleNames", [ "prog", "title", "head", "group", "starterExp", "starter", "participant", "stereotype", "label", "participantType", "name", "width", "block", "ret", "divider", "dividerNote", "stat", "par", "opt", "critical", "section", "creation", "ref", "creationBody", "message", "messageBody", "fromTo", "func", "from", "to", "signature", "invocation", "assignment", "asyncMessage", "content", "construct", "type", "assignee", "methodName", "parameters", "parameter", "namedParameter", "declaration", "tcf", "tryBlock", "catchBlock", "finallyBlock", "alt", "ifBlock", "elseIfBlock", "elseBlock", "braceBlock", "loop", "expr", "atom", "parExpr", "condition", "inExpr" ]); let T = Y; T.EOF = K.Token.EOF; T.WS = 1; T.CONSTANT = 2; T.READONLY = 3; T.STATIC = 4; T.AWAIT = 5; T.TITLE = 6; T.COL = 7; T.SOPEN = 8; T.SCLOSE = 9; T.ARROW = 10; T.COLOR = 11; T.OR = 12; T.AND = 13; T.EQ = 14; T.NEQ = 15; T.GT = 16; T.LT = 17; T.GTEQ = 18; T.LTEQ = 19; T.PLUS = 20; T.MINUS = 21; T.MULT = 22; T.DIV = 23; T.MOD = 24; T.POW = 25; T.NOT = 26; T.SCOL = 27; T.COMMA = 28; T.ASSIGN = 29; T.OPAR = 30; T.CPAR = 31; T.OBRACE = 32; T.CBRACE = 33; T.TRUE = 34; T.FALSE = 35; T.NIL = 36; T.IF = 37; T.ELSE = 38; T.WHILE = 39; T.RETURN = 40; T.NEW = 41; T.PAR = 42; T.GROUP = 43; T.OPT = 44; T.CRITICAL = 45; T.SECTION = 46; T.REF = 47; T.AS = 48; T.TRY = 49; T.CATCH = 50; T.FINALLY = 51; T.IN = 52; T.STARTER_LXR = 53; T.ANNOTATION_RET = 54; T.ANNOTATION = 55; T.DOT = 56; T.ID = 57; T.INT = 58; T.FLOAT = 59; T.MONEY = 60; T.NUMBER_UNIT = 61; T.CSTRING = 62; T.USTRING = 63; T.CR = 64; T.COMMENT = 65; T.OTHER = 66; T.DIVIDER = 67; T.EVENT_PAYLOAD_LXR = 68; T.EVENT_END = 69; T.TITLE_CONTENT = 70; T.TITLE_END = 71; T.RULE_prog = 0; T.RULE_title = 1; T.RULE_head = 2; T.RULE_group = 3; T.RULE_starterExp = 4; T.RULE_starter = 5; T.RULE_participant = 6; T.RULE_stereotype = 7; T.RULE_label = 8; T.RULE_participantType = 9; T.RULE_name = 10; T.RULE_width = 11; T.RULE_block = 12; T.RULE_ret = 13; T.RULE_divider = 14; T.RULE_dividerNote = 15; T.RULE_stat = 16; T.RULE_par = 17; T.RULE_opt = 18; T.RULE_critical = 19; T.RULE_section = 20; T.RULE_creation = 21; T.RULE_ref = 22; T.RULE_creationBody = 23; T.RULE_message = 24; T.RULE_messageBody = 25; T.RULE_fromTo = 26; T.RULE_func = 27; T.RULE_from = 28; T.RULE_to = 29; T.RULE_signature = 30; T.RULE_invocation = 31; T.RULE_assignment = 32; T.RULE_asyncMessage = 33; T.RULE_content = 34; T.RULE_construct = 35; T.RULE_type = 36; T.RULE_assignee = 37; T.RULE_methodName = 38; T.RULE_parameters = 39; T.RULE_parameter = 40; T.RULE_namedParameter = 41; T.RULE_declaration = 42; T.RULE_tcf = 43; T.RULE_tryBlock = 44; T.RULE_catchBlock = 45; T.RULE_finallyBlock = 46; T.RULE_alt = 47; T.RULE_ifBlock = 48; T.RULE_elseIfBlock = 49; T.RULE_elseBlock = 50; T.RULE_braceBlock = 51; T.RULE_loop = 52; T.RULE_expr = 53; T.RULE_atom = 54; T.RULE_parExpr = 55; T.RULE_condition = 56; T.RULE_inExpr = 57; let VE = class extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_prog; } EOF() { return this.getToken(T.EOF, 0); } title() { return this.getTypedRuleContext(zc, 0); } head() { return this.getTypedRuleContext(Hc, 0); } block() { return this.getTypedRuleContext(b6, 0); } enterRule(e) { e instanceof X && e.enterProg(this); } exitRule(e) { e instanceof X && e.exitProg(this); } }, zc = class extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_title; } TITLE() { return this.getToken(T.TITLE, 0); } TITLE_CONTENT() { return this.getToken(T.TITLE_CONTENT, 0); } TITLE_END() { return this.getToken(T.TITLE_END, 0); } enterRule(e) { e instanceof X && e.enterTitle(this); } exitRule(e) { e instanceof X && e.exitTitle(this); } }; class Hc extends K.ParserRuleContext { constructor(t, i, s) { i === void 0 && (i = null), s == null && (s = -1); super(i, s); h2(this, "group", function(t) { return t === void 0 && (t = null), t === null ? this.getTypedRuleContexts(t6) : this.getTypedRuleContext(t6, t); }); h2(this, "participant", function(t) { return t === void 0 && (t = null), t === null ? this.getTypedRuleContexts(S0) : this.getTypedRuleContext(S0, t); }); this.parser = t, this.ruleIndex = T.RULE_head; } starterExp() { return this.getTypedRuleContext(Yc, 0); } enterRule(t) { t instanceof X && t.enterHead(this); } exitRule(t) { t instanceof X && t.exitHead(this); } } let t6 = class extends K.ParserRuleContext { constructor(t, i, s) { i === void 0 && (i = null), s == null && (s = -1); super(i, s); h2(this, "participant", function(t) { return t === void 0 && (t = null), t === null ? this.getTypedRuleContexts(S0) : this.getTypedRuleContext(S0, t); }); this.parser = t, this.ruleIndex = T.RULE_group; } GROUP() { return this.getToken(T.GROUP, 0); } name() { return this.getTypedRuleContext(_3, 0); } OBRACE() { return this.getToken(T.OBRACE, 0); } CBRACE() { return this.getToken(T.CBRACE, 0); } enterRule(t) { t instanceof X && t.enterGroup(this); } exitRule(t) { t instanceof X && t.exitGroup(this); } }; class Yc extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_starterExp; } STARTER_LXR() { return this.getToken(T.STARTER_LXR, 0); } OPAR() { return this.getToken(T.OPAR, 0); } CPAR() { return this.getToken(T.CPAR, 0); } starter() { return this.getTypedRuleContext(Vc, 0); } ANNOTATION() { return this.getToken(T.ANNOTATION, 0); } enterRule(e) { e instanceof X && e.enterStarterExp(this); } exitRule(e) { e instanceof X && e.exitStarterExp(this); } } class Vc extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_starter; } name() { return this.getTypedRuleContext(_3, 0); } enterRule(e) { e instanceof X && e.enterStarter(this); } exitRule(e) { e instanceof X && e.exitStarter(this); } } let S0 = class extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_participant; } name() { return this.getTypedRuleContext(_3, 0); } participantType() { return this.getTypedRuleContext($c, 0); } stereotype() { return this.getTypedRuleContext(qc, 0); } width() { return this.getTypedRuleContext(Kc, 0); } label() { return this.getTypedRuleContext(Wc, 0); } COLOR() { return this.getToken(T.COLOR, 0); } enterRule(e) { e instanceof X && e.enterParticipant(this); } exitRule(e) { e instanceof X && e.exitParticipant(this); } }; class qc extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_stereotype; } SOPEN() { return this.getToken(T.SOPEN, 0); } name() { return this.getTypedRuleContext(_3, 0); } SCLOSE() { return this.getToken(T.SCLOSE, 0); } GT() { return this.getToken(T.GT, 0); } LT() { return this.getToken(T.LT, 0); } enterRule(e) { e instanceof X && e.enterStereotype(this); } exitRule(e) { e instanceof X && e.exitStereotype(this); } } class Wc extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_label; } AS() { return this.getToken(T.AS, 0); } name() { return this.getTypedRuleContext(_3, 0); } enterRule(e) { e instanceof X && e.enterLabel(this); } exitRule(e) { e instanceof X && e.exitLabel(this); } } class $c extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_participantType; } ANNOTATION() { return this.getToken(T.ANNOTATION, 0); } enterRule(e) { e instanceof X && e.enterParticipantType(this); } exitRule(e) { e instanceof X && e.exitParticipantType(this); } } class _3 extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_name; } ID() { return this.getToken(T.ID, 0); } CSTRING() { return this.getToken(T.CSTRING, 0); } USTRING() { return this.getToken(T.USTRING, 0); } enterRule(e) { e instanceof X && e.enterName(this); } exitRule(e) { e instanceof X && e.exitName(this); } } class Kc extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_width; } INT() { return this.getToken(T.INT, 0); } enterRule(e) { e instanceof X && e.enterWidth(this); } exitRule(e) { e instanceof X && e.exitWidth(this); } } class b6 extends K.ParserRuleContext { constructor(t, i, s) { i === void 0 && (i = null), s == null && (s = -1); super(i, s); h2(this, "stat", function(t) { return t === void 0 && (t = null), t === null ? this.getTypedRuleContexts(n6) : this.getTypedRuleContext(n6, t); }); this.parser = t, this.ruleIndex = T.RULE_block; } enterRule(t) { t instanceof X && t.enterBlock(this); } exitRule(t) { t instanceof X && t.exitBlock(this); } } let Qc = class extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_ret; } RETURN() { return this.getToken(T.RETURN, 0); } expr() { return this.getTypedRuleContext($2, 0); } SCOL() { return this.getToken(T.SCOL, 0); } ANNOTATION_RET() { return this.getToken(T.ANNOTATION_RET, 0); } asyncMessage() { return this.getTypedRuleContext(y6, 0); } EVENT_END() { return this.getToken(T.EVENT_END, 0); } enterRule(e) { e instanceof X && e.enterRet(this); } exitRule(e) { e instanceof X && e.exitRet(this); } }, jc = class extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_divider; } dividerNote() { return this.getTypedRuleContext(Xc, 0); } enterRule(e) { e instanceof X && e.enterDivider(this); } exitRule(e) { e instanceof X && e.exitDivider(this); } }; class Xc extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_dividerNote; } DIVIDER() { return this.getToken(T.DIVIDER, 0); } enterRule(e) { e instanceof X && e.enterDividerNote(this); } exitRule(e) { e instanceof X && e.exitDividerNote(this); } } let n6 = class extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_stat; } alt() { return this.getTypedRuleContext(mu, 0); } par() { return this.getTypedRuleContext(Jc, 0); } opt() { return this.getTypedRuleContext(eu, 0); } critical() { return this.getTypedRuleContext(tu, 0); } section() { return this.getTypedRuleContext(nu, 0); } ref() { return this.getTypedRuleContext(iu, 0); } loop() { return this.getTypedRuleContext(Eu, 0); } creation() { return this.getTypedRuleContext(x6, 0); } message() { return this.getTypedRuleContext(au, 0); } asyncMessage() { return this.getTypedRuleContext(y6, 0); } EVENT_END() { return this.getToken(T.EVENT_END, 0); } ret() { return this.getTypedRuleContext(Qc, 0); } divider() { return this.getTypedRuleContext(jc, 0); } tcf() { return this.getTypedRuleContext(_u, 0); } enterRule(e) { e instanceof X && e.enterStat(this); } exitRule(e) { e instanceof X && e.exitStat(this); } }; class Jc extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_par; } PAR() { return this.getToken(T.PAR, 0); } braceBlock() { return this.getTypedRuleContext(e3, 0); } enterRule(e) { e instanceof X && e.enterPar(this); } exitRule(e) { e instanceof X && e.exitPar(this); } } class eu extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_opt; } OPT() { return this.getToken(T.OPT, 0); } braceBlock() { return this.getTypedRuleContext(e3, 0); } enterRule(e) { e instanceof X && e.enterOpt(this); } exitRule(e) { e instanceof X && e.exitOpt(this); } } class tu extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_critical; } CRITICAL() { return this.getToken(T.CRITICAL, 0); } braceBlock() { return this.getTypedRuleContext(e3, 0); } OPAR() { return this.getToken(T.OPAR, 0); } CPAR() { return this.getToken(T.CPAR, 0); } atom() { return this.getTypedRuleContext(g3, 0); } enterRule(e) { e instanceof X && e.enterCritical(this); } exitRule(e) { e instanceof X && e.exitCritical(this); } } class nu extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_section; } SECTION() { return this.getToken(T.SECTION, 0); } braceBlock() { return this.getTypedRuleContext(e3, 0); } OPAR() { return this.getToken(T.OPAR, 0); } CPAR() { return this.getToken(T.CPAR, 0); } atom() { return this.getTypedRuleContext(g3, 0); } enterRule(e) { e instanceof X && e.enterSection(this); } exitRule(e) { e instanceof X && e.exitSection(this); } } let x6 = class extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_creation; } creationBody() { return this.getTypedRuleContext(ru, 0); } SCOL() { return this.getToken(T.SCOL, 0); } braceBlock() { return this.getTypedRuleContext(e3, 0); } enterRule(e) { e instanceof X && e.enterCreation(this); } exitRule(e) { e instanceof X && e.exitCreation(this); } }, iu = class extends K.ParserRuleContext { constructor(t, i, s) { i === void 0 && (i = null), s == null && (s = -1); super(i, s); h2(this, "name", function(t) { return t === void 0 && (t = null), t === null ? this.getTypedRuleContexts(_3) : this.getTypedRuleContext(_3, t); }); h2(this, "COMMA", function(t) { return t === void 0 && (t = null), t === null ? this.getTokens(T.COMMA) : this.getToken(T.COMMA, t); }); this.parser = t, this.ruleIndex = T.RULE_ref; } REF() { return this.getToken(T.REF, 0); } OPAR() { return this.getToken(T.OPAR, 0); } CPAR() { return this.getToken(T.CPAR, 0); } SCOL() { return this.getToken(T.SCOL, 0); } enterRule(t) { t instanceof X && t.enterRef(this); } exitRule(t) { t instanceof X && t.exitRef(this); } }; class ru extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_creationBody; } NEW() { return this.getToken(T.NEW, 0); } construct() { return this.getTypedRuleContext(cu, 0); } assignment() { return this.getTypedRuleContext(un, 0); } OPAR() { return this.getToken(T.OPAR, 0); } CPAR() { return this.getToken(T.CPAR, 0); } parameters() { return this.getTypedRuleContext(O6, 0); } enterRule(e) { e instanceof X && e.enterCreationBody(this); } exitRule(e) { e instanceof X && e.exitCreationBody(this); } } let au = class extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_message; } messageBody() { return this.getTypedRuleContext(su, 0); } SCOL() { return this.getToken(T.SCOL, 0); } braceBlock() { return this.getTypedRuleContext(e3, 0); } enterRule(e) { e instanceof X && e.enterMessage(this); } exitRule(e) { e instanceof X && e.exitMessage(this); } }; class su extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_messageBody; } assignment() { return this.getTypedRuleContext(un, 0); } fromTo() { return this.getTypedRuleContext(ou, 0); } func() { return this.getTypedRuleContext(w6, 0); } enterRule(e) { e instanceof X && e.enterMessageBody(this); } exitRule(e) { e instanceof X && e.exitMessageBody(this); } } class ou extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_fromTo; } to() { return this.getTypedRuleContext(cn, 0); } DOT() { return this.getToken(T.DOT, 0); } from() { return this.getTypedRuleContext(M6, 0); } ARROW() { return this.getToken(T.ARROW, 0); } enterRule(e) { e instanceof X && e.enterFromTo(this); } exitRule(e) { e instanceof X && e.exitFromTo(this); } } class w6 extends K.ParserRuleContext { constructor(t, i, s) { i === void 0 && (i = null), s == null && (s = -1); super(i, s); h2(this, "signature", function(t) { return t === void 0 && (t = null), t === null ? this.getTypedRuleContexts(i6) : this.getTypedRuleContext(i6, t); }); h2(this, "DOT", function(t) { return t === void 0 && (t = null), t === null ? this.getTokens(T.DOT) : this.getToken(T.DOT, t); }); this.parser = t, this.ruleIndex = T.RULE_func; } enterRule(t) { t instanceof X && t.enterFunc(this); } exitRule(t) { t instanceof X && t.exitFunc(this); } } class M6 extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_from; } name() { return this.getTypedRuleContext(_3, 0); } enterRule(e) { e instanceof X && e.enterFrom(this); } exitRule(e) { e instanceof X && e.exitFrom(this); } } class cn extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_to; } name() { return this.getTypedRuleContext(_3, 0); } enterRule(e) { e instanceof X && e.enterTo(this); } exitRule(e) { e instanceof X && e.exitTo(this); } } class i6 extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_signature; } methodName() { return this.getTypedRuleContext(du, 0); } invocation() { return this.getTypedRuleContext(A6, 0); } enterRule(e) { e instanceof X && e.enterSignature(this); } exitRule(e) { e instanceof X && e.exitSignature(this); } } class A6 extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_invocation; } OPAR() { return this.getToken(T.OPAR, 0); } CPAR() { return this.getToken(T.CPAR, 0); } parameters() { return this.getTypedRuleContext(O6, 0); } enterRule(e) { e instanceof X && e.enterInvocation(this); } exitRule(e) { e instanceof X && e.exitInvocation(this); } } class un extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_assignment; } assignee() { return this.getTypedRuleContext(uu, 0); } ASSIGN() { return this.getToken(T.ASSIGN, 0); } type() { return this.getTypedRuleContext(N6, 0); } enterRule(e) { e instanceof X && e.enterAssignment(this); } exitRule(e) { e instanceof X && e.exitAssignment(this); } } let y6 = class extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_asyncMessage; } to() { return this.getTypedRuleContext(cn, 0); } COL() { return this.getToken(T.COL, 0); } from() { return this.getTypedRuleContext(M6, 0); } ARROW() { return this.getToken(T.ARROW, 0); } content() { return this.getTypedRuleContext(lu, 0); } MINUS() { return this.getToken(T.MINUS, 0); } enterRule(e) { e instanceof X && e.enterAsyncMessage(this); } exitRule(e) { e instanceof X && e.exitAsyncMessage(this); } }; class lu extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_content; } EVENT_PAYLOAD_LXR() { return this.getToken(T.EVENT_PAYLOAD_LXR, 0); } enterRule(e) { e instanceof X && e.enterContent(this); } exitRule(e) { e instanceof X && e.exitContent(this); } } class cu extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_construct; } name() { return this.getTypedRuleContext(_3, 0); } enterRule(e) { e instanceof X && e.enterConstruct(this); } exitRule(e) { e instanceof X && e.exitConstruct(this); } } class N6 extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_type; } name() { return this.getTypedRuleContext(_3, 0); } enterRule(e) { e instanceof X && e.enterType(this); } exitRule(e) { e instanceof X && e.exitType(this); } } class uu extends K.ParserRuleContext { constructor(t, i, s) { i === void 0 && (i = null), s == null && (s = -1); super(i, s); h2(this, "ID", function(t) { return t === void 0 && (t = null), t === null ? this.getTokens(T.ID) : this.getToken(T.ID, t); }); h2(this, "COMMA", function(t) { return t === void 0 && (t = null), t === null ? this.getTokens(T.COMMA) : this.getToken(T.COMMA, t); }); this.parser = t, this.ruleIndex = T.RULE_assignee; } atom() { return this.getTypedRuleContext(g3, 0); } CSTRING() { return this.getToken(T.CSTRING, 0); } USTRING() { return this.getToken(T.USTRING, 0); } NEW() { return this.getToken(T.NEW, 0); } enterRule(t) { t instanceof X && t.enterAssignee(this); } exitRule(t) { t instanceof X && t.exitAssignee(this); } } class du extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_methodName; } name() { return this.getTypedRuleContext(_3, 0); } enterRule(e) { e instanceof X && e.enterMethodName(this); } exitRule(e) { e instanceof X && e.exitMethodName(this); } } let O6 = class extends K.ParserRuleContext { constructor(t, i, s) { i === void 0 && (i = null), s == null && (s = -1); super(i, s); h2(this, "parameter", function(t) { return t === void 0 && (t = null), t === null ? this.getTypedRuleContexts(r6) : this.getTypedRuleContext(r6, t); }); h2(this, "COMMA", function(t) { return t === void 0 && (t = null), t === null ? this.getTokens(T.COMMA) : this.getToken(T.COMMA, t); }); this.parser = t, this.ruleIndex = T.RULE_parameters; } enterRule(t) { t instanceof X && t.enterParameters(this); } exitRule(t) { t instanceof X && t.exitParameters(this); } }; class r6 extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_parameter; } namedParameter() { return this.getTypedRuleContext(Lu, 0); } declaration() { return this.getTypedRuleContext(Cu, 0); } expr() { return this.getTypedRuleContext($2, 0); } enterRule(e) { e instanceof X && e.enterParameter(this); } exitRule(e) { e instanceof X && e.exitParameter(this); } } class Lu extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_namedParameter; } ID() { return this.getToken(T.ID, 0); } ASSIGN() { return this.getToken(T.ASSIGN, 0); } expr() { return this.getTypedRuleContext($2, 0); } enterRule(e) { e instanceof X && e.enterNamedParameter(this); } exitRule(e) { e instanceof X && e.exitNamedParameter(this); } } class Cu extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_declaration; } type() { return this.getTypedRuleContext(N6, 0); } ID() { return this.getToken(T.ID, 0); } enterRule(e) { e instanceof X && e.enterDeclaration(this); } exitRule(e) { e instanceof X && e.exitDeclaration(this); } } class _u extends K.ParserRuleContext { constructor(t, i, s) { i === void 0 && (i = null), s == null && (s = -1); super(i, s); h2(this, "catchBlock", function(t) { return t === void 0 && (t = null), t === null ? this.getTypedRuleContexts(a6) : this.getTypedRuleContext(a6, t); }); this.parser = t, this.ruleIndex = T.RULE_tcf; } tryBlock() { return this.getTypedRuleContext(gu, 0); } finallyBlock() { return this.getTypedRuleContext(pu, 0); } enterRule(t) { t instanceof X && t.enterTcf(this); } exitRule(t) { t instanceof X && t.exitTcf(this); } } class gu extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_tryBlock; } TRY() { return this.getToken(T.TRY, 0); } braceBlock() { return this.getTypedRuleContext(e3, 0); } enterRule(e) { e instanceof X && e.enterTryBlock(this); } exitRule(e) { e instanceof X && e.exitTryBlock(this); } } class a6 extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_catchBlock; } CATCH() { return this.getToken(T.CATCH, 0); } braceBlock() { return this.getTypedRuleContext(e3, 0); } invocation() { return this.getTypedRuleContext(A6, 0); } enterRule(e) { e instanceof X && e.enterCatchBlock(this); } exitRule(e) { e instanceof X && e.exitCatchBlock(this); } } class pu extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_finallyBlock; } FINALLY() { return this.getToken(T.FINALLY, 0); } braceBlock() { return this.getTypedRuleContext(e3, 0); } enterRule(e) { e instanceof X && e.enterFinallyBlock(this); } exitRule(e) { e instanceof X && e.exitFinallyBlock(this); } } class mu extends K.ParserRuleContext { constructor(t, i, s) { i === void 0 && (i = null), s == null && (s = -1); super(i, s); h2(this, "elseIfBlock", function(t) { return t === void 0 && (t = null), t === null ? this.getTypedRuleContexts(s6) : this.getTypedRuleContext(s6, t); }); this.parser = t, this.ruleIndex = T.RULE_alt; } ifBlock() { return this.getTypedRuleContext(hu, 0); } elseBlock() { return this.getTypedRuleContext(fu, 0); } enterRule(t) { t instanceof X && t.enterAlt(this); } exitRule(t) { t instanceof X && t.exitAlt(this); } } let hu = class extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_ifBlock; } IF() { return this.getToken(T.IF, 0); } parExpr() { return this.getTypedRuleContext(dn, 0); } braceBlock() { return this.getTypedRuleContext(e3, 0); } enterRule(e) { e instanceof X && e.enterIfBlock(this); } exitRule(e) { e instanceof X && e.exitIfBlock(this); } }; class s6 extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_elseIfBlock; } ELSE() { return this.getToken(T.ELSE, 0); } IF() { return this.getToken(T.IF, 0); } parExpr() { return this.getTypedRuleContext(dn, 0); } braceBlock() { return this.getTypedRuleContext(e3, 0); } enterRule(e) { e instanceof X && e.enterElseIfBlock(this); } exitRule(e) { e instanceof X && e.exitElseIfBlock(this); } } class fu extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_elseBlock; } ELSE() { return this.getToken(T.ELSE, 0); } braceBlock() { return this.getTypedRuleContext(e3, 0); } enterRule(e) { e instanceof X && e.enterElseBlock(this); } exitRule(e) { e instanceof X && e.exitElseBlock(this); } } class e3 extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_braceBlock; } OBRACE() { return this.getToken(T.OBRACE, 0); } CBRACE() { return this.getToken(T.CBRACE, 0); } block() { return this.getTypedRuleContext(b6, 0); } enterRule(e) { e instanceof X && e.enterBraceBlock(this); } exitRule(e) { e instanceof X && e.exitBraceBlock(this); } } let Eu = class extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_loop; } WHILE() { return this.getToken(T.WHILE, 0); } parExpr() { return this.getTypedRuleContext(dn, 0); } braceBlock() { return this.getTypedRuleContext(e3, 0); } enterRule(e) { e instanceof X && e.enterLoop(this); } exitRule(e) { e instanceof X && e.exitLoop(this); } }; class $2 extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_expr; } copyFrom(e) { super.copyFrom(e); } } class qE extends $2 { constructor(e, t) { super(e), super.copyFrom(t); } assignment() { return this.getTypedRuleContext(un, 0); } expr() { return this.getTypedRuleContext($2, 0); } enterRule(e) { e instanceof X && e.enterAssignmentExpr(this); } exitRule(e) { e instanceof X && e.exitAssignmentExpr(this); } } T.AssignmentExprContext = qE; class WE extends $2 { constructor(e, t) { super(e), super.copyFrom(t); } func() { return this.getTypedRuleContext(w6, 0); } to() { return this.getTypedRuleContext(cn, 0); } DOT() { return this.getToken(T.DOT, 0); } enterRule(e) { e instanceof X && e.enterFuncExpr(this); } exitRule(e) { e instanceof X && e.exitFuncExpr(this); } } T.FuncExprContext = WE; class $E extends $2 { constructor(e, t) { super(e), super.copyFrom(t); } atom() { return this.getTypedRuleContext(g3, 0); } enterRule(e) { e instanceof X && e.enterAtomExpr(this); } exitRule(e) { e instanceof X && e.exitAtomExpr(this); } } T.AtomExprContext = $E; class KE extends $2 { constructor(t, i) { super(t); h2(this, "expr", function(t) { return t === void 0 && (t = null), t === null ? this.getTypedRuleContexts($2) : this.getTypedRuleContext($2, t); }); super.copyFrom(i); } OR() { return this.getToken(T.OR, 0); } enterRule(t) { t instanceof X && t.enterOrExpr(this); } exitRule(t) { t instanceof X && t.exitOrExpr(this); } } T.OrExprContext = KE; class QE extends $2 { constructor(t, i) { super(t); h2(this, "expr", function(t) { return t === void 0 && (t = null), t === null ? this.getTypedRuleContexts($2) : this.getTypedRuleContext($2, t); }); this.op = null, super.copyFrom(i); } PLUS() { return this.getToken(T.PLUS, 0); } MINUS() { return this.getToken(T.MINUS, 0); } enterRule(t) { t instanceof X && t.enterAdditiveExpr(this); } exitRule(t) { t instanceof X && t.exitAdditiveExpr(this); } } T.AdditiveExprContext = QE; class jE extends $2 { constructor(t, i) { super(t); h2(this, "expr", function(t) { return t === void 0 && (t = null), t === null ? this.getTypedRuleContexts($2) : this.getTypedRuleContext($2, t); }); this.op = null, super.copyFrom(i); } LTEQ() { return this.getToken(T.LTEQ, 0); } GTEQ() { return this.getToken(T.GTEQ, 0); } LT() { return this.getToken(T.LT, 0); } GT() { return this.getToken(T.GT, 0); } enterRule(t) { t instanceof X && t.enterRelationalExpr(this); } exitRule(t) { t instanceof X && t.exitRelationalExpr(this); } } T.RelationalExprContext = jE; class XE extends $2 { constructor(t, i) { super(t); h2(this, "expr", function(t) { return t === void 0 && (t = null), t === null ? this.getTypedRuleContexts($2) : this.getTypedRuleContext($2, t); }); super.copyFrom(i); } PLUS() { return this.getToken(T.PLUS, 0); } enterRule(t) { t instanceof X && t.enterPlusExpr(this); } exitRule(t) { t instanceof X && t.exitPlusExpr(this); } } T.PlusExprContext = XE; class JE extends $2 { constructor(e, t) { super(e), super.copyFrom(t); } NOT() { return this.getToken(T.NOT, 0); } expr() { return this.getTypedRuleContext($2, 0); } enterRule(e) { e instanceof X && e.enterNotExpr(this); } exitRule(e) { e instanceof X && e.exitNotExpr(this); } } T.NotExprContext = JE; class eS extends $2 { constructor(e, t) { super(e), super.copyFrom(t); } MINUS() { return this.getToken(T.MINUS, 0); } expr() { return this.getTypedRuleContext($2, 0); } enterRule(e) { e instanceof X && e.enterUnaryMinusExpr(this); } exitRule(e) { e instanceof X && e.exitUnaryMinusExpr(this); } } T.UnaryMinusExprContext = eS; class tS extends $2 { constructor(e, t) { super(e), super.copyFrom(t); } creation() { return this.getTypedRuleContext(x6, 0); } enterRule(e) { e instanceof X && e.enterCreationExpr(this); } exitRule(e) { e instanceof X && e.exitCreationExpr(this); } } T.CreationExprContext = tS; class nS extends $2 { constructor(e, t) { super(e), super.copyFrom(t); } OPAR() { return this.getToken(T.OPAR, 0); } expr() { return this.getTypedRuleContext($2, 0); } CPAR() { return this.getToken(T.CPAR, 0); } enterRule(e) { e instanceof X && e.enterParenthesizedExpr(this); } exitRule(e) { e instanceof X && e.exitParenthesizedExpr(this); } } T.ParenthesizedExprContext = nS; class iS extends $2 { constructor(t, i) { super(t); h2(this, "expr", function(t) { return t === void 0 && (t = null), t === null ? this.getTypedRuleContexts($2) : this.getTypedRuleContext($2, t); }); this.op = null, super.copyFrom(i); } MULT() { return this.getToken(T.MULT, 0); } DIV() { return this.getToken(T.DIV, 0); } MOD() { return this.getToken(T.MOD, 0); } enterRule(t) { t instanceof X && t.enterMultiplicationExpr(this); } exitRule(t) { t instanceof X && t.exitMultiplicationExpr(this); } } T.MultiplicationExprContext = iS; class rS extends $2 { constructor(t, i) { super(t); h2(this, "expr", function(t) { return t === void 0 && (t = null), t === null ? this.getTypedRuleContexts($2) : this.getTypedRuleContext($2, t); }); this.op = null, super.copyFrom(i); } EQ() { return this.getToken(T.EQ, 0); } NEQ() { return this.getToken(T.NEQ, 0); } enterRule(t) { t instanceof X && t.enterEqualityExpr(this); } exitRule(t) { t instanceof X && t.exitEqualityExpr(this); } } T.EqualityExprContext = rS; class aS extends $2 { constructor(t, i) { super(t); h2(this, "expr", function(t) { return t === void 0 && (t = null), t === null ? this.getTypedRuleContexts($2) : this.getTypedRuleContext($2, t); }); super.copyFrom(i); } AND() { return this.getToken(T.AND, 0); } enterRule(t) { t instanceof X && t.enterAndExpr(this); } exitRule(t) { t instanceof X && t.exitAndExpr(this); } } T.AndExprContext = aS; class g3 extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_atom; } copyFrom(e) { super.copyFrom(e); } } class sS extends g3 { constructor(e, t) { super(e), super.copyFrom(t); } TRUE() { return this.getToken(T.TRUE, 0); } FALSE() { return this.getToken(T.FALSE, 0); } enterRule(e) { e instanceof X && e.enterBooleanAtom(this); } exitRule(e) { e instanceof X && e.exitBooleanAtom(this); } } T.BooleanAtomContext = sS; class oS extends g3 { constructor(e, t) { super(e), super.copyFrom(t); } ID() { return this.getToken(T.ID, 0); } enterRule(e) { e instanceof X && e.enterIdAtom(this); } exitRule(e) { e instanceof X && e.exitIdAtom(this); } } T.IdAtomContext = oS; class lS extends g3 { constructor(e, t) { super(e), super.copyFrom(t); } MONEY() { return this.getToken(T.MONEY, 0); } enterRule(e) { e instanceof X && e.enterMoneyAtom(this); } exitRule(e) { e instanceof X && e.exitMoneyAtom(this); } } T.MoneyAtomContext = lS; class cS extends g3 { constructor(e, t) { super(e), super.copyFrom(t); } CSTRING() { return this.getToken(T.CSTRING, 0); } USTRING() { return this.getToken(T.USTRING, 0); } enterRule(e) { e instanceof X && e.enterStringAtom(this); } exitRule(e) { e instanceof X && e.exitStringAtom(this); } } T.StringAtomContext = cS; class uS extends g3 { constructor(e, t) { super(e), super.copyFrom(t); } NIL() { return this.getToken(T.NIL, 0); } enterRule(e) { e instanceof X && e.enterNilAtom(this); } exitRule(e) { e instanceof X && e.exitNilAtom(this); } } T.NilAtomContext = uS; class dS extends g3 { constructor(e, t) { super(e), super.copyFrom(t); } INT() { return this.getToken(T.INT, 0); } FLOAT() { return this.getToken(T.FLOAT, 0); } enterRule(e) { e instanceof X && e.enterNumberAtom(this); } exitRule(e) { e instanceof X && e.exitNumberAtom(this); } } T.NumberAtomContext = dS; class LS extends g3 { constructor(e, t) { super(e), super.copyFrom(t); } NUMBER_UNIT() { return this.getToken(T.NUMBER_UNIT, 0); } enterRule(e) { e instanceof X && e.enterNumberUnitAtom(this); } exitRule(e) { e instanceof X && e.exitNumberUnitAtom(this); } } T.NumberUnitAtomContext = LS; class dn extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_parExpr; } OPAR() { return this.getToken(T.OPAR, 0); } condition() { return this.getTypedRuleContext(Su, 0); } CPAR() { return this.getToken(T.CPAR, 0); } enterRule(e) { e instanceof X && e.enterParExpr(this); } exitRule(e) { e instanceof X && e.exitParExpr(this); } } class Su extends K.ParserRuleContext { constructor(e, t, i) { t === void 0 && (t = null), i == null && (i = -1), super(t, i), this.parser = e, this.ruleIndex = T.RULE_condition; } atom() { return this.getTypedRuleContext(g3, 0); } expr() { return this.getTypedRuleContext($2, 0); } inExpr() { return this.getTypedRuleContext(Tu, 0); } enterRule(e) { e instanceof X && e.enterCondition(this); } exitRule(e) { e instanceof X && e.exitCondition(this); } } class Tu extends K.ParserRuleContext { constructor(t, i, s) { i === void 0 && (i = null), s == null && (s = -1); super(i, s); h2(this, "ID", function(t) { return t === void 0 && (t = null), t === null ? this.getTokens(T.ID) : this.getToken(T.ID, t); }); this.parser = t, this.ruleIndex = T.RULE_inExpr; } IN() { return this.getToken(T.IN, 0); } enterRule(t) { t instanceof X && t.enterInExpr(this); } exitRule(t) { t instanceof X && t.exitInExpr(this); } } T.ProgContext = VE; T.TitleContext = zc; T.HeadContext = Hc; T.GroupContext = t6; T.StarterExpContext = Yc; T.StarterContext = Vc; T.ParticipantContext = S0; T.StereotypeContext = qc; T.LabelContext = Wc; T.ParticipantTypeContext = $c; T.NameContext = _3; T.WidthContext = Kc; T.BlockContext = b6; T.RetContext = Qc; T.DividerContext = jc; T.DividerNoteContext = Xc; T.StatContext = n6; T.ParContext = Jc; T.OptContext = eu; T.CriticalContext = tu; T.SectionContext = nu; T.CreationContext = x6; T.RefContext = iu; T.CreationBodyContext = ru; T.MessageContext = au; T.MessageBodyContext = su; T.FromToContext = ou; T.FuncContext = w6; T.FromContext = M6; T.ToContext = cn; T.SignatureContext = i6; T.InvocationContext = A6; T.AssignmentContext = un; T.AsyncMessageContext = y6; T.ContentContext = lu; T.ConstructContext = cu; T.TypeContext = N6; T.AssigneeContext = uu; T.MethodNameContext = du; T.ParametersContext = O6; T.ParameterContext = r6; T.NamedParameterContext = Lu; T.DeclarationContext = Cu; T.TcfContext = _u; T.TryBlockContext = gu; T.CatchBlockContext = a6; T.FinallyBlockContext = pu; T.AltContext = mu; T.IfBlockContext = hu; T.ElseIfBlockContext = s6; T.ElseBlockContext = fu; T.BraceBlockContext = e3; T.LoopContext = Eu; T.ExprContext = $2; T.AtomContext = g3; T.ParExprContext = dn; T.ConditionContext = Su; T.InExprContext = Tu; const CS = { name: "", color: void 0, comment: void 0, explicit: void 0, groupId: void 0, isStarter: void 0, label: void 0, stereotype: void 0, type: void 0, width: void 0, assignee: void 0, positions: /* @__PURE__ */ new Set(), assigneePositions: /* @__PURE__ */ new Set() }; let cw = class { constructor(e, t) { h2(this, "name"); h2(this, "stereotype"); h2(this, "width"); h2(this, "groupId"); h2(this, "explicit"); h2(this, "isStarter"); h2(this, "label"); h2(this, "type"); h2(this, "color"); h2(this, "comment"); h2(this, "assignee"); h2(this, "positions", /* @__PURE__ */ new Set()); h2(this, "assigneePositions", /* @__PURE__ */ new Set()); this.name = e, this.mergeOptions(t); } mergeOptions(e) { const { stereotype: t, width: i, groupId: s, label: l, explicit: c, isStarter: d, type: L, color: _, comment: p, assignee: m } = e; this.stereotype || (this.stereotype = t), this.width || (this.width = i), this.groupId || (this.groupId = s), this.explicit || (this.explicit = c), this.isStarter || (this.isStarter = d), this.label || (this.label = l), this.type || (this.type = L), this.color || (this.color = _), this.comment || (this.comment = p), this.assignee || (this.assignee = m); } AddPosition(e) { this.positions.add(e); } ToValue() { return { name: this.name, stereotype: this.stereotype, width: this.width, groupId: this.groupId, explicit: this.explicit, isStarter: this.isStarter, label: this.label, type: this.type, color: this.color, comment: this.comment, assignee: this.assignee, positions: this.positions, assigneePositions: this.assigneePositions }; } }, uw = class { constructor() { h2(this, "participants", /* @__PURE__ */ new Map()); } Add(e, t = {}) { if (!e) throw new Error("Participant name is required"); let i = this.Get(e); i ? i == null || i.mergeOptions(t) : (i = new cw(e, t), this.participants.set(e, i)); const { position: s, assigneePosition: l } = t; s && i.AddPosition(s), l && i.assigneePositions.add(l); } // Returns an array of participants that are deduced from messages // It does not include the Starter. ImplicitArray() { return this.Array().filter((e) => { var t; return !((t = this.Get(e.name)) != null && t.explicit); }); } // Items in entries are in the order of entry insertion: // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map Array() { return Array.from(this.participants.entries()).map((e) => e[1]); } Names() { return Array.from(this.participants.keys()); } First() { return this.participants.values().next().value; } Get(e) { return this.participants.get(e); } Size() { return this.participants.size; } Starter() { for (const e of this.participants.values()) if (e.isStarter) return e; } GetPositions(e) { var t; return (t = this.participants.get(e)) == null ? void 0 : t.positions; } GetAssigneePositions(e) { var t; return (t = this.participants.get(e)) == null ? void 0 : t.assigneePositions; } }, L3, M9 = !1, vu; const Ge = new X(), dw = function(n) { var h, v, R, w, M, N; if (M9) return; const e = (h = n == null ? void 0 : n.participantType()) == null ? void 0 : h.getFormattedText().replace("@", ""), t = ((v = n == null ? void 0 : n.name()) == null ? void 0 : v.getFormattedText()) || "Missing `Participant`", i = (w = (R = n.stereotype()) == null ? void 0 : R.name()) == null ? void 0 : w.getFormattedText(), s = n.width && n.width() && Number.parseInt(n.width().getText()) || void 0, l = n.label && n.label(), c = (M = l == null ? void 0 : l.name()) == null ? void 0 : M.getFormattedText(), d = !0, L = (N = n.COLOR()) == null ? void 0 : N.getText(), _ = n.getComment(), p = n.name(); let m, f; if (l) { const D = l.name(); D && (m = D.start.start, f = D.stop.stop + 1); } else p && (m = p.start.start, f = p.stop.stop + 1); L3.Add(t, { isStarter: !1, type: e, stereotype: i, width: s, groupId: vu, label: c, explicit: d, color: L, comment: _, position: [m, f] }); }; Ge.enterParticipant = dw; const _S = function(n) { if (M9) return; let e = n.getFormattedText(); const t = L3.Get(e); if (t != null && t.label) L3.Add(e, { isStarter: !1 }); else if (t != null && t.assignee) { const s = [n.start.start + t.assignee.length + 2, n.stop.stop], l = [ n.start.start + 1, n.start.start + t.assignee.length + 1 ]; L3.Add(e, { isStarter: !1, position: s, assigneePosition: l }); } else L3.Add(e, { isStarter: !1, position: [n.start.start, n.stop.stop + 1] }); }; Ge.enterFrom = _S; Ge.enterTo = _S; Ge.enterStarter = function(n) { let e = n.getFormattedText(); L3.Add(e, { isStarter: !0, position: [n.start.start, n.stop.stop + 1] }); }; Ge.enterCreation = function(n) { var s; if (M9) return; const e = n.Owner(), t = (s = n == null ? void 0 : n.creationBody()) == null ? void 0 : s.construct(), i = L3.Get(e); if (t && !(i != null && i.label)) { const l = n.Assignee(), c = n.AssigneePosition(); L3.Add(e, { isStarter: !1, position: [t.start.start, t.stop.stop + 1], assignee: l, assigneePosition: c }); } else L3.Add(e, { isStarter: !1 }); }; Ge.enterRef = function(n) { n.Participants().forEach((e) => { L3.Add(e.getText(), { isStarter: !1, position: [e.start.start, e.stop.stop + 1] }); }); }; Ge.enterParameters = function() { M9 = !0; }; Ge.exitParameters = function() { M9 = !1; }; Ge.enterCondition = function() { M9 = !0; }; Ge.exitCondition = function() { M9 = !1; }; Ge.enterGroup = function(n) { var e; vu = (e = n.name()) == null ? void 0 : e.getFormattedText(); }; Ge.exitGroup = function() { vu = void 0; }; Ge.enterRet = function(n) { if (n.asyncMessage()) return; const e = n.From(); e && L3.Add(e); const t = n.ReturnTo(); t && L3.Add(t); }; const Lw = K.tree.ParseTreeWalker.DEFAULT; Ge.getParticipants = function(n) { return L3 = new uw(), Lw.walk(this, n), L3; }; const Cw = K.tree.ParseTreeWalker.DEFAULT; let t3 = new X(), ee = 0, Ze = 0; t3.enterTcf = function() { ee++; }; t3.enterOpt = function() { ee++; }; t3.enterPar = function() { ee++; }; t3.enterAlt = function() { ee++; }; t3.enterLoop = function() { ee++; }; t3.enterSection = function() { ee++; }; t3.enterCritical = function() { ee++; }; t3.exitTcf = function() { Ze = Math.max(Ze, ee), ee--; }; t3.exitOpt = function() { Ze = Math.max(Ze, ee), ee--; }; t3.exitPar = function() { Ze = Math.max(Ze, ee), ee--; }; t3.exitAlt = function() { Ze = Math.max(Ze, ee), ee--; }; t3.exitLoop = function() { Ze = Math.max(Ze, ee), ee--; }; t3.exitSection = function() { Ze = Math.max(Ze, ee), ee--; }; t3.exitCritical = function() { Ze = Math.max(Ze, ee), ee--; }; t3.depth = function(n) { return function(e) { return ee = 0, Ze = 0, e.children.map(function(t) { Cw.walk(n, t); }), Ze; }; }; const _w = T, gw = _w.TitleContext; gw.prototype.content = function() { return this.children.length < 2 ? "" : this.children[1].getText().trim(); }; const gS = T, Kl = gS.CreationContext; Kl.prototype.Body = Kl.prototype.creationBody; Kl.prototype.isCurrent = function(n) { return pS.bind(this)(n); }; const Ql = gS.MessageContext; Ql.prototype.Body = Ql.prototype.messageBody; Ql.prototype.isCurrent = function(n) { return pS.bind(this)(n); }; function pS(n) { try { if (n == null) return !1; const e = this.start.start, t = this.Body().stop.stop + 1; return n >= e && n <= t; } catch { return !1; } } const I6 = T, w0 = I6.CreationContext, Ru = I6.MessageContext, mS = I6.AsyncMessageContext, hS = I6.RetContext; w0.prototype.Assignee = function() { var n, e, t; return (t = (e = (n = this.creationBody()) == null ? void 0 : n.assignment()) == null ? void 0 : e.assignee()) == null ? void 0 : t.getFormattedText(); }; w0.prototype.AssigneePosition = function() { var e, t; const n = (t = (e = this.creationBody()) == null ? void 0 : e.assignment()) == null ? void 0 : t.assignee(); if (n) return [n.start.start, n.stop.stop + 1]; }; w0.prototype.Constructor = function() { var n, e; return (e = (n = this.creationBody()) == null ? void 0 : n.construct()) == null ? void 0 : e.getFormattedText(); }; w0.prototype.To = function() { return this.Constructor(); }; w0.prototype.Owner = function() { if (!this.Constructor()) return "Missing Constructor"; const n = this.Assignee(), e = this.Constructor(); return n ? `${n}:${e}` : e; }; Ru.prototype.To = function() { var n, e, t; return (t = (e = (n = this.messageBody()) == null ? void 0 : n.fromTo()) == null ? void 0 : e.to()) == null ? void 0 : t.getFormattedText(); }; Ru.prototype.Owner = function() { return this.To() || bu(this.parentCtx); }; function bu(n) { for (; n; ) { if (n instanceof w0 || n instanceof Ru) return n.Owner(); n = n.parentCtx; } } mS.prototype.To = function() { var n; return (n = this.to()) == null ? void 0 : n.getFormattedText(); }; mS.prototype.Owner = function() { return this.To() || bu(this.parentCtx); }; hS.prototype.To = function() { return this.ReturnTo(); }; hS.prototype.Owner = function() { return this.To() || bu(this.parentCtx); }; const pw = T.ProgContext; pw.prototype.Starter = function() { var n, e, t; return (t = (e = (n = this.head()) == null ? void 0 : n.starterExp()) == null ? void 0 : e.starter()) == null ? void 0 : t.getFormattedText(); }; const D6 = T, mw = D6.RetContext, W_ = D6.ProgContext, $_ = D6.MessageContext, hw = D6.CreationContext; mw.prototype.ReturnTo = function() { var i, s, l; const t = this.parentCtx.parentCtx.parentCtx; if (t instanceof W_) return t.Starter(); { let c = t; for (; c && !(c instanceof $_) && !(c instanceof hw); ) { if (c instanceof W_) return c.Starter(); c = c.parentCtx; } return c instanceof $_ && ((l = (s = (i = c.messageBody()) == null ? void 0 : i.fromTo()) == null ? void 0 : s.from()) == null ? void 0 : l.getFormattedText()) || c.ClosestAncestorStat().Origin(); } }; const fw = T, fS = fw.RefContext; fS.prototype.Content = function() { return this.name()[0]; }; fS.prototype.Participants = function() { return this.name().slice(1) ?? []; }; const Ew = K.ParserRuleContext, ES = T.StatContext, xu = T.ProgContext, Sw = T.MessageContext, Tw = T.CreationContext; Ew.prototype.Origin = function() { let n = this.parentCtx; for (; n && !(n instanceof ES || n instanceof xu); ) n = this.parentCtx; return n.Origin(); }; ES.prototype.Origin = function() { let n = this.parentCtx; for (; n; ) { if (n instanceof xu) return n.Starter(); if (n instanceof Sw || n instanceof Tw) { const e = n.Owner(); if (e) return e; } n = n.parentCtx; } }; xu.prototype.Origin = function() { return this.Starter(); }; const vw = T, Rw = vw.DividerContext; Rw.prototype.Note = function() { var e; const n = (e = this.dividerNote()) == null ? void 0 : e.getFormattedText().trim(); if (!n.startsWith("==")) throw new Error("Divider note must start with =="); return n == null ? void 0 : n.replace(/^=+|=+$/g, ""); }; function bw(n) { var e, t, i; if ((e = n.namedParameter) != null && e.call(n)) { const s = n.namedParameter(); if (s) { const l = s.expr(), c = l ? l.getFormattedText() : ""; return `${s.ID().getText()}=${c}`; } } if ((t = n.declaration) != null && t.call(n)) { const s = n.declaration(); if (s) return `${s.type().getText()} ${s.ID().getText()}`; } return (i = n.expr) != null && i.call(n) ? n.expr().getFormattedText() : n.getFormattedText(); } function SS(n) { return n.map(bw).join(","); } const xw = T.MessageContext, ww = T.ParametersContext, Mw = T.AsyncMessageContext, TS = T.CreationContext, Aw = T.RetContext; xw.prototype.SignatureText = function() { var n, e, t; return ((t = (e = (n = this.messageBody()) == null ? void 0 : n.func()) == null ? void 0 : e.signature()) == null ? void 0 : t.map((i) => i == null ? void 0 : i.getFormattedText()).join(".")) ?? ""; }; Mw.prototype.SignatureText = function() { var n; return ((n = this.content()) == null ? void 0 : n.getFormattedText()) ?? ""; }; TS.prototype.SignatureText = function() { var t; const n = this.creationBody().parameters(); return `«${((t = n == null ? void 0 : n.parameter()) == null ? void 0 : t.length) > 0 ? SS(n.parameter()) : "create"}»`; }; TS.prototype.isParamValid = function() { var n, e; return (((e = (n = this.creationBody().parameters()) == null ? void 0 : n.parameter()) == null ? void 0 : e.length) ?? 0) > 0; }; Aw.prototype.SignatureText = function() { var n, e, t; return ((e = (n = this.asyncMessage()) == null ? void 0 : n.content()) == null ? void 0 : e.getFormattedText()) ?? ((t = this.expr()) == null ? void 0 : t.getFormattedText()) ?? ""; }; ww.prototype.getFormattedText = function() { const n = this.parameter(); return !n || n.length === 0 ? "" : SS(n); }; const k6 = T, vS = k6.MessageContext, yw = k6.CreationContext, Nw = k6.IfBlockContext, Ow = k6.LoopContext; class Iw { constructor(e, t) { h2(this, "assignee"); h2(this, "type"); if (t && !e) throw new Error("assignee must be defined if type is defined"); this.assignee = e || "", this.type = t || ""; } getText() { return [this.assignee, this.type].filter(Boolean).join(":"); } } vS.prototype.Assignment = function() { var i, s; const n = this.messageBody().assignment(), e = (i = n == null ? void 0 : n.assignee()) == null ? void 0 : i.getFormattedText(), t = (s = n == null ? void 0 : n.type()) == null ? void 0 : s.getFormattedText(); if (e) return new Iw(e, t); }; vS.prototype.Statements = function() { var n, e; return ((e = (n = this.braceBlock()) == null ? void 0 : n.block()) == null ? void 0 : e.stat()) || []; }; yw.prototype.Statements = function() { var n, e; return ((e = (n = this.braceBlock()) == null ? void 0 : n.block()) == null ? void 0 : e.stat()) || []; }; Nw.prototype.Statements = function() { var n, e; return ((e = (n = this.braceBlock()) == null ? void 0 : n.block()) == null ? void 0 : e.stat()) || []; }; Ow.prototype.Statements = function() { var n, e; return ((e = (n = this.braceBlock()) == null ? void 0 : n.block()) == null ? void 0 : e.stat()) || []; }; const Ln = T, Dw = Ln.CreationContext, kw = Ln.StatContext, RS = Ln.MessageContext, bS = Ln.AsyncMessageContext, Pw = Ln.RetContext; Dw.prototype.From = function() { if (this.parentCtx instanceof kw) return this.ClosestAncestorStat().Origin(); }; RS.prototype.ProvidedFrom = function() { var n, e, t; return (t = (e = (n = this.messageBody()) == null ? void 0 : n.fromTo()) == null ? void 0 : e.from()) == null ? void 0 : t.getFormattedText(); }; RS.prototype.From = function() { return this.ProvidedFrom() || this.ClosestAncestorStat().Origin(); }; bS.prototype.ProvidedFrom = function() { var n; return (n = this.from()) == null ? void 0 : n.getFormattedText(); }; bS.prototype.From = function() { return this.ProvidedFrom() || this.ClosestAncestorStat().Origin(); }; Pw.prototype.From = function() { return this.ClosestAncestorStat().Origin(); }; K.ParserRuleContext.prototype.Key = function() { return `${this.start.start}:${this.stop.stop}`; }; const xS = T, K_ = xS.StatContext; K.ParserRuleContext.prototype.ClosestAncestorStat = function() { let n = this; for (; !(n instanceof K_); ) n = n.parentCtx; if (n instanceof K_) return n; }; K.ParserRuleContext.prototype.ClosestAncestorBlock = function() { var e; const n = (e = this.ClosestAncestorStat()) == null ? void 0 : e.parentCtx; if (n instanceof xS.BlockContext) return n; console.warn("Cannot find closest ancestor block for context:", this); }; K.ParserRuleContext.prototype.getAncestors = function(n) { let e = this; const t = []; for (; e; ) (!n || n(e)) && t.push(e), e = e.parentCtx; return t; }; var pr, Q_; function wS() { if (Q_) return pr; Q_ = 1; function n(e, t) { switch (e) { case 0: return function() { return t.apply(this, arguments); }; case 1: return function(i) { return t.apply(this, arguments); }; case 2: return function(i, s) { return t.apply(this, arguments); }; case 3: return function(i, s, l) { return t.apply(this, arguments); }; case 4: return function(i, s, l, c) { return t.apply(this, arguments); }; case 5: return function(i, s, l, c, d) { return t.apply(this, arguments); }; case 6: return function(i, s, l, c, d, L) { return t.apply(this, arguments); }; case 7: return function(i, s, l, c, d, L, _) { return t.apply(this, arguments); }; case 8: return function(i, s, l, c, d, L, _, p) { return t.apply(this, arguments); }; case 9: return function(i, s, l, c, d, L, _, p, m) { return t.apply(this, arguments); }; case 10: return function(i, s, l, c, d, L, _, p, m, f) { return t.apply(this, arguments); }; default: throw new Error("First argument to _arity must be a non-negative integer no greater than ten"); } } return pr = n, pr; } var mr, j_; function Fw() { if (j_) return mr; j_ = 1; function n(e, t) { return function() { return t.call(this, e.apply(this, arguments)); }; } return mr = n, mr; } var hr, X_; function wu() { if (X_) return hr; X_ = 1; function n(e) { return e != null && typeof e == "object" && e["@@functional/placeholder"] === !0; } return hr = n, hr; } var fr, J_; function P6() { if (J_) return fr; J_ = 1; var n = /* @__PURE__ */ wu(); function e(t) { return function i(s) { return arguments.length === 0 || n(s) ? i : t.apply(this, arguments); }; } return fr = e, fr; } var Er, eg; function MS() { if (eg) return Er; eg = 1; var n = /* @__PURE__ */ P6(), e = /* @__PURE__ */ wu(); function t(i) { return function s(l, c) { switch (arguments.length) { case 0: return s; case 1: return e(l) ? s : n(function(d) { return i(l, d); }); default: return e(l) && e(c) ? s : e(l) ? n(function(d) { return i(d, c); }) : e(c) ? n(function(d) { return i(l, d); }) : i(l, c); } }; } return Er = t, Er; } var Sr, tg; function Mu() { if (tg) return Sr; tg = 1; var n = /* @__PURE__ */ P6(), e = /* @__PURE__ */ MS(), t = /* @__PURE__ */ wu(); function i(s) { return function l(c, d, L) { switch (arguments.length) { case 0: return l; case 1: return t(c) ? l : e(function(_, p) { return s(c, _, p); }); case 2: return t(c) && t(d) ? l : t(c) ? e(function(_, p) { return s(_, d, p); }) : t(d) ? e(function(_, p) { return s(c, _, p); }) : n(function(_) { return s(c, d, _); }); default: return t(c) && t(d) && t(L) ? l : t(c) && t(d) ? e(function(_, p) { return s(_, p, L); }) : t(c) && t(L) ? e(function(_, p) { return s(_, d, p); }) : t(d) && t(L) ? e(function(_, p) { return s(c, _, p); }) : t(c) ? n(function(_) { return s(_, d, L); }) : t(d) ? n(function(_) { return s(c, _, L); }) : t(L) ? n(function(_) { return s(c, d, _); }) : s(c, d, L); } }; } return Sr = i, Sr; } var Tr, ng; function AS() { return ng || (ng = 1, Tr = Array.isArray || function(e) { return e != null && e.length >= 0 && Object.prototype.toString.call(e) === "[object Array]"; }), Tr; } var vr, ig; function Uw() { if (ig) return vr; ig = 1; function n(e) { return Object.prototype.toString.call(e) === "[object String]"; } return vr = n, vr; } var Rr, rg; function Zw() { if (rg) return Rr; rg = 1; var n = /* @__PURE__ */ P6(), e = /* @__PURE__ */ AS(), t = /* @__PURE__ */ Uw(), i = /* @__PURE__ */ n(function(l) { return e(l) ? !0 : !l || typeof l != "object" || t(l) ? !1 : l.length === 0 ? !0 : l.length > 0 ? l.hasOwnProperty(0) && l.hasOwnProperty(l.length - 1) : !1; }); return Rr = i, Rr; } var br, ag; function Bw() { if (ag) return br; ag = 1; var n = /* @__PURE__ */ (function() { function t(i) { this.f = i; } return t.prototype["@@transducer/init"] = function() { throw new Error("init not implemented on XWrap"); }, t.prototype["@@transducer/result"] = function(i) { return i; }, t.prototype["@@transducer/step"] = function(i, s) { return this.f(i, s); }, t; })(); function e(t) { return new n(t); } return br = e, br; } var xr, sg; function Gw() { if (sg) return xr; sg = 1; var n = /* @__PURE__ */ wS(), e = /* @__PURE__ */ MS(), t = /* @__PURE__ */ e(function(s, l) { return n(s.length, function() { return s.apply(l, arguments); }); }); return xr = t, xr; } var wr, og; function zw() { if (og) return wr; og = 1; var n = /* @__PURE__ */ Zw(), e = /* @__PURE__ */ Bw(), t = /* @__PURE__ */ Gw(); function i(L, _, p) { for (var m = 0, f = p.length; m < f; ) { if (_ = L["@@transducer/step"](_, p[m]), _ && _["@@transducer/reduced"]) { _ = _["@@transducer/value"]; break; } m += 1; } return L["@@transducer/result"](_); } function s(L, _, p) { for (var m = p.next(); !m.done; ) { if (_ = L["@@transducer/step"](_, m.value), _ && _["@@transducer/reduced"]) { _ = _["@@transducer/value"]; break; } m = p.next(); } return L["@@transducer/result"](_); } function l(L, _, p, m) { return L["@@transducer/result"](p[m](t(L["@@transducer/step"], L), _)); } var c = typeof Symbol < "u" ? Symbol.iterator : "@@iterator"; function d(L, _, p) { if (typeof L == "function" && (L = e(L)), n(p)) return i(L, _, p); if (typeof p["fantasy-land/reduce"] == "function") return l(L, _, p, "fantasy-land/reduce"); if (p[c] != null) return s(L, _, p[c]()); if (typeof p.next == "function") return s(L, _, p); if (typeof p.reduce == "function") return l(L, _, p, "reduce"); throw new TypeError("reduce: list must be array or iterable"); } return wr = d, wr; } var Mr, lg; function Hw() { if (lg) return Mr; lg = 1; var n = /* @__PURE__ */ Mu(), e = /* @__PURE__ */ zw(), t = /* @__PURE__ */ n(e); return Mr = t, Mr; } var Ar, cg; function yS() { if (cg) return Ar; cg = 1; var n = /* @__PURE__ */ AS(); function e(t, i) { return function() { var s = arguments.length; if (s === 0) return i(); var l = arguments[s - 1]; return n(l) || typeof l[t] != "function" ? i.apply(this, arguments) : l[t].apply(l, Array.prototype.slice.call(arguments, 0, s - 1)); }; } return Ar = e, Ar; } var yr, ug; function Yw() { if (ug) return yr; ug = 1; var n = /* @__PURE__ */ yS(), e = /* @__PURE__ */ Mu(), t = /* @__PURE__ */ e( /* @__PURE__ */ n("slice", function(s, l, c) { return Array.prototype.slice.call(c, s, l); }) ); return yr = t, yr; } var Nr, dg; function Vw() { if (dg) return Nr; dg = 1; var n = /* @__PURE__ */ yS(), e = /* @__PURE__ */ P6(), t = /* @__PURE__ */ Yw(), i = /* @__PURE__ */ e( /* @__PURE__ */ n( "tail", /* @__PURE__ */ t(1, 1 / 0) ) ); return Nr = i, Nr; } var Or, Lg; function qw() { if (Lg) return Or; Lg = 1; var n = /* @__PURE__ */ wS(), e = /* @__PURE__ */ Fw(), t = /* @__PURE__ */ Hw(), i = /* @__PURE__ */ Vw(); function s() { if (arguments.length === 0) throw new Error("pipe requires at least one argument"); return n(arguments[0].length, t(e, arguments[0], i(arguments))); } return Or = s, Or; } var Ww = /* @__PURE__ */ qw(); const $w = /* @__PURE__ */ it(Ww); var Ir, Cg; function Kw() { if (Cg) return Ir; Cg = 1; var n = /* @__PURE__ */ Mu(), e = /* @__PURE__ */ n(function(i, s, l) { return l.replace(i, s); }); return Ir = e, Ir; } var Qw = /* @__PURE__ */ Kw(); const M0 = /* @__PURE__ */ it(Qw), jw = M0(/[\n\r]/g, " "), Xw = M0(/\s+/g, " "), Jw = M0(/\s*([,;.])\s*/g, "$1"), eM = M0( /\s*($)\s*|\s*($)/g, "$1$2" ), tM = M0(/\s+$/g, ""), nM = M0(/^"(.*)"$/, "$1"), NS = $w( jw, Xw, Jw, eM, tM, nM ), Au = (n, e) => { let t = e; for (n[t] === ` ` && t--; t >= 0; ) { if (n[t] === ` `) return t + 1; t--; } return 0; }, OS = (n, e) => { const t = Au(n, e); if (t === 0) return 0; let i = t - 2; for (; i >= 0; ) { if (n[i] === ` `) return i + 1; i--; } return 0; }, iM = (n, e) => { const t = Au(n, e); if (t === 0) return ""; const i = OS(n, e); return n.slice(i, t); }; class rM extends K.error.ErrorListener { syntaxError(e, t, i, s, l) { } } function aM(n) { const e = new K.InputStream(n), t = new f2(e), i = new K.CommonTokenStream(t), s = new T(i); return s.addErrorListener(new rM()), s._syntaxErrors ? null : s.prog(); } K.ParserRuleContext.prototype.getFormattedText = function() { const n = this.parser.getTokenStream().getText(this.getSourceInterval()); return NS(n); }; K.ParserRuleContext.prototype.getComment = function() { let n = this.start.tokenIndex, e = f2.channelNames.indexOf("COMMENT_CHANNEL"); this.constructor.name === "BraceBlockContext" && (n = this.stop.tokenIndex); let t = this.parser.getTokenStream().getHiddenTokensToLeft(n, e); return t && t.map((i) => i.text.substring(2)).join(` `); }; K.ParserRuleContext.prototype.returnedValue = function() { return this.braceBlock().block().ret().value(); }; const sM = aM, _g = T.GroupContext, gg = T.ParticipantContext, Cn = function(n) { return Ge.getParticipants(n); }; var o6 = /* @__PURE__ */ ((n) => (n[n.MessageContent = 0] = "MessageContent", n[n.ParticipantName = 1] = "ParticipantName", n))(o6 || {}); let yu = {}; const IS = {}, jl = (n) => { if (n != null) { const e = yu[n] ?? IS[n]; return e !== void 0 ? e : null; } return null; }, Xl = (n, e, t = !1) => { yu[n] = e, t && (IS[n] = e); }, DS = () => { yu = {}; }; function oM(n, e) { const t = `WidthProviderOnBrowser_${n}_${e}`, i = jl(t); if (i != null) return i; let s = document.querySelector( ".textarea-hidden-div" ); if (!s) { const c = document.createElement("div"); c.className = "textarea-hidden-div ", c.style.fontSize = e === o6.MessageContent ? "0.875rem" : "1rem", c.style.fontFamily = "Helvetica, Verdana, serif", c.style.display = "inline", c.style.whiteSpace = "nowrap", c.style.visibility = "hidden", c.style.position = "absolute", c.style.top = "0", c.style.left = "0", c.style.overflow = "hidden", c.style.width = "0px", c.style.paddingLeft = "0px", c.style.paddingRight = "0px", c.style.margin = "0px", c.style.border = "0px", document.body.appendChild(c), s = c; } s.textContent = n; const l = s.scrollWidth; return Xl(t, l, !0), l; } const pg = 10, kS = 100, lM = 20, cM = 10, PS = 15, Y8 = (PS - 1) / 2, uM = 80, dM = 70, FS = 1; var C0 = /* @__PURE__ */ ((n) => (n[n.SyncMessage = 0] = "SyncMessage", n[n.AsyncMessage = 1] = "AsyncMessage", n[n.CreationMessage = 2] = "CreationMessage", n[n.ReturnMessage = 3] = "ReturnMessage", n))(C0 || {}); class LM extends X { constructor() { super(...arguments); h2(this, "isBlind", !1); h2(this, "ownableMessages", []); h2(this, "enterMessage", (t) => this._addOwnedMessage(C0.SyncMessage)(t)); h2(this, "enterAsyncMessage", (t) => this._addOwnedMessage(C0.AsyncMessage)(t)); h2(this, "enterCreation", (t) => this._addOwnedMessage(C0.CreationMessage)(t)); h2(this, "enterRet", (t) => { t.asyncMessage() || this._addOwnedMessage(C0.ReturnMessage)(t); }); h2(this, "_addOwnedMessage", (t) => (i) => { if (this.isBlind) return; const s = i.From(), l = i == null ? void 0 : i.Owner(); let c = i == null ? void 0 : i.SignatureText(); if (s === l && i.Assignment) { const d = i.Assignment(); d && (c = `${d.getText()} = ${c}`); } this.ownableMessages.push({ from: s, signature: c, type: t, to: l }); }); } enterParameters() { this.isBlind = !0; } exitParameters() { this.isBlind = !1; } result() { return this.ownableMessages; } } function F6(n) { const e = K.tree.ParseTreeWalker.DEFAULT, t = new LM(); return e.walk(t, n), t.result(); } const Be = "_STARTER_"; let CM = class { constructor(e, t, i, s) { h2(this, "name"); h2(this, "left"); h2(this, "label"); h2(this, "type"); this.name = e, this.left = t, this.label = i, this.type = s; } getDisplayName() { return this.label || this.name; } hasIcon() { return this.type !== void 0; } }; function _M(n) { const e = Ge.getParticipants(n), t = Array.from(e.participants.entries()), i = F6(n), s = i.length === 0 && t.length === 0, l = i.some((d) => !d.from); return (s || l) && t.unshift([ Be, { ...CS, name: Be, isStarter: !0 } ]), t.map((d, L, _) => { const p = d[1], m = L > 0 ? _[L - 1][1].name : ""; return new CM( p.name, m, p.label, p.type ); }); } function U6(n, e) { return { position: n, velocity: e }; } function mg(n, e) { return U6(n.position + e.position, n.velocity + e.velocity); } const hg = Math.sqrt(Number.EPSILON); function gM(n, e) { const t = n.position - e.position; return t < -hg || Math.abs(t) <= hg && n.velocity < e.velocity; } function pM() { return { delta: 1 / 0, dualLessThan: function(n, e) { const t = gM(n, e); return t && ([n, e] = [e, n]), n.velocity < e.velocity && (this.delta = Math.min( this.delta, (n.position - e.position) / (e.velocity - n.velocity) )), t; } }; } function mM(n, e) { const t = Array(); for (let i = 0; i < n; i++) { t.push([]); for (let s = 0; s < i; s++) e[s][i] > 0 && t[i].push({ i: s, length: U6(e[s][i], 0) }); } return t; } function hM(n, e) { const t = pM(); let i = U6(0, 0); const s = []; for (let l = 0; l < n.length; l++) { let c = null; l > 0 && (i = mg(i, e[l - 1])); for (const d of n[l]) { const L = mg(s[d.i].maximum, d.length); t.dualLessThan(i, L) && (c = d.i, i = L); } s.push({ argument: c, maximum: i }); } return [t.delta, s]; } function fM(n, e, t) { let i = n.length - 1; for (; i > 0; ) { const s = n[i].argument; s !== null ? i = s : (i--, t[i].velocity = 0); } } function EM(n, e) { for (let t = 0; t < n.length; t++) n[t].position += n[t].velocity * e; } function SM(n) { const e = []; for (const t of n) e.push(t.maximum.position); return e; } function TM(n) { const e = n.length, t = mM(e, n), i = []; for (let s = 1; s < e; s++) i.push(U6(0, 1)); for (; ; ) { const [s, l] = hM(t, i); if (s == 1 / 0) return SM(l); l[e - 1].maximum.velocity > 0 ? fM(l, t, i) : EM(i, s); } } class vM { constructor(e, t) { h2(this, "m", []); h2(this, "widthProvider"); h2(this, "participantModels"); h2(this, "ownableMessages"); DS(), this.participantModels = _M(e), this.ownableMessages = F6(e), this.widthProvider = t, this.walkThrough(); } orderedParticipantNames() { return this.participantModels.map((e) => e.name); } getPosition(e) { if (!e) return 0; if (!this.getParticipantModel(e)) return console.warn(`Participant ${e} not found`), 0; const i = `getPosition_${e}`, s = jl(i); if (s != null) return s; const l = this.participantModels.findIndex( (L) => L.name === e ), d = this.getParticipantGap(this.participantModels[0]) + TM(this.m)[l]; return Xl(i, d), console.debug(`Position of ${e} is ${d}`), d; } walkThrough() { this.withParticipantGaps(this.participantModels), this.withMessageGaps(this.ownableMessages, this.participantModels); } half(e) { const t = this.getParticipantModel(e); return t ? this._getParticipantWidth(t) / 2 : 0; } left(e) { return this.getPosition(e) - this.half(e); } right(e) { return this.getPosition(e) + this.half(e); } getWidth() { const e = this.participantModels[this.participantModels.length - 1].name, t = this.getPosition(e) + this.half(e); return Math.max(t, 200); } distance(e, t) { return this.getPosition(t) - this.getPosition(e); } getMessageWidth(e) { const t = this.half(e.to); let i = this.widthProvider( e.signature, o6.MessageContent ); return e.type === C0.CreationMessage && (i += t), i; } withMessageGaps(e, t) { for (const i of e) { i.from || (i.from = Be); const s = t.findIndex( (L) => L.name === i.from ), l = t.findIndex((L) => L.name === i.to); if (s === -1 || l === -1) { console.warn(`Participant ${i.from} or ${i.to} not found`); continue; } const c = Math.min(s, l), d = Math.max(s, l); try { const L = this.getMessageWidth(i); this.m[c][d] = Math.max( L + cM + PS, this.m[c][d] ); } catch { console.warn( `Could not set message gap between ${i.from} and ${i.to}` ); } } } withParticipantGaps(e) { this.m = e.map((t, i) => e.map((s, l) => l - i === 1 ? this.getParticipantGap(s) : 0)); } getParticipantGap(e) { return this.half(e.left) + this.half(e.name); } getParticipantModel(e) { return this.participantModels.find((t) => t.name === e); } _getParticipantWidth(e) { const t = `getParticipantWidth_${e.name}`, i = jl(t); if (i != null) return i; const l = e.hasIcon() ? 40 : 0, c = this.widthProvider( e.getDisplayName(), o6.ParticipantName ), d = Math.max(c + l, uM) + lM; return Xl(t, d), console.debug( `Width of ${e.name} is ${d}; labelWidth: ${c}` ), d; } } var J3 = /* @__PURE__ */ ((n) => (n.Static = "static", n.Dynamic = "dynamic", n))(J3 || {}); const x9 = J1(""), A0 = J1((n) => sM(n(x9))); J1( (n) => { var e, t; return (t = (e = n(A0)) == null ? void 0 : e.title()) == null ? void 0 : t.content(); } ); const Z6 = J1( (n) => Cn(n(A0)) ), t4 = J1( (n) => new vM(n(A0), oM) ), g0 = J1("theme-default"), Jl = J1(!1), RM = ME( `${location.hostname}-zenuml-theme-icon-dot`, "1" ), US = J1(!0), ZS = J1(1), V8 = J1([]), bM = J1(null, (n, e, t) => { const i = n(V8); i.includes(t) ? e( V8, i.filter((s) => s !== t) ) : e(V8, [...i, t]); }), Nu = J1(null), BS = J1(!1), at = J1( "dynamic" /* Dynamic */ ), GS = ME( `${location.hostname}-zenuml-numbering`, !0 ), zS = J1(0), Ou = J1(null), Iu = on( (n) => { console.log("Element clicked", n); } ), Du = on(() => { }), _n = on(() => { }), fg = on(() => { }), HS = on(() => { }), ku = J1([]), Eg = J1((n) => { const e = n(ku), { participants: t } = n(Z6); return e.length === Array.from(t).length; }); function xM(n, e) { if (n.match(/^[a-z]+:\/\//i)) return n; if (n.match(/^\/\//)) return window.location.protocol + n; if (n.match(/^[a-z]+:/i)) return n; const t = document.implementation.createHTMLDocument(), i = t.createElement("base"), s = t.createElement("a"); return t.head.appendChild(i), t.body.appendChild(s), e && (i.href = e), s.href = n, s.href; } const wM = /* @__PURE__ */ (() => { let n = 0; const e = () => ( // eslint-disable-next-line no-bitwise `0000${(Math.random() * 36 ** 4 << 0).toString(36)}`.slice(-4) ); return () => (n += 1, `u${e()}${n}`); })(); function Yt(n) { const e = []; for (let t = 0, i = n.length; t < i; t++) e.push(n[t]); return e; } let c0 = null; function YS(n = {}) { return c0 || (n.includeStyleProperties ? (c0 = n.includeStyleProperties, c0) : (c0 = Yt(window.getComputedStyle(document.documentElement)), c0)); } function l6(n, e) { const i = (n.ownerDocument.defaultView || window).getComputedStyle(n).getPropertyValue(e); return i ? parseFloat(i.replace("px", "")) : 0; } function MM(n) { const e = l6(n, "border-left-width"), t = l6(n, "border-right-width"); return n.clientWidth + e + t; } function AM(n) { const e = l6(n, "border-top-width"), t = l6(n, "border-bottom-width"); return n.clientHeight + e + t; } function VS(n, e = {}) { const t = e.width || MM(n), i = e.height || AM(n); return { width: t, height: i }; } function yM() { let n, e; try { e = process; } catch { } const t = e && e.env ? e.env.devicePixelRatio : null; return t && (n = parseInt(t, 10), Number.isNaN(n) && (n = 1)), n || window.devicePixelRatio || 1; } const O3 = 16384; function NM(n) { (n.width > O3 || n.height > O3) && (n.width > O3 && n.height > O3 ? n.width > n.height ? (n.height *= O3 / n.width, n.width = O3) : (n.width *= O3 / n.height, n.height = O3) : n.width > O3 ? (n.height *= O3 / n.width, n.width = O3) : (n.width *= O3 / n.height, n.height = O3)); } function OM(n, e = {}) { return n.toBlob ? new Promise((t) => { n.toBlob(t, e.type ? e.type : "image/png", e.quality ? e.quality : 1); }) : new Promise((t) => { const i = window.atob(n.toDataURL(e.type ? e.type : void 0, e.quality ? e.quality : void 0).split(",")[1]), s = i.length, l = new Uint8Array(s); for (let c = 0; c < s; c += 1) l[c] = i.charCodeAt(c); t(new Blob([l], { type: e.type ? e.type : "image/png" })); }); } function c6(n) { return new Promise((e, t) => { const i = new Image(); i.onload = () => { i.decode().then(() => { requestAnimationFrame(() => e(i)); }); }, i.onerror = t, i.crossOrigin = "anonymous", i.decoding = "async", i.src = n; }); } async function IM(n) { return Promise.resolve().then(() => new XMLSerializer().serializeToString(n)).then(encodeURIComponent).then((e) => `data:image/svg+xml;charset=utf-8,${e}`); } async function DM(n, e, t) { const i = "http://www.w3.org/2000/svg", s = document.createElementNS(i, "svg"), l = document.createElementNS(i, "foreignObject"); return s.setAttribute("width", `${e}`), s.setAttribute("height", `${t}`), s.setAttribute("viewBox", `0 0 ${e} ${t}`), l.setAttribute("width", "100%"), l.setAttribute("height", "100%"), l.setAttribute("x", "0"), l.setAttribute("y", "0"), l.setAttribute("externalResourcesRequired", "true"), s.appendChild(l), l.appendChild(n), IM(s); } const C3 = (n, e) => { if (n instanceof e) return !0; const t = Object.getPrototypeOf(n); return t === null ? !1 : t.constructor.name === e.name || C3(t, e); }; function kM(n) { const e = n.getPropertyValue("content"); return `${n.cssText} content: '${e.replace(/'|"/g, "")}';`; } function PM(n, e) { return YS(e).map((t) => { const i = n.getPropertyValue(t), s = n.getPropertyPriority(t); return `${t}: ${i}${s ? " !important" : ""};`; }).join(" "); } function FM(n, e, t, i) { const s = `.${n}:${e}`, l = t.cssText ? kM(t) : PM(t, i); return document.createTextNode(`${s}{${l}}`); } function Sg(n, e, t, i) { const s = window.getComputedStyle(n, t), l = s.getPropertyValue("content"); if (l === "" || l === "none") return; const c = wM(); try { e.className = `${e.className} ${c}`; } catch { return; } const d = document.createElement("style"); d.appendChild(FM(c, t, s, i)), e.appendChild(d); } function UM(n, e, t) { Sg(n, e, ":before", t), Sg(n, e, ":after", t); } const Tg = "application/font-woff", vg = "image/jpeg", ZM = { woff: Tg, woff2: Tg, ttf: "application/font-truetype", eot: "application/vnd.ms-fontobject", png: "image/png", jpg: vg, jpeg: vg, gif: "image/gif", tiff: "image/tiff", svg: "image/svg+xml", webp: "image/webp" }; function BM(n) { const e = /\.([^./]*?)$/g.exec(n); return e ? e[1] : ""; } function Pu(n) { const e = BM(n).toLowerCase(); return ZM[e] || ""; } function GM(n) { return n.split(/,/)[1]; } function ec(n) { return n.search(/^(data:)/) !== -1; } function zM(n, e) { return `data:${e};base64,${n}`; } async function qS(n, e, t) { const i = await fetch(n, e); if (i.status === 404) throw new Error(`Resource "${i.url}" not found`); const s = await i.blob(); return new Promise((l, c) => { const d = new FileReader(); d.onerror = c, d.onloadend = () => { try { l(t({ res: i, result: d.result })); } catch (L) { c(L); } }, d.readAsDataURL(s); }); } const Dr = {}; function HM(n, e, t) { let i = n.replace(/\?.*/, ""); return t && (i = n), /ttf|otf|eot|woff2?/i.test(i) && (i = i.replace(/.*\//, "")), e ? `[${e}]${i}` : i; } async function Fu(n, e, t) { const i = HM(n, e, t.includeQueryParams); if (Dr[i] != null) return Dr[i]; t.cacheBust && (n += (/\?/.test(n) ? "&" : "?") + (/* @__PURE__ */ new Date()).getTime()); let s; try { const l = await qS(n, t.fetchRequestInit, ({ res: c, result: d }) => (e || (e = c.headers.get("Content-Type") || ""), GM(d))); s = zM(l, e); } catch (l) { s = t.imagePlaceholder || ""; let c = `Failed to fetch resource: ${n}`; l && (c = typeof l == "string" ? l : l.message), c && console.warn(c); } return Dr[i] = s, s; } async function YM(n) { const e = n.toDataURL(); return e === "data:," ? n.cloneNode(!1) : c6(e); } async function VM(n, e) { if (n.currentSrc) { const l = document.createElement("canvas"), c = l.getContext("2d"); l.width = n.clientWidth, l.height = n.clientHeight, c == null || c.drawImage(n, 0, 0, l.width, l.height); const d = l.toDataURL(); return c6(d); } const t = n.poster, i = Pu(t), s = await Fu(t, i, e); return c6(s); } async function qM(n, e) { var t; try { if (!((t = n == null ? void 0 : n.contentDocument) === null || t === void 0) && t.body) return await B6(n.contentDocument.body, e, !0); } catch { } return n.cloneNode(!1); } async function WM(n, e) { return C3(n, HTMLCanvasElement) ? YM(n) : C3(n, HTMLVideoElement) ? VM(n, e) : C3(n, HTMLIFrameElement) ? qM(n, e) : n.cloneNode(WS(n)); } const $M = (n) => n.tagName != null && n.tagName.toUpperCase() === "SLOT", WS = (n) => n.tagName != null && n.tagName.toUpperCase() === "SVG"; async function KM(n, e, t) { var i, s; if (WS(e)) return e; let l = []; return $M(n) && n.assignedNodes ? l = Yt(n.assignedNodes()) : C3(n, HTMLIFrameElement) && (!((i = n.contentDocument) === null || i === void 0) && i.body) ? l = Yt(n.contentDocument.body.childNodes) : l = Yt(((s = n.shadowRoot) !== null && s !== void 0 ? s : n).childNodes), l.length === 0 || C3(n, HTMLVideoElement) || await l.reduce((c, d) => c.then(() => B6(d, t)).then((L) => { L && e.appendChild(L); }), Promise.resolve()), e; } function QM(n, e, t) { const i = e.style; if (!i) return; const s = window.getComputedStyle(n); s.cssText ? (i.cssText = s.cssText, i.transformOrigin = s.transformOrigin) : YS(t).forEach((l) => { let c = s.getPropertyValue(l); l === "font-size" && c.endsWith("px") && (c = `${Math.floor(parseFloat(c.substring(0, c.length - 2))) - 0.1}px`), C3(n, HTMLIFrameElement) && l === "display" && c === "inline" && (c = "block"), l === "d" && e.getAttribute("d") && (c = `path(${e.getAttribute("d")})`), i.setProperty(l, c, s.getPropertyPriority(l)); }); } function jM(n, e) { C3(n, HTMLTextAreaElement) && (e.innerHTML = n.value), C3(n, HTMLInputElement) && e.setAttribute("value", n.value); } function XM(n, e) { if (C3(n, HTMLSelectElement)) { const t = e, i = Array.from(t.children).find((s) => n.value === s.getAttribute("value")); i && i.setAttribute("selected", ""); } } function JM(n, e, t) { return C3(e, Element) && (QM(n, e, t), UM(n, e, t), jM(n, e), XM(n, e)), e; } async function eA(n, e) { const t = n.querySelectorAll ? n.querySelectorAll("use") : []; if (t.length === 0) return n; const i = {}; for (let l = 0; l < t.length; l++) { const d = t[l].getAttribute("xlink:href"); if (d) { const L = n.querySelector(d), _ = document.querySelector(d); !L && _ && !i[d] && (i[d] = await B6(_, e, !0)); } } const s = Object.values(i); if (s.length) { const l = "http://www.w3.org/1999/xhtml", c = document.createElementNS(l, "svg"); c.setAttribute("xmlns", l), c.style.position = "absolute", c.style.width = "0", c.style.height = "0", c.style.overflow = "hidden", c.style.display = "none"; const d = document.createElementNS(l, "defs"); c.appendChild(d); for (let L = 0; L < s.length; L++) d.appendChild(s[L]); n.appendChild(c); } return n; } async function B6(n, e, t) { return !t && e.filter && !e.filter(n) ? null : Promise.resolve(n).then((i) => WM(i, e)).then((i) => KM(n, i, e)).then((i) => JM(n, i, e)).then((i) => eA(i, e)); } const $S = /url$(['"]?)([^'"]+?)\1$/g, tA = /url$[^)]+$\s*format$(["']?)([^"']+)\1$/g, nA = /src:\s*(?:url$[^)]+$\s*format$[^)]+$[,;]\s*)+/g; function iA(n) { const e = n.replace(/([.*+?^${}()|\[\]\/\\])/g, "\\$1"); return new RegExp(`(url\$['"]?)(${e})(['"]?\$)`, "g"); } function rA(n) { const e = []; return n.replace($S, (t, i, s) => (e.push(s), t)), e.filter((t) => !ec(t)); } async function aA(n, e, t, i, s) { try { const l = t ? xM(e, t) : e, c = Pu(e); let d; return s || (d = await Fu(l, c, i)), n.replace(iA(e), `$1${d}$3`); } catch { } return n; } function sA(n, { preferredFontFormat: e }) { return e ? n.replace(nA, (t) => { for (; ; ) { const [i, , s] = tA.exec(t) || []; if (!s) return ""; if (s === e) return `src: ${i};`; } }) : n; } function KS(n) { return n.search($S) !== -1; } async function QS(n, e, t) { if (!KS(n)) return n; const i = sA(n, t); return rA(i).reduce((l, c) => l.then((d) => aA(d, c, e, t)), Promise.resolve(i)); } async function u0(n, e, t) { var i; const s = (i = e.style) === null || i === void 0 ? void 0 : i.getPropertyValue(n); if (s) { const l = await QS(s, null, t); return e.style.setProperty(n, l, e.style.getPropertyPriority(n)), !0; } return !1; } async function oA(n, e) { await u0("background", n, e) || await u0("background-image", n, e), await u0("mask", n, e) || await u0("-webkit-mask", n, e) || await u0("mask-image", n, e) || await u0("-webkit-mask-image", n, e); } async function lA(n, e) { const t = C3(n, HTMLImageElement); if (!(t && !ec(n.src)) && !(C3(n, SVGImageElement) && !ec(n.href.baseVal))) return; const i = t ? n.src : n.href.baseVal, s = await Fu(i, Pu(i), e); await new Promise((l, c) => { n.onload = l, n.onerror = e.onImageErrorHandler ? (...L) => { try { l(e.onImageErrorHandler(...L)); } catch (_) { c(_); } } : c; const d = n; d.decode && (d.decode = l), d.loading === "lazy" && (d.loading = "eager"), t ? (n.srcset = "", n.src = s) : n.href.baseVal = s; }); } async function cA(n, e) { const i = Yt(n.childNodes).map((s) => jS(s, e)); await Promise.all(i).then(() => n); } async function jS(n, e) { C3(n, Element) && (await oA(n, e), await lA(n, e), await cA(n, e)); } function uA(n, e) { const { style: t } = n; e.backgroundColor && (t.backgroundColor = e.backgroundColor), e.width && (t.width = `${e.width}px`), e.height && (t.height = `${e.height}px`); const i = e.style; return i != null && Object.keys(i).forEach((s) => { t[s] = i[s]; }), n; } const Rg = {}; async function bg(n) { let e = Rg[n]; if (e != null) return e; const i = await (await fetch(n)).text(); return e = { url: n, cssText: i }, Rg[n] = e, e; } async function xg(n, e) { let t = n.cssText; const i = /url$["']?([^"')]+)["']?$/g, l = (t.match(/url$[^)]+$/g) || []).map(async (c) => { let d = c.replace(i, "$1"); return d.startsWith("https://") || (d = new URL(d, n.url).href), qS(d, e.fetchRequestInit, ({ result: L }) => (t = t.replace(c, `url(${L})`), [c, L])); }); return Promise.all(l).then(() => t); } function wg(n) { if (n == null) return []; const e = [], t = /(\/\*[\s\S]*?\*\/)/gi; let i = n.replace(t, ""); const s = new RegExp("((@.*?keyframes [\\s\\S]*?){([\\s\\S]*?}\\s*?)})", "gi"); for (; ; ) { const L = s.exec(i); if (L === null) break; e.push(L[0]); } i = i.replace(s, ""); const l = /@import[\s\S]*?url$[^)]*$[\s\S]*?;/gi, c = "((\\s*?(?:\\/\\*[\\s\\S]*?\\*\\/)?\\s*?@media[\\s\\S]*?){([\\s\\S]*?)}\\s*?})|(([\\s\\S]*?){([\\s\\S]*?)})", d = new RegExp(c, "gi"); for (; ; ) { let L = l.exec(i); if (L === null) { if (L = d.exec(i), L === null) break; l.lastIndex = d.lastIndex; } else d.lastIndex = l.lastIndex; e.push(L[0]); } return e; } async function dA(n, e) { const t = [], i = []; return n.forEach((s) => { if ("cssRules" in s) try { Yt(s.cssRules || []).forEach((l, c) => { if (l.type === CSSRule.IMPORT_RULE) { let d = c + 1; const L = l.href, _ = bg(L).then((p) => xg(p, e)).then((p) => wg(p).forEach((m) => { try { s.insertRule(m, m.startsWith("@import") ? d += 1 : s.cssRules.length); } catch (f) { console.error("Error inserting rule from remote css", { rule: m, error: f }); } })).catch((p) => { console.error("Error loading remote css", p.toString()); }); i.push(_); } }); } catch (l) { const c = n.find((d) => d.href == null) || document.styleSheets[0]; s.href != null && i.push(bg(s.href).then((d) => xg(d, e)).then((d) => wg(d).forEach((L) => { c.insertRule(L, c.cssRules.length); })).catch((d) => { console.error("Error loading remote stylesheet", d); })), console.error("Error inlining remote css file", l); } }), Promise.all(i).then(() => (n.forEach((s) => { if ("cssRules" in s) try { Yt(s.cssRules || []).forEach((l) => { t.push(l); }); } catch (l) { console.error(`Error while reading CSS rules from ${s.href}`, l); } }), t)); } function LA(n) { return n.filter((e) => e.type === CSSRule.FONT_FACE_RULE).filter((e) => KS(e.style.getPropertyValue("src"))); } async function CA(n, e) { if (n.ownerDocument == null) throw new Error("Provided element is not within a Document"); const t = Yt(n.ownerDocument.styleSheets), i = await dA(t, e); return LA(i); } function XS(n) { return n.trim().replace(/["']/g, ""); } function _A(n) { const e = /* @__PURE__ */ new Set(); function t(i) { (i.style.fontFamily || getComputedStyle(i).fontFamily).split(",").forEach((l) => { e.add(XS(l)); }), Array.from(i.children).forEach((l) => { l instanceof HTMLElement && t(l); }); } return t(n), e; } async function gA(n, e) { const t = await CA(n, e), i = _A(n); return (await Promise.all(t.filter((l) => i.has(XS(l.style.fontFamily))).map((l) => { const c = l.parentStyleSheet ? l.parentStyleSheet.href : null; return QS(l.cssText, c, e); }))).join(` `); } async function pA(n, e) { const t = e.fontEmbedCSS != null ? e.fontEmbedCSS : e.skipFonts ? null : await gA(n, e); if (t) { const i = document.createElement("style"), s = document.createTextNode(t); i.appendChild(s), n.firstChild ? n.insertBefore(i, n.firstChild) : n.appendChild(i); } } async function Uu(n, e = {}) { const { width: t, height: i } = VS(n, e), s = await B6(n, e, !0); return await pA(s, e), await jS(s, e), uA(s, e), await DM(s, t, i); } async function Zu(n, e = {}) { const { width: t, height: i } = VS(n, e), s = await Uu(n, e), l = await c6(s), c = document.createElement("canvas"), d = c.getContext("2d"), L = e.pixelRatio || yM(), _ = e.canvasWidth || t, p = e.canvasHeight || i; return c.width = _ * L, c.height = p * L, e.skipAutoScale || NM(c), c.style.width = `${_}`, c.style.height = `${p}`, e.backgroundColor && (d.fillStyle = e.backgroundColor, d.fillRect(0, 0, c.width, c.height)), d.drawImage(l, 0, 0, c.width, c.height), c; } async function JS(n, e = {}) { return (await Zu(n, e)).toDataURL(); } async function mA(n, e = {}) { return (await Zu(n, e)).toDataURL("image/jpeg", e.quality || 1); } async function hA(n, e = {}) { const t = await Zu(n, e); return await OM(t); } function eT(n) { var e, t, i = ""; if (typeof n == "string" || typeof n == "number") i += n; else if (typeof n == "object") if (Array.isArray(n)) { var s = n.length; for (e = 0; e < s; e++) n[e] && (t = eT(n[e])) && (i && (i += " "), i += t); } else for (t in n) n[t] && (i && (i += " "), i += t); return i; } function fA() { for (var n, e, t = 0, i = "", s = arguments.length; t < s; t++) (n = arguments[t]) && (e = eT(n)) && (i && (i += " "), i += e); return i; } const Bu = "-", EA = (n) => { const e = TA(n), { conflictingClassGroups: t, conflictingClassGroupModifiers: i } = n; return { getClassGroupId: (c) => { const d = c.split(Bu); return d[0] === "" && d.length !== 1 && d.shift(), tT(d, e) || SA(c); }, getConflictingClassGroupIds: (c, d) => { const L = t[c] || []; return d && i[c] ? [...L, ...i[c]] : L; } }; }, tT = (n, e) => { var c; if (n.length === 0) return e.classGroupId; const t = n[0], i = e.nextPart.get(t), s = i ? tT(n.slice(1), i) : void 0; if (s) return s; if (e.validators.length === 0) return; const l = n.join(Bu); return (c = e.validators.find(({ validator: d }) => d(l))) == null ? void 0 : c.classGroupId; }, Mg = /^\[(.+)\]$/, SA = (n) => { if (Mg.test(n)) { const e = Mg.exec(n)[1], t = e == null ? void 0 : e.substring(0, e.indexOf(":")); if (t) return "arbitrary.." + t; } }, TA = (n) => { const { theme: e, classGroups: t } = n, i = { nextPart: /* @__PURE__ */ new Map(), validators: [] }; for (const s in t) tc(t[s], i, s, e); return i; }, tc = (n, e, t, i) => { n.forEach((s) => { if (typeof s == "string") { const l = s === "" ? e : Ag(e, s); l.classGroupId = t; return; } if (typeof s == "function") { if (vA(s)) { tc(s(i), e, t, i); return; } e.validators.push({ validator: s, classGroupId: t }); return; } Object.entries(s).forEach(([l, c]) => { tc(c, Ag(e, l), t, i); }); }); }, Ag = (n, e) => { let t = n; return e.split(Bu).forEach((i) => { t.nextPart.has(i) || t.nextPart.set(i, { nextPart: /* @__PURE__ */ new Map(), validators: [] }), t = t.nextPart.get(i); }), t; }, vA = (n) => n.isThemeGetter, RA = (n) => { if (n < 1) return { get: () => { }, set: () => { } }; let e = 0, t = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(); const s = (l, c) => { t.set(l, c), e++, e > n && (e = 0, i = t, t = /* @__PURE__ */ new Map()); }; return { get(l) { let c = t.get(l); if (c !== void 0) return c; if ((c = i.get(l)) !== void 0) return s(l, c), c; }, set(l, c) { t.has(l) ? t.set(l, c) : s(l, c); } }; }, nc = "!", ic = ":", bA = ic.length, xA = (n) => { const { prefix: e, experimentalParseClassName: t } = n; let i = (s) => { const l = []; let c = 0, d = 0, L = 0, _; for (let v = 0; v < s.length; v++) { let R = s[v]; if (c === 0 && d === 0) { if (R === ic) { l.push(s.slice(L, v)), L = v + bA; continue; } if (R === "/") { _ = v; continue; } } R === "[" ? c++ : R === "]" ? c-- : R === "(" ? d++ : R === ")" && d--; } const p = l.length === 0 ? s : s.substring(L), m = wA(p), f = m !== p, h = _ && _ > L ? _ - L : void 0; return { modifiers: l, hasImportantModifier: f, baseClassName: m, maybePostfixModifierPosition: h }; }; if (e) { const s = e + ic, l = i; i = (c) => c.startsWith(s) ? l(c.substring(s.length)) : { isExternal: !0, modifiers: [], hasImportantModifier: !1, baseClassName: c, maybePostfixModifierPosition: void 0 }; } if (t) { const s = i; i = (l) => t({ className: l, parseClassName: s }); } return i; }, wA = (n) => n.endsWith(nc) ? n.substring(0, n.length - 1) : n.startsWith(nc) ? n.substring(1) : n, MA = (n) => { const e = Object.fromEntries(n.orderSensitiveModifiers.map((i) => [i, !0])); return (i) => { if (i.length <= 1) return i; const s = []; let l = []; return i.forEach((c) => { c[0] === "[" || e[c] ? (s.push(...l.sort(), c), l = []) : l.push(c); }), s.push(...l.sort()), s; }; }, AA = (n) => ({ cache: RA(n.cacheSize), parseClassName: xA(n), sortModifiers: MA(n), ...EA(n) }), yA = /\s+/, NA = (n, e) => { const { parseClassName: t, getClassGroupId: i, getConflictingClassGroupIds: s, sortModifiers: l } = e, c = [], d = n.trim().split(yA); let L = ""; for (let _ = d.length - 1; _ >= 0; _ -= 1) { const p = d[_], { isExternal: m, modifiers: f, hasImportantModifier: h, baseClassName: v, maybePostfixModifierPosition: R } = t(p); if (m) { L = p + (L.length > 0 ? " " + L : L); continue; } let w = !!R, M = i(w ? v.substring(0, R) : v); if (!M) { if (!w) { L = p + (L.length > 0 ? " " + L : L); continue; } if (M = i(v), !M) { L = p + (L.length > 0 ? " " + L : L); continue; } w = !1; } const N = l(f).join(":"), D = h ? N + nc : N, A = D + M; if (c.includes(A)) continue; c.push(A); const P = s(M, w); for (let W = 0; W < P.length; ++W) { const k = P[W]; c.push(D + k); } L = p + (L.length > 0 ? " " + L : L); } return L; }; function OA() { let n = 0, e, t, i = ""; for (; n < arguments.length; ) (e = arguments[n++]) && (t = nT(e)) && (i && (i += " "), i += t); return i; } const nT = (n) => { if (typeof n == "string") return n; let e, t = ""; for (let i = 0; i < n.length; i++) n[i] && (e = nT(n[i])) && (t && (t += " "), t += e); return t; }; function IA(n, ...e) { let t, i, s, l = c; function c(L) { const _ = e.reduce((p, m) => m(p), n()); return t = AA(_), i = t.cache.get, s = t.cache.set, l = d, d(L); } function d(L) { const _ = i(L); if (_) return _; const p = NA(L, t); return s(L, p), p; } return function() { return l(OA.apply(null, arguments)); }; } const he = (n) => { const e = (t) => t[n] || []; return e.isThemeGetter = !0, e; }, iT = /^\[(?:(\w[\w-]*):)?(.+)\]$/i, rT = /^$(?:(\w[\w-]*):)?(.+)$$/i, DA = /^\d+\/\d+$/, kA = /^(\d+(\.\d+)?)?(xs|sm|md|lg|xl)$/, PA = /\d+(%|px|r?em|[sdl]?v([hwib]|min|max)|pt|pc|in|cm|mm|cap|ch|ex|r?lh|cq(w|h|i|b|min|max))|\b(calc|min|max|clamp)$.+$|^0$/, FA = /^(rgba?|hsla?|hwb|(ok)?(lab|lch)|color-mix)$.+$$/, UA = /^(inset_)?-?((\d+)?\.?(\d+)[a-z]+|0)_-?((\d+)?\.?(\d+)[a-z]+|0)/, ZA = /^(url|image|image-set|cross-fade|element|(repeating-)?(linear|radial|conic)-gradient)$.+$$/, d0 = (n) => DA.test(n), r1 = (n) => !!n && !Number.isNaN(Number(n)), Pt = (n) => !!n && Number.isInteger(Number(n)), kr = (n) => n.endsWith("%") && r1(n.slice(0, -1)), j4 = (n) => kA.test(n), BA = () => !0, GA = (n) => ( // `colorFunctionRegex` check is necessary because color functions can have percentages in them which which would be incorrectly classified as lengths. // For example, `hsl(0 0% 0%)` would be classified as a length without this check. // I could also use lookbehind assertion in `lengthUnitRegex` but that isn't supported widely enough. PA.test(n) && !FA.test(n) ), aT = () => !1, zA = (n) => UA.test(n), HA = (n) => ZA.test(n), YA = (n) => !A2(n) && !y2(n), VA = (n) => y0(n, lT, aT), A2 = (n) => iT.test(n), m9 = (n) => y0(n, cT, GA), Pr = (n) => y0(n, QA, r1), yg = (n) => y0(n, sT, aT), qA = (n) => y0(n, oT, HA), N8 = (n) => y0(n, uT, zA), y2 = (n) => rT.test(n), N5 = (n) => N0(n, cT), WA = (n) => N0(n, jA), Ng = (n) => N0(n, sT), $A = (n) => N0(n, lT), KA = (n) => N0(n, oT), O8 = (n) => N0(n, uT, !0), y0 = (n, e, t) => { const i = iT.exec(n); return i ? i[1] ? e(i[1]) : t(i[2]) : !1; }, N0 = (n, e, t = !1) => { const i = rT.exec(n); return i ? i[1] ? e(i[1]) : t : !1; }, sT = (n) => n === "position" || n === "percentage", oT = (n) => n === "image" || n === "url", lT = (n) => n === "length" || n === "size" || n === "bg-size", cT = (n) => n === "length", QA = (n) => n === "number", jA = (n) => n === "family-name", uT = (n) => n === "shadow", XA = () => { const n = he("color"), e = he("font"), t = he("text"), i = he("font-weight"), s = he("tracking"), l = he("leading"), c = he("breakpoint"), d = he("container"), L = he("spacing"), _ = he("radius"), p = he("shadow"), m = he("inset-shadow"), f = he("text-shadow"), h = he("drop-shadow"), v = he("blur"), R = he("perspective"), w = he("aspect"), M = he("ease"), N = he("animate"), D = () => ["auto", "avoid", "all", "avoid-page", "page", "left", "right", "column"], A = () => [ "center", "top", "bottom", "left", "right", "top-left", // Deprecated since Tailwind CSS v4.1.0, see https://github.com/tailwindlabs/tailwindcss/pull/17378 "left-top", "top-right", // Deprecated since Tailwind CSS v4.1.0, see https://github.com/tailwindlabs/tailwindcss/pull/17378 "right-top", "bottom-right", // Deprecated since Tailwind CSS v4.1.0, see https://github.com/tailwindlabs/tailwindcss/pull/17378 "right-bottom", "bottom-left", // Deprecated since Tailwind CSS v4.1.0, see https://github.com/tailwindlabs/tailwindcss/pull/17378 "left-bottom" ], P = () => [...A(), y2, A2], W = () => ["auto", "hidden", "clip", "visible", "scroll"], k = () => ["auto", "contain", "none"], B = () => [y2, A2, L], Q = () => [d0, "full", "auto", ...B()], n2 = () => [Pt, "none", "subgrid", y2, A2], a2 = () => ["auto", { span: ["full", Pt, y2, A2] }, Pt, y2, A2], r2 = () => [Pt, "auto", y2, A2], _2 = () => ["auto", "min", "max", "fr", y2, A2], I2 = () => ["start", "end", "center", "between", "around", "evenly", "stretch", "baseline", "center-safe", "end-safe"], H = () => ["start", "end", "center", "stretch", "center-safe", "end-safe"], O = () => ["auto", ...B()], Z = () => [d0, "auto", "full", "dvw", "dvh", "lvw", "lvh", "svw", "svh", "min", "max", "fit", ...B()], G = () => [n, y2, A2], C2 = () => [...A(), Ng, yg, { position: [y2, A2] }], y = () => ["no-repeat", { repeat: ["", "x", "y", "space", "round"] }], J = () => ["auto", "cover", "contain", $A, VA, { size: [y2, A2] }], s2 = () => [kr, N5, m9], V = () => [ // Deprecated since Tailwind CSS v4.0.0 "", "none", "full", _, y2, A2 ], i2 = () => ["", r1, N5, m9], g2 = () => ["solid", "dashed", "dotted", "double"], E2 = () => ["normal", "multiply", "screen", "overlay", "darken", "lighten", "color-dodge", "color-burn", "hard-light", "soft-light", "difference", "exclusion", "hue", "saturation", "color", "luminosity"], D2 = () => [r1, kr, Ng, yg], Y2 = () => [ // Deprecated since Tailwind CSS v4.0.0 "", "none", v, y2, A2 ], g1 = () => ["none", r1, y2, A2], d1 = () => ["none", r1, y2, A2], R1 = () => [r1, y2, A2], b1 = () => [d0, "full", ...B()]; return { cacheSize: 500, theme: { animate: ["spin", "ping", "pulse", "bounce"], aspect: ["video"], blur: [j4], breakpoint: [j4], color: [BA], container: [j4], "drop-shadow": [j4], ease: ["in", "out", "in-out"], font: [YA], "font-weight": ["thin", "extralight", "light", "normal", "medium", "semibold", "bold", "extrabold", "black"], "inset-shadow": [j4], leading: ["none", "tight", "snug", "normal", "relaxed", "loose"], perspective: ["dramatic", "near", "normal", "midrange", "distant", "none"], radius: [j4], shadow: [j4], spacing: ["px", r1], text: [j4], "text-shadow": [j4], tracking: ["tighter", "tight", "normal", "wide", "wider", "widest"] }, classGroups: { // -------------- // --- Layout --- // -------------- /** * Aspect Ratio * @see https://tailwindcss.com/docs/aspect-ratio */ aspect: [{ aspect: ["auto", "square", d0, A2, y2, w] }], /** * Container * @see https://tailwindcss.com/docs/container * @deprecated since Tailwind CSS v4.0.0 */ container: ["container"], /** * Columns * @see https://tailwindcss.com/docs/columns */ columns: [{ columns: [r1, A2, y2, d] }], /** * Break After * @see https://tailwindcss.com/docs/break-after */ "break-after": [{ "break-after": D() }], /** * Break Before * @see https://tailwindcss.com/docs/break-before */ "break-before": [{ "break-before": D() }], /** * Break Inside * @see https://tailwindcss.com/docs/break-inside */ "break-inside": [{ "break-inside": ["auto", "avoid", "avoid-page", "avoid-column"] }], /** * Box Decoration Break * @see https://tailwindcss.com/docs/box-decoration-break */ "box-decoration": [{ "box-decoration": ["slice", "clone"] }], /** * Box Sizing * @see https://tailwindcss.com/docs/box-sizing */ box: [{ box: ["border", "content"] }], /** * Display * @see https://tailwindcss.com/docs/display */ display: ["block", "inline-block", "inline", "flex", "inline-flex", "table", "inline-table", "table-caption", "table-cell", "table-column", "table-column-group", "table-footer-group", "table-header-group", "table-row-group", "table-row", "flow-root", "grid", "inline-grid", "contents", "list-item", "hidden"], /** * Screen Reader Only * @see https://tailwindcss.com/docs/display#screen-reader-only */ sr: ["sr-only", "not-sr-only"], /** * Floats * @see https://tailwindcss.com/docs/float */ float: [{ float: ["right", "left", "none", "start", "end"] }], /** * Clear * @see https://tailwindcss.com/docs/clear */ clear: [{ clear: ["left", "right", "both", "none", "start", "end"] }], /** * Isolation * @see https://tailwindcss.com/docs/isolation */ isolation: ["isolate", "isolation-auto"], /** * Object Fit * @see https://tailwindcss.com/docs/object-fit */ "object-fit": [{ object: ["contain", "cover", "fill", "none", "scale-down"] }], /** * Object Position * @see https://tailwindcss.com/docs/object-position */ "object-position": [{ object: P() }], /** * Overflow * @see https://tailwindcss.com/docs/overflow */ overflow: [{ overflow: W() }], /** * Overflow X * @see https://tailwindcss.com/docs/overflow */ "overflow-x": [{ "overflow-x": W() }], /** * Overflow Y * @see https://tailwindcss.com/docs/overflow */ "overflow-y": [{ "overflow-y": W() }], /** * Overscroll Behavior * @see https://tailwindcss.com/docs/overscroll-behavior */ overscroll: [{ overscroll: k() }], /** * Overscroll Behavior X * @see https://tailwindcss.com/docs/overscroll-behavior */ "overscroll-x": [{ "overscroll-x": k() }], /** * Overscroll Behavior Y * @see https://tailwindcss.com/docs/overscroll-behavior */ "overscroll-y": [{ "overscroll-y": k() }], /** * Position * @see https://tailwindcss.com/docs/position */ position: ["static", "fixed", "absolute", "relative", "sticky"], /** * Top / Right / Bottom / Left * @see https://tailwindcss.com/docs/top-right-bottom-left */ inset: [{ inset: Q() }], /** * Right / Left * @see https://tailwindcss.com/docs/top-right-bottom-left */ "inset-x": [{ "inset-x": Q() }], /** * Top / Bottom * @see https://tailwindcss.com/docs/top-right-bottom-left */ "inset-y": [{ "inset-y": Q() }], /** * Start * @see https://tailwindcss.com/docs/top-right-bottom-left */ start: [{ start: Q() }], /** * End * @see https://tailwindcss.com/docs/top-right-bottom-left */ end: [{ end: Q() }], /** * Top * @see https://tailwindcss.com/docs/top-right-bottom-left */ top: [{ top: Q() }], /** * Right * @see https://tailwindcss.com/docs/top-right-bottom-left */ right: [{ right: Q() }], /** * Bottom * @see https://tailwindcss.com/docs/top-right-bottom-left */ bottom: [{ bottom: Q() }], /** * Left * @see https://tailwindcss.com/docs/top-right-bottom-left */ left: [{ left: Q() }], /** * Visibility * @see https://tailwindcss.com/docs/visibility */ visibility: ["visible", "invisible", "collapse"], /** * Z-Index * @see https://tailwindcss.com/docs/z-index */ z: [{ z: [Pt, "auto", y2, A2] }], // ------------------------ // --- Flexbox and Grid --- // ------------------------ /** * Flex Basis * @see https://tailwindcss.com/docs/flex-basis */ basis: [{ basis: [d0, "full", "auto", d, ...B()] }], /** * Flex Direction * @see https://tailwindcss.com/docs/flex-direction */ "flex-direction": [{ flex: ["row", "row-reverse", "col", "col-reverse"] }], /** * Flex Wrap * @see https://tailwindcss.com/docs/flex-wrap */ "flex-wrap": [{ flex: ["nowrap", "wrap", "wrap-reverse"] }], /** * Flex * @see https://tailwindcss.com/docs/flex */ flex: [{ flex: [r1, d0, "auto", "initial", "none", A2] }], /** * Flex Grow * @see https://tailwindcss.com/docs/flex-grow */ grow: [{ grow: ["", r1, y2, A2] }], /** * Flex Shrink * @see https://tailwindcss.com/docs/flex-shrink */ shrink: [{ shrink: ["", r1, y2, A2] }], /** * Order * @see https://tailwindcss.com/docs/order */ order: [{ order: [Pt, "first", "last", "none", y2, A2] }], /** * Grid Template Columns * @see https://tailwindcss.com/docs/grid-template-columns */ "grid-cols": [{ "grid-cols": n2() }], /** * Grid Column Start / End * @see https://tailwindcss.com/docs/grid-column */ "col-start-end": [{ col: a2() }], /** * Grid Column Start * @see https://tailwindcss.com/docs/grid-column */ "col-start": [{ "col-start": r2() }], /** * Grid Column End * @see https://tailwindcss.com/docs/grid-column */ "col-end": [{ "col-end": r2() }], /** * Grid Template Rows * @see https://tailwindcss.com/docs/grid-template-rows */ "grid-rows": [{ "grid-rows": n2() }], /** * Grid Row Start / End * @see https://tailwindcss.com/docs/grid-row */ "row-start-end": [{ row: a2() }], /** * Grid Row Start * @see https://tailwindcss.com/docs/grid-row */ "row-start": [{ "row-start": r2() }], /** * Grid Row End * @see https://tailwindcss.com/docs/grid-row */ "row-end": [{ "row-end": r2() }], /** * Grid Auto Flow * @see https://tailwindcss.com/docs/grid-auto-flow */ "grid-flow": [{ "grid-flow": ["row", "col", "dense", "row-dense", "col-dense"] }], /** * Grid Auto Columns * @see https://tailwindcss.com/docs/grid-auto-columns */ "auto-cols": [{ "auto-cols": _2() }], /** * Grid Auto Rows * @see https://tailwindcss.com/docs/grid-auto-rows */ "auto-rows": [{ "auto-rows": _2() }], /** * Gap * @see https://tailwindcss.com/docs/gap */ gap: [{ gap: B() }], /** * Gap X * @see https://tailwindcss.com/docs/gap */ "gap-x": [{ "gap-x": B() }], /** * Gap Y * @see https://tailwindcss.com/docs/gap */ "gap-y": [{ "gap-y": B() }], /** * Justify Content * @see https://tailwindcss.com/docs/justify-content */ "justify-content": [{ justify: [...I2(), "normal"] }], /** * Justify Items * @see https://tailwindcss.com/docs/justify-items */ "justify-items": [{ "justify-items": [...H(), "normal"] }], /** * Justify Self * @see https://tailwindcss.com/docs/justify-self */ "justify-self": [{ "justify-self": ["auto", ...H()] }], /** * Align Content * @see https://tailwindcss.com/docs/align-content */ "align-content": [{ content: ["normal", ...I2()] }], /** * Align Items * @see https://tailwindcss.com/docs/align-items */ "align-items": [{ items: [...H(), { baseline: ["", "last"] }] }], /** * Align Self * @see https://tailwindcss.com/docs/align-self */ "align-self": [{ self: ["auto", ...H(), { baseline: ["", "last"] }] }], /** * Place Content * @see https://tailwindcss.com/docs/place-content */ "place-content": [{ "place-content": I2() }], /** * Place Items * @see https://tailwindcss.com/docs/place-items */ "place-items": [{ "place-items": [...H(), "baseline"] }], /** * Place Self * @see https://tailwindcss.com/docs/place-self */ "place-self": [{ "place-self": ["auto", ...H()] }], // Spacing /** * Padding * @see https://tailwindcss.com/docs/padding */ p: [{ p: B() }], /** * Padding X * @see https://tailwindcss.com/docs/padding */ px: [{ px: B() }], /** * Padding Y * @see https://tailwindcss.com/docs/padding */ py: [{ py: B() }], /** * Padding Start * @see https://tailwindcss.com/docs/padding */ ps: [{ ps: B() }], /** * Padding End * @see https://tailwindcss.com/docs/padding */ pe: [{ pe: B() }], /** * Padding Top * @see https://tailwindcss.com/docs/padding */ pt: [{ pt: B() }], /** * Padding Right * @see https://tailwindcss.com/docs/padding */ pr: [{ pr: B() }], /** * Padding Bottom * @see https://tailwindcss.com/docs/padding */ pb: [{ pb: B() }], /** * Padding Left * @see https://tailwindcss.com/docs/padding */ pl: [{ pl: B() }], /** * Margin * @see https://tailwindcss.com/docs/margin */ m: [{ m: O() }], /** * Margin X * @see https://tailwindcss.com/docs/margin */ mx: [{ mx: O() }], /** * Margin Y * @see https://tailwindcss.com/docs/margin */ my: [{ my: O() }], /** * Margin Start * @see https://tailwindcss.com/docs/margin */ ms: [{ ms: O() }], /** * Margin End * @see https://tailwindcss.com/docs/margin */ me: [{ me: O() }], /** * Margin Top * @see https://tailwindcss.com/docs/margin */ mt: [{ mt: O() }], /** * Margin Right * @see https://tailwindcss.com/docs/margin */ mr: [{ mr: O() }], /** * Margin Bottom * @see https://tailwindcss.com/docs/margin */ mb: [{ mb: O() }], /** * Margin Left * @see https://tailwindcss.com/docs/margin */ ml: [{ ml: O() }], /** * Space Between X * @see https://tailwindcss.com/docs/margin#adding-space-between-children */ "space-x": [{ "space-x": B() }], /** * Space Between X Reverse * @see https://tailwindcss.com/docs/margin#adding-space-between-children */ "space-x-reverse": ["space-x-reverse"], /** * Space Between Y * @see https://tailwindcss.com/docs/margin#adding-space-between-children */ "space-y": [{ "space-y": B() }], /** * Space Between Y Reverse * @see https://tailwindcss.com/docs/margin#adding-space-between-children */ "space-y-reverse": ["space-y-reverse"], // -------------- // --- Sizing --- // -------------- /** * Size * @see https://tailwindcss.com/docs/width#setting-both-width-and-height */ size: [{ size: Z() }], /** * Width * @see https://tailwindcss.com/docs/width */ w: [{ w: [d, "screen", ...Z()] }], /** * Min-Width * @see https://tailwindcss.com/docs/min-width */ "min-w": [{ "min-w": [ d, "screen", /** Deprecated. @see https://github.com/tailwindlabs/tailwindcss.com/issues/2027#issuecomment-2620152757 */ "none", ...Z() ] }], /** * Max-Width * @see https://tailwindcss.com/docs/max-width */ "max-w": [{ "max-w": [ d, "screen", "none", /** Deprecated since Tailwind CSS v4.0.0. @see https://github.com/tailwindlabs/tailwindcss.com/issues/2027#issuecomment-2620152757 */ "prose", /** Deprecated since Tailwind CSS v4.0.0. @see https://github.com/tailwindlabs/tailwindcss.com/issues/2027#issuecomment-2620152757 */ { screen: [c] }, ...Z() ] }], /** * Height * @see https://tailwindcss.com/docs/height */ h: [{ h: ["screen", "lh", ...Z()] }], /** * Min-Height * @see https://tailwindcss.com/docs/min-height */ "min-h": [{ "min-h": ["screen", "lh", "none", ...Z()] }], /** * Max-Height * @see https://tailwindcss.com/docs/max-height */ "max-h": [{ "max-h": ["screen", "lh", ...Z()] }], // ------------------ // --- Typography --- // ------------------ /** * Font Size * @see https://tailwindcss.com/docs/font-size */ "font-size": [{ text: ["base", t, N5, m9] }], /** * Font Smoothing * @see https://tailwindcss.com/docs/font-smoothing */ "font-smoothing": ["antialiased", "subpixel-antialiased"], /** * Font Style * @see https://tailwindcss.com/docs/font-style */ "font-style": ["italic", "not-italic"], /** * Font Weight * @see https://tailwindcss.com/docs/font-weight */ "font-weight": [{ font: [i, y2, Pr] }], /** * Font Stretch * @see https://tailwindcss.com/docs/font-stretch */ "font-stretch": [{ "font-stretch": ["ultra-condensed", "extra-condensed", "condensed", "semi-condensed", "normal", "semi-expanded", "expanded", "extra-expanded", "ultra-expanded", kr, A2] }], /** * Font Family * @see https://tailwindcss.com/docs/font-family */ "font-family": [{ font: [WA, A2, e] }], /** * Font Variant Numeric * @see https://tailwindcss.com/docs/font-variant-numeric */ "fvn-normal": ["normal-nums"], /** * Font Variant Numeric * @see https://tailwindcss.com/docs/font-variant-numeric */ "fvn-ordinal": ["ordinal"], /** * Font Variant Numeric * @see https://tailwindcss.com/docs/font-variant-numeric */ "fvn-slashed-zero": ["slashed-zero"], /** * Font Variant Numeric * @see https://tailwindcss.com/docs/font-variant-numeric */ "fvn-figure": ["lining-nums", "oldstyle-nums"], /** * Font Variant Numeric * @see https://tailwindcss.com/docs/font-variant-numeric */ "fvn-spacing": ["proportional-nums", "tabular-nums"], /** * Font Variant Numeric * @see https://tailwindcss.com/docs/font-variant-numeric */ "fvn-fraction": ["diagonal-fractions", "stacked-fractions"], /** * Letter Spacing * @see https://tailwindcss.com/docs/letter-spacing */ tracking: [{ tracking: [s, y2, A2] }], /** * Line Clamp * @see https://tailwindcss.com/docs/line-clamp */ "line-clamp": [{ "line-clamp": [r1, "none", y2, Pr] }], /** * Line Height * @see https://tailwindcss.com/docs/line-height */ leading: [{ leading: [ /** Deprecated since Tailwind CSS v4.0.0. @see https://github.com/tailwindlabs/tailwindcss.com/issues/2027#issuecomment-2620152757 */ l, ...B() ] }], /** * List Style Image * @see https://tailwindcss.com/docs/list-style-image */ "list-image": [{ "list-image": ["none", y2, A2] }], /** * List Style Position * @see https://tailwindcss.com/docs/list-style-position */ "list-style-position": [{ list: ["inside", "outside"] }], /** * List Style Type * @see https://tailwindcss.com/docs/list-style-type */ "list-style-type": [{ list: ["disc", "decimal", "none", y2, A2] }], /** * Text Alignment * @see https://tailwindcss.com/docs/text-align */ "text-alignment": [{ text: ["left", "center", "right", "justify", "start", "end"] }], /** * Placeholder Color * @deprecated since Tailwind CSS v3.0.0 * @see https://v3.tailwindcss.com/docs/placeholder-color */ "placeholder-color": [{ placeholder: G() }], /** * Text Color * @see https://tailwindcss.com/docs/text-color */ "text-color": [{ text: G() }], /** * Text Decoration * @see https://tailwindcss.com/docs/text-decoration */ "text-decoration": ["underline", "overline", "line-through", "no-underline"], /** * Text Decoration Style * @see https://tailwindcss.com/docs/text-decoration-style */ "text-decoration-style": [{ decoration: [...g2(), "wavy"] }], /** * Text Decoration Thickness * @see https://tailwindcss.com/docs/text-decoration-thickness */ "text-decoration-thickness": [{ decoration: [r1, "from-font", "auto", y2, m9] }], /** * Text Decoration Color * @see https://tailwindcss.com/docs/text-decoration-color */ "text-decoration-color": [{ decoration: G() }], /** * Text Underline Offset * @see https://tailwindcss.com/docs/text-underline-offset */ "underline-offset": [{ "underline-offset": [r1, "auto", y2, A2] }], /** * Text Transform * @see https://tailwindcss.com/docs/text-transform */ "text-transform": ["uppercase", "lowercase", "capitalize", "normal-case"], /** * Text Overflow * @see https://tailwindcss.com/docs/text-overflow */ "text-overflow": ["truncate", "text-ellipsis", "text-clip"], /** * Text Wrap * @see https://tailwindcss.com/docs/text-wrap */ "text-wrap": [{ text: ["wrap", "nowrap", "balance", "pretty"] }], /** * Text Indent * @see https://tailwindcss.com/docs/text-indent */ indent: [{ indent: B() }], /** * Vertical Alignment * @see https://tailwindcss.com/docs/vertical-align */ "vertical-align": [{ align: ["baseline", "top", "middle", "bottom", "text-top", "text-bottom", "sub", "super", y2, A2] }], /** * Whitespace * @see https://tailwindcss.com/docs/whitespace */ whitespace: [{ whitespace: ["normal", "nowrap", "pre", "pre-line", "pre-wrap", "break-spaces"] }], /** * Word Break * @see https://tailwindcss.com/docs/word-break */ break: [{ break: ["normal", "words", "all", "keep"] }], /** * Overflow Wrap * @see https://tailwindcss.com/docs/overflow-wrap */ wrap: [{ wrap: ["break-word", "anywhere", "normal"] }], /** * Hyphens * @see https://tailwindcss.com/docs/hyphens */ hyphens: [{ hyphens: ["none", "manual", "auto"] }], /** * Content * @see https://tailwindcss.com/docs/content */ content: [{ content: ["none", y2, A2] }], // ------------------- // --- Backgrounds --- // ------------------- /** * Background Attachment * @see https://tailwindcss.com/docs/background-attachment */ "bg-attachment": [{ bg: ["fixed", "local", "scroll"] }], /** * Background Clip * @see https://tailwindcss.com/docs/background-clip */ "bg-clip": [{ "bg-clip": ["border", "padding", "content", "text"] }], /** * Background Origin * @see https://tailwindcss.com/docs/background-origin */ "bg-origin": [{ "bg-origin": ["border", "padding", "content"] }], /** * Background Position * @see https://tailwindcss.com/docs/background-position */ "bg-position": [{ bg: C2() }], /** * Background Repeat * @see https://tailwindcss.com/docs/background-repeat */ "bg-repeat": [{ bg: y() }], /** * Background Size * @see https://tailwindcss.com/docs/background-size */ "bg-size": [{ bg: J() }], /** * Background Image * @see https://tailwindcss.com/docs/background-image */ "bg-image": [{ bg: ["none", { linear: [{ to: ["t", "tr", "r", "br", "b", "bl", "l", "tl"] }, Pt, y2, A2], radial: ["", y2, A2], conic: [Pt, y2, A2] }, KA, qA] }], /** * Background Color * @see https://tailwindcss.com/docs/background-color */ "bg-color": [{ bg: G() }], /** * Gradient Color Stops From Position * @see https://tailwindcss.com/docs/gradient-color-stops */ "gradient-from-pos": [{ from: s2() }], /** * Gradient Color Stops Via Position * @see https://tailwindcss.com/docs/gradient-color-stops */ "gradient-via-pos": [{ via: s2() }], /** * Gradient Color Stops To Position * @see https://tailwindcss.com/docs/gradient-color-stops */ "gradient-to-pos": [{ to: s2() }], /** * Gradient Color Stops From * @see https://tailwindcss.com/docs/gradient-color-stops */ "gradient-from": [{ from: G() }], /** * Gradient Color Stops Via * @see https://tailwindcss.com/docs/gradient-color-stops */ "gradient-via": [{ via: G() }], /** * Gradient Color Stops To * @see https://tailwindcss.com/docs/gradient-color-stops */ "gradient-to": [{ to: G() }], // --------------- // --- Borders --- // --------------- /** * Border Radius * @see https://tailwindcss.com/docs/border-radius */ rounded: [{ rounded: V() }], /** * Border Radius Start * @see https://tailwindcss.com/docs/border-radius */ "rounded-s": [{ "rounded-s": V() }], /** * Border Radius End * @see https://tailwindcss.com/docs/border-radius */ "rounded-e": [{ "rounded-e": V() }], /** * Border Radius Top * @see https://tailwindcss.com/docs/border-radius */ "rounded-t": [{ "rounded-t": V() }], /** * Border Radius Right * @see https://tailwindcss.com/docs/border-radius */ "rounded-r": [{ "rounded-r": V() }], /** * Border Radius Bottom * @see https://tailwindcss.com/docs/border-radius */ "rounded-b": [{ "rounded-b": V() }], /** * Border Radius Left * @see https://tailwindcss.com/docs/border-radius */ "rounded-l": [{ "rounded-l": V() }], /** * Border Radius Start Start * @see https://tailwindcss.com/docs/border-radius */ "rounded-ss": [{ "rounded-ss": V() }], /** * Border Radius Start End * @see https://tailwindcss.com/docs/border-radius */ "rounded-se": [{ "rounded-se": V() }], /** * Border Radius End End * @see https://tailwindcss.com/docs/border-radius */ "rounded-ee": [{ "rounded-ee": V() }], /** * Border Radius End Start * @see https://tailwindcss.com/docs/border-radius */ "rounded-es": [{ "rounded-es": V() }], /** * Border Radius Top Left * @see https://tailwindcss.com/docs/border-radius */ "rounded-tl": [{ "rounded-tl": V() }], /** * Border Radius Top Right * @see https://tailwindcss.com/docs/border-radius */ "rounded-tr": [{ "rounded-tr": V() }], /** * Border Radius Bottom Right * @see https://tailwindcss.com/docs/border-radius */ "rounded-br": [{ "rounded-br": V() }], /** * Border Radius Bottom Left * @see https://tailwindcss.com/docs/border-radius */ "rounded-bl": [{ "rounded-bl": V() }], /** * Border Width * @see https://tailwindcss.com/docs/border-width */ "border-w": [{ border: i2() }], /** * Border Width X * @see https://tailwindcss.com/docs/border-width */ "border-w-x": [{ "border-x": i2() }], /** * Border Width Y * @see https://tailwindcss.com/docs/border-width */ "border-w-y": [{ "border-y": i2() }], /** * Border Width Start * @see https://tailwindcss.com/docs/border-width */ "border-w-s": [{ "border-s": i2() }], /** * Border Width End * @see https://tailwindcss.com/docs/border-width */ "border-w-e": [{ "border-e": i2() }], /** * Border Width Top * @see https://tailwindcss.com/docs/border-width */ "border-w-t": [{ "border-t": i2() }], /** * Border Width Right * @see https://tailwindcss.com/docs/border-width */ "border-w-r": [{ "border-r": i2() }], /** * Border Width Bottom * @see https://tailwindcss.com/docs/border-width */ "border-w-b": [{ "border-b": i2() }], /** * Border Width Left * @see https://tailwindcss.com/docs/border-width */ "border-w-l": [{ "border-l": i2() }], /** * Divide Width X * @see https://tailwindcss.com/docs/border-width#between-children */ "divide-x": [{ "divide-x": i2() }], /** * Divide Width X Reverse * @see https://tailwindcss.com/docs/border-width#between-children */ "divide-x-reverse": ["divide-x-reverse"], /** * Divide Width Y * @see https://tailwindcss.com/docs/border-width#between-children */ "divide-y": [{ "divide-y": i2() }], /** * Divide Width Y Reverse * @see https://tailwindcss.com/docs/border-width#between-children */ "divide-y-reverse": ["divide-y-reverse"], /** * Border Style * @see https://tailwindcss.com/docs/border-style */ "border-style": [{ border: [...g2(), "hidden", "none"] }], /** * Divide Style * @see https://tailwindcss.com/docs/border-style#setting-the-divider-style */ "divide-style": [{ divide: [...g2(), "hidden", "none"] }], /** * Border Color * @see https://tailwindcss.com/docs/border-color */ "border-color": [{ border: G() }], /** * Border Color X * @see https://tailwindcss.com/docs/border-color */ "border-color-x": [{ "border-x": G() }], /** * Border Color Y * @see https://tailwindcss.com/docs/border-color */ "border-color-y": [{ "border-y": G() }], /** * Border Color S * @see https://tailwindcss.com/docs/border-color */ "border-color-s": [{ "border-s": G() }], /** * Border Color E * @see https://tailwindcss.com/docs/border-color */ "border-color-e": [{ "border-e": G() }], /** * Border Color Top * @see https://tailwindcss.com/docs/border-color */ "border-color-t": [{ "border-t": G() }], /** * Border Color Right * @see https://tailwindcss.com/docs/border-color */ "border-color-r": [{ "border-r": G() }], /** * Border Color Bottom * @see https://tailwindcss.com/docs/border-color */ "border-color-b": [{ "border-b": G() }], /** * Border Color Left * @see https://tailwindcss.com/docs/border-color */ "border-color-l": [{ "border-l": G() }], /** * Divide Color * @see https://tailwindcss.com/docs/divide-color */ "divide-color": [{ divide: G() }], /** * Outline Style * @see https://tailwindcss.com/docs/outline-style */ "outline-style": [{ outline: [...g2(), "none", "hidden"] }], /** * Outline Offset * @see https://tailwindcss.com/docs/outline-offset */ "outline-offset": [{ "outline-offset": [r1, y2, A2] }], /** * Outline Width * @see https://tailwindcss.com/docs/outline-width */ "outline-w": [{ outline: ["", r1, N5, m9] }], /** * Outline Color * @see https://tailwindcss.com/docs/outline-color */ "outline-color": [{ outline: G() }], // --------------- // --- Effects --- // --------------- /** * Box Shadow * @see https://tailwindcss.com/docs/box-shadow */ shadow: [{ shadow: [ // Deprecated since Tailwind CSS v4.0.0 "", "none", p, O8, N8 ] }], /** * Box Shadow Color * @see https://tailwindcss.com/docs/box-shadow#setting-the-shadow-color */ "shadow-color": [{ shadow: G() }], /** * Inset Box Shadow * @see https://tailwindcss.com/docs/box-shadow#adding-an-inset-shadow */ "inset-shadow": [{ "inset-shadow": ["none", m, O8, N8] }], /** * Inset Box Shadow Color * @see https://tailwindcss.com/docs/box-shadow#setting-the-inset-shadow-color */ "inset-shadow-color": [{ "inset-shadow": G() }], /** * Ring Width * @see https://tailwindcss.com/docs/box-shadow#adding-a-ring */ "ring-w": [{ ring: i2() }], /** * Ring Width Inset * @see https://v3.tailwindcss.com/docs/ring-width#inset-rings * @deprecated since Tailwind CSS v4.0.0 * @see https://github.com/tailwindlabs/tailwindcss/blob/v4.0.0/packages/tailwindcss/src/utilities.ts#L4158 */ "ring-w-inset": ["ring-inset"], /** * Ring Color * @see https://tailwindcss.com/docs/box-shadow#setting-the-ring-color */ "ring-color": [{ ring: G() }], /** * Ring Offset Width * @see https://v3.tailwindcss.com/docs/ring-offset-width * @deprecated since Tailwind CSS v4.0.0 * @see https://github.com/tailwindlabs/tailwindcss/blob/v4.0.0/packages/tailwindcss/src/utilities.ts#L4158 */ "ring-offset-w": [{ "ring-offset": [r1, m9] }], /** * Ring Offset Color * @see https://v3.tailwindcss.com/docs/ring-offset-color * @deprecated since Tailwind CSS v4.0.0 * @see https://github.com/tailwindlabs/tailwindcss/blob/v4.0.0/packages/tailwindcss/src/utilities.ts#L4158 */ "ring-offset-color": [{ "ring-offset": G() }], /** * Inset Ring Width * @see https://tailwindcss.com/docs/box-shadow#adding-an-inset-ring */ "inset-ring-w": [{ "inset-ring": i2() }], /** * Inset Ring Color * @see https://tailwindcss.com/docs/box-shadow#setting-the-inset-ring-color */ "inset-ring-color": [{ "inset-ring": G() }], /** * Text Shadow * @see https://tailwindcss.com/docs/text-shadow */ "text-shadow": [{ "text-shadow": ["none", f, O8, N8] }], /** * Text Shadow Color * @see https://tailwindcss.com/docs/text-shadow#setting-the-shadow-color */ "text-shadow-color": [{ "text-shadow": G() }], /** * Opacity * @see https://tailwindcss.com/docs/opacity */ opacity: [{ opacity: [r1, y2, A2] }], /** * Mix Blend Mode * @see https://tailwindcss.com/docs/mix-blend-mode */ "mix-blend": [{ "mix-blend": [...E2(), "plus-darker", "plus-lighter"] }], /** * Background Blend Mode * @see https://tailwindcss.com/docs/background-blend-mode */ "bg-blend": [{ "bg-blend": E2() }], /** * Mask Clip * @see https://tailwindcss.com/docs/mask-clip */ "mask-clip": [{ "mask-clip": ["border", "padding", "content", "fill", "stroke", "view"] }, "mask-no-clip"], /** * Mask Composite * @see https://tailwindcss.com/docs/mask-composite */ "mask-composite": [{ mask: ["add", "subtract", "intersect", "exclude"] }], /** * Mask Image * @see https://tailwindcss.com/docs/mask-image */ "mask-image-linear-pos": [{ "mask-linear": [r1] }], "mask-image-linear-from-pos": [{ "mask-linear-from": D2() }], "mask-image-linear-to-pos": [{ "mask-linear-to": D2() }], "mask-image-linear-from-color": [{ "mask-linear-from": G() }], "mask-image-linear-to-color": [{ "mask-linear-to": G() }], "mask-image-t-from-pos": [{ "mask-t-from": D2() }], "mask-image-t-to-pos": [{ "mask-t-to": D2() }], "mask-image-t-from-color": [{ "mask-t-from": G() }], "mask-image-t-to-color": [{ "mask-t-to": G() }], "mask-image-r-from-pos": [{ "mask-r-from": D2() }], "mask-image-r-to-pos": [{ "mask-r-to": D2() }], "mask-image-r-from-color": [{ "mask-r-from": G() }], "mask-image-r-to-color": [{ "mask-r-to": G() }], "mask-image-b-from-pos": [{ "mask-b-from": D2() }], "mask-image-b-to-pos": [{ "mask-b-to": D2() }], "mask-image-b-from-color": [{ "mask-b-from": G() }], "mask-image-b-to-color": [{ "mask-b-to": G() }], "mask-image-l-from-pos": [{ "mask-l-from": D2() }], "mask-image-l-to-pos": [{ "mask-l-to": D2() }], "mask-image-l-from-color": [{ "mask-l-from": G() }], "mask-image-l-to-color": [{ "mask-l-to": G() }], "mask-image-x-from-pos": [{ "mask-x-from": D2() }], "mask-image-x-to-pos": [{ "mask-x-to": D2() }], "mask-image-x-from-color": [{ "mask-x-from": G() }], "mask-image-x-to-color": [{ "mask-x-to": G() }], "mask-image-y-from-pos": [{ "mask-y-from": D2() }], "mask-image-y-to-pos": [{ "mask-y-to": D2() }], "mask-image-y-from-color": [{ "mask-y-from": G() }], "mask-image-y-to-color": [{ "mask-y-to": G() }], "mask-image-radial": [{ "mask-radial": [y2, A2] }], "mask-image-radial-from-pos": [{ "mask-radial-from": D2() }], "mask-image-radial-to-pos": [{ "mask-radial-to": D2() }], "mask-image-radial-from-color": [{ "mask-radial-from": G() }], "mask-image-radial-to-color": [{ "mask-radial-to": G() }], "mask-image-radial-shape": [{ "mask-radial": ["circle", "ellipse"] }], "mask-image-radial-size": [{ "mask-radial": [{ closest: ["side", "corner"], farthest: ["side", "corner"] }] }], "mask-image-radial-pos": [{ "mask-radial-at": A() }], "mask-image-conic-pos": [{ "mask-conic": [r1] }], "mask-image-conic-from-pos": [{ "mask-conic-from": D2() }], "mask-image-conic-to-pos": [{ "mask-conic-to": D2() }], "mask-image-conic-from-color": [{ "mask-conic-from": G() }], "mask-image-conic-to-color": [{ "mask-conic-to": G() }], /** * Mask Mode * @see https://tailwindcss.com/docs/mask-mode */ "mask-mode": [{ mask: ["alpha", "luminance", "match"] }], /** * Mask Origin * @see https://tailwindcss.com/docs/mask-origin */ "mask-origin": [{ "mask-origin": ["border", "padding", "content", "fill", "stroke", "view"] }], /** * Mask Position * @see https://tailwindcss.com/docs/mask-position */ "mask-position": [{ mask: C2() }], /** * Mask Repeat * @see https://tailwindcss.com/docs/mask-repeat */ "mask-repeat": [{ mask: y() }], /** * Mask Size * @see https://tailwindcss.com/docs/mask-size */ "mask-size": [{ mask: J() }], /** * Mask Type * @see https://tailwindcss.com/docs/mask-type */ "mask-type": [{ "mask-type": ["alpha", "luminance"] }], /** * Mask Image * @see https://tailwindcss.com/docs/mask-image */ "mask-image": [{ mask: ["none", y2, A2] }], // --------------- // --- Filters --- // --------------- /** * Filter * @see https://tailwindcss.com/docs/filter */ filter: [{ filter: [ // Deprecated since Tailwind CSS v3.0.0 "", "none", y2, A2 ] }], /** * Blur * @see https://tailwindcss.com/docs/blur */ blur: [{ blur: Y2() }], /** * Brightness * @see https://tailwindcss.com/docs/brightness */ brightness: [{ brightness: [r1, y2, A2] }], /** * Contrast * @see https://tailwindcss.com/docs/contrast */ contrast: [{ contrast: [r1, y2, A2] }], /** * Drop Shadow * @see https://tailwindcss.com/docs/drop-shadow */ "drop-shadow": [{ "drop-shadow": [ // Deprecated since Tailwind CSS v4.0.0 "", "none", h, O8, N8 ] }], /** * Drop Shadow Color * @see https://tailwindcss.com/docs/filter-drop-shadow#setting-the-shadow-color */ "drop-shadow-color": [{ "drop-shadow": G() }], /** * Grayscale * @see https://tailwindcss.com/docs/grayscale */ grayscale: [{ grayscale: ["", r1, y2, A2] }], /** * Hue Rotate * @see https://tailwindcss.com/docs/hue-rotate */ "hue-rotate": [{ "hue-rotate": [r1, y2, A2] }], /** * Invert * @see https://tailwindcss.com/docs/invert */ invert: [{ invert: ["", r1, y2, A2] }], /** * Saturate * @see https://tailwindcss.com/docs/saturate */ saturate: [{ saturate: [r1, y2, A2] }], /** * Sepia * @see https://tailwindcss.com/docs/sepia */ sepia: [{ sepia: ["", r1, y2, A2] }], /** * Backdrop Filter * @see https://tailwindcss.com/docs/backdrop-filter */ "backdrop-filter": [{ "backdrop-filter": [ // Deprecated since Tailwind CSS v3.0.0 "", "none", y2, A2 ] }], /** * Backdrop Blur * @see https://tailwindcss.com/docs/backdrop-blur */ "backdrop-blur": [{ "backdrop-blur": Y2() }], /** * Backdrop Brightness * @see https://tailwindcss.com/docs/backdrop-brightness */ "backdrop-brightness": [{ "backdrop-brightness": [r1, y2, A2] }], /** * Backdrop Contrast * @see https://tailwindcss.com/docs/backdrop-contrast */ "backdrop-contrast": [{ "backdrop-contrast": [r1, y2, A2] }], /** * Backdrop Grayscale * @see https://tailwindcss.com/docs/backdrop-grayscale */ "backdrop-grayscale": [{ "backdrop-grayscale": ["", r1, y2, A2] }], /** * Backdrop Hue Rotate * @see https://tailwindcss.com/docs/backdrop-hue-rotate */ "backdrop-hue-rotate": [{ "backdrop-hue-rotate": [r1, y2, A2] }], /** * Backdrop Invert * @see https://tailwindcss.com/docs/backdrop-invert */ "backdrop-invert": [{ "backdrop-invert": ["", r1, y2, A2] }], /** * Backdrop Opacity * @see https://tailwindcss.com/docs/backdrop-opacity */ "backdrop-opacity": [{ "backdrop-opacity": [r1, y2, A2] }], /** * Backdrop Saturate * @see https://tailwindcss.com/docs/backdrop-saturate */ "backdrop-saturate": [{ "backdrop-saturate": [r1, y2, A2] }], /** * Backdrop Sepia * @see https://tailwindcss.com/docs/backdrop-sepia */ "backdrop-sepia": [{ "backdrop-sepia": ["", r1, y2, A2] }], // -------------- // --- Tables --- // -------------- /** * Border Collapse * @see https://tailwindcss.com/docs/border-collapse */ "border-collapse": [{ border: ["collapse", "separate"] }], /** * Border Spacing * @see https://tailwindcss.com/docs/border-spacing */ "border-spacing": [{ "border-spacing": B() }], /** * Border Spacing X * @see https://tailwindcss.com/docs/border-spacing */ "border-spacing-x": [{ "border-spacing-x": B() }], /** * Border Spacing Y * @see https://tailwindcss.com/docs/border-spacing */ "border-spacing-y": [{ "border-spacing-y": B() }], /** * Table Layout * @see https://tailwindcss.com/docs/table-layout */ "table-layout": [{ table: ["auto", "fixed"] }], /** * Caption Side * @see https://tailwindcss.com/docs/caption-side */ caption: [{ caption: ["top", "bottom"] }], // --------------------------------- // --- Transitions and Animation --- // --------------------------------- /** * Transition Property * @see https://tailwindcss.com/docs/transition-property */ transition: [{ transition: ["", "all", "colors", "opacity", "shadow", "transform", "none", y2, A2] }], /** * Transition Behavior * @see https://tailwindcss.com/docs/transition-behavior */ "transition-behavior": [{ transition: ["normal", "discrete"] }], /** * Transition Duration * @see https://tailwindcss.com/docs/transition-duration */ duration: [{ duration: [r1, "initial", y2, A2] }], /** * Transition Timing Function * @see https://tailwindcss.com/docs/transition-timing-function */ ease: [{ ease: ["linear", "initial", M, y2, A2] }], /** * Transition Delay * @see https://tailwindcss.com/docs/transition-delay */ delay: [{ delay: [r1, y2, A2] }], /** * Animation * @see https://tailwindcss.com/docs/animation */ animate: [{ animate: ["none", N, y2, A2] }], // ------------------ // --- Transforms --- // ------------------ /** * Backface Visibility * @see https://tailwindcss.com/docs/backface-visibility */ backface: [{ backface: ["hidden", "visible"] }], /** * Perspective * @see https://tailwindcss.com/docs/perspective */ perspective: [{ perspective: [R, y2, A2] }], /** * Perspective Origin * @see https://tailwindcss.com/docs/perspective-origin */ "perspective-origin": [{ "perspective-origin": P() }], /** * Rotate * @see https://tailwindcss.com/docs/rotate */ rotate: [{ rotate: g1() }], /** * Rotate X * @see https://tailwindcss.com/docs/rotate */ "rotate-x": [{ "rotate-x": g1() }], /** * Rotate Y * @see https://tailwindcss.com/docs/rotate */ "rotate-y": [{ "rotate-y": g1() }], /** * Rotate Z * @see https://tailwindcss.com/docs/rotate */ "rotate-z": [{ "rotate-z": g1() }], /** * Scale * @see https://tailwindcss.com/docs/scale */ scale: [{ scale: d1() }], /** * Scale X * @see https://tailwindcss.com/docs/scale */ "scale-x": [{ "scale-x": d1() }], /** * Scale Y * @see https://tailwindcss.com/docs/scale */ "scale-y": [{ "scale-y": d1() }], /** * Scale Z * @see https://tailwindcss.com/docs/scale */ "scale-z": [{ "scale-z": d1() }], /** * Scale 3D * @see https://tailwindcss.com/docs/scale */ "scale-3d": ["scale-3d"], /** * Skew * @see https://tailwindcss.com/docs/skew */ skew: [{ skew: R1() }], /** * Skew X * @see https://tailwindcss.com/docs/skew */ "skew-x": [{ "skew-x": R1() }], /** * Skew Y * @see https://tailwindcss.com/docs/skew */ "skew-y": [{ "skew-y": R1() }], /** * Transform * @see https://tailwindcss.com/docs/transform */ transform: [{ transform: [y2, A2, "", "none", "gpu", "cpu"] }], /** * Transform Origin * @see https://tailwindcss.com/docs/transform-origin */ "transform-origin": [{ origin: P() }], /** * Transform Style * @see https://tailwindcss.com/docs/transform-style */ "transform-style": [{ transform: ["3d", "flat"] }], /** * Translate * @see https://tailwindcss.com/docs/translate */ translate: [{ translate: b1() }], /** * Translate X * @see https://tailwindcss.com/docs/translate */ "translate-x": [{ "translate-x": b1() }], /** * Translate Y * @see https://tailwindcss.com/docs/translate */ "translate-y": [{ "translate-y": b1() }], /** * Translate Z * @see https://tailwindcss.com/docs/translate */ "translate-z": [{ "translate-z": b1() }], /** * Translate None * @see https://tailwindcss.com/docs/translate */ "translate-none": ["translate-none"], // --------------------- // --- Interactivity --- // --------------------- /** * Accent Color * @see https://tailwindcss.com/docs/accent-color */ accent: [{ accent: G() }], /** * Appearance * @see https://tailwindcss.com/docs/appearance */ appearance: [{ appearance: ["none", "auto"] }], /** * Caret Color * @see https://tailwindcss.com/docs/just-in-time-mode#caret-color-utilities */ "caret-color": [{ caret: G() }], /** * Color Scheme * @see https://tailwindcss.com/docs/color-scheme */ "color-scheme": [{ scheme: ["normal", "dark", "light", "light-dark", "only-dark", "only-light"] }], /** * Cursor * @see https://tailwindcss.com/docs/cursor */ cursor: [{ cursor: ["auto", "default", "pointer", "wait", "text", "move", "help", "not-allowed", "none", "context-menu", "progress", "cell", "crosshair", "vertical-text", "alias", "copy", "no-drop", "grab", "grabbing", "all-scroll", "col-resize", "row-resize", "n-resize", "e-resize", "s-resize", "w-resize", "ne-resize", "nw-resize", "se-resize", "sw-resize", "ew-resize", "ns-resize", "nesw-resize", "nwse-resize", "zoom-in", "zoom-out", y2, A2] }], /** * Field Sizing * @see https://tailwindcss.com/docs/field-sizing */ "field-sizing": [{ "field-sizing": ["fixed", "content"] }], /** * Pointer Events * @see https://tailwindcss.com/docs/pointer-events */ "pointer-events": [{ "pointer-events": ["auto", "none"] }], /** * Resize * @see https://tailwindcss.com/docs/resize */ resize: [{ resize: ["none", "", "y", "x"] }], /** * Scroll Behavior * @see https://tailwindcss.com/docs/scroll-behavior */ "scroll-behavior": [{ scroll: ["auto", "smooth"] }], /** * Scroll Margin * @see https://tailwindcss.com/docs/scroll-margin */ "scroll-m": [{ "scroll-m": B() }], /** * Scroll Margin X * @see https://tailwindcss.com/docs/scroll-margin */ "scroll-mx": [{ "scroll-mx": B() }], /** * Scroll Margin Y * @see https://tailwindcss.com/docs/scroll-margin */ "scroll-my": [{ "scroll-my": B() }], /** * Scroll Margin Start * @see https://tailwindcss.com/docs/scroll-margin */ "scroll-ms": [{ "scroll-ms": B() }], /** * Scroll Margin End * @see https://tailwindcss.com/docs/scroll-margin */ "scroll-me": [{ "scroll-me": B() }], /** * Scroll Margin Top * @see https://tailwindcss.com/docs/scroll-margin */ "scroll-mt": [{ "scroll-mt": B() }], /** * Scroll Margin Right * @see https://tailwindcss.com/docs/scroll-margin */ "scroll-mr": [{ "scroll-mr": B() }], /** * Scroll Margin Bottom * @see https://tailwindcss.com/docs/scroll-margin */ "scroll-mb": [{ "scroll-mb": B() }], /** * Scroll Margin Left * @see https://tailwindcss.com/docs/scroll-margin */ "scroll-ml": [{ "scroll-ml": B() }], /** * Scroll Padding * @see https://tailwindcss.com/docs/scroll-padding */ "scroll-p": [{ "scroll-p": B() }], /** * Scroll Padding X * @see https://tailwindcss.com/docs/scroll-padding */ "scroll-px": [{ "scroll-px": B() }], /** * Scroll Padding Y * @see https://tailwindcss.com/docs/scroll-padding */ "scroll-py": [{ "scroll-py": B() }], /** * Scroll Padding Start * @see https://tailwindcss.com/docs/scroll-padding */ "scroll-ps": [{ "scroll-ps": B() }], /** * Scroll Padding End * @see https://tailwindcss.com/docs/scroll-padding */ "scroll-pe": [{ "scroll-pe": B() }], /** * Scroll Padding Top * @see https://tailwindcss.com/docs/scroll-padding */ "scroll-pt": [{ "scroll-pt": B() }], /** * Scroll Padding Right * @see https://tailwindcss.com/docs/scroll-padding */ "scroll-pr": [{ "scroll-pr": B() }], /** * Scroll Padding Bottom * @see https://tailwindcss.com/docs/scroll-padding */ "scroll-pb": [{ "scroll-pb": B() }], /** * Scroll Padding Left * @see https://tailwindcss.com/docs/scroll-padding */ "scroll-pl": [{ "scroll-pl": B() }], /** * Scroll Snap Align * @see https://tailwindcss.com/docs/scroll-snap-align */ "snap-align": [{ snap: ["start", "end", "center", "align-none"] }], /** * Scroll Snap Stop * @see https://tailwindcss.com/docs/scroll-snap-stop */ "snap-stop": [{ snap: ["normal", "always"] }], /** * Scroll Snap Type * @see https://tailwindcss.com/docs/scroll-snap-type */ "snap-type": [{ snap: ["none", "x", "y", "both"] }], /** * Scroll Snap Type Strictness * @see https://tailwindcss.com/docs/scroll-snap-type */ "snap-strictness": [{ snap: ["mandatory", "proximity"] }], /** * Touch Action * @see https://tailwindcss.com/docs/touch-action */ touch: [{ touch: ["auto", "none", "manipulation"] }], /** * Touch Action X * @see https://tailwindcss.com/docs/touch-action */ "touch-x": [{ "touch-pan": ["x", "left", "right"] }], /** * Touch Action Y * @see https://tailwindcss.com/docs/touch-action */ "touch-y": [{ "touch-pan": ["y", "up", "down"] }], /** * Touch Action Pinch Zoom * @see https://tailwindcss.com/docs/touch-action */ "touch-pz": ["touch-pinch-zoom"], /** * User Select * @see https://tailwindcss.com/docs/user-select */ select: [{ select: ["none", "text", "all", "auto"] }], /** * Will Change * @see https://tailwindcss.com/docs/will-change */ "will-change": [{ "will-change": ["auto", "scroll", "contents", "transform", y2, A2] }], // ----------- // --- SVG --- // ----------- /** * Fill * @see https://tailwindcss.com/docs/fill */ fill: [{ fill: ["none", ...G()] }], /** * Stroke Width * @see https://tailwindcss.com/docs/stroke-width */ "stroke-w": [{ stroke: [r1, N5, m9, Pr] }], /** * Stroke * @see https://tailwindcss.com/docs/stroke */ stroke: [{ stroke: ["none", ...G()] }], // --------------------- // --- Accessibility --- // --------------------- /** * Forced Color Adjust * @see https://tailwindcss.com/docs/forced-color-adjust */ "forced-color-adjust": [{ "forced-color-adjust": ["auto", "none"] }] }, conflictingClassGroups: { overflow: ["overflow-x", "overflow-y"], overscroll: ["overscroll-x", "overscroll-y"], inset: ["inset-x", "inset-y", "start", "end", "top", "right", "bottom", "left"], "inset-x": ["right", "left"], "inset-y": ["top", "bottom"], flex: ["basis", "grow", "shrink"], gap: ["gap-x", "gap-y"], p: ["px", "py", "ps", "pe", "pt", "pr", "pb", "pl"], px: ["pr", "pl"], py: ["pt", "pb"], m: ["mx", "my", "ms", "me", "mt", "mr", "mb", "ml"], mx: ["mr", "ml"], my: ["mt", "mb"], size: ["w", "h"], "font-size": ["leading"], "fvn-normal": ["fvn-ordinal", "fvn-slashed-zero", "fvn-figure", "fvn-spacing", "fvn-fraction"], "fvn-ordinal": ["fvn-normal"], "fvn-slashed-zero": ["fvn-normal"], "fvn-figure": ["fvn-normal"], "fvn-spacing": ["fvn-normal"], "fvn-fraction": ["fvn-normal"], "line-clamp": ["display", "overflow"], rounded: ["rounded-s", "rounded-e", "rounded-t", "rounded-r", "rounded-b", "rounded-l", "rounded-ss", "rounded-se", "rounded-ee", "rounded-es", "rounded-tl", "rounded-tr", "rounded-br", "rounded-bl"], "rounded-s": ["rounded-ss", "rounded-es"], "rounded-e": ["rounded-se", "rounded-ee"], "rounded-t": ["rounded-tl", "rounded-tr"], "rounded-r": ["rounded-tr", "rounded-br"], "rounded-b": ["rounded-br", "rounded-bl"], "rounded-l": ["rounded-tl", "rounded-bl"], "border-spacing": ["border-spacing-x", "border-spacing-y"], "border-w": ["border-w-x", "border-w-y", "border-w-s", "border-w-e", "border-w-t", "border-w-r", "border-w-b", "border-w-l"], "border-w-x": ["border-w-r", "border-w-l"], "border-w-y": ["border-w-t", "border-w-b"], "border-color": ["border-color-x", "border-color-y", "border-color-s", "border-color-e", "border-color-t", "border-color-r", "border-color-b", "border-color-l"], "border-color-x": ["border-color-r", "border-color-l"], "border-color-y": ["border-color-t", "border-color-b"], translate: ["translate-x", "translate-y", "translate-none"], "translate-none": ["translate", "translate-x", "translate-y", "translate-z"], "scroll-m": ["scroll-mx", "scroll-my", "scroll-ms", "scroll-me", "scroll-mt", "scroll-mr", "scroll-mb", "scroll-ml"], "scroll-mx": ["scroll-mr", "scroll-ml"], "scroll-my": ["scroll-mt", "scroll-mb"], "scroll-p": ["scroll-px", "scroll-py", "scroll-ps", "scroll-pe", "scroll-pt", "scroll-pr", "scroll-pb", "scroll-pl"], "scroll-px": ["scroll-pr", "scroll-pl"], "scroll-py": ["scroll-pt", "scroll-pb"], touch: ["touch-x", "touch-y", "touch-pz"], "touch-x": ["touch"], "touch-y": ["touch"], "touch-pz": ["touch"] }, conflictingClassGroupModifiers: { "font-size": ["leading"] }, orderSensitiveModifiers: ["*", "**", "after", "backdrop", "before", "details-content", "file", "first-letter", "first-line", "marker", "placeholder", "selection"] }; }, JA = /* @__PURE__ */ IA(XA); function H2(...n) { return JA(fA(n)); } const ey = (n) => /* @__PURE__ */ b.createElement("svg", { xmlns: "http://www.w3.org/2000/svg", fill: "none", viewBox: "0 0 24 24", stroke: "currentColor", "aria-hidden": "true", ...n }, /* @__PURE__ */ b.createElement("path", { strokeLinecap: "round", strokeLinejoin: "round", strokeWidth: 2, d: "M6 18L18 6M6 6l12 12" })), ty = (n) => /* @__PURE__ */ b.createElement("svg", { viewBox: "0 0 24 24", xmlns: "http://www.w3.org/2000/svg", fill: "none", stroke: "currentColor", strokeWidth: 1, strokeLinecap: "round", strokeLinejoin: "miter", ...n }, /* @__PURE__ */ b.createElement("g", { id: "SVGRepo_bgCarrier", strokeWidth: 0 }), /* @__PURE__ */ b.createElement("g", { id: "SVGRepo_tracerCarrier", strokeLinecap: "round", strokeLinejoin: "round" }), /* @__PURE__ */ b.createElement("g", { id: "SVGRepo_iconCarrier" }, /* @__PURE__ */ b.createElement("line", { x1: 14, y1: 10, x2: 21, y2: 3 }), /* @__PURE__ */ b.createElement("polyline", { points: "20 10 14 10 14 4" }), /* @__PURE__ */ b.createElement("line", { x1: 3, y1: 21, x2: 10, y2: 14 }), /* @__PURE__ */ b.createElement("polyline", { points: "4 14 10 14 10 20" }))), ny = (n) => /* @__PURE__ */ b.createElement("svg", { viewBox: "0 0 24 24", xmlns: "http://www.w3.org/2000/svg", fill: "currentColor", ...n }, /* @__PURE__ */ b.createElement("g", { id: "SVGRepo_bgCarrier", strokeWidth: 0 }), /* @__PURE__ */ b.createElement("g", { id: "SVGRepo_tracerCarrier", strokeLinecap: "round", strokeLinejoin: "round" }), /* @__PURE__ */ b.createElement("g", { id: "SVGRepo_iconCarrier" }, /* @__PURE__ */ b.createElement("title", null), /* @__PURE__ */ b.createElement("g", { id: "Complete" }, /* @__PURE__ */ b.createElement("g", { id: "expand" }, /* @__PURE__ */ b.createElement("g", null, /* @__PURE__ */ b.createElement("polyline", { "data-name": "Right", fill: "none", id: "Right-2", points: "3 17.3 3 21 6.7 21", stroke: "currentColor", strokeLinecap: "round", strokeLinejoin: "round", strokeWidth: 1 }), /* @__PURE__ */ b.createElement("line", { fill: "none", stroke: "currentColor", strokeLinecap: "round", strokeLinejoin: "round", strokeWidth: 1, x1: 10, x2: 3.8, y1: 14, y2: 20.2 }), /* @__PURE__ */ b.createElement("line", { fill: "none", stroke: "currentColor", strokeLinecap: "round", strokeLinejoin: "round", strokeWidth: 1, x1: 14, x2: 20.2, y1: 10, y2: 3.8 }), /* @__PURE__ */ b.createElement("polyline", { "data-name": "Right", fill: "none", id: "Right-3", points: "21 6.7 21 3 17.3 3", stroke: "currentColor", strokeLinecap: "round", strokeLinejoin: "round", strokeWidth: 1 })))))), iy = (n) => /* @__PURE__ */ b.createElement("svg", { xmlns: "http://www.w3.org/2000/svg", xmlSpace: "preserve", viewBox: "0 0 24 24", fill: "none", stroke: "currentColor", strokeWidth: 2, strokeLinecap: "round", strokeLinejoin: "round", ...n }, /* @__PURE__ */ b.createElement("line", { x1: 6, y1: 3, x2: 6, y2: 15 }), /* @__PURE__ */ b.createElement("circle", { cx: 18, cy: 6, r: 3 }), /* @__PURE__ */ b.createElement("circle", { cx: 6, cy: 18, r: 3 }), /* @__PURE__ */ b.createElement("path", { d: "M18 9a9 9 0 0 1-9 9" })), ry = (n) => /* @__PURE__ */ b.createElement("svg", { xmlns: "http://www.w3.org/2000/svg", xmlSpace: "preserve", viewBox: "0 0 20 20", fill: "none", ...n }, /* @__PURE__ */ b.createElement("circle", { cx: 10, cy: 10, r: 10, fill: "#000", fillOpacity: 0.1 })), ay = (n) => /* @__PURE__ */ b.createElement("svg", { width: 24, height: 24, viewBox: "0 0 100 100", fill: "none", xmlns: "http://www.w3.org/2000/svg", ...n }, /* @__PURE__ */ b.createElement("path", { d: "M21.8864 32.0909V67H17.6591V36.5227H17.4545L8.93182 42.1818V37.8864L17.6591 32.0909H21.8864ZM33.5483 67.2159C32.8826 67.2159 32.3113 66.9775 31.8345 66.5007C31.3577 66.0239 31.1193 65.4527 31.1193 64.7869C31.1193 64.1212 31.3577 63.55 31.8345 63.0732C32.3113 62.5964 32.8826 62.358 33.5483 62.358C34.214 62.358 34.7853 62.5964 35.2621 63.0732C35.7389 63.55 35.9773 64.1212 35.9773 64.7869C35.9773 65.2277 35.8648 65.6326 35.6399 66.0014C35.424 66.3703 35.1316 66.6671 34.7628 66.892C34.4029 67.108 33.9981 67.2159 33.5483 67.2159ZM41.7887 67V64.4432L51.391 53.9318C52.5179 52.7008 53.4459 51.6307 54.1751 50.7216C54.9042 49.803 55.444 48.9413 55.7944 48.1364C56.1542 47.322 56.3342 46.4697 56.3342 45.5795C56.3342 44.5568 56.088 43.6714 55.5955 42.9233C55.1126 42.1752 54.4497 41.5975 53.6069 41.1903C52.7641 40.7831 51.8171 40.5795 50.766 40.5795C49.6486 40.5795 48.6732 40.8116 47.8398 41.2756C47.016 41.7301 46.3768 42.3693 45.9222 43.1932C45.4772 44.017 45.2546 44.983 45.2546 46.0909H41.9023C41.9023 44.3864 42.2953 42.8902 43.0813 41.6023C43.8673 40.3144 44.9374 39.3106 46.2915 38.5909C47.6552 37.8712 49.1845 37.5114 50.8796 37.5114C52.5842 37.5114 54.0946 37.8712 55.4109 38.5909C56.7272 39.3106 57.7594 40.2812 58.5075 41.5028C59.2556 42.7244 59.6296 44.0833 59.6296 45.5795C59.6296 46.6496 59.4355 47.696 59.0472 48.7188C58.6684 49.732 58.0056 50.8636 57.0586 52.1136C56.1211 53.3542 54.819 54.8693 53.1523 56.6591L46.6183 63.6477V63.875H60.141V67H41.7887ZM68.2319 67.2159C67.5662 67.2159 66.9949 66.9775 66.5181 66.5007C66.0413 66.0239 65.8029 65.4527 65.8029 64.7869C65.8029 64.1212 66.0413 63.55 66.5181 63.0732C66.9949 62.5964 67.5662 62.358 68.2319 62.358C68.8976 62.358 69.4689 62.5964 69.9457 63.0732C70.4225 63.55 70.6609 64.1212 70.6609 64.7869C70.6609 65.2277 70.5484 65.6326 70.3235 66.0014C70.1076 66.3703 69.8152 66.6671 69.4464 66.892C69.0865 67.108 68.6817 67.2159 68.2319 67.2159ZM83.7337 67.3182C82.2337 67.3182 80.8965 67.0606 79.7223 66.5455C78.5556 66.0303 77.6276 65.3144 76.9382 64.3977C76.2564 63.4735 75.8852 62.4015 75.8246 61.1818H78.6882C78.7488 61.9318 79.0064 62.5795 79.4609 63.125C79.9155 63.6629 80.5102 64.0795 81.245 64.375C81.9799 64.6705 82.7943 64.8182 83.6882 64.8182C84.6882 64.8182 85.5746 64.6439 86.3473 64.2955C87.12 63.947 87.7261 63.4621 88.1655 62.8409C88.6049 62.2197 88.8246 61.5 88.8246 60.6818C88.8246 59.8258 88.6125 59.072 88.1882 58.4205C87.764 57.7614 87.1428 57.2462 86.3246 56.875C85.5064 56.5038 84.5064 56.3182 83.3246 56.3182H81.4609V53.8182H83.3246C84.2488 53.8182 85.0594 53.6515 85.7564 53.3182C86.4609 52.9848 87.0102 52.5152 87.4041 51.9091C87.8056 51.303 88.0064 50.5909 88.0064 49.7727C88.0064 48.9848 87.8322 48.2992 87.4837 47.7159C87.1352 47.1326 86.6428 46.678 86.0064 46.3523C85.3776 46.0265 84.6352 45.8636 83.7791 45.8636C82.9761 45.8636 82.2185 46.0114 81.5064 46.3068C80.8018 46.5947 80.2261 47.0152 79.7791 47.5682C79.3321 48.1136 79.0897 48.7727 79.0518 49.5455H76.3246C76.37 48.3258 76.7375 47.2576 77.4268 46.3409C78.1162 45.4167 79.0178 44.697 80.1314 44.1818C81.2526 43.6667 82.4837 43.4091 83.8246 43.4091C85.264 43.4091 86.4988 43.7008 87.5291 44.2841C88.5594 44.8598 89.3511 45.6212 89.9041 46.5682C90.4572 47.5152 90.7337 48.5379 90.7337 49.6364C90.7337 50.947 90.389 52.0644 89.6996 52.9886C89.0178 53.9129 88.0897 54.553 86.9155 54.9091V55.0909C88.3852 55.3333 89.5329 55.9583 90.3587 56.9659C91.1844 57.9659 91.5973 59.2045 91.5973 60.6818C91.5973 61.947 91.2526 63.0833 90.5632 64.0909C89.8814 65.0909 88.9496 65.8788 87.7678 66.4545C86.5859 67.0303 85.2412 67.3182 83.7337 67.3182Z", fill: "black" }), /* @__PURE__ */ b.createElement("path", { d: "M21.8864 32.0909H22.8864V31.0909H21.8864V32.0909ZM21.8864 67V68H22.8864V67H21.8864ZM17.6591 67H16.6591V68H17.6591V67ZM17.6591 36.5227H18.6591V35.5227H17.6591V36.5227ZM17.4545 36.5227V35.5227H17.1528L16.9014 35.6897L17.4545 36.5227ZM8.93182 42.1818H7.93182V44.0462L9.48498 43.0149L8.93182 42.1818ZM8.93182 37.8864L8.37862 37.0533L7.93182 37.35V37.8864H8.93182ZM17.6591 32.0909V31.0909H17.3573L17.1059 31.2579L17.6591 32.0909ZM20.8864 32.0909V67H22.8864V32.0909H20.8864ZM21.8864 66H17.6591V68H21.8864V66ZM18.6591 67V36.5227H16.6591V67H18.6591ZM17.6591 35.5227H17.4545V37.5227H17.6591V35.5227ZM16.9014 35.6897L8.37866 41.3487L9.48498 43.0149L18.0077 37.3558L16.9014 35.6897ZM9.93182 42.1818V37.8864H7.93182V42.1818H9.93182ZM9.48502 38.7194L18.2123 32.924L17.1059 31.2579L8.37862 37.0533L9.48502 38.7194ZM17.6591 33.0909H21.8864V31.0909H17.6591V33.0909ZM31.8345 66.5007L32.5416 65.7936L32.5416 65.7936L31.8345 66.5007ZM31.8345 63.0732L31.1274 62.366L31.8345 63.0732ZM35.2621 63.0732L35.9692 62.366L35.9692 62.366L35.2621 63.0732ZM35.6399 66.0014L34.7861 65.4808L34.7814 65.4885L34.7769 65.4962L35.6399 66.0014ZM34.7628 66.892L35.2773 67.7496L35.2834 67.7458L34.7628 66.892ZM33.5483 66.2159C33.1516 66.2159 32.8336 66.0856 32.5416 65.7936L31.1274 67.2078C31.789 67.8694 32.6135 68.2159 33.5483 68.2159V66.2159ZM32.5416 65.7936C32.2496 65.5016 32.1193 65.1836 32.1193 64.7869H30.1193C30.1193 65.7217 30.4658 66.5462 31.1274 67.2078L32.5416 65.7936ZM32.1193 64.7869C32.1193 64.3902 32.2496 64.0722 32.5416 63.7803L31.1274 62.366C30.4658 63.0277 30.1193 63.8522 30.1193 64.7869H32.1193ZM32.5416 63.7803C32.8336 63.4883 33.1516 63.358 33.5483 63.358V61.358C32.6135 61.358 31.789 61.7044 31.1274 62.366L32.5416 63.7803ZM33.5483 63.358C33.945 63.358 34.263 63.4883 34.555 63.7803L35.9692 62.366C35.3076 61.7044 34.483 61.358 33.5483 61.358V63.358ZM34.555 63.7803C34.8469 64.0722 34.9773 64.3902 34.9773 64.7869H36.9773C36.9773 63.8522 36.6308 63.0277 35.9692 62.366L34.555 63.7803ZM34.9773 64.7869C34.9773 65.048 34.9134 65.2721 34.7861 65.4808L36.4937 66.522C36.8163 65.993 36.9773 65.4075 36.9773 64.7869H34.9773ZM34.7769 65.4962C34.6455 65.7208 34.4714 65.8985 34.2422 66.0382L35.2834 67.7458C35.7919 67.4358 36.2025 67.0198 36.5029 66.5066L34.7769 65.4962ZM34.2483 66.0346C34.0551 66.1505 33.8304 66.2159 33.5483 66.2159V68.2159C34.1658 68.2159 34.7508 68.0654 35.2773 67.7495L34.2483 66.0346ZM41.7887 67H40.7887V68H41.7887V67ZM41.7887 64.4432L41.0504 63.7687L40.7887 64.0552V64.4432H41.7887ZM51.391 53.9318L50.6534 53.2566L50.6527 53.2574L51.391 53.9318ZM54.1751 50.7216L54.9552 51.3473L54.9583 51.3433L54.1751 50.7216ZM55.7944 48.1364L54.8797 47.7322L54.8775 47.7372L55.7944 48.1364ZM55.5955 42.9233L54.7554 43.4657L54.7602 43.4731L55.5955 42.9233ZM53.6069 41.1903L54.0419 40.2899L54.0419 40.2899L53.6069 41.1903ZM47.8398 41.2756L48.3229 42.1512L48.3263 42.1493L47.8398 41.2756ZM45.9222 43.1932L45.0466 42.7101L45.0424 42.7179L45.9222 43.1932ZM45.2546 46.0909V47.0909H46.2546V46.0909H45.2546ZM41.9023 46.0909H40.9023V47.0909H41.9023V46.0909ZM43.0813 41.6023L43.9349 42.1232L43.9349 42.1232L43.0813 41.6023ZM46.2915 38.5909L45.8248 37.7065L45.8222 37.7079L46.2915 38.5909ZM55.4109 38.5909L55.8906 37.7135L55.8906 37.7135L55.4109 38.5909ZM58.5075 41.5028L57.6547 42.0251L58.5075 41.5028ZM59.0472 48.7188L58.1123 48.3638L58.1105 48.3686L59.0472 48.7188ZM57.0586 52.1136L56.2615 51.5098L56.2608 51.5107L57.0586 52.1136ZM53.1523 56.6591L53.8828 57.342L53.8842 57.3406L53.1523 56.6591ZM46.6183 63.6477L45.8878 62.9648L45.6183 63.2531V63.6477H46.6183ZM46.6183 63.875H45.6183V64.875H46.6183V63.875ZM60.141 63.875H61.141V62.875H60.141V63.875ZM60.141 67V68H61.141V67H60.141ZM42.7887 67V64.4432H40.7887V67H42.7887ZM42.527 65.1176L52.1293 54.6063L50.6527 53.2574L41.0504 63.7687L42.527 65.1176ZM52.1286 54.607C53.2645 53.3661 54.208 52.2788 54.9551 51.3473L53.395 50.0959C52.6838 50.9825 51.7713 52.0354 50.6534 53.2566L52.1286 54.607ZM54.9583 51.3433C55.7246 50.3779 56.3168 49.4417 56.7113 48.5355L54.8775 47.7372C54.5712 48.4409 54.0838 49.2281 53.3918 50.0999L54.9583 51.3433ZM56.7091 48.5405C57.1252 47.5988 57.3342 46.6089 57.3342 45.5795H55.3342C55.3342 46.3305 55.1833 47.0451 54.8797 47.7322L56.7091 48.5405ZM57.3342 45.5795C57.3342 44.3899 57.0454 43.3071 56.4308 42.3735L54.7602 43.4731C55.1305 44.0357 55.3342 44.7237 55.3342 45.5795H57.3342ZM56.4357 42.3809C55.8479 41.4705 55.0412 40.7727 54.0419 40.2899L53.1719 42.0908C53.8582 42.4223 54.3772 42.8799 54.7554 43.4657L56.4357 42.3809ZM54.0419 40.2899C53.0476 39.8095 51.9491 39.5795 50.766 39.5795V41.5795C51.6851 41.5795 52.4806 41.7568 53.1719 42.0908L54.0419 40.2899ZM50.766 39.5795C49.5076 39.5795 48.3592 39.8418 47.3534 40.4019L48.3263 42.1493C48.9872 41.7813 49.7895 41.5795 50.766 41.5795V39.5795ZM47.3568 40.4C46.3677 40.9457 45.5924 41.721 45.0467 42.7101L46.7978 43.6763C47.1612 43.0176 47.6643 42.5145 48.3229 42.1511L47.3568 40.4ZM45.0424 42.7179C44.5052 43.7123 44.2546 44.8474 44.2546 46.0909H46.2546C46.2546 45.1185 46.4491 44.3218 46.8021 43.6685L45.0424 42.7179ZM45.2546 45.0909H41.9023V47.0909H45.2546V45.0909ZM42.9023 46.0909C42.9023 44.5457 43.2567 43.2346 43.9349 42.1232L42.2277 41.0813C41.334 42.5457 40.9023 44.227 40.9023 46.0909H42.9023ZM43.9349 42.1232C44.626 40.9909 45.5622 40.111 46.7609 39.4739L45.8222 37.7079C44.3126 38.5102 43.1087 39.6379 42.2277 41.0813L43.9349 42.1232ZM46.7583 39.4753C47.9642 38.8389 49.3307 38.5114 50.8796 38.5114V36.5114C49.0383 36.5114 47.3462 36.9036 45.8248 37.7065L46.7583 39.4753ZM50.8796 38.5114C52.4396 38.5114 53.781 38.8395 54.9311 39.4683L55.8906 37.7135C54.4082 36.903 52.7287 36.5114 50.8796 36.5114V38.5114ZM54.9311 39.4683C56.1017 40.1084 57.0022 40.9596 57.6547 42.0251L59.3602 40.9806C58.5166 39.6029 57.3526 38.5129 55.8906 37.7135L54.9311 39.4683ZM57.6547 42.0251C58.3021 43.0823 58.6296 44.2591 58.6296 45.5795H60.6296C60.6296 43.9076 60.209 42.3665 59.3602 40.9806L57.6547 42.0251ZM58.6296 45.5795C58.6296 46.5256 58.4585 47.4519 58.1123 48.3638L59.9821 49.0737C60.4124 47.9401 60.6296 46.7736 60.6296 45.5795H58.6296ZM58.1105 48.3686C57.7772 49.2602 57.1737 50.3056 56.2615 51.5098L57.8557 52.7175C58.8374 51.4216 59.5596 50.2038 59.9839 49.0689L58.1105 48.3686ZM56.2608 51.5107C55.3521 52.7131 54.0754 54.2005 52.4205 55.9776L53.8842 57.3406C55.5626 55.5382 56.8901 53.9952 57.8564 52.7166L56.2608 51.5107ZM52.4219 55.9761L45.8878 62.9648L47.3487 64.3307L53.8828 57.342L52.4219 55.9761ZM45.6183 63.6477V63.875H47.6183V63.6477H45.6183ZM46.6183 64.875H60.141V62.875H46.6183V64.875ZM59.141 63.875V67H61.141V63.875H59.141ZM60.141 66H41.7887V68H60.141V66ZM66.5181 66.5007L67.2252 65.7936L67.2252 65.7936L66.5181 66.5007ZM66.5181 63.0732L65.811 62.366L66.5181 63.0732ZM69.9457 63.0732L70.6528 62.366L70.6528 62.366L69.9457 63.0732ZM70.3235 66.0014L69.4697 65.4808L69.465 65.4885L69.4605 65.4962L70.3235 66.0014ZM69.4464 66.892L69.9609 67.7496L69.967 67.7458L69.4464 66.892ZM68.2319 66.2159C67.8352 66.2159 67.5172 66.0856 67.2252 65.7936L65.811 67.2078C66.4726 67.8694 67.2971 68.2159 68.2319 68.2159V66.2159ZM67.2252 65.7936C66.9332 65.5016 66.8029 65.1836 66.8029 64.7869H64.8029C64.8029 65.7217 65.1494 66.5462 65.811 67.2078L67.2252 65.7936ZM66.8029 64.7869C66.8029 64.3902 66.9332 64.0722 67.2252 63.7803L65.811 62.366C65.1494 63.0277 64.8029 63.8522 64.8029 64.7869H66.8029ZM67.2252 63.7803C67.5172 63.4883 67.8352 63.358 68.2319 63.358V61.358C67.2971 61.358 66.4726 61.7044 65.811 62.366L67.2252 63.7803ZM68.2319 63.358C68.6286 63.358 68.9466 63.4883 69.2386 63.7803L70.6528 62.366C69.9912 61.7044 69.1666 61.358 68.2319 61.358V63.358ZM69.2386 63.7803C69.5305 64.0722 69.6609 64.3902 69.6609 64.7869H71.6609C71.6609 63.8522 71.3144 63.0277 70.6528 62.366L69.2386 63.7803ZM69.6609 64.7869C69.6609 65.048 69.597 65.2721 69.4697 65.4808L71.1773 66.522C71.4999 65.993 71.6609 65.4075 71.6609 64.7869H69.6609ZM69.4605 65.4962C69.3291 65.7208 69.155 65.8985 68.9258 66.0382L69.967 67.7458C70.4754 67.4358 70.8861 67.0198 71.1865 66.5066L69.4605 65.4962ZM68.9319 66.0346C68.7386 66.1505 68.514 66.2159 68.2319 66.2159V68.2159C68.8494 68.2159 69.4344 68.0654 69.9609 67.7495L68.9319 66.0346ZM79.7223 66.5455L79.3184 67.4602L79.3206 67.4612L79.7223 66.5455ZM76.9382 64.3977L76.1335 64.9914L76.139 64.9988L76.9382 64.3977ZM75.8246 61.1818V60.1818H74.7737L74.8258 61.2314L75.8246 61.1818ZM78.6882 61.1818L79.685 61.1013L79.6107 60.1818H78.6882V61.1818ZM79.4609 63.125L78.6927 63.7652L78.6971 63.7705L79.4609 63.125ZM81.245 64.375L80.872 65.3028L80.872 65.3028L81.245 64.375ZM88.1655 62.8409L87.3491 62.2634L87.3491 62.2634L88.1655 62.8409ZM88.1882 58.4205L87.3473 58.9617L87.3502 58.9661L88.1882 58.4205ZM86.3246 56.875L85.9114 57.7857L85.9114 57.7857L86.3246 56.875ZM81.4609 56.3182H80.4609V57.3182H81.4609V56.3182ZM81.4609 53.8182V52.8182H80.4609V53.8182H81.4609ZM85.7564 53.3182L85.3287 52.4142L85.3249 52.416L85.7564 53.3182ZM87.4041 51.9091L86.5704 51.3568L86.5657 51.3641L87.4041 51.9091ZM87.4837 47.7159L88.3421 47.2031L88.3421 47.2031L87.4837 47.7159ZM86.0064 46.3523L85.5464 47.2402L85.5507 47.2424L86.0064 46.3523ZM81.5064 46.3068L81.8846 47.2325L81.8896 47.2305L81.5064 46.3068ZM79.7791 47.5682L80.5526 48.202L80.5569 48.1968L79.7791 47.5682ZM79.0518 49.5455V50.5455H80.004L80.0506 49.5944L79.0518 49.5455ZM76.3246 49.5455L75.3253 49.5082L75.2866 50.5455H76.3246V49.5455ZM77.4268 46.3409L78.2261 46.942L78.2284 46.9388L77.4268 46.3409ZM80.1314 44.1818L79.7139 43.2731L79.7116 43.2742L80.1314 44.1818ZM87.5291 44.2841L87.0364 45.1543L87.0413 45.157L87.5291 44.2841ZM89.9041 46.5682L89.0406 47.0725L89.0406 47.0725L89.9041 46.5682ZM89.6996 52.9886L88.898 52.3907L88.8948 52.395L89.6996 52.9886ZM86.9155 54.9091L86.6253 53.9521L85.9155 54.1674V54.9091H86.9155ZM86.9155 55.0909H85.9155V55.9395L86.7527 56.0776L86.9155 55.0909ZM90.3587 56.9659L89.5852 57.5998L89.5876 57.6026L90.3587 56.9659ZM90.5632 64.0909L89.7379 63.5262L89.737 63.5276L90.5632 64.0909ZM87.7678 66.4545L88.2057 67.3535L88.2057 67.3535L87.7678 66.4545ZM83.7337 66.3182C82.3487 66.3182 81.152 66.0807 80.124 65.6297L79.3206 67.4612C80.6411 68.0405 82.1186 68.3182 83.7337 68.3182V66.3182ZM80.1262 65.6307C79.0981 65.1767 78.3129 64.5619 77.7374 63.7967L76.139 64.9988C76.9423 66.0669 78.0132 66.8839 79.3184 67.4602L80.1262 65.6307ZM77.7429 63.8041C77.1854 63.0484 76.8748 62.1685 76.8233 61.1322L74.8258 61.2314C74.8955 62.6346 75.3274 63.8986 76.1335 64.9914L77.7429 63.8041ZM75.8246 62.1818H78.6882V60.1818H75.8246V62.1818ZM77.6915 61.2624C77.7676 62.205 78.098 63.0515 78.6927 63.7652L80.2292 62.4848C79.9148 62.1076 79.73 61.6586 79.685 61.1013L77.6915 61.2624ZM78.6971 63.7705C79.2695 64.4478 80.0049 64.9542 80.872 65.3028L81.6181 63.4472C81.0154 63.2049 80.5615 62.878 80.2247 62.4795L78.6971 63.7705ZM80.872 65.3028C81.7397 65.6517 82.6828 65.8182 83.6882 65.8182V63.8182C82.9057 63.8182 82.22 63.6892 81.6181 63.4472L80.872 65.3028ZM83.6882 65.8182C84.8048 65.8182 85.8353 65.6233 86.7584 65.207L85.9362 63.3839C85.3138 63.6645 84.5716 63.8182 83.6882 63.8182V65.8182ZM86.7584 65.207C87.6746 64.7939 88.4282 64.2012 88.9819 63.4184L87.3491 62.2634C87.024 62.723 86.5655 63.1001 85.9362 63.3839L86.7584 65.207ZM88.9819 63.4184C89.5499 62.6154 89.8246 61.6904 89.8246 60.6818H87.8246C87.8246 61.3096 87.6599 61.824 87.3491 62.2634L88.9819 63.4184ZM89.8246 60.6818C89.8246 59.6524 89.5668 58.7049 89.0262 57.8748L87.3502 58.9661C87.6582 59.439 87.8246 59.9992 87.8246 60.6818H89.8246ZM89.0291 57.8792C88.4862 57.0358 87.7048 56.4031 86.7377 55.9643L85.9114 57.7857C86.5807 58.0893 87.0418 58.487 87.3473 58.9617L89.0291 57.8792ZM86.7377 55.9643C85.7557 55.5188 84.606 55.3182 83.3246 55.3182V57.3182C84.4068 57.3182 85.2571 57.4888 85.9114 57.7857L86.7377 55.9643ZM83.3246 55.3182H81.4609V57.3182H83.3246V55.3182ZM82.4609 56.3182V53.8182H80.4609V56.3182H82.4609ZM81.4609 54.8182H83.3246V52.8182H81.4609V54.8182ZM83.3246 54.8182C84.3692 54.8182 85.3323 54.6295 86.1878 54.2203L85.3249 52.416C84.7866 52.6735 84.1284 52.8182 83.3246 52.8182V54.8182ZM86.1841 54.2221C87.0425 53.816 87.7397 53.2277 88.2426 52.4541L86.5657 51.3641C86.2807 51.8026 85.8794 52.1537 85.3287 52.4142L86.1841 54.2221ZM88.2378 52.4614C88.761 51.6715 89.0064 50.7619 89.0064 49.7727H87.0064C87.0064 50.4199 86.8502 50.9345 86.5705 51.3568L88.2378 52.4614ZM89.0064 49.7727C89.0064 48.8335 88.7972 47.9647 88.3421 47.2031L86.6252 48.2288C86.8671 48.6338 87.0064 49.1362 87.0064 49.7727H89.0064ZM88.3421 47.2031C87.8923 46.4501 87.2563 45.8687 86.4621 45.4621L85.5507 47.2424C86.0292 47.4874 86.378 47.8151 86.6252 48.2288L88.3421 47.2031ZM86.4664 45.4644C85.6687 45.0511 84.7622 44.8636 83.7791 44.8636V46.8636C84.5082 46.8636 85.0865 47.0019 85.5464 47.2402L86.4664 45.4644ZM83.7791 44.8636C82.8501 44.8636 81.9618 45.0352 81.1232 45.3832L81.8896 47.2305C82.4752 46.9875 83.102 46.8636 83.7791 46.8636V44.8636ZM81.1281 45.3811C80.2788 45.7281 79.5618 46.2462 79.0014 46.9396L80.5569 48.1968C80.8904 47.7841 81.3249 47.4612 81.8846 47.2325L81.1281 45.3811ZM79.0056 46.9344C78.4096 47.6618 78.1003 48.5316 78.053 49.4965L80.0506 49.5944C80.0791 49.0138 80.2547 48.5655 80.5526 48.202L79.0056 46.9344ZM79.0518 48.5455H76.3246V50.5455H79.0518V48.5455ZM77.3239 49.5827C77.3622 48.5531 77.6674 47.6848 78.2261 46.942L76.6276 45.7399C75.8075 46.8303 75.3778 48.0984 75.3253 49.5082L77.3239 49.5827ZM78.2284 46.9388C78.8119 46.1565 79.5786 45.5393 80.5512 45.0894L79.7116 43.2742C78.4569 43.8546 77.4205 44.6768 76.6253 45.743L78.2284 46.9388ZM80.5489 45.0905C81.5281 44.6406 82.6151 44.4091 83.8246 44.4091V42.4091C82.3522 42.4091 80.9771 42.6927 79.7139 43.2731L80.5489 45.0905ZM83.8246 44.4091C85.1284 44.4091 86.1857 44.6726 87.0364 45.1543L88.0218 43.4139C86.812 42.7289 85.3996 42.4091 83.8246 42.4091V44.4091ZM87.0413 45.157C87.928 45.6525 88.5845 46.2915 89.0406 47.0725L90.7676 46.0639C90.1177 44.9509 89.1908 44.0671 88.0169 43.4111L87.0413 45.157ZM89.0406 47.0725C89.5041 47.8661 89.7337 48.7148 89.7337 49.6364H91.7337C91.7337 48.361 91.4102 47.1642 90.7676 46.0639L89.0406 47.0725ZM89.7337 49.6364C89.7337 50.7623 89.4413 51.6623 88.898 52.3907L90.5011 53.5865C91.3366 52.4664 91.7337 51.1317 91.7337 49.6364H89.7337ZM88.8948 52.395C88.3499 53.1337 87.6084 53.654 86.6253 53.9521L87.2057 55.8661C88.5711 55.452 89.6856 54.6921 90.5043 53.5823L88.8948 52.395ZM85.9155 54.9091V55.0909H87.9155V54.9091H85.9155ZM86.7527 56.0776C88.0194 56.2865 88.9354 56.8069 89.5852 57.5998L91.1321 56.332C90.1304 55.1097 88.751 54.3802 87.0782 54.1042L86.7527 56.0776ZM89.5876 57.6026C90.245 58.3987 90.5973 59.4027 90.5973 60.6818H92.5973C92.5973 59.0063 92.1239 57.5331 91.1298 56.3292L89.5876 57.6026ZM90.5973 60.6818C90.5973 61.7532 90.3092 62.6913 89.7379 63.5262L91.3885 64.6556C92.196 63.4754 92.5973 62.1407 92.5973 60.6818H90.5973ZM89.737 63.5276C89.1615 64.3716 88.3691 65.0492 87.3298 65.5556L88.2057 67.3535C89.5301 66.7083 90.6013 65.8102 91.3894 64.6542L89.737 63.5276ZM87.3298 65.5556C86.3031 66.0557 85.1118 66.3182 83.7337 66.3182V68.3182C85.3707 68.3182 86.8687 68.0049 88.2057 67.3535L87.3298 65.5556Z", fill: "black" })), sy = (n) => /* @__PURE__ */ b.createElement("svg", { xmlns: "http://www.w3.org/2000/svg", xmlSpace: "preserve", viewBox: "0 0 214.27 214.27", ...n }, /* @__PURE__ */ b.createElement("path", { d: "M196.926 55.171c-.11-5.785-.215-11.25-.215-16.537a7.5 7.5 0 0 0-7.5-7.5c-32.075 0-56.496-9.218-76.852-29.01a7.498 7.498 0 0 0-10.457 0c-20.354 19.792-44.771 29.01-76.844 29.01a7.5 7.5 0 0 0-7.5 7.5c0 5.288-.104 10.755-.215 16.541-1.028 53.836-2.436 127.567 87.331 158.682a7.495 7.495 0 0 0 4.912 0c89.774-31.116 88.368-104.849 87.34-158.686zm-89.795 143.641c-76.987-27.967-75.823-89.232-74.79-143.351.062-3.248.122-6.396.164-9.482 30.04-1.268 54.062-10.371 74.626-28.285 20.566 17.914 44.592 27.018 74.634 28.285.042 3.085.102 6.231.164 9.477 1.032 54.121 2.195 115.388-74.798 143.356z" }), /* @__PURE__ */ b.createElement("path", { d: "m132.958 81.082-36.199 36.197-15.447-15.447a7.501 7.501 0 0 0-10.606 10.607l20.75 20.75a7.477 7.477 0 0 0 5.303 2.196 7.477 7.477 0 0 0 5.303-2.196l41.501-41.5a7.498 7.498 0 0 0 .001-10.606 7.5 7.5 0 0 0-10.606-.001z" })), oy = (n) => /* @__PURE__ */ b.createElement("svg", { xmlns: "http://www.w3.org/2000/svg", xmlSpace: "preserve", viewBox: "0 0 20 20", fill: "none", ...n }, /* @__PURE__ */ b.createElement("circle", { className: "text-base", cx: 10, cy: 10, r: 10, fill: "#4f8cf7", fillOpacity: 0.2 }), /* @__PURE__ */ b.createElement("path", { d: "M6 10l3 3 5-5", stroke: "#4f8cf7", strokeWidth: 1.5, strokeLinecap: "round", strokeLinejoin: "round" })), ly = (n) => /* @__PURE__ */ b.createElement("svg", { className: "grayscale h-4 w-4", viewBox: "0 0 1024 1024", xmlns: "http://www.w3.org/2000/svg", ...n }, /* @__PURE__ */ b.createElement("path", { fill: "currentColor", d: "M42.666667 512C42.666667 251.733333 251.733333 42.666667 512 42.666667s469.333333 187.733333 469.333333 422.4c0 72.533333-29.866667 145.066667-81.066666 200.533333-51.2 51.2-123.733333 81.066667-200.533334 81.066667h-85.333333c-12.8 0-25.6 12.8-29.866667 25.6 0 8.533333 4.266667 17.066667 8.533334 21.333333 21.333333 21.333333 29.866667 46.933333 29.866666 76.8 0 64-51.2 110.933333-115.2 115.2C251.733333 981.333333 42.666667 772.266667 42.666667 512z m85.333333 0c0 213.333333 170.666667 384 384 384 17.066667 0 29.866667-12.8 29.866667-29.866667 0-4.266667 0-8.533333-4.266667-12.8l-4.266667-4.266666c-17.066667-21.333333-25.6-46.933333-29.866666-76.8 0-64 51.2-110.933333 115.2-110.933334h85.333333c51.2 0 102.4-21.333333 136.533333-55.466666 38.4-38.4 55.466667-85.333333 55.466667-136.533334 0-187.733333-170.666667-341.333333-384-341.333333s-384 170.666667-384 384z m593.066667 21.333333c-21.333333-21.333333-25.6-51.2-17.066667-76.8 12.8-25.6 38.4-42.666667 64-42.666666 38.4 0 68.266667 34.133333 72.533333 72.533333 0 29.866667-17.066667 55.466667-42.666666 64-8.533333 4.266667-17.066667 4.266667-25.6 4.266667-17.066667 0-38.4-8.533333-51.2-21.333334z m-520.533334 0c-21.333333-21.333333-25.6-51.2-17.066666-76.8 12.8-25.6 38.4-42.666667 64-42.666666 38.4 0 68.266667 34.133333 72.533333 72.533333 0 29.866667-17.066667 55.466667-42.666667 64-8.533333 4.266667-17.066667 4.266667-25.6 4.266667-21.333333 0-38.4-8.533333-51.2-21.333334z m379.733334-187.733333c-21.333333-21.333333-25.6-51.2-17.066667-76.8 12.8-25.6 38.4-42.666667 64-42.666667 38.4 0 68.266667 34.133333 72.533333 72.533334 0 29.866667-17.066667 55.466667-42.666666 64-8.533333 4.266667-17.066667 4.266667-25.6 4.266666-21.333333 0-38.4-8.533333-51.2-21.333333zM341.333333 345.6c-17.066667-21.333333-25.6-51.2-12.8-76.8 12.8-25.6 38.4-42.666667 64-42.666667 38.4 0 68.266667 34.133333 72.533334 72.533334 0 29.866667-17.066667 55.466667-42.666667 64l-29.866667 4.266666c-17.066667 0-34.133333-8.533333-51.2-21.333333z" })), cy = (n) => /* @__PURE__ */ b.createElement("svg", { viewBox: "0 0 1024 1024", xmlns: "http://www.w3.org/2000/svg", ...n }, /* @__PURE__ */ b.createElement("path", { d: "M512 1024C229.248 1024 0 794.752 0 512S229.248 0 512 0s512 229.248 512 512-229.248 512-512 512z m0-938.666667C276.352 85.333333 85.333333 276.352 85.333333 512s191.018667 426.666667 426.666667 426.666667 426.666667-191.018667 426.666667-426.666667A426.666667 426.666667 0 0 0 512 85.333333z m0 682.666667a42.666667 42.666667 0 0 1-42.368-42.666667v-255.573333a42.368 42.368 0 1 1 84.693333 0V725.333333A42.410667 42.410667 0 0 1 512 768z m0-426.666667a42.325333 42.325333 0 1 1-0.085333-84.650666A42.325333 42.325333 0 0 1 512 341.333333z m42.325333-42.666666v0z", fill: "currentColor" })), uy = (n) => /* @__PURE__ */ b.createElement("svg", { viewBox: "0 0 1024 1024", xmlns: "http://www.w3.org/2000/svg", ...n }, /* @__PURE__ */ b.createElement("path", { d: "M945.066667 898.133333l-189.866667-189.866666c55.466667-64 87.466667-149.333333 87.466667-241.066667 0-204.8-168.533333-373.333333-373.333334-373.333333S96 264.533333 96 469.333333 264.533333 842.666667 469.333333 842.666667c91.733333 0 174.933333-34.133333 241.066667-87.466667l189.866667 189.866667c6.4 6.4 14.933333 8.533333 23.466666 8.533333s17.066667-2.133333 23.466667-8.533333c8.533333-12.8 8.533333-34.133333-2.133333-46.933334zM469.333333 778.666667C298.666667 778.666667 160 640 160 469.333333S298.666667 160 469.333333 160 778.666667 298.666667 778.666667 469.333333 640 778.666667 469.333333 778.666667z", fill: "currentColor" }), /* @__PURE__ */ b.createElement("path", { d: "M597.333333 437.333333h-96V341.333333c0-17.066667-14.933333-32-32-32s-32 14.933333-32 32v96H341.333333c-17.066667 0-32 14.933333-32 32s14.933333 32 32 32h96V597.333333c0 17.066667 14.933333 32 32 32s32-14.933333 32-32v-96H597.333333c17.066667 0 32-14.933333 32-32s-14.933333-32-32-32z", fill: "currentColor" })), dy = (n) => /* @__PURE__ */ b.createElement("svg", { viewBox: "0 0 1024 1024", xmlns: "http://www.w3.org/2000/svg", ...n }, /* @__PURE__ */ b.createElement("path", { d: "M637 443H325c-4.4 0-8 3.6-8 8v60c0 4.4 3.6 8 8 8h312c4.4 0 8-3.6 8-8v-60c0-4.4-3.6-8-8-8z", fill: "currentColor" }), /* @__PURE__ */ b.createElement("path", { fill: "currentColor", d: "M921 867L775 721c122.1-148.9 113.6-369.5-26-509-148-148.1-388.4-148.1-537 0-148.1 148.6-148.1 389 0 537 139.5 139.6 360.1 148.1 509 26l146 146c3.2 2.8 8.3 2.8 11 0l43-43c2.8-2.7 2.8-7.8 0-11zM696 696c-118.8 118.7-311.2 118.7-430 0-118.7-118.8-118.7-311.2 0-430 118.8-118.7 311.2-118.7 430 0 118.7 118.8 118.7 311.2 0 430z" })), Ly = (n) => /* @__PURE__ */ b.createElement("svg", { width: 24, height: 24, viewBox: "0 0 24 24", fill: "none", xmlns: "http://www.w3.org/2000/svg", ...n }, /* @__PURE__ */ b.createElement("path", { d: "M12 8L20 12L12 16L4 12L12 8Z", stroke: "currentColor", strokeWidth: 1.5, strokeLinecap: "round", strokeLinejoin: "round" })), Cy = (n) => /* @__PURE__ */ b.createElement("svg", { width: 24, height: 24, viewBox: "0 0 24 24", fill: "none", xmlns: "http://www.w3.org/2000/svg", ...n }, /* @__PURE__ */ b.createElement("path", { d: "M12 5L19 12L12 19L5 12L12 5Z", stroke: "currentColor", strokeWidth: 1.5, strokeLinecap: "round", strokeLinejoin: "round" }), /* @__PURE__ */ b.createElement("path", { d: "M12 9V13", stroke: "currentColor", strokeWidth: 1.5, strokeLinecap: "round", strokeLinejoin: "round" }), /* @__PURE__ */ b.createElement("path", { d: "M12 15V15.5", stroke: "currentColor", strokeWidth: 1.5, strokeLinecap: "round", strokeLinejoin: "round" })), _y = (n) => /* @__PURE__ */ b.createElement("svg", { fill: "currentColor", width: "24px", height: "24px", viewBox: "0 0 1024 1024", xmlns: "http://www.w3.org/2000/svg", ...n }, /* @__PURE__ */ b.createElement("path", { d: "M960 101.84l-896.002.002c-35.344 0-64 28.656-64 64v576c0 35.36 28.656 64 64 64h160c20.496 0 32-26.32 32-31.984v-.016c0-5.824-10.88-32.416-32-32.416h-120.96c-21.376 0-38.72-17.344-38.72-38.72V206.002c0-21.391 17.328-38.72 38.72-38.72l818.272-1.007c21.376 0 38.72 17.328 38.72 38.72V702.69c0 21.376-17.344 38.72-38.72 38.72H518.142l75.984-68.912c9.344-8.944 12.369-23.408 3.025-32.336l-5.472-8.064c-9.376-8.945-24.496-8.945-33.84 0L428.111 750.53c-.192.16-.368.224-.528.368l-8.48 8.096c-4.672 4.431-7.008 10.335-6.976 16.223-.032 5.904 2.288 11.777 6.977 16.288l8.48 8.096c.16.16.368.192.528.336L555.84 915.44c9.344 8.944 24.464 8.944 33.84 0l5.472-8.065c9.344-8.944 6.32-23.44-3.025-32.368l-77.135-69.168H960c35.343 0 64-28.64 64-64v-576c0-35.344-28.657-64-64-64z" })), gy = (n) => /* @__PURE__ */ b.createElement("svg", { width: 24, height: 24, viewBox: "0 0 24 24", fill: "none", xmlns: "http://www.w3.org/2000/svg", ...n }, /* @__PURE__ */ b.createElement("circle", { cx: 12, cy: 12, r: 7, stroke: "currentColor", strokeWidth: 1.5, strokeDasharray: "3 2", strokeLinecap: "round" })), py = (n) => /* @__PURE__ */ b.createElement("svg", { width: 24, height: 24, viewBox: "0 0 24 24", fill: "none", xmlns: "http://www.w3.org/2000/svg", ...n }, /* @__PURE__ */ b.createElement("path", { d: "M10 6H18C19.1046 6 20 6.89543 20 8V16C20 17.1046 19.1046 18 18 18H10", stroke: "currentColor", strokeWidth: 1.5, strokeLinecap: "round", strokeLinejoin: "round" }), /* @__PURE__ */ b.createElement("path", { d: "M10 6L6 12L10 18", stroke: "currentColor", strokeWidth: 1.5, strokeLinecap: "round", strokeLinejoin: "round" })), my = (n) => /* @__PURE__ */ b.createElement("svg", { width: 24, height: 24, viewBox: "0 0 24 24", fill: "none", xmlns: "http://www.w3.org/2000/svg", ...n }, /* @__PURE__ */ b.createElement("path", { d: "M5 10H19", stroke: "currentColor", strokeWidth: 1.5, strokeLinecap: "round", strokeLinejoin: "round" }), /* @__PURE__ */ b.createElement("path", { d: "M5 14H19", stroke: "currentColor", strokeWidth: 1.5, strokeLinecap: "round", strokeLinejoin: "round" })), hy = (n) => /* @__PURE__ */ b.createElement("svg", { width: "24px", height: "24px", viewBox: "0 0 15 15", fill: "none", xmlns: "http://www.w3.org/2000/svg", ...n }, /* @__PURE__ */ b.createElement("path", { fillRule: "evenodd", clipRule: "evenodd", d: "M2 1.5C2 1.77614 1.77614 2 1.5 2C1.22386 2 1 1.77614 1 1.5C1 1.22386 1.22386 1 1.5 1C1.77614 1 2 1.22386 2 1.5ZM2 5L2 10H13V5H2ZM2 4C1.44772 4 1 4.44772 1 5V10C1 10.5523 1.44772 11 2 11H13C13.5523 11 14 10.5523 14 10V5C14 4.44772 13.5523 4 13 4H2ZM1.5 14C1.77614 14 2 13.7761 2 13.5C2 13.2239 1.77614 13 1.5 13C1.22386 13 1 13.2239 1 13.5C1 13.7761 1.22386 14 1.5 14ZM4 1.5C4 1.77614 3.77614 2 3.5 2C3.22386 2 3 1.77614 3 1.5C3 1.22386 3.22386 1 3.5 1C3.77614 1 4 1.22386 4 1.5ZM3.5 14C3.77614 14 4 13.7761 4 13.5C4 13.2239 3.77614 13 3.5 13C3.22386 13 3 13.2239 3 13.5C3 13.7761 3.22386 14 3.5 14ZM6 1.5C6 1.77614 5.77614 2 5.5 2C5.22386 2 5 1.77614 5 1.5C5 1.22386 5.22386 1 5.5 1C5.77614 1 6 1.22386 6 1.5ZM5.5 14C5.77614 14 6 13.7761 6 13.5C6 13.2239 5.77614 13 5.5 13C5.22386 13 5 13.2239 5 13.5C5 13.7761 5.22386 14 5.5 14ZM8 1.5C8 1.77614 7.77614 2 7.5 2C7.22386 2 7 1.77614 7 1.5C7 1.22386 7.22386 1 7.5 1C7.77614 1 8 1.22386 8 1.5ZM7.5 14C7.77614 14 8 13.7761 8 13.5C8 13.2239 7.77614 13 7.5 13C7.22386 13 7 13.2239 7 13.5C7 13.7761 7.22386 14 7.5 14ZM10 1.5C10 1.77614 9.77614 2 9.5 2C9.22386 2 9 1.77614 9 1.5C9 1.22386 9.22386 1 9.5 1C9.77614 1 10 1.22386 10 1.5ZM9.5 14C9.77614 14 10 13.7761 10 13.5C10 13.2239 9.77614 13 9.5 13C9.22386 13 9 13.2239 9 13.5C9 13.7761 9.22386 14 9.5 14ZM12 1.5C12 1.77614 11.7761 2 11.5 2C11.2239 2 11 1.77614 11 1.5C11 1.22386 11.2239 1 11.5 1C11.7761 1 12 1.22386 12 1.5ZM11.5 14C11.7761 14 12 13.7761 12 13.5C12 13.2239 11.7761 13 11.5 13C11.2239 13 11 13.2239 11 13.5C11 13.7761 11.2239 14 11.5 14ZM14 1.5C14 1.77614 13.7761 2 13.5 2C13.2239 2 13 1.77614 13 1.5C13 1.22386 13.2239 1 13.5 1C13.7761 1 14 1.22386 14 1.5ZM13.5 14C13.7761 14 14 13.7761 14 13.5C14 13.2239 13.7761 13 13.5 13C13.2239 13 13 13.2239 13 13.5C13 13.7761 13.2239 14 13.5 14Z", fill: "currentColor" })), fy = (n) => /* @__PURE__ */ b.createElement("svg", { width: "24px", height: "24px", viewBox: "0 0 76 76", xmlns: "http://www.w3.org/2000/svg", xmlnsXlink: "http://www.w3.org/1999/xlink", baseProfile: "full", enableBackground: "new 0 0 76.00 76.00", xmlSpace: "preserve", ...n }, /* @__PURE__ */ b.createElement("path", { fill: "currentColor", fillOpacity: 1, strokeWidth: 0.2, strokeLinejoin: "round", d: "M 26,22.0001L 27,21.9998L 27,27L 26.0001,27.0003C 23.2386,27.0003 21.0001,29.2389 21.0001,32.0003L 21,46.0002C 21,48.7616 23.2386,51.0002 25.9999,51.0002L 27,51.0002L 27,47L 33.75,53.5L 27,60L 27,56L 26,56C 20.4771,56 16,51.5229 16,46L 16,32.0001C 16,26.4773 20.4771,22.0001 26,22.0001 Z M 33,27L 59,27L 59,32L 33,32L 33,27 Z M 36,35L 59,35L 59,40L 36,40L 36,35 Z M 33,43L 59,43L 59,48L 33,48L 33,43 Z " })), Ey = { close: ey, "collapse-expanded": ty, "collapse-unexpanded": ny, debug: iy, "non-selected-cycle": ry, numbering: ay, privacy: sy, "selected-cycle": oy, theme: ly, tip: cy, "zoom-in": uy, "zoom-out": dy, "alt-fragment": Ly, "critical-fragment": Cy, "loop-fragment": _y, "opt-fragment": gy, "ref-fragment": py, "par-fragment": my, "section-fragment": hy, "try-catch-fragment": fy }, fe = (n) => { const e = Ey[n.name]; return e ? /* @__PURE__ */ S.jsx( "span", { className: H2( "flex items-center justify-center w-5 h-4", n.className ), onClick: n.onClick, children: /* @__PURE__ */ S.jsx(e, {}) } ) : null; }, Sy = () => localStorage.zenumlDebug ? /* @__PURE__ */ S.jsx("div", { className: "flex flex-nowrap m-2 text-sm", children: /* @__PURE__ */ S.jsxs("div", { className: "ml-4 text-xs inline-flex items-center font-bold leading-sm px-3 py-1 bg-green-200 text-green-700 rounded-sm", children: [ /* @__PURE__ */ S.jsx(fe, { name: "debug", className: "h-4 w-4" }), /* @__PURE__ */ S.jsxs("span", { className: "inline-block px-2", children: [ void 0, ":", void 0 ] }) ] }) }) : null, Ty = "_tooltip_5kyas_1", vy = "_bottom_5kyas_29", Og = { tooltip: Ty, bottom: vy }, Ry = (n) => /* @__PURE__ */ S.jsx("div", { className: n.className, children: /* @__PURE__ */ S.jsx( "div", { className: H2( Og.tooltip, Og.bottom, "privacy whitespace-normal flex items-center" ), "data-tooltip": "We (the vendor) do not have access to your data. The diagram is generated in this browser.", children: /* @__PURE__ */ S.jsx(fe, { name: "privacy", className: "fill-current h-6 w-6 m-auto" }) } ) }), by = (n) => { var t; const e = (t = n.context) == null ? void 0 : t.content(); return /* @__PURE__ */ S.jsx("div", { className: "title text-skin-title text-base font-semibold", children: e }); }, xy = ` `, wy = ` `, My = ` `, Ay = ` `, yy = ` `, Ny = ` `, Oy = ` `, Iy = ` `, Dy = ` `, ky = ` `, Py = ` `, Fy = ` `, Uy = ` `, Zy = ` `, By = ` `, Gy = ` `, zy = ` `, Hy = ` `, Yy = ` `, Vy = ` `, qy = ` `, Wy = ` `, $y = ` `, Ky = ` `, Qy = ` `, jy = ` `, Xy = ` `, Jy = ` `, eN = ` `, tN = ` `, nN = ` `, iN = ` `, rN = ` `, aN = ` `, sN = ` `, oN = ` `, lN = ` `, cN = ` `, uN = ` `, dN = ` `, LN = ` `, CN = ` `, _N = ` `, gN = ` `, pN = ` `, mN = ` `, hN = ` `, fN = ` `, EN = ` `, SN = ` `, TN = ` `, vN = ` `, RN = ` `, bN = ` `, xN = ` `, wN = ` `, MN = ` `, AN = ` `, yN = ` `, NN = ` `, ON = ` `, IN = ` `, DN = ` `, kN = ` `, PN = ` `, FN = ` `, UN = ` `, ZN = ` `, BN = ` `, GN = ` `, zN = ` `, HN = ` `, YN = ` `, VN = ` `, qN = ` `, WN = ` `, $N = ` `, KN = ` `, QN = ` `, jN = ` `, XN = ` `, JN = ` `, eO = ` `, tO = ` `, nO = ` `, iO = ` `, rO = ` `, aO = ` `, sO = ` `, oO = ` `, lO = ` `, cO = ` `, uO = ` `, dO = ` `, LO = ` `, CO = ` `, _O = ` `, gO = ` `, pO = ` `, mO = ` `, hO = ` `, fO = ` `, EO = ` `, SO = ` `, TO = ` `, vO = ` `, RO = ` `, bO = ` `, xO = ` `, wO = ` `, MO = ` `, AO = ` `, yO = ` `, NO = ` `, OO = ` `, IO = ` `, Ig = ` `, DO = ` `, kO = ` `, PO = ` `, FO = ` `, UO = ` `, ZO = ` `, BO = ` `, GO = ` `, zO = ` `, HO = ` `, YO = ` `, VO = ` `, qO = ` `, WO = ` `, $O = ` `, KO = ` `, QO = ` `, jO = ` `, XO = ` `, JO = ` `, eI = ` `, tI = ` `, nI = ` `, iI = ` `, rI = ` `, aI = ` `, sI = ` `, oI = ` `, lI = ` `, cI = ` `, uI = ` `, dI = ` `, LI = ` `, CI = ` `, _I = ` `, gI = ` `, pI = ` `, mI = ` `, hI = ` `, fI = ` `, EI = ` `, SI = ` `, TI = ` `, vI = ` `, RI = ` `, bI = ` `, xI = ` `, wI = ` `, MI = ` `, AI = ` `, yI = ` `, Dg = ` `, NI = ` `, OI = ` `, II = ` `, DI = ` `, kI = ` `, PI = ` `, FI = ` `, UI = ` `, ZI = ` `, BI = ` `, GI = ` `, zI = ` `, HI = ` `, YI = ` `, VI = ` `, qI = ` `, WI = ` `, $I = ` `, KI = ` `, kg = ` `, QI = ` `, jI = ` `, Pg = ` `, XI = ` `, JI = ` `, eD = ` `, tD = ` `, nD = ` `, iD = ` `, rD = ` `, aD = ` `, sD = ` `, oD = ` `, lD = ` `, cD = ` `, uD = ` `, dD = ` `, LD = ` `, CD = ` `, _D = ` `, gD = ` `, pD = ` `, mD = ` `, hD = ` `, fD = ` `, ED = ` `, SD = ` `, TD = ` `, vD = ` `, RD = ` `, bD = ` `, xD = ` `, wD = ` `, MD = ` `, AD = ` `, yD = ` `, ND = ` `, OD = ` `, ID = ` `, DD = ` `, kD = ` `, PD = ` `, FD = ` `, UD = ` `, Fg = ` `, ZD = ` `, BD = ` `, GD = ` `, zD = ` `, HD = ` `, YD = ` `, VD = ` `, qD = ` `, WD = ` `, $D = ` `, KD = ` `, QD = ` `, jD = ` `, XD = ` `, JD = ` `, ek = ` `, tk = ` `, nk = ` `, ik = ` `, rk = ` `, ak = ` `, sk = ` `, ok = ` `, lk = ` `, ck = ` `, uk = ` `, dk = ` `, Ug = ` `, Lk = ` `, Ck = ` `, _k = ` `, gk = ` `, pk = ` `, mk = ` `, hk = ` `, fk = ` `, Ek = ` `, Sk = ` `, Tk = ` `, vk = ` `, Zg = ` `, Rk = ` `, bk = ` `, xk = ` `, wk = ` `, Mk = ` `, Ak = ` `, yk = ` `, Nk = ` `, Ok = ` `, Ik = ` `, Dk = ` `, kk = ` `, Pk = ` `, Fk = ` `, Uk = ` `, Zk = ` `, Fr = ` `, Bg = ` `, Bk = ` `, Gk = ` `, zk = ` `, Hk = ` `, Yk = ` `, Vk = ` `, qk = ` `, Wk = ` `, $k = ` `, Kk = ` `, Qk = ` `, jk = ` `, Xk = ` `, Jk = ` `, eP = ` `, tP = ` `, nP = ` `, iP = ` `, rP = ` `, aP = ` `, sP = ` `, oP = ` `, lP = ` `, cP = ` `, uP = ` `, dP = ` `, LP = ` `, CP = ` `, _P = ` `, gP = ` `, pP = ` `, mP = ` `, hP = ` `, fP = ` `, EP = ` `, SP = ` `, TP = ` `, vP = ` `, RP = ` `, bP = ` `, xP = ` `, wP = ` `, MP = ` `, AP = ` `, yP = ` `, NP = ` `, OP = ` `, IP = ` `, DP = ` `, kP = ` `, PP = ` `, FP = ` `, UP = ` `, ZP = ` `, BP = ` `, GP = ` `, zP = ` `, Ur = ` `, HP = ` `, Gg = ` `, YP = ` `, VP = ` `, qP = ` `, WP = ` `, $P = ` `, KP = ` `, QP = ` `, jP = ` `, zg = ` `, XP = ` `, JP = ` `, eF = ` `, tF = ` `, nF = ` `, Hg = ` `, Yg = ` `, iF = ` `, rF = ` `, aF = ` `, sF = ` `, oF = ` `, lF = ` `, cF = ` `, uF = ` `, dF = ` `, LF = ` `, CF = ` `, _F = ` `, gF = ` `, pF = ` `, mF = ` `, hF = ` `, fF = ` `, EF = ` `, Vg = ` `, SF = ` `, TF = ` `, vF = ` `, RF = ` `, bF = ` `, xF = ` `, wF = ` `, MF = ` `, AF = ` `, yF = ` `, qg = ` `, NF = ` `, OF = ` `, IF = ` `, DF = ` `, kF = ` `, PF = ` `, FF = ` `, Wg = ` `, UF = ` `, ZF = ` `, BF = ` `, GF = ` `, zF = ` `, HF = ` `, YF = ` `, VF = ` `, qF = ` `, WF = ` `, $F = ` `, KF = ` `, QF = ` `, jF = ` `, XF = ` `, JF = ` `, eU = ` `, tU = ` `, nU = ` `, iU = ` `, rU = ` `, aU = ` `, sU = ` `, oU = ` `, lU = ` `, cU = ` `, uU = ` `, dU = ` `, LU = ` `, CU = ` `, _U = ` `, gU = ` `, pU = ` `, mU = ` `, hU = ` `, fU = ` `, EU = ` `, SU = ` `, TU = ` `, vU = ` `, RU = '', bU = '', xU = '', wU = '', MU = '', AU = '', yU = ``, NU = '', OU = '', IU = '', DU = '', kU = '', PU = '', FU = '', UU = '', ZU = '', BU = '', GU = '', zU = ``, HU = '', YU = '', VU = ` `, qU = '', WU = '', $U = '', KU = '', QU = '', jU = ` `, XU = `\r `, JU = `\r `, eZ = `\r \r \r `, tZ = ` \r `, nZ = `\r \r \r `, iZ = `\r \r `, rZ = `\r \r \r \r `, aZ = `\r \r `, sZ = ` \r `, oZ = ` `, lZ = `\r \r `, cZ = ` \r `, uZ = ` `, dZ = ` `, LZ = `\r \r `, CZ = `\r \r \r `, _Z = `\r `, gZ = `\r \r \r \r `, pZ = `\r `, mZ = ` `, hZ = `\r `, fZ = ` `, EZ = `\r `, SZ = ` `, TZ = ` `, vZ = ` `, RZ = ` `, bZ = ` `, xZ = ` `, rc = { actor: xy, boundary: wy, control: My, database: Ay, entity: yy, awsiotlora: Py, awsiotgreengrasscomponent: Fy, cloudwatch: Fg, cloudfront: Ug, cognito: Ny, dynamodb: Wg, ebs: Gg, ec2: Yg, ecs: zg, efs: Fr, elasticache: qg, elasticbeantalk: Oy, elasticfilesystem: Fr, glacier: Ur, s3glacier: Ur, iam: Dg, kinesis: Iy, lambda: Hg, lightsail: Dy, rds: Vg, redshift: Ig, s3: Bg, sns: Pg, sqs: kg, sagemaker: ky, vpc: Zg, awsiotthingcoffeepot: Uy, awsiotlambda: Zy, awsiotthingwindfarm: By, awsiotthingvibrationsensor: Gy, awsiotdevicedefenderjobs: zy, awsiotdevicemanagementfleethub: Hy, awsiottopic: Yy, awsiotcertificate: Vy, awsiotthingrelay: qy, awsiotanalyticschannel: Wy, awsiotthingcamera: $y, awsiotthingdoorlock: Ky, awsiotpolicy: Qy, awsiotthingfreertos: jy, awsiotsitewiseassetproperties: Xy, awsiotthingtempvibrationsensor: Jy, awsiotthingplc: eN, awsiotaction: tN, awsiotalexavoice: nN, awsiotalexaenabled: iN, awsiotthingutility: rN, awsiotactuator: aN, awsiotthingtempsensor: sN, awsiothttpprotocol: oN, awsiotcoredevicelocation: lN, awsiotalexaskill: cN, awsiotanalyticsnotebook: uN, awsiothardwareboard: dN, awsiotthingcar: LN, awsiotthinglightbulb: CN, awsiotsitewiseasset: _N, awsiotsitewisedatastreams: gN, awsiotgreengrasscomponentnucleus: pN, awsiotthinghouse: mN, awsiotoverairupdate: hN, awsiotthingbank: fN, awsiotsensor: EN, awsiotsitewiseassethierarchy: SN, awsiotgreengrassartifact: TN, awsiotthingtravel: vN, awsiotmqttprotocol: RN, awsiotshadow: bN, awsiotfiretv: xN, awsiotgreengrassconnector: wN, awsiotgreengrassipc: MN, awsiothttp2protocol: AN, awsiotfiretvstick: yN, awsiotcoredeviceadvisor: NN, awsiotthingindustrialpc: ON, awsiotdesiredstate: IN, awsiotecho: DN, awsiotgreengrassrecipe: kN, awsiotgreengrasscomponentprivate: PN, awsiotgreengrassstreammanager: FN, awsiotthingmedicalemergency: UN, awsiotthingthermostat: ZN, awsiotsitewiseassetmodel: BN, awsiotthingstacklight: GN, awsiotthingtemphumiditysensor: zN, awsiotgreengrasscomponentpublic: HN, awsiotsailboat: YN, awsiotrule: VN, awsiotthingbicycle: qN, awsiotreportedstate: WN, awsiotsimulator: $N, awsiotthingpoliceemergency: KN, awsiotanalyticsdatastore: QN, awsiotdevicetester: jN, awsiotanalyticspipeline: XN, awsiotthingfactory: JN, awsiotthinghumiditysensor: eO, awsiotgreengrassprotocol: tO, awsiotservo: nO, awsiotanalyticsdataset: iO, awsiotgreengrassmachinelearning: rO, awsiotthinggeneric: aO, awsiotdevicegateway: sO, awsiotthingcart: oO, amazonrekognitionvideo: lO, amazonsagemakermodel: cO, amazonsagemakeranalyzelending: uO, amazonsagemakershadowtesting: dO, amazondevopsguruinsights: LO, amazonsagemakernotebook: CO, amazonsagemakercanvas: _O, amazonsagemakertrain: gO, amazonsagemakergeospatialml: pO, amazonrekognitionimage: mO, amazonbraketsimulator: hO, amazonbraketnoisesimulator: fO, amazonbraketchip: EO, amazonbraketsimulator1: SO, amazonbraketmanagedsimulator: TO, amazonbraketsimulator3: vO, amazonbraketchandelier: RO, amazonbrakettensornetwork: bO, amazonbraketsimulator4: xO, amazonbraketqpu: wO, amazonbraketstatevector: MO, amazonbraketsimulator2: AO, amazonopensearchobservability: yO, amazonredshiftra3: NO, amazonredshiftstreaming: OO, amazonemrengine: IO, amazonredshiftqueryeditor: Ig, amazonehrhdfscluster: DO, amazonmskconnect: kO, awsgluedatacatalog: PO, amazondatzonedataportal: FO, amazondatzonebusinessdatacatalog: UO, amazondatzonedataprojects: ZO, amazonredshiftdensestorage: BO, awsgluedataquality: GO, awsgluecrawler: zO, amazonquicksightreports: HO, awslakeformationdatalake: YO, amazonopensearchultrawarm: VO, amazoncloudsearchsearchdocuments: qO, amazonopensearchingestion: WO, amazonathenadatasource: $O, amazonopensearchadminnode: KO, amazonopensearchdashboards: QO, amazonopensearchindex: jO, awsglueray: XO, amazonredshiftdatasharing: JO, amazonredshiftautocopy: eI, amazonredshiftdensecompute: tI, amazonredshiftml: nI, amazonopensearchtraces: iI, amazonemrcluster: rI, amazonopensearchdatanode: aI, awsdataexchangeapi: sI, amazonworkspaces: oI, amazonworkspacescore: lI, amazonworkspacesweb: cI, awsdirservicesimplead: uI, awswafbadbot: dI, awsidentityaccesssts: LI, awsidentityaccessaddon: CI, amazoninspectoragent: _I, awsidentityaccessdataencryption: gI, awsidentityaccessmfatoken: pI, awsdirserviceadconnector: mI, awsidentityaccesspermissions: hI, awswaflabels: fI, awscertmgrca: EI, awsidentityaccessstsalt: SI, awsdirservicemanagedmsad: TI, awssecurityhubfinding: vI, awswafrule: RI, awsidentityaccessrole: bI, awsidentityaccesslongtermcredential: xI, awsidentityaccesstempcredential: wI, awswaffilteringrule: MI, awswafbot: AI, awsshieldadvanced: yI, awsidentityaccessanalyzer: Dg, awswafbotcontrol: NI, awsidentityaccessrolesanywhere: OI, awsidentityaccessdataencryptionkey: II, awsnetworkfirewallendpoints: DI, awswafmanagedrule: kI, awskeymanagementexternalkeystore: PI, amazonblockchain: FI, amazoneventbridgesaas: UI, amazoneventbridgeschema: ZI, amazonmqbroker: BI, amazoneventbridgeschemaregistry: GI, amazoneventbridgedefaultbus: zI, amazonsnsnotification: HI, amazoneventbridgeevent: YI, amazonnshttpnotification: VI, amazoneventbridgepipes: qI, amazoneventbridgerule: WI, amazonapigatewayendpoint: $I, amazoneventbridgescheduler: KI, amazonsqsqueue: kg, amazonsqsmessage: QI, amazoneventbridgecustomeventbus: jI, amazonsnstopic: Pg, awsssmpatchmanager: XI, awscloudformationtemplate: JI, awsopsworkslayers: eD, amazoncloudwatchmetricsinsights: tD, amazoncloudwatchdataprotection: nD, amazoncloudwatchalarm: iD, awstrustedadvisorchecksecurity: rD, awstrustedadvisorcheckperformance: aD, amazoncloudwatchrule: sD, awsopsworksresources: oD, amazoncloudwatcheventtime: lD, awsorgsmanagementaccount: cD, awslicensemanagerlicenseblending: uD, amazoncloudwatcheventevent: dD, amazoncloudwatchsynthetics: LD, awsssmstatemanager: CD, awscloudformationstack: _D, awsopsworksinstances: gD, awsssmruncommand: pD, awsopsworksdeployments: mD, awsssmautomation: hD, awsssmchangecalendar: fD, awsorgsorganizationalunit: ED, awsssmsessionmanager: SD, awstrustedadvisorcheckcost: TD, awsopsworksstack2: vD, awslicensemanagerapplicationdiscovery: RD, awsssmopscenter: bD, awsssminventory: xD, awsopsworkspermissions: wD, awsopsworksapps: MD, awscloudformationchangeset: AD, awsssmdocuments: yD, awsssmapplicationmanager: ND, awsorgsaccount: OD, awscloudtrailcloudtraillake: ID, awsssmmaintenancewindows: DD, awssmmincidentmanager: kD, amazoncloudwatchevidently: PD, amazoncloudwatchrum: FD, awsssmparameterstore: UD, amazoncloudwatchlogs: Fg, awsssmchangemanager: ZD, awsopsworksmonitoring: BD, awsssmcompliance: GD, awsssmdistributor: zD, amazoncloudwatchobservability: HD, awstrustedadvisorcheckfault: YD, awstrustedadvisorchecklist: VD, amazonroute53routetable: qD, amazoncloudfrontdistribution: WD, amazonroute53routingcontrols: $D, amazonroute53arc: KD, amazonvpctrafficmirroring: QD, amazonvpcreachabilityanalyzer: jD, awscloudmapnamespace: XD, awstransitgatewayattachment: JD, amazonvpcigw: ek, amazoncloudfrontedgelocation: tk, awscloudwansegmentnetwork: nk, awscloudmapservice: ik, awsappmeshvirtualrouter: rk, amazonvpcendpoints: ak, amazonvpcvpnconnection: sk, amazoncloudfrontstreaming: ok, amazonvpcpeering: lk, amazonroute53resolverdnsfirewall: ck, amazonroute53hostedzone: uk, amazonvpcvpngateway: dk, amazoncloudfrontfunctions: Ug, amazoneaelasticnetworkadapter: Lk, awsappmeshvirtualgateway: Ck, amazonroute53resolverlogging: _k, elasticlbclassic: gk, amazonroute53resolver: pk, awscloudwancorenetworkedge: mk, awsappmeshvirtualservice: hk, amazonvpcflowlogs: fk, awscloudmapresource: Ek, awsdirectconnectgateway: Sk, amazonvpcnetworkaccessanalyzer: Tk, elasticlbapp: vk, amazonvpcvpc: Zg, amazonvpccarriergateway: Rk, amazoneaelasticnetworkinterface: bk, awscloudwanrouteattachment: xk, amazonroute53readiness: wk, awsappmeshvirtualnode: Mk, elasticlbgateway: Ak, amazonvpcrouter: yk, awsappmeshmesh: Nk, amazonvpcnatgateway: Ok, amazonvpcnetworkacl: Ik, amazonvpccustomer: Dk, elasticlbnetwork: kk, amazons3replication: Pk, amazons3onezone: Fk, awsbackuplegalhold: Uk, awsstoragegateaway: Zk, amazonefsstandard: Fr, amazons3bucket: Bg, awsstoragegateawayfile: Bk, awsfsxfile: Gk, amazons3glacierinstant: zk, amazonfilecache: Hk, amazons3standardia: Yk, amazons3generalaccess: Vk, amazons3lambda: qk, amazons3objectlock: Wk, awsbackupvirtualmachine: $k, amazonec2gp3: Kk, amazonefsfilesys: Qk, awssnowballimportexport: jk, amazons3object: Xk, awsbackupcache: Jk, amazons3lambdaobject: eP, awsbackupgateway: tP, awsbackuprto: nP, awsbackupvaultlock: iP, awsbackupvirtualtape: rP, amazonebsdatalifecycle: aP, awsbackupplan: sP, amazonfilecaches3: oP, awsbackupcloudformation: lP, awsbackuptapegateway: cP, awsbackupvmware: uP, amazonefsonezoneia: dP, amazons3replicationtime: LP, awsbackupstorage: CP, amazonefsintelligenttiering: _P, amazons3glacierdeep: gP, amazons3select: pP, amazons3outposts: mP, awsfilegateway: hP, amazons3glacier: fP, awsbackupvmmonitor: EP, amazons3multiregion: SP, awsbackupvault: TP, awsbackupauditmanager: vP, amazonfilecachehybridnfs: RP, amazonefselasticthroughput: bP, awsbackupawsbackupfors3: xP, amazons3standard: wP, amazonefsonezone: MP, awsstoragegateawayvolume: AP, awsbackuprestore: yP, amazonebsvolumes: NP, amazons3lens: OP, awsbackupcompute: IP, amazonvpclogs: DP, amazons3batch: kP, amazonefsinfrequent: PP, amazons3tiering: FP, awsbackuprpo: UP, awsbackupcompliance: ZP, amazonebssnapshot: BP, awsbackupdatabase: GP, awsbackupfsx: zP, amazons3glacierflex: Ur, amazons3bucketobject: HP, amazonebsvolume: Gg, amazons3vault: YP, amazoneksoutposts: VP, amazonecscontainer2: qP, amazonecrimage: WP, amazonecstask: $P, amazonecsservice: KP, amazonecscontainer1: QP, amazonecrregistry: jP, amazonecscontainer3: zg, amazonecscopilotcli: XP, amazonecsserviceconnect: JP, amazonec2extractor: eF, amazonec2ami: tF, awselasticbeanstalkdeployment: nF, awslambdafunction: Hg, amazonec2instance: Yg, amazonec2autoscaling: iF, amazonec2spotinstance: rF, awselasticbeanstalkapp: aF, amazonec2instancecloudwatch: sF, amazonec2rescue: oF, amazonec2instances: lF, amazonec2dbinstance: cF, amazonec2elasticip: uF, amazonrdsoptimizedwrites: dF, amazondynamodbtblclass: LF, amazonrdsinstancealternate: CF, amazondynamodbattributes: _F, amazonrdsauroramysqlalternative: gF, amazondynamodbitem: pF, amazonrdsaurorapgsqlalt: mF, amazondynamodbitems: hF, amazonrdsauroraalternate: fF, amazonrdsaurorasqlalt: EF, amazonrdsinstance: Vg, amazonrdsmultiaz: SF, amazondocdbelasticclusters: TF, amazonrdstrustedextpgsql: vF, amazonrdsaurorasql: RF, amazondynamodbglobal: bF, amazonrdsoracle: xF, amazonrdsoraclealternate: wF, amazondynamodbstream: MF, amazonrdstrustedpgsql: AF, amazondax: yF, amazonelasticache4redis: qg, amazonrdsproxy: NF, amazondynamodbaccesstable: OF, amazonrdsauroramysql: IF, amazonrdspiops: DF, awsdbmigrationserviceworkflow: kF, amazondynamodbattribute: PF, amazonrdsbluegreendeploy: FF, amazondynamodbtable: Wg, amazonrdsaurorainstance: UF, amazonrdsauroradbinstance: ZF, amazonelasticache4memcached: BF, amazonrdsproxyalternate: GF, amazonrdsaurorapgsql: zF, amazonrdsauroradbinstancealternate: HF, amazonelasticachecachenode: YF, amazonrdsmultiazcluster: VF, awstransferfamilyftps: qF, awstransferfamilysftp: WF, awsmainframemodruntime: $F, awstransferfamilyftp: KF, awsmigrationhubrefactor: QF, awsmainframemoddeveloper: jF, awsdiscoveryagent: XF, awsmainframemodcompiler: JF, awsmigrationhubrefactorapp: eU, awsdiscoveryagentlesscollector: tU, awsmainframemodanalyzer: nU, awsdatasyndiscovery: iU, awsmigrationhubrefactorservice: rU, awsdatasyngagent: aU, awsmainframemodconverter: sU, awstransferfamilyas2: oU, awsdiscoverymigrationevaluator: lU, awscloudinterface: cU, awsmediaconnectgateway: uU, awsrobomakercloudextensions: dU, awsrobomakersimulation: LU, awsrobomakerfleetmanagement: CU, awsrobomakerdevenv: _U, awsamplifystudio: gU, amazonlocationmap: pU, amazonlocationplace: mU, amazonlocationtrack: hU, amazonlocationgeofence: fU, amazonlocationroutes: EU, awscloud9: SU, amazonemailservice: TU, amazonpinpointjourney: vU, azureactivedirectory: RU, azurebackup: bU, azurecdn: xU, azuredatafactory: wU, azuredevops: MU, azurefunction: AU, azuresql: yU, cosmosdb: NU, logicapps: OU, virtualmachine: IU, bigtable: DU, bigquery: kU, cloudcdn: PU, clouddns: FU, cloudinterconnect: UU, cloudloadbalancing: ZU, cloudsql: BU, cloudstorage: GU, datalab: zU, dataproc: HU, googleiam: YU, googlesecurity: VU, googlevpc: qU, pubsub: WU, securityscanner: $U, stackdriver: KU, visionapi: QU, client: jU, server: XU, browser: JU, service: eZ, controller: tZ, api: nZ, ui: iZ, mobile: rZ, externalsystem: aZ, application: sZ, loadbalancer: oZ, network: lZ, cache: cZ, webserver: uZ, messagequeue: dZ, scheduler: LZ, gateway: CZ, authenticationservice: _Z, mailserver: gZ, github: pZ, docker: mZ, gitlab: hZ, jenkins: fZ, postgresql: EZ, mongodb: SZ, kubernetes: TZ, apachekafka: vZ, elasticsearch: RZ, auth0: bZ, redis: xZ }, I8 = (n) => { const e = (t) => t ? rc[t.toLowerCase()] : null; return /* @__PURE__ */ S.jsx( "ul", { role: "list", className: "mt-3 grid grid-cols-4 gap-5 sm:gap-6 sm:grid-cols-6 lg:grid-cols-8", children: n.types.map((t) => /* @__PURE__ */ S.jsxs( "li", { className: "col-span-1 flex flex-col shadow-sm rounded-md", children: [ /* @__PURE__ */ S.jsx("div", { className: "h-12 flex items-center justify-center bg-gray-50 text-sm font-medium rounded-t-md", children: /* @__PURE__ */ S.jsx( "i", { dangerouslySetInnerHTML: { __html: e(t) || "" }, className: "object-contain h-8 w-8 m-auto [&>svg]:w-full [&>svg]:h-full" } ) }), /* @__PURE__ */ S.jsx("div", { className: "flex items-center justify-center border-t border-r border-b border-gray-200 bg-white rounded-b-md", children: /* @__PURE__ */ S.jsx("div", { className: "px-2 py-2 text-xs", children: /* @__PURE__ */ S.jsxs("span", { className: "text-gray-900 font-medium hover:text-gray-600", children: [ "@", t ] }) }) }) ] }, t )) } ); }, wZ = ["Actor", "Boundary", "Control", "Database", "Entity"], MZ = [ "CloudWatch", "CloudFront", "Cognito", "DynamoDB", "EBS", "EC2", "ECS", "EFS", "ElastiCache", "ElasticBeantalk", "ElasticFileSystem", "Glacier", "IAM", "Kinesis", "Lambda", "LightSail", "RDS", "Redshift", "S3", "SNS", "SQS", "Sagemaker", "VPC" ], AZ = [ "AzureActiveDirectory", "AzureBackup", "AzureCDN", "AzureDataFactory", "AzureDevOps", "AzureFunction", "AzureSQL", "CosmosDB", "LogicApps", "VirtualMachine" ], yZ = [ "BigTable", "BigQuery", "CloudCDN", "CloudDNS", "CloudInterconnect", "CloudLoadBalancing", "CloudSQL", "CloudStorage", "DataLab", "DataProc", "GoogleIAM", "GoogleSecurity", "GoogleVPC", "PubSub", "SecurityScanner", "StackDriver", "VisionAPI" ], NZ = `// Define a Starter (optional) @Starter(A) // Show icons @EC2 A // Use 'group' keyword group GroupName { B C } // Use alias S as Service // Use stereotype <<servlet>> ServiceX`, OZ = `A.method() ==divider name== B.method() `, IZ = `// Alt (AKA if/else) if(condition1) {} else if (condition2) {} else {} // \`loop\`, \`for\`, \`forEach\`, \`while\` // are treated the same forEach(records) {} // Opt opt {} // Par par {} // Section section(ID) {} / frame(ID) {}; // Critical critical {} // Try Catch Finally try {} catch() {} finally {} `, DZ = ` //Creation new ParticipantName() //Sync Message A.method A->B.method //Async Message A->B: async message //Reply Message, three styles x = A.method A.method() { return x } A.method() { @return A->B: message }`, kZ = () => { const n = b0(BS), e = () => { n(!1); }; return /* @__PURE__ */ S.jsxs("div", { className: "flex items-end justify-center min-h-screen pt-4 px-4 pb-20 text-center sm:block", children: [ /* @__PURE__ */ S.jsx( "div", { className: "fixed inset-0 bg-gray-500 bg-opacity-75 transition-opacity", "aria-hidden": "true" } ), /* @__PURE__ */ S.jsx( "span", { className: "hidden sm:inline-block sm:align-middle sm:h-screen", "aria-hidden": "true", children: "" } ), /* @__PURE__ */ S.jsx("div", { className: "z-40 inline-block align-bottom bg-white rounded-lg px-4 pb-4 text-left overflow-hidden shadow-xl transform transition-all sm:my-8 sm:align-middle sm:p-2", children: /* @__PURE__ */ S.jsxs("div", { children: [ /* @__PURE__ */ S.jsxs("div", { className: "bg-white px-4 py-5 border-b border-gray-200 sm:px-6", children: [ /* @__PURE__ */ S.jsx("h3", { className: "text-xl leading-6 font-medium text-gray-900 inline-block", children: "ZenUML Tips" }), /* @__PURE__ */ S.jsxs( "button", { type: "button", onClick: e, className: "float-right bg-white rounded-md inline-flex items-center justify-center text-gray-400 hover:text-gray-500 hover:bg-gray-100 focus:outline-none focus:ring-2 focus:ring-inset focus:ring-indigo-500", children: [ /* @__PURE__ */ S.jsx("span", { className: "sr-only", children: "Close menu" }), /* @__PURE__ */ S.jsx(fe, { name: "close", className: "h-6 w-6 outline-none" }) ] } ) ] }), /* @__PURE__ */ S.jsx("div", { children: /* @__PURE__ */ S.jsx("div", { className: "relative bg-white pb-32 mt-4 overflow-hidden", children: /* @__PURE__ */ S.jsx("div", { className: "relative", children: /* @__PURE__ */ S.jsxs("div", { className: "lg:mx-auto lg:max-w-11/12 lg:px-8", children: [ /* @__PURE__ */ S.jsxs("div", { className: "grid lg:grid-cols-3 sm:grid-cols-2 grid-cols-1", children: [ /* @__PURE__ */ S.jsxs("div", { children: [ /* @__PURE__ */ S.jsxs("div", { className: "px-4 max-w-full mx-auto sm:px-6 lg:max-w-none lg:mx-0", children: [ /* @__PURE__ */ S.jsx("h2", { className: "mt-4 mb-4 text-lg leading-6 font-medium text-gray-900", children: "Declare Participants" }), /* @__PURE__ */ S.jsx("pre", { className: "text-xs w-full bg-gray-50 text-gray-600 p-2 rounded-lg", children: /* @__PURE__ */ S.jsx("code", { children: NZ }) }) ] }), /* @__PURE__ */ S.jsxs("div", { className: "px-4 max-w-7xl mx-auto sm:px-6 lg:max-w-none lg:mx-0", children: [ /* @__PURE__ */ S.jsx("h2", { className: "mt-4 mb-4 text-lg leading-6 font-medium text-gray-900", children: "Divider" }), /* @__PURE__ */ S.jsx("pre", { className: "text-xs w-full bg-gray-50 text-gray-600 p-2 rounded-lg", children: /* @__PURE__ */ S.jsx("code", { children: OZ }) }) ] }) ] }), /* @__PURE__ */ S.jsxs("div", { className: "px-4 w-full mx-auto lg:max-w-none lg:mx-0", children: [ /* @__PURE__ */ S.jsx("h2", { className: "mt-4 mb-4 text-lg leading-6 font-medium text-gray-900", children: "Fragments" }), /* @__PURE__ */ S.jsx("pre", { className: "text-xs w-full bg-gray-50 text-gray-600 p-2 rounded-lg", children: /* @__PURE__ */ S.jsx("code", { children: IZ }) }) ] }), /* @__PURE__ */ S.jsxs("div", { className: "px-4 w-full mx-auto lg:max-w-none lg:mx-0", children: [ /* @__PURE__ */ S.jsx("h2", { className: "mt-4 mb-4 text-lg leading-6 font-medium text-gray-900", children: "Messages" }), /* @__PURE__ */ S.jsx("pre", { className: "text-xs w-full bg-gray-50 text-gray-600 p-2 rounded-lg", children: /* @__PURE__ */ S.jsx("code", { children: DZ }) }) ] }) ] }), /* @__PURE__ */ S.jsxs("div", { className: "px-4 max-w-7xl mx-auto sm:px-6 lg:max-w-none lg:mx-0", children: [ /* @__PURE__ */ S.jsx("h2", { className: "mt-8 mb-4 text-lg leading-6 font-medium text-gray-900", children: "Builtin Icons" }), /* @__PURE__ */ S.jsxs("p", { className: "text-sm text-gray-500", children: [ "Use", /* @__PURE__ */ S.jsx("span", { className: "rounded inline-block bg-gray-50 text-gray-600", children: /* @__PURE__ */ S.jsx("code", { className: "text-xs", children: "@Actor TheParticipant" }) }), "to define the type of the participant." ] }), /* @__PURE__ */ S.jsx(I8, { types: wZ }), /* @__PURE__ */ S.jsx("hr", { className: "mt-4" }), /* @__PURE__ */ S.jsx(I8, { types: MZ }), /* @__PURE__ */ S.jsx("hr", { className: "mt-4" }), /* @__PURE__ */ S.jsx(I8, { types: AZ }), /* @__PURE__ */ S.jsx("hr", { className: "mt-4" }), /* @__PURE__ */ S.jsx(I8, { types: yZ }) ] }) ] }) }) }) }) ] }) }) ] }); }, dT = typeof document < "u" ? N2.useLayoutEffect : () => { }; var Zr; const PZ = (Zr = N2.useInsertionEffect) !== null && Zr !== void 0 ? Zr : dT; function FZ(n) { const e = b.useRef(null); return PZ(() => { e.current = n; }, [ n ]), b.useCallback((...t) => { const i = e.current; return i == null ? void 0 : i(...t); }, []); } const Qt = (n) => { var e; return (e = n == null ? void 0 : n.ownerDocument) !== null && e !== void 0 ? e : document; }, S9 = (n) => n && "window" in n && n.window === n ? n : Qt(n).defaultView || window; function UZ(n) { return n !== null && typeof n == "object" && "nodeType" in n && typeof n.nodeType == "number"; } function ZZ(n) { return UZ(n) && n.nodeType === Node.DOCUMENT_FRAGMENT_NODE && "host" in n; } let BZ = !1; function Gu() { return BZ; } function LT(n, e) { if (!Gu()) return e && n ? n.contains(e) : !1; if (!n || !e) return !1; let t = e; for (; t !== null; ) { if (t === n) return !0; t.tagName === "SLOT" && t.assignedSlot ? t = t.assignedSlot.parentNode : ZZ(t) ? t = t.host : t = t.parentNode; } return !1; } const ac = (n = document) => { var e; if (!Gu()) return n.activeElement; let t = n.activeElement; for (; t && "shadowRoot" in t && (!((e = t.shadowRoot) === null || e === void 0) && e.activeElement); ) t = t.shadowRoot.activeElement; return t; }; function CT(n) { return Gu() && n.target.shadowRoot && n.composedPath ? n.composedPath()[0] : n.target; } function GZ(n) { var e; if (typeof window > "u" || window.navigator == null) return !1; let t = (e = window.navigator.userAgentData) === null || e === void 0 ? void 0 : e.brands; return Array.isArray(t) && t.some((i) => n.test(i.brand)) || n.test(window.navigator.userAgent); } function zZ(n) { var e; return typeof window < "u" && window.navigator != null ? n.test(((e = window.navigator.userAgentData) === null || e === void 0 ? void 0 : e.platform) || window.navigator.platform) : !1; } function _T(n) { let e = null; return () => (e == null && (e = n()), e); } const HZ = _T(function() { return zZ(/^Mac/i); }), YZ = _T(function() { return GZ(/Android/i); }); function gT() { let n = b.useRef(/* @__PURE__ */ new Map()), e = b.useCallback((s, l, c, d) => { let L = d != null && d.once ? (..._) => { n.current.delete(c), c(..._); } : c; n.current.set(c, { type: l, eventTarget: s, fn: L, options: d }), s.addEventListener(l, L, d); }, []), t = b.useCallback((s, l, c, d) => { var L; let _ = ((L = n.current.get(c)) === null || L === void 0 ? void 0 : L.fn) || c; s.removeEventListener(l, _, d), n.current.delete(c); }, []), i = b.useCallback(() => { n.current.forEach((s, l) => { t(s.eventTarget, s.type, l, s.options); }); }, [ t ]); return b.useEffect(() => i, [ i ]), { addGlobalListener: e, removeGlobalListener: t, removeAllGlobalListeners: i }; } function VZ(n) { return n.pointerType === "" && n.isTrusted ? !0 : YZ() && n.pointerType ? n.type === "click" && n.buttons === 1 : n.detail === 0 && !n.pointerType; } var Br = { exports: {} }, Pe = {}; /** * @license React * react-dom.production.js * * Copyright (c) Meta Platforms, Inc. and affiliates. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. */ var $g; function qZ() { if ($g) return Pe; $g = 1; var n = f6(); function e(L) { var _ = "https://react.dev/errors/" + L; if (1 < arguments.length) { _ += "?args[]=" + encodeURIComponent(arguments[1]); for (var p = 2; p < arguments.length; p++) _ += "&args[]=" + encodeURIComponent(arguments[p]); } return "Minified React error #" + L + "; visit " + _ + " for the full message or use the non-minified dev environment for full errors and additional helpful warnings."; } function t() { } var i = { d: { f: t, r: function() { throw Error(e(522)); }, D: t, C: t, L: t, m: t, X: t, S: t, M: t }, p: 0, findDOMNode: null }, s = Symbol.for("react.portal"); function l(L, _, p) { var m = 3 < arguments.length && arguments[3] !== void 0 ? arguments[3] : null; return { $$typeof: s, key: m == null ? null : "" + m, children: L, containerInfo: _, implementation: p }; } var c = n.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE; function d(L, _) { if (L === "font") return ""; if (typeof _ == "string") return _ === "use-credentials" ? _ : ""; } return Pe.__DOM_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE = i, Pe.createPortal = function(L, _) { var p = 2 < arguments.length && arguments[2] !== void 0 ? arguments[2] : null; if (!_ || _.nodeType !== 1 && _.nodeType !== 9 && _.nodeType !== 11) throw Error(e(299)); return l(L, _, null, p); }, Pe.flushSync = function(L) { var _ = c.T, p = i.p; try { if (c.T = null, i.p = 2, L) return L(); } finally { c.T = _, i.p = p, i.d.f(); } }, Pe.preconnect = function(L, _) { typeof L == "string" && (_ ? (_ = _.crossOrigin, _ = typeof _ == "string" ? _ === "use-credentials" ? _ : "" : void 0) : _ = null, i.d.C(L, _)); }, Pe.prefetchDNS = function(L) { typeof L == "string" && i.d.D(L); }, Pe.preinit = function(L, _) { if (typeof L == "string" && _ && typeof _.as == "string") { var p = _.as, m = d(p, _.crossOrigin), f = typeof _.integrity == "string" ? _.integrity : void 0, h = typeof _.fetchPriority == "string" ? _.fetchPriority : void 0; p === "style" ? i.d.S( L, typeof _.precedence == "string" ? _.precedence : void 0, { crossOrigin: m, integrity: f, fetchPriority: h } ) : p === "script" && i.d.X(L, { crossOrigin: m, integrity: f, fetchPriority: h, nonce: typeof _.nonce == "string" ? _.nonce : void 0 }); } }, Pe.preinitModule = function(L, _) { if (typeof L == "string") if (typeof _ == "object" && _ !== null) { if (_.as == null || _.as === "script") { var p = d( _.as, _.crossOrigin ); i.d.M(L, { crossOrigin: p, integrity: typeof _.integrity == "string" ? _.integrity : void 0, nonce: typeof _.nonce == "string" ? _.nonce : void 0 }); } } else _ == null && i.d.M(L); }, Pe.preload = function(L, _) { if (typeof L == "string" && typeof _ == "object" && _ !== null && typeof _.as == "string") { var p = _.as, m = d(p, _.crossOrigin); i.d.L(L, p, { crossOrigin: m, integrity: typeof _.integrity == "string" ? _.integrity : void 0, nonce: typeof _.nonce == "string" ? _.nonce : void 0, type: typeof _.type == "string" ? _.type : void 0, fetchPriority: typeof _.fetchPriority == "string" ? _.fetchPriority : void 0, referrerPolicy: typeof _.referrerPolicy == "string" ? _.referrerPolicy : void 0, imageSrcSet: typeof _.imageSrcSet == "string" ? _.imageSrcSet : void 0, imageSizes: typeof _.imageSizes == "string" ? _.imageSizes : void 0, media: typeof _.media == "string" ? _.media : void 0 }); } }, Pe.preloadModule = function(L, _) { if (typeof L == "string") if (_) { var p = d(_.as, _.crossOrigin); i.d.m(L, { as: typeof _.as == "string" && _.as !== "script" ? _.as : void 0, crossOrigin: p, integrity: typeof _.integrity == "string" ? _.integrity : void 0 }); } else i.d.m(L); }, Pe.requestFormReset = function(L) { i.d.r(L); }, Pe.unstable_batchedUpdates = function(L, _) { return L(_); }, Pe.useFormState = function(L, _, p) { return c.H.useFormState(L, _, p); }, Pe.useFormStatus = function() { return c.H.useHostTransitionStatus(); }, Pe.version = "19.1.1", Pe; } var Kg; function pT() { if (Kg) return Br.exports; Kg = 1; function n() { if (!(typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ > "u" || typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.checkDCE != "function")) try { __REACT_DEVTOOLS_GLOBAL_HOOK__.checkDCE(n); } catch (e) { console.error(e); } } return n(), Br.exports = qZ(), Br.exports; } var zu = pT(); function mT(n) { let e = n; return e.nativeEvent = n, e.isDefaultPrevented = () => e.defaultPrevented, e.isPropagationStopped = () => e.cancelBubble, e.persist = () => { }, e; } function WZ(n, e) { Object.defineProperty(n, "target", { value: e }), Object.defineProperty(n, "currentTarget", { value: e }); } function hT(n) { let e = b.useRef({ isFocused: !1, observer: null }); dT(() => { const i = e.current; return () => { i.observer && (i.observer.disconnect(), i.observer = null); }; }, []); let t = FZ((i) => { n == null || n(i); }); return b.useCallback((i) => { if (i.target instanceof HTMLButtonElement || i.target instanceof HTMLInputElement || i.target instanceof HTMLTextAreaElement || i.target instanceof HTMLSelectElement) { e.current.isFocused = !0; let s = i.target, l = (c) => { if (e.current.isFocused = !1, s.disabled) { let d = mT(c); t(d); } e.current.observer && (e.current.observer.disconnect(), e.current.observer = null); }; s.addEventListener("focusout", l, { once: !0 }), e.current.observer = new MutationObserver(() => { if (e.current.isFocused && s.disabled) { var c; (c = e.current.observer) === null || c === void 0 || c.disconnect(); let d = s === document.activeElement ? null : document.activeElement; s.dispatchEvent(new FocusEvent("blur", { relatedTarget: d })), s.dispatchEvent(new FocusEvent("focusout", { bubbles: !0, relatedTarget: d })); } }), e.current.observer.observe(s, { attributes: !0, attributeFilter: [ "disabled" ] }); } }, [ t ]); } let $Z = !1, gn = null, sc = /* @__PURE__ */ new Set(), q5 = /* @__PURE__ */ new Map(), w9 = !1, oc = !1; const KZ = { Tab: !0, Escape: !0 }; function Hu(n, e) { for (let t of sc) t(n, e); } function QZ(n) { return !(n.metaKey || !HZ() && n.altKey || n.ctrlKey || n.key === "Control" || n.key === "Shift" || n.key === "Meta"); } function u6(n) { w9 = !0, QZ(n) && (gn = "keyboard", Hu("keyboard", n)); } function p0(n) { gn = "pointer", (n.type === "mousedown" || n.type === "pointerdown") && (w9 = !0, Hu("pointer", n)); } function fT(n) { VZ(n) && (w9 = !0, gn = "virtual"); } function ET(n) { n.target === window || n.target === document || $Z || !n.isTrusted || (!w9 && !oc && (gn = "virtual", Hu("virtual", n)), w9 = !1, oc = !1); } function ST() { w9 = !1, oc = !0; } function lc(n) { if (typeof window > "u" || typeof document > "u" || q5.get(S9(n))) return; const e = S9(n), t = Qt(n); let i = e.HTMLElement.prototype.focus; e.HTMLElement.prototype.focus = function() { w9 = !0, i.apply(this, arguments); }, t.addEventListener("keydown", u6, !0), t.addEventListener("keyup", u6, !0), t.addEventListener("click", fT, !0), e.addEventListener("focus", ET, !0), e.addEventListener("blur", ST, !1), typeof PointerEvent < "u" && (t.addEventListener("pointerdown", p0, !0), t.addEventListener("pointermove", p0, !0), t.addEventListener("pointerup", p0, !0)), e.addEventListener("beforeunload", () => { TT(n); }, { once: !0 }), q5.set(e, { focus: i }); } const TT = (n, e) => { const t = S9(n), i = Qt(n); e && i.removeEventListener("DOMContentLoaded", e), q5.has(t) && (t.HTMLElement.prototype.focus = q5.get(t).focus, i.removeEventListener("keydown", u6, !0), i.removeEventListener("keyup", u6, !0), i.removeEventListener("click", fT, !0), t.removeEventListener("focus", ET, !0), t.removeEventListener("blur", ST, !1), typeof PointerEvent < "u" && (i.removeEventListener("pointerdown", p0, !0), i.removeEventListener("pointermove", p0, !0), i.removeEventListener("pointerup", p0, !0)), q5.delete(t)); }; function jZ(n) { const e = Qt(n); let t; return e.readyState !== "loading" ? lc(n) : (t = () => { lc(n); }, e.addEventListener("DOMContentLoaded", t)), () => TT(n, t); } typeof document < "u" && jZ(); function vT() { return gn !== "pointer"; } const XZ = /* @__PURE__ */ new Set([ "checkbox", "radio", "range", "color", "file", "image", "button", "submit", "reset" ]); function JZ(n, e, t) { let i = Qt(t == null ? void 0 : t.target); const s = typeof window < "u" ? S9(t == null ? void 0 : t.target).HTMLInputElement : HTMLInputElement, l = typeof window < "u" ? S9(t == null ? void 0 : t.target).HTMLTextAreaElement : HTMLTextAreaElement, c = typeof window < "u" ? S9(t == null ? void 0 : t.target).HTMLElement : HTMLElement, d = typeof window < "u" ? S9(t == null ? void 0 : t.target).KeyboardEvent : KeyboardEvent; return n = n || i.activeElement instanceof s && !XZ.has(i.activeElement.type) || i.activeElement instanceof l || i.activeElement instanceof c && i.activeElement.isContentEditable, !(n && e === "keyboard" && t instanceof d && !KZ[t.key]); } function eB(n, e, t) { lc(), b.useEffect(() => { let i = (s, l) => { JZ(!!(t != null && t.isTextInput), s, l) && n(vT()); }; return sc.add(i), () => { sc.delete(i); }; }, e); } function tB(n) { let { isDisabled: e, onFocus: t, onBlur: i, onFocusChange: s } = n; const l = b.useCallback((L) => { if (L.target === L.currentTarget) return i && i(L), s && s(!1), !0; }, [ i, s ]), c = hT(l), d = b.useCallback((L) => { const _ = Qt(L.target), p = _ ? ac(_) : ac(); L.target === L.currentTarget && p === CT(L.nativeEvent) && (t && t(L), s && s(!0), c(L)); }, [ s, t, c ]); return { focusProps: { onFocus: !e && (t || s || i) ? d : void 0, onBlur: !e && (i || s) ? l : void 0 } }; } function nB(n) { let { isDisabled: e, onBlurWithin: t, onFocusWithin: i, onFocusWithinChange: s } = n, l = b.useRef({ isFocusWithin: !1 }), { addGlobalListener: c, removeAllGlobalListeners: d } = gT(), L = b.useCallback((m) => { m.currentTarget.contains(m.target) && l.current.isFocusWithin && !m.currentTarget.contains(m.relatedTarget) && (l.current.isFocusWithin = !1, d(), t && t(m), s && s(!1)); }, [ t, s, l, d ]), _ = hT(L), p = b.useCallback((m) => { if (!m.currentTarget.contains(m.target)) return; const f = Qt(m.target), h = ac(f); if (!l.current.isFocusWithin && h === CT(m.nativeEvent)) { i && i(m), s && s(!0), l.current.isFocusWithin = !0, _(m); let v = m.currentTarget; c(f, "focus", (R) => { if (l.current.isFocusWithin && !LT(v, R.target)) { let w = new f.defaultView.FocusEvent("blur", { relatedTarget: R.target }); WZ(w, v); let M = mT(w); L(M); } }, { capture: !0 }); } }, [ i, s, _, c, L ]); return e ? { focusWithinProps: { // These cannot be null, that would conflict in mergeProps onFocus: void 0, onBlur: void 0 } } : { focusWithinProps: { onFocus: p, onBlur: L } }; } let cc = !1, D8 = 0; function iB() { cc = !0, setTimeout(() => { cc = !1; }, 50); } function Qg(n) { n.pointerType === "touch" && iB(); } function rB() { if (!(typeof document > "u")) return D8 === 0 && typeof PointerEvent < "u" && document.addEventListener("pointerup", Qg), D8++, () => { D8--, !(D8 > 0) && typeof PointerEvent < "u" && document.removeEventListener("pointerup", Qg); }; } function RT(n) { let { onHoverStart: e, onHoverChange: t, onHoverEnd: i, isDisabled: s } = n, [l, c] = b.useState(!1), d = b.useRef({ isHovered: !1, ignoreEmulatedMouseEvents: !1, pointerType: "", target: null }).current; b.useEffect(rB, []); let { addGlobalListener: L, removeAllGlobalListeners: _ } = gT(), { hoverProps: p, triggerHoverEnd: m } = b.useMemo(() => { let f = (R, w) => { if (d.pointerType = w, s || w === "touch" || d.isHovered || !R.currentTarget.contains(R.target)) return; d.isHovered = !0; let M = R.currentTarget; d.target = M, L(Qt(R.target), "pointerover", (N) => { d.isHovered && d.target && !LT(d.target, N.target) && h(N, N.pointerType); }, { capture: !0 }), e && e({ type: "hoverstart", target: M, pointerType: w }), t && t(!0), c(!0); }, h = (R, w) => { let M = d.target; d.pointerType = "", d.target = null, !(w === "touch" || !d.isHovered || !M) && (d.isHovered = !1, _(), i && i({ type: "hoverend", target: M, pointerType: w }), t && t(!1), c(!1)); }, v = {}; return typeof PointerEvent < "u" && (v.onPointerEnter = (R) => { cc && R.pointerType === "mouse" || f(R, R.pointerType); }, v.onPointerLeave = (R) => { !s && R.currentTarget.contains(R.target) && h(R, R.pointerType); }), { hoverProps: v, triggerHoverEnd: h }; }, [ e, t, i, s, d, L, _ ]); return b.useEffect(() => { s && m({ currentTarget: d.target }, d.pointerType); }, [ s ]), { hoverProps: p, isHovered: l }; } function bT(n = {}) { let { autoFocus: e = !1, isTextInput: t, within: i } = n, s = b.useRef({ isFocused: !1, isFocusVisible: e || vT() }), [l, c] = b.useState(!1), [d, L] = b.useState(() => s.current.isFocused && s.current.isFocusVisible), _ = b.useCallback(() => L(s.current.isFocused && s.current.isFocusVisible), []), p = b.useCallback((h) => { s.current.isFocused = h, c(h), _(); }, [ _ ]); eB((h) => { s.current.isFocusVisible = h, _(); }, [], { isTextInput: t }); let { focusProps: m } = tB({ isDisabled: i, onFocusChange: p }), { focusWithinProps: f } = nB({ isDisabled: !i, onFocusWithinChange: p }); return { isFocused: l, isFocusVisible: d, focusProps: i ? f : m }; } var aB = Object.defineProperty, sB = (n, e, t) => e in n ? aB(n, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : n[e] = t, Gr = (n, e, t) => (sB(n, typeof e != "symbol" ? e + "" : e, t), t); let oB = class { constructor() { Gr(this, "current", this.detect()), Gr(this, "handoffState", "pending"), Gr(this, "currentId", 0); } set(e) { this.current !== e && (this.handoffState = "pending", this.currentId = 0, this.current = e); } reset() { this.set(this.detect()); } nextId() { return ++this.currentId; } get isServer() { return this.current === "server"; } get isClient() { return this.current === "client"; } detect() { return typeof window > "u" || typeof document > "u" ? "server" : "client"; } handoff() { this.handoffState === "pending" && (this.handoffState = "complete"); } get isHandoffComplete() { return this.handoffState === "complete"; } }, A4 = new oB(); function pn(n) { var e, t; return A4.isServer ? null : n ? "ownerDocument" in n ? n.ownerDocument : "current" in n ? (t = (e = n.current) == null ? void 0 : e.ownerDocument) != null ? t : document : null : document; } function G6(n) { typeof queueMicrotask == "function" ? queueMicrotask(n) : Promise.resolve().then(n).catch((e) => setTimeout(() => { throw e; })); } function st() { let n = [], e = { addEventListener(t, i, s, l) { return t.addEventListener(i, s, l), e.add(() => t.removeEventListener(i, s, l)); }, requestAnimationFrame(...t) { let i = requestAnimationFrame(...t); return e.add(() => cancelAnimationFrame(i)); }, nextFrame(...t) { return e.requestAnimationFrame(() => e.requestAnimationFrame(...t)); }, setTimeout(...t) { let i = setTimeout(...t); return e.add(() => clearTimeout(i)); }, microTask(...t) { let i = { current: !0 }; return G6(() => { i.current && t[0](); }), e.add(() => { i.current = !1; }); }, style(t, i, s) { let l = t.style.getPropertyValue(i); return Object.assign(t.style, { [i]: s }), this.add(() => { Object.assign(t.style, { [i]: l }); }); }, group(t) { let i = st(); return t(i), this.add(() => i.dispose()); }, add(t) { return n.includes(t) || n.push(t), () => { let i = n.indexOf(t); if (i >= 0) for (let s of n.splice(i, 1)) s(); }; }, dispose() { for (let t of n.splice(0)) t(); } }; return e; } function z6() { let [n] = b.useState(st); return b.useEffect(() => () => n.dispose(), [n]), n; } let Ee = (n, e) => { A4.isServer ? b.useEffect(n, e) : b.useLayoutEffect(n, e); }; function ot(n) { let e = b.useRef(n); return Ee(() => { e.current = n; }, [n]), e; } let C1 = function(n) { let e = ot(n); return N2.useCallback((...t) => e.current(...t), [e]); }, lB = b.createContext(void 0); function H6() { return b.useContext(lB); } function uc(...n) { return Array.from(new Set(n.flatMap((e) => typeof e == "string" ? e.split(" ") : []))).filter(Boolean).join(" "); } function O4(n, e, ...t) { if (n in e) { let s = e[n]; return typeof s == "function" ? s(...t) : s; } let i = new Error(`Tried to handle "${n}" but there is no handler defined. Only defined handlers are: ${Object.keys(e).map((s) => `"${s}"`).join(", ")}.`); throw Error.captureStackTrace && Error.captureStackTrace(i, O4), i; } var d6 = ((n) => (n[n.None = 0] = "None", n[n.RenderStrategy = 1] = "RenderStrategy", n[n.Static = 2] = "Static", n))(d6 || {}), zt = ((n) => (n[n.Unmount = 0] = "Unmount", n[n.Hidden = 1] = "Hidden", n))(zt || {}); function ze() { let n = uB(); return b.useCallback((e) => cB({ mergeRefs: n, ...e }), [n]); } function cB({ ourProps: n, theirProps: e, slot: t, defaultTag: i, features: s, visible: l = !0, name: c, mergeRefs: d }) { d = d ?? dB; let L = xT(e, n); if (l) return k8(L, t, i, c, d); let _ = s ?? 0; if (_ & 2) { let { static: p = !1, ...m } = L; if (p) return k8(m, t, i, c, d); } if (_ & 1) { let { unmount: p = !0, ...m } = L; return O4(p ? 0 : 1, { 0() { return null; }, 1() { return k8({ ...m, hidden: !0, style: { display: "none" } }, t, i, c, d); } }); } return k8(L, t, i, c, d); } function k8(n, e = {}, t, i, s) { let { as: l = t, children: c, refName: d = "ref", ...L } = zr(n, ["unmount", "static"]), _ = n.ref !== void 0 ? { [d]: n.ref } : {}, p = typeof c == "function" ? c(e) : c; "className" in L && L.className && typeof L.className == "function" && (L.className = L.className(e)), L["aria-labelledby"] && L["aria-labelledby"] === L.id && (L["aria-labelledby"] = void 0); let m = {}; if (e) { let f = !1, h = []; for (let [v, R] of Object.entries(e)) typeof R == "boolean" && (f = !0), R === !0 && h.push(v.replace(/([A-Z])/g, (w) => `-${w.toLowerCase()}`)); if (f) { m["data-headlessui-state"] = h.join(" "); for (let v of h) m[`data-${v}`] = ""; } } if (l === b.Fragment && (Object.keys(Ut(L)).length > 0 || Object.keys(Ut(m)).length > 0)) if (!b.isValidElement(p) || Array.isArray(p) && p.length > 1) { if (Object.keys(Ut(L)).length > 0) throw new Error(['Passing props on "Fragment"!', "", `The current component <${i} /> is rendering a "Fragment".`, "However we need to passthrough the following props:", Object.keys(Ut(L)).concat(Object.keys(Ut(m))).map((f) => ` - ${f}`).join(` `), "", "You can apply a few solutions:", ['Add an `as="..."` prop, to ensure that we render an actual element instead of a "Fragment".', "Render a single element as the child so that we can forward the props onto that element."].map((f) => ` - ${f}`).join(` `)].join(` `)); } else { let f = p.props, h = f == null ? void 0 : f.className, v = typeof h == "function" ? (...M) => uc(h(...M), L.className) : uc(h, L.className), R = v ? { className: v } : {}, w = xT(p.props, Ut(zr(L, ["ref"]))); for (let M in m) M in w && delete m[M]; return b.cloneElement(p, Object.assign({}, w, m, _, { ref: s(LB(p), _.ref) }, R)); } return b.createElement(l, Object.assign({}, zr(L, ["ref"]), l !== b.Fragment && _, l !== b.Fragment && m), p); } function uB() { let n = b.useRef([]), e = b.useCallback((t) => { for (let i of n.current) i != null && (typeof i == "function" ? i(t) : i.current = t); }, []); return (...t) => { if (!t.every((i) => i == null)) return n.current = t, e; }; } function dB(...n) { return n.every((e) => e == null) ? void 0 : (e) => { for (let t of n) t != null && (typeof t == "function" ? t(e) : t.current = e); }; } function xT(...n) { if (n.length === 0) return {}; if (n.length === 1) return n[0]; let e = {}, t = {}; for (let i of n) for (let s in i) s.startsWith("on") && typeof i[s] == "function" ? (t[s] != null || (t[s] = []), t[s].push(i[s])) : e[s] = i[s]; if (e.disabled || e["aria-disabled"]) for (let i in t) /^(on(?:Click|Pointer|Mouse|Key)(?:Down|Up|Press)?)$/.test(i) && (t[i] = [(s) => { var l; return (l = s == null ? void 0 : s.preventDefault) == null ? void 0 : l.call(s); }]); for (let i in t) Object.assign(e, { [i](s, ...l) { let c = t[i]; for (let d of c) { if ((s instanceof Event || (s == null ? void 0 : s.nativeEvent) instanceof Event) && s.defaultPrevented) return; d(s, ...l); } } }); return e; } function wT(...n) { if (n.length === 0) return {}; if (n.length === 1) return n[0]; let e = {}, t = {}; for (let i of n) for (let s in i) s.startsWith("on") && typeof i[s] == "function" ? (t[s] != null || (t[s] = []), t[s].push(i[s])) : e[s] = i[s]; for (let i in t) Object.assign(e, { [i](...s) { let l = t[i]; for (let c of l) c == null || c(...s); } }); return e; } function be(n) { var e; return Object.assign(b.forwardRef(n), { displayName: (e = n.displayName) != null ? e : n.name }); } function Ut(n) { let e = Object.assign({}, n); for (let t in e) e[t] === void 0 && delete e[t]; return e; } function zr(n, e = []) { let t = Object.assign({}, n); for (let i of e) i in t && delete t[i]; return t; } function LB(n) { return N2.version.split(".")[0] >= "19" ? n.props.ref : n.ref; } function CB(n, e, t) { let [i, s] = b.useState(t), l = n !== void 0, c = b.useRef(l), d = b.useRef(!1), L = b.useRef(!1); return l && !c.current && !d.current ? (d.current = !0, c.current = l, console.error("A component is changing from uncontrolled to controlled. This may be caused by the value changing from undefined to a defined value, which should not happen.")) : !l && c.current && !L.current && (L.current = !0, c.current = l, console.error("A component is changing from controlled to uncontrolled. This may be caused by the value changing from a defined value to undefined, which should not happen.")), [l ? n : i, C1((_) => (l || s(_), e == null ? void 0 : e(_)))]; } function _B(n) { let [e] = b.useState(n); return e; } function MT(n = {}, e = null, t = []) { for (let [i, s] of Object.entries(n)) yT(t, AT(e, i), s); return t; } function AT(n, e) { return n ? n + "[" + e + "]" : e; } function yT(n, e, t) { if (Array.isArray(t)) for (let [i, s] of t.entries()) yT(n, AT(e, i.toString()), s); else t instanceof Date ? n.push([e, t.toISOString()]) : typeof t == "boolean" ? n.push([e, t ? "1" : "0"]) : typeof t == "string" ? n.push([e, t]) : typeof t == "number" ? n.push([e, `${t}`]) : t == null ? n.push([e, ""]) : MT(t, e, n); } function gB(n) { var e, t; let i = (e = n == null ? void 0 : n.form) != null ? e : n.closest("form"); if (i) { for (let s of i.elements) if (s !== n && (s.tagName === "INPUT" && s.type === "submit" || s.tagName === "BUTTON" && s.type === "submit" || s.nodeName === "INPUT" && s.type === "image")) { s.click(); return; } (t = i.requestSubmit) == null || t.call(i); } } let pB = "span"; var T0 = ((n) => (n[n.None = 1] = "None", n[n.Focusable = 2] = "Focusable", n[n.Hidden = 4] = "Hidden", n))(T0 || {}); function mB(n, e) { var t; let { features: i = 1, ...s } = n, l = { ref: e, "aria-hidden": (i & 2) === 2 ? !0 : (t = s["aria-hidden"]) != null ? t : void 0, hidden: (i & 4) === 4 ? !0 : void 0, style: { position: "fixed", top: 1, left: 1, width: 1, height: 0, padding: 0, margin: -1, overflow: "hidden", clip: "rect(0, 0, 0, 0)", whiteSpace: "nowrap", borderWidth: "0", ...(i & 4) === 4 && (i & 2) !== 2 && { display: "none" } } }; return ze()({ ourProps: l, theirProps: s, slot: {}, defaultTag: pB, name: "Hidden" }); } let en = be(mB), hB = b.createContext(null); function fB({ children: n }) { let e = b.useContext(hB); if (!e) return N2.createElement(N2.Fragment, null, n); let { target: t } = e; return t ? zu.createPortal(N2.createElement(N2.Fragment, null, n), t) : null; } function EB({ data: n, form: e, disabled: t, onReset: i, overrides: s }) { let [l, c] = b.useState(null), d = z6(); return b.useEffect(() => { if (i && l) return d.addEventListener(l, "reset", i); }, [l, e, i]), N2.createElement(fB, null, N2.createElement(SB, { setForm: c, formId: e }), MT(n).map(([L, _]) => N2.createElement(en, { features: T0.Hidden, ...Ut({ key: L, as: "input", type: "hidden", hidden: !0, readOnly: !0, form: e, disabled: t, name: L, value: _, ...s }) }))); } function SB({ setForm: n, formId: e }) { return b.useEffect(() => { if (e) { let t = document.getElementById(e); t && n(t); } }, [n, e]), e ? null : N2.createElement(en, { features: T0.Hidden, as: "input", type: "hidden", hidden: !0, readOnly: !0, ref: (t) => { if (!t) return; let i = t.closest("form"); i && n(i); } }); } let TB = b.createContext(void 0); function NT() { return b.useContext(TB); } function OT(n) { return typeof n != "object" || n === null ? !1 : "nodeType" in n; } function et(n) { return OT(n) && "tagName" in n; } function I4(n) { return et(n) && "accessKey" in n; } function Ht(n) { return et(n) && "tabIndex" in n; } function vB(n) { return et(n) && "style" in n; } function RB(n) { return I4(n) && n.nodeName === "IFRAME"; } function IT(n) { return I4(n) && n.nodeName === "INPUT"; } function jg(n) { return I4(n) && n.nodeName === "LABEL"; } function bB(n) { return I4(n) && n.nodeName === "FIELDSET"; } function DT(n) { return I4(n) && n.nodeName === "LEGEND"; } function xB(n) { return et(n) ? n.matches('a[href],audio[controls],button,details,embed,iframe,img[usemap],input:not([type="hidden"]),label,select,textarea,video[controls]') : !1; } function kT(n) { let e = n.parentElement, t = null; for (; e && !bB(e); ) DT(e) && (t = e), e = e.parentElement; let i = (e == null ? void 0 : e.getAttribute("disabled")) === ""; return i && wB(t) ? !1 : i; } function wB(n) { if (!n) return !1; let e = n.previousElementSibling; for (; e !== null; ) { if (DT(e)) return !1; e = e.previousElementSibling; } return !0; } let PT = Symbol(); function MB(n, e = !0) { return Object.assign(n, { [PT]: e }); } function p3(...n) { let e = b.useRef(n); b.useEffect(() => { e.current = n; }, [n]); let t = C1((i) => { for (let s of e.current) s != null && (typeof s == "function" ? s(i) : s.current = i); }); return n.every((i) => i == null || (i == null ? void 0 : i[PT])) ? void 0 : t; } let Y6 = b.createContext(null); Y6.displayName = "DescriptionContext"; function FT() { let n = b.useContext(Y6); if (n === null) { let e = new Error("You used a component, but it is not inside a relevant parent."); throw Error.captureStackTrace && Error.captureStackTrace(e, FT), e; } return n; } function AB() { var n, e; return (e = (n = b.useContext(Y6)) == null ? void 0 : n.value) != null ? e : void 0; } function Yu() { let [n, e] = b.useState([]); return [n.length > 0 ? n.join(" ") : void 0, b.useMemo(() => function(t) { let i = C1((l) => (e((c) => [...c, l]), () => e((c) => { let d = c.slice(), L = d.indexOf(l); return L !== -1 && d.splice(L, 1), d; }))), s = b.useMemo(() => ({ register: i, slot: t.slot, name: t.name, props: t.props, value: t.value }), [i, t.slot, t.name, t.props, t.value]); return N2.createElement(Y6.Provider, { value: s }, t.children); }, [e])]; } let yB = "p"; function NB(n, e) { let t = b.useId(), i = H6(), { id: s = `headlessui-description-${t}`, ...l } = n, c = FT(), d = p3(e); Ee(() => c.register(s), [s, c.register]); let L = i || !1, _ = b.useMemo(() => ({ ...c.slot, disabled: L }), [c.slot, L]), p = { ref: d, ...c.props, id: s }; return ze()({ ourProps: p, theirProps: l, slot: _, defaultTag: yB, name: c.name || "Description" }); } let OB = be(NB), UT = Object.assign(OB, {}); var Zt = ((n) => (n.Space = " ", n.Enter = "Enter", n.Escape = "Escape", n.Backspace = "Backspace", n.Delete = "Delete", n.ArrowLeft = "ArrowLeft", n.ArrowUp = "ArrowUp", n.ArrowRight = "ArrowRight", n.ArrowDown = "ArrowDown", n.Home = "Home", n.End = "End", n.PageUp = "PageUp", n.PageDown = "PageDown", n.Tab = "Tab", n))(Zt || {}); let V6 = b.createContext(null); V6.displayName = "LabelContext"; function ZT() { let n = b.useContext(V6); if (n === null) { let e = new Error("You used a component, but it is not inside a relevant parent."); throw Error.captureStackTrace && Error.captureStackTrace(e, ZT), e; } return n; } function BT(n) { var e, t, i; let s = (t = (e = b.useContext(V6)) == null ? void 0 : e.value) != null ? t : void 0; return ((i = void 0) != null ? i : 0) > 0 ? [s, ...n].filter(Boolean).join(" ") : s; } function GT({ inherit: n = !1 } = {}) { let e = BT(), [t, i] = b.useState([]), s = n ? [e, ...t].filter(Boolean) : t; return [s.length > 0 ? s.join(" ") : void 0, b.useMemo(() => function(l) { let c = C1((L) => (i((_) => [..._, L]), () => i((_) => { let p = _.slice(), m = p.indexOf(L); return m !== -1 && p.splice(m, 1), p; }))), d = b.useMemo(() => ({ register: c, slot: l.slot, name: l.name, props: l.props, value: l.value }), [c, l.slot, l.name, l.props, l.value]); return N2.createElement(V6.Provider, { value: d }, l.children); }, [i])]; } let IB = "label"; function DB(n, e) { var t; let i = b.useId(), s = ZT(), l = NT(), c = H6(), { id: d = `headlessui-label-${i}`, htmlFor: L = l ?? ((t = s.props) == null ? void 0 : t.htmlFor), passive: _ = !1, ...p } = n, m = p3(e); Ee(() => s.register(d), [d, s.register]); let f = C1((w) => { let M = w.currentTarget; if (!(w.target !== w.currentTarget && xB(w.target)) && (jg(M) && w.preventDefault(), s.props && "onClick" in s.props && typeof s.props.onClick == "function" && s.props.onClick(w), jg(M))) { let N = document.getElementById(M.htmlFor); if (N) { let D = N.getAttribute("disabled"); if (D === "true" || D === "") return; let A = N.getAttribute("aria-disabled"); if (A === "true" || A === "") return; (IT(N) && (N.type === "file" || N.type === "radio" || N.type === "checkbox") || N.role === "radio" || N.role === "checkbox" || N.role === "switch") && N.click(), N.focus({ preventScroll: !0 }); } } }), h = c || !1, v = b.useMemo(() => ({ ...s.slot, disabled: h }), [s.slot, h]), R = { ref: m, ...s.props, id: d, htmlFor: L, onClick: f }; return _ && ("onClick" in R && (delete R.htmlFor, delete R.onClick), "onClick" in p && delete p.onClick), ze()({ ourProps: R, theirProps: p, slot: v, defaultTag: L ? IB : "div", name: s.name || "Label" }); } let kB = be(DB), dc = Object.assign(kB, {}), PB = b.createContext(() => { }); function FB({ value: n, children: e }) { return N2.createElement(PB.Provider, { value: n }, e); } function UB(n, e) { return n !== null && e !== null && typeof n == "object" && typeof e == "object" && "id" in n && "id" in e ? n.id === e.id : n === e; } function ZB(n = UB) { return b.useCallback((e, t) => { if (typeof n == "string") { let i = n; return (e == null ? void 0 : e[i]) === (t == null ? void 0 : t[i]); } return n(e, t); }, [n]); } let zT = class extends Map { constructor(e) { super(), this.factory = e; } get(e) { let t = super.get(e); return t === void 0 && (t = this.factory(e), this.set(e, t)), t; } }; var BB = Object.defineProperty, GB = (n, e, t) => e in n ? BB(n, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : n[e] = t, zB = (n, e, t) => (GB(n, e + "", t), t), HT = (n, e, t) => { if (!e.has(n)) throw TypeError("Cannot " + t); }, Q3 = (n, e, t) => (HT(n, e, "read from private field"), t ? t.call(n) : e.get(n)), Hr = (n, e, t) => { if (e.has(n)) throw TypeError("Cannot add the same private member more than once"); e instanceof WeakSet ? e.add(n) : e.set(n, t); }, Xg = (n, e, t, i) => (HT(n, e, "write to private field"), e.set(n, t), t), b4, Z5, B5; let HB = class { constructor(e) { Hr(this, b4, {}), Hr(this, Z5, new zT(() => /* @__PURE__ */ new Set())), Hr(this, B5, /* @__PURE__ */ new Set()), zB(this, "disposables", st()), Xg(this, b4, e), A4.isServer && this.disposables.microTask(() => { this.dispose(); }); } dispose() { this.disposables.dispose(); } get state() { return Q3(this, b4); } subscribe(e, t) { if (A4.isServer) return () => { }; let i = { selector: e, callback: t, current: e(Q3(this, b4)) }; return Q3(this, B5).add(i), this.disposables.add(() => { Q3(this, B5).delete(i); }); } on(e, t) { return A4.isServer ? () => { } : (Q3(this, Z5).get(e).add(t), this.disposables.add(() => { Q3(this, Z5).get(e).delete(t); })); } send(e) { let t = this.reduce(Q3(this, b4), e); if (t !== Q3(this, b4)) { Xg(this, b4, t); for (let i of Q3(this, B5)) { let s = i.selector(Q3(this, b4)); YT(i.current, s) || (i.current = s, i.callback(s)); } for (let i of Q3(this, Z5).get(e.type)) i(Q3(this, b4), e); } } }; b4 = /* @__PURE__ */ new WeakMap(), Z5 = /* @__PURE__ */ new WeakMap(), B5 = /* @__PURE__ */ new WeakMap(); function YT(n, e) { return Object.is(n, e) ? !0 : typeof n != "object" || n === null || typeof e != "object" || e === null ? !1 : Array.isArray(n) && Array.isArray(e) ? n.length !== e.length ? !1 : Yr(n[Symbol.iterator](), e[Symbol.iterator]()) : n instanceof Map && e instanceof Map || n instanceof Set && e instanceof Set ? n.size !== e.size ? !1 : Yr(n.entries(), e.entries()) : Jg(n) && Jg(e) ? Yr(Object.entries(n)[Symbol.iterator](), Object.entries(e)[Symbol.iterator]()) : !1; } function Yr(n, e) { do { let t = n.next(), i = e.next(); if (t.done && i.done) return !0; if (t.done || i.done || !Object.is(t.value, i.value)) return !1; } while (!0); } function Jg(n) { if (Object.prototype.toString.call(n) !== "[object Object]") return !1; let e = Object.getPrototypeOf(n); return e === null || Object.getPrototypeOf(e) === null; } var YB = Object.defineProperty, VB = (n, e, t) => e in n ? YB(n, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : n[e] = t, ep = (n, e, t) => (VB(n, typeof e != "symbol" ? e + "" : e, t), t), qB = ((n) => (n[n.Push = 0] = "Push", n[n.Pop = 1] = "Pop", n))(qB || {}); let WB = { 0(n, e) { let t = e.id, i = n.stack, s = n.stack.indexOf(t); if (s !== -1) { let l = n.stack.slice(); return l.splice(s, 1), l.push(t), i = l, { ...n, stack: i }; } return { ...n, stack: [...n.stack, t] }; }, 1(n, e) { let t = e.id, i = n.stack.indexOf(t); if (i === -1) return n; let s = n.stack.slice(); return s.splice(i, 1), { ...n, stack: s }; } }, $B = class VT extends HB { constructor() { super(...arguments), ep(this, "actions", { push: (e) => this.send({ type: 0, id: e }), pop: (e) => this.send({ type: 1, id: e }) }), ep(this, "selectors", { isTop: (e, t) => e.stack[e.stack.length - 1] === t, inStack: (e, t) => e.stack.includes(t) }); } static new() { return new VT({ stack: [] }); } reduce(e, t) { return O4(t.type, WB, e, t); } }; const qT = new zT(() => $B.new()); var Vr = { exports: {} }, qr = {}; /** * @license React * use-sync-external-store-with-selector.production.js * * Copyright (c) Meta Platforms, Inc. and affiliates. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. */ var tp; function KB() { if (tp) return qr; tp = 1; var n = f6(); function e(L, _) { return L === _ && (L !== 0 || 1 / L === 1 / _) || L !== L && _ !== _; } var t = typeof Object.is == "function" ? Object.is : e, i = n.useSyncExternalStore, s = n.useRef, l = n.useEffect, c = n.useMemo, d = n.useDebugValue; return qr.useSyncExternalStoreWithSelector = function(L, _, p, m, f) { var h = s(null); if (h.current === null) { var v = { hasValue: !1, value: null }; h.current = v; } else v = h.current; h = c( function() { function w(P) { if (!M) { if (M = !0, N = P, P = m(P), f !== void 0 && v.hasValue) { var W = v.value; if (f(W, P)) return D = W; } return D = P; } if (W = D, t(N, P)) return W; var k = m(P); return f !== void 0 && f(W, k) ? (N = P, W) : (N = P, D = k); } var M = !1, N, D, A = p === void 0 ? null : p; return [ function() { return w(_()); }, A === null ? void 0 : function() { return w(A()); } ]; }, [_, p, m, f] ); var R = i(L, h[0], h[1]); return l( function() { v.hasValue = !0, v.value = R; }, [R] ), d(R), R; }, qr; } var np; function QB() { return np || (np = 1, Vr.exports = KB()), Vr.exports; } var jB = QB(); function WT(n, e, t = YT) { return jB.useSyncExternalStoreWithSelector(C1((i) => n.subscribe(XB, i)), C1(() => n.state), C1(() => n.state), C1(e), t); } function XB(n) { return n; } function mn(n, e) { let t = b.useId(), i = qT.get(e), [s, l] = WT(i, b.useCallback((c) => [i.selectors.isTop(c, t), i.selectors.inStack(c, t)], [i, t])); return Ee(() => { if (n) return i.actions.push(t), () => i.actions.pop(t); }, [i, n, t]), n ? l ? s : !0 : !1; } let Lc = /* @__PURE__ */ new Map(), W5 = /* @__PURE__ */ new Map(); function ip(n) { var e; let t = (e = W5.get(n)) != null ? e : 0; return W5.set(n, t + 1), t !== 0 ? () => rp(n) : (Lc.set(n, { "aria-hidden": n.getAttribute("aria-hidden"), inert: n.inert }), n.setAttribute("aria-hidden", "true"), n.inert = !0, () => rp(n)); } function rp(n) { var e; let t = (e = W5.get(n)) != null ? e : 1; if (t === 1 ? W5.delete(n) : W5.set(n, t - 1), t !== 1) return; let i = Lc.get(n); i && (i["aria-hidden"] === null ? n.removeAttribute("aria-hidden") : n.setAttribute("aria-hidden", i["aria-hidden"]), n.inert = i.inert, Lc.delete(n)); } function JB(n, { allowed: e, disallowed: t } = {}) { let i = mn(n, "inert-others"); Ee(() => { var s, l; if (!i) return; let c = st(); for (let L of (s = t == null ? void 0 : t()) != null ? s : []) L && c.add(ip(L)); let d = (l = e == null ? void 0 : e()) != null ? l : []; for (let L of d) { if (!L) continue; let _ = pn(L); if (!_) continue; let p = L.parentElement; for (; p && p !== _.body; ) { for (let m of p.children) d.some((f) => m.contains(f)) || c.add(ip(m)); p = p.parentElement; } } return c.dispose; }, [i, e, t]); } function eG(n, e, t) { let i = ot((s) => { let l = s.getBoundingClientRect(); l.x === 0 && l.y === 0 && l.width === 0 && l.height === 0 && t(); }); b.useEffect(() => { if (!n) return; let s = e === null ? null : I4(e) ? e : e.current; if (!s) return; let l = st(); if (typeof ResizeObserver < "u") { let c = new ResizeObserver(() => i.current(s)); c.observe(s), l.add(() => c.disconnect()); } if (typeof IntersectionObserver < "u") { let c = new IntersectionObserver(() => i.current(s)); c.observe(s), l.add(() => c.disconnect()); } return () => l.dispose(); }, [e, i, n]); } let L6 = ["[contentEditable=true]", "[tabindex]", "a[href]", "area[href]", "button:not([disabled])", "iframe", "input:not([disabled])", "select:not([disabled])", "textarea:not([disabled])"].map((n) => `${n}:not([tabindex='-1'])`).join(","), tG = ["[data-autofocus]"].map((n) => `${n}:not([tabindex='-1'])`).join(","); var I3 = ((n) => (n[n.First = 1] = "First", n[n.Previous = 2] = "Previous", n[n.Next = 4] = "Next", n[n.Last = 8] = "Last", n[n.WrapAround = 16] = "WrapAround", n[n.NoScroll = 32] = "NoScroll", n[n.AutoFocus = 64] = "AutoFocus", n))(I3 || {}), tn = ((n) => (n[n.Error = 0] = "Error", n[n.Overflow = 1] = "Overflow", n[n.Success = 2] = "Success", n[n.Underflow = 3] = "Underflow", n))(tn || {}), nG = ((n) => (n[n.Previous = -1] = "Previous", n[n.Next = 1] = "Next", n))(nG || {}); function iG(n = document.body) { return n == null ? [] : Array.from(n.querySelectorAll(L6)).sort((e, t) => Math.sign((e.tabIndex || Number.MAX_SAFE_INTEGER) - (t.tabIndex || Number.MAX_SAFE_INTEGER))); } function rG(n = document.body) { return n == null ? [] : Array.from(n.querySelectorAll(tG)).sort((e, t) => Math.sign((e.tabIndex || Number.MAX_SAFE_INTEGER) - (t.tabIndex || Number.MAX_SAFE_INTEGER))); } var $T = ((n) => (n[n.Strict = 0] = "Strict", n[n.Loose = 1] = "Loose", n))($T || {}); function aG(n, e = 0) { var t; return n === ((t = pn(n)) == null ? void 0 : t.body) ? !1 : O4(e, { 0() { return n.matches(L6); }, 1() { let i = n; for (; i !== null; ) { if (i.matches(L6)) return !0; i = i.parentElement; } return !1; } }); } var sG = ((n) => (n[n.Keyboard = 0] = "Keyboard", n[n.Mouse = 1] = "Mouse", n))(sG || {}); typeof window < "u" && typeof document < "u" && (document.addEventListener("keydown", (n) => { n.metaKey || n.altKey || n.ctrlKey || (document.documentElement.dataset.headlessuiFocusVisible = ""); }, !0), document.addEventListener("click", (n) => { n.detail === 1 ? delete document.documentElement.dataset.headlessuiFocusVisible : n.detail === 0 && (document.documentElement.dataset.headlessuiFocusVisible = ""); }, !0)); function tt(n) { n == null || n.focus({ preventScroll: !0 }); } let oG = ["textarea", "input"].join(","); function lG(n) { var e, t; return (t = (e = n == null ? void 0 : n.matches) == null ? void 0 : e.call(n, oG)) != null ? t : !1; } function KT(n, e = (t) => t) { return n.slice().sort((t, i) => { let s = e(t), l = e(i); if (s === null || l === null) return 0; let c = s.compareDocumentPosition(l); return c & Node.DOCUMENT_POSITION_FOLLOWING ? -1 : c & Node.DOCUMENT_POSITION_PRECEDING ? 1 : 0; }); } function v9(n, e, { sorted: t = !0, relativeTo: i = null, skipElements: s = [] } = {}) { let l = Array.isArray(n) ? n.length > 0 ? n[0].ownerDocument : document : n.ownerDocument, c = Array.isArray(n) ? t ? KT(n) : n : e & 64 ? rG(n) : iG(n); s.length > 0 && c.length > 1 && (c = c.filter((h) => !s.some((v) => v != null && "current" in v ? (v == null ? void 0 : v.current) === h : v === h))), i = i ?? l.activeElement; let d = (() => { if (e & 5) return 1; if (e & 10) return -1; throw new Error("Missing Focus.First, Focus.Previous, Focus.Next or Focus.Last"); })(), L = (() => { if (e & 1) return 0; if (e & 2) return Math.max(0, c.indexOf(i)) - 1; if (e & 4) return Math.max(0, c.indexOf(i)) + 1; if (e & 8) return c.length - 1; throw new Error("Missing Focus.First, Focus.Previous, Focus.Next or Focus.Last"); })(), _ = e & 32 ? { preventScroll: !0 } : {}, p = 0, m = c.length, f; do { if (p >= m || p + m <= 0) return 0; let h = L + p; if (e & 16) h = (h + m) % m; else { if (h < 0) return 3; if (h >= m) return 1; } f = c[h], f == null || f.focus(_), p += d; } while (f !== l.activeElement); return e & 6 && lG(f) && f.select(), 2; } function QT() { return /iPhone/gi.test(window.navigator.platform) || /Mac/gi.test(window.navigator.platform) && window.navigator.maxTouchPoints > 0; } function cG() { return /Android/gi.test(window.navigator.userAgent); } function ap() { return QT() || cG(); } function P8(n, e, t, i) { let s = ot(t); b.useEffect(() => { if (!n) return; function l(c) { s.current(c); } return document.addEventListener(e, l, i), () => document.removeEventListener(e, l, i); }, [n, e, i]); } function jT(n, e, t, i) { let s = ot(t); b.useEffect(() => { if (!n) return; function l(c) { s.current(c); } return window.addEventListener(e, l, i), () => window.removeEventListener(e, l, i); }, [n, e, i]); } const sp = 30; function uG(n, e, t) { let i = ot(t), s = b.useCallback(function(d, L) { if (d.defaultPrevented) return; let _ = L(d); if (_ === null || !_.getRootNode().contains(_) || !_.isConnected) return; let p = (function m(f) { return typeof f == "function" ? m(f()) : Array.isArray(f) || f instanceof Set ? f : [f]; })(e); for (let m of p) if (m !== null && (m.contains(_) || d.composed && d.composedPath().includes(m))) return; return !aG(_, $T.Loose) && _.tabIndex !== -1 && d.preventDefault(), i.current(d, _); }, [i, e]), l = b.useRef(null); P8(n, "pointerdown", (d) => { var L, _; ap() || (l.current = ((_ = (L = d.composedPath) == null ? void 0 : L.call(d)) == null ? void 0 : _[0]) || d.target); }, !0), P8(n, "pointerup", (d) => { if (ap() || !l.current) return; let L = l.current; return l.current = null, s(d, () => L); }, !0); let c = b.useRef({ x: 0, y: 0 }); P8(n, "touchstart", (d) => { c.current.x = d.touches[0].clientX, c.current.y = d.touches[0].clientY; }, !0), P8(n, "touchend", (d) => { let L = { x: d.changedTouches[0].clientX, y: d.changedTouches[0].clientY }; if (!(Math.abs(L.x - c.current.x) >= sp || Math.abs(L.y - c.current.y) >= sp)) return s(d, () => Ht(d.target) ? d.target : null); }, !0), jT(n, "blur", (d) => s(d, () => RB(window.document.activeElement) ? window.document.activeElement : null), !0); } function q6(...n) { return b.useMemo(() => pn(...n), [...n]); } function XT(n, e, t, i) { let s = ot(t); b.useEffect(() => { n = n ?? window; function l(c) { s.current(c); } return n.addEventListener(e, l, i), () => n.removeEventListener(e, l, i); }, [n, e, i]); } function dG(n) { return b.useSyncExternalStore(n.subscribe, n.getSnapshot, n.getSnapshot); } function LG(n, e) { let t = n(), i = /* @__PURE__ */ new Set(); return { getSnapshot() { return t; }, subscribe(s) { return i.add(s), () => i.delete(s); }, dispatch(s, ...l) { let c = e[s].call(t, ...l); c && (t = c, i.forEach((d) => d())); } }; } function CG() { let n; return { before({ doc: e }) { var t; let i = e.documentElement, s = (t = e.defaultView) != null ? t : window; n = Math.max(0, s.innerWidth - i.clientWidth); }, after({ doc: e, d: t }) { let i = e.documentElement, s = Math.max(0, i.clientWidth - i.offsetWidth), l = Math.max(0, n - s); t.style(i, "paddingRight", `${l}px`); } }; } function _G() { return QT() ? { before({ doc: n, d: e, meta: t }) { function i(s) { return t.containers.flatMap((l) => l()).some((l) => l.contains(s)); } e.microTask(() => { var s; if (window.getComputedStyle(n.documentElement).scrollBehavior !== "auto") { let d = st(); d.style(n.documentElement, "scrollBehavior", "auto"), e.add(() => e.microTask(() => d.dispose())); } let l = (s = window.scrollY) != null ? s : window.pageYOffset, c = null; e.addEventListener(n, "click", (d) => { if (Ht(d.target)) try { let L = d.target.closest("a"); if (!L) return; let { hash: _ } = new URL(L.href), p = n.querySelector(_); Ht(p) && !i(p) && (c = p); } catch { } }, !0), e.addEventListener(n, "touchstart", (d) => { if (Ht(d.target) && vB(d.target)) if (i(d.target)) { let L = d.target; for (; L.parentElement && i(L.parentElement); ) L = L.parentElement; e.style(L, "overscrollBehavior", "contain"); } else e.style(d.target, "touchAction", "none"); }), e.addEventListener(n, "touchmove", (d) => { if (Ht(d.target)) { if (IT(d.target)) return; if (i(d.target)) { let L = d.target; for (; L.parentElement && L.dataset.headlessuiPortal !== "" && !(L.scrollHeight > L.clientHeight || L.scrollWidth > L.clientWidth); ) L = L.parentElement; L.dataset.headlessuiPortal === "" && d.preventDefault(); } else d.preventDefault(); } }, { passive: !1 }), e.add(() => { var d; let L = (d = window.scrollY) != null ? d : window.pageYOffset; l !== L && window.scrollTo(0, l), c && c.isConnected && (c.scrollIntoView({ block: "nearest" }), c = null); }); }); } } : {}; } function gG() { return { before({ doc: n, d: e }) { e.style(n.documentElement, "overflow", "hidden"); } }; } function pG(n) { let e = {}; for (let t of n) Object.assign(e, t(e)); return e; } let T9 = LG(() => /* @__PURE__ */ new Map(), { PUSH(n, e) { var t; let i = (t = this.get(n)) != null ? t : { doc: n, count: 0, d: st(), meta: /* @__PURE__ */ new Set() }; return i.count++, i.meta.add(e), this.set(n, i), this; }, POP(n, e) { let t = this.get(n); return t && (t.count--, t.meta.delete(e)), this; }, SCROLL_PREVENT({ doc: n, d: e, meta: t }) { let i = { doc: n, d: e, meta: pG(t) }, s = [_G(), CG(), gG()]; s.forEach(({ before: l }) => l == null ? void 0 : l(i)), s.forEach(({ after: l }) => l == null ? void 0 : l(i)); }, SCROLL_ALLOW({ d: n }) { n.dispose(); }, TEARDOWN({ doc: n }) { this.delete(n); } }); T9.subscribe(() => { let n = T9.getSnapshot(), e = /* @__PURE__ */ new Map(); for (let [t] of n) e.set(t, t.documentElement.style.overflow); for (let t of n.values()) { let i = e.get(t.doc) === "hidden", s = t.count !== 0; (s && !i || !s && i) && T9.dispatch(t.count > 0 ? "SCROLL_PREVENT" : "SCROLL_ALLOW", t), t.count === 0 && T9.dispatch("TEARDOWN", t); } }); function mG(n, e, t = () => ({ containers: [] })) { let i = dG(T9), s = e ? i.get(e) : void 0, l = s ? s.count > 0 : !1; return Ee(() => { if (!(!e || !n)) return T9.dispatch("PUSH", e, t), () => T9.dispatch("POP", e, t); }, [n, e]), l; } function hG(n, e, t = () => [document.body]) { let i = mn(n, "scroll-lock"); mG(i, e, (s) => { var l; return { containers: [...(l = s.containers) != null ? l : [], t] }; }); } function fG(n = 0) { let [e, t] = b.useState(n), i = b.useCallback((L) => t(L), [e]), s = b.useCallback((L) => t((_) => _ | L), [e]), l = b.useCallback((L) => (e & L) === L, [e]), c = b.useCallback((L) => t((_) => _ & ~L), [t]), d = b.useCallback((L) => t((_) => _ ^ L), [t]); return { flags: e, setFlag: i, addFlag: s, hasFlag: l, removeFlag: c, toggleFlag: d }; } var op, lp; typeof process < "u" && typeof globalThis < "u" && typeof Element < "u" && ((op = process == null ? void 0 : process.env) == null ? void 0 : op.NODE_ENV) === "test" && typeof ((lp = Element == null ? void 0 : Element.prototype) == null ? void 0 : lp.getAnimations) > "u" && (Element.prototype.getAnimations = function() { return console.warn(["Headless UI has polyfilled `Element.prototype.getAnimations` for your tests.", "Please install a proper polyfill e.g. `jsdom-testing-mocks`, to silence these warnings.", "", "Example usage:", "```js", "import { mockAnimationsApi } from 'jsdom-testing-mocks'", "mockAnimationsApi()", "```"].join(` `)), []; }); var EG = ((n) => (n[n.None = 0] = "None", n[n.Closed = 1] = "Closed", n[n.Enter = 2] = "Enter", n[n.Leave = 4] = "Leave", n))(EG || {}); function SG(n) { let e = {}; for (let t in n) n[t] === !0 && (e[`data-${t}`] = ""); return e; } function TG(n, e, t, i) { let [s, l] = b.useState(t), { hasFlag: c, addFlag: d, removeFlag: L } = fG(n && s ? 3 : 0), _ = b.useRef(!1), p = b.useRef(!1), m = z6(); return Ee(() => { var f; if (n) { if (t && l(!0), !e) { t && d(3); return; } return (f = i == null ? void 0 : i.start) == null || f.call(i, t), vG(e, { inFlight: _, prepare() { p.current ? p.current = !1 : p.current = _.current, _.current = !0, !p.current && (t ? (d(3), L(4)) : (d(4), L(2))); }, run() { p.current ? t ? (L(3), d(4)) : (L(4), d(3)) : t ? L(1) : d(1); }, done() { var h; p.current && typeof e.getAnimations == "function" && e.getAnimations().length > 0 || (_.current = !1, L(7), t || l(!1), (h = i == null ? void 0 : i.end) == null || h.call(i, t)); } }); } }, [n, t, e, m]), n ? [s, { closed: c(1), enter: c(2), leave: c(4), transition: c(2) || c(4) }] : [t, { closed: void 0, enter: void 0, leave: void 0, transition: void 0 }]; } function vG(n, { prepare: e, run: t, done: i, inFlight: s }) { let l = st(); return bG(n, { prepare: e, inFlight: s }), l.nextFrame(() => { t(), l.requestAnimationFrame(() => { l.add(RG(n, i)); }); }), l.dispose; } function RG(n, e) { var t, i; let s = st(); if (!n) return s.dispose; let l = !1; s.add(() => { l = !0; }); let c = (i = (t = n.getAnimations) == null ? void 0 : t.call(n).filter((d) => d instanceof CSSTransition)) != null ? i : []; return c.length === 0 ? (e(), s.dispose) : (Promise.allSettled(c.map((d) => d.finished)).then(() => { l || e(); }), s.dispose); } function bG(n, { inFlight: e, prepare: t }) { if (e != null && e.current) { t(); return; } let i = n.style.transition; n.style.transition = "none", t(), n.offsetHeight, n.style.transition = i; } function Vu(n, e) { let t = b.useRef([]), i = C1(n); b.useEffect(() => { let s = [...t.current]; for (let [l, c] of e.entries()) if (t.current[l] !== c) { let d = i(e, s); return t.current = e, d; } }, [i, ...e]); } function W6() { return typeof window < "u"; } function O0(n) { return JT(n) ? (n.nodeName || "").toLowerCase() : "#document"; } function k3(n) { var e; return (n == null || (e = n.ownerDocument) == null ? void 0 : e.defaultView) || window; } function lt(n) { var e; return (e = (JT(n) ? n.ownerDocument : n.document) || window.document) == null ? void 0 : e.documentElement; } function JT(n) { return W6() ? n instanceof Node || n instanceof k3(n).Node : !1; } function Qe(n) { return W6() ? n instanceof Element || n instanceof k3(n).Element : !1; } function D4(n) { return W6() ? n instanceof HTMLElement || n instanceof k3(n).HTMLElement : !1; } function cp(n) { return !W6() || typeof ShadowRoot > "u" ? !1 : n instanceof ShadowRoot || n instanceof k3(n).ShadowRoot; } const xG = /* @__PURE__ */ new Set(["inline", "contents"]); function hn(n) { const { overflow: e, overflowX: t, overflowY: i, display: s } = _4(n); return /auto|scroll|overlay|hidden|clip/.test(e + i + t) && !xG.has(s); } const wG = /* @__PURE__ */ new Set(["table", "td", "th"]); function MG(n) { return wG.has(O0(n)); } const AG = [":popover-open", ":modal"]; function $6(n) { return AG.some((e) => { try { return n.matches(e); } catch { return !1; } }); } const yG = ["transform", "translate", "scale", "rotate", "perspective"], NG = ["transform", "translate", "scale", "rotate", "perspective", "filter"], OG = ["paint", "layout", "strict", "content"]; function qu(n) { const e = Wu(), t = Qe(n) ? _4(n) : n; return yG.some((i) => t[i] ? t[i] !== "none" : !1) || (t.containerType ? t.containerType !== "normal" : !1) || !e && (t.backdropFilter ? t.backdropFilter !== "none" : !1) || !e && (t.filter ? t.filter !== "none" : !1) || NG.some((i) => (t.willChange || "").includes(i)) || OG.some((i) => (t.contain || "").includes(i)); } function IG(n) { let e = qt(n); for (; D4(e) && !v0(e); ) { if (qu(e)) return e; if ($6(e)) return null; e = qt(e); } return null; } function Wu() { return typeof CSS > "u" || !CSS.supports ? !1 : CSS.supports("-webkit-backdrop-filter", "none"); } const DG = /* @__PURE__ */ new Set(["html", "body", "#document"]); function v0(n) { return DG.has(O0(n)); } function _4(n) { return k3(n).getComputedStyle(n); } function K6(n) { return Qe(n) ? { scrollLeft: n.scrollLeft, scrollTop: n.scrollTop } : { scrollLeft: n.scrollX, scrollTop: n.scrollY }; } function qt(n) { if (O0(n) === "html") return n; const e = ( // Step into the shadow DOM of the parent of a slotted node. n.assignedSlot || // DOM Element detected. n.parentNode || // ShadowRoot detected. cp(n) && n.host || // Fallback. lt(n) ); return cp(e) ? e.host : e; } function ev(n) { const e = qt(n); return v0(e) ? n.ownerDocument ? n.ownerDocument.body : n.body : D4(e) && hn(e) ? e : ev(e); } function tv(n, e, t) { var i; e === void 0 && (e = []); const s = ev(n), l = s === ((i = n.ownerDocument) == null ? void 0 : i.body), c = k3(s); return l ? (Cc(c), e.concat(c, c.visualViewport || [], hn(s) ? s : [], [])) : e.concat(s, tv(s, [])); } function Cc(n) { return n.parent && Object.getPrototypeOf(n.parent) ? n.frameElement : null; } const up = Math.min, $5 = Math.max, C6 = Math.round, y4 = (n) => ({ x: n, y: n }); function nv(n) { return n.split("-")[0]; } function kG(n) { return n.split("-")[1]; } function PG(n) { return n === "x" ? "y" : "x"; } function FG(n) { return n === "y" ? "height" : "width"; } const UG = /* @__PURE__ */ new Set(["top", "bottom"]); function iv(n) { return UG.has(nv(n)) ? "y" : "x"; } function ZG(n) { return PG(iv(n)); } function rv(n) { const { x: e, y: t, width: i, height: s } = n; return { width: i, height: s, top: t, left: e, right: e + i, bottom: t + s, x: e, y: t }; } function dp(n, e, t) { let { reference: i, floating: s } = n; const l = iv(e), c = ZG(e), d = FG(c), L = nv(e), _ = l === "y", p = i.x + i.width / 2 - s.width / 2, m = i.y + i.height / 2 - s.height / 2, f = i[d] / 2 - s[d] / 2; let h; switch (L) { case "top": h = { x: p, y: i.y - s.height }; break; case "bottom": h = { x: p, y: i.y + i.height }; break; case "right": h = { x: i.x + i.width, y: m }; break; case "left": h = { x: i.x - s.width, y: m }; break; default: h = { x: i.x, y: i.y }; } switch (kG(e)) { case "start": h[c] -= f * (t && _ ? -1 : 1); break; case "end": h[c] += f * (t && _ ? -1 : 1); break; } return h; } const BG = async (n, e, t) => { const { placement: i = "bottom", strategy: s = "absolute", middleware: l = [], platform: c } = t, d = l.filter(Boolean), L = await (c.isRTL == null ? void 0 : c.isRTL(e)); let _ = await c.getElementRects({ reference: n, floating: e, strategy: s }), { x: p, y: m } = dp(_, i, L), f = i, h = {}, v = 0; for (let R = 0; R < d.length; R++) { const { name: w, fn: M } = d[R], { x: N, y: D, data: A, reset: P } = await M({ x: p, y: m, initialPlacement: i, placement: f, strategy: s, middlewareData: h, rects: _, platform: c, elements: { reference: n, floating: e } }); p = N ?? p, m = D ?? m, h = { ...h, [w]: { ...h[w], ...A } }, P && v <= 50 && (v++, typeof P == "object" && (P.placement && (f = P.placement), P.rects && (_ = P.rects === !0 ? await c.getElementRects({ reference: n, floating: e, strategy: s }) : P.rects), { x: p, y: m } = dp(_, f, L)), R = -1); } return { x: p, y: m, placement: f, strategy: s, middlewareData: h }; }; function av(n) { const e = _4(n); let t = parseFloat(e.width) || 0, i = parseFloat(e.height) || 0; const s = D4(n), l = s ? n.offsetWidth : t, c = s ? n.offsetHeight : i, d = C6(t) !== l || C6(i) !== c; return d && (t = l, i = c), { width: t, height: i, $: d }; } function sv(n) { return Qe(n) ? n : n.contextElement; } function m0(n) { const e = sv(n); if (!D4(e)) return y4(1); const t = e.getBoundingClientRect(), { width: i, height: s, $: l } = av(e); let c = (l ? C6(t.width) : t.width) / i, d = (l ? C6(t.height) : t.height) / s; return (!c || !Number.isFinite(c)) && (c = 1), (!d || !Number.isFinite(d)) && (d = 1), { x: c, y: d }; } const GG = /* @__PURE__ */ y4(0); function ov(n) { const e = k3(n); return !Wu() || !e.visualViewport ? GG : { x: e.visualViewport.offsetLeft, y: e.visualViewport.offsetTop }; } function zG(n, e, t) { return e === void 0 && (e = !1), !t || e && t !== k3(n) ? !1 : e; } function nn(n, e, t, i) { e === void 0 && (e = !1), t === void 0 && (t = !1); const s = n.getBoundingClientRect(), l = sv(n); let c = y4(1); e && (i ? Qe(i) && (c = m0(i)) : c = m0(n)); const d = zG(l, t, i) ? ov(l) : y4(0); let L = (s.left + d.x) / c.x, _ = (s.top + d.y) / c.y, p = s.width / c.x, m = s.height / c.y; if (l) { const f = k3(l), h = i && Qe(i) ? k3(i) : i; let v = f, R = Cc(v); for (; R && i && h !== v; ) { const w = m0(R), M = R.getBoundingClientRect(), N = _4(R), D = M.left + (R.clientLeft + parseFloat(N.paddingLeft)) * w.x, A = M.top + (R.clientTop + parseFloat(N.paddingTop)) * w.y; L *= w.x, _ *= w.y, p *= w.x, m *= w.y, L += D, _ += A, v = k3(R), R = Cc(v); } } return rv({ width: p, height: m, x: L, y: _ }); } function Q6(n, e) { const t = K6(n).scrollLeft; return e ? e.left + t : nn(lt(n)).left + t; } function lv(n, e) { const t = n.getBoundingClientRect(), i = t.left + e.scrollLeft - Q6(n, t), s = t.top + e.scrollTop; return { x: i, y: s }; } function HG(n) { let { elements: e, rect: t, offsetParent: i, strategy: s } = n; const l = s === "fixed", c = lt(i), d = e ? $6(e.floating) : !1; if (i === c || d && l) return t; let L = { scrollLeft: 0, scrollTop: 0 }, _ = y4(1); const p = y4(0), m = D4(i); if ((m || !m && !l) && ((O0(i) !== "body" || hn(c)) && (L = K6(i)), D4(i))) { const h = nn(i); _ = m0(i), p.x = h.x + i.clientLeft, p.y = h.y + i.clientTop; } const f = c && !m && !l ? lv(c, L) : y4(0); return { width: t.width * _.x, height: t.height * _.y, x: t.x * _.x - L.scrollLeft * _.x + p.x + f.x, y: t.y * _.y - L.scrollTop * _.y + p.y + f.y }; } function YG(n) { return Array.from(n.getClientRects()); } function VG(n) { const e = lt(n), t = K6(n), i = n.ownerDocument.body, s = $5(e.scrollWidth, e.clientWidth, i.scrollWidth, i.clientWidth), l = $5(e.scrollHeight, e.clientHeight, i.scrollHeight, i.clientHeight); let c = -t.scrollLeft + Q6(n); const d = -t.scrollTop; return _4(i).direction === "rtl" && (c += $5(e.clientWidth, i.clientWidth) - s), { width: s, height: l, x: c, y: d }; } const Lp = 25; function qG(n, e) { const t = k3(n), i = lt(n), s = t.visualViewport; let l = i.clientWidth, c = i.clientHeight, d = 0, L = 0; if (s) { l = s.width, c = s.height; const p = Wu(); (!p || p && e === "fixed") && (d = s.offsetLeft, L = s.offsetTop); } const _ = Q6(i); if (_ <= 0) { const p = i.ownerDocument, m = p.body, f = getComputedStyle(m), h = p.compatMode === "CSS1Compat" && parseFloat(f.marginLeft) + parseFloat(f.marginRight) || 0, v = Math.abs(i.clientWidth - m.clientWidth - h); v <= Lp && (l -= v); } else _ <= Lp && (l += _); return { width: l, height: c, x: d, y: L }; } const WG = /* @__PURE__ */ new Set(["absolute", "fixed"]); function $G(n, e) { const t = nn(n, !0, e === "fixed"), i = t.top + n.clientTop, s = t.left + n.clientLeft, l = D4(n) ? m0(n) : y4(1), c = n.clientWidth * l.x, d = n.clientHeight * l.y, L = s * l.x, _ = i * l.y; return { width: c, height: d, x: L, y: _ }; } function Cp(n, e, t) { let i; if (e === "viewport") i = qG(n, t); else if (e === "document") i = VG(lt(n)); else if (Qe(e)) i = $G(e, t); else { const s = ov(n); i = { x: e.x - s.x, y: e.y - s.y, width: e.width, height: e.height }; } return rv(i); } function cv(n, e) { const t = qt(n); return t === e || !Qe(t) || v0(t) ? !1 : _4(t).position === "fixed" || cv(t, e); } function KG(n, e) { const t = e.get(n); if (t) return t; let i = tv(n, []).filter((d) => Qe(d) && O0(d) !== "body"), s = null; const l = _4(n).position === "fixed"; let c = l ? qt(n) : n; for (; Qe(c) && !v0(c); ) { const d = _4(c), L = qu(c); !L && d.position === "fixed" && (s = null), (l ? !L && !s : !L && d.position === "static" && !!s && WG.has(s.position) || hn(c) && !L && cv(n, c)) ? i = i.filter((p) => p !== c) : s = d, c = qt(c); } return e.set(n, i), i; } function QG(n) { let { element: e, boundary: t, rootBoundary: i, strategy: s } = n; const c = [...t === "clippingAncestors" ? $6(e) ? [] : KG(e, this._c) : [].concat(t), i], d = c[0], L = c.reduce((_, p) => { const m = Cp(e, p, s); return _.top = $5(m.top, _.top), _.right = up(m.right, _.right), _.bottom = up(m.bottom, _.bottom), _.left = $5(m.left, _.left), _; }, Cp(e, d, s)); return { width: L.right - L.left, height: L.bottom - L.top, x: L.left, y: L.top }; } function jG(n) { const { width: e, height: t } = av(n); return { width: e, height: t }; } function XG(n, e, t) { const i = D4(e), s = lt(e), l = t === "fixed", c = nn(n, !0, l, e); let d = { scrollLeft: 0, scrollTop: 0 }; const L = y4(0); function _() { L.x = Q6(s); } if (i || !i && !l) if ((O0(e) !== "body" || hn(s)) && (d = K6(e)), i) { const h = nn(e, !0, l, e); L.x = h.x + e.clientLeft, L.y = h.y + e.clientTop; } else s && _(); l && !i && s && _(); const p = s && !i && !l ? lv(s, d) : y4(0), m = c.left + d.scrollLeft - L.x - p.x, f = c.top + d.scrollTop - L.y - p.y; return { x: m, y: f, width: c.width, height: c.height }; } function Wr(n) { return _4(n).position === "static"; } function _p(n, e) { if (!D4(n) || _4(n).position === "fixed") return null; if (e) return e(n); let t = n.offsetParent; return lt(n) === t && (t = t.ownerDocument.body), t; } function uv(n, e) { const t = k3(n); if ($6(n)) return t; if (!D4(n)) { let s = qt(n); for (; s && !v0(s); ) { if (Qe(s) && !Wr(s)) return s; s = qt(s); } return t; } let i = _p(n, e); for (; i && MG(i) && Wr(i); ) i = _p(i, e); return i && v0(i) && Wr(i) && !qu(i) ? t : i || IG(n) || t; } const JG = async function(n) { const e = this.getOffsetParent || uv, t = this.getDimensions, i = await t(n.floating); return { reference: XG(n.reference, await e(n.floating), n.strategy), floating: { x: 0, y: 0, width: i.width, height: i.height } }; }; function ez(n) { return _4(n).direction === "rtl"; } const tz = { convertOffsetParentRelativeRectToViewportRelativeRect: HG, getDocumentElement: lt, getClippingRect: QG, getOffsetParent: uv, getElementRects: JG, getClientRects: YG, getDimensions: jG, getScale: m0, isElement: Qe, isRTL: ez }, nz = (n, e, t) => { const i = /* @__PURE__ */ new Map(), s = { platform: tz, ...t }, l = { ...s.platform, _c: i }; return BG(n, e, { ...s, platform: l }); }; var iz = typeof document < "u", rz = function() { }, q8 = iz ? b.useLayoutEffect : rz; function _6(n, e) { if (n === e) return !0; if (typeof n != typeof e) return !1; if (typeof n == "function" && n.toString() === e.toString()) return !0; let t, i, s; if (n && e && typeof n == "object") { if (Array.isArray(n)) { if (t = n.length, t !== e.length) return !1; for (i = t; i-- !== 0; ) if (!_6(n[i], e[i])) return !1; return !0; } if (s = Object.keys(n), t = s.length, t !== Object.keys(e).length) return !1; for (i = t; i-- !== 0; ) if (!{}.hasOwnProperty.call(e, s[i])) return !1; for (i = t; i-- !== 0; ) { const l = s[i]; if (!(l === "_owner" && n.$$typeof) && !_6(n[l], e[l])) return !1; } return !0; } return n !== n && e !== e; } function dv(n) { return typeof window > "u" ? 1 : (n.ownerDocument.defaultView || window).devicePixelRatio || 1; } function gp(n, e) { const t = dv(n); return Math.round(e * t) / t; } function $r(n) { const e = b.useRef(n); return q8(() => { e.current = n; }), e; } function az(n) { n === void 0 && (n = {}); const { placement: e = "bottom", strategy: t = "absolute", middleware: i = [], platform: s, elements: { reference: l, floating: c } = {}, transform: d = !0, whileElementsMounted: L, open: _ } = n, [p, m] = b.useState({ x: 0, y: 0, strategy: t, placement: e, middlewareData: {}, isPositioned: !1 }), [f, h] = b.useState(i); _6(f, i) || h(i); const [v, R] = b.useState(null), [w, M] = b.useState(null), N = b.useCallback((G) => { G !== W.current && (W.current = G, R(G)); }, []), D = b.useCallback((G) => { G !== k.current && (k.current = G, M(G)); }, []), A = l || v, P = c || w, W = b.useRef(null), k = b.useRef(null), B = b.useRef(p), Q = L != null, n2 = $r(L), a2 = $r(s), r2 = $r(_), _2 = b.useCallback(() => { if (!W.current || !k.current) return; const G = { placement: e, strategy: t, middleware: f }; a2.current && (G.platform = a2.current), nz(W.current, k.current, G).then((C2) => { const y = { ...C2, // The floating element's position may be recomputed while it's closed // but still mounted (such as when transitioning out). To ensure // `isPositioned` will be `false` initially on the next open, avoid // setting it to `true` when `open === false` (must be specified). isPositioned: r2.current !== !1 }; I2.current && !_6(B.current, y) && (B.current = y, zu.flushSync(() => { m(y); })); }); }, [f, e, t, a2, r2]); q8(() => { _ === !1 && B.current.isPositioned && (B.current.isPositioned = !1, m((G) => ({ ...G, isPositioned: !1 }))); }, [_]); const I2 = b.useRef(!1); q8(() => (I2.current = !0, () => { I2.current = !1; }), []), q8(() => { if (A && (W.current = A), P && (k.current = P), A && P) { if (n2.current) return n2.current(A, P, _2); _2(); } }, [A, P, _2, n2, Q]); const H = b.useMemo(() => ({ reference: W, floating: k, setReference: N, setFloating: D }), [N, D]), O = b.useMemo(() => ({ reference: A, floating: P }), [A, P]), Z = b.useMemo(() => { const G = { position: t, left: 0, top: 0 }; if (!O.floating) return G; const C2 = gp(O.floating, p.x), y = gp(O.floating, p.y); return d ? { ...G, transform: "translate(" + C2 + "px, " + y + "px)", ...dv(O.floating) >= 1.5 && { willChange: "transform" } } : { position: t, left: C2, top: y }; }, [t, d, O.floating, p.x, p.y]); return b.useMemo(() => ({ ...p, update: _2, refs: H, elements: O, floatingStyles: Z }), [p, _2, H, O, Z]); } let j6 = b.createContext(null); j6.displayName = "OpenClosedContext"; var C4 = ((n) => (n[n.Open = 1] = "Open", n[n.Closed = 2] = "Closed", n[n.Closing = 4] = "Closing", n[n.Opening = 8] = "Opening", n))(C4 || {}); function X6() { return b.useContext(j6); } function sz({ value: n, children: e }) { return N2.createElement(j6.Provider, { value: n }, e); } function oz({ children: n }) { return N2.createElement(j6.Provider, { value: null }, n); } function lz(n) { function e() { document.readyState !== "loading" && (n(), document.removeEventListener("DOMContentLoaded", e)); } typeof window < "u" && typeof document < "u" && (document.addEventListener("DOMContentLoaded", e), e()); } let Bt = []; lz(() => { function n(e) { if (!Ht(e.target) || e.target === document.body || Bt[0] === e.target) return; let t = e.target; t = t.closest(L6), Bt.unshift(t ?? e.target), Bt = Bt.filter((i) => i != null && i.isConnected), Bt.splice(10); } window.addEventListener("click", n, { capture: !0 }), window.addEventListener("mousedown", n, { capture: !0 }), window.addEventListener("focus", n, { capture: !0 }), document.body.addEventListener("click", n, { capture: !0 }), document.body.addEventListener("mousedown", n, { capture: !0 }), document.body.addEventListener("focus", n, { capture: !0 }); }); function Lv(n) { let e = C1(n), t = b.useRef(!1); b.useEffect(() => (t.current = !1, () => { t.current = !0, G6(() => { t.current && e(); }); }), [e]); } function cz() { let n = typeof document > "u"; return "useSyncExternalStore" in X8 ? ((e) => e.useSyncExternalStore)(X8)(() => () => { }, () => !1, () => !n) : !1; } function fn() { let n = cz(), [e, t] = b.useState(A4.isHandoffComplete); return e && A4.isHandoffComplete === !1 && t(!1), b.useEffect(() => { e !== !0 && t(!0); }, [e]), b.useEffect(() => A4.handoff(), []), n ? !1 : e; } let Cv = b.createContext(!1); function uz() { return b.useContext(Cv); } function pp(n) { return N2.createElement(Cv.Provider, { value: n.force }, n.children); } function dz(n) { let e = uz(), t = b.useContext(gv), [i, s] = b.useState(() => { var l; if (!e && t !== null) return (l = t.current) != null ? l : null; if (A4.isServer) return null; let c = n == null ? void 0 : n.getElementById("headlessui-portal-root"); if (c) return c; if (n === null) return null; let d = n.createElement("div"); return d.setAttribute("id", "headlessui-portal-root"), n.body.appendChild(d); }); return b.useEffect(() => { i !== null && (n != null && n.body.contains(i) || n == null || n.body.appendChild(i)); }, [i, n]), b.useEffect(() => { e || t !== null && s(t.current); }, [t, s, e]), i; } let _v = b.Fragment, Lz = be(function(n, e) { let { ownerDocument: t = null, ...i } = n, s = b.useRef(null), l = p3(MB((h) => { s.current = h; }), e), c = q6(s), d = t ?? c, L = dz(d), [_] = b.useState(() => { var h; return A4.isServer ? null : (h = d == null ? void 0 : d.createElement("div")) != null ? h : null; }), p = b.useContext(_c), m = fn(); Ee(() => { !L || !_ || L.contains(_) || (_.setAttribute("data-headlessui-portal", ""), L.appendChild(_)); }, [L, _]), Ee(() => { if (_ && p) return p.register(_); }, [p, _]), Lv(() => { var h; !L || !_ || (OT(_) && L.contains(_) && L.removeChild(_), L.childNodes.length <= 0 && ((h = L.parentElement) == null || h.removeChild(L))); }); let f = ze(); return m ? !L || !_ ? null : zu.createPortal(f({ ourProps: { ref: l }, theirProps: i, slot: {}, defaultTag: _v, name: "Portal" }), _) : null; }); function Cz(n, e) { let t = p3(e), { enabled: i = !0, ownerDocument: s, ...l } = n, c = ze(); return i ? N2.createElement(Lz, { ...l, ownerDocument: s, ref: t }) : c({ ourProps: { ref: t }, theirProps: l, slot: {}, defaultTag: _v, name: "Portal" }); } let _z = b.Fragment, gv = b.createContext(null); function gz(n, e) { let { target: t, ...i } = n, s = { ref: p3(e) }, l = ze(); return N2.createElement(gv.Provider, { value: t }, l({ ourProps: s, theirProps: i, defaultTag: _z, name: "Popover.Group" })); } let _c = b.createContext(null); function pz() { let n = b.useContext(_c), e = b.useRef([]), t = C1((l) => (e.current.push(l), n && n.register(l), () => i(l))), i = C1((l) => { let c = e.current.indexOf(l); c !== -1 && e.current.splice(c, 1), n && n.unregister(l); }), s = b.useMemo(() => ({ register: t, unregister: i, portals: e }), [t, i, e]); return [e, b.useMemo(() => function({ children: l }) { return N2.createElement(_c.Provider, { value: s }, l); }, [s])]; } let mz = be(Cz), pv = be(gz), hz = Object.assign(mz, { Group: pv }); function fz(n, e = typeof document < "u" ? document.defaultView : null, t) { let i = mn(n, "escape"); XT(e, "keydown", (s) => { i && (s.defaultPrevented || s.key === Zt.Escape && t(s)); }); } function Ez() { var n; let [e] = b.useState(() => typeof window < "u" && typeof window.matchMedia == "function" ? window.matchMedia("(pointer: coarse)") : null), [t, i] = b.useState((n = e == null ? void 0 : e.matches) != null ? n : !1); return Ee(() => { if (!e) return; function s(l) { i(l.matches); } return e.addEventListener("change", s), () => e.removeEventListener("change", s); }, [e]), t; } function Sz({ defaultContainers: n = [], portals: e, mainTreeNode: t } = {}) { let i = q6(t), s = C1(() => { var l, c; let d = []; for (let L of n) L !== null && (et(L) ? d.push(L) : "current" in L && et(L.current) && d.push(L.current)); if (e != null && e.current) for (let L of e.current) d.push(L); for (let L of (l = i == null ? void 0 : i.querySelectorAll("html > *, body > *")) != null ? l : []) L !== document.body && L !== document.head && et(L) && L.id !== "headlessui-portal-root" && (t && (L.contains(t) || L.contains((c = t == null ? void 0 : t.getRootNode()) == null ? void 0 : c.host)) || d.some((_) => L.contains(_)) || d.push(L)); return d; }); return { resolveContainers: s, contains: C1((l) => s().some((c) => c.contains(l))) }; } let mv = b.createContext(null); function mp({ children: n, node: e }) { let [t, i] = b.useState(null), s = hv(e ?? t); return N2.createElement(mv.Provider, { value: s }, n, s === null && N2.createElement(en, { features: T0.Hidden, ref: (l) => { var c, d; if (l) { for (let L of (d = (c = pn(l)) == null ? void 0 : c.querySelectorAll("html > *, body > *")) != null ? d : []) if (L !== document.body && L !== document.head && et(L) && L != null && L.contains(l)) { i(L); break; } } } })); } function hv(n = null) { var e; return (e = b.useContext(mv)) != null ? e : n; } function $u() { let n = b.useRef(!1); return Ee(() => (n.current = !0, () => { n.current = !1; }), []), n; } var G5 = ((n) => (n[n.Forwards = 0] = "Forwards", n[n.Backwards = 1] = "Backwards", n))(G5 || {}); function Tz() { let n = b.useRef(0); return jT(!0, "keydown", (e) => { e.key === "Tab" && (n.current = e.shiftKey ? 1 : 0); }, !0), n; } function fv(n) { if (!n) return /* @__PURE__ */ new Set(); if (typeof n == "function") return new Set(n()); let e = /* @__PURE__ */ new Set(); for (let t of n.current) et(t.current) && e.add(t.current); return e; } let vz = "div"; var E9 = ((n) => (n[n.None = 0] = "None", n[n.InitialFocus = 1] = "InitialFocus", n[n.TabLock = 2] = "TabLock", n[n.FocusLock = 4] = "FocusLock", n[n.RestoreFocus = 8] = "RestoreFocus", n[n.AutoFocus = 16] = "AutoFocus", n))(E9 || {}); function Rz(n, e) { let t = b.useRef(null), i = p3(t, e), { initialFocus: s, initialFocusFallback: l, containers: c, features: d = 15, ...L } = n; fn() || (d = 0); let _ = q6(t); Mz(d, { ownerDocument: _ }); let p = Az(d, { ownerDocument: _, container: t, initialFocus: s, initialFocusFallback: l }); yz(d, { ownerDocument: _, container: t, containers: c, previousActiveElement: p }); let m = Tz(), f = C1((N) => { if (!I4(t.current)) return; let D = t.current; ((A) => A())(() => { O4(m.current, { [G5.Forwards]: () => { v9(D, I3.First, { skipElements: [N.relatedTarget, l] }); }, [G5.Backwards]: () => { v9(D, I3.Last, { skipElements: [N.relatedTarget, l] }); } }); }); }), h = mn(!!(d & 2), "focus-trap#tab-lock"), v = z6(), R = b.useRef(!1), w = { ref: i, onKeyDown(N) { N.key == "Tab" && (R.current = !0, v.requestAnimationFrame(() => { R.current = !1; })); }, onBlur(N) { if (!(d & 4)) return; let D = fv(c); I4(t.current) && D.add(t.current); let A = N.relatedTarget; Ht(A) && A.dataset.headlessuiFocusGuard !== "true" && (Ev(D, A) || (R.current ? v9(t.current, O4(m.current, { [G5.Forwards]: () => I3.Next, [G5.Backwards]: () => I3.Previous }) | I3.WrapAround, { relativeTo: N.target }) : Ht(N.target) && tt(N.target))); } }, M = ze(); return N2.createElement(N2.Fragment, null, h && N2.createElement(en, { as: "button", type: "button", "data-headlessui-focus-guard": !0, onFocus: f, features: T0.Focusable }), M({ ourProps: w, theirProps: L, defaultTag: vz, name: "FocusTrap" }), h && N2.createElement(en, { as: "button", type: "button", "data-headlessui-focus-guard": !0, onFocus: f, features: T0.Focusable })); } let bz = be(Rz), xz = Object.assign(bz, { features: E9 }); function wz(n = !0) { let e = b.useRef(Bt.slice()); return Vu(([t], [i]) => { i === !0 && t === !1 && G6(() => { e.current.splice(0); }), i === !1 && t === !0 && (e.current = Bt.slice()); }, [n, Bt, e]), C1(() => { var t; return (t = e.current.find((i) => i != null && i.isConnected)) != null ? t : null; }); } function Mz(n, { ownerDocument: e }) { let t = !!(n & 8), i = wz(t); Vu(() => { t || (e == null ? void 0 : e.activeElement) === (e == null ? void 0 : e.body) && tt(i()); }, [t]), Lv(() => { t && tt(i()); }); } function Az(n, { ownerDocument: e, container: t, initialFocus: i, initialFocusFallback: s }) { let l = b.useRef(null), c = mn(!!(n & 1), "focus-trap#initial-focus"), d = $u(); return Vu(() => { if (n === 0) return; if (!c) { s != null && s.current && tt(s.current); return; } let L = t.current; L && G6(() => { if (!d.current) return; let _ = e == null ? void 0 : e.activeElement; if (i != null && i.current) { if ((i == null ? void 0 : i.current) === _) { l.current = _; return; } } else if (L.contains(_)) { l.current = _; return; } if (i != null && i.current) tt(i.current); else { if (n & 16) { if (v9(L, I3.First | I3.AutoFocus) !== tn.Error) return; } else if (v9(L, I3.First) !== tn.Error) return; if (s != null && s.current && (tt(s.current), (e == null ? void 0 : e.activeElement) === s.current)) return; console.warn("There are no focusable elements inside the "); } l.current = e == null ? void 0 : e.activeElement; }); }, [s, c, n]), l; } function yz(n, { ownerDocument: e, container: t, containers: i, previousActiveElement: s }) { let l = $u(), c = !!(n & 4); XT(e == null ? void 0 : e.defaultView, "focus", (d) => { if (!c || !l.current) return; let L = fv(i); I4(t.current) && L.add(t.current); let _ = s.current; if (!_) return; let p = d.target; I4(p) ? Ev(L, p) ? (s.current = p, tt(p)) : (d.preventDefault(), d.stopPropagation(), tt(_)) : tt(s.current); }, !0); } function Ev(n, e) { for (let t of n) if (t.contains(e)) return !0; return !1; } function Sv(n) { var e; return !!(n.enter || n.enterFrom || n.enterTo || n.leave || n.leaveFrom || n.leaveTo) || ((e = n.as) != null ? e : vv) !== b.Fragment || N2.Children.count(n.children) === 1; } let J6 = b.createContext(null); J6.displayName = "TransitionContext"; var Nz = ((n) => (n.Visible = "visible", n.Hidden = "hidden", n))(Nz || {}); function Oz() { let n = b.useContext(J6); if (n === null) throw new Error("A is used but it is missing a parent or ."); return n; } function Iz() { let n = b.useContext(e7); if (n === null) throw new Error("A is used but it is missing a parent or ."); return n; } let e7 = b.createContext(null); e7.displayName = "NestingContext"; function t7(n) { return "children" in n ? t7(n.children) : n.current.filter(({ el: e }) => e.current !== null).filter(({ state: e }) => e === "visible").length > 0; } function Tv(n, e) { let t = ot(n), i = b.useRef([]), s = $u(), l = z6(), c = C1((h, v = zt.Hidden) => { let R = i.current.findIndex(({ el: w }) => w === h); R !== -1 && (O4(v, { [zt.Unmount]() { i.current.splice(R, 1); }, [zt.Hidden]() { i.current[R].state = "hidden"; } }), l.microTask(() => { var w; !t7(i) && s.current && ((w = t.current) == null || w.call(t)); })); }), d = C1((h) => { let v = i.current.find(({ el: R }) => R === h); return v ? v.state !== "visible" && (v.state = "visible") : i.current.push({ el: h, state: "visible" }), () => c(h, zt.Unmount); }), L = b.useRef([]), _ = b.useRef(Promise.resolve()), p = b.useRef({ enter: [], leave: [] }), m = C1((h, v, R) => { L.current.splice(0), e && (e.chains.current[v] = e.chains.current[v].filter(([w]) => w !== h)), e == null || e.chains.current[v].push([h, new Promise((w) => { L.current.push(w); })]), e == null || e.chains.current[v].push([h, new Promise((w) => { Promise.all(p.current[v].map(([M, N]) => N)).then(() => w()); })]), v === "enter" ? _.current = _.current.then(() => e == null ? void 0 : e.wait.current).then(() => R(v)) : R(v); }), f = C1((h, v, R) => { Promise.all(p.current[v].splice(0).map(([w, M]) => M)).then(() => { var w; (w = L.current.shift()) == null || w(); }).then(() => R(v)); }); return b.useMemo(() => ({ children: i, register: d, unregister: c, onStart: m, onStop: f, wait: _, chains: p }), [d, c, i, m, f, p, _]); } let vv = b.Fragment, Rv = d6.RenderStrategy; function Dz(n, e) { var t, i; let { transition: s = !0, beforeEnter: l, afterEnter: c, beforeLeave: d, afterLeave: L, enter: _, enterFrom: p, enterTo: m, entered: f, leave: h, leaveFrom: v, leaveTo: R, ...w } = n, [M, N] = b.useState(null), D = b.useRef(null), A = Sv(n), P = p3(...A ? [D, e, N] : e === null ? [] : [e]), W = (t = w.unmount) == null || t ? zt.Unmount : zt.Hidden, { show: k, appear: B, initial: Q } = Oz(), [n2, a2] = b.useState(k ? "visible" : "hidden"), r2 = Iz(), { register: _2, unregister: I2 } = r2; Ee(() => _2(D), [_2, D]), Ee(() => { if (W === zt.Hidden && D.current) { if (k && n2 !== "visible") { a2("visible"); return; } return O4(n2, { hidden: () => I2(D), visible: () => _2(D) }); } }, [n2, D, _2, I2, k, W]); let H = fn(); Ee(() => { if (A && H && n2 === "visible" && D.current === null) throw new Error("Did you forget to passthrough the `ref` to the actual DOM node?"); }, [D, n2, H, A]); let O = Q && !B, Z = B && k && Q, G = b.useRef(!1), C2 = Tv(() => { G.current || (a2("hidden"), I2(D)); }, r2), y = C1((D2) => { G.current = !0; let Y2 = D2 ? "enter" : "leave"; C2.onStart(D, Y2, (g1) => { g1 === "enter" ? l == null || l() : g1 === "leave" && (d == null || d()); }); }), J = C1((D2) => { let Y2 = D2 ? "enter" : "leave"; G.current = !1, C2.onStop(D, Y2, (g1) => { g1 === "enter" ? c == null || c() : g1 === "leave" && (L == null || L()); }), Y2 === "leave" && !t7(C2) && (a2("hidden"), I2(D)); }); b.useEffect(() => { A && s || (y(k), J(k)); }, [k, A, s]); let s2 = !(!s || !A || !H || O), [, V] = TG(s2, M, k, { start: y, end: J }), i2 = Ut({ ref: P, className: ((i = uc(w.className, Z && _, Z && p, V.enter && _, V.enter && V.closed && p, V.enter && !V.closed && m, V.leave && h, V.leave && !V.closed && v, V.leave && V.closed && R, !V.transition && k && f)) == null ? void 0 : i.trim()) || void 0, ...SG(V) }), g2 = 0; n2 === "visible" && (g2 |= C4.Open), n2 === "hidden" && (g2 |= C4.Closed), k && n2 === "hidden" && (g2 |= C4.Opening), !k && n2 === "visible" && (g2 |= C4.Closing); let E2 = ze(); return N2.createElement(e7.Provider, { value: C2 }, N2.createElement(sz, { value: g2 }, E2({ ourProps: i2, theirProps: w, defaultTag: vv, features: Rv, visible: n2 === "visible", name: "Transition.Child" }))); } function kz(n, e) { let { show: t, appear: i = !1, unmount: s = !0, ...l } = n, c = b.useRef(null), d = Sv(n), L = p3(...d ? [c, e] : e === null ? [] : [e]); fn(); let _ = X6(); if (t === void 0 && _ !== null && (t = (_ & C4.Open) === C4.Open), t === void 0) throw new Error("A is used but it is missing a `show={true | false}` prop."); let [p, m] = b.useState(t ? "visible" : "hidden"), f = Tv(() => { t || m("hidden"); }), [h, v] = b.useState(!0), R = b.useRef([t]); Ee(() => { h !== !1 && R.current[R.current.length - 1] !== t && (R.current.push(t), v(!1)); }, [R, t]); let w = b.useMemo(() => ({ show: t, appear: i, initial: h }), [t, i, h]); Ee(() => { t ? m("visible") : !t7(f) && c.current !== null && m("hidden"); }, [t, f]); let M = { unmount: s }, N = C1(() => { var P; h && v(!1), (P = n.beforeEnter) == null || P.call(n); }), D = C1(() => { var P; h && v(!1), (P = n.beforeLeave) == null || P.call(n); }), A = ze(); return N2.createElement(e7.Provider, { value: f }, N2.createElement(J6.Provider, { value: w }, A({ ourProps: { ...M, as: b.Fragment, children: N2.createElement(bv, { ref: L, ...M, ...l, beforeEnter: N, beforeLeave: D }) }, theirProps: {}, defaultTag: b.Fragment, features: Rv, visible: p === "visible", name: "Transition" }))); } function Pz(n, e) { let t = b.useContext(J6) !== null, i = X6() !== null; return N2.createElement(N2.Fragment, null, !t && i ? N2.createElement(gc, { ref: e, ...n }) : N2.createElement(bv, { ref: e, ...n })); } let gc = be(kz), bv = be(Dz), rn = be(Pz), xv = Object.assign(gc, { Child: rn, Root: gc }); var Fz = ((n) => (n[n.Open = 0] = "Open", n[n.Closed = 1] = "Closed", n))(Fz || {}), Uz = ((n) => (n[n.SetTitleId = 0] = "SetTitleId", n))(Uz || {}); let Zz = { 0(n, e) { return n.titleId === e.id ? n : { ...n, titleId: e.id }; } }, Ku = b.createContext(null); Ku.displayName = "DialogContext"; function n7(n) { let e = b.useContext(Ku); if (e === null) { let t = new Error(`<${n} /> is missing a parent component.`); throw Error.captureStackTrace && Error.captureStackTrace(t, n7), t; } return e; } function Bz(n, e) { return O4(e.type, Zz, n, e); } let hp = be(function(n, e) { let t = b.useId(), { id: i = `headlessui-dialog-${t}`, open: s, onClose: l, initialFocus: c, role: d = "dialog", autoFocus: L = !0, __demoMode: _ = !1, unmount: p = !1, ...m } = n, f = b.useRef(!1); d = (function() { return d === "dialog" || d === "alertdialog" ? d : (f.current || (f.current = !0, console.warn(`Invalid role [${d}] passed to . Only \`dialog\` and and \`alertdialog\` are supported. Using \`dialog\` instead.`)), "dialog"); })(); let h = X6(); s === void 0 && h !== null && (s = (h & C4.Open) === C4.Open); let v = b.useRef(null), R = p3(v, e), w = q6(v), M = s ? 0 : 1, [N, D] = b.useReducer(Bz, { titleId: null, descriptionId: null, panelRef: b.createRef() }), A = C1(() => l(!1)), P = C1((V) => D({ type: 0, id: V })), W = fn() ? M === 0 : !1, [k, B] = pz(), Q = { get current() { var V; return (V = N.panelRef.current) != null ? V : v.current; } }, n2 = hv(), { resolveContainers: a2 } = Sz({ mainTreeNode: n2, portals: k, defaultContainers: [Q] }), r2 = h !== null ? (h & C4.Closing) === C4.Closing : !1; JB(_ || r2 ? !1 : W, { allowed: C1(() => { var V, i2; return [(i2 = (V = v.current) == null ? void 0 : V.closest("[data-headlessui-portal]")) != null ? i2 : null]; }), disallowed: C1(() => { var V; return [(V = n2 == null ? void 0 : n2.closest("body > *:not(#headlessui-portal-root)")) != null ? V : null]; }) }); let _2 = qT.get(null); Ee(() => { if (W) return _2.actions.push(i), () => _2.actions.pop(i); }, [_2, i, W]); let I2 = WT(_2, b.useCallback((V) => _2.selectors.isTop(V, i), [_2, i])); uG(I2, a2, (V) => { V.preventDefault(), A(); }), fz(I2, w == null ? void 0 : w.defaultView, (V) => { V.preventDefault(), V.stopPropagation(), document.activeElement && "blur" in document.activeElement && typeof document.activeElement.blur == "function" && document.activeElement.blur(), A(); }), hG(_ || r2 ? !1 : W, w, a2), eG(W, v, A); let [H, O] = Yu(), Z = b.useMemo(() => [{ dialogState: M, close: A, setTitleId: P, unmount: p }, N], [M, N, A, P, p]), G = b.useMemo(() => ({ open: M === 0 }), [M]), C2 = { ref: R, id: i, role: d, tabIndex: -1, "aria-modal": _ ? void 0 : M === 0 ? !0 : void 0, "aria-labelledby": N.titleId, "aria-describedby": H, unmount: p }, y = !Ez(), J = E9.None; W && !_ && (J |= E9.RestoreFocus, J |= E9.TabLock, L && (J |= E9.AutoFocus), y && (J |= E9.InitialFocus)); let s2 = ze(); return N2.createElement(oz, null, N2.createElement(pp, { force: !0 }, N2.createElement(hz, null, N2.createElement(Ku.Provider, { value: Z }, N2.createElement(pv, { target: v }, N2.createElement(pp, { force: !1 }, N2.createElement(O, { slot: G }, N2.createElement(B, null, N2.createElement(xz, { initialFocus: c, initialFocusFallback: v, containers: a2, features: J }, N2.createElement(FB, { value: A }, s2({ ourProps: C2, theirProps: m, slot: G, defaultTag: Gz, features: zz, visible: M === 0, name: "Dialog" }))))))))))); }), Gz = "div", zz = d6.RenderStrategy | d6.Static; function Hz(n, e) { let { transition: t = !1, open: i, ...s } = n, l = X6(), c = n.hasOwnProperty("open") || l !== null, d = n.hasOwnProperty("onClose"); if (!c && !d) throw new Error("You have to provide an `open` and an `onClose` prop to the `Dialog` component."); if (!c) throw new Error("You provided an `onClose` prop to the `Dialog`, but forgot an `open` prop."); if (!d) throw new Error("You provided an `open` prop to the `Dialog`, but forgot an `onClose` prop."); if (!l && typeof n.open != "boolean") throw new Error(`You provided an \`open\` prop to the \`Dialog\`, but the value is not a boolean. Received: ${n.open}`); if (typeof n.onClose != "function") throw new Error(`You provided an \`onClose\` prop to the \`Dialog\`, but the value is not a function. Received: ${n.onClose}`); return (i !== void 0 || t) && !s.static ? N2.createElement(mp, null, N2.createElement(xv, { show: i, transition: t, unmount: s.unmount }, N2.createElement(hp, { ref: e, ...s }))) : N2.createElement(mp, null, N2.createElement(hp, { ref: e, open: i, ...s })); } let Yz = "div"; function Vz(n, e) { let t = b.useId(), { id: i = `headlessui-dialog-panel-${t}`, transition: s = !1, ...l } = n, [{ dialogState: c, unmount: d }, L] = n7("Dialog.Panel"), _ = p3(e, L.panelRef), p = b.useMemo(() => ({ open: c === 0 }), [c]), m = C1((w) => { w.stopPropagation(); }), f = { ref: _, id: i, onClick: m }, h = s ? rn : b.Fragment, v = s ? { unmount: d } : {}, R = ze(); return N2.createElement(h, { ...v }, R({ ourProps: f, theirProps: l, slot: p, defaultTag: Yz, name: "Dialog.Panel" })); } let qz = "div"; function Wz(n, e) { let { transition: t = !1, ...i } = n, [{ dialogState: s, unmount: l }] = n7("Dialog.Backdrop"), c = b.useMemo(() => ({ open: s === 0 }), [s]), d = { ref: e, "aria-hidden": !0 }, L = t ? rn : b.Fragment, _ = t ? { unmount: l } : {}, p = ze(); return N2.createElement(L, { ..._ }, p({ ourProps: d, theirProps: i, slot: c, defaultTag: qz, name: "Dialog.Backdrop" })); } let $z = "h2"; function Kz(n, e) { let t = b.useId(), { id: i = `headlessui-dialog-title-${t}`, ...s } = n, [{ dialogState: l, setTitleId: c }] = n7("Dialog.Title"), d = p3(e); b.useEffect(() => (c(i), () => c(null)), [i, c]); let L = b.useMemo(() => ({ open: l === 0 }), [l]), _ = { ref: d, id: i }; return ze()({ ourProps: _, theirProps: s, slot: L, defaultTag: $z, name: "Dialog.Title" }); } let Qz = be(Hz), wv = be(Vz); be(Wz); let Mv = be(Kz), jz = Object.assign(Qz, { Panel: wv, Title: Mv, Description: UT }); var Xz = ((n) => (n[n.RegisterOption = 0] = "RegisterOption", n[n.UnregisterOption = 1] = "UnregisterOption", n))(Xz || {}); let Jz = { 0(n, e) { let t = [...n.options, { id: e.id, element: e.element, propsRef: e.propsRef }]; return { ...n, options: KT(t, (i) => i.element.current) }; }, 1(n, e) { let t = n.options.slice(), i = n.options.findIndex((s) => s.id === e.id); return i === -1 ? n : (t.splice(i, 1), { ...n, options: t }); } }, Qu = b.createContext(null); Qu.displayName = "RadioGroupDataContext"; function ju(n) { let e = b.useContext(Qu); if (e === null) { let t = new Error(`<${n} /> is missing a parent component.`); throw Error.captureStackTrace && Error.captureStackTrace(t, ju), t; } return e; } let Xu = b.createContext(null); Xu.displayName = "RadioGroupActionsContext"; function Ju(n) { let e = b.useContext(Xu); if (e === null) { let t = new Error(`<${n} /> is missing a parent component.`); throw Error.captureStackTrace && Error.captureStackTrace(t, Ju), t; } return e; } function eH(n, e) { return O4(e.type, Jz, n, e); } let tH = "div"; function nH(n, e) { let t = b.useId(), i = H6(), { id: s = `headlessui-radiogroup-${t}`, value: l, form: c, name: d, onChange: L, by: _, disabled: p = i || !1, defaultValue: m, tabIndex: f = 0, ...h } = n, v = ZB(_), [R, w] = b.useReducer(eH, { options: [] }), M = R.options, [N, D] = GT(), [A, P] = Yu(), W = b.useRef(null), k = p3(W, e), B = _B(m), [Q, n2] = CB(l, L, B), a2 = b.useMemo(() => M.find((s2) => !s2.propsRef.current.disabled), [M]), r2 = b.useMemo(() => M.some((s2) => v(s2.propsRef.current.value, Q)), [M, Q]), _2 = C1((s2) => { var V; if (p || v(s2, Q)) return !1; let i2 = (V = M.find((g2) => v(g2.propsRef.current.value, s2))) == null ? void 0 : V.propsRef.current; return i2 != null && i2.disabled ? !1 : (n2 == null || n2(s2), !0); }), I2 = C1((s2) => { let V = W.current; if (!V) return; let i2 = pn(V), g2 = M.filter((E2) => E2.propsRef.current.disabled === !1).map((E2) => E2.element.current); switch (s2.key) { case Zt.Enter: gB(s2.currentTarget); break; case Zt.ArrowLeft: case Zt.ArrowUp: if (s2.preventDefault(), s2.stopPropagation(), v9(g2, I3.Previous | I3.WrapAround) === tn.Success) { let E2 = M.find((D2) => D2.element.current === (i2 == null ? void 0 : i2.activeElement)); E2 && _2(E2.propsRef.current.value); } break; case Zt.ArrowRight: case Zt.ArrowDown: if (s2.preventDefault(), s2.stopPropagation(), v9(g2, I3.Next | I3.WrapAround) === tn.Success) { let E2 = M.find((D2) => D2.element.current === (i2 == null ? void 0 : i2.activeElement)); E2 && _2(E2.propsRef.current.value); } break; case Zt.Space: { s2.preventDefault(), s2.stopPropagation(); let E2 = M.find((D2) => D2.element.current === (i2 == null ? void 0 : i2.activeElement)); E2 && _2(E2.propsRef.current.value); } break; } }), H = C1((s2) => (w({ type: 0, ...s2 }), () => w({ type: 1, id: s2.id }))), O = b.useMemo(() => ({ value: Q, firstOption: a2, containsCheckedOption: r2, disabled: p, compare: v, tabIndex: f, ...R }), [Q, a2, r2, p, v, f, R]), Z = b.useMemo(() => ({ registerOption: H, change: _2 }), [H, _2]), G = { ref: k, id: s, role: "radiogroup", "aria-labelledby": N, "aria-describedby": A, onKeyDown: I2 }, C2 = b.useMemo(() => ({ value: Q }), [Q]), y = b.useCallback(() => { if (B !== void 0) return _2(B); }, [_2, B]), J = ze(); return N2.createElement(P, { name: "RadioGroup.Description" }, N2.createElement(D, { name: "RadioGroup.Label" }, N2.createElement(Xu.Provider, { value: Z }, N2.createElement(Qu.Provider, { value: O }, d != null && N2.createElement(EB, { disabled: p, data: { [d]: Q || "on" }, overrides: { type: "radio", checked: Q != null }, form: c, onReset: y }), J({ ourProps: G, theirProps: h, slot: C2, defaultTag: tH, name: "RadioGroup" }))))); } let iH = "div"; function rH(n, e) { var t; let i = ju("RadioGroup.Option"), s = Ju("RadioGroup.Option"), l = b.useId(), { id: c = `headlessui-radiogroup-option-${l}`, value: d, disabled: L = i.disabled || !1, autoFocus: _ = !1, ...p } = n, m = b.useRef(null), f = p3(m, e), [h, v] = GT(), [R, w] = Yu(), M = ot({ value: d, disabled: L }); Ee(() => s.registerOption({ id: c, element: m, propsRef: M }), [c, s, m, M]); let N = C1((r2) => { var _2; if (kT(r2.currentTarget)) return r2.preventDefault(); s.change(d) && ((_2 = m.current) == null || _2.focus()); }), D = ((t = i.firstOption) == null ? void 0 : t.id) === c, { isFocusVisible: A, focusProps: P } = bT({ autoFocus: _ }), { isHovered: W, hoverProps: k } = RT({ isDisabled: L }), B = i.compare(i.value, d), Q = wT({ ref: f, id: c, role: "radio", "aria-checked": B ? "true" : "false", "aria-labelledby": h, "aria-describedby": R, "aria-disabled": L ? !0 : void 0, tabIndex: L ? -1 : B || !i.containsCheckedOption && D ? i.tabIndex : -1, onClick: L ? void 0 : N, autoFocus: _ }, P, k), n2 = b.useMemo(() => ({ checked: B, disabled: L, active: A, hover: W, focus: A, autofocus: _ }), [B, L, W, A, _]), a2 = ze(); return N2.createElement(w, { name: "RadioGroup.Description" }, N2.createElement(v, { name: "RadioGroup.Label" }, a2({ ourProps: Q, theirProps: p, slot: n2, defaultTag: iH, name: "RadioGroup.Option" }))); } let aH = "span"; function sH(n, e) { var t; let i = ju("Radio"), s = Ju("Radio"), l = b.useId(), c = NT(), d = H6(), { id: L = c || `headlessui-radio-${l}`, value: _, disabled: p = i.disabled || d || !1, autoFocus: m = !1, ...f } = n, h = b.useRef(null), v = p3(h, e), R = BT(), w = AB(), M = ot({ value: _, disabled: p }); Ee(() => s.registerOption({ id: L, element: h, propsRef: M }), [L, s, h, M]); let N = C1((a2) => { var r2; if (kT(a2.currentTarget)) return a2.preventDefault(); s.change(_) && ((r2 = h.current) == null || r2.focus()); }), { isFocusVisible: D, focusProps: A } = bT({ autoFocus: m }), { isHovered: P, hoverProps: W } = RT({ isDisabled: p }), k = ((t = i.firstOption) == null ? void 0 : t.id) === L, B = i.compare(i.value, _), Q = wT({ ref: v, id: L, role: "radio", "aria-checked": B ? "true" : "false", "aria-labelledby": R, "aria-describedby": w, "aria-disabled": p ? !0 : void 0, tabIndex: p ? -1 : B || !i.containsCheckedOption && k ? i.tabIndex : -1, autoFocus: m, onClick: p ? void 0 : N }, A, W), n2 = b.useMemo(() => ({ checked: B, disabled: p, hover: P, focus: D, autofocus: m }), [B, p, P, D, m]); return ze()({ ourProps: Q, theirProps: f, slot: n2, defaultTag: aH, name: "Radio" }); } let oH = be(nH), lH = be(rH), Av = be(sH), cH = dc, uH = UT, dH = Object.assign(oH, { Option: lH, Radio: Av, Label: cH, Description: uH }); class LH { constructor() { h2(this, "events", {}); } on(e, t) { this.events[e] || (this.events[e] = /* @__PURE__ */ new Set()), console.debug(`Event ${e} ${t} added`), console.debug(this.events), this.events[e].add(t); } off(e, t) { var i; console.debug(`Event ${e} ${t} removed`), console.debug(this.events), (i = this.events[e]) == null || i.delete(t); } emit(e, t) { const i = this.events[e]; i && i.forEach((s) => s(t)); } } const i7 = new LH(); function CH(n, e, t, i) { const s = { label: JSON.stringify(e), action: t, category: i }; n.get(HS)("eventEmit", { event: "trackEvent", data: s }), i7.emit("trackEvent", s); } const _H = ` `, gH = ` `, pH = ` `, mH = ` `, fp = [ { name: "Legacy", id: "theme-default", icon: _H }, { name: "Clear Light", id: "theme-clean-light", icon: gH }, { name: "Clear Dark", id: "theme-clean-dark", icon: pH }, { name: "Neon Dark", id: "theme-neon", icon: mH } ], hH = () => { const [n, e] = b.useState(!1), [t = fp[0].id, i] = L4(g0), [s, l] = L4( Jl ), [c, d] = L4(RM), L = (h) => { CH( { theme: t, enableScopedTheming: s }, h, "sequence" ); }, _ = () => { e(!0), d(""), L("theme-open-modal"); }, p = () => { e(!1), L("theme-close-modal"); }, m = (h) => { i(h), L("theme-select"); }, f = (h) => { l(h), L("theme-enable-scoped"); }; return /* @__PURE__ */ S.jsxs(S.Fragment, { children: [ /* @__PURE__ */ S.jsxs( "button", { type: "button", className: "flex items-center relative", onClick: _, children: [ /* @__PURE__ */ S.jsx(fe, { name: "theme" }), c && /* @__PURE__ */ S.jsx("span", { className: "dot absolute top-0 right-0 w-1 h-1 rounded-full bg-red-500" }) ] } ), /* @__PURE__ */ S.jsx(xv, { show: n, children: /* @__PURE__ */ S.jsxs( jz, { className: "relative z-10", onClick: p, onClose: p, children: [ /* @__PURE__ */ S.jsx( rn, { enter: "duration-300 ease-out", enterFrom: "opacity-0", enterTo: "opacity-100", leave: "duration-200 ease-in", leaveFrom: "opacity-100", leaveTo: "opacity-0", children: /* @__PURE__ */ S.jsx("div", { className: "fixed inset-0 bg-black bg-opacity-25" }) } ), /* @__PURE__ */ S.jsx("div", { className: "fixed inset-0 overflow-y-auto", children: /* @__PURE__ */ S.jsx("div", { className: "flex min-h-full items-center justify-center p-4 text-center", children: /* @__PURE__ */ S.jsx( rn, { enter: "duration-300 ease-out", enterFrom: "opacity-0 scale-95", enterTo: "opacity-100 scale-100", leave: "duration-200 ease-in", leaveFrom: "opacity-100 scale-100", leaveTo: "opacity-0 scale-95", children: /* @__PURE__ */ S.jsxs(wv, { className: "w-full max-w-md transform overflow-hidden rounded-2xl bg-white py-6 text-left align-middle shadow-xl transition-all", children: [ /* @__PURE__ */ S.jsxs("div", { className: "px-6 w-[450px]", children: [ /* @__PURE__ */ S.jsx( Mv, { as: "h3", className: "text-lg font-semibold leading-6 text-gray-900", children: "Theme" } ), /* @__PURE__ */ S.jsx("p", { className: "text-gray-500 text-sm", children: "Customize your UI theme" }), /* @__PURE__ */ S.jsx("div", { className: "mt-4 ml-[-0.5rem] px-2 max-h-72 overflow-y-auto pb-4", children: /* @__PURE__ */ S.jsxs(dH, { value: t, onChange: m, children: [ /* @__PURE__ */ S.jsx(dc, { className: "sr-only", children: "Server size" }), /* @__PURE__ */ S.jsx("div", { className: "space-y-2", children: fp.map((h) => /* @__PURE__ */ S.jsx(Av, { value: h.id, children: /* @__PURE__ */ S.jsxs( "div", { className: (H2( t === h.id ? "border-2 text-gray-900 border-primary" : "border-2 border-transparent" ), "relative flex items-center cursor-pointer rounded-lg px-4 py-3 shadow-md"), children: [ /* @__PURE__ */ S.jsxs("div", { className: "flex w-full items-center text-sm text-gray-900", children: [ t === h.id ? /* @__PURE__ */ S.jsx( fe, { name: "selected-cycle", className: "h-5 w-5 fill-none" } ) : /* @__PURE__ */ S.jsx( fe, { name: "non-selected-cycle", className: "h-5 w-5" } ), /* @__PURE__ */ S.jsx( dc, { as: "p", className: H2( (t === h.id, "text-gray-900"), "font-medium ml-2" ), children: h.name } ) ] }), /* @__PURE__ */ S.jsx( "span", { className: "inline-block w-20 border rounded-md overflow-hidden", dangerouslySetInnerHTML: { __html: h.icon } } ) ] } ) }, h.id)) }) ] }) }) ] }), /* @__PURE__ */ S.jsxs("div", { className: "pt-6 px-6 border-t flex items-center gap-2", children: [ /* @__PURE__ */ S.jsx( "input", { type: "checkbox", id: "scopeTheming", checked: s, onChange: (h) => f(h.target.checked) } ), /* @__PURE__ */ S.jsx("label", { htmlFor: "scopeTheming", className: "select-none", children: "Apply to this diagram only" }) ] }) ] }) } ) }) }) ] } ) }) ] }); }; function an(n) { return [n.Origin() || Be, ...Cn(n).Names()]; } const fH = K.tree.ParseTreeWalker.DEFAULT; class r7 extends X { constructor(t) { super(); h2(this, "_orderedParticipants"); h2(this, "frameRoot", null); h2(this, "parents", []); this._orderedParticipants = t; } // TODO: extract a module to get local participants getLocalParticipants(t) { return [ t.Origin() || Be, ...Cn(t).ImplicitArray().map((i) => i.name) ]; } getLeft(t) { const i = an(t); return this._orderedParticipants.find((s) => i.includes(s)) || ""; } getRight(t) { return this._orderedParticipants.slice().reverse().find((i) => an(t).includes(i)) || ""; } enterFragment(t, i) { var l; const s = { type: i, left: this.getLeft(t), right: this.getRight(t), children: [] }; this.frameRoot || (this.frameRoot = s), this.parents.length > 0 && ((l = this.parents[this.parents.length - 1].children) == null || l.push(s)), this.parents.push(s); } exitFragment() { this.parents.pop(); } enterTcf(t) { this.enterFragment(t, "tcf"); } enterOpt(t) { this.enterFragment(t, "opt"); } enterPar(t) { this.enterFragment(t, "par"); } enterAlt(t) { this.enterFragment(t, "alt"); } enterLoop(t) { this.enterFragment(t, "loop"); } enterSection(t) { this.enterFragment(t, "section"); } enterCritical(t) { this.enterFragment(t, "critical"); } enterRef(t) { this.enterFragment(t, "ref"); } exitTcf() { this.exitFragment(); } exitOpt() { this.exitFragment(); } exitPar() { this.exitFragment(); } exitAlt() { this.exitFragment(); } exitLoop() { this.exitFragment(); } exitSection() { this.exitFragment(); } exitCritical() { this.exitFragment(); } exitRef() { this.exitFragment(); } getFrame(t) { return t.children.map((i) => { fH.walk(this, i); }), this.frameRoot; } } function pc(n, e) { if (!n.children || n.children.length === 0) return 1; let t = 0; for (const i of n.children) e === "LEFT" && i.left !== n.left || e === "RIGHT" && i.right !== n.right || (t = Math.max(t, pc(i, e))); return t + 1; } function a7(n) { return n ? { type: n.type, left: pg * pc( n, "LEFT" /* LEFT */ ), right: pg * pc( n, "RIGHT" /* RIGHT */ ) } : { left: 0, right: 0 }; } function yv(n, e) { const t = e.orderedParticipantNames(), i = an(n), s = t.find((m) => i.includes(m)) || "", l = t.slice().reverse().find((m) => i.includes(m)) || "", d = new r7(t).getFrame(n), L = a7(d), _ = EH( n, l, e ), p = e.distance(s, l) + e.half(s) + e.half(l); return Math.max(p, kS) + L.left + L.right + _; } function EH(n, e, t) { const s = F6(n).filter((l) => l.from === l.to).map( (l) => t.getMessageWidth(l) - t.distance(l.from || Be, e) - t.half(e) ); return Math.max.apply(null, [0, ...s]); } function SH() { const [n, e] = b.useState(0), [t, i] = b.useState(0), s = () => { e(document.documentElement.scrollTop), i(document.documentElement.scrollLeft); }; return b.useEffect(() => { s(); const l = new AbortController(); return document.addEventListener("scroll", s, { signal: l.signal }), () => { l.abort(); }; }, []), [n, t]; } const mc = 10, TH = 1, Ep = 20; function vH() { let n = document.getElementById( "zenuml-intersection-detector-container" ), e = Array.from( document.getElementsByClassName("zenuml-intersection-detector") ); return n && e.length === mc ? { detectorContainer: n, detectors: e } : (n = document.createElement("div"), n.id = "zenuml-intersection-detector-container", Object.assign(n.style, { position: "absolute", top: "0", left: "0", opacity: "0", pointerEvents: "none" }), e = new Array(mc).fill(0).map(() => { const t = document.createElement("div"); return t.className = "zenuml-intersection-detector", Object.assign(t.style, { position: "absolute", top: "0", left: "0", width: "100%" }), n == null || n.appendChild(t), t; }), document.body.appendChild(n), { detectorContainer: n, detectors: e }); } function RH() { const [n, e] = b.useState(0), t = b.useRef(null); return b.useEffect(() => { const { detectorContainer: i, detectors: s } = vH(), l = document.documentElement.scrollHeight - Ep, c = document.documentElement.scrollWidth - Ep; i.style.height = l + "px", i.style.width = c + "px"; const d = Math.ceil( document.documentElement.scrollHeight / mc ), L = [...Array(d + 1).keys()].map((_) => _ / d).filter((_) => _ >= 0 && _ <= 1); return s.forEach((_, p) => { _.style.top = p * d + "px", _.style.height = d + "px"; }), t.current = new IntersectionObserver( ([_]) => { (_.intersectionRect.top - _.boundingClientRect.top > TH || _.target === s[0]) && e(_.intersectionRect.top); }, { threshold: L } ), s.forEach((_) => { t.current && t.current.observe(_); }), () => { var _; (_ = t.current) == null || _.disconnect(); }; }, []), n; } const K5 = { aliceblue: [240, 248, 255], antiquewhite: [250, 235, 215], aqua: [0, 255, 255], aquamarine: [127, 255, 212], azure: [240, 255, 255], beige: [245, 245, 220], bisque: [255, 228, 196], black: [0, 0, 0], blanchedalmond: [255, 235, 205], blue: [0, 0, 255], blueviolet: [138, 43, 226], brown: [165, 42, 42], burlywood: [222, 184, 135], cadetblue: [95, 158, 160], chartreuse: [127, 255, 0], chocolate: [210, 105, 30], coral: [255, 127, 80], cornflowerblue: [100, 149, 237], cornsilk: [255, 248, 220], crimson: [220, 20, 60], cyan: [0, 255, 255], darkblue: [0, 0, 139], darkcyan: [0, 139, 139], darkgoldenrod: [184, 134, 11], darkgray: [169, 169, 169], darkgreen: [0, 100, 0], darkgrey: [169, 169, 169], darkkhaki: [189, 183, 107], darkmagenta: [139, 0, 139], darkolivegreen: [85, 107, 47], darkorange: [255, 140, 0], darkorchid: [153, 50, 204], darkred: [139, 0, 0], darksalmon: [233, 150, 122], darkseagreen: [143, 188, 143], darkslateblue: [72, 61, 139], darkslategray: [47, 79, 79], darkslategrey: [47, 79, 79], darkturquoise: [0, 206, 209], darkviolet: [148, 0, 211], deeppink: [255, 20, 147], deepskyblue: [0, 191, 255], dimgray: [105, 105, 105], dimgrey: [105, 105, 105], dodgerblue: [30, 144, 255], firebrick: [178, 34, 34], floralwhite: [255, 250, 240], forestgreen: [34, 139, 34], fuchsia: [255, 0, 255], gainsboro: [220, 220, 220], ghostwhite: [248, 248, 255], gold: [255, 215, 0], goldenrod: [218, 165, 32], gray: [128, 128, 128], green: [0, 128, 0], greenyellow: [173, 255, 47], grey: [128, 128, 128], honeydew: [240, 255, 240], hotpink: [255, 105, 180], indianred: [205, 92, 92], indigo: [75, 0, 130], ivory: [255, 255, 240], khaki: [240, 230, 140], lavender: [230, 230, 250], lavenderblush: [255, 240, 245], lawngreen: [124, 252, 0], lemonchiffon: [255, 250, 205], lightblue: [173, 216, 230], lightcoral: [240, 128, 128], lightcyan: [224, 255, 255], lightgoldenrodyellow: [250, 250, 210], lightgray: [211, 211, 211], lightgreen: [144, 238, 144], lightgrey: [211, 211, 211], lightpink: [255, 182, 193], lightsalmon: [255, 160, 122], lightseagreen: [32, 178, 170], lightskyblue: [135, 206, 250], lightslategray: [119, 136, 153], lightslategrey: [119, 136, 153], lightsteelblue: [176, 196, 222], lightyellow: [255, 255, 224], lime: [0, 255, 0], limegreen: [50, 205, 50], linen: [250, 240, 230], magenta: [255, 0, 255], maroon: [128, 0, 0], mediumaquamarine: [102, 205, 170], mediumblue: [0, 0, 205], mediumorchid: [186, 85, 211], mediumpurple: [147, 112, 219], mediumseagreen: [60, 179, 113], mediumslateblue: [123, 104, 238], mediumspringgreen: [0, 250, 154], mediumturquoise: [72, 209, 204], mediumvioletred: [199, 21, 133], midnightblue: [25, 25, 112], mintcream: [245, 255, 250], mistyrose: [255, 228, 225], moccasin: [255, 228, 181], navajowhite: [255, 222, 173], navy: [0, 0, 128], oldlace: [253, 245, 230], olive: [128, 128, 0], olivedrab: [107, 142, 35], orange: [255, 165, 0], orangered: [255, 69, 0], orchid: [218, 112, 214], palegoldenrod: [238, 232, 170], palegreen: [152, 251, 152], paleturquoise: [175, 238, 238], palevioletred: [219, 112, 147], papayawhip: [255, 239, 213], peachpuff: [255, 218, 185], peru: [205, 133, 63], pink: [255, 192, 203], plum: [221, 160, 221], powderblue: [176, 224, 230], purple: [128, 0, 128], rebeccapurple: [102, 51, 153], red: [255, 0, 0], rosybrown: [188, 143, 143], royalblue: [65, 105, 225], saddlebrown: [139, 69, 19], salmon: [250, 128, 114], sandybrown: [244, 164, 96], seagreen: [46, 139, 87], seashell: [255, 245, 238], sienna: [160, 82, 45], silver: [192, 192, 192], skyblue: [135, 206, 235], slateblue: [106, 90, 205], slategray: [112, 128, 144], slategrey: [112, 128, 144], snow: [255, 250, 250], springgreen: [0, 255, 127], steelblue: [70, 130, 180], tan: [210, 180, 140], teal: [0, 128, 128], thistle: [216, 191, 216], tomato: [255, 99, 71], turquoise: [64, 224, 208], violet: [238, 130, 238], wheat: [245, 222, 179], white: [255, 255, 255], whitesmoke: [245, 245, 245], yellow: [255, 255, 0], yellowgreen: [154, 205, 50] }, Nv = /* @__PURE__ */ Object.create(null); for (const n in K5) Object.hasOwn(K5, n) && (Nv[K5[n]] = n); const je = { to: {}, get: {} }; je.get = function(n) { const e = n.slice(0, 3).toLowerCase(); let t, i; switch (e) { case "hsl": { t = je.get.hsl(n), i = "hsl"; break; } case "hwb": { t = je.get.hwb(n), i = "hwb"; break; } default: { t = je.get.rgb(n), i = "rgb"; break; } } return t ? { model: i, value: t } : null; }; je.get.rgb = function(n) { if (!n) return null; const e = /^#([a-f\d]{3,4})$/i, t = /^#([a-f\d]{6})([a-f\d]{2})?$/i, i = /^rgba?$\s*([+-]?\d+)(?=[\s,])\s*(?:,\s*)?([+-]?\d+)(?=[\s,])\s*(?:,\s*)?([+-]?\d+)\s*(?:[\s,|/]\s*([+-]?[\d.]+)(%?)\s*)?$$/, s = /^rgba?$\s*([+-]?[\d.]+)%\s*,?\s*([+-]?[\d.]+)%\s*,?\s*([+-]?[\d.]+)%\s*(?:[\s,|/]\s*([+-]?[\d.]+)(%?)\s*)?$$/, l = /^(\w+)$/; let c = [0, 0, 0, 1], d, L, _; if (d = n.match(t)) { for (_ = d[2], d = d[1], L = 0; L < 3; L++) { const p = L * 2; c[L] = Number.parseInt(d.slice(p, p + 2), 16); } _ && (c[3] = Number.parseInt(_, 16) / 255); } else if (d = n.match(e)) { for (d = d[1], _ = d[3], L = 0; L < 3; L++) c[L] = Number.parseInt(d[L] + d[L], 16); _ && (c[3] = Number.parseInt(_ + _, 16) / 255); } else if (d = n.match(i)) { for (L = 0; L < 3; L++) c[L] = Number.parseInt(d[L + 1], 10); d[4] && (c[3] = d[5] ? Number.parseFloat(d[4]) * 0.01 : Number.parseFloat(d[4])); } else if (d = n.match(s)) { for (L = 0; L < 3; L++) c[L] = Math.round(Number.parseFloat(d[L + 1]) * 2.55); d[4] && (c[3] = d[5] ? Number.parseFloat(d[4]) * 0.01 : Number.parseFloat(d[4])); } else return (d = n.match(l)) ? d[1] === "transparent" ? [0, 0, 0, 0] : Object.hasOwn(K5, d[1]) ? (c = K5[d[1]], c[3] = 1, c) : null : null; for (L = 0; L < 3; L++) c[L] = Vt(c[L], 0, 255); return c[3] = Vt(c[3], 0, 1), c; }; je.get.hsl = function(n) { if (!n) return null; const e = /^hsla?$\s*([+-]?(?:\d{0,3}\.)?\d+)(?:deg)?\s*,?\s*([+-]?[\d.]+)%\s*,?\s*([+-]?[\d.]+)%\s*(?:[,|/]\s*([+-]?(?=\.\d|\d)(?:0|[1-9]\d*)?(?:\.\d*)?(?:[eE][+-]?\d+)?)\s*)?$$/, t = n.match(e); if (t) { const i = Number.parseFloat(t[4]), s = (Number.parseFloat(t[1]) % 360 + 360) % 360, l = Vt(Number.parseFloat(t[2]), 0, 100), c = Vt(Number.parseFloat(t[3]), 0, 100), d = Vt(Number.isNaN(i) ? 1 : i, 0, 1); return [s, l, c, d]; } return null; }; je.get.hwb = function(n) { if (!n) return null; const e = /^hwb$\s*([+-]?\d{0,3}(?:\.\d+)?)(?:deg)?\s*[\s,]\s*([+-]?[\d.]+)%\s*[\s,]\s*([+-]?[\d.]+)%\s*(?:[\s,]\s*([+-]?(?=\.\d|\d)(?:0|[1-9]\d*)?(?:\.\d*)?(?:[eE][+-]?\d+)?)\s*)?$$/, t = n.match(e); if (t) { const i = Number.parseFloat(t[4]), s = (Number.parseFloat(t[1]) % 360 + 360) % 360, l = Vt(Number.parseFloat(t[2]), 0, 100), c = Vt(Number.parseFloat(t[3]), 0, 100), d = Vt(Number.isNaN(i) ? 1 : i, 0, 1); return [s, l, c, d]; } return null; }; je.to.hex = function(...n) { return "#" + F8(n[0]) + F8(n[1]) + F8(n[2]) + (n[3] < 1 ? F8(Math.round(n[3] * 255)) : ""); }; je.to.rgb = function(...n) { return n.length < 4 || n[3] === 1 ? "rgb(" + Math.round(n[0]) + ", " + Math.round(n[1]) + ", " + Math.round(n[2]) + ")" : "rgba(" + Math.round(n[0]) + ", " + Math.round(n[1]) + ", " + Math.round(n[2]) + ", " + n[3] + ")"; }; je.to.rgb.percent = function(...n) { const e = Math.round(n[0] / 255 * 100), t = Math.round(n[1] / 255 * 100), i = Math.round(n[2] / 255 * 100); return n.length < 4 || n[3] === 1 ? "rgb(" + e + "%, " + t + "%, " + i + "%)" : "rgba(" + e + "%, " + t + "%, " + i + "%, " + n[3] + ")"; }; je.to.hsl = function(...n) { return n.length < 4 || n[3] === 1 ? "hsl(" + n[0] + ", " + n[1] + "%, " + n[2] + "%)" : "hsla(" + n[0] + ", " + n[1] + "%, " + n[2] + "%, " + n[3] + ")"; }; je.to.hwb = function(...n) { let e = ""; return n.length >= 4 && n[3] !== 1 && (e = ", " + n[3]), "hwb(" + n[0] + ", " + n[1] + "%, " + n[2] + "%" + e + ")"; }; je.to.keyword = function(...n) { return Nv[n.slice(0, 3)]; }; function Vt(n, e, t) { return Math.min(Math.max(e, n), t); } function F8(n) { const e = Math.round(n).toString(16).toUpperCase(); return e.length < 2 ? "0" + e : e; } function bH(n) { const e = je.get.rgb(n) || [0, 0, 0], [t, i, s] = e; return (t * 299 + i * 587 + s * 114) / 1e3; } function xH(n) { const e = je.get.rgb(n) || [0, 0, 0], [t, i, s] = e; return `rgb(${t}, ${i}, ${s})`; } function wH(n) { let e = 0, t = n; for (; t; ) e += t.offsetTop, t = t.offsetParent; return e; } const sn = /[!@#$%^&*()+-,.?''":{}|<>/\s]/, g6 = (n, e = {}) => { const { singleClick: t = !1, clickDelay: i = 300, showHoverHint: s = !0 } = e, [l, c] = b.useState(!1), [d, L] = b.useState(!1), _ = b.useRef(null), p = b.useRef(0), m = (A) => { A.preventDefault(), A.stopPropagation(), c(!0), setTimeout(() => { const P = A.target; if (!P) return; P.focus(); const W = document.createRange(); W.selectNodeContents(P), W.collapse(!1); const k = window.getSelection(); k && (k.removeAllRanges(), k.addRange(W)); }, 0); }; return { editing: l, isHovered: d, handleClick: t ? (A) => { l || t && (p.current++, _.current && clearTimeout(_.current), _.current = setTimeout(() => { p.current === 1 && m(A), p.current = 0; }, i)); } : void 0, handleDoubleClick: (A) => { l || (_.current && (clearTimeout(_.current), p.current = 0), m(A)); }, handleMouseEnter: () => { s && !l && L(!0); }, handleMouseLeave: () => { L(!1); }, handleBlur: (A) => { setTimeout(() => { l && (c(!1), L(!1), n(A)); }, 0); }, handleKeydown: (A) => { A.key === "Enter" && (A.preventDefault(), A.stopPropagation()); }, handleKeyup: (A) => { (A.key === "Enter" || A.key === "Escape" || A.key === "Tab") && (c(!1), L(!1), n(A)); }, getEditableClasses: (A = "") => { const P = [A, "editable-label-base"]; return l ? P.push("editable-label-editing") : d && s ? P.push("editable-label-hover") : P.push("cursor-pointer"), P.filter(Boolean).join(" "); } }; }, MH = ["Missing Constructor", "ZenUML"], AH = (n) => { const e = j2(at), [t, i] = L4(x9), s = j2(_n), l = (L) => function(_) { _.preventDefault(), _.stopPropagation(); const p = _.target; if (!(p instanceof HTMLElement)) return; let m = p.innerText.trim() ?? ""; if (m === "" || m === n.labelText) { p.innerText = n.labelText; return; } if (m.includes(" ") && (m = m.replace(/\s+/g, " ")), sn.test(m) && (m = m.replace(/"/g, ""), m = `"${m}"`, sn.lastIndex = 0), !L || L.length === 0) return; let f = t; for (const h of L) { const [v, R] = h; f = f.slice(0, v) + m + f.slice(R); } i(f), s(f); }, c = g6( l(n.labelPositions ?? []), { singleClick: !0, showHoverHint: !0 } ), d = g6( l(n.assigneePositions ?? []), { singleClick: !0, showHoverHint: !0 } ); return /* @__PURE__ */ S.jsxs("div", { className: "flex items-center justify-center", children: [ n.assignee && /* @__PURE__ */ S.jsxs(S.Fragment, { children: [ /* @__PURE__ */ S.jsx( "label", { title: "Click to edit", className: d.getEditableClasses( "name pl-1 leading-4 right" ), contentEditable: d.editing && e === J3.Dynamic, suppressContentEditableWarning: !0, onClick: d.handleClick, onDoubleClick: d.handleDoubleClick, onMouseEnter: d.handleMouseEnter, onMouseLeave: d.handleMouseLeave, onBlur: d.handleBlur, onKeyUp: d.handleKeyup, onKeyDown: d.handleKeydown, children: n.assignee } ), /* @__PURE__ */ S.jsx("span", { children: ":" }) ] }), /* @__PURE__ */ S.jsx( "label", { title: "Click to edit", className: c.getEditableClasses( H2( "name leading-4 right", n.assignee ? "pr-1" : "px-1" ) ), contentEditable: c.editing && e === J3.Dynamic && MH.indexOf(n.labelText) === -1, suppressContentEditableWarning: !0, onClick: c.handleClick, onDoubleClick: c.handleDoubleClick, onMouseEnter: c.handleMouseEnter, onMouseLeave: c.handleMouseLeave, onBlur: c.handleBlur, onKeyUp: c.handleKeyup, onKeyDown: c.handleKeydown, children: n.labelText } ) ] }); }, yH = 10, NH = (n) => { var N; const e = b.useRef(null), t = j2(at), i = j2(Z6), s = j2(Ou), l = j2(zS), c = j2(V8), d = b0(bM), L = RH(), [_] = SH(), p = n.entity.name === Be, m = Array.from( i.GetPositions(n.entity.name) ?? [] // Sort the label positions in descending order to avoid index shifting when updating code ).sort((D, A) => A[0] - D[0]), f = Array.from( i.GetAssigneePositions(n.entity.name) ?? [] // Sort the label positions in descending order to avoid index shifting when updating code ).sort((D, A) => A[0] - D[0]), h = () => { const D = n.offsetTop2 || 0; let A = L + _; L > yH && l && (A += l); const P = (s == null ? void 0 : s.clientHeight) || 0, W = s ? wH(s) : 0; return A < D + W ? 0 : Math.min(A - W, P - dM - 50) - D; }, v = t === J3.Static ? 0 : h(), R = n.entity.color ? xH(n.entity.color) : void 0, w = b.useMemo(() => { if (!n.entity.color) return; const D = e.current && window.getComputedStyle(e.current).getPropertyValue("background-color"); if (D) return bH(D) > 128 ? "#000" : "#fff"; }, [n.entity.color]), M = p ? rc.actor : rc[(N = n.entity.type) == null ? void 0 : N.toLowerCase()]; return /* @__PURE__ */ S.jsx( "div", { className: H2( "participant bg-skin-participant shadow-participant border-skin-participant text-skin-participant rounded text-base leading-4 flex flex-col justify-center z-10 h-10 top-8", { selected: c.includes(n.entity.name) } ), ref: e, style: { backgroundColor: p ? void 0 : R, color: p ? void 0 : w, transform: `translateY(${v}px)` }, onClick: () => d(n.entity.name), "data-participant-id": n.entity.name, children: /* @__PURE__ */ S.jsxs("div", { className: "flex items-center justify-center", children: [ M && /* @__PURE__ */ S.jsx( "div", { className: "h-6 w-6 mr-1 flex-shrink-0 [&>svg]:w-full [&>svg]:h-full", "aria-description": `icon for ${n.entity.name}`, dangerouslySetInnerHTML: { __html: M } } ), !p && /* @__PURE__ */ S.jsxs("div", { className: "h-5 group flex flex-col justify-center", children: [ n.entity.stereotype && /* @__PURE__ */ S.jsxs("label", { className: "interface leading-4", children: [ "«", n.entity.stereotype, "»" ] }), /* @__PURE__ */ S.jsx( AH, { labelText: n.entity.assignee ? n.entity.name.split(":")[1] : n.entity.label || n.entity.name, labelPositions: m, assignee: n.entity.assignee, assigneePositions: f } ) ] }) ] }) } ); }, j3 = (n, e) => { if (!e) return console.warn("[@zenuml/core] centerOf: entity is undefined"), 0; try { return n.getPosition(e) || 0; } catch (t) { return console.error(t), 0; } }, OH = (n, e, t) => !e || !t ? 0 : j3(n, t) - j3(n, e), U8 = Rc.child({ name: "LifeLine" }), W8 = (n) => { var m; const e = b.useRef(null), t = j2(ZS), i = j2(Ou), s = j2(t4), l = b0(ku), c = 20, [d, L] = b.useState(c), _ = j3(s, n.entity.name) - (n.groupLeft || 0), p = b.useCallback(() => { var R, w; const f = n.entity.name.replace( // eslint-disable-next-line no-useless-escape /([ #;&,.+*~\':"!^$[\]()=>|\/@])/g, "\\$1" ), h = i == null ? void 0 : i.querySelector( `[data-to="${f}"]` ), v = (h == null ? void 0 : h.offsetParent) != null; if (h && ((R = h.attributes["data-type"]) == null ? void 0 : R.value) === "creation" && v) { U8.debug(`First message to ${n.entity.name} is creation`); const M = ((w = e.current) == null ? void 0 : w.getBoundingClientRect().y) || 0, N = h.getBoundingClientRect().y; L((N - M) / t); } else U8.debug(`First message to ${n.entity.name} is not creation`), L(c); n.entity.name !== Be && setTimeout(() => { l( (M) => M.includes(n.entity.name) ? M : [...M, n.entity.name] ); }, 0); }, [i, n.entity.name, t]); return b.useEffect(() => { U8.debug(`LifeLine mounted/update for ${n.entity.name}`), setTimeout(() => { p(), U8.debug(`nextTick after updated for ${n.entity.name}`); }, 0), i7.on("participant_set_top", () => setTimeout(() => p(), 0)); }, [n.entity, p]), /* @__PURE__ */ S.jsxs( "div", { id: n.entity.name, "entity-type": (m = n.entity.type) == null ? void 0 : m.toLowerCase(), className: H2( "lifeline absolute flex flex-col h-full", { "transform -translate-x-1/2": n.renderParticipants }, n.className ), style: { paddingTop: d + "px", left: _ + "px" }, ref: e, children: [ n.renderParticipants && /* @__PURE__ */ S.jsx(NH, { entity: n.entity, offsetTop2: d }), n.renderLifeLine && /* @__PURE__ */ S.jsx("div", { className: "line w0 mx-auto flex-grow w-px bg-[linear-gradient(to_bottom,transparent_50%,var(--color-border-base)_50%)] bg-[length:1px_10px]" }) ] } ); }, Sp = 2, IH = (n) => { var c, d; const e = j2(t4), t = Cn(n.context).Array(); if (t.length <= 0) return null; const i = e.left(t[0].name) + Sp, s = e.right(t[t.length - 1].name) - Sp, l = (d = (c = n.context) == null ? void 0 : c.name()) == null ? void 0 : d.getFormattedText(); return /* @__PURE__ */ S.jsxs( "div", { className: H2( "lifeline-group-container absolute flex flex-col flex-grow h-full", { "outline-dashed outline-skin-primary": n.renderLifeLine } ), style: { left: `${i}px`, width: `${s - i}px` }, children: [ n.renderParticipants && l && /* @__PURE__ */ S.jsx("div", { className: "z-10 absolute flex items-center justify-center w-full bg-skin-frame", children: /* @__PURE__ */ S.jsx("span", { className: "font-semibold text-skin-lifeline-group-name", children: l }) }), /* @__PURE__ */ S.jsx("div", { className: "lifeline-group relative flex-grow", children: t.map((L) => /* @__PURE__ */ S.jsx( W8, { entity: L, groupLeft: i, renderLifeLine: n.renderLifeLine, renderParticipants: n.renderParticipants }, L.name )) }) ] } ); }, Kr = (n) => { var l; const e = j2(at), t = j2(t4), i = j2(Z6), s = b.useMemo(() => { const c = t.orderedParticipantNames(); return c.length === 0 ? null : c[0] === Be ? { ...CS, name: Be, explicit: !1, isStarter: !0 } : null; }, [t]); return /* @__PURE__ */ S.jsx( "div", { className: "life-line-layer lifeline-layer z-30 absolute h-full flex flex-col top-0 pt-2", "data-participant-names": "participantNames", style: { minWidth: e === J3.Dynamic ? "200px" : "auto", width: `calc(100% - ${n.leftGap}px)`, pointerEvents: n.renderParticipants ? "none" : "all" }, children: /* @__PURE__ */ S.jsxs("div", { className: "z-lifeline-container relative grow", children: [ s && !(s != null && s.explicit) && /* @__PURE__ */ S.jsx( W8, { entity: s, className: "starter", renderParticipants: n.renderParticipants, renderLifeLine: n.renderLifeLine } ), (((l = n.context) == null ? void 0 : l.children) || []).filter( (c) => c instanceof _g || c instanceof gg ).map((c, d) => /* @__PURE__ */ S.jsxs(b.Fragment, { children: [ c instanceof _g && /* @__PURE__ */ S.jsx( IH, { context: c, renderParticipants: n.renderParticipants, renderLifeLine: n.renderLifeLine }, d ), c instanceof gg && /* @__PURE__ */ S.jsx( W8, { entity: Cn(c).First(), renderParticipants: n.renderParticipants, renderLifeLine: n.renderLifeLine }, d ) ] }, d)), i.ImplicitArray().map((c) => /* @__PURE__ */ S.jsx( W8, { entity: c, renderParticipants: n.renderParticipants, renderLifeLine: n.renderLifeLine }, c.name )) ] }) } ); }, DH = (n) => { const e = { loop: "FragmentLoop", alt: "FragmentAlt", par: "FragmentPar", opt: "FragmentOpt", section: "FragmentSection", critical: "FragmentCritical", tcf: "FragmentTryCatchFinally", creation: "Creation", message: "Interaction", asyncMessage: "InteractionAsync", divider: "Divider", ret: "Return" }, t = Object.keys(e).find((i) => n[i]() !== null) || ""; return e[t]; }, p6 = (n) => n && n.stat() ? n.stat().filter((e) => DH(e) !== "Divider").length : 0, kH = (n, e) => { if (n) { const t = n.split("."); return t[t.length - 1] = Number(t[t.length - 1]) + e, t.join("."); } else return String(e); }; class Q5 { constructor(e, t) { this.position = e, this.layers = t; } /** * centerToEdge is used for translateX calculations. */ centerToEdge(e) { return e.rightEdgeOfRightWall() - this.centerOfRightWall(); } centerToCenter(e) { return e.centerOfRightWall() - this.centerOfRightWall(); } /** * edgeOffset is used for interactionWidth calculations. */ edgeOffset(e) { const t = e.position < this.position; let i, s; t ? (i = e, s = this) : (i = this, s = e); const l = i.rightEdgeOfRightWall(), d = s.leftEdgeOfRightWall() - l - FS; return t ? d * -1 : d; } centerOfRightWall() { return this.layers <= 1 ? this.position : this.position + Y8 * (this.layers - 1); } rightEdgeOfRightWall() { return this.position + Y8 * this.layers; } leftEdgeOfRightWall() { return this.layers === 0 ? this.position : this.centerOfRightWall() - Y8; } } const PH = (n, e) => n == null ? void 0 : n.getAncestors((t) => ((s) => { const l = s instanceof T.MessageContext, c = s instanceof T.CreationContext; return l || c; })(t) ? t.Owner() === e : !1).length, FH = (n, e) => { const t = n.get(t4).orderedParticipantNames(), i = an(e); return t.find((s) => i.includes(s)); }, hc = (n, e) => { const t = n.get(t4).orderedParticipantNames(), s = new r7(t).getFrame(e); return a7(s); }, UH = (n, e, t) => { const i = n.get(t4), s = FH(n, e) || "", l = i.half(s); if (s === t || !t) return console.debug( `left participant: ${s} ${l}` ), hc(n, e).left + l; const c = PH(e, t), d = new Q5(j3(i, t), c); return new Q5(j3(i, s), 0).centerToCenter(d) + hc(n, e).left + l; }, jt = (n, e) => { const t = xc(), [i, s] = b.useState(!1), l = () => { s((M) => !M); }; b.useEffect(() => { s(!1); }, [n]); const c = t.get(t4), d = c.orderedParticipantNames(), L = an(n), _ = d.find((M) => L.includes(M)) || "", m = new r7(d).getFrame(n), f = a7(m), h = UH(t, n, e), v = c.half(_), R = hc(t, n).left + v, w = { // +1px for the border of the fragment transform: "translateX(" + (h + 1) * -1 + "px)", width: yv(n, c) + "px", minWidth: kS + "px" }; return { collapsed: i, toggleCollapse: l, offsetX: h, paddingLeft: R, fragmentStyle: w, border: f, halfLeftParticipant: v, leftParticipant: _ }; }; function Ov() { return { async: !1, baseUrl: null, breaks: !1, extensions: null, gfm: !0, headerIds: !0, headerPrefix: "", highlight: null, hooks: null, langPrefix: "language-", mangle: !0, pedantic: !1, renderer: null, sanitize: !1, sanitizer: null, silent: !1, smartypants: !1, tokenizer: null, walkTokens: null, xhtml: !1 }; } let A9 = Ov(); function ZH(n) { A9 = n; } const Iv = /[&<>"']/, BH = new RegExp(Iv.source, "g"), Dv = /[<>"']|&(?!(#\d{1,7}|#[Xx][a-fA-F0-9]{1,6}|\w+);)/, GH = new RegExp(Dv.source, "g"), zH = { "&": "&", "<": "<", ">": ">", '"': """, "'": "'" }, Tp = (n) => zH[n]; function Fe(n, e) { if (e) { if (Iv.test(n)) return n.replace(BH, Tp); } else if (Dv.test(n)) return n.replace(GH, Tp); return n; } const HH = /&(#(?:\d+)|(?:#x[0-9A-Fa-f]+)|(?:\w+));?/ig; function kv(n) { return n.replace(HH, (e, t) => (t = t.toLowerCase(), t === "colon" ? ":" : t.charAt(0) === "#" ? t.charAt(1) === "x" ? String.fromCharCode(parseInt(t.substring(2), 16)) : String.fromCharCode(+t.substring(1)) : "")); } const YH = /(^|[^\[])\^/g; function N1(n, e) { n = typeof n == "string" ? n : n.source, e = e || ""; const t = { replace: (i, s) => (s = s.source || s, s = s.replace(YH, "$1"), n = n.replace(i, s), t), getRegex: () => new RegExp(n, e) }; return t; } const VH = /[^\w:]/g, qH = /^$|^[a-z][a-z0-9+.-]*:|^[?#]/i; function vp(n, e, t) { if (n) { let i; try { i = decodeURIComponent(kv(t)).replace(VH, "").toLowerCase(); } catch { return null; } if (i.indexOf("javascript:") === 0 || i.indexOf("vbscript:") === 0 || i.indexOf("data:") === 0) return null; } e && !qH.test(t) && (t = QH(e, t)); try { t = encodeURI(t).replace(/%25/g, "%"); } catch { return null; } return t; } const Z8 = {}, WH = /^[^:]+:\/*[^/]*$/, $H = /^([^:]+:)[\s\S]*$/, KH = /^([^:]+:\/*[^/]*)[\s\S]*$/; function QH(n, e) { Z8[" " + n] || (WH.test(n) ? Z8[" " + n] = n + "/" : Z8[" " + n] = $8(n, "/", !0)), n = Z8[" " + n]; const t = n.indexOf(":") === -1; return e.substring(0, 2) === "//" ? t ? e : n.replace($H, "$1") + e : e.charAt(0) === "/" ? t ? e : n.replace(KH, "$1") + e : n + e; } const m6 = { exec: function() { } }; function Rp(n, e) { const t = n.replace(/\|/g, (l, c, d) => { let L = !1, _ = c; for (; --_ >= 0 && d[_] === "\\"; ) L = !L; return L ? "|" : " |"; }), i = t.split(/ \|/); let s = 0; if (i[0].trim() || i.shift(), i.length > 0 && !i[i.length - 1].trim() && i.pop(), i.length > e) i.splice(e); else for (; i.length < e; ) i.push(""); for (; s < i.length; s++) i[s] = i[s].trim().replace(/\\\|/g, "|"); return i; } function $8(n, e, t) { const i = n.length; if (i === 0) return ""; let s = 0; for (; s < i; ) { const l = n.charAt(i - s - 1); if (l === e && !t) s++; else if (l !== e && t) s++; else break; } return n.slice(0, i - s); } function jH(n, e) { if (n.indexOf(e[1]) === -1) return -1; const t = n.length; let i = 0, s = 0; for (; s < t; s++) if (n[s] === "\\") s++; else if (n[s] === e[0]) i++; else if (n[s] === e[1] && (i--, i < 0)) return s; return -1; } function XH(n) { n && n.sanitize && !n.silent && console.warn("marked(): sanitize and sanitizer parameters are deprecated since version 0.7.0, should not be used and will be removed in the future. Read more here: https://marked.js.org/#/USING_ADVANCED.md#options"); } function bp(n, e) { if (e < 1) return ""; let t = ""; for (; e > 1; ) e & 1 && (t += n), e >>= 1, n += n; return t + n; } function xp(n, e, t, i) { const s = e.href, l = e.title ? Fe(e.title) : null, c = n[1].replace(/\\([\[\]])/g, "$1"); if (n[0].charAt(0) !== "!") { i.state.inLink = !0; const d = { type: "link", raw: t, href: s, title: l, text: c, tokens: i.inlineTokens(c) }; return i.state.inLink = !1, d; } return { type: "image", raw: t, href: s, title: l, text: Fe(c) }; } function JH(n, e) { const t = n.match(/^(\s+)(?:```)/); if (t === null) return e; const i = t[1]; return e.split(` `).map((s) => { const l = s.match(/^\s+/); if (l === null) return s; const [c] = l; return c.length >= i.length ? s.slice(i.length) : s; }).join(` `); } class ed { constructor(e) { this.options = e || A9; } space(e) { const t = this.rules.block.newline.exec(e); if (t && t[0].length > 0) return { type: "space", raw: t[0] }; } code(e) { const t = this.rules.block.code.exec(e); if (t) { const i = t[0].replace(/^ {1,4}/gm, ""); return { type: "code", raw: t[0], codeBlockStyle: "indented", text: this.options.pedantic ? i : $8(i, ` `) }; } } fences(e) { const t = this.rules.block.fences.exec(e); if (t) { const i = t[0], s = JH(i, t[3] || ""); return { type: "code", raw: i, lang: t[2] ? t[2].trim().replace(this.rules.inline._escapes, "$1") : t[2], text: s }; } } heading(e) { const t = this.rules.block.heading.exec(e); if (t) { let i = t[2].trim(); if (/#$/.test(i)) { const s = $8(i, "#"); (this.options.pedantic || !s || / $/.test(s)) && (i = s.trim()); } return { type: "heading", raw: t[0], depth: t[1].length, text: i, tokens: this.lexer.inline(i) }; } } hr(e) { const t = this.rules.block.hr.exec(e); if (t) return { type: "hr", raw: t[0] }; } blockquote(e) { const t = this.rules.block.blockquote.exec(e); if (t) { const i = t[0].replace(/^ *>[ \t]?/gm, ""), s = this.lexer.state.top; this.lexer.state.top = !0; const l = this.lexer.blockTokens(i); return this.lexer.state.top = s, { type: "blockquote", raw: t[0], tokens: l, text: i }; } } list(e) { let t = this.rules.block.list.exec(e); if (t) { let i, s, l, c, d, L, _, p, m, f, h, v, R = t[1].trim(); const w = R.length > 1, M = { type: "list", raw: "", ordered: w, start: w ? +R.slice(0, -1) : "", loose: !1, items: [] }; R = w ? `\\d{1,9}\\${R.slice(-1)}` : `\\${R}`, this.options.pedantic && (R = w ? R : "[*+-]"); const N = new RegExp(`^( {0,3}${R})((?:[ ][^\\n]*)?(?:\\n|$))`); for (; e && (v = !1, !(!(t = N.exec(e)) || this.rules.block.hr.test(e))); ) { if (i = t[0], e = e.substring(i.length), p = t[2].split(` `, 1)[0].replace(/^\t+/, (A) => " ".repeat(3 * A.length)), m = e.split(` `, 1)[0], this.options.pedantic ? (c = 2, h = p.trimLeft()) : (c = t[2].search(/[^ ]/), c = c > 4 ? 1 : c, h = p.slice(c), c += t[1].length), L = !1, !p && /^ *$/.test(m) && (i += m + ` `, e = e.substring(m.length + 1), v = !0), !v) { const A = new RegExp(`^ {0,${Math.min(3, c - 1)}}(?:[*+-]|\\d{1,9}[.)])((?:[ ][^\\n]*)?(?:\\n|$))`), P = new RegExp(`^ {0,${Math.min(3, c - 1)}}((?:- *){3,}|(?:_ *){3,}|(?:\\* *){3,})(?:\\n+|$)`), W = new RegExp(`^ {0,${Math.min(3, c - 1)}}(?:\`\`\`|~~~)`), k = new RegExp(`^ {0,${Math.min(3, c - 1)}}#`); for (; e && (f = e.split(` `, 1)[0], m = f, this.options.pedantic && (m = m.replace(/^ {1,4}(?=( {4})*[^ ])/g, " ")), !(W.test(m) || k.test(m) || A.test(m) || P.test(e))); ) { if (m.search(/[^ ]/) >= c || !m.trim()) h += ` ` + m.slice(c); else { if (L || p.search(/[^ ]/) >= 4 || W.test(p) || k.test(p) || P.test(p)) break; h += ` ` + m; } !L && !m.trim() && (L = !0), i += f + ` `, e = e.substring(f.length + 1), p = m.slice(c); } } M.loose || (_ ? M.loose = !0 : /\n *\n *$/.test(i) && (_ = !0)), this.options.gfm && (s = /^\[[ xX]\] /.exec(h), s && (l = s[0] !== "[ ] ", h = h.replace(/^\[[ xX]\] +/, ""))), M.items.push({ type: "list_item", raw: i, task: !!s, checked: l, loose: !1, text: h }), M.raw += i; } M.items[M.items.length - 1].raw = i.trimRight(), M.items[M.items.length - 1].text = h.trimRight(), M.raw = M.raw.trimRight(); const D = M.items.length; for (d = 0; d < D; d++) if (this.lexer.state.top = !1, M.items[d].tokens = this.lexer.blockTokens(M.items[d].text, []), !M.loose) { const A = M.items[d].tokens.filter((W) => W.type === "space"), P = A.length > 0 && A.some((W) => /\n.*\n/.test(W.raw)); M.loose = P; } if (M.loose) for (d = 0; d < D; d++) M.items[d].loose = !0; return M; } } html(e) { const t = this.rules.block.html.exec(e); if (t) { const i = { type: "html", raw: t[0], pre: !this.options.sanitizer && (t[1] === "pre" || t[1] === "script" || t[1] === "style"), text: t[0] }; if (this.options.sanitize) { const s = this.options.sanitizer ? this.options.sanitizer(t[0]) : Fe(t[0]); i.type = "paragraph", i.text = s, i.tokens = this.lexer.inline(s); } return i; } } def(e) { const t = this.rules.block.def.exec(e); if (t) { const i = t[1].toLowerCase().replace(/\s+/g, " "), s = t[2] ? t[2].replace(/^<(.*)>$/, "$1").replace(this.rules.inline._escapes, "$1") : "", l = t[3] ? t[3].substring(1, t[3].length - 1).replace(this.rules.inline._escapes, "$1") : t[3]; return { type: "def", tag: i, raw: t[0], href: s, title: l }; } } table(e) { const t = this.rules.block.table.exec(e); if (t) { const i = { type: "table", header: Rp(t[1]).map((s) => ({ text: s })), align: t[2].replace(/^ *|\| *$/g, "").split(/ *\| */), rows: t[3] && t[3].trim() ? t[3].replace(/\n[ \t]*$/, "").split(` `) : [] }; if (i.header.length === i.align.length) { i.raw = t[0]; let s = i.align.length, l, c, d, L; for (l = 0; l < s; l++) /^ *-+: *$/.test(i.align[l]) ? i.align[l] = "right" : /^ *:-+: *$/.test(i.align[l]) ? i.align[l] = "center" : /^ *:-+ *$/.test(i.align[l]) ? i.align[l] = "left" : i.align[l] = null; for (s = i.rows.length, l = 0; l < s; l++) i.rows[l] = Rp(i.rows[l], i.header.length).map((_) => ({ text: _ })); for (s = i.header.length, c = 0; c < s; c++) i.header[c].tokens = this.lexer.inline(i.header[c].text); for (s = i.rows.length, c = 0; c < s; c++) for (L = i.rows[c], d = 0; d < L.length; d++) L[d].tokens = this.lexer.inline(L[d].text); return i; } } } lheading(e) { const t = this.rules.block.lheading.exec(e); if (t) return { type: "heading", raw: t[0], depth: t[2].charAt(0) === "=" ? 1 : 2, text: t[1], tokens: this.lexer.inline(t[1]) }; } paragraph(e) { const t = this.rules.block.paragraph.exec(e); if (t) { const i = t[1].charAt(t[1].length - 1) === ` ` ? t[1].slice(0, -1) : t[1]; return { type: "paragraph", raw: t[0], text: i, tokens: this.lexer.inline(i) }; } } text(e) { const t = this.rules.block.text.exec(e); if (t) return { type: "text", raw: t[0], text: t[0], tokens: this.lexer.inline(t[0]) }; } escape(e) { const t = this.rules.inline.escape.exec(e); if (t) return { type: "escape", raw: t[0], text: Fe(t[1]) }; } tag(e) { const t = this.rules.inline.tag.exec(e); if (t) return !this.lexer.state.inLink && /^/i.test(t[0]) && (this.lexer.state.inLink = !1), !this.lexer.state.inRawBlock && /^<(pre|code|kbd|script)(\s|>)/i.test(t[0]) ? this.lexer.state.inRawBlock = !0 : this.lexer.state.inRawBlock && /^<\/(pre|code|kbd|script)(\s|>)/i.test(t[0]) && (this.lexer.state.inRawBlock = !1), { type: this.options.sanitize ? "text" : "html", raw: t[0], inLink: this.lexer.state.inLink, inRawBlock: this.lexer.state.inRawBlock, text: this.options.sanitize ? this.options.sanitizer ? this.options.sanitizer(t[0]) : Fe(t[0]) : t[0] }; } link(e) { const t = this.rules.inline.link.exec(e); if (t) { const i = t[2].trim(); if (!this.options.pedantic && /^$/.test(i)) return; const c = $8(i.slice(0, -1), "\\"); if ((i.length - c.length) % 2 === 0) return; } else { const c = jH(t[2], "()"); if (c > -1) { const L = (t[0].indexOf("!") === 0 ? 5 : 4) + t[1].length + c; t[2] = t[2].substring(0, c), t[0] = t[0].substring(0, L).trim(), t[3] = ""; } } let s = t[2], l = ""; if (this.options.pedantic) { const c = /^([^'"]*[^\s])\s+(['"])(.*)\2/.exec(s); c && (s = c[1], l = c[3]); } else l = t[3] ? t[3].slice(1, -1) : ""; return s = s.trim(), /^$/.test(i) ? s = s.slice(1) : s = s.slice(1, -1)), xp(t, { href: s && s.replace(this.rules.inline._escapes, "$1"), title: l && l.replace(this.rules.inline._escapes, "$1") }, t[0], this.lexer); } } reflink(e, t) { let i; if ((i = this.rules.inline.reflink.exec(e)) || (i = this.rules.inline.nolink.exec(e))) { let s = (i[2] || i[1]).replace(/\s+/g, " "); if (s = t[s.toLowerCase()], !s) { const l = i[0].charAt(0); return { type: "text", raw: l, text: l }; } return xp(i, s, i[0], this.lexer); } } emStrong(e, t, i = "") { let s = this.rules.inline.emStrong.lDelim.exec(e); if (!s || s[3] && i.match(/[\p{L}\p{N}]/u)) return; const l = s[1] || s[2] || ""; if (!l || l && (i === "" || this.rules.inline.punctuation.exec(i))) { const c = s[0].length - 1; let d, L, _ = c, p = 0; const m = s[0][0] === "*" ? this.rules.inline.emStrong.rDelimAst : this.rules.inline.emStrong.rDelimUnd; for (m.lastIndex = 0, t = t.slice(-1 * e.length + c); (s = m.exec(t)) != null; ) { if (d = s[1] || s[2] || s[3] || s[4] || s[5] || s[6], !d) continue; if (L = d.length, s[3] || s[4]) { _ += L; continue; } else if ((s[5] || s[6]) && c % 3 && !((c + L) % 3)) { p += L; continue; } if (_ -= L, _ > 0) continue; L = Math.min(L, L + _ + p); const f = e.slice(0, c + s.index + (s[0].length - d.length) + L); if (Math.min(c, L) % 2) { const v = f.slice(1, -1); return { type: "em", raw: f, text: v, tokens: this.lexer.inlineTokens(v) }; } const h = f.slice(2, -2); return { type: "strong", raw: f, text: h, tokens: this.lexer.inlineTokens(h) }; } } } codespan(e) { const t = this.rules.inline.code.exec(e); if (t) { let i = t[2].replace(/\n/g, " "); const s = /[^ ]/.test(i), l = /^ /.test(i) && / $/.test(i); return s && l && (i = i.substring(1, i.length - 1)), i = Fe(i, !0), { type: "codespan", raw: t[0], text: i }; } } br(e) { const t = this.rules.inline.br.exec(e); if (t) return { type: "br", raw: t[0] }; } del(e) { const t = this.rules.inline.del.exec(e); if (t) return { type: "del", raw: t[0], text: t[2], tokens: this.lexer.inlineTokens(t[2]) }; } autolink(e, t) { const i = this.rules.inline.autolink.exec(e); if (i) { let s, l; return i[2] === "@" ? (s = Fe(this.options.mangle ? t(i[1]) : i[1]), l = "mailto:" + s) : (s = Fe(i[1]), l = s), { type: "link", raw: i[0], text: s, href: l, tokens: [ { type: "text", raw: s, text: s } ] }; } } url(e, t) { let i; if (i = this.rules.inline.url.exec(e)) { let s, l; if (i[2] === "@") s = Fe(this.options.mangle ? t(i[0]) : i[0]), l = "mailto:" + s; else { let c; do c = i[0], i[0] = this.rules.inline._backpedal.exec(i[0])[0]; while (c !== i[0]); s = Fe(i[0]), i[1] === "www." ? l = "http://" + i[0] : l = i[0]; } return { type: "link", raw: i[0], text: s, href: l, tokens: [ { type: "text", raw: s, text: s } ] }; } } inlineText(e, t) { const i = this.rules.inline.text.exec(e); if (i) { let s; return this.lexer.state.inRawBlock ? s = this.options.sanitize ? this.options.sanitizer ? this.options.sanitizer(i[0]) : Fe(i[0]) : i[0] : s = Fe(this.options.smartypants ? t(i[0]) : i[0]), { type: "text", raw: i[0], text: s }; } } } const B2 = { newline: /^(?: *(?:\n|$))+/, code: /^( {4}[^\n]+(?:\n(?: *(?:\n|$))*)?)+/, fences: /^ {0,3}(`{3,}(?=[^`\n]*(?:\n|$))|~{3,})([^\n]*)(?:\n|$)(?:|([\s\S]*?)(?:\n|$))(?: {0,3}\1[~`]* *(?=\n|$)|$)/, hr: /^ {0,3}((?:-[\t ]*){3,}|(?:_[ \t]*){3,}|(?:\*[ \t]*){3,})(?:\n+|$)/, heading: /^ {0,3}(#{1,6})(?=\s|$)(.*)(?:\n+|$)/, blockquote: /^( {0,3}> ?(paragraph|[^\n]*)(?:\n|$))+/, list: /^( {0,3}bull)([ \t][^\n]+?)?(?:\n|$)/, html: "^ {0,3}(?:<(script|pre|style|textarea)[\\s>][\\s\\S]*?(?:[^\\n]*\\n+|$)|comment[^\\n]*(\\n+|$)|<\\?[\\s\\S]*?(?:\\?>\\n*|$)|\\n*|$)|\\n*|$)|)[\\s\\S]*?(?:(?:\\n *)+\\n|$)|<(?!script|pre|style|textarea)([a-z][\\w-]*)(?:attribute)*? */?>(?=[ \\t]*(?:\\n|$))[\\s\\S]*?(?:(?:\\n *)+\\n|$)|(?=[ \\t]*(?:\\n|$))[\\s\\S]*?(?:(?:\\n *)+\\n|$))", def: /^ {0,3}\[(label)\]: *(?:\n *)?([^<\s][^\s]*|<.*?>)(?:(?: +(?:\n *)?| *\n *)(title))? *(?:\n+|$)/, table: m6, lheading: /^((?:.|\n(?!\n))+?)\n {0,3}(=+|-+) *(?:\n+|$)/, // regex template, placeholders will be replaced according to different paragraph // interruption rules of commonmark and the original markdown spec: _paragraph: /^([^\n]+(?:\n(?!hr|heading|lheading|blockquote|fences|list|html|table| +\n)[^\n]+)*)/, text: /^[^\n]+/ }; B2._label = /(?!\s*\])(?:\\.|[^\[\]\\])+/; B2._title = /(?:"(?:\\"?|[^"\\])*"|'[^'\n]*(?:\n[^'\n]+)*\n?'|$[^()]*$)/; B2.def = N1(B2.def).replace("label", B2._label).replace("title", B2._title).getRegex(); B2.bullet = /(?:[*+-]|\d{1,9}[.)])/; B2.listItemStart = N1(/^( *)(bull) */).replace("bull", B2.bullet).getRegex(); B2.list = N1(B2.list).replace(/bull/g, B2.bullet).replace("hr", "\\n+(?=\\1?(?:(?:- *){3,}|(?:_ *){3,}|(?:\\* *){3,})(?:\\n+|$))").replace("def", "\\n+(?=" + B2.def.source + ")").getRegex(); B2._tag = "address|article|aside|base|basefont|blockquote|body|caption|center|col|colgroup|dd|details|dialog|dir|div|dl|dt|fieldset|figcaption|figure|footer|form|frame|frameset|h[1-6]|head|header|hr|html|iframe|legend|li|link|main|menu|menuitem|meta|nav|noframes|ol|optgroup|option|p|param|section|source|summary|table|tbody|td|tfoot|th|thead|title|tr|track|ul"; B2._comment = /|$)/; B2.html = N1(B2.html, "i").replace("comment", B2._comment).replace("tag", B2._tag).replace("attribute", / +[a-zA-Z:_][\w.:-]*(?: *= *"[^"\n]*"| *= *'[^'\n]*'| *= *[^\s"'=<>`]+)?/).getRegex(); B2.paragraph = N1(B2._paragraph).replace("hr", B2.hr).replace("heading", " {0,3}#{1,6} ").replace("|lheading", "").replace("|table", "").replace("blockquote", " {0,3}>").replace("fences", " {0,3}(?:`{3,}(?=[^`\\n]*\\n)|~{3,})[^\\n]*\\n").replace("list", " {0,3}(?:[*+-]|1[.)]) ").replace("html", ")|<(?:script|pre|style|textarea|!--)").replace("tag", B2._tag).getRegex(); B2.blockquote = N1(B2.blockquote).replace("paragraph", B2.paragraph).getRegex(); B2.normal = { ...B2 }; B2.gfm = { ...B2.normal, table: "^ *([^\\n ].*\\|.*)\\n {0,3}(?:\\| *)?(:?-+:? *(?:\\| *:?-+:? *)*)(?:\\| *)?(?:\\n((?:(?! *\\n|hr|heading|blockquote|code|fences|list|html).*(?:\\n|$))*)\\n*|$)" // Cells }; B2.gfm.table = N1(B2.gfm.table).replace("hr", B2.hr).replace("heading", " {0,3}#{1,6} ").replace("blockquote", " {0,3}>").replace("code", " {4}[^\\n]").replace("fences", " {0,3}(?:`{3,}(?=[^`\\n]*\\n)|~{3,})[^\\n]*\\n").replace("list", " {0,3}(?:[*+-]|1[.)]) ").replace("html", ")|<(?:script|pre|style|textarea|!--)").replace("tag", B2._tag).getRegex(); B2.gfm.paragraph = N1(B2._paragraph).replace("hr", B2.hr).replace("heading", " {0,3}#{1,6} ").replace("|lheading", "").replace("table", B2.gfm.table).replace("blockquote", " {0,3}>").replace("fences", " {0,3}(?:`{3,}(?=[^`\\n]*\\n)|~{3,})[^\\n]*\\n").replace("list", " {0,3}(?:[*+-]|1[.)]) ").replace("html", ")|<(?:script|pre|style|textarea|!--)").replace("tag", B2._tag).getRegex(); B2.pedantic = { ...B2.normal, html: N1( `^ *(?:comment *(?:\\n|\\s*$)|<(tag)[\\s\\S]+? *(?:\\n{2,}|\\s*$)|\\s]*)*?/?> *(?:\\n{2,}|\\s*$))` ).replace("comment", B2._comment).replace(/tag/g, "(?!(?:a|em|strong|small|s|cite|q|dfn|abbr|data|time|code|var|samp|kbd|sub|sup|i|b|u|mark|ruby|rt|rp|bdi|bdo|span|br|wbr|ins|del|img)\\b)\\w+(?!:|[^\\w\\s@]*@)\\b").getRegex(), def: /^ *\[([^\]]+)\]: *]+)>?(?: +(["(][^\n]+[")]))? *(?:\n+|$)/, heading: /^(#{1,6})(.*)(?:\n+|$)/, fences: m6, // fences not supported lheading: /^(.+?)\n {0,3}(=+|-+) *(?:\n+|$)/, paragraph: N1(B2.normal._paragraph).replace("hr", B2.hr).replace("heading", ` *#{1,6} *[^ ]`).replace("lheading", B2.lheading).replace("blockquote", " {0,3}>").replace("|fences", "").replace("|list", "").replace("|html", "").getRegex() }; const x2 = { escape: /^\$[!"#$%&'()*+,\-./:;<=>?@\[\]\\^_`{|}~])/, autolink: /^<(scheme:[^\s\x00-\x1f<>]*|email)>/, url: m6, tag: "^comment|^|^<[a-zA-Z][\\w-]*(?:attribute)*?\\s*/?>|^<\\?[\\s\\S]*?\\?>|^|^", // CDATA section link: /^!?\[(label)\]\(\s*(href)(?:\s+(title))?\s*$/, reflink: /^!?\[(label)\]\[(ref)\]/, nolink: /^!?\[(ref)\](?:\[\])?/, reflinkSearch: "reflink|nolink(?!\$)", emStrong: { lDelim: /^(?:\*+(?:([punct_])|[^\s*]))|^_+(?:([punct*])|([^\s_]))/, // (1) and (2) can only be a Right Delimiter. (3) and (4) can only be Left. (5) and (6) can be either Left or Right. // () Skip orphan inside strong () Consume to delim (1) #*** (2) a***#, a*** (3) #***a, ***a (4) ***# (5) #***# (6) a***a rDelimAst: /^(?:[^_*\\]|\\.)*?\_\_(?:[^_*\\]|\\.)*?\*(?:[^_*\\]|\\.)*?(?=\_\_)|(?:[^*\\]|\\.)+(?=[^*])|[punct_](\*+)(?=[\s]|$)|(?:[^punct*_\s\\]|\\.)(\*+)(?=[punct_\s]|$)|[punct_\s](\*+)(?=[^punct*_\s])|[\s](\*+)(?=[punct_])|[punct_](\*+)(?=[punct_])|(?:[^punct*_\s\\]|\\.)(\*+)(?=[^punct*_\s])/, rDelimUnd: /^(?:[^_*\\]|\\.)*?\*\*(?:[^_*\\]|\\.)*?\_(?:[^_*\\]|\\.)*?(?=\*\*)|(?:[^_\\]|\\.)+(?=[^_])|[punct*](\_+)(?=[\s]|$)|(?:[^punct*_\s\\]|\\.)(\_+)(?=[punct*\s]|$)|[punct*\s](\_+)(?=[^punct*_\s])|[\s](\_+)(?=[punct*])|[punct*](\_+)(?=[punct*])/ // ^- Not allowed for _ }, code: /^(`+)([^`]|[^`][\s\S]*?[^`])\1(?!`)/, br: /^( {2,}|\$\n(?!\s*$)/, del: m6, text: /^(`+|[^`])(?:(?= {2,}\n)|[\s\S]*?(?:(?=[\\?@\\[\\]`^{|}~"; x2.punctuation = N1(x2.punctuation).replace(/punctuation/g, x2._punctuation).getRegex(); x2.blockSkip = /\[[^\]]*?\]$[^$]*?\)|`[^`]*?`|<[^>]*?>/g; x2.escapedEmSt = /(?:^|[^\\])(?:\\\\)*\\[*_]/g; x2._comment = N1(B2._comment).replace("(?:-->|$)", "-->").getRegex(); x2.emStrong.lDelim = N1(x2.emStrong.lDelim).replace(/punct/g, x2._punctuation).getRegex(); x2.emStrong.rDelimAst = N1(x2.emStrong.rDelimAst, "g").replace(/punct/g, x2._punctuation).getRegex(); x2.emStrong.rDelimUnd = N1(x2.emStrong.rDelimUnd, "g").replace(/punct/g, x2._punctuation).getRegex(); x2._escapes = /\$[!"#$%&'()*+,\-./:;<=>?@\[\]\\^_`{|}~])/g; x2._scheme = /[a-zA-Z][a-zA-Z0-9+.-]{1,31}/; x2._email = /[a-zA-Z0-9.!#$%&'*+/=?^_`{|}~-]+(@)[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)+(?![-_])/; x2.autolink = N1(x2.autolink).replace("scheme", x2._scheme).replace("email", x2._email).getRegex(); x2._attribute = /\s+[a-zA-Z:_][\w.:-]*(?:\s*=\s*"[^"]*"|\s*=\s*'[^']*'|\s*=\s*[^\s"'=<>`]+)?/; x2.tag = N1(x2.tag).replace("comment", x2._comment).replace("attribute", x2._attribute).getRegex(); x2._label = /(?:\[(?:\\.|[^\[\]\\])*\]|\\.|`[^`]*`|[^\[\]\\`])*?/; x2._href = /<(?:\\.|[^\n<>\\])+>|[^\s\x00-\x1f]*/; x2._title = /"(?:\\"?|[^"\\])*"|'(?:\\'?|[^'\\])*'|\((?:\\$?|[^)\\])*\)/; x2.link = N1(x2.link).replace("label", x2._label).replace("href", x2._href).replace("title", x2._title).getRegex(); x2.reflink = N1(x2.reflink).replace("label", x2._label).replace("ref", B2._label).getRegex(); x2.nolink = N1(x2.nolink).replace("ref", B2._label).getRegex(); x2.reflinkSearch = N1(x2.reflinkSearch, "g").replace("reflink", x2.reflink).replace("nolink", x2.nolink).getRegex(); x2.normal = { ...x2 }; x2.pedantic = { ...x2.normal, strong: { start: /^__|\*\*/, middle: /^__(?=\S)([\s\S]*?\S)__(?!_)|^\*\*(?=\S)([\s\S]*?\S)\*\*(?!\*)/, endAst: /\*\*(?!\*)/g, endUnd: /__(?!_)/g }, em: { start: /^_|\*/, middle: /^()\*(?=\S)([\s\S]*?\S)\*(?!\*)|^_(?=\S)([\s\S]*?\S)_(?!_)/, endAst: /\*(?!\*)/g, endUnd: /_(?!_)/g }, link: N1(/^!?\[(label)\]$(.*?)$/).replace("label", x2._label).getRegex(), reflink: N1(/^!?\[(label)\]\s*\[([^\]]*)\]/).replace("label", x2._label).getRegex() }; x2.gfm = { ...x2.normal, escape: N1(x2.escape).replace("])", "~|])").getRegex(), _extended_email: /[A-Za-z0-9._+-]+(@)[a-zA-Z0-9-_]+(?:\.[a-zA-Z0-9-_]*[a-zA-Z0-9])+(?![-_])/, url: /^((?:ftp|https?):\/\/|www\.)(?:[a-zA-Z0-9\-]+\.?)+[^\s<]*|^email/, _backpedal: /(?:[^?!.,:;*_'"~()&]+|$[^)]*$|&(?![a-zA-Z0-9]+;$)|[?!.,:;*_'"~)]+(?!$))+/, del: /^(~~?)(?=[^\s~])([\s\S]*?[^\s~])\1(?=[^~]|$)/, text: /^([`~]+|[^`~])(?:(?= {2,}\n)|(?=[a-zA-Z0-9.!#$%&'*+\/=?_`{\|}~-]+@)|[\s\S]*?(?:(?=[\\ 0.5 && (i = "x" + i.toString(16)), e += "&#" + i + ";"; return e; } class Wt { constructor(e) { this.tokens = [], this.tokens.links = /* @__PURE__ */ Object.create(null), this.options = e || A9, this.options.tokenizer = this.options.tokenizer || new ed(), this.tokenizer = this.options.tokenizer, this.tokenizer.options = this.options, this.tokenizer.lexer = this, this.inlineQueue = [], this.state = { inLink: !1, inRawBlock: !1, top: !0 }; const t = { block: B2.normal, inline: x2.normal }; this.options.pedantic ? (t.block = B2.pedantic, t.inline = x2.pedantic) : this.options.gfm && (t.block = B2.gfm, this.options.breaks ? t.inline = x2.breaks : t.inline = x2.gfm), this.tokenizer.rules = t; } /** * Expose Rules */ static get rules() { return { block: B2, inline: x2 }; } /** * Static Lex Method */ static lex(e, t) { return new Wt(t).lex(e); } /** * Static Lex Inline Method */ static lexInline(e, t) { return new Wt(t).inlineTokens(e); } /** * Preprocessing */ lex(e) { e = e.replace(/\r\n|\r/g, ` `), this.blockTokens(e, this.tokens); let t; for (; t = this.inlineQueue.shift(); ) this.inlineTokens(t.src, t.tokens); return this.tokens; } /** * Lexing */ blockTokens(e, t = []) { this.options.pedantic ? e = e.replace(/\t/g, " ").replace(/^ +$/gm, "") : e = e.replace(/^( *)(\t+)/gm, (d, L, _) => L + " ".repeat(_.length)); let i, s, l, c; for (; e; ) if (!(this.options.extensions && this.options.extensions.block && this.options.extensions.block.some((d) => (i = d.call({ lexer: this }, e, t)) ? (e = e.substring(i.raw.length), t.push(i), !0) : !1))) { if (i = this.tokenizer.space(e)) { e = e.substring(i.raw.length), i.raw.length === 1 && t.length > 0 ? t[t.length - 1].raw += ` ` : t.push(i); continue; } if (i = this.tokenizer.code(e)) { e = e.substring(i.raw.length), s = t[t.length - 1], s && (s.type === "paragraph" || s.type === "text") ? (s.raw += ` ` + i.raw, s.text += ` ` + i.text, this.inlineQueue[this.inlineQueue.length - 1].src = s.text) : t.push(i); continue; } if (i = this.tokenizer.fences(e)) { e = e.substring(i.raw.length), t.push(i); continue; } if (i = this.tokenizer.heading(e)) { e = e.substring(i.raw.length), t.push(i); continue; } if (i = this.tokenizer.hr(e)) { e = e.substring(i.raw.length), t.push(i); continue; } if (i = this.tokenizer.blockquote(e)) { e = e.substring(i.raw.length), t.push(i); continue; } if (i = this.tokenizer.list(e)) { e = e.substring(i.raw.length), t.push(i); continue; } if (i = this.tokenizer.html(e)) { e = e.substring(i.raw.length), t.push(i); continue; } if (i = this.tokenizer.def(e)) { e = e.substring(i.raw.length), s = t[t.length - 1], s && (s.type === "paragraph" || s.type === "text") ? (s.raw += ` ` + i.raw, s.text += ` ` + i.raw, this.inlineQueue[this.inlineQueue.length - 1].src = s.text) : this.tokens.links[i.tag] || (this.tokens.links[i.tag] = { href: i.href, title: i.title }); continue; } if (i = this.tokenizer.table(e)) { e = e.substring(i.raw.length), t.push(i); continue; } if (i = this.tokenizer.lheading(e)) { e = e.substring(i.raw.length), t.push(i); continue; } if (l = e, this.options.extensions && this.options.extensions.startBlock) { let d = 1 / 0; const L = e.slice(1); let _; this.options.extensions.startBlock.forEach(function(p) { _ = p.call({ lexer: this }, L), typeof _ == "number" && _ >= 0 && (d = Math.min(d, _)); }), d < 1 / 0 && d >= 0 && (l = e.substring(0, d + 1)); } if (this.state.top && (i = this.tokenizer.paragraph(l))) { s = t[t.length - 1], c && s.type === "paragraph" ? (s.raw += ` ` + i.raw, s.text += ` ` + i.text, this.inlineQueue.pop(), this.inlineQueue[this.inlineQueue.length - 1].src = s.text) : t.push(i), c = l.length !== e.length, e = e.substring(i.raw.length); continue; } if (i = this.tokenizer.text(e)) { e = e.substring(i.raw.length), s = t[t.length - 1], s && s.type === "text" ? (s.raw += ` ` + i.raw, s.text += ` ` + i.text, this.inlineQueue.pop(), this.inlineQueue[this.inlineQueue.length - 1].src = s.text) : t.push(i); continue; } if (e) { const d = "Infinite loop on byte: " + e.charCodeAt(0); if (this.options.silent) { console.error(d); break; } else throw new Error(d); } } return this.state.top = !0, t; } inline(e, t = []) { return this.inlineQueue.push({ src: e, tokens: t }), t; } /** * Lexing/Compiling */ inlineTokens(e, t = []) { let i, s, l, c = e, d, L, _; if (this.tokens.links) { const p = Object.keys(this.tokens.links); if (p.length > 0) for (; (d = this.tokenizer.rules.inline.reflinkSearch.exec(c)) != null; ) p.includes(d[0].slice(d[0].lastIndexOf("[") + 1, -1)) && (c = c.slice(0, d.index) + "[" + bp("a", d[0].length - 2) + "]" + c.slice(this.tokenizer.rules.inline.reflinkSearch.lastIndex)); } for (; (d = this.tokenizer.rules.inline.blockSkip.exec(c)) != null; ) c = c.slice(0, d.index) + "[" + bp("a", d[0].length - 2) + "]" + c.slice(this.tokenizer.rules.inline.blockSkip.lastIndex); for (; (d = this.tokenizer.rules.inline.escapedEmSt.exec(c)) != null; ) c = c.slice(0, d.index + d[0].length - 2) + "++" + c.slice(this.tokenizer.rules.inline.escapedEmSt.lastIndex), this.tokenizer.rules.inline.escapedEmSt.lastIndex--; for (; e; ) if (L || (_ = ""), L = !1, !(this.options.extensions && this.options.extensions.inline && this.options.extensions.inline.some((p) => (i = p.call({ lexer: this }, e, t)) ? (e = e.substring(i.raw.length), t.push(i), !0) : !1))) { if (i = this.tokenizer.escape(e)) { e = e.substring(i.raw.length), t.push(i); continue; } if (i = this.tokenizer.tag(e)) { e = e.substring(i.raw.length), s = t[t.length - 1], s && i.type === "text" && s.type === "text" ? (s.raw += i.raw, s.text += i.text) : t.push(i); continue; } if (i = this.tokenizer.link(e)) { e = e.substring(i.raw.length), t.push(i); continue; } if (i = this.tokenizer.reflink(e, this.tokens.links)) { e = e.substring(i.raw.length), s = t[t.length - 1], s && i.type === "text" && s.type === "text" ? (s.raw += i.raw, s.text += i.text) : t.push(i); continue; } if (i = this.tokenizer.emStrong(e, c, _)) { e = e.substring(i.raw.length), t.push(i); continue; } if (i = this.tokenizer.codespan(e)) { e = e.substring(i.raw.length), t.push(i); continue; } if (i = this.tokenizer.br(e)) { e = e.substring(i.raw.length), t.push(i); continue; } if (i = this.tokenizer.del(e)) { e = e.substring(i.raw.length), t.push(i); continue; } if (i = this.tokenizer.autolink(e, wp)) { e = e.substring(i.raw.length), t.push(i); continue; } if (!this.state.inLink && (i = this.tokenizer.url(e, wp))) { e = e.substring(i.raw.length), t.push(i); continue; } if (l = e, this.options.extensions && this.options.extensions.startInline) { let p = 1 / 0; const m = e.slice(1); let f; this.options.extensions.startInline.forEach(function(h) { f = h.call({ lexer: this }, m), typeof f == "number" && f >= 0 && (p = Math.min(p, f)); }), p < 1 / 0 && p >= 0 && (l = e.substring(0, p + 1)); } if (i = this.tokenizer.inlineText(l, eY)) { e = e.substring(i.raw.length), i.raw.slice(-1) !== "_" && (_ = i.raw.slice(-1)), L = !0, s = t[t.length - 1], s && s.type === "text" ? (s.raw += i.raw, s.text += i.text) : t.push(i); continue; } if (e) { const p = "Infinite loop on byte: " + e.charCodeAt(0); if (this.options.silent) { console.error(p); break; } else throw new Error(p); } } return t; } } class td { constructor(e) { this.options = e || A9; } code(e, t, i) { const s = (t || "").match(/\S*/)[0]; if (this.options.highlight) { const l = this.options.highlight(e, s); l != null && l !== e && (i = !0, e = l); } return e = e.replace(/\n$/, "") + ` `, s ? '

' + (i ? e : Fe(e, !0)) + `

` : "

" + (i ? e : Fe(e, !0)) + `

`; } /** * @param {string} quote */ blockquote(e) { return `

${e}

`; } html(e) { return e; } /** * @param {string} text * @param {string} level * @param {string} raw * @param {any} slugger */ heading(e, t, i, s) { if (this.options.headerIds) { const l = this.options.headerPrefix + s.slug(i); return `${e} `; } return `${e} `; } hr() { return this.options.xhtml ? `

` : `

`; } list(e, t, i) { const s = t ? "ol" : "ul", l = t && i !== 1 ? ' start="' + i + '"' : ""; return "<" + s + l + `> ` + e + " `; } /** * @param {string} text */ listitem(e) { return `

${e}

`; } checkbox(e) { return " "; } /** * @param {string} text */ paragraph(e) { return `

${e}

`; } /** * @param {string} header * @param {string} body */ table(e, t) { return t && (t = `${t}`), ` ` + e + ` ` + t + `

`; } /** * @param {string} content */ tablerow(e) { return ` ${e} `; } tablecell(e, t) { const i = t.header ? "th" : "td"; return (t.align ? `<${i} align="${t.align}">` : `<${i}>`) + e + ` `; } /** * span level renderer * @param {string} text */ strong(e) { return `${e}`; } /** * @param {string} text */ em(e) { return `${e}`; } /** * @param {string} text */ codespan(e) { return `${e}`; } br() { return this.options.xhtml ? "
" : "
"; } /** * @param {string} text */ del(e) { return `~~${e}~~`; } /** * @param {string} href * @param {string} title * @param {string} text */ link(e, t, i) { if (e = vp(this.options.sanitize, this.options.baseUrl, e), e === null) return i; let s = '", s; } /** * @param {string} href * @param {string} title * @param {string} text */ image(e, t, i) { if (e = vp(this.options.sanitize, this.options.baseUrl, e), e === null) return i; let s = ` ${i}

An error occurred:

" + Fe(i.message + "", !0) + "