@json-schema-engine/compiler 0.0.1

package/dist/serialize/statements.js

@@ -0,0 +1,396 @@
+// LowerStmt rendering: the per-keyword statement list with its grouped
+// anyOf/oneOf runs, every statement kind, and the apply folds.
+import { id, join, js, num, json } from "../emit.js";
+import { EV, bindingVar, counterVar, foldVar } from "./names.js";
+import { SerializeError } from "./context.js";
+import { renderMessage, paramsChunk, pushError, errMark, errsLength, errsCut, } from "./messages.js";
+import { channelSpans, spanDecls, spanResets, branchSpan, annsLength, annsCut, annsPush, } from "./spans.js";
+import { annUnit, annRecordSegment, produceChannel } from "./keywords.js";
+import { expr } from "./expressions.js";
+import { applyCall, tryInline } from "./apply.js";
+/**
+ * Serialize one keyword's statement list. Runs of anyMayPass applies
+ * (the anyOf shape) group into a single OR check; short-circuit emission
+ * is licensed here because the planner interpreted every node whose
+ * channel a consumer could observe (slice licensing, DESIGN §7). Runs of
+ * exactlyOne applies (the oneOf shape) group into a counter block that
+ * runs EVERY branch — never stop-at-first-success, since the count past 1
+ * must still be exact.
+ */
+export function keywordStatements(ctx, stmts) {
+    const out = [];
+    let anyRun = [];
+    let oneRun = [];
+    const flushAny = (message, params) => {
+        if (anyRun.length === 0)
+            return;
+        if (ctx.output === "list") {
+            // Every branch runs (§7: list artifacts never short-circuit), each
+            // marking/truncating its channel spans (branchSpan). An accepting
+            // run drops every branch's errors (errMark).
+            const a = counterVar(ctx.counters.tally++);
+            const em = errMark(ctx);
+            const runs = anyRun.map((call) => branchSpan(ctx, call, js `${a} = true;`));
+            const onFail = pushError(ctx, renderMessage(ctx, message ?? ["no branch matched"]), true, paramsChunk(ctx, params));
+            out.push(js `let ${a} = false; const ${em} = ${errsLength(ctx)}; ${join(" ", runs)} if (${a}) { ${errsCut(ctx, em)} } else { ${onFail} }`);
+        }
+        else if (ctx.regionMode) {
+            // Every branch runs (no short-circuit — a later branch's success
+            // contributes coverage the interpreter would merge), each marking and
+            // truncating its own channel span (rule 2). Flag failure on no match.
+            const a = counterVar(ctx.counters.tally++);
+            const runs = anyRun.map((call) => branchSpan(ctx, call, js `${a} = true;`));
+            out.push(js `let ${a} = false; ${join(" ", runs)} if (!${a}) return false;`);
+        }
+        else {
+            out.push(js `if (!(${join(" || ", anyRun)})) return false;`);
+        }
+        anyRun = [];
+    };
+    const flushOne = (message, params) => {
+        if (oneRun.length === 0)
+            return;
+        const c = counterVar(ctx.counters.tally++);
+        if (ctx.output === "list") {
+            // Params referencing the passing-branch indexes (tallyList) need an
+            // index accumulator next to the count; branch order IS run order.
+            // Both-pass discards at the caller (the unit fails, its span
+            // truncates); each branch marks/truncates its own spans here.
+            const wantsList = ctx.listParams &&
+                params !== undefined &&
+                Object.values(params).some((p) => p.kind === "tallyList");
+            const p = wantsList ? counterVar(ctx.counters.tally++) : undefined;
+            const incs = oneRun.map((call, k) => branchSpan(ctx, call, p ? js `${c}++; ${p}.push(${num(k)});` : js `${c}++;`));
+            const decl = p ? js `let ${c} = 0; const ${p} = [];` : js `let ${c} = 0;`;
+            const onFail = pushError(ctx, renderMessage(ctx, message ?? [{ kind: "tally" }, " branches matched"], c), true, paramsChunk(ctx, params, c, p));
+            const em = errMark(ctx);
+            out.push(js `${decl} const ${em} = ${errsLength(ctx)}; ${join(" ", incs)} if (${c} === 1) { ${errsCut(ctx, em)} } else { ${onFail} }`);
+        }
+        else if (ctx.regionMode) {
+            // Run every branch with a per-branch mark/truncate (rule 2): a passing
+            // branch's coverage merges, a failing branch's truncates. On a non-unit
+            // count the unit fails and the caller truncates the whole span.
+            const incs = oneRun.map((call) => branchSpan(ctx, call, js `${c}++;`));
+            out.push(js `let ${c} = 0; ${join(" ", incs)} if (${c} !== 1) return false;`);
+        }
+        else {
+            const incs = oneRun.map((call) => js `if (${call}) ${c}++;`);
+            out.push(js `let ${c} = 0; ${join(" ", incs)} if (${c} !== 1) return false;`);
+        }
+        oneRun = [];
+    };
+    for (const stmt of stmts) {
+        if (stmt.kind === "apply" && stmt.apply.fold === "anyMayPass") {
+            flushOne();
+            anyRun.push(applyCall(ctx, stmt.apply));
+            continue;
+        }
+        if (stmt.kind === "apply" && stmt.apply.fold === "exactlyOne") {
+            flushAny();
+            oneRun.push(applyCall(ctx, stmt.apply));
+            continue;
+        }
+        if (stmt.kind === "combineCheck") {
+            // Closes the pending run with the keyword's own failure message.
+            flushAny(stmt.message, stmt.params);
+            flushOne(stmt.message, stmt.params);
+            continue;
+        }
+        flushAny();
+        flushOne();
+        out.push(statement(ctx, stmt));
+    }
+    flushAny();
+    flushOne();
+    return out;
+}
+/** An `if` statement; an applyExpr condition is hoisted so its channel spans and error mark bracket the call. */
+function emitIf(ctx, stmt) {
+    // `if`'s condition IS a bare applyExpr (the only such shape besides
+    // contains' probe): hoist the call so its span marks/truncates before
+    // the branch reads the verdict. Any other applyExpr position throws in
+    // annotation mode (expr()), so no silent annotation loss.
+    if ((ctx.annMode || ctx.regionMode || ctx.output === "list") &&
+        stmt.cond.kind === "applyExpr") {
+        // `if`'s condition is in-place: hoist the call so its channel spans
+        // mark/truncate on the condition verdict (a passing condition's
+        // coverage merges, a failing one's — with the else taken — truncates;
+        // rule 4). ann marks `anns`, region marks `ev`, composed both. The
+        // condition's errors are always irrelevant (`if` accepts regardless
+        // of its subschema), so list mode truncates them unconditionally.
+        const spans = channelSpans(ctx);
+        const t = id("m" + String(ctx.counters.temp++));
+        const em = errMark(ctx);
+        const call = applyCall(ctx, stmt.cond.apply);
+        const errDecl = em ? js `const ${em} = ${errsLength(ctx)}; ` : js ``;
+        const errReset = em ? js ` ${errsCut(ctx, em)}` : js ``;
+        const resets = spans.length > 0 ? js ` if (!${t}) { ${spanResets(ctx, spans)} }` : js ``;
+        const head = js `${spanDecls(ctx, spans)} ${errDecl}const ${t} = ${call};${errReset}${resets}`;
+        const thenBody = join("\n", stmt.then.map((s) => statement(ctx, s)));
+        if (!stmt.else)
+            return js `${head} if (${t}) { ${thenBody} }`;
+        const elseBody = join("\n", stmt.else.map((s) => statement(ctx, s)));
+        return js `${head} if (${t}) { ${thenBody} } else { ${elseBody} }`;
+    }
+    const thenBody = join("\n", stmt.then.map((s) => statement(ctx, s)));
+    const cond = js `if (${expr(ctx, stmt.cond)}) { ${thenBody} }`;
+    if (!stmt.else)
+        return cond;
+    const elseBody = join("\n", stmt.else.map((s) => statement(ctx, s)));
+    return js `${cond} else { ${elseBody} }`;
+}
+/** A sweep over an object's own keys (plain for-in under the plain-data contract). */
+function emitForEachKey(ctx, stmt) {
+    const b = bindingVar(stmt.binding);
+    const body = join("\n", stmt.body.map((s) => statement(ctx, s)));
+    // Plain for-in: under the plain-data instance contract (DESIGN §7)
+    // instances carry no inherited enumerables, so for-in ≡ Object.keys
+    // without the per-validation array allocation.
+    const t = expr(ctx, stmt.target);
+    if (ctx.flags.plainData) {
+        return js `for (const ${b} in ${t}) { ${body} }`;
+    }
+    return js `for (const ${b} of Object.keys(${t})) { ${body} }`;
+}
+/** A sweep over an array's indexes. */
+function emitForEachIndex(ctx, stmt) {
+    const b = bindingVar(stmt.binding);
+    const body = join("\n", stmt.body.map((s) => statement(ctx, s)));
+    return js `for (let ${b} = ${num(stmt.start ?? 0)}; ${b} < ${expr(ctx, stmt.target)}.length; ${b}++) { ${body} }`;
+}
+/** A keyword failure: an error unit in list mode, fail-fast in flag mode. */
+function emitFail(ctx, stmt) {
+    if (ctx.output === "list") {
+        return pushError(ctx, renderMessage(ctx, stmt.message), true, paramsChunk(ctx, stmt.params));
+    }
+    // Flag mode: verdict-only, fail fast.
+    return js `return false;`;
+}
+/** The keyword's own value as an annotation unit (annotation mode only). */
+function emitAnnotate(ctx, _stmt) {
+    // Annotation mode records the keyword's own value as a unit; every
+    // other mode elides. The value is a schema constant (draft-03 §12.9).
+    if (!ctx.annMode || !ctx.annKwKept)
+        return js ``;
+    const value = ctx.unit.ref.node[ctx.currentKeyword];
+    return annsPush(ctx, annUnit(ctx, json(value)));
+}
+/** A consumed producer's dependency data onto the coverage channel (region mode only). */
+function emitProduce(ctx, stmt) {
+    // Region mode pushes a consumed producer's dependency data onto the
+    // channel (rule 5); dependency data is never an annotation unit. In
+    // list mode the push waits on the keyword's own verdict (kwOk).
+    if (!ctx.covKwKept)
+        return js ``;
+    const push = produceChannel(ctx, stmt.value);
+    return ctx.kwOk ? js `if (${ctx.kwOk}) { ${push} }` : push;
+}
+/** Bind the channel fold a following coverageCovers reads (region mode only). */
+function emitCoverageFold(ctx, stmt) {
+    // Bind the channel fold a following coverageCovers reads (rule 6). Only
+    // a tracked unit's consumer emits this, and only in region mode.
+    if (!ctx.regionMode) {
+        throw new SerializeError("coverageFold requires region emission (phase B)");
+    }
+    const f = foldVar(ctx.counters.temp++);
+    ctx.coverageFolds.set(stmt.binding, { var: f, half: stmt.half });
+    if (stmt.half === "names") {
+        return js `const ${f} = ${id("h_covN")}(${EV});`;
+    }
+    // indexes: fold over the current instance array's length (the enclosing
+    // lower() guards this with an array-type test).
+    return js `const ${f} = ${id("h_covI")}(${EV}, ${ctx.valueVar}.length);`;
+}
+/** The contains shape: count matching items, then check the range; the probe's spans and the loop's error mark follow the mode. */
+function emitCountRange(ctx, stmt) {
+    const b = bindingVar(stmt.binding);
+    const c = counterVar(ctx.counters.tally++);
+    const max = Number.isFinite(stmt.max) ? num(stmt.max) : null;
+    const outOfRange = max === null
+        ? js `${c} < ${num(stmt.min)}`
+        : js `${c} < ${num(stmt.min)} || ${c} > ${max}`;
+    const onFail = ctx.output === "list"
+        ? pushError(ctx, renderMessage(ctx, stmt.outOfRangeMessage, c), true, paramsChunk(ctx, stmt.outOfRangeParams, c))
+        : js `return false;`;
+    // List mode: an accepting contains drops every probe's errors, a
+    // rejecting one keeps them (§12.2) — one mark around the whole loop,
+    // never per probe.
+    const em = errMark(ctx);
+    const errDecl = em ? js `const ${em} = ${errsLength(ctx)}; ` : js ``;
+    const check = em
+        ? js `if (${outOfRange}) { ${onFail} } else { ${errsCut(ctx, em)} }`
+        : js `if (${outOfRange}) { ${onFail} }`;
+    // contains' probe IS a bare applyExpr (the only shape besides `if`'s
+    // condition): mark/truncate each probe so a matching item's
+    // annotations merge and a failing item's discard. collectIndexes feeds
+    // the matched-index accumulator the following produce renders.
+    if (ctx.annMode && stmt.countWhen.kind === "applyExpr") {
+        const probe = applyCall(ctx, stmt.countWhen.apply);
+        const m = id("m" + String(ctx.counters.temp++));
+        const pushIdx = ctx.annKw?.matched && stmt.collectIndexes
+            ? js ` ${ctx.annKw.matched}.push(${b});`
+            : js ``;
+        const loop = js `${errDecl}let ${c} = 0; for (let ${b} = 0; ${b} < ${expr(ctx, stmt.target)}.length; ${b}++) { const ${m} = ${annsLength(ctx)}; if (${probe}) { ${c}++;${pushIdx} } else ${annsCut(ctx, m)} }`;
+        return js `${loop} ${check}`;
+    }
+    if (ctx.regionMode && stmt.countWhen.kind === "applyExpr") {
+        // The probe is a CHILD-cursor apply (a plain call that never receives
+        // `ev`), so there is no channel span to mark here — `contains`'
+        // coverage reaches the channel only through its matched-index produce
+        // (rule 5). Accumulate the matched indexes for that produce.
+        const probe = applyCall(ctx, stmt.countWhen.apply);
+        const pushIdx = ctx.annKw?.matched && stmt.collectIndexes
+            ? js ` ${ctx.annKw.matched}.push(${b});`
+            : js ``;
+        const loop = js `${errDecl}let ${c} = 0; for (let ${b} = 0; ${b} < ${expr(ctx, stmt.target)}.length; ${b}++) { if (${probe}) { ${c}++;${pushIdx} } }`;
+        return js `${loop} ${check}`;
+    }
+    const loop = js `${errDecl}let ${c} = 0; for (let ${b} = 0; ${b} < ${expr(ctx, stmt.target)}.length; ${b}++) { if (${expr(ctx, stmt.countWhen)}) ${c}++; }`;
+    return js `${loop} ${check}`;
+}
+export function statement(ctx, stmt) {
+    switch (stmt.kind) {
+        case "if":
+            return emitIf(ctx, stmt);
+        case "forEachKey":
+            return emitForEachKey(ctx, stmt);
+        case "forEachIndex":
+            return emitForEachIndex(ctx, stmt);
+        case "fail":
+            return emitFail(ctx, stmt);
+        case "annotate":
+            return emitAnnotate(ctx, stmt);
+        case "produce":
+            return emitProduce(ctx, stmt);
+        case "coverageFold":
+            return emitCoverageFold(ctx, stmt);
+        case "apply":
+            return applyStatement(ctx, stmt.apply);
+        case "combineCheck":
+            throw new SerializeError("combineCheck must directly follow its anyMayPass/exactlyOne run");
+        case "countRange":
+            return emitCountRange(ctx, stmt);
+    }
+}
+/** List-mode conjunct and negation folds (null for the grouped folds). */
+function emitListApply(ctx, apply, call, evSpan) {
+    switch (apply.fold) {
+        case "allMustPass": {
+            // Record the attempted segment (before the verdict) for the
+            // keyword's produce accumulator, then mark the channel spans so a
+            // failing application's annotations (annMode) and coverage (region
+            // emission) truncate — its errors stay (the keyword rejects), and
+            // list mode CONTINUES on failure (ok = false, no return): the
+            // unit's remaining keywords, including a consumer sweep that now
+            // covers less, still run.
+            const rec = annRecordSegment(ctx, apply.cursor);
+            const pre = rec ? js `${rec} ` : js ``;
+            // A driven sibling's application (`then`/`else` under `if`) fails that
+            // sibling's own verdict, as the interpreter reports it.
+            const slot = ctx.trace && apply.sibling !== undefined
+                ? (ctx.kwVerdicts.get(apply.sibling) ?? null)
+                : ctx.kwOk;
+            const fail = slot ? js `ok = false; ${slot} = false;` : js `ok = false;`;
+            const spans = channelSpans(ctx, evSpan);
+            if (spans.length === 0)
+                return js `${pre}if (!${call}) { ${fail} }`;
+            return js `${pre}${spanDecls(ctx, spans)} if (!${call}) { ${fail} ${spanResets(ctx, spans)} }`;
+        }
+        case "negate": {
+            // A failing negated subschema's spans truncate, and so do its
+            // errors (`not` accepts, §12.2); a PASSING one's annotations and
+            // coverage STAY (the interpreter merges any passing application
+            // into the unit frame, and same-unit consumers see it) while the
+            // unit records the not-error.
+            const spans = channelSpans(ctx, evSpan);
+            const em = errMark(ctx);
+            const err = pushError(ctx, renderMessage(ctx, apply.message ?? ["must not match the subschema"]), true, paramsChunk(ctx, apply.params));
+            return js `${spanDecls(ctx, spans)} const ${em} = ${errsLength(ctx)}; if (${call}) { ${err} } else { ${errsCut(ctx, em)} ${spanResets(ctx, spans)} }`;
+        }
+        default:
+            return null; // grouped folds handled by keywordStatements; discard by applyExpr
+    }
+}
+/** Region-mode conjunct and negation folds (null for the grouped folds). */
+function emitRegionApply(ctx, apply, call, evSpan) {
+    switch (apply.fold) {
+        case "allMustPass": {
+            // Record the attempted child segment (before the verdict) for a
+            // consumed producer's channel push (rule 5).
+            const rec = annRecordSegment(ctx, apply.cursor);
+            const pre = rec ? js `${rec} ` : js ``;
+            if (call.text === "true")
+                return rec ?? js ``;
+            if (call.text === "false")
+                return js `${pre}return false;`;
+            if (evSpan) {
+                // In-place conjunct: a failed span truncates and fails the unit;
+                // the caller's own span then truncates this whole call (rule 2).
+                const m = id("m" + String(ctx.counters.temp++));
+                return js `const ${m} = ${EV}.length; if (!${call}) { ${EV}.length = ${m}; return false; }`;
+            }
+            // Child-cursor conjunct (a swept property/item): no channel span.
+            return js `${pre}if (!${call}) return false;`;
+        }
+        case "negate": {
+            if (call.text === "true")
+                return js `return false;`;
+            if (call.text === "false")
+                return js ``;
+            // A passing negated subschema dies with the unit (return false → the
+            // caller truncates); a failing one truncates its own span (rule 3).
+            const m = id("m" + String(ctx.counters.temp++));
+            return js `const ${m} = ${EV}.length; if (${call}) return false; ${EV}.length = ${m};`;
+        }
+        default:
+            return null; // grouped folds handled by keywordStatements; discard by applyExpr
+    }
+}
+export function applyStatement(ctx, apply) {
+    if (apply.fold === "allMustPass") {
+        const inlined = tryInline(ctx, apply);
+        if (inlined)
+            return inlined;
+    }
+    const call = applyCall(ctx, apply);
+    // A call RECEIVES the coverage channel exactly when it is an in-place
+    // apply to a non-boolean target (a region variant, or a coverage-
+    // harvesting trampoline); a child-cursor apply is a plain call, and a
+    // boolean folds to a literal or reports without producing — neither
+    // touches the channel, so neither needs an ev mark/truncate span (rule 1).
+    const evSpan = ctx.regionMode &&
+        apply.cursor.kind === "here" &&
+        call.text !== "true" &&
+        call.text !== "false";
+    if (ctx.output === "list") {
+        const folded = emitListApply(ctx, apply, call, evSpan);
+        if (folded)
+            return folded;
+    }
+    else if (ctx.regionMode) {
+        const folded = emitRegionApply(ctx, apply, call, evSpan);
+        if (folded)
+            return folded;
+    }
+    if (apply.fold === "allMustPass" && call.text === "true")
+        return js ``;
+    if (apply.fold === "allMustPass" && call.text === "false")
+        return js `return false;`;
+    switch (apply.fold) {
+        case "allMustPass":
+            return js `if (!${call}) return false;`;
+        case "negate":
+            return js `if (${call}) return false;`;
+        case "anyMayPass":
+        case "exactlyOne":
+            // keywordStatements groups consecutive runs of these before they
+            // reach here (a lone run of one is still a "run").
+            throw new SerializeError("fold '" + apply.fold + "' must be grouped by keywordStatements");
+        case "discard":
+            // A bare discard apply statement has no verdict-folding meaning —
+            // it's only legal as an applyExpr operand (the if/contains probe
+            // shape), never a standalone statement.
+            throw new SerializeError("fold 'discard' is only legal inside applyExpr");
+    }
+}
+//# sourceMappingURL=statements.js.map

