@cotal-ai/lang 0.23.0 → 0.25.0

package/dist/transform/scope.js

@@ -0,0 +1,500 @@
+/**
+ * The binding analysis the emitter runs first: which names resolve where, and which of them are
+ * CELLS.
+ *
+ * A cell is L2032's binding half, and it exists because the walker's rule is a runtime one. `Env.set`
+ * refuses a write whose binding was declared at a shallower concurrency depth than the frame doing
+ * the writing, and the depth travels with the BINDING, which is what catches the shape the
+ * validator provably cannot see (`scopes.smoke` §8: a record of thunks returned from a function, so
+ * there is no function node at the combinator call to check). Native JavaScript bindings carry no
+ * depth, so a transform that emits them verbatim loses that refusal.
+ *
+ * The fix needs no new seam member. A binding written from inside a DEEPER function than the one
+ * that declared it becomes a one-field record built with `__ctx.born({v})`: birth depth is stamped
+ * at the declaration, `__ctx.set` refuses the write from a deeper frame, and L2032's binding half
+ * lands on the same door as its value half. Every other binding stays a native `const`/`let`,
+ * which is sound rather than merely fast: a binding no nested function writes can only be written
+ * at the depth it was declared at, so there is nothing for the check to refuse.
+ */
+import { RESERVED_NAMES } from "../primitives.js";
+class Scope {
+    parent;
+    funcId;
+    names = new Map();
+    constructor(parent, funcId) {
+        this.parent = parent;
+        this.funcId = funcId;
+    }
+    declare(b) {
+        this.names.set(b.name, b);
+    }
+    resolve(name) {
+        for (let s = this; s !== null; s = s.parent) {
+            const b = s.names.get(name);
+            if (b !== undefined)
+                return b;
+        }
+        return undefined;
+    }
+}
+class Walk {
+    bindingOf = new Map();
+    bindings = [];
+    nextFunc = 0;
+    /**
+     * The functions currently open, outermost first. The dead-zone rule reads the path from a use out
+     * to its binding.
+     */
+    fns = [];
+    /** The statement being walked. A function literal's "enclosing statement" is this one. */
+    stmtStart = 0;
+    declare(scope, name, kind, declEnd = null) {
+        const b = { name, kind, funcId: scope.funcId, declEnd, cell: false, deadZone: false };
+        this.bindings.push(b);
+        scope.declare(b);
+        return b;
+    }
+    /** A reference: record where it resolved, so the emitter reads the answer rather than recomputing it. */
+    ref(node, scope) {
+        const b = scope.resolve(node.name);
+        // A name the program never declared is a free name (a builtin, a primitive, `undefined`). The
+        // validator refuses shadowing a reserved name, so resolution cannot disagree with that table.
+        if (b !== undefined) {
+            this.bindingOf.set(node, b);
+            this.deadZone(b);
+        }
+    }
+    /**
+     * The dead-zone rule: which captured bindings can be READ BEFORE THEY HOLD A VALUE, and so must
+     * be cells.
+     *
+     * The walker refuses that read L2004 (a code a program can catch and read) while a native
+     * JavaScript binding answers a host ReferenceError, which `caught` can only report as L4000/host.
+     * So a binding a closure could read early becomes a record, `get` answers L2004 for it by name,
+     * and the two engines agree. Same-block direct reads never reach here: the validator refuses them
+     * (measured, `log(x); const x = 1;` is a validation error).
+     *
+     * The rule, as ruled, over the path from the read out to the binding's own scope:
+     *   (i)  ANY hoisted `function` declaration on the path, at any depth, because an arrow inside a
+     *        hoisted function called early is reachable just the same (measured: `const r = f()` with
+     *        `function f() { const g = () => x; return g(); }` and `const x = 1` after is L2004); or
+     *   (ii) the OUTERMOST function on the path is an expression whose enclosing statement is not
+     *        textually after the end of the declarator, which deliberately includes an arrow inside
+     *        the binding's own initializer, since `const x = (() => x)()` is L2004 (measured).
+     * Every other captured binding stays native, and that class keeps its own evidence: `const x = 1`
+     * followed by a closure reading it answers 1 on both engines.
+     */
+    deadZone(b) {
+        if (b.declEnd === null)
+            return;
+        const at = this.fns.findIndex((f) => f.funcId === b.funcId);
+        const path = this.fns.slice(at + 1);
+        if (path.length === 0)
+            return;
+        if (path.some((f) => f.hoisted) || path[0].stmtStart < b.declEnd) {
+            b.cell = true;
+            b.deadZone = true;
+        }
+    }
+    /** A write to a binding. The cell rule is here and nowhere else. */
+    write(node, scope, funcId) {
+        const b = scope.resolve(node.name);
+        if (b === undefined)
+            return;
+        this.bindingOf.set(node, b);
+        if (b.funcId !== funcId && b.kind !== "const")
+            b.cell = true;
+        // AND THE SAME RULE OVER WRITES, added after the read half landed. A write reaches the dead
+        // zone by the same path a read does. Measured on the walker, `n = 2` inside a hoisted
+        // `function` called
+        // before `let n = 1` is a CATCHABLE L2004 and `n` still reads 1 afterwards, so the same
+        // predicate decides it, and the record has to be hoisted for the same reason: an unhoisted one
+        // is still in its own temporal dead zone when the early write evaluates the argument, and the
+        // native ReferenceError never reaches the seam.
+        this.deadZone(b);
+    }
+    /**
+     * The names a declaration or a parameter introduces, declared into `scope`.
+     *
+     * The declaring Identifier node is recorded in `bindingOf` too, not only its references: the
+     * emitter asks the same question at a declaration as at a use (is this a cell?), and answering
+     * "no" for every declaration because the node was not in the map is a cell that is emitted as a
+     * plain binding, with the L2032 refusal silently gone.
+     */
+    declarePattern(node, scope, kind, declEnd = null) {
+        switch (node.type) {
+            case "Identifier":
+                this.bindingOf.set(node, this.declare(scope, node.name, kind, declEnd));
+                return;
+            case "AssignmentPattern":
+                this.declarePattern(node.left, scope, kind, declEnd);
+                return;
+            case "RestElement":
+                this.declarePattern(node.argument, scope, kind, declEnd);
+                return;
+            case "ObjectPattern":
+                for (const p of node.properties ?? []) {
+                    this.declarePattern((p.type === "RestElement" ? p.argument : p.value), scope, kind, declEnd);
+                }
+                return;
+            case "ArrayPattern":
+                for (const el of node.elements ?? []) {
+                    if (el !== null && el !== undefined)
+                        this.declarePattern(el, scope, kind, declEnd);
+                }
+                return;
+            default:
+                return;
+        }
+    }
+    /** The expressions INSIDE a declaration pattern (a default value, a computed key). */
+    patternExprs(node, scope, funcId) {
+        switch (node.type) {
+            case "AssignmentPattern":
+                this.patternExprs(node.left, scope, funcId);
+                this.expr(node.right, scope, funcId);
+                return;
+            case "RestElement":
+                this.patternExprs(node.argument, scope, funcId);
+                return;
+            case "ObjectPattern":
+                for (const p of node.properties ?? []) {
+                    if (p.type === "RestElement") {
+                        this.patternExprs(p.argument, scope, funcId);
+                        continue;
+                    }
+                    if (p.computed === true)
+                        this.expr(p.key, scope, funcId);
+                    this.patternExprs(p.value, scope, funcId);
+                }
+                return;
+            case "ArrayPattern":
+                for (const el of node.elements ?? []) {
+                    if (el !== null && el !== undefined)
+                        this.patternExprs(el, scope, funcId);
+                }
+                return;
+            default:
+                return;
+        }
+    }
+    /** An ASSIGNMENT pattern: `[a, b] = [b, a]`. Its names are written, not declared. */
+    assignPattern(node, scope, funcId) {
+        switch (node.type) {
+            case "Identifier":
+                this.write(node, scope, funcId);
+                return;
+            case "MemberExpression":
+                this.expr(node, scope, funcId);
+                return;
+            case "AssignmentPattern":
+                this.assignPattern(node.left, scope, funcId);
+                this.expr(node.right, scope, funcId);
+                return;
+            case "RestElement":
+                this.assignPattern(node.argument, scope, funcId);
+                return;
+            case "ObjectPattern":
+                for (const p of node.properties ?? []) {
+                    if (p.type === "RestElement") {
+                        this.assignPattern(p.argument, scope, funcId);
+                        continue;
+                    }
+                    if (p.computed === true)
+                        this.expr(p.key, scope, funcId);
+                    this.assignPattern(p.value, scope, funcId);
+                }
+                return;
+            case "ArrayPattern":
+                for (const el of node.elements ?? []) {
+                    if (el !== null && el !== undefined)
+                        this.assignPattern(el, scope, funcId);
+                }
+                return;
+            default:
+                return;
+        }
+    }
+    /**
+     * A function: its own scope, its own id. The id is what the cell rule compares: a write from a
+     * different function id than the declaration's is a write from a frame the walker would have
+     * charged a deeper depth.
+     */
+    fn(node, outer) {
+        this.nextFunc += 1;
+        const funcId = this.nextFunc;
+        const scope = new Scope(outer, funcId);
+        this.fns.push({ funcId, hoisted: node.type === "FunctionDeclaration", stmtStart: this.stmtStart });
+        try {
+            this.fnBody(node, scope, funcId);
+        }
+        finally {
+            this.fns.pop();
+        }
+    }
+    fnBody(node, scope, funcId) {
+        // A named function expression sees its own name, exactly as the walker's `makeFunction` binds it.
+        if (node.type === "FunctionExpression" && node.id !== null && node.id !== undefined) {
+            this.declare(scope, node.id.name, "function");
+        }
+        for (const p of node.params ?? [])
+            this.declarePattern(p, scope, "param");
+        for (const p of node.params ?? [])
+            this.patternExprs(p, scope, funcId);
+        const body = node.body;
+        if (body.type === "BlockStatement")
+            this.block(body, scope, funcId);
+        else
+            this.expr(body, scope, funcId);
+    }
+    /** A block: hoist its function declarations and its dead-zone names, then walk it. */
+    block(node, outer, funcId) {
+        const scope = new Scope(outer, funcId);
+        const body = node.body ?? [];
+        for (const s of body) {
+            if (s.type === "FunctionDeclaration")
+                this.declare(scope, s.id.name, "function");
+        }
+        for (const s of body) {
+            if (s.type !== "VariableDeclaration")
+                continue;
+            for (const d of s.declarations ?? []) {
+                this.declarePattern(d.id, scope, s.kind === "let" ? "let" : "const", d.end);
+            }
+        }
+        for (const s of body)
+            this.stmt(s, scope, funcId);
+    }
+    stmt(node, scope, funcId) {
+        const outer = this.stmtStart;
+        this.stmtStart = node.start;
+        try {
+            this.statement(node, scope, funcId);
+        }
+        finally {
+            this.stmtStart = outer;
+        }
+    }
+    statement(node, scope, funcId) {
+        switch (node.type) {
+            case "ExpressionStatement":
+                this.expr(node.expression, scope, funcId);
+                return;
+            case "VariableDeclaration":
+                for (const d of node.declarations ?? []) {
+                    this.patternExprs(d.id, scope, funcId);
+                    if (d.init !== null && d.init !== undefined)
+                        this.expr(d.init, scope, funcId);
+                }
+                return;
+            case "FunctionDeclaration":
+                this.fn(node, scope);
+                return;
+            case "BlockStatement":
+                this.block(node, scope, funcId);
+                return;
+            case "IfStatement":
+                this.expr(node.test, scope, funcId);
+                this.stmt(node.consequent, scope, funcId);
+                if (node.alternate !== null && node.alternate !== undefined)
+                    this.stmt(node.alternate, scope, funcId);
+                return;
+            case "WhileStatement":
+                this.expr(node.test, scope, funcId);
+                this.stmt(node.body, scope, funcId);
+                return;
+            case "ForStatement": {
+                const head = new Scope(scope, funcId);
+                const init = node.init;
+                if (init !== null && init !== undefined) {
+                    if (init.type === "VariableDeclaration") {
+                        for (const d of init.declarations ?? []) {
+                            this.declarePattern(d.id, head, init.kind === "let" ? "let" : "const");
+                        }
+                        this.stmt(init, head, funcId);
+                    }
+                    else {
+                        this.expr(init, head, funcId);
+                    }
+                }
+                if (node.test !== null && node.test !== undefined)
+                    this.expr(node.test, head, funcId);
+                if (node.update !== null && node.update !== undefined)
+                    this.expr(node.update, head, funcId);
+                this.stmt(node.body, head, funcId);
+                return;
+            }
+            case "ForOfStatement": {
+                this.expr(node.right, scope, funcId);
+                const head = new Scope(scope, funcId);
+                const left = node.left;
+                if (left.type === "VariableDeclaration") {
+                    const target = left.declarations[0].id;
+                    this.declarePattern(target, head, left.kind === "let" ? "let" : "const");
+                    this.patternExprs(target, head, funcId);
+                }
+                else {
+                    this.assignPattern(left, head, funcId);
+                }
+                this.stmt(node.body, head, funcId);
+                return;
+            }
+            case "ReturnStatement":
+            case "ThrowStatement":
+                if (node.argument !== null && node.argument !== undefined)
+                    this.expr(node.argument, scope, funcId);
+                return;
+            case "BreakStatement":
+            case "ContinueStatement":
+            case "EmptyStatement":
+                return;
+            case "TryStatement": {
+                this.block(node.block, scope, funcId);
+                const handler = node.handler;
+                if (handler !== null && handler !== undefined) {
+                    const catchScope = new Scope(scope, funcId);
+                    if (handler.param !== null && handler.param !== undefined) {
+                        this.declarePattern(handler.param, catchScope, "let");
+                        this.patternExprs(handler.param, catchScope, funcId);
+                    }
+                    this.block(handler.body, catchScope, funcId);
+                }
+                if (node.finalizer !== null && node.finalizer !== undefined)
+                    this.block(node.finalizer, scope, funcId);
+                return;
+            }
+            case "SwitchStatement": {
+                this.expr(node.discriminant, scope, funcId);
+                // One scope for the whole switch, as the walker's `switchEnv` is: a `let` in one clause is
+                // visible in the next, which is what falling through means.
+                const switchScope = new Scope(scope, funcId);
+                const cases = node.cases ?? [];
+                for (const c of cases) {
+                    for (const s of c.consequent ?? []) {
+                        if (s.type === "FunctionDeclaration")
+                            this.declare(switchScope, s.id.name, "function");
+                    }
+                }
+                for (const c of cases) {
+                    for (const s of c.consequent ?? []) {
+                        if (s.type !== "VariableDeclaration")
+                            continue;
+                        for (const d of s.declarations ?? []) {
+                            this.declarePattern(d.id, switchScope, s.kind === "let" ? "let" : "const");
+                        }
+                    }
+                }
+                for (const c of cases) {
+                    if (c.test !== null && c.test !== undefined)
+                        this.expr(c.test, switchScope, funcId);
+                    for (const s of c.consequent ?? [])
+                        this.stmt(s, switchScope, funcId);
+                }
+                return;
+            }
+            default:
+                return;
+        }
+    }
+    expr(node, scope, funcId) {
+        switch (node.type) {
+            case "Literal":
+                return;
+            case "Identifier":
+                this.ref(node, scope);
+                return;
+            case "TemplateLiteral":
+                for (const e of node.expressions ?? [])
+                    this.expr(e, scope, funcId);
+                return;
+            case "ArrayExpression":
+                for (const el of node.elements ?? []) {
+                    if (el === null || el === undefined)
+                        continue;
+                    this.expr((el.type === "SpreadElement" ? el.argument : el), scope, funcId);
+                }
+                return;
+            case "ObjectExpression":
+                for (const p of node.properties ?? []) {
+                    if (p.type === "SpreadElement") {
+                        this.expr(p.argument, scope, funcId);
+                        continue;
+                    }
+                    if (p.computed === true)
+                        this.expr(p.key, scope, funcId);
+                    this.expr(p.value, scope, funcId);
+                }
+                return;
+            case "MemberExpression":
+                this.expr(node.object, scope, funcId);
+                if (node.computed === true)
+                    this.expr(node.property, scope, funcId);
+                return;
+            case "ChainExpression":
+                this.expr(node.expression, scope, funcId);
+                return;
+            case "UnaryExpression":
+                this.expr(node.argument, scope, funcId);
+                return;
+            case "UpdateExpression": {
+                const arg = node.argument;
+                if (arg.type === "Identifier")
+                    this.write(arg, scope, funcId);
+                else
+                    this.expr(arg, scope, funcId);
+                return;
+            }
+            case "BinaryExpression":
+            case "LogicalExpression":
+                this.expr(node.left, scope, funcId);
+                this.expr(node.right, scope, funcId);
+                return;
+            case "ConditionalExpression":
+                this.expr(node.test, scope, funcId);
+                this.expr(node.consequent, scope, funcId);
+                this.expr(node.alternate, scope, funcId);
+                return;
+            case "AssignmentExpression": {
+                const left = node.left;
+                if (left.type === "Identifier")
+                    this.write(left, scope, funcId);
+                else if (left.type === "MemberExpression")
+                    this.expr(left, scope, funcId);
+                else
+                    this.assignPattern(left, scope, funcId);
+                this.expr(node.right, scope, funcId);
+                return;
+            }
+            case "AwaitExpression":
+                this.expr(node.argument, scope, funcId);
+                return;
+            case "ArrowFunctionExpression":
+            case "FunctionExpression":
+                this.fn(node, scope);
+                return;
+            case "CallExpression":
+                this.expr(node.callee, scope, funcId);
+                for (const a of node.arguments ?? []) {
+                    this.expr((a.type === "SpreadElement" ? a.argument : a), scope, funcId);
+                }
+                return;
+            default:
+                return;
+        }
+    }
+}
+/**
+ * Resolve every name in a validated program and mark the cells.
+ *
+ * Reserved names are never declared by a program (the validator refuses shadowing one), so a name
+ * that resolves to nothing here is a free name and the emitter routes it through the seam.
+ */
+export function analyze(program) {
+    const w = new Walk();
+    const root = new Scope(null, 0);
+    w.block(program, root, 0);
+    return { bindingOf: w.bindingOf, bindings: w.bindings };
+}
+/** The free names a program may reference without declaring. Read from the language's own table. */
+export const FREE_NAMES = RESERVED_NAMES;
+//# sourceMappingURL=scope.js.map

