@bjornpagen/bumbledb 0.1.0 → 0.3.0

package/dist/closed.js

@@ -1,47 +1,197 @@
 /**
  * Closed relations (`docs/architecture/10-data-model.md` § closed
  * relations): a vocabulary whose extension is declared in the schema — two
- * tiers, one function. The emission per closed relation mirrors the macro's
- * (host-enum analog): handle CONSTANTS on the value (`Kind.Checking`, ids =
- * declaration order), the `fromId` weld, an `id` field constructor
- * pre-branded with the handle newtype for other relations' field blocks
- * (`kind: Kind.id`), and payload readback (`Kind.axioms`). No fact type and
- * no insert surface exist — closed relations are unwritable by
- * construction: the value simply lacks the writable relation shape.
+ * tiers, one function. The emission per closed relation mirrors the
+ * macro's (host-enum analog): handle CONSTANTS on the value
+ * (`Kind.Checking`, ids = declaration order, each a BARE `bigint` — no
+ * brand), the `fromId` weld, an `id` field descriptor carrying the CLOSED
+ * LINKAGE (the roster — pure structure, no declared domain: the laws type
+ * the columns, and `schema()` names the id's generator class `"Kind.id"`)
+ * for other relations' field blocks (`kind: Kind.id`), payload readback
+ * (`Kind.axioms`), and the declared payload column descriptors
+ * (`Kind.columns` — the runtime twin of the `Cols` type parameter, which
+ * the face layer's structural wall reads). Bare tier: `closed("Kind", ["Checking",
+ * "Savings"])`. Payload tier: `closed("Sev", { pages: bool }, { Critical:
+ * { pages: true }, ... })` — one call, three arguments (the curried tier-2
+ * spelling is DELETED — canonical utterance): the axioms record IS the
+ * handle declaration, every handle carrying every column exactly once
+ * (type-enforced). No fact type and no insert surface exist — closed
+ * relations are unwritable by construction: the value simply lacks the
+ * writable relation shape. Both tiers mint `match()` — exhaustive dispatch
+ * over the handle union (arms typed by the mapped type, so a missing or
+ * extra arm is a compile error; the payload tier's arm receives the typed
+ * axiom row). The payload tier additionally mints `where()` — the
+ * ψ-selection surface (`Kind.where({ mastered: true })` as a face source),
+ * resolved through the ONE selection machine
+ * (`relation.ts::resolveSelection`); the bare tier has no payload columns to
+ * select on, so `.where` is absent there, at the type AND on the value.
  */
 import * as errors from "@superbuilders/errors";
-import { assertDeclarationOrderKey, fieldData, literalOf } from "#fields.ts";
+import { assertDeclarationOrderKey, literalOf } from "#fields.ts";
+import { resolveSelection } from "#relation.ts";
 /**
  * The value-surface property names a handle may not shadow — the macro's
  * name-collision diagnostic, here over the closed value's own properties
  * (`relation`/`selection` are reserved so a closed value can never be
- * mistaken for a selected relation by `on()`'s discriminant).
+ * mistaken for a selected relation by `on()`'s discriminant; `where` is
+ * reserved because the payload tier mints the ψ-selection method under
+ * exactly that name; `match` because BOTH tiers mint the exhaustive
+ * dispatch under exactly that name).
  */
 const reservedHandleNames = Object.freeze([
     "name",
     "id",
     "data",
     "axioms",
+    "columns",
     "fromId",
+    "where",
+    "match",
     "relation",
     "selection"
 ]);
+/** Narrows the two-tier second argument: a handle tuple (bare tier) or a column block (payload tier). */
+function isHandleTuple(shape) {
+    return Array.isArray(shape);
+}
+/**
+ * The trusted seam of the payload tier's handle enumeration: the axioms
+ * record's own enumerable keys ARE its handle set (the type says so —
+ * {@link Axioms} is keyed by the handles), and this guard verifies exactly
+ * that checkable fact before the key list is admitted at the handle type.
+ */
+function handleKeysOwn(axioms, names) {
+    return names.every(function ownHandle(name) {
+        return Object.hasOwn(axioms, name);
+    });
+}
+/**
+ * The trusted seam of the axiom-readback mint: every handle carries an own
+ * frozen row and every row carries every declared column as an own
+ * property — verified before the record is admitted as the typed
+ * {@link Axioms} (the `refsComplete` analog of `relation()`).
+ */
+function axiomsMinted(record, handles, cols) {
+    return handles.every(function rowMinted(handle) {
+        const row = record[handle];
+        return (row !== undefined &&
+            cols.every(function columnMinted(column) {
+                return Object.hasOwn(row, column.name);
+            }));
+    });
+}
 /**
- * Reads one handle's axiom row, refusing absence loudly: the payload tier's
- * overload types the record exhaustively, so a missing row is ill-typed
- * input, and the bare tier never reaches here (it declares no columns).
+ * The trusted seam of the handle-constant mint: every handle reads back as
+ * an own bigint — verified before the record is admitted at the constants
+ * type (a "__proto__"-named handle riding the object-protocol accessor
+ * would fail exactly this check).
  */
