@scriptc/compiler 0.0.9 → 0.0.11

package/dist/library/fence-eval.d.ts

@@ -0,0 +1,77 @@
+import { type SurfaceEntryKind } from "../coverage/surface-manifest.js";
+import { type ScrDiagnostic } from "../diagnostics/diagnostic.js";
+import type { IrModule } from "../ir/nodes.js";
+/** One raw fence declaration as the profile spelled it (validated for
+ * shape by the loader; resolved here against the manifest). */
+export interface LibraryFenceDecl {
+    /** JSON path for exact-path refusals: `determinism.fences[2]`. */
+    path: string;
+    id?: string;
+    prefix?: string;
+    teaching?: string;
+    remediation?: string;
+}
+/** The IR facts that witness one surface's reach in the compiled graph.
+ * A surface is reached exactly when any listed fact appears. */
+interface SurfaceDetector {
+    libFns?: readonly string[];
+    strMethods?: readonly string[];
+    arrMethods?: readonly string[];
+    mapMethods?: readonly string[];
+    setMethods?: readonly string[];
+}
+/** One manifest entry a fence covers, resolved and load-validated. */
+export interface FencedSurface {
+    id: string;
+    name: string;
+    kind: SurfaceEntryKind;
+    /** The diagnostic code the manifest entry carries (every non-static
+     * entry has one) — the code whose refusal the fence teaching rides. */
+    code?: string;
+    /** Present exactly when the entry is static (it compiles, so the fence
+     * must deny it): the reach witness. Absent = the surface already
+     * refuses with `code` and the fence changes only the message. */
+    detector?: SurfaceDetector;
+}
+export interface ResolvedLibraryFence {
+    /** The declared selector, for messages: `id 'stdlib.math.random'` or
+     * `prefix 'node-builtin.fs.'`. */
+    declared: string;
+    teaching?: string;
+    remediation?: string;
+    surfaces: readonly FencedSurface[];
+}
+/** Resolve the profile's fence declarations against this compiler
+ * release's surface manifest. Every failure returns the exact-path detail
+ * the loader wraps as SC4001. Selector strictness is RATIFIED: an id or
+ * prefix matching nothing refuses; a covered static entry no detector can
+ * police refuses (loudly, never silently inert). Compile-time-folded
+ * constants refuse as `id` fences (the message says why) and are exempt
+ * under a `prefix` — the family sweep stays usable, and the fold means
+ * there is genuinely nothing at runtime to deny. */
+export declare function resolveLibraryFences(decls: readonly LibraryFenceDecl[]): {
+    ok: true;
+    fences: ResolvedLibraryFence[];
+} | {
+    ok: false;
+    detail: string;
+};
+/** The structural slice of LibraryProfile the fence machinery reads —
+ * kept structural so this module never value-imports the loader. */
+export interface FenceProfileView {
+    name: string;
+    teachings: Readonly<Record<string, string>>;
+    fences: readonly ResolvedLibraryFence[];
+}
+/** Evaluate the profile's fences against the COMPILED module graph: every
+ * fenced static surface the graph reaches refuses as SC4008, anchored at
+ * the reaching construct, the fence's teaching attached as the attributed
+ * note. Unreached fences add nothing; a profile whose fences carry no
+ * detector-backed surface skips the walk entirely. */
+export declare function evaluateLibraryFences(mod: IrModule, profile: FenceProfileView): ScrDiagnostic[];
+/** Attach the profile's teaching text to every library-mode refusal it
+ * names — by code, by manifest id, or through a fence — as the visibly
+ * attributed `note`. Diagnostics already carrying a note (SC4008 threads
+ * its fence's teaching at mint time) pass through unchanged. */
+export declare function decorateLibraryRefusals(diagnostics: ScrDiagnostic[], profile: FenceProfileView): ScrDiagnostic[];
+export {};

package/dist/library/fence-eval.js