package/dist/transform/scope.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scope.js","sourceRoot":"","sources":["../../src/transform/scope.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAiClD,MAAM,KAAK;IAGE;IACA;IAHF,KAAK,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC5C,YACW,MAAoB,EACpB,MAAc;QADd,WAAM,GAAN,MAAM,CAAc;QACpB,WAAM,GAAN,MAAM,CAAQ;IACtB,CAAC;IAEJ,OAAO,CAAC,CAAU;QAChB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC5B,CAAC;IAED,OAAO,CAAC,IAAY;QAClB,KAAK,IAAI,CAAC,GAAiB,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;YAC1D,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,CAAC,KAAK,SAAS;gBAAE,OAAO,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAWD,MAAM,IAAI;IACC,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,QAAQ,GAAc,EAAE,CAAC;IAC1B,QAAQ,GAAG,CAAC,CAAC;IACrB;;;OAGG;IACc,GAAG,GAAgB,EAAE,CAAC;IACvC,0FAA0F;IAClF,SAAS,GAAG,CAAC,CAAC;IAEd,OAAO,CAAC,KAAY,EAAE,IAAY,EAAE,IAAqB,EAAE,UAAyB,IAAI;QAC9F,MAAM,CAAC,GAAY,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;QAC/F,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,yGAAyG;IACjG,GAAG,CAAC,IAAa,EAAE,KAAY;QACrC,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAc,CAAC,CAAC;QAC7C,8FAA8F;QAC9F,8FAA8F;QAC9F,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACK,QAAQ,CAAC,CAAU;QACzB,IAAI,CAAC,CAAC,OAAO,KAAK,IAAI;YAAE,OAAO;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC;QAC5D,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAC9B,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAK,IAAI,CAAC,CAAC,CAAe,CAAC,SAAS,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC;YAChF,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC;YACd,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC;QACpB,CAAC;IACH,CAAC;IAED,oEAAoE;IAC5D,KAAK,CAAC,IAAa,EAAE,KAAY,EAAE,MAAc;QACvD,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAc,CAAC,CAAC;QAC7C,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO;QAC5B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO;YAAE,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC;QAC7D,4FAA4F;QAC5F,sFAAsF;QACtF,oBAAoB;QACpB,wFAAwF;QACxF,+FAA+F;QAC/F,8FAA8F;QAC9F,gDAAgD;QAChD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACK,cAAc,CAAC,IAAa,EAAE,KAAY,EAAE,IAAqB,EAAE,UAAyB,IAAI;QACtG,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,YAAY;gBACf,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,IAAc,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;gBAClF,OAAO;YACT,KAAK,mBAAmB;gBACtB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAe,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;gBAChE,OAAO;YACT,KAAK,aAAa;gBAChB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAmB,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;gBACpE,OAAO;YACT,KAAK,eAAe;gBAClB,KAAK,MAAM,CAAC,IAAK,IAAI,CAAC,UAAwB,IAAI,EAAE,EAAE,CAAC;oBACrD,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAY,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;gBAC1G,CAAC;gBACD,OAAO;YACT,KAAK,cAAc;gBACjB,KAAK,MAAM,EAAE,IAAK,IAAI,CAAC,QAA+B,IAAI,EAAE,EAAE,CAAC;oBAC7D,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,SAAS;wBAAE,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;gBACrF,CAAC;gBACD,OAAO;YACT;gBACE,OAAO;QACX,CAAC;IACH,CAAC;IAED,sFAAsF;IAC9E,YAAY,CAAC,IAAa,EAAE,KAAY,EAAE,MAAc;QAC9D,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,mBAAmB;gBACtB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAe,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACvD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAgB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAChD,OAAO;YACT,KAAK,aAAa;gBAChB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,QAAmB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC3D,OAAO;YACT,KAAK,eAAe;gBAClB,KAAK,MAAM,CAAC,IAAK,IAAI,CAAC,UAAwB,IAAI,EAAE,EAAE,CAAC;oBACrD,IAAI,CAAC,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;wBAC7B,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,QAAmB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;wBACxD,SAAS;oBACX,CAAC;oBACD,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI;wBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAc,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;oBACpE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAgB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACvD,CAAC;gBACD,OAAO;YACT,KAAK,cAAc;gBACjB,KAAK,MAAM,EAAE,IAAK,IAAI,CAAC,QAA+B,IAAI,EAAE,EAAE,CAAC;oBAC7D,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,SAAS;wBAAE,IAAI,CAAC,YAAY,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC5E,CAAC;gBACD,OAAO;YACT;gBACE,OAAO;QACX,CAAC;IACH,CAAC;IAED,qFAAqF;IAC7E,aAAa,CAAC,IAAa,EAAE,KAAY,EAAE,MAAc;QAC/D,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,YAAY;gBACf,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAChC,OAAO;YACT,KAAK,kBAAkB;gBACrB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC/B,OAAO;YACT,KAAK,mBAAmB;gBACtB,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAe,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACxD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAgB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAChD,OAAO;YACT,KAAK,aAAa;gBAChB,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAmB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC5D,OAAO;YACT,KAAK,eAAe;gBAClB,KAAK,MAAM,CAAC,IAAK,IAAI,CAAC,UAAwB,IAAI,EAAE,EAAE,CAAC;oBACrD,IAAI,CAAC,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;wBAC7B,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,QAAmB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;wBACzD,SAAS;oBACX,CAAC;oBACD,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI;wBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAc,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;oBACpE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,KAAgB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACxD,CAAC;gBACD,OAAO;YACT,KAAK,cAAc;gBACjB,KAAK,MAAM,EAAE,IAAK,IAAI,CAAC,QAA+B,IAAI,EAAE,EAAE,CAAC;oBAC7D,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,SAAS;wBAAE,IAAI,CAAC,aAAa,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC7E,CAAC;gBACD,OAAO;YACT;gBACE,OAAO;QACX,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,EAAE,CAAC,IAAa,EAAE,KAAY;QACpC,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACnB,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC7B,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACvC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,KAAK,qBAAqB,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;QACnG,IAAI,CAAC;YACH,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QACnC,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;QACjB,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,IAAa,EAAE,KAAY,EAAE,MAAc;QACxD,kGAAkG;QAClG,IAAI,IAAI,CAAC,IAAI,KAAK,oBAAoB,IAAI,IAAI,CAAC,EAAE,KAAK,IAAI,IAAI,IAAI,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;YACpF,IAAI,CAAC,OAAO,CAAC,KAAK,EAAG,IAAI,CAAC,EAAc,CAAC,IAAc,EAAE,UAAU,CAAC,CAAC;QACvE,CAAC;QACD,KAAK,MAAM,CAAC,IAAK,IAAI,CAAC,MAAoB,IAAI,EAAE;YAAE,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QACzF,KAAK,MAAM,CAAC,IAAK,IAAI,CAAC,MAAoB,IAAI,EAAE;YAAE,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QACtF,MAAM,IAAI,GAAG,IAAI,CAAC,IAAe,CAAC;QAClC,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB;YAAE,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;;YAC/D,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IACtC,CAAC;IAED,sFAAsF;IACtF,KAAK,CAAC,IAAa,EAAE,KAAY,EAAE,MAAc;QAC/C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACvC,MAAM,IAAI,GAAI,IAAI,CAAC,IAAkB,IAAI,EAAE,CAAC;QAC5C,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,CAAC,IAAI,KAAK,qBAAqB;gBAAE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAI,CAAC,CAAC,EAAc,CAAC,IAAe,EAAE,UAAU,CAAC,CAAC;QAC5G,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,CAAC,IAAI,KAAK,qBAAqB;gBAAE,SAAS;YAC/C,KAAK,MAAM,CAAC,IAAK,CAAC,CAAC,YAA0B,IAAI,EAAE,EAAE,CAAC;gBACpD,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,EAAa,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,GAAa,CAAC,CAAC;YACnG,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IACpD,CAAC;IAED,IAAI,CAAC,IAAa,EAAE,KAAY,EAAE,MAAc;QAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,KAAe,CAAC;QACtC,IAAI,CAAC;YACH,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QACtC,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACzB,CAAC;IACH,CAAC;IAEO,SAAS,CAAC,IAAa,EAAE,KAAY,EAAE,MAAc;QAC3D,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,qBAAqB;gBACxB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAqB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACrD,OAAO;YACT,KAAK,qBAAqB;gBACxB,KAAK,MAAM,CAAC,IAAK,IAAI,CAAC,YAA0B,IAAI,EAAE,EAAE,CAAC;oBACvD,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAa,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;oBAClD,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS;wBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAe,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC3F,CAAC;gBACD,OAAO;YACT,KAAK,qBAAqB;gBACxB,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBACrB,OAAO;YACT,KAAK,gBAAgB;gBACnB,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAChC,OAAO;YACT,KAAK,aAAa;gBAChB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAe,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC/C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAqB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACrD,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS;oBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAoB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACjH,OAAO;YACT,KAAK,gBAAgB;gBACnB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAe,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC/C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAe,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC/C,OAAO;YACT,KAAK,cAAc,CAAC,CAAC,CAAC;gBACpB,MAAM,IAAI,GAAG,IAAI,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBACtC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAsB,CAAC;gBACzC,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACxC,IAAI,IAAI,CAAC,IAAI,KAAK,qBAAqB,EAAE,CAAC;wBACxC,KAAK,MAAM,CAAC,IAAK,IAAI,CAAC,YAA0B,IAAI,EAAE,EAAE,CAAC;4BACvD,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,EAAa,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;wBACpF,CAAC;wBACD,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;oBAChC,CAAC;yBAAM,CAAC;wBACN,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;oBAChC,CAAC;gBACH,CAAC;gBACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;oBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAe,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;gBACjG,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;oBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAiB,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;gBACvG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAe,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;gBAC9C,OAAO;YACT,CAAC;YACD,KAAK,gBAAgB,CAAC,CAAC,CAAC;gBACtB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAgB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAChD,MAAM,IAAI,GAAG,IAAI,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBACtC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAe,CAAC;gBAClC,IAAI,IAAI,CAAC,IAAI,KAAK,qBAAqB,EAAE,CAAC;oBACxC,MAAM,MAAM,GAAK,IAAI,CAAC,YAA0B,CAAC,CAAC,CAAa,CAAC,EAAa,CAAC;oBAC9E,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;oBACzE,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;gBAC1C,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;gBACzC,CAAC;gBACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAe,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;gBAC9C,OAAO;YACT,CAAC;YACD,KAAK,iBAAiB,CAAC;YACvB,KAAK,gBAAgB;gBACnB,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;oBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAmB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC9G,OAAO;YACT,KAAK,gBAAgB,CAAC;YACtB,KAAK,mBAAmB,CAAC;YACzB,KAAK,gBAAgB;gBACnB,OAAO;YACT,KAAK,cAAc,CAAC,CAAC,CAAC;gBACpB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAgB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACjD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAyB,CAAC;gBAC/C,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;oBAC9C,MAAM,UAAU,GAAG,IAAI,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;oBAC5C,IAAI,OAAO,CAAC,KAAK,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;wBAC1D,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,KAAgB,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;wBACjE,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,KAAgB,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;oBAClE,CAAC;oBACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAe,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;gBAC1D,CAAC;gBACD,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS;oBAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAoB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAClH,OAAO;YACT,CAAC;YACD,KAAK,iBAAiB,CAAC,CAAC,CAAC;gBACvB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,YAAuB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACvD,2FAA2F;gBAC3F,4DAA4D;gBAC5D,MAAM,WAAW,GAAG,IAAI,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC7C,MAAM,KAAK,GAAI,IAAI,CAAC,KAAmB,IAAI,EAAE,CAAC;gBAC9C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;oBACtB,KAAK,MAAM,CAAC,IAAK,CAAC,CAAC,UAAwB,IAAI,EAAE,EAAE,CAAC;wBAClD,IAAI,CAAC,CAAC,IAAI,KAAK,qBAAqB;4BAAE,IAAI,CAAC,OAAO,CAAC,WAAW,EAAI,CAAC,CAAC,EAAc,CAAC,IAAe,EAAE,UAAU,CAAC,CAAC;oBAClH,CAAC;gBACH,CAAC;gBACD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;oBACtB,KAAK,MAAM,CAAC,IAAK,CAAC,CAAC,UAAwB,IAAI,EAAE,EAAE,CAAC;wBAClD,IAAI,CAAC,CAAC,IAAI,KAAK,qBAAqB;4BAAE,SAAS;wBAC/C,KAAK,MAAM,CAAC,IAAK,CAAC,CAAC,YAA0B,IAAI,EAAE,EAAE,CAAC;4BACpD,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,EAAa,EAAE,WAAW,EAAE,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;wBACxF,CAAC;oBACH,CAAC;gBACH,CAAC;gBACD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;oBACtB,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS;wBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAe,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;oBAC/F,KAAK,MAAM,CAAC,IAAK,CAAC,CAAC,UAAwB,IAAI,EAAE;wBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;gBACvF,CAAC;gBACD,OAAO;YACT,CAAC;YACD;gBACE,OAAO;QACX,CAAC;IACH,CAAC;IAED,IAAI,CAAC,IAAa,EAAE,KAAY,EAAE,MAAc;QAC9C,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,SAAS;gBACZ,OAAO;YACT,KAAK,YAAY;gBACf,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBACtB,OAAO;YACT,KAAK,iBAAiB;gBACpB,KAAK,MAAM,CAAC,IAAK,IAAI,CAAC,WAAyB,IAAI,EAAE;oBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACnF,OAAO;YACT,KAAK,iBAAiB;gBACpB,KAAK,MAAM,EAAE,IAAK,IAAI,CAAC,QAA+B,IAAI,EAAE,EAAE,CAAC;oBAC7D,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,SAAS;wBAAE,SAAS;oBAC9C,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAY,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACxF,CAAC;gBACD,OAAO;YACT,KAAK,kBAAkB;gBACrB,KAAK,MAAM,CAAC,IAAK,IAAI,CAAC,UAAwB,IAAI,EAAE,EAAE,CAAC;oBACrD,IAAI,CAAC,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;wBAC/B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,QAAmB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;wBAChD,SAAS;oBACX,CAAC;oBACD,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI;wBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAc,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;oBACpE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAgB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC/C,CAAC;gBACD,OAAO;YACT,KAAK,kBAAkB;gBACrB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAiB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACjD,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI;oBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAmB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC/E,OAAO;YACT,KAAK,iBAAiB;gBACpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAqB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACrD,OAAO;YACT,KAAK,iBAAiB;gBACpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAmB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACnD,OAAO;YACT,KAAK,kBAAkB,CAAC,CAAC,CAAC;gBACxB,MAAM,GAAG,GAAG,IAAI,CAAC,QAAmB,CAAC;gBACrC,IAAI,GAAG,CAAC,IAAI,KAAK,YAAY;oBAAE,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;;oBACzD,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACnC,OAAO;YACT,CAAC;YACD,KAAK,kBAAkB,CAAC;YACxB,KAAK,mBAAmB;gBACtB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAe,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC/C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAgB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAChD,OAAO;YACT,KAAK,uBAAuB;gBAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAe,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC/C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAqB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACrD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAoB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACpD,OAAO;YACT,KAAK,sBAAsB,CAAC,CAAC,CAAC;gBAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAe,CAAC;gBAClC,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY;oBAAE,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;qBAC3D,IAAI,IAAI,CAAC,IAAI,KAAK,kBAAkB;oBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;;oBACrE,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC7C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAgB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAChD,OAAO;YACT,CAAC;YACD,KAAK,iBAAiB;gBACpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAmB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACnD,OAAO;YACT,KAAK,yBAAyB,CAAC;YAC/B,KAAK,oBAAoB;gBACvB,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBACrB,OAAO;YACT,KAAK,gBAAgB;gBACnB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAiB,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACjD,KAAK,MAAM,CAAC,IAAK,IAAI,CAAC,SAAuB,IAAI,EAAE,EAAE,CAAC;oBACpD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAY,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACrF,CAAC;gBACD,OAAO;YACT;gBACE,OAAO;QACX,CAAC;IACH,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAC,OAAgB;IACtC,MAAM,CAAC,GAAG,IAAI,IAAI,EAAE,CAAC;IACrB,MAAM,IAAI,GAAG,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAC1B,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;AAC1D,CAAC;AAED,oGAAoG;AACpG,MAAM,CAAC,MAAM,UAAU,GAAwB,cAAc,CAAC"}