package/dist/serialize/statements.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"statements.js","sourceRoot":"","sources":["../../src/serialize/statements.ts"],"names":[],"mappings":"AAAA,uEAAuE;AACvE,+DAA+D;AAS/D,OAAO,EAAkB,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AACrE,OAAO,EAAE,EAAE,EAAE,UAAU,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AACjE,OAAO,EAAe,cAAc,EAAE,MAAM,cAAc,CAAC;AAC3D,OAAO,EACL,aAAa,EACb,WAAW,EACX,SAAS,EACT,OAAO,EACP,UAAU,EACV,OAAO,GACR,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,YAAY,EACZ,SAAS,EACT,UAAU,EACV,UAAU,EACV,UAAU,EACV,OAAO,EACP,QAAQ,GACT,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,OAAO,EAAE,gBAAgB,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAC1E,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACxC,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAElD;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAC/B,GAAgB,EAChB,KAA2B;IAE3B,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,IAAI,MAAM,GAAgB,EAAE,CAAC;IAC7B,IAAI,MAAM,GAAgB,EAAE,CAAC;IAC7B,MAAM,QAAQ,GAAG,CAAC,OAAsB,EAAE,MAAoB,EAAE,EAAE;QAChE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAChC,IAAI,GAAG,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YAC1B,mEAAmE;YACnE,kEAAkE;YAClE,6CAA6C;YAC7C,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;YAC3C,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAE,CAAC;YACzB,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAC/B,UAAU,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAA,GAAG,CAAC,UAAU,CAAC,CACxC,CAAC;YACF,MAAM,MAAM,GAAG,SAAS,CACtB,GAAG,EACH,aAAa,CAAC,GAAG,EAAE,OAAO,IAAI,CAAC,mBAAmB,CAAC,CAAC,EACpD,IAAI,EACJ,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,CACzB,CAAC;YACF,GAAG,CAAC,IAAI,CACN,EAAE,CAAA,OAAO,CAAC,mBAAmB,EAAE,MAAM,UAAU,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,OAAO,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,aAAa,MAAM,IAAI,CAChI,CAAC;QACJ,CAAC;aAAM,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;YAC1B,iEAAiE;YACjE,sEAAsE;YACtE,sEAAsE;YACtE,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;YAC3C,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAC/B,UAAU,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAA,GAAG,CAAC,UAAU,CAAC,CACxC,CAAC;YACF,GAAG,CAAC,IAAI,CACN,EAAE,CAAA,OAAO,CAAC,aAAa,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,iBAAiB,CAClE,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,IAAI,CAAC,EAAE,CAAA,SAAS,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,kBAAkB,CAAC,CAAC;QAC9D,CAAC;QACD,MAAM,GAAG,EAAE,CAAC;IACd,CAAC,CAAC;IACF,MAAM,QAAQ,GAAG,CAAC,OAAsB,EAAE,MAAoB,EAAE,EAAE;QAChE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAChC,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;QAC3C,IAAI,GAAG,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YAC1B,oEAAoE;YACpE,kEAAkE;YAClE,6DAA6D;YAC7D,8DAA8D;YAC9D,MAAM,SAAS,GACb,GAAG,CAAC,UAAU;gBACd,MAAM,KAAK,SAAS;gBACpB,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC;YAC5D,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACnE,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAClC,UAAU,CACR,GAAG,EACH,IAAI,EACJ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA,GAAG,CAAC,OAAO,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA,GAAG,CAAC,KAAK,CACpD,CACF,CAAC;YACF,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA,OAAO,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAA,OAAO,CAAC,OAAO,CAAC;YACxE,MAAM,MAAM,GAAG,SAAS,CACtB,GAAG,EACH,aAAa,CACX,GAAG,EACH,OAAO,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,mBAAmB,CAAC,EACnD,CAAC,CACF,EACD,IAAI,EACJ,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAC/B,CAAC;YACF,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAE,CAAC;YACzB,GAAG,CAAC,IAAI,CACN,EAAE,CAAA,GAAG,IAAI,UAAU,EAAE,MAAM,UAAU,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,aAAa,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,aAAa,MAAM,IAAI,CAC5H,CAAC;QACJ,CAAC;aAAM,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;YAC1B,uEAAuE;YACvE,wEAAwE;YACxE,gEAAgE;YAChE,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAA,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;YACtE,GAAG,CAAC,IAAI,CACN,EAAE,CAAA,OAAO,CAAC,SAAS,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,uBAAuB,CACnE,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAA,OAAO,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;YAC5D,GAAG,CAAC,IAAI,CACN,EAAE,CAAA,OAAO,CAAC,SAAS,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,uBAAuB,CACnE,CAAC;QACJ,CAAC;QACD,MAAM,GAAG,EAAE,CAAC;IACd,CAAC,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;YAC9D,QAAQ,EAAE,CAAC;YACX,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACxC,SAAS;QACX,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;YAC9D,QAAQ,EAAE,CAAC;YACX,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACxC,SAAS;QACX,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;YACjC,iEAAiE;YACjE,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACpC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACpC,SAAS;QACX,CAAC;QACD,QAAQ,EAAE,CAAC;QACX,QAAQ,EAAE,CAAC;QACX,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;IACjC,CAAC;IACD,QAAQ,EAAE,CAAC;IACX,QAAQ,EAAE,CAAC;IACX,OAAO,GAAG,CAAC;AACb,CAAC;AAED,iHAAiH;AACjH,SAAS,MAAM,CACb,GAAgB,EAChB,IAAwC;IAExC,oEAAoE;IACpE,sEAAsE;IACtE,uEAAuE;IACvE,0DAA0D;IAC1D,IACE,CAAC,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,UAAU,IAAI,GAAG,CAAC,MAAM,KAAK,MAAM,CAAC;QACxD,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,WAAW,EAC9B,CAAC;QACD,oEAAoE;QACpE,gEAAgE;QAChE,sEAAsE;QACtE,mEAAmE;QACnE,oEAAoE;QACpE,kEAAkE;QAClE,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;QACxB,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7C,MAAM,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA,SAAS,EAAE,MAAM,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA,EAAE,CAAC;QACnE,MAAM,QAAQ,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA,IAAI,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA,EAAE,CAAC;QACtD,MAAM,MAAM,GACV,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA,SAAS,CAAC,OAAO,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA,EAAE,CAAC;QAC1E,MAAM,IAAI,GAAG,EAAE,CAAA,GAAG,SAAS,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,SAAS,CAAC,MAAM,IAAI,IAAI,QAAQ,GAAG,MAAM,EAAE,CAAC;QAC9F,MAAM,QAAQ,GAAG,IAAI,CACnB,IAAI,EACJ,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CACxC,CAAC;QACF,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,EAAE,CAAA,GAAG,IAAI,QAAQ,CAAC,OAAO,QAAQ,IAAI,CAAC;QAC7D,MAAM,QAAQ,GAAG,IAAI,CACnB,IAAI,EACJ,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CACxC,CAAC;QACF,OAAO,EAAE,CAAA,GAAG,IAAI,QAAQ,CAAC,OAAO,QAAQ,aAAa,QAAQ,IAAI,CAAC;IACpE,CAAC;IACD,MAAM,QAAQ,GAAG,IAAI,CACnB,IAAI,EACJ,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CACxC,CAAC;IACF,MAAM,IAAI,GAAG,EAAE,CAAA,OAAO,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,QAAQ,IAAI,CAAC;IAC9D,IAAI,CAAC,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAC5B,MAAM,QAAQ,GAAG,IAAI,CACnB,IAAI,EACJ,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CACxC,CAAC;IACF,OAAO,EAAE,CAAA,GAAG,IAAI,WAAW,QAAQ,IAAI,CAAC;AAC1C,CAAC;AAED,sFAAsF;AACtF,SAAS,cAAc,CACrB,GAAgB,EAChB,IAAgD;IAEhD,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACnC,MAAM,IAAI,GAAG,IAAI,CACf,IAAI,EACJ,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CACxC,CAAC;IACF,mEAAmE;IACnE,oEAAoE;IACpE,+CAA+C;IAC/C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACjC,IAAI,GAAG,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC;QACxB,OAAO,EAAE,CAAA,cAAc,CAAC,OAAO,CAAC,OAAO,IAAI,IAAI,CAAC;IAClD,CAAC;IACD,OAAO,EAAE,CAAA,cAAc,CAAC,mBAAmB,CAAC,QAAQ,IAAI,IAAI,CAAC;AAC/D,CAAC;AAED,uCAAuC;AACvC,SAAS,gBAAgB,CACvB,GAAgB,EAChB,IAAkD;IAElD,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACnC,MAAM,IAAI,GAAG,IAAI,CACf,IAAI,EACJ,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CACxC,CAAC;IACF,OAAO,EAAE,CAAA,YAAY,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,SAAS,IAAI,IAAI,CAAC;AACnH,CAAC;AAED,6EAA6E;AAC7E,SAAS,QAAQ,CACf,GAAgB,EAChB,IAA0C;IAE1C,IAAI,GAAG,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QAC1B,OAAO,SAAS,CACd,GAAG,EACH,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,EAChC,IAAI,EACJ,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,CAC9B,CAAC;IACJ,CAAC;IACD,sCAAsC;IACtC,OAAO,EAAE,CAAA,eAAe,CAAC;AAC3B,CAAC;AAED,4EAA4E;AAC5E,SAAS,YAAY,CACnB,GAAgB,EAChB,KAA+C;IAE/C,mEAAmE;IACnE,sEAAsE;IACtE,IAAI,CAAC,GAAG,CAAC,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS;QAAE,OAAO,EAAE,CAAA,EAAE,CAAC;IAChD,MAAM,KAAK,GAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAkC,CAC5D,GAAG,CAAC,cAAc,CAClB,CAAC;IACH,OAAO,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAClD,CAAC;AAED,0FAA0F;AAC1F,SAAS,WAAW,CAClB,GAAgB,EAChB,IAA6C;IAE7C,oEAAoE;IACpE,oEAAoE;IACpE,gEAAgE;IAChE,IAAI,CAAC,GAAG,CAAC,SAAS;QAAE,OAAO,EAAE,CAAA,EAAE,CAAC;IAChC,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7C,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA,OAAO,GAAG,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AAC5D,CAAC;AAED,iFAAiF;AACjF,SAAS,gBAAgB,CACvB,GAAgB,EAChB,IAAkD;IAElD,wEAAwE;IACxE,iEAAiE;IACjE,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC;QACpB,MAAM,IAAI,cAAc,CAAC,iDAAiD,CAAC,CAAC;IAC9E,CAAC;IACD,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;IACjE,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC1B,OAAO,EAAE,CAAA,SAAS,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IAClD,CAAC;IACD,wEAAwE;IACxE,gDAAgD;IAChD,OAAO,EAAE,CAAA,SAAS,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,QAAQ,WAAW,CAAC;AAC1E,CAAC;AAED,mIAAmI;AACnI,SAAS,cAAc,CACrB,GAAgB,EAChB,IAAgD;IAEhD,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACnC,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;IAC3C,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC7D,MAAM,UAAU,GACd,GAAG,KAAK,IAAI;QACV,CAAC,CAAC,EAAE,CAAA,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;QAC7B,CAAC,CAAC,EAAE,CAAA,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,EAAE,CAAC;IACnD,MAAM,MAAM,GACV,GAAG,CAAC,MAAM,KAAK,MAAM;QACnB,CAAC,CAAC,SAAS,CACP,GAAG,EACH,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,iBAAiB,EAAE,CAAC,CAAC,EAC7C,IAAI,EACJ,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAC3C;QACH,CAAC,CAAC,EAAE,CAAA,eAAe,CAAC;IACxB,iEAAiE;IACjE,qEAAqE;IACrE,mBAAmB;IACnB,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IACxB,MAAM,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA,SAAS,EAAE,MAAM,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA,EAAE,CAAC;IACnE,MAAM,KAAK,GAAG,EAAE;QACd,CAAC,CAAC,EAAE,CAAA,OAAO,UAAU,OAAO,MAAM,aAAa,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI;QACnE,CAAC,CAAC,EAAE,CAAA,OAAO,UAAU,OAAO,MAAM,IAAI,CAAC;IACzC,qEAAqE;IACrE,4DAA4D;IAC5D,uEAAuE;IACvE,+DAA+D;IAC/D,IAAI,GAAG,CAAC,OAAO,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QACvD,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACnD,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,OAAO,GACX,GAAG,CAAC,KAAK,EAAE,OAAO,IAAI,IAAI,CAAC,cAAc;YACvC,CAAC,CAAC,EAAE,CAAA,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,SAAS,CAAC,IAAI;YACvC,CAAC,CAAC,EAAE,CAAA,EAAE,CAAC;QACX,MAAM,IAAI,GAAG,EAAE,CAAA,GAAG,OAAO,OAAO,CAAC,kBAAkB,CAAC,SAAS,CAAC,MAAM,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,eAAe,CAAC,MAAM,UAAU,CAAC,GAAG,CAAC,SAAS,KAAK,OAAO,CAAC,MAAM,OAAO,WAAW,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC;QAC9M,OAAO,EAAE,CAAA,GAAG,IAAI,IAAI,KAAK,EAAE,CAAC;IAC9B,CAAC;IACD,IAAI,GAAG,CAAC,UAAU,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QAC1D,sEAAsE;QACtE,gEAAgE;QAChE,sEAAsE;QACtE,6DAA6D;QAC7D,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACnD,MAAM,OAAO,GACX,GAAG,CAAC,KAAK,EAAE,OAAO,IAAI,IAAI,CAAC,cAAc;YACvC,CAAC,CAAC,EAAE,CAAA,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,SAAS,CAAC,IAAI;YACvC,CAAC,CAAC,EAAE,CAAA,EAAE,CAAC;QACX,MAAM,IAAI,GAAG,EAAE,CAAA,GAAG,OAAO,OAAO,CAAC,kBAAkB,CAAC,SAAS,CAAC,MAAM,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,aAAa,KAAK,OAAO,CAAC,MAAM,OAAO,MAAM,CAAC;QACrJ,OAAO,EAAE,CAAA,GAAG,IAAI,IAAI,KAAK,EAAE,CAAC;IAC9B,CAAC;IACD,MAAM,IAAI,GAAG,EAAE,CAAA,GAAG,OAAO,OAAO,CAAC,kBAAkB,CAAC,SAAS,CAAC,MAAM,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,aAAa,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC;IAC3J,OAAO,EAAE,CAAA,GAAG,IAAI,IAAI,KAAK,EAAE,CAAC;AAC9B,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,GAAgB,EAAE,IAAe;IACzD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,IAAI;YACP,OAAO,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC3B,KAAK,YAAY;YACf,OAAO,cAAc,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACnC,KAAK,cAAc;YACjB,OAAO,gBAAgB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACrC,KAAK,MAAM;YACT,OAAO,QAAQ,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC7B,KAAK,UAAU;YACb,OAAO,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACjC,KAAK,SAAS;YACZ,OAAO,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAChC,KAAK,cAAc;YACjB,OAAO,gBAAgB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACrC,KAAK,OAAO;YACV,OAAO,cAAc,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACzC,KAAK,cAAc;YACjB,MAAM,IAAI,cAAc,CACtB,iEAAiE,CAClE,CAAC;QACJ,KAAK,YAAY;YACf,OAAO,cAAc,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACrC,CAAC;AACH,CAAC;AAED,0EAA0E;AAC1E,SAAS,aAAa,CACpB,GAAgB,EAChB,KAAiB,EACjB,IAAe,EACf,MAAe;IAEf,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,aAAa,CAAC,CAAC,CAAC;YACnB,4DAA4D;YAC5D,kEAAkE;YAClE,mEAAmE;YACnE,kEAAkE;YAClE,8DAA8D;YAC9D,iEAAiE;YACjE,0BAA0B;YAC1B,MAAM,GAAG,GAAG,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAChD,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAA,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAA,EAAE,CAAC;YACrC,uEAAuE;YACvE,wDAAwD;YACxD,MAAM,IAAI,GACR,GAAG,CAAC,KAAK,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS;gBACtC,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;gBAC7C,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;YACf,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA,eAAe,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE,CAAA,aAAa,CAAC;YACvE,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YACxC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,EAAE,CAAA,GAAG,GAAG,QAAQ,IAAI,OAAO,IAAI,IAAI,CAAC;YACnE,OAAO,EAAE,CAAA,GAAG,GAAG,GAAG,SAAS,CAAC,GAAG,EAAE,KAAK,CAAC,SAAS,IAAI,OAAO,IAAI,IAAI,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC;QAChG,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,8DAA8D;YAC9D,iEAAiE;YACjE,gEAAgE;YAChE,iEAAiE;YACjE,8BAA8B;YAC9B,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YACxC,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAE,CAAC;YACzB,MAAM,GAAG,GAAG,SAAS,CACnB,GAAG,EACH,aAAa,CAAC,GAAG,EAAE,KAAK,CAAC,OAAO,IAAI,CAAC,8BAA8B,CAAC,CAAC,EACrE,IAAI,EACJ,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAC/B,CAAC;YACF,OAAO,EAAE,CAAA,GAAG,SAAS,CAAC,GAAG,EAAE,KAAK,CAAC,UAAU,EAAE,MAAM,UAAU,CAAC,GAAG,CAAC,SAAS,IAAI,OAAO,GAAG,aAAa,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC;QACvJ,CAAC;QACD;YACE,OAAO,IAAI,CAAC,CAAC,mEAAmE;IACpF,CAAC;AACH,CAAC;AAED,4EAA4E;AAC5E,SAAS,eAAe,CACtB,GAAgB,EAChB,KAAiB,EACjB,IAAe,EACf,MAAe;IAEf,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,aAAa,CAAC,CAAC,CAAC;YACnB,gEAAgE;YAChE,6CAA6C;YAC7C,MAAM,GAAG,GAAG,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAChD,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAA,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAA,EAAE,CAAC;YACrC,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;gBAAE,OAAO,GAAG,IAAI,EAAE,CAAA,EAAE,CAAC;YAC7C,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;gBAAE,OAAO,EAAE,CAAA,GAAG,GAAG,eAAe,CAAC;YAC1D,IAAI,MAAM,EAAE,CAAC;gBACX,iEAAiE;gBACjE,iEAAiE;gBACjE,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBAChD,OAAO,EAAE,CAAA,SAAS,CAAC,MAAM,EAAE,iBAAiB,IAAI,OAAO,EAAE,aAAa,CAAC,mBAAmB,CAAC;YAC7F,CAAC;YACD,kEAAkE;YAClE,OAAO,EAAE,CAAA,GAAG,GAAG,QAAQ,IAAI,iBAAiB,CAAC;QAC/C,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;gBAAE,OAAO,EAAE,CAAA,eAAe,CAAC;YACnD,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;gBAAE,OAAO,EAAE,CAAA,EAAE,CAAC;YACvC,qEAAqE;YACrE,oEAAoE;YACpE,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAChD,OAAO,EAAE,CAAA,SAAS,CAAC,MAAM,EAAE,gBAAgB,IAAI,mBAAmB,EAAE,aAAa,CAAC,GAAG,CAAC;QACxF,CAAC;QACD;YACE,OAAO,IAAI,CAAC,CAAC,mEAAmE;IACpF,CAAC;AACH,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,GAAgB,EAAE,KAAiB;IAChE,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACtC,IAAI,OAAO;YAAE,OAAO,OAAO,CAAC;IAC9B,CAAC;IACD,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACnC,sEAAsE;IACtE,kEAAkE;IAClE,sEAAsE;IACtE,oEAAoE;IACpE,2EAA2E;IAC3E,MAAM,MAAM,GACV,GAAG,CAAC,UAAU;QACd,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM;QAC5B,IAAI,CAAC,IAAI,KAAK,MAAM;QACpB,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC;IACxB,IAAI,GAAG,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QACvD,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;IAC5B,CAAC;SAAM,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QACzD,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;IAC5B,CAAC;IACD,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,EAAE,CAAA,EAAE,CAAC;IACtE,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;QACvD,OAAO,EAAE,CAAA,eAAe,CAAC;IAC3B,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,aAAa;YAChB,OAAO,EAAE,CAAA,QAAQ,IAAI,iBAAiB,CAAC;QACzC,KAAK,QAAQ;YACX,OAAO,EAAE,CAAA,OAAO,IAAI,iBAAiB,CAAC;QACxC,KAAK,YAAY,CAAC;QAClB,KAAK,YAAY;YACf,iEAAiE;YACjE,mDAAmD;YACnD,MAAM,IAAI,cAAc,CACtB,QAAQ,GAAG,KAAK,CAAC,IAAI,GAAG,wCAAwC,CACjE,CAAC;QACJ,KAAK,SAAS;YACZ,kEAAkE;YAClE,iEAAiE;YACjE,wCAAwC;YACxC,MAAM,IAAI,cAAc,CAAC,+CAA+C,CAAC,CAAC;IAC9E,CAAC;AACH,CAAC"}