-function axiomRow(name, axioms, handle) {
+function constantsMinted(record, handles) {
+    return handles.every(function constantMinted(handle) {
+        return typeof record[handle] === "bigint";
+    });
+}
+/**
+ * Reads one handle's ground axiom row for lowering. The typed payload
+ * surface makes absence unrepresentable ({@link Axioms} carries every
+ * handle's row); the refusal below guards the one ill-typed path — payload
+ * columns with the bare tier's absent axioms — which no public spelling
+ * reaches.
+ */
+function groundRow(name, axioms, handle) {
     if (axioms === undefined) {
         throw errors.new(`closed relation ${name}: payload columns declared without ground axioms`);
     }
-    const row = axioms[handle];
-    if (row === undefined) {
-        throw errors.new(`closed relation ${name}: no ground axiom for handle ${handle}`);
+    return axioms[handle];
+}
+/**
+ * Mints the axiom-readback record: one own frozen row per handle (the bare
+ * tier's rows are empty — it declares no columns), each row a fresh copy of
+ * its ground axiom.
+ */
+function mintAxioms(name, handles, cols, axioms) {
+    const out = {};
+    for (const handle of handles) {
+        const row = axioms === undefined ? Object.freeze({}) : Object.freeze({ ...groundRow(name, axioms, handle) });
+        Object.defineProperty(out, handle, { value: row, enumerable: true });
+    }
+    Object.freeze(out);
+    if (!axiomsMinted(out, handles, cols)) {
+        throw errors.new(`closed relation ${name}: axiom-row minting incomplete`);
+    }
+    return out;
+}
+/** Mints the handle constants: one own bigint per handle, ids = declaration order. */
+function mintHandleConstants(name, handles) {
+    const out = {};
+    handles.forEach(function mintHandleConstant(handle, index) {
+        Object.defineProperty(out, handle, { value: BigInt(index), enumerable: true });
+    });
+    Object.freeze(out);
+    if (!constantsMinted(out, handles)) {
+        throw errors.new(`closed relation ${name}: handle-constant minting incomplete`);
+    }
+    return out;
+}
+function closed(name, shape, axioms) {
+    if (isHandleTuple(shape)) {
+        if (axioms !== undefined) {
+            throw errors.new(`closed relation ${name}: the bare tier declares no columns, so ground axioms are inadmissible`);
+        }
+        return closedBare(name, shape);
     }
-    return row;
+    if (axioms === undefined) {
+        throw errors.new(`closed relation ${name}: payload columns declared without ground axioms — the payload tier is spelled closed(name, columns, axioms) (the curried spelling is deleted)`);
+    }
+    return closedPayload(name, shape, axioms);
+}
+/** The bare tier's precisely-typed builder: no columns, no axioms. */
+function closedBare(name, handles) {
+    return mintClosed(name, handles, {}, undefined);
 }
-function closed(name, handles, columns, axioms) {
+/**
+ * The payload tier's precisely-typed builder: column names are judged
+ * first (the macro-expansion analog), then the handle set is read off the
+ * axioms record's own keys.
+ */
+function closedPayload(name, columns, axioms) {
+    for (const columnName of Object.keys(columns)) {
+        assertDeclarationOrderKey(`closed relation ${name} column`, columnName);
+    }
+    const handles = Object.keys(axioms);
+    for (const handle of handles) {
+        assertDeclarationOrderKey(`closed relation ${name} handle`, handle);
+    }
+    if (!handleKeysOwn(axioms, handles)) {
+        throw errors.new(`closed relation ${name}: handle enumeration incomplete`);
+    }
+    return mintClosed(name, handles, columns, axioms);
+}
+/**
+ * The trusted seam of the ergonomic-surface mint: `match` reads back as an
+ * own function on BOTH tiers, and `where` exactly when payload columns
+ * exist — the runtime twin of the {@link Closed} type's conditional arm
+ * (`ClosedMatchBare` vs `ClosedSelectable & ClosedMatchPayload`), verified
+ * before the minted value is admitted at the conditional type.
+ */
+function surfaceMinted(value, cols) {
+    const matchable = "match" in value && typeof value.match === "function";
+    const selectable = "where" in value && typeof value.where === "function";
+    return matchable && (cols.length > 0 ? selectable : !selectable);
+}
+/**
+ * Mints one closed relation value — the shared seam of both tiers, HONESTLY
+ * typed end to end (a wrong-shaped mint is a compile error here, not a
+ * laundered `unknown`): roster checks, eager axiom lowering, the
+ * roster-carrying `id` descriptor, the frozen `columns` carrier (the runtime
+ * twin of the `Cols` type parameter), the handle constants, the exhaustive
+ * `match()` on both tiers, and — on the payload tier only — the
+ * ψ-selection `where()`.
+ */
+function mintClosed(name, handles, columns, axioms) {
+    if (handles.length === 0) {
+        throw errors.new(`closed relation ${name}: at least one handle is required (an empty vocabulary declares nothing)`);
+    }
     const seen = new Set();
     for (const handle of handles) {
         if (seen.has(handle)) {
@@ -52,17 +202,20 @@ function closed(name, handles, columns, axioms) {
             throw errors.new(`closed relation ${name}: handle ${handle} collides with the closed value's own surface (${reservedHandleNames.join(", ")})`);
         }
     }
-    const roster = Object.freeze({ name, handles: Object.freeze([...handles]) });
+    const handleList = Object.freeze([...handles]);
+    const roster = Object.freeze({ name, handles: handleList });
     const cols = [];
-    if (columns !== undefined) {
-        for (const [columnName, field] of Object.entries(columns)) {
-            assertDeclarationOrderKey(`closed relation ${name} column`, columnName);
-            cols.push(Object.freeze({ name: columnName, field: field.data }));
+    for (const [columnName, field] of Object.entries(columns)) {
+        assertDeclarationOrderKey(`closed relation ${name} column`, columnName);
+        if (columnName === "id") {
+            throw errors.new(`closed relation ${name}: the payload column id collides with the sealed shape's synthetic id (the relation mints its own id at ordinal 0; name the column something else)`);
         }
+        cols.push(Object.freeze({ name: columnName, field }));
     }
-    const rows = handles.map(function lowerRow(handle) {
+    Object.freeze(cols);
+    const rows = handleList.map(function lowerRow(handle) {
         const values = cols.map(function lowerAxiomLiteral(column) {
-            const row = axiomRow(name, axioms, handle);
+            const row = groundRow(name, axioms, handle);
             return Object.freeze(literalOf(column.field, row[column.name]));
         });
         return Object.freeze({ handle, values: Object.freeze(values) });
@@ -70,38 +223,70 @@ function closed(name, handles, columns, axioms) {
     const data = Object.freeze({
         name,
         handles: roster.handles,
-        columns: Object.freeze(cols),
+        columns: cols,
         rows: Object.freeze(rows)
     });
-    const id = Object.freeze({
-        data: fieldData({ kind: "u64" }, name, false, roster)
-    });
+    const id = Object.freeze({ kind: "u64", closed: roster });
     /**
      * Handle names are arbitrary identifiers, so rows and constants are
-     * minted with OWN-property definition, never assignment: a handle named
+     * minted with OWN-property definition (inside {@link mintAxioms} and
+     * {@link mintHandleConstants}), never assignment: a handle named
      * "__proto__" would otherwise ride the Object.prototype accessor —
      * silently swapping the record's prototype instead of creating the row,
      * and no-oping the constant (a primitive through the setter) — minting a
-     * value whose type claims Brand<bigint, Name> but reads back an object.
+     * value whose type claims a bigint constant but reads back an object.
+     * (Object SPREAD is CreateDataProperty by spec, so the copies below are
+     * own-property safe for column names too.)
      */
-    const axiomsOut = {};
-    for (const handle of handles) {
-        const row = axioms === undefined ? Object.freeze({}) : Object.freeze({ ...axiomRow(name, axioms, handle) });
-        Object.defineProperty(axiomsOut, handle, { value: row, enumerable: true });
+    const axiomsOut = mintAxioms(name, handleList, cols, axioms);
+    const constants = mintHandleConstants(name, handleList);
+    const columnsOut = { ...columns };
+    Object.freeze(columnsOut);
+    function fromId(idValue) {
+        return handleList[Number(idValue)];
     }
-    const value = {
-        name,
-        id,
-        data,
-        axioms: Object.freeze(axiomsOut),
-        fromId(idValue) {
-            return roster.handles[Number(idValue)];
+    const holder = { value: undefined };
+    /**
+     * The ψ selection: resolved against the declared payload columns through
+     * the ONE selection machine (`relation.ts::resolveSelection` — a
+     * `ClosedColumn` is structurally a `RelationField`), never pre-folded
+     * into an id set (the engine folds at validate).
+     */
+    function where(selection) {
+        const owner = holder.value;
+        if (owner === undefined) {
+            throw errors.new(`closed relation ${name}: self-reference read before construction completed`);
         }
-    };
-    handles.forEach(function mintHandleConstant(handle, index) {
-        Object.defineProperty(value, handle, { value: BigInt(index), enumerable: true });
-    });
-    return Object.freeze(value);
+        return Object.freeze({
+            relation: owner,
+            selection: resolveSelection(name, cols, Object.entries(selection))
+        });
+    }
+    /**
+     * The exhaustive dispatch: the ROSTER judges the id (the structural type
+     * admits any bigint — a dishonest id is a THROW, never a misdispatch),
+     * and the chosen arm receives the handle's frozen axiom row (the bare
+     * tier's arms are typed to take nothing; the empty row rides along
+     * unread). One implementation serves both tiers — the conditional
+     * {@link Closed} arm claims the tier-exact arm signature and
+     * {@link surfaceMinted} is the trusted seam that admits it.
+     */
+    function match(idValue, arms) {
+        const handle = fromId(idValue);
+        if (handle === undefined) {
+            throw errors.new(`closed relation ${name}: match on id ${idValue} misses the roster (${handleList.join(", ")})`);
+        }
+        return arms[handle](axiomsOut[handle]);
+    }
+    const core = { name, id, data, axioms: axiomsOut, columns: columnsOut, fromId };
+    const value = cols.length > 0
+        ? Object.freeze({ ...constants, ...core, where, match })
+        : Object.freeze({ ...constants, ...core, match });
+    if (!surfaceMinted(value, cols)) {
+        throw errors.new(`closed relation ${name}: ergonomic-surface minting incomplete`);
+    }
+    holder.value = value;
+    return value;
 }
 export { closed };
 //# sourceMappingURL=closed.js.map

package/dist/closed.js.map

@@ -1 +1 @@
-{"version":3,"file":"closed.js","sourceRoot":"","sources":["../src/closed.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,MAAM,MAAM,uBAAuB,CAAA;AAE/C,OAAO,EAEN,yBAAyB,EAKzB,SAAS,EACT,SAAS,EACT,MAAM,YAAY,CAAA;AAGnB;;;;;GAKG;AACH,MAAM,mBAAmB,GAAsB,MAAM,CAAC,MAAM,CAAC;IAC5D,MAAM;IACN,IAAI;IACJ,MAAM;IACN,QAAQ;IACR,QAAQ;IACR,UAAU;IACV,WAAW;CACX,CAAC,CAAA;AAEF;;;;GAIG;AACH,SAAS,QAAQ,CAChB,IAAY,EACZ,MAA+E,EAC/E,MAAc;IAEd,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QAC1B,MAAM,MAAM,CAAC,GAAG,CAAC,mBAAmB,IAAI,kDAAkD,CAAC,CAAA;IAC5F,CAAC;IACD,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;IAC1B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACvB,MAAM,MAAM,CAAC,GAAG,CAAC,mBAAmB,IAAI,gCAAgC,MAAM,EAAE,CAAC,CAAA;IAClF,CAAC;IACD,OAAO,GAAG,CAAA;AACX,CAAC;AAgGD,SAAS,MAAM,CACd,IAAY,EACZ,OAAuC,EACvC,OAAsC,EACtC,MAAoE;IAEpE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACtB,MAAM,MAAM,CAAC,GAAG,CAAC,mBAAmB,IAAI,sBAAsB,MAAM,EAAE,CAAC,CAAA;QACxE,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAChB,IAAI,mBAAmB,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1C,MAAM,MAAM,CAAC,GAAG,CACf,mBAAmB,IAAI,YAAY,MAAM,kDAAkD,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAC5H,CAAA;QACF,CAAC;IACF,CAAC;IACD,MAAM,MAAM,GAAiB,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAAA;IAC1F,MAAM,IAAI,GAAmB,EAAE,CAAA;IAC/B,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3D,yBAAyB,CAAC,mBAAmB,IAAI,SAAS,EAAE,UAAU,CAAC,CAAA;YACvE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;QAClE,CAAC;IACF,CAAC;IACD,MAAM,IAAI,GAAgB,OAAO,CAAC,GAAG,CAAC,SAAS,QAAQ,CAAC,MAAM;QAC7D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,iBAAiB,CAAC,MAAM;YACxD,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;YAC1C,OAAO,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAChE,CAAC,CAAC,CAAA;QACF,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;IAChE,CAAC,CAAC,CAAA;IACF,MAAM,IAAI,GAAe,MAAM,CAAC,MAAM,CAAC;QACtC,IAAI;QACJ,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;QAC5B,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;KACzB,CAAC,CAAA;IACF,MAAM,EAAE,GAA0B,MAAM,CAAC,MAAM,CAAC;QAC/C,IAAI,EAAE,SAAS,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC;KACrD,CAAC,CAAA;IACF;;;;;;;OAOG;IACH,MAAM,SAAS,GAA2B,EAAE,CAAA;IAC5C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,CAAA;QAC3G,MAAM,CAAC,cAAc,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAA;IAC3E,CAAC;IACD,MAAM,KAAK,GAA4B;QACtC,IAAI;QACJ,EAAE;QACF,IAAI;QACJ,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC;QAChC,MAAM,CAAC,OAAe;YACrB,OAAO,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAA;QACvC,CAAC;KACD,CAAA;IACD,OAAO,CAAC,OAAO,CAAC,SAAS,kBAAkB,CAAC,MAAM,EAAE,KAAK;QACxD,MAAM,CAAC,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAA;IACjF,CAAC,CAAC,CAAA;IACF,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;AAC5B,CAAC;AAGD,OAAO,EAAE,MAAM,EAAE,CAAA"}
+{"version":3,"file":"closed.js","sourceRoot":"","sources":["../src/closed.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAEH,OAAO,KAAK,MAAM,MAAM,uBAAuB,CAAA;AAE/C,OAAO,EAEN,yBAAyB,EAIzB,SAAS,EACT,MAAM,YAAY,CAAA;AACnB,OAAO,EAAE,gBAAgB,EAAyB,MAAM,cAAc,CAAA;AAGtE;;;;;;;;GAQG;AACH,MAAM,mBAAmB,GAAsB,MAAM,CAAC,MAAM,CAAC;IAC5D,MAAM;IACN,IAAI;IACJ,MAAM;IACN,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,OAAO;IACP,OAAO;IACP,UAAU;IACV,WAAW;CACX,CAAC,CAAA;AAkLF,yGAAyG;AACzG,SAAS,aAAa,CACrB,KAAoE;IAEpE,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;AAC5B,CAAC;AAED;;;;;GAKG;AACH,SAAS,aAAa,CACrB,MAA2C,EAC3C,KAAwB;IAExB,OAAO,KAAK,CAAC,KAAK,CAAC,SAAS,SAAS,CAAC,IAAI;QACzC,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;IACnC,CAAC,CAAC,CAAA;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAS,YAAY,CACpB,MAAwC,EACxC,OAA2B,EAC3B,IAA6B;IAE7B,OAAO,OAAO,CAAC,KAAK,CAAC,SAAS,SAAS,CAAC,MAAM;QAC7C,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;QAC1B,OAAO,CACN,GAAG,KAAK,SAAS;YACjB,IAAI,CAAC,KAAK,CAAC,SAAS,YAAY,CAAC,MAAM;gBACtC,OAAO,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAA;YACvC,CAAC,CAAC,CACF,CAAA;IACF,CAAC,CAAC,CAAA;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAS,eAAe,CACvB,MAAwC,EACxC,OAA2B;IAE3B,OAAO,OAAO,CAAC,KAAK,CAAC,SAAS,cAAc,CAAC,MAAM;QAClD,OAAO,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAA;IAC1C,CAAC,CAAC,CAAA;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAS,SAAS,CACjB,IAAY,EACZ,MAAyC,EACzC,MAAe;IAEf,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QAC1B,MAAM,MAAM,CAAC,GAAG,CAAC,mBAAmB,IAAI,kDAAkD,CAAC,CAAA;IAC5F,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC,CAAA;AACtB,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CAClB,IAAY,EACZ,OAA2B,EAC3B,IAA6B,EAC7B,MAAyC;IAEzC,MAAM,GAAG,GAA2B,EAAE,CAAA;IACtC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,CAAA;QAC5G,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAA;IACrE,CAAC;IACD,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;IAClB,IAAI,CAAC,YAAY,CAAgB,GAAG,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC;QACtD,MAAM,MAAM,CAAC,GAAG,CAAC,mBAAmB,IAAI,gCAAgC,CAAC,CAAA;IAC1E,CAAC;IACD,OAAO,GAAG,CAAA;AACX,CAAC;AAED,sFAAsF;AACtF,SAAS,mBAAmB,CAC3B,IAAY,EACZ,OAA2B;IAE3B,MAAM,GAAG,GAA2B,EAAE,CAAA;IACtC,OAAO,CAAC,OAAO,CAAC,SAAS,kBAAkB,CAAC,MAAM,EAAE,KAAK;QACxD,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAA;IAC/E,CAAC,CAAC,CAAA;IACF,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;IAClB,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC;QACpC,MAAM,MAAM,CAAC,GAAG,CAAC,mBAAmB,IAAI,sCAAsC,CAAC,CAAA;IAChF,CAAC;IACD,OAAO,GAAG,CAAA;AACX,CAAC;AA0BD,SAAS,MAAM,CACd,IAAU,EACV,KAA4C,EAC5C,MAA8B;IAE9B,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,MAAM,CAAC,GAAG,CAAC,mBAAmB,IAAI,wEAAwE,CAAC,CAAA;QAClH,CAAC;QACD,OAAO,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IAC/B,CAAC;IACD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QAC1B,MAAM,MAAM,CAAC,GAAG,CACf,mBAAmB,IAAI,gJAAgJ,CACvK,CAAA;IACF,CAAC;IACD,OAAO,aAAa,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAA;AAC1C,CAAC;AAED,sEAAsE;AACtE,SAAS,UAAU,CAClB,IAAU,EACV,OAAyC;IAEzC,OAAO,UAAU,CAAsC,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,CAAC,CAAA;AACrF,CAAC;AAED;;;;GAIG;AACH,SAAS,aAAa,CACrB,IAAU,EACV,OAAa,EACb,MAA6B;IAE7B,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QAC/C,yBAAyB,CAAC,mBAAmB,IAAI,SAAS,EAAE,UAAU,CAAC,CAAA;IACxE,CAAC;IACD,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACnC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC9B,yBAAyB,CAAC,mBAAmB,IAAI,SAAS,EAAE,MAAM,CAAC,CAAA;IACpE,CAAC;IACD,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;QACrC,MAAM,MAAM,CAAC,GAAG,CAAC,mBAAmB,IAAI,iCAAiC,CAAC,CAAA;IAC3E,CAAC;IACD,OAAO,UAAU,CAAsB,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,CAAA;AACvE,CAAC;AAED;;;;;;GAMG;AACH,SAAS,aAAa,CACrB,KAA4E,EAC5E,IAA6B;IAE7B,MAAM,SAAS,GAAG,OAAO,IAAI,KAAK,IAAI,OAAO,KAAK,CAAC,KAAK,KAAK,UAAU,CAAA;IACvE,MAAM,UAAU,GAAG,OAAO,IAAI,KAAK,IAAI,OAAO,KAAK,CAAC,KAAK,KAAK,UAAU,CAAA;IACxE,OAAO,SAAS,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAA;AACjE,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,UAAU,CAClB,IAAU,EACV,OAA2B,EAC3B,OAAa,EACb,MAAyC;IAEzC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,MAAM,CAAC,GAAG,CAAC,mBAAmB,IAAI,0EAA0E,CAAC,CAAA;IACpH,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACtB,MAAM,MAAM,CAAC,GAAG,CAAC,mBAAmB,IAAI,sBAAsB,MAAM,EAAE,CAAC,CAAA;QACxE,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAChB,IAAI,mBAAmB,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1C,MAAM,MAAM,CAAC,GAAG,CACf,mBAAmB,IAAI,YAAY,MAAM,kDAAkD,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAC5H,CAAA;QACF,CAAC;IACF,CAAC;IACD,MAAM,UAAU,GAAuB,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAA;IAClE,MAAM,MAAM,GAAiB,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,CAAA;IACzE,MAAM,IAAI,GAAmB,EAAE,CAAA;IAC/B,KAAK,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3D,yBAAyB,CAAC,mBAAmB,IAAI,SAAS,EAAE,UAAU,CAAC,CAAA;QACvE,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;YACzB,MAAM,MAAM,CAAC,GAAG,CACf,mBAAmB,IAAI,oJAAoJ,CAC3K,CAAA;QACF,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC,CAAA;IACtD,CAAC;IACD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IACnB,MAAM,IAAI,GAAgB,UAAU,CAAC,GAAG,CAAC,SAAS,QAAQ,CAAC,MAAM;QAChE,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,iBAAiB,CAAC,MAAM;YACxD,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;YAC3C,OAAO,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAChE,CAAC,CAAC,CAAA;QACF,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;IAChE,CAAC,CAAC,CAAA;IACF,MAAM,IAAI,GAAe,MAAM,CAAC,MAAM,CAAC;QACtC,IAAI;QACJ,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,OAAO,EAAE,IAAI;QACb,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;KACzB,CAAC,CAAA;IACF,MAAM,EAAE,GAAkB,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;IACxE;;;;;;;;;;OAUG;IACH,MAAM,SAAS,GAAG,UAAU,CAAgB,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,CAAC,CAAA;IAC3E,MAAM,SAAS,GAAG,mBAAmB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;IACvD,MAAM,UAAU,GAAS,EAAE,GAAG,OAAO,EAAE,CAAA;IACvC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAA;IACzB,SAAS,MAAM,CAAC,OAAe;QAC9B,OAAO,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAA;IACnC,CAAC;IACD,MAAM,MAAM,GAAuD,EAAE,KAAK,EAAE,SAAS,EAAE,CAAA;IACvF;;;;;OAKG;IACH,SAAS,KAAK,CAAC,SAAqC;QACnD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAA;QAC1B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,MAAM,CAAC,GAAG,CAAC,mBAAmB,IAAI,qDAAqD,CAAC,CAAA;QAC/F,CAAC;QACD,OAAO,MAAM,CAAC,MAAM,CAAC;YACpB,QAAQ,EAAE,KAAK;YACf,SAAS,EAAE,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;SAClE,CAAC,CAAA;IACH,CAAC;IACD;;;;;;;;OAQG;IACH,SAAS,KAAK,CAAI,OAAe,EAAE,IAA6D;QAC/F,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAAA;QAC9B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,MAAM,CAAC,GAAG,CAAC,mBAAmB,IAAI,iBAAiB,OAAO,uBAAuB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACjH,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAA;IACvC,CAAC;IACD,MAAM,IAAI,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,CAAA;IAC/E,MAAM,KAAK,GACV,IAAI,CAAC,MAAM,GAAG,CAAC;QACd,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,SAAS,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QACxD,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,SAAS,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,CAAC,CAAA;IACnD,IAAI,CAAC,aAAa,CAAsB,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;QACtD,MAAM,MAAM,CAAC,GAAG,CAAC,mBAAmB,IAAI,wCAAwC,CAAC,CAAA;IAClF,CAAC;IACD,MAAM,CAAC,KAAK,GAAG,KAAK,CAAA;IACpB,OAAO,KAAK,CAAA;AACb,CAAC;AAgBD,OAAO,EAAE,MAAM,EAAE,CAAA"}

package/dist/count.d.ts

@@ -1,10 +1,22 @@
 /**
  * Cardinality-window counts — exactly five constructors, and nothing else
- * (`docs/architecture/70-api.md` § the canonical-utterance law). The ban
- * table is enforced REPRESENTATIONALLY, stronger than Rust's expansion
- * errors: `{1..*}`, `{n..n}`, `{0..0}`, `{0..*}`, and inverted windows have
- * NO constructor — the spellings that could produce them are construction
- * errors naming the canonical form, and no other spelling exists at all.
+ * (`docs/architecture/70-api.md` § the canonical-utterance law). The five
+ * constructors PARTITION the legal windows, and the ban table is enforced
+ * REPRESENTATIONALLY, stronger than Rust's expansion errors, in two tiers:
+ *
+ * - **The type tier**: a banned spelling written as a LITERAL does not
+ *   compile — `exactly(0n)`, `between(n, n)`, `between(0n, hi)`,
+ *   `atLeast(0n)`, `atLeast(1n)`, `atMost(0n)`, and every negative bound
+ *   are type errors naming the canonical form (`{n..n}`, `{0..0}`,
+ *   `{0..hi}`-via-between, `{0..*}`, `{1..*}` have NO argument shape that
+ *   produces them), and no sixth constructor exists at all.
+ * - **The construction tier**: a bound the type level cannot judge — a
+ *   COMPUTED `bigint`, whose literal identity is erased, or an inverted
+ *   `between(lo, hi)` order, which type-level bigints cannot compare — is
+ *   judged here at construction with the same canonical-naming errors; and
+ *   past both tiers the engine's own spec validation remains the law for a
+ *   hostile FFI caller (the standing two-tier ban enforcement).
+ *
  * Bounds are `bigint` (u64 crosses as bigint always, PRD-04's law).
  */
 import type { WindowSpec } from "#spec.ts";
@@ -26,30 +38,65 @@ interface Count {
     readonly window: WindowSpec;
     readonly [admitted]: true;
 }
+/**
+ * The legible banned-spelling verdict: intersected into a count
+ * constructor's parameter when the LITERAL argument spells a banned window,
+ * naming the canonical form — the compile-time face of the ban table.
+ */
+interface BannedWindow<Canonical extends string> {
+    readonly "banned window spelling — the canonical-utterance law names the one legal form": Canonical;
+}
+/** `true` exactly when the literal bigint `N` is negative (out of the u64 count domain). */
+type IsNegative<N extends bigint> = `${N}` extends `-${string}` ? true : false;
+/** The ban verdict on `exactly(n)`: negatives are out of domain; `{0}` is the exclusion, written `none`. */
+type ExactlyBan<N extends bigint> = bigint extends N ? unknown : IsNegative<N> extends true ? BannedWindow<"window counts are u64 — a negative count is out of domain"> : N extends 0n ? BannedWindow<"`{0}` is the exclusion — write none"> : unknown;
+/** The ban verdict on `atLeast(lo)`: `{0..*}` is vacuous; `{1..*}` is the bare containment respelled. */
+type AtLeastBan<N extends bigint> = bigint extends N ? unknown : IsNegative<N> extends true ? BannedWindow<"window counts are u64 — a negative count is out of domain"> : N extends 0n ? BannedWindow<"`{0..*}` is vacuous — it provably says nothing; delete the statement"> : N extends 1n ? BannedWindow<"`{1..*}` says only what the bare containment says — write contained(source, target)"> : unknown;
+/** The ban verdict on `atMost(hi)`: `{0..0}` is the exclusion, written `none`. */
+type AtMostBan<N extends bigint> = bigint extends N ? unknown : IsNegative<N> extends true ? BannedWindow<"window counts are u64 — a negative count is out of domain"> : N extends 0n ? BannedWindow<"`{0..0}` — the exclusion is written `{0}`: use none"> : unknown;
+/** The ban verdict on a `between` floor of zero: `{0..hi}` is the ceiling respelled (`atMost(hi)`). */
+type BetweenFloorBan<Lo extends bigint> = Lo extends 0n ? BannedWindow<"`{0..hi}` — a ceiling is written atMost(hi)"> : unknown;
+/**
+ * The ban verdict on `between(lo, hi)`, judged on the second bound once
+ * both literals are known: `{n..n}` is the exact count respelled
+ * (`exactly(n)`, or `none` at 0), and `{0..hi}` is the ceiling respelled
+ * (`atMost(hi)` — the five constructors PARTITION the legal windows, so
+ * the one ceiling window keeps its one spelling). Bound ORDER (`{hi..lo}`
+ * inverted) is not type-expressible — bigint literals have no type-level
+ * comparison — so inversion stays a construction error below.
+ */
+type BetweenBan<Lo extends bigint, Hi extends bigint> = bigint extends Lo ? unknown : bigint extends Hi ? unknown : IsNegative<Lo> extends true ? BannedWindow<"window counts are u64 — a negative bound is out of domain"> : IsNegative<Hi> extends true ? BannedWindow<"window counts are u64 — a negative bound is out of domain"> : Lo extends Hi ? Hi extends Lo ? Lo extends 0n ? BannedWindow<"`{0..0}` — the exclusion is written `{0}`: use none"> : BannedWindow<"`{n..n}` — an exact count is written `{n}`: use exactly(n)"> : BetweenFloorBan<Lo> : BetweenFloorBan<Lo>;
 /**
  * `{n}` — THE exact-count spelling, n ≥ 1. `exactly(0)` is the exclusion
- * respelled and rejected naming `none`.
+ * respelled: unwritable as a literal ({@link ExactlyBan} names `none`),
+ * rejected at construction when computed.
  */
-declare function exactly(n: bigint): Count;
+declare function exactly<const N extends bigint>(n: N & ExactlyBan<N>): Count;
 /** `{0}` — the exclusion: no source fact may pair with the target group. */
 declare const none: Count;
 /**
- * `{lo..hi}` — both bounds explicit, 0 ≤ lo < hi. `lo === hi` is the exact
- * count respelled (rejected naming `exactly(n)`, or `none` at 0); an
- * inverted window is unsatisfiable and rejected.
+ * `{lo..hi}` — both bounds explicit, 1 ≤ lo < hi. `lo === hi` is the exact
+ * count respelled and `lo === 0` is the ceiling respelled: unwritable as
+ * literals ({@link BetweenBan} names `exactly(n)`, `none` at `{0..0}`, or
+ * `atMost(hi)` at a zero floor — the five constructors PARTITION the legal
+ * windows), rejected at construction when computed; an inverted window is
+ * unsatisfiable and rejected at construction (bigint literals carry no
+ * type-level order).
  */
-declare function between(lo: bigint, hi: bigint): Count;
+declare function between<const Lo extends bigint, const Hi extends bigint>(lo: Lo, hi: Hi & BetweenBan<Lo, Hi>): Count;
 /**
  * `{lo..*}` — a floor with no ceiling, lo ≥ 2: `atLeast(1)` says only what
- * the bare containment says (rejected naming `contained`), and
- * `atLeast(0)` is vacuous (rejected naming deletion).
+ * the bare containment says and `atLeast(0)` is vacuous — both unwritable
+ * as literals ({@link AtLeastBan} names the canonical form), rejected at
+ * construction when computed.
  */
-declare function atLeast(lo: bigint): Count;
+declare function atLeast<const N extends bigint>(lo: N & AtLeastBan<N>): Count;
 /**
- * `{0..hi}` — a ceiling, hi ≥ 1: `atMost(0)` is the exclusion respelled
- * and rejected naming `none`.
+ * `{0..hi}` — a ceiling, hi ≥ 1: `atMost(0)` is the exclusion respelled —
+ * unwritable as a literal ({@link AtMostBan} names `none`), rejected at
+ * construction when computed.
  */
-declare function atMost(hi: bigint): Count;
+declare function atMost<const N extends bigint>(hi: N & AtMostBan<N>): Count;
 export type { Count };
 export { atLeast, atMost, between, exactly, none };
 //# sourceMappingURL=count.d.ts.map

package/dist/count.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"count.d.ts","sourceRoot":"","sources":["../src/count.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,UAAU,CAAA;AAK1C;;;;;;;GAOG;AACH,QAAA,MAAM,QAAQ,EAAE,OAAO,MAA0C,CAAA;AAEjE;;;;GAIG;AACH,UAAU,KAAK;IACd,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAA;IAC3B,QAAQ,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAA;CACzB;AAOD;;;GAGG;AACH,iBAAS,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,KAAK,CAQjC;AAED,4EAA4E;AAC5E,QAAA,MAAM,IAAI,EAAE,KAAwB,CAAA;AAEpC;;;;GAIG;AACH,iBAAS,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,KAAK,CAgB9C;AAED;;;;GAIG;AACH,iBAAS,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,KAAK,CAalC;AAED;;;GAGG;AACH,iBAAS,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,KAAK,CAQjC;AAED,YAAY,EAAE,KAAK,EAAE,CAAA;AACrB,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAA"}
+{"version":3,"file":"count.d.ts","sourceRoot":"","sources":["../src/count.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAGH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,UAAU,CAAA;AAK1C;;;;;;;GAOG;AACH,QAAA,MAAM,QAAQ,EAAE,OAAO,MAA0C,CAAA;AAEjE;;;;GAIG;AACH,UAAU,KAAK;IACd,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAA;IAC3B,QAAQ,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAA;CACzB;AAQD;;;;GAIG;AACH,UAAU,YAAY,CAAC,SAAS,SAAS,MAAM;IAC9C,QAAQ,CAAC,+EAA+E,EAAE,SAAS,CAAA;CACnG;AAED,4FAA4F;AAC5F,KAAK,UAAU,CAAC,CAAC,SAAS,MAAM,IAAI,GAAG,CAAC,EAAE,SAAS,IAAI,MAAM,EAAE,GAAG,IAAI,GAAG,KAAK,CAAA;AAE9E,4GAA4G;AAC5G,KAAK,UAAU,CAAC,CAAC,SAAS,MAAM,IAAI,MAAM,SAAS,CAAC,GACjD,OAAO,GACP,UAAU,CAAC,CAAC,CAAC,SAAS,IAAI,GACzB,YAAY,CAAC,2DAA2D,CAAC,GACzE,CAAC,SAAS,EAAE,GACX,YAAY,CAAC,qCAAqC,CAAC,GACnD,OAAO,CAAA;AAEZ,yGAAyG;AACzG,KAAK,UAAU,CAAC,CAAC,SAAS,MAAM,IAAI,MAAM,SAAS,CAAC,GACjD,OAAO,GACP,UAAU,CAAC,CAAC,CAAC,SAAS,IAAI,GACzB,YAAY,CAAC,2DAA2D,CAAC,GACzE,CAAC,SAAS,EAAE,GACX,YAAY,CAAC,sEAAsE,CAAC,GACpF,CAAC,SAAS,EAAE,GACX,YAAY,CAAC,qFAAqF,CAAC,GACnG,OAAO,CAAA;AAEb,kFAAkF;AAClF,KAAK,SAAS,CAAC,CAAC,SAAS,MAAM,IAAI,MAAM,SAAS,CAAC,GAChD,OAAO,GACP,UAAU,CAAC,CAAC,CAAC,SAAS,IAAI,GACzB,YAAY,CAAC,2DAA2D,CAAC,GACzE,CAAC,SAAS,EAAE,GACX,YAAY,CAAC,qDAAqD,CAAC,GACnE,OAAO,CAAA;AAEZ,uGAAuG;AACvG,KAAK,eAAe,CAAC,EAAE,SAAS,MAAM,IAAI,EAAE,SAAS,EAAE,GACpD,YAAY,CAAC,6CAA6C,CAAC,GAC3D,OAAO,CAAA;AAEV;;;;;;;;GAQG;AACH,KAAK,UAAU,CAAC,EAAE,SAAS,MAAM,EAAE,EAAE,SAAS,MAAM,IAAI,MAAM,SAAS,EAAE,GACtE,OAAO,GACP,MAAM,SAAS,EAAE,GAChB,OAAO,GACP,UAAU,CAAC,EAAE,CAAC,SAAS,IAAI,GAC1B,YAAY,CAAC,2DAA2D,CAAC,GACzE,UAAU,CAAC,EAAE,CAAC,SAAS,IAAI,GAC1B,YAAY,CAAC,2DAA2D,CAAC,GACzE,EAAE,SAAS,EAAE,GACZ,EAAE,SAAS,EAAE,GACZ,EAAE,SAAS,EAAE,GACZ,YAAY,CAAC,qDAAqD,CAAC,GACnE,YAAY,CAAC,4DAA4D,CAAC,GAC3E,eAAe,CAAC,EAAE,CAAC,GACpB,eAAe,CAAC,EAAE,CAAC,CAAA;AAE1B;;;;GAIG;AACH,iBAAS,OAAO,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,KAAK,CAQpE;AAED,4EAA4E;AAC5E,QAAA,MAAM,IAAI,EAAE,KAAwB,CAAA;AAEpC;;;;;;;;GAQG;AACH,iBAAS,OAAO,CAAC,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,KAAK,CAmB7G;AAED;;;;;GAKG;AACH,iBAAS,OAAO,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,EAAE,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,KAAK,CAarE;AAED;;;;GAIG;AACH,iBAAS,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,CAQnE;AAED,YAAY,EAAE,KAAK,EAAE,CAAA;AACrB,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAA"}

package/dist/count.js

@@ -1,10 +1,22 @@
 /**
  * Cardinality-window counts — exactly five constructors, and nothing else
- * (`docs/architecture/70-api.md` § the canonical-utterance law). The ban
- * table is enforced REPRESENTATIONALLY, stronger than Rust's expansion
- * errors: `{1..*}`, `{n..n}`, `{0..0}`, `{0..*}`, and inverted windows have
- * NO constructor — the spellings that could produce them are construction
- * errors naming the canonical form, and no other spelling exists at all.
+ * (`docs/architecture/70-api.md` § the canonical-utterance law). The five
+ * constructors PARTITION the legal windows, and the ban table is enforced
+ * REPRESENTATIONALLY, stronger than Rust's expansion errors, in two tiers:
+ *
+ * - **The type tier**: a banned spelling written as a LITERAL does not
+ *   compile — `exactly(0n)`, `between(n, n)`, `between(0n, hi)`,
+ *   `atLeast(0n)`, `atLeast(1n)`, `atMost(0n)`, and every negative bound
+ *   are type errors naming the canonical form (`{n..n}`, `{0..0}`,
+ *   `{0..hi}`-via-between, `{0..*}`, `{1..*}` have NO argument shape that
+ *   produces them), and no sixth constructor exists at all.
+ * - **The construction tier**: a bound the type level cannot judge — a
+ *   COMPUTED `bigint`, whose literal identity is erased, or an inverted
+ *   `between(lo, hi)` order, which type-level bigints cannot compare — is
+ *   judged here at construction with the same canonical-naming errors; and
+ *   past both tiers the engine's own spec validation remains the law for a
+ *   hostile FFI caller (the standing two-tier ban enforcement).
+ *
  * Bounds are `bigint` (u64 crosses as bigint always, PRD-04's law).
  */
 import * as errors from "@superbuilders/errors";
@@ -21,11 +33,13 @@ const exclusion = Object.freeze({ kind: "exact", n: 0n });
 const admitted = Symbol("bumbledb.count.admitted");
 /** Stamps one admitted window as a frozen `Count` value. */
 function admit(window) {
-    return Object.freeze({ window, [admitted]: true });
+    const count = { window, [admitted]: true };
+    return Object.freeze(count);
 }
 /**
  * `{n}` — THE exact-count spelling, n ≥ 1. `exactly(0)` is the exclusion
- * respelled and rejected naming `none`.
+ * respelled: unwritable as a literal ({@link ExactlyBan} names `none`),
+ * rejected at construction when computed.
  */
 function exactly(n) {
     if (n < 0n) {
@@ -39,9 +53,13 @@ function exactly(n) {
 /** `{0}` — the exclusion: no source fact may pair with the target group. */
 const none = admit(exclusion);
 /**
- * `{lo..hi}` — both bounds explicit, 0 ≤ lo < hi. `lo === hi` is the exact
- * count respelled (rejected naming `exactly(n)`, or `none` at 0); an
- * inverted window is unsatisfiable and rejected.
+ * `{lo..hi}` — both bounds explicit, 1 ≤ lo < hi. `lo === hi` is the exact
+ * count respelled and `lo === 0` is the ceiling respelled: unwritable as
+ * literals ({@link BetweenBan} names `exactly(n)`, `none` at `{0..0}`, or
+ * `atMost(hi)` at a zero floor — the five constructors PARTITION the legal
+ * windows), rejected at construction when computed; an inverted window is
+ * unsatisfiable and rejected at construction (bigint literals carry no
+ * type-level order).
  */
 function between(lo, hi) {
     if (lo < 0n || hi < 0n) {
@@ -56,12 +74,16 @@ function between(lo, hi) {
         }
         throw errors.new(`\`{${lo}..${lo}}\` — an exact count is written \`{${lo}}\`: use exactly(${lo})`);
     }
+    if (lo === 0n) {
+        throw errors.new(`\`{0..${hi}}\` — a ceiling is written atMost: use atMost(${hi})`);
+    }
     return admit(Object.freeze({ kind: "range", lo, hi }));
 }
 /**
  * `{lo..*}` — a floor with no ceiling, lo ≥ 2: `atLeast(1)` says only what
- * the bare containment says (rejected naming `contained`), and
- * `atLeast(0)` is vacuous (rejected naming deletion).
+ * the bare containment says and `atLeast(0)` is vacuous — both unwritable
+ * as literals ({@link AtLeastBan} names the canonical form), rejected at
+ * construction when computed.
  */
 function atLeast(lo) {
     if (lo < 0n) {
@@ -76,8 +98,9 @@ function atLeast(lo) {
     return admit(Object.freeze({ kind: "floor", lo }));
 }
 /**
- * `{0..hi}` — a ceiling, hi ≥ 1: `atMost(0)` is the exclusion respelled
- * and rejected naming `none`.
+ * `{0..hi}` — a ceiling, hi ≥ 1: `atMost(0)` is the exclusion respelled —
+ * unwritable as a literal ({@link AtMostBan} names `none`), rejected at
+ * construction when computed.
  */
 function atMost(hi) {
     if (hi < 0n) {

package/dist/count.js.map

@@ -1 +1 @@
-{"version":3,"file":"count.js","sourceRoot":"","sources":["../src/count.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,MAAM,MAAM,uBAAuB,CAAA;AAG/C,sDAAsD;AACtD,MAAM,SAAS,GAAe,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;AAErE;;;;;;;GAOG;AACH,MAAM,QAAQ,GAAkB,MAAM,CAAC,yBAAyB,CAAC,CAAA;AAYjE,4DAA4D;AAC5D,SAAS,KAAK,CAAC,MAAkB;IAChC,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,IAAa,EAAE,CAAC,CAAA;AAC5D,CAAC;AAED;;;GAGG;AACH,SAAS,OAAO,CAAC,CAAS;IACzB,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QACZ,MAAM,MAAM,CAAC,GAAG,CAAC,kCAAkC,CAAC,oBAAoB,CAAC,CAAA;IAC1E,CAAC;IACD,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;QACd,MAAM,MAAM,CAAC,GAAG,CAAC,qEAAqE,CAAC,CAAA;IACxF,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;AAClD,CAAC;AAED,4EAA4E;AAC5E,MAAM,IAAI,GAAU,KAAK,CAAC,SAAS,CAAC,CAAA;AAEpC;;;;GAIG;AACH,SAAS,OAAO,CAAC,EAAU,EAAE,EAAU;IACtC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACxB,MAAM,MAAM,CAAC,GAAG,CAAC,kCAAkC,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAA;IAClF,CAAC;IACD,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACb,MAAM,MAAM,CAAC,GAAG,CACf,iBAAiB,EAAE,KAAK,EAAE,uHAAuH,CACjJ,CAAA;IACF,CAAC;IACD,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACf,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACf,MAAM,MAAM,CAAC,GAAG,CAAC,qDAAqD,CAAC,CAAA;QACxE,CAAC;QACD,MAAM,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,EAAE,sCAAsC,EAAE,oBAAoB,EAAE,GAAG,CAAC,CAAA;IACnG,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;AACvD,CAAC;AAED;;;;GAIG;AACH,SAAS,OAAO,CAAC,EAAU;IAC1B,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACb,MAAM,MAAM,CAAC,GAAG,CAAC,kCAAkC,EAAE,oBAAoB,CAAC,CAAA;IAC3E,CAAC;IACD,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACf,MAAM,MAAM,CAAC,GAAG,CAAC,iFAAiF,CAAC,CAAA;IACpG,CAAC;IACD,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACf,MAAM,MAAM,CAAC,GAAG,CACf,8HAA8H,CAC9H,CAAA;IACF,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;AACnD,CAAC;AAED;;;GAGG;AACH,SAAS,MAAM,CAAC,EAAU;IACzB,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACb,MAAM,MAAM,CAAC,GAAG,CAAC,iCAAiC,EAAE,oBAAoB,CAAC,CAAA;IAC1E,CAAC;IACD,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACf,MAAM,MAAM,CAAC,GAAG,CAAC,qDAAqD,CAAC,CAAA;IACxE,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;AAC3D,CAAC;AAGD,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAA"}
+{"version":3,"file":"count.js","sourceRoot":"","sources":["../src/count.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,KAAK,MAAM,MAAM,uBAAuB,CAAA;AAG/C,sDAAsD;AACtD,MAAM,SAAS,GAAe,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;AAErE;;;;;;;GAOG;AACH,MAAM,QAAQ,GAAkB,MAAM,CAAC,yBAAyB,CAAC,CAAA;AAYjE,4DAA4D;AAC5D,SAAS,KAAK,CAAC,MAAkB;IAChC,MAAM,KAAK,GAAU,EAAE,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,CAAA;IACjD,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;AAC5B,CAAC;AAyED;;;;GAIG;AACH,SAAS,OAAO,CAAyB,CAAoB;IAC5D,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QACZ,MAAM,MAAM,CAAC,GAAG,CAAC,kCAAkC,CAAC,oBAAoB,CAAC,CAAA;IAC1E,CAAC;IACD,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;QACd,MAAM,MAAM,CAAC,GAAG,CAAC,qEAAqE,CAAC,CAAA;IACxF,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;AAClD,CAAC;AAED,4EAA4E;AAC5E,MAAM,IAAI,GAAU,KAAK,CAAC,SAAS,CAAC,CAAA;AAEpC;;;;;;;;GAQG;AACH,SAAS,OAAO,CAAmD,EAAM,EAAE,EAA2B;IACrG,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACxB,MAAM,MAAM,CAAC,GAAG,CAAC,kCAAkC,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAA;IAClF,CAAC;IACD,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACb,MAAM,MAAM,CAAC,GAAG,CACf,iBAAiB,EAAE,KAAK,EAAE,uHAAuH,CACjJ,CAAA;IACF,CAAC;IACD,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACf,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACf,MAAM,MAAM,CAAC,GAAG,CAAC,qDAAqD,CAAC,CAAA;QACxE,CAAC;QACD,MAAM,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,EAAE,sCAAsC,EAAE,oBAAoB,EAAE,GAAG,CAAC,CAAA;IACnG,CAAC;IACD,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACf,MAAM,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,iDAAiD,EAAE,GAAG,CAAC,CAAA;IACpF,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;AACvD,CAAC;AAED;;;;;GAKG;AACH,SAAS,OAAO,CAAyB,EAAqB;IAC7D,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACb,MAAM,MAAM,CAAC,GAAG,CAAC,kCAAkC,EAAE,oBAAoB,CAAC,CAAA;IAC3E,CAAC;IACD,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACf,MAAM,MAAM,CAAC,GAAG,CAAC,iFAAiF,CAAC,CAAA;IACpG,CAAC;IACD,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACf,MAAM,MAAM,CAAC,GAAG,CACf,8HAA8H,CAC9H,CAAA;IACF,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;AACnD,CAAC;AAED;;;;GAIG;AACH,SAAS,MAAM,CAAyB,EAAoB;IAC3D,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACb,MAAM,MAAM,CAAC,GAAG,CAAC,iCAAiC,EAAE,oBAAoB,CAAC,CAAA;IAC1E,CAAC;IACD,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACf,MAAM,MAAM,CAAC,GAAG,CAAC,qDAAqD,CAAC,CAAA;IACxE,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;AAC3D,CAAC;AAGD,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAA"}