@bjornpagen/bumbledb-log 1.2.1 → 1.3.1

package/dist/migrations/diff.js

@@ -1,385 +0,0 @@
-/**
- * The pure schema diff: previous canonical snapshot versus current canonical
- * snapshot, plus declared typed intent. Structural inference happens ONLY
- * where one safe interpretation exists (unchanged relations/fields carried by
- * identity projections, whole-relation additions, reorders); ambiguous
- * rename-versus-drop, data destruction, required backfills and type changes
- * REQUIRE typed intent or the diff returns the complete finite requirement
- * list — generation never guesses from matching shapes and never fabricates
- * a zero/null.
- *
- * Output is inert plan data with TOTAL ordinary-relation coverage:
- * every ordinary source relation becomes exactly one `map-relation` or
- * `drop-relation`; every ordinary target relation exactly one
- * `map-relation`/`empty-relation`. A source field no expression references is
- * data loss and appears in `destructive` exactly once. Closed relations are
- * sealed schema axioms — unnameable by data operations and exempt from
- * coverage; their evolution is the schema change itself.
- */
-import { fieldExpression, planExpressionOf } from "#migrations/expr.ts";
-function requirement(code, relation, field, detail) {
-    return { code, relation, field, detail };
-}
-function labelToken(text) {
-    let out = "";
-    for (const ch of text.toLowerCase()) {
-        out += (ch >= "a" && ch <= "z") || (ch >= "0" && ch <= "9") ? ch : "-";
-    }
-    return out.replaceAll(/-+/g, "-").replaceAll(/^-|-$/g, "");
-}
-export function diffSchemas(prev, next, entries) {
-    const requirements = [];
-    const intents = entries.map((entry) => ({ entry, consumed: false }));
-    const prevByName = new Map(prev.relations.map((relation) => [relation.name, relation]));
-    const nextByName = new Map(next.relations.map((relation) => [relation.name, relation]));
-    // --- Relation renames -----------------------------------------------------
-    const relationRename = new Map(); // prev name -> next name
-    const renameTargets = new Set();
-    for (const intent of intents) {
-        if (intent.entry.kind !== "rename-relation") {
-            continue;
-        }
-        const { from, to } = intent.entry;
-        intent.consumed = true;
-        if (relationRename.has(from) || renameTargets.has(to)) {
-            requirements.push(requirement("conflicting-intent", from, null, `two renameRelation intents touch ${from} or ${to}`));
-            continue;
-        }
-        if (!prevByName.has(from)) {
-            requirements.push(requirement("stale-intent", from, null, `renameRelation: no previous relation named ${from}`));
-            continue;
-        }
-        if (!nextByName.has(to)) {
-            requirements.push(requirement("stale-intent", to, null, `renameRelation: no current relation named ${to}`));
-            continue;
-        }
-        if (nextByName.has(from)) {
-            requirements.push(requirement("conflicting-intent", from, null, `renameRelation: ${from} still exists in the current schema`));
-            continue;
-        }
-        if (prevByName.has(to)) {
-            requirements.push(requirement("conflicting-intent", to, null, `renameRelation: ${to} already existed in the previous schema`));
-            continue;
-        }
-        relationRename.set(from, to);
-        renameTargets.add(to);
-    }
-    // --- Field renames, keyed by the current (next) relation name -------------
-    const fieldRename = new Map();
-    for (const intent of intents) {
-        if (intent.entry.kind !== "rename-field") {
-            continue;
-        }
-        intent.consumed = true;
-        const { relation, from, to } = intent.entry;
-        let table = fieldRename.get(relation);
-        if (table === undefined) {
-            table = new Map();
-            fieldRename.set(relation, table);
-        }
-        if (table.has(from) || [...table.values()].includes(to)) {
-            requirements.push(requirement("conflicting-intent", relation, from, `two renameField intents touch ${relation}.${from} or .${to}`));
-            continue;
-        }
-        table.set(from, to);
-    }
-    // --- Pair relations ---------------------------------------------------------
-    const pairs = [];
-    const pairedNext = new Set();
-    const droppedSource = [];
-    for (const source of prev.relations) {
-        const targetName = relationRename.get(source.name) ?? source.name;
-        const target = nextByName.get(targetName);
-        if (target !== undefined) {
-            if (source.closed !== target.closed) {
-                requirements.push(requirement("unsupported", target.name, null, `changing ${target.name} between closed and ordinary is not a supported transform; drop the old relation and declare the new one with explicit intent`));
-                continue;
-            }
-            pairs.push({ source, target });
-            pairedNext.add(target.name);
-            continue;
-        }
-        if (source.closed) {
-            // A removed closed relation is pure schema change: its extension is
-            // declared data, unnameable by plan operations, and nothing user-owned
-            // is discarded by data machinery.
-            continue;
-        }
-        const drop = intents.find((intent) => !intent.consumed && intent.entry.kind === "drop-relation" && intent.entry.relation === source.name);
-        if (drop !== undefined) {
-            drop.consumed = true;
-            droppedSource.push(source.name);
-            continue;
-        }
-        const candidates = next.relations
-            .filter((candidate) => !candidate.closed && !prevByName.has(candidate.name) && !renameTargets.has(candidate.name))
-            .map((candidate) => candidate.name);
-        const hint = candidates.length > 0
-            ? ` If this is a rename, declare renameRelation("${source.name}", ${candidates.join(" | ")}) instead.`
-            : "";
-        requirements.push(requirement("destructive", source.name, null, `relation ${source.name} was removed; discarding its data requires dropRelation("${source.name}").${hint}`));
-    }
-    // --- Walk ordinary pairs ------------------------------------------------------
-    const mapOperations = [];
-    const destructive = [];
-    for (const { source, target } of pairs) {
-        if (source.closed) {
-            continue;
-        }
-        const renames = fieldRename.get(target.name) ?? new Map();
-        const targetFields = new Map(target.fields.map((field) => [field.name, field]));
-        const sourceFields = new Map(source.fields.map((field) => [field.name, field]));
-        for (const [from, to] of renames) {
-            // Staleness preempts conflict: a rename whose `from` no longer exists
-            // (typically an intent already consumed by a recorded migration — after
-            // it applied, `to` exists on BOTH sides) matches no change between
-            // these schemas. It must classify stale with its remediation, never as
-            // a contradiction with a live intent.
-            if (!sourceFields.has(from) || !targetFields.has(to)) {
-                if (!sourceFields.has(from)) {
-                    requirements.push(requirement("stale-intent", target.name, from, `renameField: no previous field ${from}; an intent already recorded by a generated migration must be removed`));
-                }
-                if (!targetFields.has(to)) {
-                    requirements.push(requirement("stale-intent", target.name, to, `renameField: no current field ${to}; an intent already recorded by a generated migration must be removed`));
-                }
-                continue;
-            }
-            if (targetFields.has(from)) {
-                requirements.push(requirement("conflicting-intent", target.name, from, `renameField: ${from} still exists in the current schema`));
-            }
-            if (sourceFields.has(to)) {
-                requirements.push(requirement("conflicting-intent", target.name, to, `renameField: ${to} already existed in the previous schema`));
-            }
-        }
-        // Pair fields: renamed or same-named survivors.
-        const sourceOfTarget = new Map(); // target field -> source field
-        const acknowledged = new Set(); // source fields with explicit replace/drop intent
-        for (const field of source.fields) {
-            const survivor = renames.get(field.name) ?? field.name;
-            if (targetFields.has(survivor)) {
-                sourceOfTarget.set(survivor, field.name);
-                continue;
-            }
-            const drop = intents.find((intent) => !intent.consumed &&
-                intent.entry.kind === "drop-field" &&
-                intent.entry.relation === target.name &&
-                intent.entry.field === field.name);
-            if (drop !== undefined) {
-                drop.consumed = true;
-                acknowledged.add(field.name);
-                continue;
-            }
-            const added = target.fields
-                .filter((candidate) => !sourceFields.has(candidate.name))
-                .map((candidate) => candidate.name);
-            const hint = added.length > 0
-                ? ` If this is a rename, declare renameField(${target.name}, "${field.name}", "${added.join('" | "')}").`
-                : "";
-            requirements.push(requirement("destructive", target.name, field.name, `field ${target.name}.${field.name} was removed; discarding its values requires dropField(${target.name}, "${field.name}").${hint}`));
-        }
-        // Build the complete target projection in target declaration order.
-        const projections = [];
-        const referenced = new Set();
-        let identity = source.name === target.name &&
-            source.fields.length === target.fields.length &&
-            source.fields.every((field, ordinal) => target.fields[ordinal]?.name === field.name);
-        for (const field of target.fields) {
-            const sourceName = sourceOfTarget.get(field.name);
-            const convert = intents.find((intent) => !intent.consumed &&
-                intent.entry.kind === "convert" &&
-                intent.entry.relation === target.name &&
-                intent.entry.field === field.name);
-            const fill = intents.find((intent) => !intent.consumed &&
-                intent.entry.kind === "backfill" &&
-                intent.entry.relation === target.name &&
-                intent.entry.field === field.name);
-            if (sourceName !== undefined) {
-                const sourceField = sourceFields.get(sourceName);
-                // Staleness preempts conflict: an intent targeting a field that is
-                // UNCHANGED between these schemas (same name, same type, no rename in
-                // play) matches no change — the signature of an intent already
-                // consumed by a recorded migration. `conflicting-intent` is reserved
-                // for intents contradicting a live change on the field.
-                const fieldUnchanged = sourceName === field.name && sourceField !== undefined && sourceField.type === field.type;
-                // Backfill is only for new fields. On an unchanged existing field it
-                // is stale (already recorded, or the wrong constructor). Convert on
-                // the same field is an explicit meaning change — record it even when
-                // the schema types match (L18 units+1), never drop as identity.
-                if (fieldUnchanged && fill !== undefined) {
-                    fill.consumed = true;
-                    requirements.push(requirement("stale-intent", target.name, field.name, `backfill targets ${target.name}.${field.name}, which is unchanged between these schemas; an intent already recorded by a generated migration must be removed`));
-                    referenced.add(sourceName);
-                    projections.push({ target: field.name, expression: fieldExpression(sourceName) });
-                    continue;
-                }
-                if (fill !== undefined) {
-                    fill.consumed = true;
-                    requirements.push(requirement("conflicting-intent", target.name, field.name, `backfill targets the existing field ${target.name}.${field.name}; use convert for existing fields`));
-                    continue;
-                }
-                if (convert !== undefined) {
-                    convert.consumed = true;
-                    if (convert.entry.kind !== "convert") {
-                        continue;
-                    }
-                    const serialized = planExpressionOf(convert.entry.expression);
-                    if (!serialized.ok) {
-                        requirements.push(requirement("unsupported", target.name, field.name, serialized.detail));
-                        continue;
-                    }
-                    const unknown = serialized.fields.filter((name) => !sourceFields.has(name));
-                    if (unknown.length > 0) {
-                        requirements.push(requirement("unsupported", target.name, field.name, `convert references unknown source fields ${unknown.join(", ")} of ${source.name}`));
-                        continue;
-                    }
-                    for (const name of serialized.fields) {
-                        referenced.add(name);
-                    }
-                    acknowledged.add(sourceName);
-                    projections.push({ target: field.name, expression: serialized.expression });
-                    identity = false;
-                    continue;
-                }
-                if (sourceField !== undefined && sourceField.type !== field.type) {
-                    requirements.push(requirement("type-change", target.name, field.name, `field ${target.name}.${field.name} changed type from ${sourceField.type} to ${field.type}; declare convert(${target.name}, "${field.name}", <checked cast expression>)`));
-                    continue;
-                }
-                referenced.add(sourceName);
-                projections.push({ target: field.name, expression: fieldExpression(sourceName) });
-                if (sourceName !== field.name) {
-                    identity = false;
-                }
-                continue;
-            }
-            // A new field on an existing relation.
-            if (convert !== undefined) {
-                convert.consumed = true;
-                requirements.push(requirement("conflicting-intent", target.name, field.name, `convert targets the new field ${target.name}.${field.name}; use backfill for new fields`));
-                continue;
-            }
-            if (fill === undefined) {
-                requirements.push(requirement("missing-backfill", target.name, field.name, `new required field ${target.name}.${field.name} needs backfill(${target.name}, "${field.name}", <typed expression over the old row>); no zero/null is fabricated`));
-                continue;
-            }
-            fill.consumed = true;
-            if (fill.entry.kind !== "backfill") {
-                continue;
-            }
-            const serialized = planExpressionOf(fill.entry.expression);
-            if (!serialized.ok) {
-                requirements.push(requirement("unsupported", target.name, field.name, serialized.detail));
-                continue;
-            }
-            const unknown = serialized.fields.filter((name) => !sourceFields.has(name));
-            if (unknown.length > 0) {
-                requirements.push(requirement("unsupported", target.name, field.name, `backfill references unknown source fields ${unknown.join(", ")} of ${source.name}`));
-                continue;
-            }
-            for (const name of serialized.fields) {
-                referenced.add(name);
-            }
-            projections.push({ target: field.name, expression: serialized.expression });
-            identity = false;
-        }
-        // Losses: source fields no expression references. Each needs the
-        // explicit intent gathered above; the plan records each exactly once.
-        for (const field of source.fields) {
-            if (referenced.has(field.name)) {
-                continue;
-            }
-            if (!acknowledged.has(field.name)) {
-                // Reachable only when the pairing above already refused; keep the
-                // requirement complete rather than emitting an unacknowledged loss.
-                continue;
-            }
-            destructive.push({ relation: source.name, field: field.name });
-        }
-        mapOperations.push({
-            op: { kind: "map-relation", source: source.name, target: target.name, fields: projections },
-            identity
-        });
-    }
-    // --- New relations ------------------------------------------------------------
-    const emptyOperations = [];
-    for (const relation of next.relations) {
-        if (relation.closed || pairedNext.has(relation.name)) {
-            continue;
-        }
-        emptyOperations.push({ kind: "empty-relation", target: relation.name });
-    }
-    // --- Drops ----------------------------------------------------------------------
-    const dropOperations = [];
-    for (const name of droppedSource) {
-        dropOperations.push({ kind: "drop-relation", source: name });
-        destructive.push({ relation: name });
-    }
-    // --- Seeds -----------------------------------------------------------------------
-    const seedRelations = [];
-    for (const intent of intents) {
-        if (intent.entry.kind !== "seed") {
-            continue;
-        }
-        intent.consumed = true;
-        const target = nextByName.get(intent.entry.relation);
-        if (target === undefined) {
-            requirements.push(requirement("stale-intent", intent.entry.relation, null, `seed: no current relation named ${intent.entry.relation}`));
-            continue;
-        }
-        if (target.closed) {
-            requirements.push(requirement("unsupported", intent.entry.relation, null, `seed targets the closed relation ${intent.entry.relation}; closed extensions are declared in the schema`));
-            continue;
-        }
-        if (!seedRelations.includes(target.name)) {
-            seedRelations.push(target.name);
-        }
-    }
-    const nextOrder = next.relations.map((relation) => relation.name);
-    seedRelations.sort((a, b) => nextOrder.indexOf(a) - nextOrder.indexOf(b));
-    // --- Leftover (stale) intent --------------------------------------------------------
-    for (const intent of intents) {
-        if (intent.consumed) {
-            continue;
-        }
-        const entry = intent.entry;
-        const subject = "relation" in entry ? entry.relation : entry.from;
-        const field = "field" in entry ? entry.field : null;
-        requirements.push(requirement("stale-intent", subject, field, `${entry.kind} intent matches no change between these schemas`));
-    }
-    // --- Deterministic label tokens --------------------------------------------------------
-    const labelTokens = [];
-    if (prev.relations.length === 0) {
-        labelTokens.push("initialize");
-    }
-    else {
-        for (const op of emptyOperations) {
-            if (op.kind === "empty-relation") {
-                labelTokens.push(`create-${labelToken(op.target)}`);
-            }
-        }
-        for (const entry of mapOperations) {
-            if (!entry.identity && entry.op.kind === "map-relation") {
-                labelTokens.push(labelToken(entry.op.target));
-            }
-        }
-        for (const name of seedRelations) {
-            labelTokens.push(`seed-${labelToken(name)}`);
-        }
-        for (const op of dropOperations) {
-            if (op.kind === "drop-relation") {
-                labelTokens.push(`drop-${labelToken(op.source)}`);
-            }
-        }
-        if (labelTokens.length === 0) {
-            labelTokens.push("laws");
-        }
-    }
-    return {
-        operations: [...mapOperations.map((entry) => entry.op), ...emptyOperations, ...dropOperations],
-        destructive,
-        seedRelations,
-        labelTokens,
-        requirements,
-        identity: mapOperations.every((entry) => entry.identity) && emptyOperations.length === 0 && dropOperations.length === 0
-    };
-}
-//# sourceMappingURL=diff.js.map