package/dist/serialize/unit.d.ts

@@ -0,0 +1,8 @@
+import { type LowerStmt, type LoweringContext } from "@json-schema-engine/core";
+import { type CodeChunk } from "../emit.js";
+import { UnitContext } from "./context.js";
+/** Serialize every present keyword of this unit, in dialect order. */
+export declare function unitBody(ctx: UnitContext): CodeChunk[];
+/** Run one keyword's lower() against a fresh LoweringContext, return its stmts. */
+export declare function collect(ctx: UnitContext, keyword: string, run: (lctx: LoweringContext) => void): LowerStmt[];
+//# sourceMappingURL=unit.d.ts.map

package/dist/serialize/unit.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unit.d.ts","sourceRoot":"","sources":["../../src/serialize/unit.ts"],"names":[],"mappings":"AAGA,OAAO,EAGL,KAAK,SAAS,EACd,KAAK,eAAe,EACrB,MAAM,0BAA0B,CAAC;AAClC,OAAO,EAAE,KAAK,SAAS,EAA2B,MAAM,YAAY,CAAC;AAErE,OAAO,EAAE,WAAW,EAAkB,MAAM,cAAc,CAAC;AAK3D,sEAAsE;AACtE,wBAAgB,QAAQ,CAAC,GAAG,EAAE,WAAW,GAAG,SAAS,EAAE,CA4EtD;AAED,mFAAmF;AACnF,wBAAgB,OAAO,CACrB,GAAG,EAAE,WAAW,EAChB,OAAO,EAAE,MAAM,EACf,GAAG,EAAE,CAAC,IAAI,EAAE,eAAe,KAAK,IAAI,GACnC,SAAS,EAAE,CAiBb"}

