@packet-schema/core 0.1.0

package/dist/collect-refs.d.ts

@@ -0,0 +1,4 @@
+import type { Packet } from "./types.js";
+/** All plain field-id references reachable from a packet's expressions. */
+export declare function collectPsdlRefs(packet: Packet): Set<string>;
+//# sourceMappingURL=collect-refs.d.ts.map

package/dist/collect-refs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"collect-refs.d.ts","sourceRoot":"","sources":["../src/collect-refs.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAmB,MAAM,EAAE,MAAM,YAAY,CAAC;AAY1D,2EAA2E;AAC3E,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CA4C3D"}

package/dist/collect-refs.js

@@ -0,0 +1,76 @@
+import { walkExpr } from "./expr.js";
+import { isField } from "./utils.js";
+function isExpr(value) {
+    return typeof value === "object" && value !== null && "kind" in value &&
+        typeof value.kind === "string";
+}
+function isUntilCount(value) {
+    return typeof value === "object" && value !== null && "until" in value &&
+        isExpr(value.until);
+}
+/** All plain field-id references reachable from a packet's expressions. */
+export function collectPsdlRefs(packet) {
+    const out = new Set();
+    const visit = (e) => {
+        walkExpr(e, (n) => {
+            if (n.kind === "ref")
+                out.add(n.field);
+        });
+    };
+    const walk = (containers) => {
+        for (const c of containers) {
+            if (isField(c)) {
+                // A delimiter-terminated bytes length (`delimiter` form, §3) carries no Expr.
+                if (c.type.kind === "bytes" && isExpr(c.type.n))
+                    visit(c.type.n);
+                if (c.computedFrom)
+                    visit(c.computedFrom);
+                continue;
+            }
+            switch (c.kind) {
+                case "virtual":
+                    visit(c.expr);
+                    break;
+                case "group":
+                    walk(c.children);
+                    break;
+                case "bounded":
+                    visit(c.bytes);
+                    walk(c.fields);
+                    break;
+                case "switch":
+                    visit(c.on);
+                    for (const arm of Object.values(c.cases))
+                        walk(arm.fields);
+                    break;
+                case "repeat":
+                    if (isExpr(c.count))
+                        visit(c.count);
+                    else if (isUntilCount(c.count))
+                        visit(c.count.until);
+                    walk(c.element.fields);
+                    break;
+                case "encrypted":
+                    if (c.wireBits)
+                        visit(c.wireBits);
+                    walk(c.plaintext.fields);
+                    break;
+                case "optional":
+                    visit(c.when);
+                    walk([c.container]);
+                    break;
+                // align, ref: no inline field-id expressions
+            }
+        }
+    };
+    walk(packet.body);
+    if (packet.defs)
+        for (const def of Object.values(packet.defs))
+            walk(def.fields);
+    for (const con of packet.constraints ?? []) {
+        visit(con.lhs);
+        visit(con.rhs);
+    }
+    return out;
+}
+//# sourceMappingURL=collect-refs.js.map