package/dist/migrations/diff.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"diff.js","sourceRoot":"","sources":["../../src/migrations/diff.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAA;AA2BvE,SAAS,WAAW,CACnB,IAA+B,EAC/B,QAAgB,EAChB,KAAoB,EACpB,MAAc;IAEd,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,CAAA;AACzC,CAAC;AAED,SAAS,UAAU,CAAC,IAAY;IAC/B,IAAI,GAAG,GAAG,EAAE,CAAA;IACZ,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;QACrC,GAAG,IAAI,CAAC,EAAE,IAAI,GAAG,IAAI,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,GAAG,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAA;IACvE,CAAC;IACD,OAAO,GAAG,CAAC,UAAU,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAA;AAC3D,CAAC;AAED,MAAM,UAAU,WAAW,CAC1B,IAAoB,EACpB,IAAoB,EACpB,OAAwC;IAExC,MAAM,YAAY,GAAwB,EAAE,CAAA;IAC5C,MAAM,OAAO,GAAiB,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,CAAA;IAClF,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAA;IACvF,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAA;IAEvF,6EAA6E;IAC7E,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAA,CAAC,yBAAyB;IAC1E,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAA;IACvC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC9B,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,KAAK,iBAAiB,EAAE,CAAC;YAC7C,SAAQ;QACT,CAAC;QACD,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,MAAM,CAAC,KAAK,CAAA;QACjC,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAA;QACtB,IAAI,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvD,YAAY,CAAC,IAAI,CAChB,WAAW,CAAC,oBAAoB,EAAE,IAAI,EAAE,IAAI,EAAE,oCAAoC,IAAI,OAAO,EAAE,EAAE,CAAC,CAClG,CAAA;YACD,SAAQ;QACT,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3B,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,IAAI,EAAE,IAAI,EAAE,8CAA8C,IAAI,EAAE,CAAC,CAAC,CAAA;YAChH,SAAQ;QACT,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACzB,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,EAAE,EAAE,IAAI,EAAE,6CAA6C,EAAE,EAAE,CAAC,CAAC,CAAA;YAC3G,SAAQ;QACT,CAAC;QACD,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,YAAY,CAAC,IAAI,CAChB,WAAW,CAAC,oBAAoB,EAAE,IAAI,EAAE,IAAI,EAAE,mBAAmB,IAAI,qCAAqC,CAAC,CAC3G,CAAA;YACD,SAAQ;QACT,CAAC;QACD,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,YAAY,CAAC,IAAI,CAChB,WAAW,CAAC,oBAAoB,EAAE,EAAE,EAAE,IAAI,EAAE,mBAAmB,EAAE,yCAAyC,CAAC,CAC3G,CAAA;YACD,SAAQ;QACT,CAAC;QACD,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;QAC5B,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;IACtB,CAAC;IAED,6EAA6E;IAC7E,MAAM,WAAW,GAAG,IAAI,GAAG,EAA+B,CAAA;IAC1D,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC9B,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;YAC1C,SAAQ;QACT,CAAC;QACD,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAA;QACtB,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,MAAM,CAAC,KAAK,CAAA;QAC3C,IAAI,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QACrC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACzB,KAAK,GAAG,IAAI,GAAG,EAAE,CAAA;YACjB,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;QACjC,CAAC;QACD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;YACzD,YAAY,CAAC,IAAI,CAChB,WAAW,CAAC,oBAAoB,EAAE,QAAQ,EAAE,IAAI,EAAE,iCAAiC,QAAQ,IAAI,IAAI,QAAQ,EAAE,EAAE,CAAC,CAChH,CAAA;YACD,SAAQ;QACT,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;IACpB,CAAC;IAED,+EAA+E;IAC/E,MAAM,KAAK,GAAgF,EAAE,CAAA;IAC7F,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAA;IACpC,MAAM,aAAa,GAAa,EAAE,CAAA;IAElC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;QACrC,MAAM,UAAU,GAAG,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAA;QACjE,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;QACzC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC1B,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;gBACrC,YAAY,CAAC,IAAI,CAChB,WAAW,CACV,aAAa,EACb,MAAM,CAAC,IAAI,EACX,IAAI,EACJ,YAAY,MAAM,CAAC,IAAI,+HAA+H,CACtJ,CACD,CAAA;gBACD,SAAQ;YACT,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;YAC9B,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAC3B,SAAQ;QACT,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YACnB,oEAAoE;YACpE,uEAAuE;YACvE,kCAAkC;YAClC,SAAQ;QACT,CAAC;QACD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CACxB,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,KAAK,eAAe,IAAI,MAAM,CAAC,KAAK,CAAC,QAAQ,KAAK,MAAM,CAAC,IAAI,CAC9G,CAAA;QACD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACxB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;YACpB,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAC/B,SAAQ;QACT,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS;aAC/B,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;aACjH,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;QACpC,MAAM,IAAI,GACT,UAAU,CAAC,MAAM,GAAG,CAAC;YACpB,CAAC,CAAC,iDAAiD,MAAM,CAAC,IAAI,MAAM,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY;YACtG,CAAC,CAAC,EAAE,CAAA;QACN,YAAY,CAAC,IAAI,CAChB,WAAW,CACV,aAAa,EACb,MAAM,CAAC,IAAI,EACX,IAAI,EACJ,YAAY,MAAM,CAAC,IAAI,4DAA4D,MAAM,CAAC,IAAI,MAAM,IAAI,EAAE,CAC1G,CACD,CAAA;IACF,CAAC;IAED,iFAAiF;IACjF,MAAM,aAAa,GAAsE,EAAE,CAAA;IAC3F,MAAM,WAAW,GAAe,EAAE,CAAA;IAElC,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACxC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YACnB,SAAQ;QACT,CAAC;QACD,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAA;QACzE,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAA;QAC/E,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAA;QAE/E,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC;YAClC,sEAAsE;YACtE,wEAAwE;YACxE,mEAAmE;YACnE,uEAAuE;YACvE,sCAAsC;YACtC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC7B,YAAY,CAAC,IAAI,CAChB,WAAW,CACV,cAAc,EACd,MAAM,CAAC,IAAI,EACX,IAAI,EACJ,kCAAkC,IAAI,uEAAuE,CAC7G,CACD,CAAA;gBACF,CAAC;gBACD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC3B,YAAY,CAAC,IAAI,CAChB,WAAW,CACV,cAAc,EACd,MAAM,CAAC,IAAI,EACX,EAAE,EACF,iCAAiC,EAAE,uEAAuE,CAC1G,CACD,CAAA;gBACF,CAAC;gBACD,SAAQ;YACT,CAAC;YACD,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC5B,YAAY,CAAC,IAAI,CAChB,WAAW,CACV,oBAAoB,EACpB,MAAM,CAAC,IAAI,EACX,IAAI,EACJ,gBAAgB,IAAI,qCAAqC,CACzD,CACD,CAAA;YACF,CAAC;YACD,IAAI,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1B,YAAY,CAAC,IAAI,CAChB,WAAW,CACV,oBAAoB,EACpB,MAAM,CAAC,IAAI,EACX,EAAE,EACF,gBAAgB,EAAE,yCAAyC,CAC3D,CACD,CAAA;YACF,CAAC;QACF,CAAC;QAED,gDAAgD;QAChD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAA,CAAC,+BAA+B;QAChF,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAA,CAAC,kDAAkD;QACzF,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YACnC,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAA;YACtD,IAAI,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChC,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,CAAA;gBACxC,SAAQ;YACT,CAAC;YACD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CACxB,CAAC,MAAM,EAAE,EAAE,CACV,CAAC,MAAM,CAAC,QAAQ;gBAChB,MAAM,CAAC,KAAK,CAAC,IAAI,KAAK,YAAY;gBAClC,MAAM,CAAC,KAAK,CAAC,QAAQ,KAAK,MAAM,CAAC,IAAI;gBACrC,MAAM,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK,CAAC,IAAI,CAClC,CAAA;YACD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACxB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;gBACpB,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;gBAC5B,SAAQ;YACT,CAAC;YACD,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM;iBACzB,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;iBACxD,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;YACpC,MAAM,IAAI,GACT,KAAK,CAAC,MAAM,GAAG,CAAC;gBACf,CAAC,CAAC,6CAA6C,MAAM,CAAC,IAAI,MAAM,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK;gBACzG,CAAC,CAAC,EAAE,CAAA;YACN,YAAY,CAAC,IAAI,CAChB,WAAW,CACV,aAAa,EACb,MAAM,CAAC,IAAI,EACX,KAAK,CAAC,IAAI,EACV,SAAS,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,0DAA0D,MAAM,CAAC,IAAI,MAAM,KAAK,CAAC,IAAI,MAAM,IAAI,EAAE,CACnI,CACD,CAAA;QACF,CAAC;QAED,oEAAoE;QACpE,MAAM,WAAW,GAAmB,EAAE,CAAA;QACtC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAA;QACpC,IAAI,QAAQ,GACX,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI;YAC3B,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM;YAC7C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,IAAI,KAAK,KAAK,CAAC,IAAI,CAAC,CAAA;QAErF,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YACnC,MAAM,UAAU,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YACjD,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,CAC3B,CAAC,MAAM,EAAE,EAAE,CACV,CAAC,MAAM,CAAC,QAAQ;gBAChB,MAAM,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS;gBAC/B,MAAM,CAAC,KAAK,CAAC,QAAQ,KAAK,MAAM,CAAC,IAAI;gBACrC,MAAM,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK,CAAC,IAAI,CAClC,CAAA;YACD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CACxB,CAAC,MAAM,EAAE,EAAE,CACV,CAAC,MAAM,CAAC,QAAQ;gBAChB,MAAM,CAAC,KAAK,CAAC,IAAI,KAAK,UAAU;gBAChC,MAAM,CAAC,KAAK,CAAC,QAAQ,KAAK,MAAM,CAAC,IAAI;gBACrC,MAAM,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK,CAAC,IAAI,CAClC,CAAA;YACD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;gBAC9B,MAAM,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;gBAChD,mEAAmE;gBACnE,sEAAsE;gBACtE,+DAA+D;gBAC/D,qEAAqE;gBACrE,wDAAwD;gBACxD,MAAM,cAAc,GAAG,UAAU,KAAK,KAAK,CAAC,IAAI,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,CAAA;gBAChH,qEAAqE;gBACrE,oEAAoE;gBACpE,qEAAqE;gBACrE,gEAAgE;gBAChE,IAAI,cAAc,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBAC1C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;oBACpB,YAAY,CAAC,IAAI,CAChB,WAAW,CACV,cAAc,EACd,MAAM,CAAC,IAAI,EACX,KAAK,CAAC,IAAI,EACV,oBAAoB,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,iHAAiH,CAC9J,CACD,CAAA;oBACD,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;oBAC1B,WAAW,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,IAAI,EAAE,UAAU,EAAE,eAAe,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;oBACjF,SAAQ;gBACT,CAAC;gBACD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACxB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;oBACpB,YAAY,CAAC,IAAI,CAChB,WAAW,CACV,oBAAoB,EACpB,MAAM,CAAC,IAAI,EACX,KAAK,CAAC,IAAI,EACV,uCAAuC,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,mCAAmC,CACnG,CACD,CAAA;oBACD,SAAQ;gBACT,CAAC;gBACD,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;oBAC3B,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAA;oBACvB,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;wBACtC,SAAQ;oBACT,CAAC;oBACD,MAAM,UAAU,GAAG,gBAAgB,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,CAAA;oBAC7D,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC;wBACpB,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,aAAa,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAA;wBACzF,SAAQ;oBACT,CAAC;oBACD,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAA;oBAC3E,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACxB,YAAY,CAAC,IAAI,CAChB,WAAW,CACV,aAAa,EACb,MAAM,CAAC,IAAI,EACX,KAAK,CAAC,IAAI,EACV,4CAA4C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,MAAM,CAAC,IAAI,EAAE,CAClF,CACD,CAAA;wBACD,SAAQ;oBACT,CAAC;oBACD,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;wBACtC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;oBACrB,CAAC;oBACD,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;oBAC5B,WAAW,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,IAAI,EAAE,UAAU,EAAE,UAAU,CAAC,UAAU,EAAE,CAAC,CAAA;oBAC3E,QAAQ,GAAG,KAAK,CAAA;oBAChB,SAAQ;gBACT,CAAC;gBACD,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;oBAClE,YAAY,CAAC,IAAI,CAChB,WAAW,CACV,aAAa,EACb,MAAM,CAAC,IAAI,EACX,KAAK,CAAC,IAAI,EACV,SAAS,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,sBAAsB,WAAW,CAAC,IAAI,OAAO,KAAK,CAAC,IAAI,qBAAqB,MAAM,CAAC,IAAI,MAAM,KAAK,CAAC,IAAI,+BAA+B,CACxK,CACD,CAAA;oBACD,SAAQ;gBACT,CAAC;gBACD,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;gBAC1B,WAAW,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,IAAI,EAAE,UAAU,EAAE,eAAe,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;gBACjF,IAAI,UAAU,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;oBAC/B,QAAQ,GAAG,KAAK,CAAA;gBACjB,CAAC;gBACD,SAAQ;YACT,CAAC;YACD,uCAAuC;YACvC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC3B,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAA;gBACvB,YAAY,CAAC,IAAI,CAChB,WAAW,CACV,oBAAoB,EACpB,MAAM,CAAC,IAAI,EACX,KAAK,CAAC,IAAI,EACV,iCAAiC,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,+BAA+B,CACzF,CACD,CAAA;gBACD,SAAQ;YACT,CAAC;YACD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACxB,YAAY,CAAC,IAAI,CAChB,WAAW,CACV,kBAAkB,EAClB,MAAM,CAAC,IAAI,EACX,KAAK,CAAC,IAAI,EACV,sBAAsB,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,mBAAmB,MAAM,CAAC,IAAI,MAAM,KAAK,CAAC,IAAI,qEAAqE,CAClK,CACD,CAAA;gBACD,SAAQ;YACT,CAAC;YACD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;YACpB,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBACpC,SAAQ;YACT,CAAC;YACD,MAAM,UAAU,GAAG,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAA;YAC1D,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC;gBACpB,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,aAAa,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAA;gBACzF,SAAQ;YACT,CAAC;YACD,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAA;YAC3E,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,YAAY,CAAC,IAAI,CAChB,WAAW,CACV,aAAa,EACb,MAAM,CAAC,IAAI,EACX,KAAK,CAAC,IAAI,EACV,6CAA6C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,MAAM,CAAC,IAAI,EAAE,CACnF,CACD,CAAA;gBACD,SAAQ;YACT,CAAC;YACD,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;gBACtC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACrB,CAAC;YACD,WAAW,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,IAAI,EAAE,UAAU,EAAE,UAAU,CAAC,UAAU,EAAE,CAAC,CAAA;YAC3E,QAAQ,GAAG,KAAK,CAAA;QACjB,CAAC;QAED,iEAAiE;QACjE,sEAAsE;QACtE,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YACnC,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChC,SAAQ;YACT,CAAC;YACD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnC,kEAAkE;gBAClE,oEAAoE;gBACpE,SAAQ;YACT,CAAC;YACD,WAAW,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAA;QAC/D,CAAC;QAED,aAAa,CAAC,IAAI,CAAC;YAClB,EAAE,EAAE,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE;YAC3F,QAAQ;SACR,CAAC,CAAA;IACH,CAAC;IAED,iFAAiF;IACjF,MAAM,eAAe,GAAoB,EAAE,CAAA;IAC3C,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;QACvC,IAAI,QAAQ,CAAC,MAAM,IAAI,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACtD,SAAQ;QACT,CAAC;QACD,eAAe,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,MAAM,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAA;IACxE,CAAC;IAED,mFAAmF;IACnF,MAAM,cAAc,GAAoB,EAAE,CAAA;IAC1C,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QAClC,cAAc,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAA;QAC5D,WAAW,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAA;IACrC,CAAC;IAED,oFAAoF;IACpF,MAAM,aAAa,GAAa,EAAE,CAAA;IAClC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC9B,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAClC,SAAQ;QACT,CAAC;QACD,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAA;QACtB,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;QACpD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC1B,YAAY,CAAC,IAAI,CAChB,WAAW,CACV,cAAc,EACd,MAAM,CAAC,KAAK,CAAC,QAAQ,EACrB,IAAI,EACJ,mCAAmC,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,CAC1D,CACD,CAAA;YACD,SAAQ;QACT,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YACnB,YAAY,CAAC,IAAI,CAChB,WAAW,CACV,aAAa,EACb,MAAM,CAAC,KAAK,CAAC,QAAQ,EACrB,IAAI,EACJ,oCAAoC,MAAM,CAAC,KAAK,CAAC,QAAQ,gDAAgD,CACzG,CACD,CAAA;YACD,SAAQ;QACT,CAAC;QACD,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1C,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QAChC,CAAC;IACF,CAAC;IACD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;IACjE,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;IAEzE,uFAAuF;IACvF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YACrB,SAAQ;QACT,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAA;QAC1B,MAAM,OAAO,GAAG,UAAU,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAA;QACjE,MAAM,KAAK,GAAG,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAA;QACnD,YAAY,CAAC,IAAI,CAChB,WAAW,CAAC,cAAc,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,IAAI,iDAAiD,CAAC,CAC3G,CAAA;IACF,CAAC;IAED,0FAA0F;IAC1F,MAAM,WAAW,GAAa,EAAE,CAAA;IAChC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjC,WAAW,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;IAC/B,CAAC;SAAM,CAAC;QACP,KAAK,MAAM,EAAE,IAAI,eAAe,EAAE,CAAC;YAClC,IAAI,EAAE,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;gBAClC,WAAW,CAAC,IAAI,CAAC,UAAU,UAAU,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;YACpD,CAAC;QACF,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;YACnC,IAAI,CAAC,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC,EAAE,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;gBACzD,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAA;YAC9C,CAAC;QACF,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YAClC,WAAW,CAAC,IAAI,CAAC,QAAQ,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC7C,CAAC;QACD,KAAK,MAAM,EAAE,IAAI,cAAc,EAAE,CAAC;YACjC,IAAI,EAAE,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;gBACjC,WAAW,CAAC,IAAI,CAAC,QAAQ,UAAU,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;YAClD,CAAC;QACF,CAAC;QACD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACzB,CAAC;IACF,CAAC;IAED,OAAO;QACN,UAAU,EAAE,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,eAAe,EAAE,GAAG,cAAc,CAAC;QAC9F,WAAW;QACX,aAAa;QACb,WAAW;QACX,YAAY;QACZ,QAAQ,EACP,aAAa,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;KAC9G,CAAA;AACF,CAAC"}