package/dist/serialize/unit.js

@@ -0,0 +1,107 @@
+// Per-unit orchestration: run each present keyword's lower() in dialect
+// order and hand its statements to the emitters.
+import { escapeSegment, } from "@json-schema-engine/core";
+import { id, join, js, str, json } from "../emit.js";
+import { TN } from "./names.js";
+import { SerializeError } from "./context.js";
+import { beginKeyword } from "./keywords.js";
+import { keywordStatements } from "./statements.js";
+import { annsPush } from "./spans.js";
+/** Serialize every present keyword of this unit, in dialect order. */
+export function unitBody(ctx) {
+    const node = ctx.unit.ref.node;
+    const dialect = ctx.registry.dialectFor(ctx.unit.ref.baseUri);
+    // Mirrors buildPlan's refOnly (plan.ts, citing engine.ts:397): the plan
+    // only resolved edges for $ref when this is true, so siblings must be
+    // skipped here too, or this would try to serialize applies the plan
+    // never planned.
+    const refOnly = dialect.refIgnoresSiblings && Object.hasOwn(node, "$ref");
+    const out = [];
+    if (ctx.trace) {
+        // One verdict slot per present non-structural keyword, declared up front:
+        // `if` settles `then`/`else`'s verdicts before those keywords' own (empty)
+        // statement lists run. Structural keywords record no entry (engine.ts).
+        const slots = [];
+        for (const entry of dialect.ordered) {
+            if (refOnly && entry.name !== "$ref")
+                continue;
+            if (!Object.hasOwn(node, entry.name))
+                continue;
+            if (entry.behavior.structural === true)
+                continue;
+            const k = id("k" + String(ctx.counters.temp++));
+            ctx.kwVerdicts.set(entry.name, k);
+            slots.push(js `${k} = true`);
+        }
+        if (slots.length > 0)
+            out.push(js `let ${join(", ", slots)};`);
+    }
+    for (const entry of dialect.ordered) {
+        if (refOnly && entry.name !== "$ref")
+            continue;
+        if (!Object.hasOwn(node, entry.name))
+            continue;
+        const behavior = entry.behavior;
+        if (typeof behavior.lower !== "function") {
+            throw new SerializeError("planner accepted unlowerable keyword '" + entry.name + "' (bug)");
+        }
+        const stmts = collect(ctx, entry.name, (lctx) => {
+            behavior.lower(node[entry.name], lctx);
+        });
+        ctx.currentVocab = entry.vocabularyUri;
+        ctx.currentBehaviorId = behavior.id;
+        // Accumulator declarations hoist above the keyword's statements: the
+        // application call sites feed them, the produce reads them.
+        const decls = beginKeyword(ctx, stmts);
+        const chunks = keywordStatements(ctx, stmts);
+        out.push(...decls, ...chunks);
+        // The verdict entry follows the keyword's applications, as the
+        // interpreter's traceKeyword does.
+        if (ctx.trace && behavior.structural !== true) {
+            const k = ctx.kwVerdicts.get(entry.name);
+            out.push(js `${TN}.keywords.push({ name: ${str(entry.name)}, valid: ${k} });`);
+        }
+    }
+    // Unknown keywords collect as annotations (engine.ts:414): unconditional
+    // constant annotations, in schema-key order, after every dialect keyword.
+    // The refOnly break silences siblings, matching the interpreter. Trace
+    // emission records each as an accepting keyword entry whether or not its
+    // annotation is selected.
+    if ((ctx.annMode || ctx.trace) && !refOnly) {
+        for (const name of Object.keys(node)) {
+            if (dialect.keywords.has(name))
+                continue;
+            if (ctx.trace) {
+                out.push(js `${TN}.keywords.push({ name: ${str(name)}, valid: true });`);
+            }
+            if (!ctx.annMode)
+                continue;
+            if (ctx.annKeep && !ctx.annKeep("", name, null))
+                continue;
+            const suffix = "/" + escapeSegment(name);
+            const sloc = ctx.unit.ref.baseUri + "#" + ctx.unit.ref.pointer + suffix;
+            out.push(annsPush(ctx, js `{ keyword: ${str(name)}, evaluationPath: ${id("ep")} + ${str(suffix)}, schemaLocation: ${str(sloc)}, inputLocation: ${id("ip")}, annotation: ${json(node[name])} }`));
+        }
+    }
+    return out;
+}
+/** Run one keyword's lower() against a fresh LoweringContext, return its stmts. */
+export function collect(ctx, keyword, run) {
+    ctx.currentKeyword = keyword;
+    const stmts = [];
+    const unit = ctx.unit;
+    const lctx = {
+        instance: { kind: "instance" },
+        schema: unit.ref.node,
+        staticCoverage: () => unit.coverage,
+        // A tracked unit's consumers read the runtime channel; a static-coverage
+        // consumer (even one that is a region member) keeps its static path and
+        // instead PUSHES its produce onto the channel for the enclosing consumer.
+        runtimeCoverage: () => unit.tracking === true,
+        emit: (...s) => stmts.push(...s),
+        binding: () => ctx.counters.binding++,
+    };
+    run(lctx);
+    return stmts;
+}
+//# sourceMappingURL=unit.js.map