@@ -0,0 +1,395 @@
+/* Ask-5 determinism fences + the generalized teaching decoration.
+ *
+ * The profile's `determinism.fences` array denies surfaces BY SURFACE-
+ * MANIFEST ID (coverage/surface-manifest.ts — the compiler's one stable
+ * surface taxonomy; no new vocabulary). Resolution happens at profile
+ * load, against the manifest generated from this compiler's own tables:
+ *
+ *   - an `id` names exactly one manifest entry; a `prefix` fences every
+ *     entry it string-prefixes. An id or prefix matching NOTHING refuses
+ *     loudly at load (ratified): fences pin to a compiler release's
+ *     manifest, and a silently-inert fence is a footgun, so there is no
+ *     forward-compatible acceptance of unknown selectors.
+ *   - a fenced entry the static tier refuses anyway (status not "static")
+ *     needs no new machinery: the surface's own refusal fires, and the
+ *     fence's teaching rides it as the attributed note (spec §1: "changes
+ *     only the message").
+ *   - a fenced STATIC entry is policed against the COMPILED module graph:
+ *     the emit pass lowers only reachability-discovered bodies, so the
+ *     module IR *is* the reached graph — the same ground the sidecar's
+ *     `deterministic` attestation stands on (ir/nodes.ts's
+ *     moduleLibNondeterministicSurface). Fence evaluation reuses that
+ *     posture with one generic walk collecting the reached surface facts
+ *     (libCall spellings, str/arr/map/set intrinsic methods); each fenced
+ *     entry then answers by table-derived detector. Unreached fences cost
+ *     exactly this one walk — and no walk at all when no fence declares a
+ *     detector-backed surface.
+ *   - a fenced static entry with NO honest detector refuses at load,
+ *     never accepted-and-ignored. Two families are named specifically:
+ *     compile-time-folded constants (os.EOL, path.sep — the artifact
+ *     performs no runtime read a fence could deny) and desugared surfaces
+ *     (array map/filter/forEach and friends lower to plain loops with no
+ *     distinct trace).
+ *
+ * Detectors derive MECHANICALLY from the same lowering tables the
+ * manifest projects from (frontend/lowering/surfaces.ts), so a table row
+ * added later grows the fenceable surface without hand maintenance. Two
+ * aliased-lowering facts are inherited from the tables and deliberate:
+ * string trimLeft/trimRight share trimStart/trimEnd's IR method, and
+ * querystring decode/encode share parse/stringify's libCall — fencing one
+ * spelling fences the operation.
+ *
+ * decorateLibraryRefusals is the generalized teaching rider (spec §2):
+ * profile text attaches to ANY library-mode refusal by diagnostic code
+ * (the ratified SC4004/SC4005 rider's keys, "async" shared-key fallback
+ * included), by manifest id (matched against the refusal's code plus the
+ * entry's surface name in the message; diagnostic-fence entries match on
+ * code alone — the entry IS the code family), or by a fence entry
+ * covering the refused surface. The text renders as the diagnostic's
+ * `note`, always prefixed with the profile's name — the tool's message
+ * stays the tool's. */
+import { generateSurfaceManifest } from "../coverage/surface-manifest.js";
+import { libFenceDiag } from "../diagnostics/diagnostic.js";
+import { AMBIENT_SURFACE_FNS, BUILTIN_MODULE_CONSTS, BUILTIN_MODULE_FNS, BUILTIN_MODULE_FN_ALIASES, STATIC_MATH_FNS, STR_METHODS, } from "../frontend/lowering/surfaces.js";
+import { compilerReleaseVersion } from "./sidecar.js";
+let taxonomy = null;
+function builtinRootId(mod) {
+    return `node-builtin.${mod.split("/").join(".")}`;
+}
+function fenceTaxonomy() {
+    if (taxonomy !== null)
+        return taxonomy;
+    const manifest = generateSurfaceManifest(compilerReleaseVersion());
+    const byId = new Map(manifest.entries.map((e) => [e.id, e]));
+    const builtinFns = new Map();
+    const builtinRoots = new Map();
+    const foldedIds = new Set();
+    for (const [mod, members] of Object.entries(BUILTIN_MODULE_FNS)) {
+        const root = new Set();
+        for (const [member, entry] of Object.entries(members)) {
+            if (entry === undefined)
+                continue;
+            const fns = new Set([entry.fn]);
+            // The bare-path and url tables rebind per TARGET platform
+            // (builtinModuleFnsOf): a fence on the bare id covers both flavors.
+            if (mod === "path") {
+                const w = BUILTIN_MODULE_FNS["path/win32"]?.[member];
+                if (w !== undefined)
+                    fns.add(w.fn);
+            }
+            if (mod === "url" && member === "pathToFileURL")
+                fns.add("url.pathToFileURLWin32");
+            // Alternate spellings the dispatch special-cases around the table
+            // row (Buffer/fd/options forms) are the same surface.
+            for (const alias of BUILTIN_MODULE_FN_ALIASES[mod]?.[member] ?? [])
+                fns.add(alias);
+            builtinFns.set(`${builtinRootId(mod)}.${member}`, [...fns]);
+            for (const f of fns)
+                root.add(f);
+        }
+        if (root.size > 0)
+            builtinRoots.set(builtinRootId(mod), [...root]);
+    }
+    for (const [mod, members] of Object.entries(BUILTIN_MODULE_CONSTS)) {
+        for (const member of Object.keys(members))
+            foldedIds.add(`${builtinRootId(mod)}.${member}`);
+    }
+    const ambientFns = new Map(AMBIENT_SURFACE_FNS.map((row) => [row.id, row.fns]));
+    taxonomy = { byId, ids: manifest.entries.map((e) => e.id), builtinFns, builtinRoots, foldedIds, ambientFns };
+    return taxonomy;
+}
+/* ── classification: what policing a static entry means ───────────────── */
+/** Array methods with a distinct IR trace (arrIntrinsic methods). `push`
+ * includes the spread spelling — `a.push(...xs)` lowers to pushSpread and
+ * is the same surface. The rest of ARRAY_METHODS desugars to plain loops. */
+const ARR_DETECTABLE = {
+    push: ["push", "pushSpread"],
+    pop: ["pop"],
+    indexOf: ["indexOf"],
+    includes: ["includes"],
+    join: ["join"],
+    slice: ["slice"],
+};
+const MAP_DETECTABLE = new Set(["get", "set", "has", "delete", "clear"]);
+const SET_DETECTABLE = new Set(["add", "has", "delete", "clear"]);
+const DESUGARED_WHY = "it desugars at compile time into plain loops over iteration primitives, so the compiled graph carries no distinct trace to police";
+function classifySurface(entry, tax) {
+    // Non-static entries already refuse with their own code wherever they
+    // are reached — the fence's teaching rides that refusal.
+    if (entry.status !== "static")
+        return { kind: "refusal" };
+    if (tax.foldedIds.has(entry.id)) {
+        return {
+            kind: "unfenceable",
+            why: "reads of it fold to a per-binary constant at compile time — the artifact performs no runtime read a fence could deny",
+        };
+    }
+    // Ambient dedicated-path surfaces (Date/perf_hooks/process): the row
+    // that projected the entry carries its reach witness.
+    const ambient = tax.ambientFns.get(entry.id);
+    if (ambient !== undefined)
+        return { kind: "detector", detector: { libFns: ambient } };
+    const builtinFns = tax.builtinFns.get(entry.id);
+    if (builtinFns !== undefined)
+        return { kind: "detector", detector: { libFns: builtinFns } };
+    const rootFns = tax.builtinRoots.get(entry.id);
+    if (rootFns !== undefined)
+        return { kind: "detector", detector: { libFns: rootFns } };
+    const [, family, member] = entry.id.split(".");
+    if (entry.id.startsWith("stdlib.") && family !== undefined && member !== undefined) {
+        if (family === "math") {
+            const fn = Object.hasOwn(STATIC_MATH_FNS, member) ? STATIC_MATH_FNS[member] : undefined;
+            if (fn !== undefined)
+                return { kind: "detector", detector: { libFns: [fn.fn] } };
+        }
+        if (family === "string") {
+            const m = Object.hasOwn(STR_METHODS, member) ? STR_METHODS[member] : undefined;
+            if (m !== undefined)
+                return { kind: "detector", detector: { strMethods: [m.method] } };
+        }
+        if (family === "array") {
+            const methods = Object.hasOwn(ARR_DETECTABLE, member) ? ARR_DETECTABLE[member] : undefined;
+            if (methods !== undefined)
+                return { kind: "detector", detector: { arrMethods: methods } };
+            return { kind: "unfenceable", why: DESUGARED_WHY };
+        }
+        if (family === "map") {
+            if (MAP_DETECTABLE.has(member))
+                return { kind: "detector", detector: { mapMethods: [member] } };
+            return { kind: "unfenceable", why: DESUGARED_WHY };
+        }
+        if (family === "set") {
+            if (SET_DETECTABLE.has(member))
+                return { kind: "detector", detector: { setMethods: [member] } };
+            return { kind: "unfenceable", why: DESUGARED_WHY };
+        }
+    }
+    if (entry.id.startsWith("syntax.")) {
+        return {
+            kind: "unfenceable",
+            why: "it lowers to the same IR as its expanded spelling, so the compiled graph carries no distinct trace to police",
+        };
+    }
+    if (entry.id.startsWith("node-builtin.")) {
+        return {
+            kind: "unfenceable",
+            why: "its lowered surface leaves no tabled per-call trace at this compiler release — fence the member entries the manifest projects instead",
+        };
+    }
+    return { kind: "unfenceable", why: "no fence detector exists for it at this compiler release" };
+}
+/* ── load-time resolution ──────────────────────────────────────────────── */
+/** Resolve the profile's fence declarations against this compiler
+ * release's surface manifest. Every failure returns the exact-path detail
+ * the loader wraps as SC4001. Selector strictness is RATIFIED: an id or
+ * prefix matching nothing refuses; a covered static entry no detector can
+ * police refuses (loudly, never silently inert). Compile-time-folded
+ * constants refuse as `id` fences (the message says why) and are exempt
+ * under a `prefix` — the family sweep stays usable, and the fold means
+ * there is genuinely nothing at runtime to deny. */
+export function resolveLibraryFences(decls) {
+    const tax = fenceTaxonomy();
+    const fences = [];
+    for (const d of decls) {
+        const surfaces = [];
+        const keep = (entry, cls) => {
+            surfaces.push({
+                id: entry.id,
+                name: entry.name,
+                kind: entry.kind,
+                ...(entry.code !== undefined ? { code: entry.code } : {}),
+                ...(cls.kind === "detector" ? { detector: cls.detector } : {}),
+            });
+        };
+        if (d.id !== undefined) {
+            const entry = tax.byId.get(d.id);
+            if (entry === undefined) {
+                return {
+                    ok: false,
+                    detail: `'${d.path}.id' names no entry in this compiler release's surface manifest ('${d.id}') — ` +
+                        `fences pin to the release's manifest ids (the package ships surface-manifest.json), and an unknown id is refused, never accepted as inert`,
+                };
+            }
+            const cls = classifySurface(entry, tax);
+            if (cls.kind === "unfenceable") {
+                return { ok: false, detail: `'${d.path}.id' names '${d.id}', which cannot be fenced: ${cls.why}` };
+            }
+            keep(entry, cls);
+        }
+        else {
+            const covered = tax.ids.filter((id) => id.startsWith(d.prefix));
+            if (covered.length === 0) {
+                return {
+                    ok: false,
+                    detail: `'${d.path}.prefix' matches no entry in this compiler release's surface manifest ('${d.prefix}') — ` +
+                        `fences pin to the release's manifest ids (the package ships surface-manifest.json), and an unknown prefix is refused, never accepted as inert`,
+                };
+            }
+            for (const id of covered) {
+                const entry = tax.byId.get(id);
+                const cls = classifySurface(entry, tax);
+                if (cls.kind === "unfenceable") {
+                    if (tax.foldedIds.has(id))
+                        continue; // the fold IS the exemption — see above
+                    return { ok: false, detail: `'${d.path}.prefix' ('${d.prefix}') covers '${id}', which cannot be fenced: ${cls.why}` };
+                }
+                keep(entry, cls);
+            }
+            if (surfaces.length === 0) {
+                return {
+                    ok: false,
+                    detail: `'${d.path}.prefix' ('${d.prefix}') covers only compile-time-folded constants — there is nothing at runtime for the fence to deny`,
+                };
+            }
+        }
+        fences.push({
+            declared: d.id !== undefined ? `id '${d.id}'` : `prefix '${d.prefix}'`,
+            ...(d.teaching !== undefined ? { teaching: d.teaching } : {}),
+            ...(d.remediation !== undefined ? { remediation: d.remediation } : {}),
+            surfaces,
+        });
+    }
+    return { ok: true, fences };
+}
+/** One generic walk over the compiled module (the moduleLibAsyncSurface
+ * shape: nearest enclosing `loc` tracked so refusals anchor at the
+ * reaching construct), collecting every reached surface fact the fence
+ * detectors speak. First location per fact wins. */
+function collectReachedSurfaces(mod) {
+    const reached = {
+        libFns: new Map(),
+        strMethods: new Map(),
+        arrMethods: new Map(),
+        mapMethods: new Map(),
+        setMethods: new Map(),
+    };
+    const note = (map, key, loc) => {
+        if (!map.has(key))
+            map.set(key, loc);
+    };
+    const entryLoc = { file: mod.sourceFile, start: 0, end: 0 };
+    const visit = (v, loc) => {
+        if (v === null || typeof v !== "object")
+            return;
+        if (Array.isArray(v)) {
+            for (const item of v)
+                visit(item, loc);
+            return;
+        }
+        const node = v;
+        const here = node.loc ?? loc;
+        if (typeof node.kind === "string") {
+            if (node.kind === "libCall" && typeof node.fn === "string")
+                note(reached.libFns, node.fn, here);
+            else if (typeof node.method === "string") {
+                if (node.kind === "strIntrinsic")
+                    note(reached.strMethods, node.method, here);
+                else if (node.kind === "arrIntrinsic")
+                    note(reached.arrMethods, node.method, here);
+                else if (node.kind === "mapIntrinsic")
+                    note(reached.mapMethods, node.method, here);
+                else if (node.kind === "setIntrinsic")
+                    note(reached.setMethods, node.method, here);
+            }
+        }
+        for (const key of Object.keys(v))
+            visit(v[key], here);
+    };
+    visit(mod, entryLoc);
+    return reached;
+}
+function detectorHit(reached, det) {
+    const scan = (facts, keys) => {
+        for (const k of keys ?? []) {
+            const loc = facts.get(k);
+            if (loc !== undefined)
+                return loc;
+        }
+        return null;
+    };
+    return (scan(reached.libFns, det.libFns) ??
+        scan(reached.strMethods, det.strMethods) ??
+        scan(reached.arrMethods, det.arrMethods) ??
+        scan(reached.mapMethods, det.mapMethods) ??
+        scan(reached.setMethods, det.setMethods));
+}
+/** Evaluate the profile's fences against the COMPILED module graph: every
+ * fenced static surface the graph reaches refuses as SC4008, anchored at
+ * the reaching construct, the fence's teaching attached as the attributed
+ * note. Unreached fences add nothing; a profile whose fences carry no
+ * detector-backed surface skips the walk entirely. */
+export function evaluateLibraryFences(mod, profile) {
+    if (!profile.fences.some((f) => f.surfaces.some((s) => s.detector !== undefined)))
+        return [];
+    const reached = collectReachedSurfaces(mod);
+    const diags = [];
+    const seen = new Set();
+    for (const fence of profile.fences) {
+        for (const s of fence.surfaces) {
+            if (s.detector === undefined || seen.has(s.id))
+                continue;
+            const loc = detectorHit(reached, s.detector);
+            if (loc === null)
+                continue;
+            seen.add(s.id);
+            diags.push(libFenceDiag(profile.name, s.id, s.name, loc, s.code, fence.teaching));
+        }
+    }
+    return diags;
+}
+/* ── the generalized teaching rider ────────────────────────────────────── */
+function surfaceMatchesDiag(surface, diag) {
+    if (surface.code === undefined || surface.code !== diag.code)
+        return false;
+    // A diagnostic-fence entry IS the code family; member entries must also
+    // appear by name in the refusal's message (SC2020/SC2012 refusals spell
+    // the surface exactly as the manifest names it).
+    return surface.kind === "diagnostic-fence" || diag.message.includes(surface.name);
+}
+function teachingForRefusal(profile, diag) {
+    // 1. Code-keyed teachings — the ratified SC4004/SC4005 rider's keys,
+    // "async" shared-key fallback included (profile.ts's profileTeaching
+    // rule, restated here to keep the import graph acyclic).
+    const direct = profile.teachings[diag.code] ??
+        (diag.code === "SC4004" || diag.code === "SC4005" ? profile.teachings["async"] : undefined);
+    if (direct !== undefined)
+        return direct;
+    // 2. Manifest-id-keyed teachings (dotted keys — embedder refusal-code
+    // tokens never carry dots; an id key resolves against the taxonomy and
+    // attaches where that surface's refusal fired).
+    for (const [key, text] of Object.entries(profile.teachings)) {
+        if (!key.includes("."))
+            continue;
+        const entry = fenceTaxonomy().byId.get(key);
+        if (entry !== undefined && surfaceMatchesDiag(entry, diag))
+            return text;
+    }
+    // 3. A fence covering the refused surface: the teaching rides the
+    // surface's own refusal (the non-static half of fence coverage).
+    for (const fence of profile.fences) {
+        if (fence.teaching === undefined)
+            continue;
+        for (const s of fence.surfaces) {
+            if (surfaceMatchesDiag(s, diag))
+                return fence.teaching;
+        }
+    }
+    return undefined;
+}
+/** Attach the profile's teaching text to every library-mode refusal it
+ * names — by code, by manifest id, or through a fence — as the visibly
+ * attributed `note`. Diagnostics already carrying a note (SC4008 threads
+ * its fence's teaching at mint time) pass through unchanged. */
+export function decorateLibraryRefusals(diagnostics, profile) {
+    if (Object.keys(profile.teachings).length === 0 && profile.fences.length === 0)
+        return diagnostics;
+    return diagnostics.map((d) => {
+        if (d.note !== undefined)
+            return d;
+        const teaching = teachingForRefusal(profile, d);
+        if (teaching === undefined)
+            return d;
+        return { ...d, note: `from the '${profile.name}' profile: ${teaching}` };
+    });
+}
+//# sourceMappingURL=fence-eval.js.map