package/dist/transform/seam.d.ts

@@ -0,0 +1,78 @@
+/**
+ * The seam, as data: the members the emitted module may reach, and the names it may not collide with.
+ *
+ * The transform and its host share this seam, and neither side widens it on its own. That is
+ * mechanized from this file: `transform.smoke` re-parses the emitted string, resolves its scopes,
+ * and requires ZERO unbound references and every `<ctx>.<member>` it reaches to be listed here. A
+ * member added without changing this table is a change a reader sees in one place, not a call
+ * buried in an emitter.
+ */
+/**
+ * The members the seam grants, each with the range of ARGUMENT COUNTS the emitter may pass.
+ *
+ * The arity is written here rather than left implicit in the emitter because a member's shape is as
+ * much of the contract as its name, and the two that vary are exactly where a divergence hid from a
+ * names-only comparison: `call` grew a fourth and then a fifth argument for the optional call
+ * against a host member declared with three, and the differential found it rather than the surface.
+ * `transform.smoke` checks every emitted call site against this range in both directions - no site
+ * outside it, and no bound without a site that reaches it - and `engine.smoke` checks the host's
+ * `ctx` against the same table: names by set-equality, and `ctx[name].length === max` for each. That
+ * last is the contracted spelling, and it is `max` rather than `min` for a measured reason: a
+ * TypeScript optional parameter is a plain parameter after erasure and still counts toward
+ * `Function.length`, so a `<= min` rule
+ * would be vacuous on every fixed member and false on all four variadic ones. The MIN end cannot be
+ * read from a function at all - erasure has discarded which parameters were optional - so it is
+ * behavioural on the host's side: each variadic member has a cell calling it in its shortest form.
+ *
+ * `fuel` is the step check (budget L4013 + yield); `get`/`set`/`call` are the member law
+ * (L4014/L4018/L4020, curated tables, birth depth L2032, freeze L2031); `born` stamps a literal;
+ * `effect` is a journalled primitive, with a static per-call-site payload; `free` is a free name
+ * that journals nothing; `await` is the thenable gate; `template` is the interpolation law;
+ * `binary`/`unary` are the operator coercion law (L4018 + the operators' meaning); `iter` is the
+ * iterability law (L4015); `caught` heads every emitted catch clause (rethrow the six uncatchable
+ * classes, else the walker's frozen `{code, kind, message}` record).
+ */
+export declare const SEAM_MEMBERS: Readonly<Record<string, readonly [number, number]>>;
+/** The member NAMES the seam grants. Derived from the table above, so the two cannot disagree. */
+export declare const SEAM_RULED: ReadonlySet<string>;
+/**
+ * Members the emitter reaches that are SURFACED but not yet ruled.
+ *
+ * Kept apart from {@link SEAM_RULED} on purpose. The alternative to naming the debt is either to
+ * stop building or to let a proposed member sit indistinguishable from a granted one, and the
+ * second is the forbidden move wearing a green suite. `TransformMeta.proposed` reports which of
+ * these an emission actually reached, and `transform.smoke` pins that set, so the debt is a
+ * measured number rather than a memory.
+ */
+export declare const SEAM_PROPOSED: Readonly<Record<string, string>>;
+/**
+ * Every operator selector the emitter hands `unary`, and no other.
+ *
+ * `!` and `typeof` never reach here: neither can refuse, so both are emitted natively. `update` is
+ * `UpdateExpression`'s operand read, and it carries the coercion refusal rather than the walker's
+ * bare `Number(...)`. The walker's answer there (NaN for a record, 6 for `"5"++`) is the
+ * silent-coercion class, filed as issue 646 and carried as a declared divergence with named cells.
+ * An op set is as much a contract as a member name, which is why it is written down here rather
+ * than left implicit in the emitter.
+ */
+export declare const UNARY_OPS: readonly string[];
+/** Names chosen against the program's own identifier universe, so nothing the emitter needs can be shadowed. */
+export interface Names {
+    /** The ctx parameter. The validator admits a program-declared `__ctx` (measured), so this is computed, not fixed. */
+    readonly ctx: string;
+    /** Prefix for emitter temporaries. */
+    readonly temp: string;
+    /** Prefix for emitter labels. Labels have their own namespace in JavaScript, but the prefix keeps output readable. */
+    readonly label: string;
+}
+/**
+ * Pick emitter names that cannot collide with anything the program spells.
+ *
+ * The module shape is a CLOSED function expression with zero free identifiers. That replaced an
+ * earlier premise this file carried, which a review falsified: the validator admits `$x`, `__y`,
+ * and a program-declared `__ctx`. So the ctx parameter's name is derived from the source rather
+ * than assumed, and the derivation is deterministic: the same source picks the
+ * same names on every run, which is what makes `transform` byte-reproducible.
+ */
+export declare function pickNames(identifiers: ReadonlySet<string>): Names;
+//# sourceMappingURL=seam.d.ts.map

package/dist/transform/seam.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"seam.d.ts","sourceRoot":"","sources":["../../src/transform/seam.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,eAAO,MAAM,YAAY,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAyB3E,CAAC;AAEH,kGAAkG;AAClG,eAAO,MAAM,UAAU,EAAE,WAAW,CAAC,MAAM,CAAsC,CAAC;AAElF;;;;;;;;GAQG;AACH,eAAO,MAAM,aAAa,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAqB,CAAC;AAEjF;;;;;;;;;GASG;AACH,eAAO,MAAM,SAAS,EAAE,SAAS,MAAM,EAA6C,CAAC;AAErF,gHAAgH;AAChH,MAAM,WAAW,KAAK;IACpB,qHAAqH;IACrH,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,sCAAsC;IACtC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,sHAAsH;IACtH,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;;GAQG;AACH,wBAAgB,SAAS,CAAC,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,KAAK,CAcjE"}