package/dist/serialize/unit.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unit.js","sourceRoot":"","sources":["../../src/serialize/unit.ts"],"names":[],"mappings":"AAAA,wEAAwE;AACxE,iDAAiD;AAEjD,OAAO,EACL,aAAa,GAId,MAAM,0BAA0B,CAAC;AAClC,OAAO,EAAkB,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AACrE,OAAO,EAAE,EAAE,EAAE,MAAM,YAAY,CAAC;AAChC,OAAO,EAAe,cAAc,EAAE,MAAM,cAAc,CAAC;AAC3D,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAC7C,OAAO,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEtC,sEAAsE;AACtE,MAAM,UAAU,QAAQ,CAAC,GAAgB;IACvC,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAiC,CAAC;IAC5D,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC9D,wEAAwE;IACxE,sEAAsE;IACtE,oEAAoE;IACpE,iBAAiB;IACjB,MAAM,OAAO,GAAG,OAAO,CAAC,kBAAkB,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC1E,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QACd,0EAA0E;QAC1E,2EAA2E;QAC3E,wEAAwE;QACxE,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACpC,IAAI,OAAO,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM;gBAAE,SAAS;YAC/C,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC/C,IAAI,KAAK,CAAC,QAAQ,CAAC,UAAU,KAAK,IAAI;gBAAE,SAAS;YACjD,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAChD,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAClC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAA,GAAG,CAAC,SAAS,CAAC,CAAC;QAC9B,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAA,OAAO,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IAChE,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;QACpC,IAAI,OAAO,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM;YAAE,SAAS;QAC/C,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC;YAAE,SAAS;QAC/C,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;QAChC,IAAI,OAAO,QAAQ,CAAC,KAAK,KAAK,UAAU,EAAE,CAAC;YACzC,MAAM,IAAI,cAAc,CACtB,wCAAwC,GAAG,KAAK,CAAC,IAAI,GAAG,SAAS,CAClE,CAAC;QACJ,CAAC;QACD,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;YAC9C,QAAQ,CAAC,KAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAE,EAAE,IAAI,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QACH,GAAG,CAAC,YAAY,GAAG,KAAK,CAAC,aAAa,CAAC;QACvC,GAAG,CAAC,iBAAiB,GAAG,QAAQ,CAAC,EAAE,CAAC;QACpC,qEAAqE;QACrE,4DAA4D;QAC5D,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACvC,MAAM,MAAM,GAAG,iBAAiB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC7C,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,EAAE,GAAG,MAAM,CAAC,CAAC;QAC9B,+DAA+D;QAC/D,mCAAmC;QACnC,IAAI,GAAG,CAAC,KAAK,IAAI,QAAQ,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YAC9C,MAAM,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC;YAC1C,GAAG,CAAC,IAAI,CACN,EAAE,CAAA,GAAG,EAAE,0BAA0B,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CACpE,CAAC;QACJ,CAAC;IACH,CAAC;IACD,yEAAyE;IACzE,0EAA0E;IAC1E,uEAAuE;IACvE,yEAAyE;IACzE,0BAA0B;IAC1B,IAAI,CAAC,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACrC,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YACzC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;gBACd,GAAG,CAAC,IAAI,CAAC,EAAE,CAAA,GAAG,EAAE,0BAA0B,GAAG,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;YAC1E,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,OAAO;gBAAE,SAAS;YAC3B,IAAI,GAAG,CAAC,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC;gBAAE,SAAS;YAC1D,MAAM,MAAM,GAAG,GAAG,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;YACzC,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,MAAM,CAAC;YACxE,GAAG,CAAC,IAAI,CACN,QAAQ,CACN,GAAG,EACH,EAAE,CAAA,cAAc,GAAG,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,MAAM,CAAC,qBAAqB,GAAG,CAAC,IAAI,CAAC,oBAAoB,EAAE,CAAC,IAAI,CAAC,iBAAiB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC,IAAI,CACxK,CACF,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,OAAO,CACrB,GAAgB,EAChB,OAAe,EACf,GAAoC;IAEpC,GAAG,CAAC,cAAc,GAAG,OAAO,CAAC;IAC7B,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;IACtB,MAAM,IAAI,GAAoB;QAC5B,QAAQ,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE;QAC9B,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,IAAiC;QAClD,cAAc,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,QAAQ;QACnC,yEAAyE;QACzE,wEAAwE;QACxE,0EAA0E;QAC1E,eAAe,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,IAAI;QAC7C,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChC,OAAO,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,OAAO,EAAE;KACtC,CAAC;IACF,GAAG,CAAC,IAAI,CAAC,CAAC;IACV,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/standalone.d.ts