package/dist/library/fence-eval.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fence-eval.js","sourceRoot":"","sources":["../../src/library/fence-eval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;uBAiDuB;AACvB,OAAO,EAAE,uBAAuB,EAAoD,MAAM,iCAAiC,CAAC;AAC5H,OAAO,EAAE,YAAY,EAAsB,MAAM,8BAA8B,CAAC;AAChF,OAAO,EACL,mBAAmB,EACnB,qBAAqB,EACrB,kBAAkB,EAClB,yBAAyB,EACzB,eAAe,EACf,WAAW,GACZ,MAAM,kCAAkC,CAAC;AAE1C,OAAO,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAgEtD,IAAI,QAAQ,GAAyB,IAAI,CAAC;AAE1C,SAAS,aAAa,CAAC,GAAW;IAChC,OAAO,gBAAgB,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;AACpD,CAAC;AAED,SAAS,aAAa;IACpB,IAAI,QAAQ,KAAK,IAAI;QAAE,OAAO,QAAQ,CAAC;IACvC,MAAM,QAAQ,GAAG,uBAAuB,CAAC,sBAAsB,EAAE,CAAC,CAAC;IACnE,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,MAAM,UAAU,GAAG,IAAI,GAAG,EAA6B,CAAC;IACxD,MAAM,YAAY,GAAG,IAAI,GAAG,EAA6B,CAAC;IAC1D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC;QAChE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAQ,CAAC,EAAE,CAAC;YACvD,IAAI,KAAK,KAAK,SAAS;gBAAE,SAAS;YAClC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;YAChC,0DAA0D;YAC1D,oEAAoE;YACpE,IAAI,GAAG,KAAK,MAAM,EAAE,CAAC;gBACnB,MAAM,CAAC,GAAG,kBAAkB,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;gBACrD,IAAI,CAAC,KAAK,SAAS;oBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACrC,CAAC;YACD,IAAI,GAAG,KAAK,KAAK,IAAI,MAAM,KAAK,eAAe;gBAAE,GAAG,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC;YACnF,kEAAkE;YAClE,sDAAsD;YACtD,KAAK,MAAM,KAAK,IAAI,yBAAyB,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE;gBAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACnF,UAAU,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,MAAM,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YAC5D,KAAK,MAAM,CAAC,IAAI,GAAG;gBAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC;YAAE,YAAY,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IACrE,CAAC;IACD,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,qBAAqB,CAAC,EAAE,CAAC;QACnE,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,OAAQ,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC,CAAC;IAC/F,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAwB,CAAC,CAAC,CAAC,CAAC;IACrG,QAAQ,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC;IAC7G,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,6EAA6E;AAE7E;;6EAE6E;AAC7E,MAAM,cAAc,GAAkD;IACpE,IAAI,EAAE,CAAC,MAAM,EAAE,YAAY,CAAC;IAC5B,GAAG,EAAE,CAAC,KAAK,CAAC;IACZ,OAAO,EAAE,CAAC,SAAS,CAAC;IACpB,QAAQ,EAAE,CAAC,UAAU,CAAC;IACtB,IAAI,EAAE,CAAC,MAAM,CAAC;IACd,KAAK,EAAE,CAAC,OAAO,CAAC;CACjB,CAAC;AAEF,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC;AACzE,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC;AAOlE,MAAM,aAAa,GACjB,mIAAmI,CAAC;AAEtI,SAAS,eAAe,CAAC,KAA2B,EAAE,GAAkB;IACtE,sEAAsE;IACtE,yDAAyD;IACzD,IAAI,KAAK,CAAC,MAAM,KAAK,QAAQ;QAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;IAC1D,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;QAChC,OAAO;YACL,IAAI,EAAE,aAAa;YACnB,GAAG,EAAE,sHAAsH;SAC5H,CAAC;IACJ,CAAC;IACD,qEAAqE;IACrE,sDAAsD;IACtD,MAAM,OAAO,GAAG,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC7C,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,CAAC;IACtF,MAAM,UAAU,GAAG,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAChD,IAAI,UAAU,KAAK,SAAS;QAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,CAAC;IAC5F,MAAM,OAAO,GAAG,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC/C,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,CAAC;IACtF,MAAM,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC/C,IAAI,KAAK,CAAC,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACnF,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YACtB,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,eAAe,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACxF,IAAI,EAAE,KAAK,SAAS;gBAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACnF,CAAC;QACD,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC/E,IAAI,CAAC,KAAK,SAAS;gBAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;QACzF,CAAC;QACD,IAAI,MAAM,KAAK,OAAO,EAAE,CAAC;YACvB,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC3F,IAAI,OAAO,KAAK,SAAS;gBAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,EAAE,UAAU,EAAE,OAAO,EAAE,EAAE,CAAC;YAC1F,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,GAAG,EAAE,aAAa,EAAE,CAAC;QACrD,CAAC;QACD,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;YACrB,IAAI,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,EAAE,UAAU,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;YAChG,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,GAAG,EAAE,aAAa,EAAE,CAAC;QACrD,CAAC;QACD,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;YACrB,IAAI,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,EAAE,UAAU,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;YAChG,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,GAAG,EAAE,aAAa,EAAE,CAAC;QACrD,CAAC;IACH,CAAC;IACD,IAAI,KAAK,CAAC,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;QACnC,OAAO;YACL,IAAI,EAAE,aAAa;YACnB,GAAG,EAAE,8GAA8G;SACpH,CAAC;IACJ,CAAC;IACD,IAAI,KAAK,CAAC,EAAE,CAAC,UAAU,CAAC,eAAe,CAAC,EAAE,CAAC;QACzC,OAAO;YACL,IAAI,EAAE,aAAa;YACnB,GAAG,EAAE,uIAAuI;SAC7I,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,GAAG,EAAE,0DAA0D,EAAE,CAAC;AAClG,CAAC;AAED,8EAA8E;AAE9E;;;;;;;oDAOoD;AACpD,MAAM,UAAU,oBAAoB,CAClC,KAAkC;IAElC,MAAM,GAAG,GAAG,aAAa,EAAE,CAAC;IAC5B,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,QAAQ,GAAoB,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,CAAC,KAA2B,EAAE,GAAiB,EAAQ,EAAE;YACpE,QAAQ,CAAC,IAAI,CAAC;gBACZ,EAAE,EAAE,KAAK,CAAC,EAAE;gBACZ,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzD,GAAG,CAAC,GAAG,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC/D,CAAC,CAAC;QACL,CAAC,CAAC;QACF,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACjC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,OAAO;oBACL,EAAE,EAAE,KAAK;oBACT,MAAM,EACJ,IAAI,CAAC,CAAC,IAAI,qEAAqE,CAAC,CAAC,EAAE,OAAO;wBAC1F,2IAA2I;iBAC9I,CAAC;YACJ,CAAC;YACD,MAAM,GAAG,GAAG,eAAe,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACxC,IAAI,GAAG,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;gBAC/B,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI,eAAe,CAAC,CAAC,EAAE,8BAA8B,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC;YACrG,CAAC;YACD,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,MAAO,CAAC,CAAC,CAAC;YACjE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACzB,OAAO;oBACL,EAAE,EAAE,KAAK;oBACT,MAAM,EACJ,IAAI,CAAC,CAAC,IAAI,2EAA2E,CAAC,CAAC,MAAM,OAAO;wBACpG,+IAA+I;iBAClJ,CAAC;YACJ,CAAC;YACD,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACzB,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;gBAChC,MAAM,GAAG,GAAG,eAAe,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;gBACxC,IAAI,GAAG,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;oBAC/B,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;wBAAE,SAAS,CAAC,wCAAwC;oBAC7E,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI,cAAc,CAAC,CAAC,MAAM,cAAc,EAAE,8BAA8B,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC;gBACxH,CAAC;gBACD,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACnB,CAAC;YACD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1B,OAAO;oBACL,EAAE,EAAE,KAAK;oBACT,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI,cAAc,CAAC,CAAC,MAAM,kGAAkG;iBAC3I,CAAC;YACJ,CAAC;QACH,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;YACV,QAAQ,EAAE,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,MAAM,GAAG;YACtE,GAAG,CAAC,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7D,GAAG,CAAC,CAAC,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACtE,QAAQ;SACT,CAAC,CAAC;IACL,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;AAC9B,CAAC;AAYD;;;oDAGoD;AACpD,SAAS,sBAAsB,CAAC,GAAa;IAC3C,MAAM,OAAO,GAAoB;QAC/B,MAAM,EAAE,IAAI,GAAG,EAAE;QACjB,UAAU,EAAE,IAAI,GAAG,EAAE;QACrB,UAAU,EAAE,IAAI,GAAG,EAAE;QACrB,UAAU,EAAE,IAAI,GAAG,EAAE;QACrB,UAAU,EAAE,IAAI,GAAG,EAAE;KACtB,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,GAAwB,EAAE,GAAW,EAAE,GAAW,EAAQ,EAAE;QACxE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACvC,CAAC,CAAC;IACF,MAAM,QAAQ,GAAW,EAAE,IAAI,EAAE,GAAG,CAAC,UAAU,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;IACpE,MAAM,KAAK,GAAG,CAAC,CAAU,EAAE,GAAW,EAAQ,EAAE;QAC9C,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ;YAAE,OAAO;QAChD,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YACrB,KAAK,MAAM,IAAI,IAAI,CAAC;gBAAE,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACvC,OAAO;QACT,CAAC;QACD,MAAM,IAAI,GAAG,CAAqE,CAAC;QACnF,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC;QAC7B,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,OAAO,IAAI,CAAC,EAAE,KAAK,QAAQ;gBAAE,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;iBAC3F,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;gBACzC,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc;oBAAE,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;qBACzE,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc;oBAAE,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;qBAC9E,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc;oBAAE,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;qBAC9E,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc;oBAAE,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACrF,CAAC;QACH,CAAC;QACD,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,KAAK,CAAE,CAA6B,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;IACrF,CAAC,CAAC;IACF,KAAK,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IACrB,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,WAAW,CAAC,OAAwB,EAAE,GAAoB;IACjE,MAAM,IAAI,GAAG,CAAC,KAA0B,EAAE,IAAmC,EAAiB,EAAE;QAC9F,KAAK,MAAM,CAAC,IAAI,IAAI,IAAI,EAAE,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,GAAG,KAAK,SAAS;gBAAE,OAAO,GAAG,CAAC;QACpC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IACF,OAAO,CACL,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC;QAChC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC;QACxC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC;QACxC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC;QACxC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CACzC,CAAC;AACJ,CAAC;AAUD;;;;sDAIsD;AACtD,MAAM,UAAU,qBAAqB,CAAC,GAAa,EAAE,OAAyB;IAC5E,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IAC7F,MAAM,OAAO,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAoB,EAAE,CAAC;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC/B,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS;YACzD,MAAM,GAAG,GAAG,WAAW,CAAC,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;YAC7C,IAAI,GAAG,KAAK,IAAI;gBAAE,SAAS;YAC3B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;QACpF,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,8EAA8E;AAE9E,SAAS,kBAAkB,CACzB,OAAgE,EAChE,IAAmB;IAEnB,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IAC3E,wEAAwE;IACxE,wEAAwE;IACxE,iDAAiD;IACjD,OAAO,OAAO,CAAC,IAAI,KAAK,kBAAkB,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;AACpF,CAAC;AAED,SAAS,kBAAkB,CAAC,OAAyB,EAAE,IAAmB;IACxE,qEAAqE;IACrE,qEAAqE;IACrE,yDAAyD;IACzD,MAAM,MAAM,GACV,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;QAC5B,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC9F,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IACxC,sEAAsE;IACtE,uEAAuE;IACvE,gDAAgD;IAChD,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QAC5D,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC;YAAE,SAAS;QACjC,MAAM,KAAK,GAAG,aAAa,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5C,IAAI,KAAK,KAAK,SAAS,IAAI,kBAAkB,CAAC,KAAK,EAAE,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;IAC1E,CAAC;IACD,kEAAkE;IAClE,iEAAiE;IACjE,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;YAAE,SAAS;QAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC/B,IAAI,kBAAkB,CAAC,CAAC,EAAE,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAC,QAAQ,CAAC;QACzD,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;gEAGgE;AAChE,MAAM,UAAU,uBAAuB,CACrC,WAA4B,EAC5B,OAAyB;IAEzB,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,WAAW,CAAC;IACnG,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC3B,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS;YAAE,OAAO,CAAC,CAAC;QACnC,MAAM,QAAQ,GAAG,kBAAkB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAChD,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,CAAC,CAAC;QACrC,OAAO,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,aAAa,OAAO,CAAC,IAAI,cAAc,QAAQ,EAAE,EAAE,CAAC;IAC3E,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/library/int-infer.d.ts

