@bjornpagen/bumbledb 0.4.0 → 0.5.0

package/dist/statements.js

@@ -12,8 +12,11 @@
  * schema type (the minimal kernel — descriptors are pure structure) and
  * constrained positionwise equal, so a u64 face against a str face, a
  * bytes width mismatch, an interval element mismatch, or a bare column
- * against a closed reference is a compile error. The ROSTER slot carries a
- * construction-time runtime twin here ({@link assertRosterAgreement} —
+ * against a closed reference is a compile error. TWO of those walls carry
+ * construction-time runtime twins here for untyped callers: ARITY
+ * ({@link assertArityAgreement} — cleanup-0.5.0 ruling 9: an
+ * arity-mismatched pairing fails at the statement, never by silent
+ * truncation) and the ROSTER slot ({@link assertRosterAgreement} —
  * roster IDENTITY, positionwise: a closed vocabulary's referencing column
  * is spelled with the vocabulary's own id descriptor, the ONE spelling, so
  * a plain u64 column can never alias a vocabulary through a declared law
@@ -31,42 +34,28 @@
  * authority).
  */
 import * as errors from "@superbuilders/errors";
+import { isClosedMember, sealedFieldOf } from "#closed.ts";
 import { renderFace } from "#face.ts";
+import { rosterOf } from "#fields.ts";
 import { renderWindow } from "#spec.ts";
-/**
- * The field descriptor one face position projects: an ordinary relation's
- * declared field; a closed relation's SEALED shape — the synthetic `id`
- * (the value's own roster-carrying descriptor, by identity) or a declared
- * payload column. `undefined` when the name is foreign (the type tier makes
- * that unwritable; the engine re-judges projections at `Db.create`).
- */
-function projectedFieldOf(face, fieldName) {
-    const owner = face.owner;
-    if ("axioms" in owner) {
-        if (fieldName === "id") {
-            return owner.id;
-        }
-        const column = owner.data.columns.find(function byName(candidate) {
-            return candidate.name === fieldName;
-        });
-        return column?.field;
-    }
-    const declared = owner.data.fields.find(function byName(candidate) {
-        return candidate.name === fieldName;
-    });
-    return declared?.field;
-}
-/** The roster a descriptor carries: present exactly on a closed reference, absent on every other kind. */
-function rosterOfField(field) {
-    if (field !== undefined && "closed" in field) {
-        return field.closed;
-    }
-    return undefined;
-}
 /** Renders one face position's closedness for the roster-agreement diagnostics. */
 function renderRosterSide(roster) {
     return roster === undefined ? "a bare column" : `a ${roster.name} reference`;
 }
+/**
+ * The runtime twin of {@link SameArity} (cleanup-0.5.0 ruling 9): the two
+ * faces must project equally many fields, judged at CONSTRUCTION for
+ * untyped callers too — without it an arity-mismatched containment
+ * silently truncates to the shorter projection (this module's positionwise
+ * walk and `law.ts`'s `unionSlot` both skip unpaired positions) until
+ * `Db.create`'s colder engine refusal. The error carries the two faces'
+ * own facts: names, arities, and the rendered statement.
+ */
+function assertArityAgreement(source, target, statement) {
+    if (source.projection.length !== target.projection.length) {
+        throw errors.new(`${source.owner.name}(${source.projection.join(", ")}) and ${target.owner.name}(${target.projection.join(", ")}) project ${source.projection.length} vs ${target.projection.length} fields — positional pairing requires both faces to project equally many — ${renderStatement(statement)}`);
+    }
+}
 /**
  * The runtime twin of {@link SameShapes}'s roster slot: the two faces'
  * projected descriptors must agree POSITIONWISE on closedness — the same
@@ -79,6 +68,9 @@ function renderRosterSide(roster) {
  * vocabulary's own descriptor (`Kind.id`) is the ONE spelling of a closed
  * reference at this surface (the canonical-utterance law); the engine
  * cannot backstop this one — the wire carries plain u64s, no rosters.
+ * Arity agreement ({@link assertArityAgreement}) runs first, so the
+ * positionwise walk here never sees an unpaired position from a well-typed
+ * OR an untyped caller.
  */
 function assertRosterAgreement(source, target, statement) {
     source.projection.forEach(function agreeAt(fieldName, position) {
@@ -86,8 +78,8 @@ function assertRosterAgreement(source, target, statement) {
         if (targetField === undefined) {
             return;
         }
-        const sourceRoster = rosterOfField(projectedFieldOf(source, fieldName));
-        const targetRoster = rosterOfField(projectedFieldOf(target, targetField));
+        const sourceRoster = rosterOf(sealedFieldOf(source.owner, fieldName));
+        const targetRoster = rosterOf(sealedFieldOf(target.owner, targetField));
         if (sourceRoster !== targetRoster) {
             throw errors.new(`${source.owner.name}.${fieldName} is ${renderRosterSide(sourceRoster)} but ${target.owner.name}.${targetField} is ${renderRosterSide(targetRoster)} — closedness rides the descriptor: a closed reference is spelled with the vocabulary's own id descriptor (one meaning, one spelling), so faces pair closed-with-closed through one roster or bare-with-bare, never across — ${renderStatement(statement)}`);
         }
@@ -105,7 +97,7 @@ function assertRosterAgreement(source, target, statement) {
  * through the owner's schema type.
  */
 function key(relation, fields) {
-    if (!("fields" in relation.data)) {
+    if (isClosedMember(relation)) {
         throw errors.new(`key(${relation.name}, ...): closedness already materializes ${relation.name}(id) -> ${relation.name} — an explicit key on a closed relation is rejected as a duplicate`);
     }
     const data = Object.freeze({
@@ -132,6 +124,7 @@ function contained(source, target) {
         bidirectional: false
     });
     const statement = Object.freeze({ data });
+    assertArityAgreement(data.source, data.target, statement);
     assertRosterAgreement(data.source, data.target, statement);
     return statement;
 }
@@ -152,6 +145,7 @@ function mirrors(source, target) {
         bidirectional: true
     });
     const statement = Object.freeze({ data });
+    assertArityAgreement(data.source, data.target, statement);
     assertRosterAgreement(data.source, data.target, statement);
     return statement;
 }
@@ -173,6 +167,7 @@ function window(target, count, source) {
         source: source.data
     });
     const statement = Object.freeze({ data });
+    assertArityAgreement(data.source, data.target, statement);
     assertRosterAgreement(data.source, data.target, statement);
     return statement;
 }

package/dist/statements.js.map

@@ -1 +1 @@
-{"version":3,"file":"statements.js","sourceRoot":"","sources":["../src/statements.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,KAAK,MAAM,MAAM,uBAAuB,CAAA;AAE/C,OAAO,EAA+B,UAAU,EAAmC,MAAM,UAAU,CAAA;AAGnG,OAAO,EAAE,YAAY,EAAmB,MAAM,UAAU,CAAA;AAqExD;;;;;;GAMG;AACH,SAAS,gBAAgB,CAAC,IAAc,EAAE,SAAiB;IAC1D,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAA;IACxB,IAAI,QAAQ,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YACxB,OAAO,KAAK,CAAC,EAAE,CAAA;QAChB,CAAC;QACD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,MAAM,CAAC,SAAS;YAC/D,OAAO,SAAS,CAAC,IAAI,KAAK,SAAS,CAAA;QACpC,CAAC,CAAC,CAAA;QACF,OAAO,MAAM,EAAE,KAAK,CAAA;IACrB,CAAC;IACD,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,MAAM,CAAC,SAAS;QAChE,OAAO,SAAS,CAAC,IAAI,KAAK,SAAS,CAAA;IACpC,CAAC,CAAC,CAAA;IACF,OAAO,QAAQ,EAAE,KAAK,CAAA;AACvB,CAAC;AAED,0GAA0G;AAC1G,SAAS,aAAa,CAAC,KAA2B;IACjD,IAAI,KAAK,KAAK,SAAS,IAAI,QAAQ,IAAI,KAAK,EAAE,CAAC;QAC9C,OAAO,KAAK,CAAC,MAAM,CAAA;IACpB,CAAC;IACD,OAAO,SAAS,CAAA;AACjB,CAAC;AAED,mFAAmF;AACnF,SAAS,gBAAgB,CAAC,MAAgC;IACzD,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,IAAI,YAAY,CAAA;AAC7E,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,qBAAqB,CAAC,MAAgB,EAAE,MAAgB,EAAE,SAAoB;IACtF,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,SAAS,OAAO,CAAC,SAAS,EAAE,QAAQ;QAC7D,MAAM,WAAW,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAA;QAC/C,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YAC/B,OAAM;QACP,CAAC;QACD,MAAM,YAAY,GAAG,aAAa,CAAC,gBAAgB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAA;QACvE,MAAM,YAAY,GAAG,aAAa,CAAC,gBAAgB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAA;QACzE,IAAI,YAAY,KAAK,YAAY,EAAE,CAAC;YACnC,MAAM,MAAM,CAAC,GAAG,CACf,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,IAAI,SAAS,OAAO,gBAAgB,CAAC,YAAY,CAAC,QAAQ,MAAM,CAAC,KAAK,CAAC,IAAI,IAAI,WAAW,OAAO,gBAAgB,CAAC,YAAY,CAAC,gOAAgO,eAAe,CAAC,SAAS,CAAC,EAAE,CAC/Y,CAAA;QACF,CAAC;IACF,CAAC,CAAC,CAAA;AACH,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,GAAG,CAGV,QAAW,EAAE,MAAkB;IAChC,IAAI,CAAC,CAAC,QAAQ,IAAI,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAClC,MAAM,MAAM,CAAC,GAAG,CACf,OAAO,QAAQ,CAAC,IAAI,2CAA2C,QAAQ,CAAC,IAAI,WAAW,QAAQ,CAAC,IAAI,oEAAoE,CACxK,CAAA;IACF,CAAC;IACD,MAAM,IAAI,GAA2B,MAAM,CAAC,MAAM,CAAC;QAClD,IAAI,EAAE,KAAK;QACX,KAAK,EAAE,QAAQ;QACf,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC;KACjC,CAAC,CAAA;IACF,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,CAAA;AAC/B,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,SAAS,CACjB,MAAS,EACT,MAA8C;IAE9C,MAAM,IAAI,GAA0C,MAAM,CAAC,MAAM,CAAC;QACjE,IAAI,EAAE,aAAa;QACnB,MAAM,EAAE,MAAM,CAAC,IAAI;QACnB,MAAM,EAAE,MAAM,CAAC,IAAI;QACnB,aAAa,EAAE,KAAK;KACpB,CAAC,CAAA;IACF,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,CAAA;IACzC,qBAAqB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IAC1D,OAAO,SAAS,CAAA;AACjB,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,OAAO,CACf,MAAS,EACT,MAA8C;IAE9C,MAAM,IAAI,GAA0C,MAAM,CAAC,MAAM,CAAC;QACjE,IAAI,EAAE,aAAa;QACnB,MAAM,EAAE,MAAM,CAAC,IAAI;QACnB,MAAM,EAAE,MAAM,CAAC,IAAI;QACnB,aAAa,EAAE,IAAI;KACnB,CAAC,CAAA;IACF,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,CAAA;IACzC,qBAAqB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IAC1D,OAAO,SAAS,CAAA;AACjB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,MAAM,CACd,MAAS,EACT,KAAY,EACZ,MAA8C;IAE9C,MAAM,IAAI,GAAqC,MAAM,CAAC,MAAM,CAAC;QAC5D,IAAI,EAAE,QAAQ;QACd,MAAM,EAAE,MAAM,CAAC,IAAI;QACnB,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,MAAM,EAAE,MAAM,CAAC,IAAI;KACnB,CAAC,CAAA;IACF,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,CAAA;IACzC,qBAAqB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IAC1D,OAAO,SAAS,CAAA;AACjB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,eAAe,CAAC,SAAoB;IAC5C,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAA;IAC3B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,KAAK;YACT,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAA;QACjF,KAAK,aAAa,EAAE,CAAC;YACpB,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAA;YACjD,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,QAAQ,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAA;QAC3E,CAAC;QACD,KAAK,QAAQ;YACZ,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAA;IAC/F,CAAC;AACF,CAAC;AAYD,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE,OAAO,EAAE,eAAe,EAAE,MAAM,EAAE,CAAA"}
+{"version":3,"file":"statements.js","sourceRoot":"","sources":["../src/statements.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,OAAO,KAAK,MAAM,MAAM,uBAAuB,CAAA;AAC/C,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,YAAY,CAAA;AAE1D,OAAO,EAA+B,UAAU,EAAmC,MAAM,UAAU,CAAA;AACnG,OAAO,EAAqB,QAAQ,EAAE,MAAM,YAAY,CAAA;AAExD,OAAO,EAAE,YAAY,EAAmB,MAAM,UAAU,CAAA;AAqExD,mFAAmF;AACnF,SAAS,gBAAgB,CAAC,MAAgC;IACzD,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,IAAI,YAAY,CAAA;AAC7E,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,oBAAoB,CAAC,MAAgB,EAAE,MAAgB,EAAE,SAAoB;IACrF,IAAI,MAAM,CAAC,UAAU,CAAC,MAAM,KAAK,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;QAC3D,MAAM,MAAM,CAAC,GAAG,CACf,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,MAAM,CAAC,KAAK,CAAC,IAAI,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,MAAM,CAAC,UAAU,CAAC,MAAM,OAAO,MAAM,CAAC,UAAU,CAAC,MAAM,8EAA8E,eAAe,CAAC,SAAS,CAAC,EAAE,CAC5R,CAAA;IACF,CAAC;AACF,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,SAAS,qBAAqB,CAAC,MAAgB,EAAE,MAAgB,EAAE,SAAoB;IACtF,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,SAAS,OAAO,CAAC,SAAS,EAAE,QAAQ;QAC7D,MAAM,WAAW,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAA;QAC/C,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YAC/B,OAAM;QACP,CAAC;QACD,MAAM,YAAY,GAAG,QAAQ,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAA;QACrE,MAAM,YAAY,GAAG,QAAQ,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAA;QACvE,IAAI,YAAY,KAAK,YAAY,EAAE,CAAC;YACnC,MAAM,MAAM,CAAC,GAAG,CACf,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,IAAI,SAAS,OAAO,gBAAgB,CAAC,YAAY,CAAC,QAAQ,MAAM,CAAC,KAAK,CAAC,IAAI,IAAI,WAAW,OAAO,gBAAgB,CAAC,YAAY,CAAC,gOAAgO,eAAe,CAAC,SAAS,CAAC,EAAE,CAC/Y,CAAA;QACF,CAAC;IACF,CAAC,CAAC,CAAA;AACH,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,GAAG,CAGV,QAAW,EAAE,MAAkB;IAChC,IAAI,cAAc,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC9B,MAAM,MAAM,CAAC,GAAG,CACf,OAAO,QAAQ,CAAC,IAAI,2CAA2C,QAAQ,CAAC,IAAI,WAAW,QAAQ,CAAC,IAAI,oEAAoE,CACxK,CAAA;IACF,CAAC;IACD,MAAM,IAAI,GAA2B,MAAM,CAAC,MAAM,CAAC;QAClD,IAAI,EAAE,KAAK;QACX,KAAK,EAAE,QAAQ;QACf,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC;KACjC,CAAC,CAAA;IACF,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,CAAA;AAC/B,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,SAAS,CACjB,MAAS,EACT,MAA8C;IAE9C,MAAM,IAAI,GAA0C,MAAM,CAAC,MAAM,CAAC;QACjE,IAAI,EAAE,aAAa;QACnB,MAAM,EAAE,MAAM,CAAC,IAAI;QACnB,MAAM,EAAE,MAAM,CAAC,IAAI;QACnB,aAAa,EAAE,KAAK;KACpB,CAAC,CAAA;IACF,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,CAAA;IACzC,oBAAoB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IACzD,qBAAqB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IAC1D,OAAO,SAAS,CAAA;AACjB,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,OAAO,CACf,MAAS,EACT,MAA8C;IAE9C,MAAM,IAAI,GAA0C,MAAM,CAAC,MAAM,CAAC;QACjE,IAAI,EAAE,aAAa;QACnB,MAAM,EAAE,MAAM,CAAC,IAAI;QACnB,MAAM,EAAE,MAAM,CAAC,IAAI;QACnB,aAAa,EAAE,IAAI;KACnB,CAAC,CAAA;IACF,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,CAAA;IACzC,oBAAoB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IACzD,qBAAqB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IAC1D,OAAO,SAAS,CAAA;AACjB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,MAAM,CACd,MAAS,EACT,KAAY,EACZ,MAA8C;IAE9C,MAAM,IAAI,GAAqC,MAAM,CAAC,MAAM,CAAC;QAC5D,IAAI,EAAE,QAAQ;QACd,MAAM,EAAE,MAAM,CAAC,IAAI;QACnB,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,MAAM,EAAE,MAAM,CAAC,IAAI;KACnB,CAAC,CAAA;IACF,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,CAAA;IACzC,oBAAoB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IACzD,qBAAqB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IAC1D,OAAO,SAAS,CAAA;AACjB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,eAAe,CAAC,SAAoB;IAC5C,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAA;IAC3B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,KAAK;YACT,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAA;QACjF,KAAK,aAAa,EAAE,CAAC;YACpB,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAA;YACjD,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,QAAQ,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAA;QAC3E,CAAC;QACD,KAAK,QAAQ;YACZ,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAA;IAC/F,CAAC;AACF,CAAC;AAYD,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE,OAAO,EAAE,eAAe,EAAE,MAAM,EAAE,CAAA"}

package/package.json

@@ -1,10 +1,7 @@
 {
   "name": "@bjornpagen/bumbledb",
-  "version": "0.4.0",
+  "version": "0.5.0",
   "description": "Type-theoretic TypeScript SDK for the bumbledb embedded relational engine",
-  "module": "dist/index.js",
-  "main": "dist/index.js",
-  "types": "dist/index.d.ts",
   "type": "module",
   "exports": {
     ".": {
@@ -44,7 +41,7 @@
     "@superbuilders/errors": "^4.0.2"
   },
   "optionalDependencies": {
-    "@bjornpagen/bumbledb-darwin-arm64": "0.4.0"
+    "@bjornpagen/bumbledb-darwin-arm64": "0.5.0"
   },
   "devDependencies": {
     "@biomejs/biome": "^2.0.0-beta.5",

package/src/closed.ts

@@ -39,6 +39,7 @@ import {
 	type Infer,
 	literalOf
 } from "#fields.ts"
+import type { AnyRelation, RelationField } from "#relation.ts"
 import { resolveSelection, type SelectionBinding, type SelectionInput } from "#relation.ts"
 import type { LiteralSpec } from "#spec.ts"
 
@@ -53,7 +54,7 @@ type PayloadField = Exclude<AnyField, { readonly fresh: true }>
  * unspellable — the sealed shape mints the synthetic `id` itself (ordinal
  * 0 of the matchable fields), so a declared column named `id` would be
  * shadowed by the synthetic slot everywhere the shape resolves by name
- * (`matchFieldsOf`, the projected face, `spec.rs`'s resolver). The wall is
+ * (`sealedFieldsOf`, the projected face, `spec.rs`'s resolver). The wall is
  * typed here and judged again at construction in {@link mintClosed} — the
  * runtime twin for untyped callers, warmer and earlier than the engine's
  * `DuplicateFieldName` at `Db.create`.
@@ -193,6 +194,48 @@ interface AnyClosed {
 	readonly columns: Readonly<Record<string, PayloadField>>
 }
 
+/**
+ * THE relation-kind discriminant — the ONE spelling of "is this schema
+ * member closed?" (the type tier's twin is the `AnyClosed` conditional
+ * arms). A closed relation's runtime description carries its handle
+ * roster; an ordinary relation's never does. Every runtime closed/ordinary
+ * fork in the SDK judges through this predicate — never a re-spelled
+ * structural probe.
+ */
+function isClosedMember(member: AnyRelation | AnyClosed): member is AnyClosed {
+	return "handles" in member.data
+}
+
+/**
+ * The SEALED field list of a schema member — THE one reader of "what
+ * fields does this owner expose": an ordinary relation's declared fields;
+ * a closed relation's sealed shape — the synthetic `id` (the value's own
+ * roster-carrying descriptor, by identity) at ordinal 0, then the declared
+ * payload columns at declared index + 1 (the sealed shift, mirroring the
+ * engine's `SchemaDescriptor::sealed_fields`). A `ClosedColumn` is
+ * structurally a `RelationField`, so both kinds read uniformly.
+ */
+function sealedFieldsOf(member: AnyRelation | AnyClosed): readonly RelationField[] {
+	if (isClosedMember(member)) {
+		return Object.freeze([Object.freeze({ name: "id", field: member.id }), ...member.data.columns])
+	}
+	return member.data.fields
+}
+
+/**
+ * One sealed field by name — derived from {@link sealedFieldsOf}, so the
+ * closed synthetic `id` resolves everywhere a name is looked up (no reader
+ * can silently lack the `id` arm). `undefined` when the name is foreign
+ * (the type tiers make that unwritable; the engine re-judges at
+ * `Db.create`).
+ */
+function sealedFieldOf(member: AnyRelation | AnyClosed, fieldName: string): AnyField | undefined {
+	const declared = sealedFieldsOf(member).find(function byName(candidate) {
+		return candidate.name === fieldName
+	})
+	return declared?.field
+}
+
 /** Narrows the two-tier second argument: a handle tuple (bare tier) or a column block (payload tier). */
 function isHandleTuple(
 	shape: readonly [string, ...string[]] | Record<string, PayloadField>
@@ -219,7 +262,8 @@ function handleKeysOwn<Handles extends string>(
  * 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()`).
+ * {@link Axioms} (the trusted-admission-seam pattern — its home is
+ * `isTypedScope` in query/lower.ts).
  */
 function axiomsMinted<Handles extends string, Cols extends Record<string, PayloadField>>(
 	record: Readonly<Record<string, object>>,
@@ -237,38 +281,22 @@ function axiomsMinted<Handles extends string, Cols extends Record<string, Payloa
 	})
 }
 
-/**
- * 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<Handles extends string, Cols extends Record<string, PayloadField>>(
-	name: string,
-	axioms: Axioms<Handles, Cols> | undefined,
-	handle: Handles
-): Readonly<Record<string, unknown>> {
-	if (axioms === undefined) {
-		throw errors.new(`closed relation ${name}: payload columns declared without ground axioms`)
-	}
-	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.
+ * its ground axiom. Both tiers supply a REAL axioms record ({@link
+ * closedBare} mints its empty rows), so the columns-without-axioms state is
+ * unrepresentable here — no undefined arm exists to guard.
  */
 function mintAxioms<Handles extends string, Cols extends Record<string, PayloadField>>(
 	name: string,
 	handles: readonly Handles[],
 	cols: readonly ClosedColumn[],
-	axioms: Axioms<Handles, Cols> | undefined
+	axioms: Axioms<Handles, Cols>
 ): Axioms<Handles, Cols> {
 	const out: Record<string, object> = {}
 	for (const handle of handles) {
-		const row = axioms === undefined ? Object.freeze({}) : Object.freeze({ ...groundRow(name, axioms, handle) })
+		const row = Object.freeze({ ...axioms[handle] })
 		Object.defineProperty(out, handle, { value: row, enumerable: true })
 	}
 	Object.freeze(out)
@@ -321,12 +349,29 @@ function closed<const Name extends string, const Cols extends PayloadColumns, Ha
 	return closedPayload(name, shape, axioms)
 }
 
-/** The bare tier's precisely-typed builder: no columns, no axioms. */
+/**
+ * The bare tier's precisely-typed builder: no columns, and the axioms
+ * record is the EMPTY-ROW record over the handle roster (one own frozen
+ * `{}` per handle, `__proto__`-safe own-property definition) — the same
+ * representation the payload tier carries, so `mintClosed` never sees a
+ * tier fork and the columns-without-axioms state stops being spellable.
+ */
 function closedBare<Name extends string, Handles extends string>(
 	name: Name,
 	handles: readonly [Handles, ...Handles[]]
 ): Closed<Name, Handles, Record<never, never>> {
-	return mintClosed<Name, Handles, Record<never, never>>(name, handles, {}, undefined)
+	const empty: Record<string, object> = {}
+	for (const handle of handles) {
+		/** A duplicated name mints one row; the roster's own duplicate refusal in {@link mintClosed} stays the judge. */
+		if (!Object.hasOwn(empty, handle)) {
+			Object.defineProperty(empty, handle, { value: Object.freeze({}), enumerable: true })
+		}
+	}
+	Object.freeze(empty)
+	if (!axiomsMinted<Handles, Record<never, never>>(empty, handles, [])) {
+		throw errors.new(`closed relation ${name}: bare-tier axiom-row minting incomplete`)
+	}
+	return mintClosed<Name, Handles, Record<never, never>>(name, handles, {}, empty)
 }
 
 /**
@@ -379,7 +424,7 @@ function mintClosed<Name extends string, Handles extends string, Cols extends Re
 	name: Name,
 	handles: readonly Handles[],
 	columns: Cols,
-	axioms: Axioms<Handles, Cols> | undefined
+	axioms: Axioms<Handles, Cols>
 ): Closed<Name, Handles, Cols> {
 	if (handles.length === 0) {
 		throw errors.new(`closed relation ${name}: at least one handle is required (an empty vocabulary declares nothing)`)
@@ -405,8 +450,8 @@ function mintClosed<Name extends string, Handles extends string, Cols extends Re
 	}
 	Object.freeze(cols)
 	const rows: ClosedRow[] = handleList.map(function lowerRow(handle) {
+		const row: Readonly<Record<string, unknown>> = axioms[handle]
 		const values = cols.map(function lowerAxiomLiteral(column) {
-			const row = groundRow(name, axioms, handle)
 			return Object.freeze(literalOf(column.field, row[column.name]))
 		})
 		return Object.freeze({ handle, values: Object.freeze(values) })
@@ -471,4 +516,4 @@ export type {
 	PayloadField,
 	SelectedClosed
 }
-export { closed }
+export { closed, isClosedMember, sealedFieldOf, sealedFieldsOf }