@@ -0,0 +1,24 @@
+import { type Engine } from "@json-schema-engine/core";
+/** Thrown when a plan needs the interpreter at runtime (islands/fallbacks). */
+export declare class StandaloneUnsupportedError extends Error {
+}
+/**
+ * The standalone helper preamble, exported so standalone.test.ts can compare
+ * each helper against its core original over a vector corpus (the drift
+ * guard the header describes). Not part of the public API surface.
+ */
+export declare const STANDALONE_PREAMBLE = "// Generated by @json-schema-engine/compiler (standalone mode). Self-contained; no imports.\nconst h_obj = (v) => typeof v === \"object\" && v !== null && !Array.isArray(v);\nconst h_int = (v) => typeof v === \"number\" && Number.isInteger(v);\nconst h_hop = Object.prototype.hasOwnProperty;\nconst h_s0 = [];\n// Mirrors core's MaxDepthExceededError, which the interpreter and every\n// runtime-compiled artifact throw for this bound. Self-contained emission\n// cannot share core's class object, so `instanceof` against it is false\n// here by construction; `constructor.name` is the discriminator a\n// standalone consumer has. Throwing RangeError instead would be worse than\n// imprecise: core converts a native stack RangeError INTO this class so a\n// depth failure is never uncatchable by type, and reusing RangeError for\n// the bound makes \"schema too deep\" and \"blew the native stack\"\n// indistinguishable.\nclass MaxDepthExceededError extends Error {}\nconst h_rx = (source) => {\n  try {\n    return new RegExp(source, \"u\");\n  } catch {\n    return new RegExp(source);\n  }\n};\nconst h_eq = (a, b) => {\n  if (a === b) return true;\n  if (Array.isArray(a)) {\n    if (!Array.isArray(b) || a.length !== b.length) return false;\n    for (let i = 0; i < a.length; i++) if (!h_eq(a[i], b[i])) return false;\n    return true;\n  }\n  if (h_obj(a)) {\n    if (!h_obj(b)) return false;\n    const keys = Object.keys(a);\n    if (keys.length !== Object.keys(b).length) return false;\n    for (const k of keys) {\n      if (!h_hop.call(b, k) || !h_eq(a[k], b[k])) return false;\n    }\n    return true;\n  }\n  return false;\n};\nconst h_ck = (v) => {\n  if (v === null || typeof v !== \"object\") return JSON.stringify(v);\n  if (Array.isArray(v)) return \"[\" + v.map(h_ck).join(\",\") + \"]\";\n  const keys = Object.keys(v).sort();\n  return (\n    \"{\" +\n    keys.map((k) => JSON.stringify(k) + \":\" + h_ck(v[k])).join(\",\") +\n    \"}\"\n  );\n};\nconst h_dup = (items) => {\n  const seen = new Map();\n  for (let i = 0; i < items.length; i++) {\n    const key = h_ck(items[i]);\n    const bucket = seen.get(key);\n    if (bucket === undefined) {\n      seen.set(key, [i]);\n      continue;\n    }\n    for (const j of bucket) if (h_eq(items[j], items[i])) return true;\n    bucket.push(i);\n  }\n  return false;\n};\nconst h_cpl = (s) => {\n  let n = 0;\n  for (let i = 0; i < s.length; i++) {\n    n++;\n    const c = s.charCodeAt(i);\n    if (c >= 0xd800 && c <= 0xdbff) i++;\n  }\n  return n;\n};\nconst h_esc = (s) => s.replace(/~/g, \"~0\").replace(/\\//g, \"~1\");\nconst h_digits = (n) => {\n  if (!Number.isFinite(n)) return 0;\n  const s = Math.abs(n).toString();\n  const eIndex = s.indexOf(\"e\");\n  if (eIndex !== -1) {\n    const mantissa = s.slice(0, eIndex);\n    const exponent = Number(s.slice(eIndex + 1));\n    const dot = mantissa.indexOf(\".\");\n    const mantissaDigits = dot === -1 ? 0 : mantissa.length - dot - 1;\n    return Math.max(0, mantissaDigits - exponent);\n  }\n  const dot = s.indexOf(\".\");\n  return dot === -1 ? 0 : s.length - dot - 1;\n};\nconst h_mof = (instance, divisor) => {\n  const scale = 10 ** Math.max(h_digits(instance), h_digits(divisor));\n  const scaledInstance = instance * scale;\n  const scaledDivisor = divisor * scale;\n  if (Number.isFinite(scaledInstance) && Number.isFinite(scaledDivisor)) {\n    return Math.round(scaledInstance) % Math.round(scaledDivisor) === 0;\n  }\n  const quotient = instance / divisor;\n  return Number.isFinite(quotient) && Number.isInteger(quotient);\n};\n";
+/** Options for {@link emitStandalone}. */
+export interface StandaloneOptions {
+    /** depth bound baked into the module; defaults to core's DEFAULT_MAX_DEPTH */
+    maxDepth?: number;
+}
+/**
+ * Emit a self-contained ES module validating against one registered,
+ * fully-static schema. The module's default export is
+ * `validate(instance): boolean`.
+ * @throws StandaloneUnsupportedError when the plan contains interpreted
+ * units — use the interpreter (CSP) or runtime compilation (no CSP).
+ */
+export declare function emitStandalone(engine: Engine, schemaUri: string, options?: StandaloneOptions): string;
+//# sourceMappingURL=standalone.d.ts.map

package/dist/standalone.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"standalone.d.ts","sourceRoot":"","sources":["../src/standalone.ts"],"names":[],"mappings":"AAkBA,OAAO,EAAqB,KAAK,MAAM,EAAE,MAAM,0BAA0B,CAAC;AAI1E,+EAA+E;AAC/E,qBAAa,0BAA2B,SAAQ,KAAK;CAAG;AAKxD;;;;GAIG;AACH,eAAO,MAAM,mBAAmB,u/GAkG/B,CAAC;AAEF,0CAA0C;AAC1C,MAAM,WAAW,iBAAiB;IAChC,8EAA8E;IAC9E,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAC5B,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,OAAO,GAAE,iBAAsB,GAC9B,MAAM,CAoCR"}