package/dist/migrations/expr.d.ts

@@ -1,22 +0,0 @@
-import type { PlanExpression, PlanValue } from "./types.js";
-export type ExprResult = {
-    readonly ok: true;
-    readonly expression: PlanExpression;
-    readonly fields: readonly string[];
-} | {
-    readonly ok: false;
-    readonly detail: string;
-};
-/**
- * Bounded structural check of one literal payload into the canonical
- * one-arm value spelling.
- */
-export declare function planValueOf(value: unknown): PlanValue | string;
-/**
- * Serialize one core scalar expression into canonical plan data, collecting
- * the referenced source field names for loss accounting.
- */
-export declare function planExpressionOf(expression: unknown): ExprResult;
-/** The identity projection every carried field lowers to. */
-export declare function fieldExpression(name: string): PlanExpression;
-//# sourceMappingURL=expr.d.ts.map

package/dist/migrations/expr.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"expr.d.ts","sourceRoot":"","sources":["../../src/migrations/expr.ts"],"names":[],"mappings":"AAgBA,OAAO,KAAK,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAA;AAErE,MAAM,MAAM,UAAU,GACnB;IAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC;IAAC,QAAQ,CAAC,UAAU,EAAE,cAAc,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAA;CAAE,GAC9F;IAAE,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAA;AAuElD;;;GAGG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,GAAG,SAAS,GAAG,MAAM,CA6D9D;AAsED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,OAAO,GAAG,UAAU,CAOhE;AAED,6DAA6D;AAC7D,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,cAAc,CAE5D"}