@@ -0,0 +1,119 @@
+import type { IrModule, IrNumBinOp, SrcLoc } from "../ir/nodes.js";
+export declare const SAFE_MAX: number;
+export declare const SAFE_MIN: number;
+/** The set of f64 values a binding may hold at a program point: a closed
+ * interval over the extended reals (`-0` normalized to 0 — the interval
+ * tracks mathematical value; zero's sign is an f64-interior observation
+ * with no boundary consequence), `whole` when every member is a finite
+ * integer-valued f64, `maybeNaN` when NaN may be in the set (NaN lives
+ * outside the interval, which describes only the numeric members), and
+ * the integer literal's source `spelling` for the representability check
+ * (propagates through copies and agreeing joins only; any arithmetic
+ * drops it — a computed value is a new number, not the author's
+ * literal). */
+export interface AbsVal {
+    lo: number;
+    hi: number;
+    whole: boolean;
+    maybeNaN: boolean;
+    spelling?: string;
+}
+export declare function absVal(lo: number, hi: number, whole: boolean, maybeNaN: boolean, spelling?: string): AbsVal;
+/** Any f64 a caller could pass — unbounded, not whole, NaN included. */
+export declare const TOP: AbsVal;
+/** The empty set (unreachable): lo > hi and no NaN. */
+export declare const BOTTOM: AbsVal;
+export declare const isBottom: (v: AbsVal) => boolean;
+export declare const isSingleton: (v: AbsVal) => boolean;
+export declare function constVal(value: number, spelling?: string): AbsVal;
+/** Least upper bound: interval hull, wholeness/NaN pessimism, spelling
+ * kept only when both sides carry the same one. */
+export declare function join(a: AbsVal, b: AbsVal): AbsVal;
+export declare function sameVal(a: AbsVal, b: AbsVal): boolean;
+export declare function widen(prev: AbsVal, next: AbsVal): AbsVal;
+/** JS `~`: ToInt32, complement — whole, int32 range, whatever the input. */
+export declare function transferBitNot(a: AbsVal): AbsVal;
+export declare function transferNeg(a: AbsVal): AbsVal;
+export declare function transferBin(op: IrNumBinOp, a: AbsVal, b: AbsVal): AbsVal;
+/** The Math rounding family is the author's stated intent: every finite
+ * input maps to a whole output, so these discharge the WHOLENESS
+ * obligation. They do not discharge range (an unbounded input stays
+ * unbounded) or NaN (Math.trunc(NaN) is NaN — maybeNaN propagates). */
+export declare function transferMathRound(fn: "trunc" | "floor" | "ceil" | "round", a: AbsVal): AbsVal;
+export declare function transferAbs(a: AbsVal): AbsVal;
+/** Math.min/max propagate NaN from ANY argument, exactly as JS does. */
+export declare function transferMinMax(fn: "min" | "max", args: AbsVal[]): AbsVal;
+export type IntClass = "i64" | "u64";
+export type IntObligation = "representability" | "wholeness" | "range";
+export interface IntVerdict {
+    /** The sidecar slot path (`Msg.count`, `Point.x`,
+     * `helpers.clamp.params[0]`, `exports.send.params[0]`). */
+    path: string;
+    cls: IntClass;
+    loc: SrcLoc;
+    outcome: "prove" | "refuse";
+    /** PROVE: the proven crossing range (the exact crossing value when the
+     * interval is a singleton); NaN/NaN for a vacuous (unreachable) proof. */
+    provenLo?: number;
+    provenHi?: number;
+    /** REFUSE: the failed obligation (the FIRST failure in the §2.4 order),
+     * the observed evidence, and the author's concrete fix. */
+    obligation?: IntObligation;
+    detail?: string;
+    fix?: string;
+}
+/** Does an integer literal's source spelling survive the trip through
+ * f64? Parse, convert, format back, compare (numeric separators were
+ * stripped by the frontend — they are spelling sugar, not value). */
+export declare function spellingRoundTrips(spelling: string): boolean;
+/** Check a converged abstract value against a slot's obligations, in the
+ * teaching-quality order: representability, then NaN, then range, then
+ * fractional wholeness — the FIRST failure names the refusal (a value
+ * both fractional and out of range hears about the more fundamental
+ * problem). */
+export declare function checkBoundary(v: AbsVal, path: string, cls: IntClass, loc: SrcLoc): IntVerdict;
+/** One function's declared integer slots: `params[i]` is the class of the
+ * i-th parameter (null = not integer-declared), `ret` the return's.
+ * `paramPaths`/`retPath` are the sidecar slot paths refusals carry. */
+export interface FnIntSlots {
+    fnName: string;
+    params: (IntClass | null)[];
+    paramPaths: (string | null)[];
+    ret: IntClass | null;
+    retPath: string | null;
+    /** The plumbing classes of the NON-integer params (u8/u32/i32/f64/...):
+     * used to seed the callee's parameter environment precisely. */
+    paramSeeds: (AbsVal | null)[];
+}
+/** One record-field slot, resolved to an interned IR record shape: every
+ * program-side construction (recordLit) or write (recordSet) of `field`
+ * on shape `shapeId` must discharge the obligations. Shapes are interned
+ * STRUCTURALLY, so a second type with the identical field list shares the
+ * shape — and inherits the obligation, a sound over-approximation. */
+export interface RecordIntSlot {
+    shapeId: string;
+    field: string;
+    cls: IntClass;
+    path: string;
+}
+export interface IntSlotConfig {
+    /** Keyed by IR function name. */
+    fns: Map<string, FnIntSlots>;
+    /** shapeId → field → slot. */
+    records: Map<string, Map<string, {
+        cls: IntClass;
+        path: string;
+    }>>;
+}
+export declare function hasIntSlots(cfg: IntSlotConfig): boolean;
+/** The class seed for a declared parameter: what the slot's own contract
+ * proves about every value that ever arrives through it (internal calls
+ * are checked at their call sites; external calls range-check in the
+ * marshalling wrapper). */
+export declare function classSeed(cls: string): AbsVal;
+/** Run the inference over every function of a lowered library module and
+ * return one verdict per (obligation site) — internal call arguments into
+ * declared integer parameters, returns of declared integer returns, and
+ * writes into declared record-field slots. Callers turn REFUSE verdicts
+ * into diagnostics; PROVE verdicts carry the proven crossing range. */
+export declare function checkLibraryIntegerSlots(mod: IrModule, cfg: IntSlotConfig): IntVerdict[];