@cotal-ai/core 0.11.6 → 0.13.0

package/dist/runtime.d.ts

@@ -37,6 +37,9 @@ export interface AgentHandle {
     stop(opts?: {
         graceful?: boolean;
     }): void;
+    /** Resolve only after the runtime has authoritatively proved the process/window/workspace is gone.
+     * Optional during the preservation rollout; a manager maintenance cut must fail closed when absent. */
+    waitForExit?(): Promise<void>;
     interrupt(): void;
     /** Open a live attach. Throws on backends that can't stream (e.g. tmux/cmux, which
      *  you attach to natively). */

package/dist/runtime.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"runtime.d.ts","sourceRoot":"","sources":["../src/runtime.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAC/C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAEjD;wDACwD;AACxD,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;2BAE2B;AAC3B,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB;;yGAEqG;IACrG,OAAO,IAAI,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IACpC,2DAA2D;IAC3D,MAAM,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI,GAAG,MAAM,IAAI,CAAC;IAChD,0EAA0E;IAC1E,MAAM,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC;IACnC,yCAAyC;IACzC,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,kCAAkC;IAClC,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;CAC1C;AAED;2DAC2D;AAC3D,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B;iFAC6E;IAC7E,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IACtB,MAAM,IAAI,SAAS,GAAG,QAAQ,CAAC;IAC/B;;uCAEmC;IACnC,IAAI,CAAC,IAAI,CAAC,EAAE;QAAE,QAAQ,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,IAAI,CAAC;IAC1C,SAAS,IAAI,IAAI,CAAC;IAClB;mCAC+B;IAC/B,MAAM,IAAI,aAAa,CAAC;CACzB;AAED;+DAC+D;AAC/D,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,GAAG,WAAW,CAAC;CACjE;AAED;;;;;GAKG;AACH,MAAM,WAAW,eAAgB,SAAQ,SAAS;IAChD,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B,kFAAkF;IAClF,SAAS,IAAI,OAAO,CAAC;IACrB;kEAC8D;IAC9D,MAAM,CAAC,IAAI,EAAE;QAAE,OAAO,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC;CAC5C"}
+{"version":3,"file":"runtime.d.ts","sourceRoot":"","sources":["../src/runtime.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAC/C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAEjD;wDACwD;AACxD,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;2BAE2B;AAC3B,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB;;yGAEqG;IACrG,OAAO,IAAI,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IACpC,2DAA2D;IAC3D,MAAM,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI,GAAG,MAAM,IAAI,CAAC;IAChD,0EAA0E;IAC1E,MAAM,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC;IACnC,yCAAyC;IACzC,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,kCAAkC;IAClC,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;CAC1C;AAED;2DAC2D;AAC3D,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B;iFAC6E;IAC7E,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IACtB,MAAM,IAAI,SAAS,GAAG,QAAQ,CAAC;IAC/B;;uCAEmC;IACnC,IAAI,CAAC,IAAI,CAAC,EAAE;QAAE,QAAQ,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,IAAI,CAAC;IAC1C;2GACuG;IACvG,WAAW,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAC9B,SAAS,IAAI,IAAI,CAAC;IAClB;mCAC+B;IAC/B,MAAM,IAAI,aAAa,CAAC;CACzB;AAED;+DAC+D;AAC/D,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,GAAG,WAAW,CAAC;CACjE;AAED;;;;;GAKG;AACH,MAAM,WAAW,eAAgB,SAAQ,SAAS;IAChD,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B,kFAAkF;IAClF,SAAS,IAAI,OAAO,CAAC;IACrB;kEAC8D;IAC9D,MAAM,CAAC,IAAI,EAAE;QAAE,OAAO,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC;CAC5C"}

package/dist/safe-pattern.d.ts

@@ -0,0 +1,33 @@
+/**
+ * The safe regex subset behind SPEC §13.7/§13.8 "bounded pattern complexity" / "bounded regex".
+ *
+ * A length cap is not a complexity bound (`^(a+)+$` is 8 characters and exponential), and a
+ * denylist of known-bad shapes is not one either (`^(a|aa)+$` has no nested quantifier and is
+ * exponential all the same). This module instead ADMITS a demonstrably-safe subset and refuses
+ * everything it cannot prove, at registration time (`contract-invalid` at the caller):
+ *
+ *  - parse refusals: backreferences, lookarounds, and anything outside the subset grammar;
+ *  - a variable repetition (`*`, `+`, `{m,}`, `{m,n}` with n>m>0, `{m}` with m>1 over variable
+ *    content) REFUSES a body that is itself variable (nested repetition, `(a+)+`), nullable
+ *    (`(a?)*`), or ambiguous (an alternation anywhere inside with overlapping or multiply
+ *    nullable branches, `(a|aa)+`) — the three per-input-character ambiguity sources;
+ *  - in a sequence, two variable repetitions with intersecting character sets refuse unless a
+ *    HARD separator (non-nullable AND disjoint from the run) fences them (`a*a*`, `a*b?a*`,
+ *    `\d*0{3}0*` — the polynomial overlap class); edge repeat-sets propagate through grouping
+ *    AND through mandatory items the run can absorb (`a*(aa*)` refuses — grouping never
+ *    changes the proof);
+ *  - the AGGREGATE ambiguity across the whole pattern is budgeted: fixed ambiguous choices
+ *    multiply through a sequence (`(a|aa)(a|aa)…` is 2^k paths with no quantifier), so a
+ *    pattern whose path bound exceeds the budget refuses;
+ *  - `?` (0-or-1) is repetition-exempt where it cannot multiply per input character: `(…)?`
+ *    over quantified content stays admitted (one alternative in total).
+ *
+ * Character sets are computed conservatively (unknown escapes like `\p{…}` widen to ALL, so
+ * uncertainty always refuses more, never less). Every admitted pattern backtracks at most a
+ * constant number of alternatives per input position; every refused pattern names its reason.
+ */
+/** Assert `pattern` is inside the profile's safe subset. Throws a plain `Error` naming the
+ *  refusal reason (callers wrap it in their boundary's error type). `maxChars` is the §13.7
+ *  length bound, checked first. */
+export declare function assertSafePattern(pattern: string, maxChars: number): void;
+//# sourceMappingURL=safe-pattern.d.ts.map

package/dist/safe-pattern.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"safe-pattern.d.ts","sourceRoot":"","sources":["../src/safe-pattern.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAyZH;;mCAEmC;AACnC,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI,CAazE"}

package/dist/safe-pattern.js

@@ -0,0 +1,486 @@
+/**
+ * The safe regex subset behind SPEC §13.7/§13.8 "bounded pattern complexity" / "bounded regex".
+ *
+ * A length cap is not a complexity bound (`^(a+)+$` is 8 characters and exponential), and a
+ * denylist of known-bad shapes is not one either (`^(a|aa)+$` has no nested quantifier and is
+ * exponential all the same). This module instead ADMITS a demonstrably-safe subset and refuses
+ * everything it cannot prove, at registration time (`contract-invalid` at the caller):
+ *
+ *  - parse refusals: backreferences, lookarounds, and anything outside the subset grammar;
+ *  - a variable repetition (`*`, `+`, `{m,}`, `{m,n}` with n>m>0, `{m}` with m>1 over variable
+ *    content) REFUSES a body that is itself variable (nested repetition, `(a+)+`), nullable
+ *    (`(a?)*`), or ambiguous (an alternation anywhere inside with overlapping or multiply
+ *    nullable branches, `(a|aa)+`) — the three per-input-character ambiguity sources;
+ *  - in a sequence, two variable repetitions with intersecting character sets refuse unless a
+ *    HARD separator (non-nullable AND disjoint from the run) fences them (`a*a*`, `a*b?a*`,
+ *    `\d*0{3}0*` — the polynomial overlap class); edge repeat-sets propagate through grouping
+ *    AND through mandatory items the run can absorb (`a*(aa*)` refuses — grouping never
+ *    changes the proof);
+ *  - the AGGREGATE ambiguity across the whole pattern is budgeted: fixed ambiguous choices
+ *    multiply through a sequence (`(a|aa)(a|aa)…` is 2^k paths with no quantifier), so a
+ *    pattern whose path bound exceeds the budget refuses;
+ *  - `?` (0-or-1) is repetition-exempt where it cannot multiply per input character: `(…)?`
+ *    over quantified content stays admitted (one alternative in total).
+ *
+ * Character sets are computed conservatively (unknown escapes like `\p{…}` widen to ALL, so
+ * uncertainty always refuses more, never less). Every admitted pattern backtracks at most a
+ * constant number of alternatives per input position; every refused pattern names its reason.
+ */
+const FULL = { neg: true, ranges: [] };
+const EMPTY = { neg: false, ranges: [] };
+const set = (...ranges) => ({ neg: false, ranges });
+const single = (c) => set([c, c]);
+function rangesOverlap(a, b) {
+    for (const [al, ah] of a)
+        for (const [bl, bh] of b)
+            if (al <= bh && bl <= ah)
+                return true;
+    return false;
+}
+function rangesCover(outer, [lo, hi]) {
+    // Conservative single-range cover test (enough for the complement cases below).
+    return outer.some(([ol, oh]) => ol <= lo && hi <= oh);
+}
+/** Conservative non-empty-intersection test: uncertainty answers `true` (refuse-more). */
+function intersects(a, b) {
+    if (!a.neg && !b.neg)
+        return rangesOverlap(a.ranges, b.ranges);
+    if (a.neg && b.neg)
+        return true; // two complements always share almost everything
+    const pos = a.neg ? b : a;
+    const neg = a.neg ? a : b;
+    // pos ∩ complement(neg.ranges) is empty only if neg's ranges cover every pos range.
+    return !pos.ranges.every((r) => rangesCover(neg.ranges, r));
+}
+function union(a, b) {
+    if (!a.neg && a.ranges.length === 0)
+        return b; // EMPTY is the identity — never widen past it
+    if (!b.neg && b.ranges.length === 0)
+        return a;
+    if (a.neg || b.neg)
+        return FULL; // two non-trivial sets, one a complement: widen to ALL (sound)
+    return { neg: false, ranges: [...a.ranges, ...b.ranges] };
+}
+class PatternRefused extends Error {
+}
+const refuse = (reason) => { throw new PatternRefused(reason); };
+class Parser {
+    src;
+    i = 0;
+    constructor(src) {
+        this.src = src;
+    }
+    peek() { return this.src[this.i]; }
+    next() { return this.src[this.i++]; }
+    eof() { return this.i >= this.src.length; }
+    parse() {
+        const node = this.alternation();
+        if (!this.eof())
+            refuse(`unexpected "${this.peek()}" at ${this.i}`);
+        return node;
+    }
+    alternation() {
+        const branches = [this.sequence()];
+        while (this.peek() === "|") {
+            this.next();
+            branches.push(this.sequence());
+        }
+        return branches.length === 1 ? branches[0] : { kind: "alt", branches };
+    }
+    sequence() {
+        const items = [];
+        while (!this.eof() && this.peek() !== "|" && this.peek() !== ")")
+            items.push(this.quantified());
+        return { kind: "seq", items };
+    }
+    quantified() {
+        let node = this.atom();
+        for (;;) {
+            const c = this.peek();
+            let min, max;
+            if (c === "*") {
+                min = 0;
+                max = Infinity;
+            }
+            else if (c === "+") {
+                min = 1;
+                max = Infinity;
+            }
+            else if (c === "?") {
+                min = 0;
+                max = 1;
+            }
+            else if (c === "{") {
+                const m = /^\{(\d+)(?:,(\d*))?\}/.exec(this.src.slice(this.i));
+                if (!m)
+                    break; // a literal '{'
+                min = parseInt(m[1], 10);
+                max = m[2] === undefined ? min : m[2] === "" ? Infinity : parseInt(m[2], 10);
+                if (max < min)
+                    refuse(`quantifier {${min},${max}} is inverted`);
+                this.i += m[0].length - 1; // -1: the shared next() below consumes one char
+            }
+            else
+                break;
+            this.next();
+            if (this.peek() === "?")
+                this.next(); // lazy marker — same admitted language
+            node = { kind: "quant", body: node, min, max };
+        }
+        return node;
+    }
+    atom() {
+        const c = this.next();
+        if (c === "(") {
+            if (this.peek() === "?") {
+                const ahead = this.src.slice(this.i, this.i + 3);
+                if (/^\?(:|<[a-zA-Z_])/.test(ahead)) {
+                    // non-capturing or named group: plain grouping
+                    this.next(); // '?'
+                    if (this.peek() === "<") {
+                        while (this.next() !== ">") {
+                            if (this.eof())
+                                refuse("unterminated group name");
+                        }
+                    }
+                    else
+                        this.next(); // ':'
+                }
+                else {
+                    refuse("lookarounds and special groups are outside the profile's safe subset");
+                }
+            }
+            const body = this.alternation();
+            if (this.next() !== ")")
+                refuse("unterminated group");
+            return body;
+        }
+        if (c === "[")
+            return { kind: "atom", set: this.charClass() };
+        if (c === ".")
+            return { kind: "atom", set: FULL };
+        if (c === "^")
+            return { kind: "anchor", at: "start" };
+        if (c === "$")
+            return { kind: "anchor", at: "end" };
+        if (c === "\\")
+            return { kind: "atom", set: this.escape(false) };
+        if (c === ")" || c === undefined)
+            refuse("unbalanced group");
+        return { kind: "atom", set: single(this.codePoint()) };
+    }
+    /** One literal code POINT (never a lone code unit): `/u` semantics treat an astral pair as
+     *  one atom, so the analyzer must too, or `😀*` models as high-surrogate + repeated
+     *  low-surrogate and adjacency/overlap analysis silently under-approximates. */
+    codePoint() {
+        const cp = this.src.codePointAt(this.i - 1);
+        if (cp > 0xffff)
+            this.i++; // consumed the low half too
+        return cp;
+    }
+    charClass() {
+        let neg = false;
+        if (this.peek() === "^") {
+            this.next();
+            neg = true;
+        }
+        const ranges = [];
+        let approx = false; // any widened member: the set is an over-approximation
+        while (this.peek() !== "]") {
+            if (this.eof())
+                refuse("unterminated character class");
+            let lo;
+            const c = this.next();
+            if (c === "\\") {
+                if (this.peek() === "b") {
+                    this.next();
+                    lo = 0x08;
+                } // in a class, \b is backspace
+                else {
+                    const s = this.escape(true);
+                    if (s.neg || s.ranges.length !== 1 || s.ranges[0][0] !== s.ranges[0][1]) {
+                        approx = true; // \d, \D, \p{…} inside a class: fold in conservatively
+                        for (const r of s.neg ? [[0, 0x10ffff]] : s.ranges)
+                            ranges.push(r);
+                    }
+                    else
+                        lo = s.ranges[0][0];
+                }
+            }
+            else
+                lo = this.codePoint();
+            if (lo !== undefined) {
+                if (this.peek() === "-" && this.src[this.i + 1] !== "]" && this.src[this.i + 1] !== undefined) {
+                    this.next();
+                    const hiC = this.next();
+                    const hi = hiC === "\\" ? (() => { const s = this.escape(true); if (s.neg || s.ranges.length !== 1) {
+                        approx = true;
+                        return 0x10ffff;
+                    } return s.ranges[0][0]; })() : this.codePoint();
+                    ranges.push([lo, hi]);
+                }
+                else
+                    ranges.push([lo, lo]);
+            }
+        }
+        this.next(); // ']'
+        // An over-approximated set NEGATED becomes an UNDER-approximation ([^\D] would model as
+        // complement(ALL) = EMPTY while the engine sees \d) — widening must survive negation, so
+        // an approximate negated class is FULL, never its complement.
+        if (neg && approx)
+            return FULL;
+        return { neg, ranges };
+    }
+    escape(inClass) {
+        const c = this.next();
+        if (c === undefined)
+            refuse("dangling escape");
+        if (!inClass && c >= "1" && c <= "9")
+            refuse(`backreference \\${c} is outside the profile's safe subset`);
+        if (c === "k")
+            refuse("named backreferences are outside the profile's safe subset");
+        if (c === "b" || c === "B")
+            return EMPTY; // word boundary: zero-width (as an atom: anchor-like)
+        switch (c) {
+            case "d": return set([0x30, 0x39]);
+            case "D": return { neg: true, ranges: [[0x30, 0x39]] };
+            case "w": return set([0x30, 0x39], [0x41, 0x5a], [0x5f, 0x5f], [0x61, 0x7a]);
+            case "W": return { neg: true, ranges: [[0x30, 0x39], [0x41, 0x5a], [0x5f, 0x5f], [0x61, 0x7a]] };
+            case "s": return set([0x09, 0x0d], [0x20, 0x20], [0xa0, 0xa0], [0x2028, 0x2029]);
+            case "S": return { neg: true, ranges: [[0x09, 0x0d], [0x20, 0x20], [0xa0, 0xa0], [0x2028, 0x2029]] };
+            case "n": return single(0x0a);
+            case "r": return single(0x0d);
+            case "t": return single(0x09);
+            case "f": return single(0x0c);
+            case "v": return single(0x0b);
+            case "0": return single(0);
+            case "x": {
+                const m = /^[0-9a-fA-F]{2}/.exec(this.src.slice(this.i));
+                if (!m)
+                    refuse("malformed \\x escape");
+                this.i += 2;
+                return single(parseInt(m[0], 16));
+            }
+            case "u": {
+                const braced = /^\{([0-9a-fA-F]{1,6})\}/.exec(this.src.slice(this.i));
+                if (braced) {
+                    this.i += braced[0].length;
+                    const cp = parseInt(braced[1], 16);
+                    if (cp >= 0xd800 && cp <= 0xdfff)
+                        refuse("surrogate code point escapes are outside the safe subset");
+                    return single(cp);
+                }
+                const m = /^[0-9a-fA-F]{4}/.exec(this.src.slice(this.i));
+                if (!m)
+                    refuse("malformed \\u escape");
+                this.i += 4;
+                const cp = parseInt(m[0], 16);
+                // Under /u a surrogate escape pairs with its sibling into one code point; modeling the
+                // halves separately under-approximates repetition — refuse, write the character or \u{…}.
+                if (cp >= 0xd800 && cp <= 0xdfff)
+                    refuse("surrogate escapes are outside the safe subset (write the character or \\u{…})");
+                return single(cp);
+            }
+            case "p":
+            case "P": {
+                const m = /^\{[^}]*\}/.exec(this.src.slice(this.i));
+                if (!m)
+                    refuse("malformed \\p escape");
+                this.i += m[0].length;
+                return FULL; // unknown property set: widen — uncertainty refuses more, never less
+            }
+            default:
+                // An escaped ALPHANUMERIC we do not model has (or may gain) engine meaning (\cA is
+                // control-A, not literal c+A — modeling it as such under-approximated repetition):
+                // refuse instead of fallback-admitting. Escaped punctuation is exactly that literal.
+                if (/[A-Za-z0-9]/.test(c))
+                    refuse(`escape \\${c} is outside the profile's safe subset`);
+                return single(c.codePointAt(0));
+        }
+    }
+}
+/** The aggregate-ambiguity ceiling: an admitted pattern explores at most this many alternative
+ *  paths per match attempt from fixed (unquantified) ambiguous choices — small enough to be
+ *  noise at the 10 ms validation budget, generous enough for real idioms (a chain of six
+ *  two-way ambiguous alternations). Beyond it the fixed-alternation class turns exponential in
+ *  the author's pattern length (`(a|aa)`×25 is 153 chars and 2^25 paths). */
+const CHOICE_BUDGET = 64;
+const CHOICE_SAT = 1 << 20; // saturation ceiling for the bookkeeping, far above the budget
+const mulSat = (a, b) => Math.min(a * b, CHOICE_SAT);
+function powSat(base, exp) {
+    let out = 1;
+    for (let i = 0; i < exp && out < CHOICE_SAT; i++)
+        out = mulSat(out, base);
+    return out;
+}
+/** Front-to-back accumulation of an edge repeat-set across a sequence. A repetition surfaces at
+ *  the edge through any NULLABLE prefix — and ALSO through a mandatory item that the repeated
+ *  run can ABSORB (its set intersects a repetition edge-set deeper in the scan): the mandatory
+ *  `a` in `(aa*)` does not fence the inner `a*` off from a neighboring `a*`, it is satisfiable
+ *  anywhere inside the same run (the grouped form of the run-slosh class — grouping must not
+ *  change the proof). Only a mandatory item DISJOINT from everything deeper stops the scan.
+ *  `pick` selects the edge. */
+function edgeRepeat(facts, pick) {
+    // Suffix unions of the picked edge sets: what a mandatory item at position i would need to
+    // be absorbable by (any repetition surfacing deeper in scan order).
+    const deeper = new Array(facts.length + 1);
+    deeper[facts.length] = EMPTY;
+    for (let i = facts.length - 1; i >= 0; i--)
+        deeper[i] = union(pick(facts[i]), deeper[i + 1]);
+    let acc = EMPTY;
+    for (let i = 0; i < facts.length; i++) {
+        acc = union(acc, pick(facts[i]));
+        if (!facts[i].nullable && !intersects(facts[i].set, deeper[i + 1]))
+            break;
+    }
+    return acc;
+}
+/** Every alternation branch reachable at the top level MUST begin with a `^` start anchor.
+ *  Ajv matches `pattern` with unanchored `RegExp.test()`, which retries at EVERY input position;
+ *  a branch not pinned to the start therefore turns even a single repetition-plus-obligation
+ *  (`[0b]*$`, `[a-z]+@`) into an O(n²) scan across n start positions. A `^` collapses the search
+ *  to one position, under which the overlap analysis below is sound. (End-anchoring is not
+ *  required: a trailing repetition with no obligation after it is linear.) */
+function assertStartAnchored(node) {
+    switch (node.kind) {
+        case "anchor":
+            if (node.at !== "start")
+                refuse("a top-level branch must begin with a '^' start anchor (Ajv tests patterns unanchored)");
+            return;
+        case "seq":
+            if (node.items.length === 0)
+                refuse("an empty top-level branch is not start-anchored");
+            assertStartAnchored(node.items[0]);
+            return;
+        case "alt":
+            for (const b of node.branches)
+                assertStartAnchored(b);
+            return;
+        default:
+            refuse("a top-level branch must begin with a '^' start anchor (Ajv tests patterns unanchored)");
+    }
+}
+function analyze(node) {
+    switch (node.kind) {
+        case "anchor":
+            return { set: EMPTY, nullable: true, variable: false, ambiguousAlt: false, choices: 1, leadRep: EMPTY, trailRep: EMPTY };
+        case "atom":
+            return { set: node.set, nullable: node.set.ranges.length === 0 && !node.set.neg, variable: false, ambiguousAlt: false, choices: 1, leadRep: EMPTY, trailRep: EMPTY };
+        case "seq": {
+            const facts = node.items.map(analyze);
+            // The polynomial overlap class (`a*a*`, `a*b?a*`, `(a*|b)a*`, `\d*0000 0*`): a node whose
+            // TRAILING repeat-set `T` intersects a later node's LEADING repeat-set is refused. The
+            // window is only closed by a HARD SEPARATOR — a non-nullable item whose set is DISJOINT
+            // from `T`. A non-nullable item whose set INTERSECTS `T` does NOT separate: the run of
+            // `T`-characters sloshes through it (the fixed `0000` between `\d*` and `0*` is satisfiable
+            // anywhere in a zero-run, so the two still split the run ambiguously).
+            for (let i = 0; i < facts.length; i++) {
+                const T = facts[i].trailRep;
+                if (T.ranges.length === 0 && !T.neg)
+                    continue;
+                for (let j = i + 1; j < facts.length; j++) {
+                    if (intersects(T, facts[j].leadRep))
+                        refuse("two overlapping variable repetitions in sequence (polynomial backtracking class)");
+                    if (!facts[j].nullable && !intersects(facts[j].set, T))
+                        break; // a disjoint obligation separates the run
+                }
+            }
+            return {
+                set: facts.reduce((s, f) => union(s, f.set), EMPTY),
+                nullable: facts.every((f) => f.nullable),
+                variable: facts.some((f) => f.variable),
+                ambiguousAlt: facts.some((f) => f.ambiguousAlt),
+                // A sequence MULTIPLIES its items' path counts — the fixed-alternation class
+                // (`(a|aa)(a|aa)…`) turns exponential exactly here, with no quantifier anywhere.
+                choices: facts.reduce((n, f) => mulSat(n, f.choices), 1),
+                leadRep: edgeRepeat(facts, (f) => f.leadRep),
+                trailRep: edgeRepeat([...facts].reverse(), (f) => f.trailRep),
+            };
+        }
+        case "alt": {
+            const facts = node.branches.map(analyze);
+            let ambiguous = facts.some((f) => f.ambiguousAlt);
+            if (facts.filter((f) => f.nullable).length > 1)
+                ambiguous = true; // two empty-matching branches
+            for (let i = 0; i < facts.length && !ambiguous; i++) {
+                for (let j = i + 1; j < facts.length; j++) {
+                    if (intersects(facts[i].set, facts[j].set)) {
+                        ambiguous = true;
+                        break;
+                    }
+                }
+            }
+            // ANY branch may be the matched one, so its edge repeat-sets are all exposed at this
+            // alternation's edges.
+            return {
+                set: facts.reduce((s, f) => union(s, f.set), EMPTY),
+                nullable: facts.some((f) => f.nullable),
+                variable: facts.some((f) => f.variable),
+                ambiguousAlt: ambiguous,
+                // Overlapping branches can EACH match the same span (paths add); disjoint branches are
+                // mutually exclusive on any given input (only the surviving branch's paths count).
+                choices: ambiguous
+                    ? facts.reduce((n, f) => Math.min(n + f.choices, CHOICE_SAT), 0)
+                    : facts.reduce((n, f) => Math.max(n, f.choices), 1),
+                leadRep: facts.reduce((s, f) => union(s, f.leadRep), EMPTY),
+                trailRep: facts.reduce((s, f) => union(s, f.trailRep), EMPTY),
+            };
+        }
+        case "quant": {
+            const body = analyze(node.body);
+            const repeats = node.max > 1 || node.max === Infinity; // a `?` (0-or-1) cannot multiply per input char
+            if (repeats) {
+                if (body.variable)
+                    refuse("repeats a group that itself contains a quantifier (exponential backtracking class)");
+                if (body.nullable)
+                    refuse("repeats a nullable body (unbounded ambiguity on empty matches)");
+                if (body.ambiguousAlt)
+                    refuse("repeats an ambiguous alternation (branches overlap; exponential backtracking class)");
+            }
+            // Every NONDETERMINISTIC repetition (`max > min`: `*`, `+`, `{n,}`, `?`, and any `{m,n}`
+            // with n>m) drives the polynomial overlap, because it can match a VARIABLE number of the
+            // same characters, so an adjacent one over an intersecting set is a `C(input,k)` split
+            // ambiguity — and an author-chosen finite bound like `{0,100000}` is not a "constant
+            // factor" at a 10ms budget. Only a FIXED `{n}` (max===min) is deterministic and exempt.
+            // A nondeterministic repetition exposes its BODY's set at both edges (its own repeated
+            // content), plus any repeat-set the body already carried.
+            const nondet = node.max > node.min;
+            return {
+                set: body.set,
+                nullable: body.nullable || node.min === 0,
+                variable: body.variable || nondet || repeats,
+                ambiguousAlt: body.ambiguousAlt,
+                // Fixed {n}: the body's paths multiply per iteration (a repeat over an ambiguous body
+                // is refused above, so this stays 1 there; `?` adds the skip alternative). Variable
+                // repetitions contribute their split ambiguity through the edge-set analysis instead.
+                choices: node.max === node.min
+                    ? powSat(body.choices, node.min)
+                    : node.min === 0 && node.max === 1
+                        ? Math.min(body.choices + 1, CHOICE_SAT)
+                        : body.choices,
+                leadRep: nondet ? union(body.set, body.leadRep) : body.leadRep,
+                trailRep: nondet ? union(body.set, body.trailRep) : body.trailRep,
+            };
+        }
+    }
+}
+/** Assert `pattern` is inside the profile's safe subset. Throws a plain `Error` naming the
+ *  refusal reason (callers wrap it in their boundary's error type). `maxChars` is the §13.7
+ *  length bound, checked first. */
+export function assertSafePattern(pattern, maxChars) {
+    if (pattern.length > maxChars)
+        throw new Error(`pattern of ${pattern.length} characters exceeds the profile complexity bound (${maxChars})`);
+    try {
+        const ast = new Parser(pattern).parse();
+        assertStartAnchored(ast); // sound only under single-start matching (Ajv tests unanchored)
+        const facts = analyze(ast);
+        if (facts.choices > CHOICE_BUDGET)
+            refuse(`aggregate alternation ambiguity of ${facts.choices >= CHOICE_SAT ? "at least " : ""}${facts.choices} paths exceeds the ${CHOICE_BUDGET}-path budget (the fixed-alternation exponential class)`);
+    }
+    catch (e) {
+        if (e instanceof PatternRefused)
+            throw new Error(`pattern ${JSON.stringify(pattern)} is outside the profile's safe subset: ${e.message}`);
+        throw new Error(`pattern ${JSON.stringify(pattern)} did not parse under the profile's safe subset: ${e.message}`);
+    }
+}
+//# sourceMappingURL=safe-pattern.js.map

package/dist/safe-pattern.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"safe-pattern.js","sourceRoot":"","sources":["../src/safe-pattern.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAUH,MAAM,IAAI,GAAY,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;AAChD,MAAM,KAAK,GAAY,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;AAClD,MAAM,GAAG,GAAG,CAAC,GAAG,MAA+B,EAAW,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;AACtF,MAAM,MAAM,GAAG,CAAC,CAAS,EAAW,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAEnD,SAAS,aAAa,CAAC,CAA0B,EAAE,CAA0B;IAC3E,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC;QAAE,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC;YAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;gBAAE,OAAO,IAAI,CAAC;IAC1F,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,WAAW,CAAC,KAA8B,EAAE,CAAC,EAAE,EAAE,EAAE,CAAmB;IAC7E,gFAAgF;IAChF,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;AACxD,CAAC;AAED,0FAA0F;AAC1F,SAAS,UAAU,CAAC,CAAU,EAAE,CAAU;IACxC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG;QAAE,OAAO,aAAa,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IAC/D,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC,CAAC,iDAAiD;IAClF,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1B,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1B,oFAAoF;IACpF,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED,SAAS,KAAK,CAAC,CAAU,EAAE,CAAU;IACnC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC,8CAA8C;IAC7F,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC9C,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC,CAAC,+DAA+D;IAChG,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;AAC5D,CAAC;AAYD,MAAM,cAAe,SAAQ,KAAK;CAAG;AACrC,MAAM,MAAM,GAAG,CAAC,MAAc,EAAS,EAAE,GAAG,MAAM,IAAI,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AAEhF,MAAM,MAAM;IAEW;IADrB,CAAC,GAAG,CAAC,CAAC;IACN,YAAqB,GAAW;QAAX,QAAG,GAAH,GAAG,CAAQ;IAAG,CAAC;IACpC,IAAI,KAAyB,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,IAAI,KAAa,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7C,GAAG,KAAc,OAAO,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAEpD,KAAK;QACH,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;YAAE,MAAM,CAAC,eAAe,IAAI,CAAC,IAAI,EAAE,QAAQ,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;QACpE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,WAAW;QACT,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;QACnC,OAAO,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;QAAC,CAAC;QAC5E,OAAO,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;IACzE,CAAC;IAED,QAAQ;QACN,MAAM,KAAK,GAAW,EAAE,CAAC;QACzB,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;QAChG,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAChC,CAAC;IAED,UAAU;QACR,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACvB,SAAS,CAAC;YACR,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACtB,IAAI,GAAW,EAAE,GAAW,CAAC;YAC7B,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;gBAAC,GAAG,GAAG,CAAC,CAAC;gBAAC,GAAG,GAAG,QAAQ,CAAC;YAAC,CAAC;iBACtC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;gBAAC,GAAG,GAAG,CAAC,CAAC;gBAAC,GAAG,GAAG,QAAQ,CAAC;YAAC,CAAC;iBAC3C,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;gBAAC,GAAG,GAAG,CAAC,CAAC;gBAAC,GAAG,GAAG,CAAC,CAAC;YAAC,CAAC;iBACpC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;gBACnB,MAAM,CAAC,GAAG,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/D,IAAI,CAAC,CAAC;oBAAE,MAAM,CAAC,gBAAgB;gBAC/B,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACzB,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC7E,IAAI,GAAG,GAAG,GAAG;oBAAE,MAAM,CAAC,eAAe,GAAG,IAAI,GAAG,eAAe,CAAC,CAAC;gBAChE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,gDAAgD;YAC7E,CAAC;;gBAAM,MAAM;YACb,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG;gBAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,uCAAuC;YAC7E,IAAI,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACjD,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI;QACF,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACtB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YACd,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;gBACxB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACjD,IAAI,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBACpC,+CAA+C;oBAC/C,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM;oBACnB,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;wBAAC,OAAO,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;4BAAC,IAAI,IAAI,CAAC,GAAG,EAAE;gCAAE,MAAM,CAAC,yBAAyB,CAAC,CAAC;wBAAC,CAAC;oBAAC,CAAC;;wBAC1G,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM;gBAC1B,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,sEAAsE,CAAC,CAAC;gBACjF,CAAC;YACH,CAAC;YACD,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAChC,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG;gBAAE,MAAM,CAAC,oBAAoB,CAAC,CAAC;YACtD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,KAAK,GAAG;YAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;QAC9D,IAAI,CAAC,KAAK,GAAG;YAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;QAClD,IAAI,CAAC,KAAK,GAAG;YAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC;QACtD,IAAI,CAAC,KAAK,GAAG;YAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC;QACpD,IAAI,CAAC,KAAK,IAAI;YAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QACjE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,SAAS;YAAE,MAAM,CAAC,kBAAkB,CAAC,CAAC;QAC7D,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC;IACzD,CAAC;IAED;;oFAEgF;IAChF,SAAS;QACP,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;QAC7C,IAAI,EAAE,GAAG,MAAM;YAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,4BAA4B;QACvD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,SAAS;QACP,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAAC,GAAG,GAAG,IAAI,CAAC;QAAC,CAAC;QACrD,MAAM,MAAM,GAA4B,EAAE,CAAC;QAC3C,IAAI,MAAM,GAAG,KAAK,CAAC,CAAC,uDAAuD;QAC3E,OAAO,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,GAAG,EAAE;gBAAE,MAAM,CAAC,8BAA8B,CAAC,CAAC;YACvD,IAAI,EAAsB,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACtB,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACf,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;oBAAC,IAAI,CAAC,IAAI,EAAE,CAAC;oBAAC,EAAE,GAAG,IAAI,CAAC;gBAAC,CAAC,CAAC,8BAA8B;qBAC9E,CAAC;oBACJ,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC5B,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;wBACxE,MAAM,GAAG,IAAI,CAAC,CAAC,uDAAuD;wBACtE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM;4BAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACzF,CAAC;;wBAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;;gBAAM,EAAE,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YAC7B,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACrB,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;oBAC9F,IAAI,CAAC,IAAI,EAAE,CAAC;oBACZ,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;oBACxB,MAAM,EAAE,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;wBAAC,MAAM,GAAG,IAAI,CAAC;wBAAC,OAAO,QAAQ,CAAC;oBAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;oBACvL,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;gBACxB,CAAC;;oBAAM,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QACD,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM;QACnB,wFAAwF;QACxF,yFAAyF;QACzF,8DAA8D;QAC9D,IAAI,GAAG,IAAI,MAAM;YAAE,OAAO,IAAI,CAAC;QAC/B,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;IACzB,CAAC;IAED,MAAM,CAAC,OAAgB;QACrB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACtB,IAAI,CAAC,KAAK,SAAS;YAAE,MAAM,CAAC,iBAAiB,CAAC,CAAC;QAC/C,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG;YAAE,MAAM,CAAC,mBAAmB,CAAC,uCAAuC,CAAC,CAAC;QAC1G,IAAI,CAAC,KAAK,GAAG;YAAE,MAAM,CAAC,4DAA4D,CAAC,CAAC;QACpF,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG;YAAE,OAAO,KAAK,CAAC,CAAC,sDAAsD;QAChG,QAAQ,CAAC,EAAE,CAAC;YACV,KAAK,GAAG,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YACnC,KAAK,GAAG,CAAC,CAAC,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;YACvD,KAAK,GAAG,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YAC7E,KAAK,GAAG,CAAC,CAAC,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;YACjG,KAAK,GAAG,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;YACjF,KAAK,GAAG,CAAC,CAAC,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC;YACrG,KAAK,GAAG,CAAC,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC;YAC9B,KAAK,GAAG,CAAC,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC;YAC9B,KAAK,GAAG,CAAC,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC;YAC9B,KAAK,GAAG,CAAC,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC;YAC9B,KAAK,GAAG,CAAC,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC;YAC9B,KAAK,GAAG,CAAC,CAAC,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;YAC3B,KAAK,GAAG,CAAC,CAAC,CAAC;gBAAC,MAAM,CAAC,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAC,IAAI,CAAC,CAAC;oBAAE,MAAM,CAAC,sBAAsB,CAAC,CAAC;gBAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAC,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAAC,CAAC;YAChK,KAAK,GAAG,CAAC,CAAC,CAAC;gBACT,MAAM,MAAM,GAAG,yBAAyB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtE,IAAI,MAAM,EAAE,CAAC;oBACX,IAAI,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;oBAC3B,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBACnC,IAAI,EAAE,IAAI,MAAM,IAAI,EAAE,IAAI,MAAM;wBAAE,MAAM,CAAC,0DAA0D,CAAC,CAAC;oBACrG,OAAO,MAAM,CAAC,EAAE,CAAC,CAAC;gBACpB,CAAC;gBACD,MAAM,CAAC,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzD,IAAI,CAAC,CAAC;oBAAE,MAAM,CAAC,sBAAsB,CAAC,CAAC;gBACvC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;gBACZ,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC/B,uFAAuF;gBACvF,0FAA0F;gBAC1F,IAAI,EAAE,IAAI,MAAM,IAAI,EAAE,IAAI,MAAM;oBAAE,MAAM,CAAC,+EAA+E,CAAC,CAAC;gBAC1H,OAAO,MAAM,CAAC,EAAE,CAAC,CAAC;YACpB,CAAC;YACD,KAAK,GAAG,CAAC;YAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBACnB,MAAM,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpD,IAAI,CAAC,CAAC;oBAAE,MAAM,CAAC,sBAAsB,CAAC,CAAC;gBACvC,IAAI,CAAC,CAAC,IAAI,CAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBACvB,OAAO,IAAI,CAAC,CAAC,qEAAqE;YACpF,CAAC;YACD;gBACE,mFAAmF;gBACnF,mFAAmF;gBACnF,qFAAqF;gBACrF,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;oBAAE,MAAM,CAAC,YAAY,CAAC,uCAAuC,CAAC,CAAC;gBACxF,OAAO,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;CACF;AA4BD;;;;6EAI6E;AAC7E,MAAM,aAAa,GAAG,EAAE,CAAC;AACzB,MAAM,UAAU,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,+DAA+D;AAC3F,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;AAC7E,SAAS,MAAM,CAAC,IAAY,EAAE,GAAW;IACvC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,UAAU,EAAE,CAAC,EAAE;QAAE,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC1E,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;+BAM+B;AAC/B,SAAS,UAAU,CAAC,KAAc,EAAE,IAA2B;IAC7D,2FAA2F;IAC3F,oEAAoE;IACpE,MAAM,MAAM,GAAc,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAAE,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAE7F,IAAI,GAAG,GAAG,KAAK,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,MAAM;IAC5E,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;8EAK8E;AAC9E,SAAS,mBAAmB,CAAC,IAAU;IACrC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ;YACX,IAAI,IAAI,CAAC,EAAE,KAAK,OAAO;gBAAE,MAAM,CAAC,uFAAuF,CAAC,CAAC;YACzH,OAAO;QACT,KAAK,KAAK;YACR,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM,CAAC,iDAAiD,CAAC,CAAC;YACvF,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,OAAO;QACT,KAAK,KAAK;YACR,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ;gBAAE,mBAAmB,CAAC,CAAC,CAAC,CAAC;YACtD,OAAO;QACT;YACE,MAAM,CAAC,uFAAuF,CAAC,CAAC;IACpG,CAAC;AACH,CAAC;AAED,SAAS,OAAO,CAAC,IAAU;IACzB,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;QAC3H,KAAK,MAAM;YACT,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;QACvK,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACtC,0FAA0F;YAC1F,uFAAuF;YACvF,wFAAwF;YACxF,uFAAuF;YACvF,4FAA4F;YAC5F,uEAAuE;YACvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAC5B,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG;oBAAE,SAAS;gBAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC1C,IAAI,UAAU,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;wBACjC,MAAM,CAAC,kFAAkF,CAAC,CAAC;oBAC7F,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;wBAAE,MAAM,CAAC,0CAA0C;gBAC3G,CAAC;YACH,CAAC;YACD,OAAO;gBACL,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC;gBACnD,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;gBACxC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;gBACvC,YAAY,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC;gBAC/C,6EAA6E;gBAC7E,iFAAiF;gBACjF,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;gBACxD,OAAO,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;gBAC5C,QAAQ,EAAE,UAAU,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;aAC9D,CAAC;QACJ,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACzC,IAAI,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;YAClD,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS,GAAG,IAAI,CAAC,CAAC,8BAA8B;YAChG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC1C,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;wBAAC,SAAS,GAAG,IAAI,CAAC;wBAAC,MAAM;oBAAC,CAAC;gBAC1E,CAAC;YACH,CAAC;YACD,qFAAqF;YACrF,uBAAuB;YACvB,OAAO;gBACL,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC;gBACnD,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;gBACvC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;gBACvC,YAAY,EAAE,SAAS;gBACvB,uFAAuF;gBACvF,mFAAmF;gBACnF,OAAO,EAAE,SAAS;oBAChB,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC;oBAChE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;gBACrD,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC;gBAC3D,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,KAAK,CAAC;aAC9D,CAAC;QACJ,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,KAAK,QAAQ,CAAC,CAAC,gDAAgD;YACvG,IAAI,OAAO,EAAE,CAAC;gBACZ,IAAI,IAAI,CAAC,QAAQ;oBAAE,MAAM,CAAC,oFAAoF,CAAC,CAAC;gBAChH,IAAI,IAAI,CAAC,QAAQ;oBAAE,MAAM,CAAC,gEAAgE,CAAC,CAAC;gBAC5F,IAAI,IAAI,CAAC,YAAY;oBAAE,MAAM,CAAC,qFAAqF,CAAC,CAAC;YACvH,CAAC;YACD,yFAAyF;YACzF,yFAAyF;YACzF,uFAAuF;YACvF,qFAAqF;YACrF,wFAAwF;YACxF,uFAAuF;YACvF,0DAA0D;YAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;YACnC,OAAO;gBACL,GAAG,EAAE,IAAI,CAAC,GAAG;gBACb,QAAQ,EAAE,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,KAAK,CAAC;gBACzC,QAAQ,EAAE,IAAI,CAAC,QAAQ,IAAI,MAAM,IAAI,OAAO;gBAC5C,YAAY,EAAE,IAAI,CAAC,YAAY;gBAC/B,sFAAsF;gBACtF,oFAAoF;gBACpF,sFAAsF;gBACtF,OAAO,EAAE,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG;oBAC5B,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC;oBAChC,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,IAAI,CAAC,GAAG,KAAK,CAAC;wBAChC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,UAAU,CAAC;wBACxC,CAAC,CAAC,IAAI,CAAC,OAAO;gBAClB,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO;gBAC9D,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ;aAClE,CAAC;QACJ,CAAC;IACH,CAAC;AACH,CAAC;AAED;;mCAEmC;AACnC,MAAM,UAAU,iBAAiB,CAAC,OAAe,EAAE,QAAgB;IACjE,IAAI,OAAO,CAAC,MAAM,GAAG,QAAQ;QAC3B,MAAM,IAAI,KAAK,CAAC,cAAc,OAAO,CAAC,MAAM,qDAAqD,QAAQ,GAAG,CAAC,CAAC;IAChH,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC;QACxC,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,gEAAgE;QAC1F,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,KAAK,CAAC,OAAO,GAAG,aAAa;YAC/B,MAAM,CAAC,sCAAsC,KAAK,CAAC,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,OAAO,sBAAsB,aAAa,wDAAwD,CAAC,CAAC;IAC5M,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,IAAI,CAAC,YAAY,cAAc;YAAE,MAAM,IAAI,KAAK,CAAC,WAAW,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,0CAA0C,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;QAC1I,MAAM,IAAI,KAAK,CAAC,WAAW,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,mDAAoD,CAAW,CAAC,OAAO,EAAE,CAAC,CAAC;IAC/H,CAAC;AACH,CAAC"}