package/dist/migrations/expr.js

@@ -1,219 +0,0 @@
-/**
- * Core `ScalarExpr` → canonical migration-plan expression data.
- * The generator SERIALIZES the core's typed scalar AST; it never evaluates
- * it — the native executor lowers the plan onto `bumbledb::ScalarExpr` and
- * the core `ScalarEvaluator` executes it with the core's exact numeric
- * semantics, and native plan compilation re-judges every node and type. The
- * walk below is a bounded structural check with the same depth fence as the
- * native codec (`MAX_EXPR_DEPTH = 128`); any node outside the frozen core
- * roster (closure, module path, unknown kind) is an unsupported-transform
- * refusal, never a fallback.
- * Literal payloads accept canonical wire values and the bigint, number,
- * and Uint8Array values retained by core SDK constructors. The serialized
- * form is checked again by the native migration-plan decoder.
- */
-import { Uuid } from "@bjornpagen/bumbledb";
-import { bytesHex, f64Bits } from "#migrations/canonical.ts";
-const MAX_DEPTH = 128;
-const MAX_NODES = 4096;
-const MAX_TEXT = 65536;
-function refuse(detail) {
-    return { ok: false, detail };
-}
-function isRecord(value) {
-    return typeof value === "object" && value !== null;
-}
-function isCanonicalHex(text, length) {
-    if (text.length !== length) {
-        return false;
-    }
-    for (let index = 0; index < text.length; index += 1) {
-        const code = text.charCodeAt(index);
-        if (!((code >= 48 && code <= 57) || (code >= 97 && code <= 102))) {
-            return false;
-        }
-    }
-    return true;
-}
-const U64_MAX = 0xffffffffffffffffn;
-const I64_MIN = -0x8000000000000000n;
-const I64_MAX = 0x7fffffffffffffffn;
-function decimalU64(value) {
-    if (typeof value === "bigint" && value >= 0n && value <= U64_MAX) {
-        return value.toString(10);
-    }
-    if (typeof value === "string" && value.length > 0 && value.length <= 20 && /^(0|[1-9][0-9]*)$/.test(value)) {
-        return BigInt(value) <= U64_MAX ? value : null;
-    }
-    return null;
-}
-function decimalI64(value) {
-    if (typeof value === "bigint" && value >= I64_MIN && value <= I64_MAX) {
-        return value.toString(10);
-    }
-    if (typeof value === "string" && value.length > 0 && value.length <= 21 && /^(0|-?[1-9][0-9]*)$/.test(value)) {
-        const parsed = BigInt(value);
-        return parsed >= I64_MIN && parsed <= I64_MAX ? value : null;
-    }
-    return null;
-}
-function bitsOf(value) {
-    if (typeof value === "number") {
-        return f64Bits(value);
-    }
-    if (typeof value === "string" && isCanonicalHex(value, 16)) {
-        return value;
-    }
-    return null;
-}
-function pairOf(value, one) {
-    if (!Array.isArray(value) || value.length !== 2) {
-        return null;
-    }
-    const start = one(value[0]);
-    const end = one(value[1]);
-    return start === null || end === null ? null : [start, end];
-}
-/**
- * Bounded structural check of one literal payload into the canonical
- * one-arm value spelling.
- */
-export function planValueOf(value) {
-    if (!isRecord(value)) {
-        return "a literal payload must be a one-arm tagged core value";
-    }
-    const keys = Object.keys(value);
-    if (keys.length !== 1) {
-        return "a literal payload must have exactly one value arm";
-    }
-    const arm = keys[0];
-    const body = value[arm];
-    switch (arm) {
-        case "bool":
-            return typeof body === "boolean" ? { bool: body } : "bool literal needs a boolean";
-        case "u64": {
-            const decimal = decimalU64(body);
-            return decimal === null ? "u64 literal needs a canonical in-range integer" : { u64: decimal };
-        }
-        case "i64": {
-            const decimal = decimalI64(body);
-            return decimal === null ? "i64 literal needs a canonical in-range integer" : { i64: decimal };
-        }
-        case "$f64":
-        case "f64": {
-            const bits = bitsOf(body);
-            return bits === null ? "f64 literal needs a number or 16 lowercase hex bits" : { $f64: bits };
-        }
-        case "uuid":
-            return Uuid.isUuid(body) ? { uuid: body } : "uuid literal needs a canonical UUID";
-        case "string":
-            return typeof body === "string" && body.length <= MAX_TEXT && body.isWellFormed()
-                ? { string: body }
-                : "string literal needs bounded well-formed text";
-        case "fixedBytes": {
-            if (body instanceof Uint8Array && body.length <= MAX_TEXT) {
-                return { fixedBytes: bytesHex(body) };
-            }
-            if (typeof body === "string" &&
-                body.length <= 2 * MAX_TEXT &&
-                body.length % 2 === 0 &&
-                isCanonicalHex(body, body.length)) {
-                return { fixedBytes: body };
-            }
-            return "fixedBytes literal needs a bounded Uint8Array or lowercase hex";
-        }
-        case "intervalU64": {
-            const pair = pairOf(body, decimalU64);
-            return pair === null ? "intervalU64 literal needs two canonical integers" : { intervalU64: pair };
-        }
-        case "intervalI64": {
-            const pair = pairOf(body, decimalI64);
-            return pair === null ? "intervalI64 literal needs two canonical integers" : { intervalI64: pair };
-        }
-        case "intervalF64": {
-            const pair = pairOf(body, bitsOf);
-            return pair === null ? "intervalF64 literal needs two float endpoints" : { intervalF64: pair };
-        }
-        default:
-            return `unknown literal arm ${arm}`;
-    }
-}
-const CASTS = ["toF64", "toF64Exact", "toI64Exact", "toU64Exact"];
-function walk(node, depth, budget, fields) {
-    if (depth > MAX_DEPTH) {
-        return `expression deeper than ${MAX_DEPTH}`;
-    }
-    budget.nodes += 1;
-    if (budget.nodes > MAX_NODES) {
-        return `expression larger than ${MAX_NODES} nodes`;
-    }
-    if (!isRecord(node) || typeof node.kind !== "string") {
-        return "an expression node must be a tagged core ScalarExpr value — functions, promises and plain hosts are not plan data";
-    }
-    switch (node.kind) {
-        case "field": {
-            if (typeof node.name !== "string" || node.name.length === 0 || node.name.length > 255) {
-                return "a field reference needs a bounded source field name";
-            }
-            fields.add(node.name);
-            return { kind: "field", name: node.name };
-        }
-        case "literal": {
-            const value = planValueOf(node.value);
-            return typeof value === "string" ? value : { kind: "literal", value };
-        }
-        case "negate":
-        case "isNaN":
-        case "isFinite": {
-            const inner = walk(node.expr, depth + 1, budget, fields);
-            if (typeof inner === "string") {
-                return inner;
-            }
-            return { kind: node.kind, expr: inner };
-        }
-        case "add":
-        case "subtract":
-        case "multiply":
-        case "divide": {
-            const left = walk(node.left, depth + 1, budget, fields);
-            if (typeof left === "string") {
-                return left;
-            }
-            const right = walk(node.right, depth + 1, budget, fields);
-            if (typeof right === "string") {
-                return right;
-            }
-            return { kind: node.kind, left, right };
-        }
-        case "cast": {
-            const cast = CASTS.find((name) => name === node.cast);
-            if (cast === undefined) {
-                return `unknown cast ${String(node.cast)} — the checked roster is toF64/toF64Exact/toI64Exact/toU64Exact`;
-            }
-            const inner = walk(node.expr, depth + 1, budget, fields);
-            if (typeof inner === "string") {
-                return inner;
-            }
-            return { kind: "cast", cast, expr: inner };
-        }
-        default:
-            return `unsupported expression node ${node.kind} — the finite supported grammar is field/literal/negate/add/subtract/multiply/divide/cast/isNaN/isFinite`;
-    }
-}
-/**
- * Serialize one core scalar expression into canonical plan data, collecting
- * the referenced source field names for loss accounting.
- */
-export function planExpressionOf(expression) {
-    const fields = new Set();
-    const outcome = walk(expression, 0, { nodes: 0 }, fields);
-    if (typeof outcome === "string") {
-        return refuse(outcome);
-    }
-    return { ok: true, expression: outcome, fields: [...fields] };
-}
-/** The identity projection every carried field lowers to. */
-export function fieldExpression(name) {
-    return { kind: "field", name };
-}
-//# sourceMappingURL=expr.js.map