package/dist/collect-refs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"collect-refs.js","sourceRoot":"","sources":["../src/collect-refs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACrC,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAGrC,SAAS,MAAM,CAAC,KAAc;IAC5B,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,MAAM,IAAI,KAAK;QACnE,OAAQ,KAAiC,CAAC,IAAI,KAAK,QAAQ,CAAC;AAChE,CAAC;AAED,SAAS,YAAY,CAAC,KAAc;IAClC,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK;QACpE,MAAM,CAAE,KAAiC,CAAC,KAAK,CAAC,CAAC;AACrD,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,eAAe,CAAC,MAAc;IAC5C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,MAAM,KAAK,GAAG,CAAC,CAAO,EAAQ,EAAE;QAC9B,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE;YAChB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK;gBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,UAAuB,EAAQ,EAAE;QAC7C,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;gBACf,8EAA8E;gBAC9E,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;oBAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACjE,IAAI,CAAC,CAAC,YAAY;oBAAE,KAAK,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;gBAC1C,SAAS;YACX,CAAC;YACD,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;gBACf,KAAK,SAAS;oBAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBAAC,MAAM;gBACrC,KAAK,OAAO;oBAAE,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;oBAAC,MAAM;gBACtC,KAAK,SAAS;oBAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;oBAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;oBAAC,MAAM;gBACtD,KAAK,QAAQ;oBACX,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBACZ,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;wBAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBAC3D,MAAM;gBACR,KAAK,QAAQ;oBACX,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;wBAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;yBAC/B,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;wBAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;oBACrD,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;oBACvB,MAAM;gBACR,KAAK,WAAW;oBACd,IAAI,CAAC,CAAC,QAAQ;wBAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;oBAClC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;oBACzB,MAAM;gBACR,KAAK,UAAU;oBACb,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBACd,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;oBACpB,MAAM;gBACR,6CAA6C;YAC/C,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IACF,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAClB,IAAI,MAAM,CAAC,IAAI;QAAE,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAChF,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,WAAW,IAAI,EAAE,EAAE,CAAC;QAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAAC,CAAC;IAC/E,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/constraint.d.ts

@@ -0,0 +1,66 @@
+import type { Constraint, NormativeLevel, PacketEnv } from "./types.js";
+export type PropagateOk = {
+    ok: PacketEnv;
+};
+/**
+ * A hard solver conflict (§9.1). `index` identifies the conflicting constraint
+ * within the `constraints` array (so an LSP can map the conflict back to a
+ * source range) and `env` carries the partially-propagated environment at the
+ * moment the conflict was detected — re-running `validateConstraints` over it
+ * reproduces the conflict with full per-constraint diagnostics. Both fields
+ * are additive (older callers that only read `conflict` keep working).
+ */
+export type PropagateConflict = {
+    conflict: string;
+    index?: number;
+    env?: PacketEnv;
+};
+export type PropagateResult = PropagateOk | PropagateConflict;
+export declare function propagate(constraints: Constraint[], env: PacketEnv, changedKey: string): PropagateResult;
+/**
+ * Fixpoint back-propagation (§9): re-run the constraint list until no new
+ * field is resolved in a pass. Seeds the pass set from every key in `env`
+ * UNION every ref mentioned by a `must` (or level-less) constraint, so a
+ * constraint sharing no ref with the env — e.g. the literal-only
+ * `version == 4` — still fires and can start a resolution chain (§9
+ * "re-runs the full constraint list until no new fields are resolved").
+ */
+export declare function propagateFixpoint(constraints: Constraint[], env: PacketEnv): PropagateResult;
+/**
+ * A constraint mismatch diagnostic (§9.1). EVERY failing constraint — `must`
+ * included — is reported as one of these: `should`/`may` mismatches are
+ * advisories (warning/info), while a failing `must` additionally drives the
+ * hard `conflict` (so a `must` violation appears both as the `conflict` string
+ * and as a level-tagged entry here). `index` identifies the failing constraint
+ * within the `constraints` array (so an LSP can map the diagnostic back to a
+ * source range) and `doc` copies the constraint's authored doc string when
+ * present.
+ */
+export type ConstraintDiagnostic = {
+    index: number;
+    level: NormativeLevel;
+    message: string;
+    doc?: string;
+};
+/**
+ * Evaluate every constraint for diagnostics (§9.1). `must` (and level-less)
+ * mismatches become a hard `conflict`; `should`/`may` mismatches are collected
+ * into `diagnostics` (level-tagged) so the caller can map them to warning/info
+ * severities. `should`/`may` never produce a conflict, matching the solver's
+ * back-propagation exclusion in `propagate`. EVERY failing constraint — `must`
+ * included — also appears in `diagnostics` with its index, so an LSP can map
+ * each violation (not just the first) back to a source range; the `conflict`
+ * string is derived from the first failing `must` in declaration order.
+ * Evaluation errors (e.g. division by zero in an expression) likewise never
+ * escape as exceptions: they become a diagnostic at the constraint's level
+ * (plus the hard conflict for `must`), so a single broken advisory constraint
+ * cannot crash diagnostics generation.
+ */
+export declare function validateConstraints(constraints: Constraint[], env: PacketEnv): {
+    ok: true;
+    diagnostics?: ConstraintDiagnostic[];
+} | {
+    conflict: string;
+    diagnostics: ConstraintDiagnostic[];
+};
+//# sourceMappingURL=constraint.d.ts.map

package/dist/constraint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constraint.d.ts","sourceRoot":"","sources":["../src/constraint.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAQ,cAAc,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAE9E,MAAM,MAAM,WAAW,GAAG;IAAE,EAAE,EAAE,SAAS,CAAA;CAAE,CAAC;AAC5C;;;;;;;GAOG;AACH,MAAM,MAAM,iBAAiB,GAAG;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,SAAS,CAAA;CAAE,CAAC;AACtF,MAAM,MAAM,eAAe,GAAG,WAAW,GAAG,iBAAiB,CAAC;AA6I9D,wBAAgB,SAAS,CACvB,WAAW,EAAE,UAAU,EAAE,EACzB,GAAG,EAAE,SAAS,EACd,UAAU,EAAE,MAAM,GACjB,eAAe,CAsCjB;AAUD;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAC/B,WAAW,EAAE,UAAU,EAAE,EACzB,GAAG,EAAE,SAAS,GACb,eAAe,CA2BjB;AAED;;;;;;;;;GASG;AACH,MAAM,MAAM,oBAAoB,GAAG;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,cAAc,CAAC;IACtB,OAAO,EAAE,MAAM,CAAC;IAChB,GAAG,CAAC,EAAE,MAAM,CAAC;CACd,CAAC;AAOF;;;;;;;;;;;;;GAaG;AACH,wBAAgB,mBAAmB,CACjC,WAAW,EAAE,UAAU,EAAE,EACzB,GAAG,EAAE,SAAS,GACb;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,WAAW,CAAC,EAAE,oBAAoB,EAAE,CAAA;CAAE,GACjD;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,oBAAoB,EAAE,CAAA;CAAE,CA0B5D"}

package/dist/constraint.js

@@ -0,0 +1,286 @@
+import { evalExpr, exprContains, MissingRefError, walkExpr } from "./expr.js";
+function solveFor(expr, targetRef, known, env) {
+    if (expr.kind === "ref")
+        return expr.field === targetRef ? known : null;
+    if (expr.kind !== "op")
+        return null; // only linear op-trees are invertible
+    const aHas = containsRef(expr.a, targetRef);
+    const bHas = containsRef(expr.b, targetRef);
+    if (aHas === bHas)
+        return null;
+    if (aHas) {
+        const bVal = evalConst(expr.b, env);
+        if (bVal === null)
+            return null;
+        const peeled = invertLeft(expr.op, known, bVal);
+        if (peeled === null)
+            return null;
+        return solveFor(expr.a, targetRef, peeled, env);
+    }
+    else {
+        const aVal = evalConst(expr.a, env);
+        if (aVal === null)
+            return null;
+        const peeled = invertRight(expr.op, known, aVal);
+        if (peeled === null)
+            return null;
+        return solveFor(expr.b, targetRef, peeled, env);
+    }
+}
+function containsRef(expr, target) {
+    return exprContains(expr, (e) => e.kind === "ref" && e.field === target);
+}
+function evalConst(expr, env) {
+    try {
+        return evalExpr(expr, env);
+    }
+    catch (e) {
+        if (e instanceof MissingRefError)
+            return null;
+        throw e;
+    }
+}
+// Invert `a OP known = result` for `a` (the unknown on the LEFT operand).
+// Shifts use the semantics of expr.ts (`<<` → `(a<<b)>>>0` unsigned, `>>` →
+// arithmetic `a>>b`, §4). They are lossy and not uniquely invertible, so the
+// candidate produced here is verified by re-evaluation in applyKnownSide
+// before adoption.
+function invertLeft(o, result, known) {
+    switch (o) {
+        case "+": return result - known;
+        case "-": return result + known;
+        case "*": return known === 0 ? null : Math.trunc(result / known);
+        case "/": return result * known;
+        case "%": return null;
+        case "<<": return result >>> known; // inverse of (a << known)>>>0
+        case ">>": return (result << known) | 0; // inverse of arithmetic a >> known
+    }
+    return null;
+}
+// Invert `known OP b = result` for `b` (the unknown on the RIGHT operand).
+function invertRight(o, result, known) {
+    switch (o) {
+        case "+": return result - known;
+        case "-": return known - result;
+        case "*": return known === 0 ? null : Math.trunc(result / known);
+        case "/": return result === 0 ? null : Math.trunc(known / result);
+        case "%": return null;
+        // Shift amount as the unknown is not soundly invertible.
+        case "<<": return null;
+        case ">>": return null;
+    }
+    return null;
+}
+/** Refs in `expr` whose value is not yet known in `env`. */
+function unknownRefs(expr, env) {
+    return uniqueRefs(expr).filter((r) => !env.has(r));
+}
+/**
+ * Given that `known` is the value of one side of an equality, try to use it to
+ * resolve the other (`other`) side: solve its single unknown, or detect a
+ * conflict when it is fully determined and disagrees. `knownSide` names the
+ * side `known` came from so conflict messages keep the lhs/rhs orientation,
+ * and `c` supplies the authored doc string for the message (§9.1).
+ */
+function applyKnownSide(known, other, next, knownSide, c) {
+    const unknowns = unknownRefs(other, next);
+    if (unknowns.length === 0) {
+        let otherVal;
+        try {
+            otherVal = evalConst(other, next);
+        }
+        catch (e) {
+            // Mirror validateConstraints: a `must` expression that cannot be
+            // evaluated is a hard conflict, never an uncaught exception.
+            return { conflict: withDoc(`Constraint evaluation error: ${e instanceof Error ? e.message : String(e)}`, c) };
+        }
+        if (otherVal !== null && otherVal !== known) {
+            const [l, r] = knownSide === "lhs" ? [known, otherVal] : [otherVal, known];
+            return { conflict: withDoc(`Constraint failed: lhs=${l} rhs=${r}`, c) };
+        }
+        return null;
+    }
+    if (unknowns.length === 1) {
+        // Like the probe below, an evaluation error while inverting (e.g. a
+        // constant zero-divisor subtree next to the unknown ref) just means no
+        // candidate can be derived — not a conflict, and never an uncaught
+        // exception out of the solver. This matches validateConstraints, which
+        // skips the constraint when a side cannot be evaluated.
+        let solved;
+        try {
+            solved = solveFor(other, unknowns[0], known, next);
+        }
+        catch {
+            solved = null;
+        }
+        if (solved !== null) {
+            // Inversion through lossy operators (shifts, truncating division) is not
+            // guaranteed to round-trip under the unsigned evaluator. Adopt the solved
+            // value only if re-evaluating `other` actually reproduces `known`. An
+            // evaluation error on the probe (e.g. the candidate lands as a zero
+            // divisor) just means the candidate is not adoptable — not a conflict.
+            const probe = new Map(next);
+            probe.set(unknowns[0], solved);
+            let check;
+            try {
+                check = evalConst(other, probe);
+            }
+            catch {
+                check = null;
+            }
+            if (check === known)
+                next.set(unknowns[0], solved);
+        }
+    }
+    return null;
+}
+export function propagate(constraints, env, changedKey) {
+    const next = new Map(env);
+    for (const [index, c] of constraints.entries()) {
+        // Only `must` (and level-less) constraints back-propagate (§9.1). `should`/
+        // `may` are diagnostic-only and excluded from both value derivation and the
+        // conflict detection below, so relaxing a level never changes any
+        // wire-parsed value (it can drop solver-derived values and hard-failure
+        // detection that the `must` was providing — see §9.1).
+        if (c.level !== undefined && c.level !== "must")
+            continue;
+        // A constraint with no ref node at all (literal-only, or built solely from
+        // env-backed nullaries like `remaining`) can never match the changed-key
+        // gate, yet may still be violated — always evaluate it as a pure check.
+        const refLess = uniqueRefs(c.lhs).length === 0 && uniqueRefs(c.rhs).length === 0;
+        if (!refLess && !containsRef(c.lhs, changedKey) && !containsRef(c.rhs, changedKey))
+            continue;
+        let lhsVal;
+        let rhsVal;
+        try {
+            lhsVal = evalConst(c.lhs, next);
+            rhsVal = evalConst(c.rhs, next);
+        }
+        catch (e) {
+            // Mirror validateConstraints: an evaluation error (e.g. division by zero
+            // on wire-derived values) in a `must` constraint is a hard conflict, not
+            // an uncaught exception out of the solver.
+            return { conflict: withDoc(`Constraint evaluation error: ${e instanceof Error ? e.message : String(e)}`, c), index, env: next };
+        }
+        if (lhsVal !== null && rhsVal !== null) {
+            if (lhsVal !== rhsVal)
+                return { conflict: withDoc(`Constraint failed: lhs=${lhsVal} rhs=${rhsVal}`, c), index, env: next };
+            continue;
+        }
+        if (lhsVal !== null) {
+            const conflict = applyKnownSide(lhsVal, c.rhs, next, "lhs", c);
+            if (conflict)
+                return { ...conflict, index, env: next };
+        }
+        else if (rhsVal !== null) {
+            const conflict = applyKnownSide(rhsVal, c.lhs, next, "rhs", c);
+            if (conflict)
+                return { ...conflict, index, env: next };
+        }
+    }
+    return { ok: next };
+}
+function uniqueRefs(expr) {
+    const set = new Set();
+    walkExpr(expr, (e) => {
+        if (e.kind === "ref")
+            set.add(e.field);
+    });
+    return [...set];
+}
+/**
+ * Fixpoint back-propagation (§9): re-run the constraint list until no new
+ * field is resolved in a pass. Seeds the pass set from every key in `env`
+ * UNION every ref mentioned by a `must` (or level-less) constraint, so a
+ * constraint sharing no ref with the env — e.g. the literal-only
+ * `version == 4` — still fires and can start a resolution chain (§9
+ * "re-runs the full constraint list until no new fields are resolved").
+ */
+export function propagateFixpoint(constraints, env) {
+    let current = new Map(env);
+    const seedKeys = new Set();
+    for (const c of constraints) {
+        if (c.level !== undefined && c.level !== "must")
+            continue; // §9.1
+        for (const r of uniqueRefs(c.lhs))
+            seedKeys.add(r);
+        for (const r of uniqueRefs(c.rhs))
+            seedKeys.add(r);
+    }
+    let changed = true;
+    let guard = 0;
+    const MAX_PASSES = 1000;
+    while (changed && guard++ < MAX_PASSES) {
+        changed = false;
+        const keys = new Set([...current.keys(), ...seedKeys]);
+        // Even with no keys at all (empty env, ref-less constraints only), run one
+        // pass so pure checks like `remaining == 0` still get evaluated.
+        if (keys.size === 0)
+            keys.add("");
+        for (const key of keys) {
+            const res = propagate(constraints, current, key);
+            if ("conflict" in res)
+                return res;
+            // Adopt newly resolved keys.
+            for (const [k, v] of res.ok) {
+                if (current.get(k) !== v) {
+                    current = res.ok;
+                    changed = true;
+                    break;
+                }
+            }
+        }
+    }
+    return { ok: current };
+}
+/** Append the constraint's authored doc to a message, when present. */
+function withDoc(message, c) {
+    return c.doc !== undefined ? `${message} (${c.doc})` : message;
+}
+/**
+ * Evaluate every constraint for diagnostics (§9.1). `must` (and level-less)
+ * mismatches become a hard `conflict`; `should`/`may` mismatches are collected
+ * into `diagnostics` (level-tagged) so the caller can map them to warning/info
+ * severities. `should`/`may` never produce a conflict, matching the solver's
+ * back-propagation exclusion in `propagate`. EVERY failing constraint — `must`
+ * included — also appears in `diagnostics` with its index, so an LSP can map
+ * each violation (not just the first) back to a source range; the `conflict`
+ * string is derived from the first failing `must` in declaration order.
+ * Evaluation errors (e.g. division by zero in an expression) likewise never
+ * escape as exceptions: they become a diagnostic at the constraint's level
+ * (plus the hard conflict for `must`), so a single broken advisory constraint
+ * cannot crash diagnostics generation.
+ */
+export function validateConstraints(constraints, env) {
+    const diagnostics = [];
+    let hardConflict = null;
+    for (const [index, c] of constraints.entries()) {
+        const level = c.level ?? "must";
+        const report = (message) => {
+            if (level === "must" && hardConflict === null)
+                hardConflict = withDoc(message, c);
+            diagnostics.push({ index, level, message, ...(c.doc !== undefined ? { doc: c.doc } : {}) });
+        };
+        let l;
+        let r;
+        try {
+            l = evalConst(c.lhs, env);
+            r = evalConst(c.rhs, env);
+        }
+        catch (e) {
+            report(`Constraint evaluation error: ${e instanceof Error ? e.message : String(e)}`);
+            continue;
+        }
+        if (l === null || r === null)
+            continue;
+        if (l !== r)
+            report(`Constraint failed: lhs=${l} rhs=${r}`);
+    }
+    // A hard conflict is only ever set by report(), which always pushes the
+    // matching `must` diagnostic first — so `diagnostics` is necessarily
+    // non-empty here and the conflict return carries it unconditionally.
+    if (hardConflict !== null)
+        return { conflict: hardConflict, diagnostics };
+    return diagnostics.length ? { ok: true, diagnostics } : { ok: true };
+}
+//# sourceMappingURL=constraint.js.map

package/dist/constraint.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constraint.js","sourceRoot":"","sources":["../src/constraint.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAe9E,SAAS,QAAQ,CACf,IAAU,EACV,SAAiB,EACjB,KAAa,EACb,GAAc;IAEd,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IACxE,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC,CAAC,sCAAsC;IAC3E,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAC5C,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAC5C,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAC/B,IAAI,IAAI,EAAE,CAAC;QACT,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACpC,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC/B,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAChD,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QACjC,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IAClD,CAAC;SAAM,CAAC;QACN,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACpC,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC/B,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QACjD,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QACjC,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IAClD,CAAC;AACH,CAAC;AAED,SAAS,WAAW,CAAC,IAAU,EAAE,MAAc;IAC7C,OAAO,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM,CAAC,CAAC;AAC3E,CAAC;AAED,SAAS,SAAS,CAAC,IAAU,EAAE,GAAc;IAC3C,IAAI,CAAC;QACH,OAAO,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC7B,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,IAAI,CAAC,YAAY,eAAe;YAAE,OAAO,IAAI,CAAC;QAC9C,MAAM,CAAC,CAAC;IACV,CAAC;AACH,CAAC;AAED,0EAA0E;AAC1E,4EAA4E;AAC5E,6EAA6E;AAC7E,yEAAyE;AACzE,mBAAmB;AACnB,SAAS,UAAU,CAAC,CAAS,EAAE,MAAc,EAAE,KAAa;IAC1D,QAAQ,CAAC,EAAE,CAAC;QACV,KAAK,GAAG,CAAC,CAAC,OAAO,MAAM,GAAG,KAAK,CAAC;QAChC,KAAK,GAAG,CAAC,CAAC,OAAO,MAAM,GAAG,KAAK,CAAC;QAChC,KAAK,GAAG,CAAC,CAAC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;QACjE,KAAK,GAAG,CAAC,CAAC,OAAO,MAAM,GAAG,KAAK,CAAC;QAChC,KAAK,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC;QACtB,KAAK,IAAI,CAAC,CAAC,OAAO,MAAM,KAAK,KAAK,CAAC,CAAQ,8BAA8B;QACzE,KAAK,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAI,mCAAmC;IACjF,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,2EAA2E;AAC3E,SAAS,WAAW,CAAC,CAAS,EAAE,MAAc,EAAE,KAAa;IAC3D,QAAQ,CAAC,EAAE,CAAC;QACV,KAAK,GAAG,CAAC,CAAC,OAAO,MAAM,GAAG,KAAK,CAAC;QAChC,KAAK,GAAG,CAAC,CAAC,OAAO,KAAK,GAAG,MAAM,CAAC;QAChC,KAAK,GAAG,CAAC,CAAC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;QACjE,KAAK,GAAG,CAAC,CAAC,OAAO,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC;QAClE,KAAK,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC;QACtB,yDAAyD;QACzD,KAAK,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC;QACvB,KAAK,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC;IACzB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,4DAA4D;AAC5D,SAAS,WAAW,CAAC,IAAU,EAAE,GAAc;IAC7C,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACrD,CAAC;AAED;;;;;;GAMG;AACH,SAAS,cAAc,CACrB,KAAa,EACb,KAAW,EACX,IAAe,EACf,SAAwB,EACxB,CAAa;IAEb,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC1C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,IAAI,QAAuB,CAAC;QAC5B,IAAI,CAAC;YACH,QAAQ,GAAG,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACpC,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,iEAAiE;YACjE,6DAA6D;YAC7D,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,gCAAgC,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;QAChH,CAAC;QACD,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,KAAK,EAAE,CAAC;YAC5C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC3E,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,0BAA0B,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;QAC1E,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,oEAAoE;QACpE,uEAAuE;QACvE,mEAAmE;QACnE,uEAAuE;QACvE,wDAAwD;QACxD,IAAI,MAAqB,CAAC;QAC1B,IAAI,CAAC;YACH,MAAM,GAAG,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QACtD,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,GAAG,IAAI,CAAC;QAChB,CAAC;QACD,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,yEAAyE;YACzE,0EAA0E;YAC1E,sEAAsE;YACtE,oEAAoE;YACpE,uEAAuE;YACvE,MAAM,KAAK,GAAc,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;YACvC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,MAAM,CAAC,CAAC;YAChC,IAAI,KAAoB,CAAC;YACzB,IAAI,CAAC;gBACH,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAClC,CAAC;YAAC,MAAM,CAAC;gBACP,KAAK,GAAG,IAAI,CAAC;YACf,CAAC;YACD,IAAI,KAAK,KAAK,KAAK;gBAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,MAAM,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,SAAS,CACvB,WAAyB,EACzB,GAAc,EACd,UAAkB;IAElB,MAAM,IAAI,GAAc,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IACrC,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;QAC/C,4EAA4E;QAC5E,4EAA4E;QAC5E,kEAAkE;QAClE,wEAAwE;QACxE,uDAAuD;QACvD,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM;YAAE,SAAS;QAC1D,2EAA2E;QAC3E,yEAAyE;QACzE,wEAAwE;QACxE,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC;QACjF,IAAI,CAAC,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,EAAE,UAAU,CAAC;YAAE,SAAS;QAC7F,IAAI,MAAqB,CAAC;QAC1B,IAAI,MAAqB,CAAC;QAC1B,IAAI,CAAC;YACH,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAChC,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAClC,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,yEAAyE;YACzE,yEAAyE;YACzE,2CAA2C;YAC3C,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,gCAAgC,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;QAClI,CAAC;QACD,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACvC,IAAI,MAAM,KAAK,MAAM;gBAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,0BAA0B,MAAM,QAAQ,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;YAC3H,SAAS;QACX,CAAC;QACD,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,MAAM,QAAQ,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;YAC/D,IAAI,QAAQ;gBAAE,OAAO,EAAE,GAAG,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;QACzD,CAAC;aAAM,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;YAC/D,IAAI,QAAQ;gBAAE,OAAO,EAAE,GAAG,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;QACzD,CAAC;IACH,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACtB,CAAC;AAED,SAAS,UAAU,CAAC,IAAU;IAC5B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE;QACnB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IACH,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;AAClB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAC/B,WAAyB,EACzB,GAAc;IAEd,IAAI,OAAO,GAAc,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM;YAAE,SAAS,CAAC,OAAO;QAClE,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnD,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;IACD,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,UAAU,GAAG,IAAI,CAAC;IACxB,OAAO,OAAO,IAAI,KAAK,EAAE,GAAG,UAAU,EAAE,CAAC;QACvC,OAAO,GAAG,KAAK,CAAC;QAChB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC;QACvD,2EAA2E;QAC3E,iEAAiE;QACjE,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAClC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,SAAS,CAAC,WAAW,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;YACjD,IAAI,UAAU,IAAI,GAAG;gBAAE,OAAO,GAAG,CAAC;YAClC,6BAA6B;YAC7B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE,EAAE,CAAC;gBAC5B,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;oBAAC,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC;oBAAC,OAAO,GAAG,IAAI,CAAC;oBAAC,MAAM;gBAAC,CAAC;YACxE,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC;AACzB,CAAC;AAmBD,uEAAuE;AACvE,SAAS,OAAO,CAAC,OAAe,EAAE,CAAa;IAC7C,OAAO,CAAC,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;AACjE,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,mBAAmB,CACjC,WAAyB,EACzB,GAAc;IAGd,MAAM,WAAW,GAA2B,EAAE,CAAC;IAC/C,IAAI,YAAY,GAAkB,IAAI,CAAC;IACvC,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;QAC/C,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,MAAM,CAAC;QAChC,MAAM,MAAM,GAAG,CAAC,OAAe,EAAQ,EAAE;YACvC,IAAI,KAAK,KAAK,MAAM,IAAI,YAAY,KAAK,IAAI;gBAAE,YAAY,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YAClF,WAAW,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QAC9F,CAAC,CAAC;QACF,IAAI,CAAgB,CAAC;QACrB,IAAI,CAAgB,CAAC;QACrB,IAAI,CAAC;YACH,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC1B,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC5B,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,MAAM,CAAC,gCAAgC,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACrF,SAAS;QACX,CAAC;QACD,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI;YAAE,SAAS;QACvC,IAAI,CAAC,KAAK,CAAC;YAAE,MAAM,CAAC,0BAA0B,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IAC9D,CAAC;IACD,wEAAwE;IACxE,qEAAqE;IACrE,qEAAqE;IACrE,IAAI,YAAY,KAAK,IAAI;QAAE,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,EAAE,CAAC;IAC1E,OAAO,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACvE,CAAC"}

package/dist/expr.d.ts

@@ -0,0 +1,32 @@
+import type { BinOp, Expr, ExprWireSize, PacketEnv } from "./types.js";
+export declare const lit: (value: number) => Expr;
+export declare const ref: (field: string) => Expr;
+export declare const op: (o: BinOp, a: Expr, b: Expr) => Expr;
+export declare const cond: (test: Expr, t: Expr, f: Expr) => Expr;
+export declare const peek: (bits: number, offset?: Expr) => Expr;
+export declare const lookup: (key: Expr, table: Record<number, number>) => Expr;
+export declare const wireSize: (target: string) => ExprWireSize;
+export declare const prevIter: (field: string) => Expr;
+export declare const remaining: () => Expr;
+export declare const enclosingBits: () => Expr;
+export declare const enclosingField: (field: string) => Expr;
+export declare const peekEnvKey: (offset: number, bits: number) => string;
+export declare const remainingEnvKey: () => string;
+export declare const enclosingBitsEnvKey: () => string;
+export declare const wireSizeEnvKey: (target: string) => string;
+export declare const prevIterEnvKey: (field: string) => string;
+export declare const enclosingFieldEnvKey: (field: string) => string;
+export declare class MissingRefError extends Error {
+    readonly field: string;
+    constructor(field: string);
+}
+export declare function evalExpr(expr: Expr, env: PacketEnv): number;
+/** Evaluate, returning `fallback` when a referenced field is missing (§10.3). */
+export declare function evalExprOr(expr: Expr, env: PacketEnv, fallback?: number): number;
+/** Plain field-id references (`ref`) reachable from an expression. */
+export declare function exprRefs(expr: Expr): string[];
+/** Visit every sub-expression node depth-first. */
+export declare function walkExpr(expr: Expr, visit: (e: Expr) => void): void;
+/** True if any sub-expression matches the predicate. */
+export declare function exprContains(expr: Expr, pred: (e: Expr) => boolean): boolean;
+//# sourceMappingURL=expr.d.ts.map

package/dist/expr.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expr.d.ts","sourceRoot":"","sources":["../src/expr.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAMvE,eAAO,MAAM,GAAG,GAAI,OAAO,MAAM,KAAG,IAAgC,CAAC;AACrE,eAAO,MAAM,GAAG,GAAI,OAAO,MAAM,KAAG,IAAgC,CAAC;AACrE,eAAO,MAAM,EAAE,GAAI,GAAG,KAAK,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,KAAG,IAAqC,CAAC;AACtF,eAAO,MAAM,IAAI,GAAI,MAAM,IAAI,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,KAAG,IAAsC,CAAC;AAC3F,eAAO,MAAM,IAAI,GAAI,MAAM,MAAM,EAAE,SAAS,IAAI,KAAG,IAC6B,CAAC;AACjF,eAAO,MAAM,MAAM,GAAI,KAAK,IAAI,EAAE,OAAO,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,KAAG,IAAwC,CAAC;AAC3G,eAAO,MAAM,QAAQ,GAAI,QAAQ,MAAM,KAAG,YAA8C,CAAC;AACzF,eAAO,MAAM,QAAQ,GAAI,OAAO,MAAM,KAAG,IAAqC,CAAC;AAC/E,eAAO,MAAM,SAAS,QAAO,IAA+B,CAAC;AAC7D,eAAO,MAAM,aAAa,QAAO,IAAmC,CAAC;AACrE,eAAO,MAAM,cAAc,GAAI,OAAO,MAAM,KAAG,IAA2C,CAAC;AAO3F,eAAO,MAAM,UAAU,GAAI,QAAQ,MAAM,EAAE,MAAM,MAAM,KAAG,MAAsC,CAAC;AACjG,eAAO,MAAM,eAAe,QAAO,MAAyB,CAAC;AAC7D,eAAO,MAAM,mBAAmB,QAAO,MAA6B,CAAC;AACrE,eAAO,MAAM,cAAc,GAAI,QAAQ,MAAM,KAAG,MAAiC,CAAC;AAClF,eAAO,MAAM,cAAc,GAAI,OAAO,MAAM,KAAG,MAAgC,CAAC;AAChF,eAAO,MAAM,oBAAoB,GAAI,OAAO,MAAM,KAAG,MAAiC,CAAC;AAEvF,qBAAa,eAAgB,SAAQ,KAAK;aACZ,KAAK,EAAE,MAAM;gBAAb,KAAK,EAAE,MAAM;CAI1C;AAMD,wBAAgB,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,SAAS,GAAG,MAAM,CAsF3D;AAED,iFAAiF;AACjF,wBAAgB,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,SAAS,EAAE,QAAQ,SAAI,GAAG,MAAM,CAO3E;AAMD,sEAAsE;AACtE,wBAAgB,QAAQ,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,EAAE,CAM7C;AAED,mDAAmD;AACnD,wBAAgB,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI,CAiCnE;AAED,wDAAwD;AACxD,wBAAgB,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,OAAO,GAAG,OAAO,CAM5E"}