@bjornpagen/bumbledb 0.1.0

package/dist/query/scope.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scope.js","sourceRoot":"","sources":["../../src/query/scope.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,MAAM,MAAM,uBAAuB,CAAA;AAC/C,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AAMnC;;;;GAIG;AACH,MAAM,IAAI,GAAkB,MAAM,CAAC,qBAAqB,CAAC,CAAA;AAkEzD,4EAA4E;AAC5E,SAAS,MAAM,CAAC,KAAc;IAC7B,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,IAAI,KAAK,CAAA;AACpE,CAAC;AAiED,gEAAgE;AAChE,SAAS,cAAc,CAAC,MAAiB;IACxC,OAAO;QACN,MAAM;QACN,IAAI,EAAE,IAAI,GAAG,EAAE;QACf,MAAM,EAAE,EAAE;QACV,UAAU,EAAE,IAAI,GAAG,EAAE;QACrB,UAAU,EAAE,EAAE;KACd,CAAA;AACF,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CAAC,MAAsB;IAC7C,OAAO,SAAS,IAAI,MAAM,CAAC,IAAI,CAAA;AAChC,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,MAAiB,EAAE,YAAoB,EAAE,SAAiB;IACnF,MAAM,MAAM,GAA+B,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAA;IACzE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QAC1B,MAAM,MAAM,CAAC,GAAG,CAAC,UAAU,MAAM,CAAC,IAAI,oBAAoB,YAAY,EAAE,CAAC,CAAA;IAC1E,CAAC;IACD,IAAI,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC;QAC5B,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YACxB,OAAO,MAAM,CAAC,EAAE,CAAC,IAAI,CAAA;QACtB,CAAC;QACD,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,MAAM,CAAC,SAAS;YAChE,OAAO,SAAS,CAAC,IAAI,KAAK,SAAS,CAAA;QACpC,CAAC,CAAC,CAAA;QACF,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,MAAM,CAAC,GAAG,CAAC,mBAAmB,YAAY,kBAAkB,SAAS,EAAE,CAAC,CAAA;QAC/E,CAAC;QACD,OAAO,MAAM,CAAC,KAAK,CAAA;IACpB,CAAC;IACD,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,MAAM,CAAC,SAAS;QACjE,OAAO,SAAS,CAAC,IAAI,KAAK,SAAS,CAAA;IACpC,CAAC,CAAC,CAAA;IACF,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC5B,MAAM,MAAM,CAAC,GAAG,CAAC,YAAY,YAAY,iBAAiB,SAAS,EAAE,CAAC,CAAA;IACvE,CAAC;IACD,OAAO,QAAQ,CAAC,KAAK,CAAA;AACtB,CAAC;AAQD,uEAAuE;AACvE,SAAS,QAAQ,CAAI,QAAuB,EAAE,GAAa;IAC1D,MAAM,KAAK,GAAW,MAAM,CAAC,MAAM,CAAC;QACnC,CAAC,IAAI,CAAC,EAAE,KAAc;QACtB,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,IAAI,EAAE,gBAAgB,CAAC,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,KAAK,CAAC;KAChE,CAAC,CAAA;IACF,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IACxB,OAAO,KAAK,CAAA;AACb,CAAC;AAED,8DAA8D;AAC9D,SAAS,oBAAoB,CAAC,QAAuB,EAAE,IAAY;IAClE,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,MAAM,CAAC,KAAK;QACvD,OAAO,KAAK,CAAC,IAAI,KAAK,IAAI,CAAA;IAC3B,CAAC,CAAC,CAAA;IACF,IAAI,KAAK,EAAE,CAAC;QACX,MAAM,MAAM,CAAC,GAAG,CACf,8CAA8C,IAAI,oEAAoE,CACtH,CAAA;IACF,CAAC;AACF,CAAC;AAED,oEAAoE;AACpE,SAAS,UAAU,CAAyB,QAAuB,EAAE,IAAU,EAAE,GAAa;IAC7F,oBAAoB,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;IACpC,MAAM,IAAI,GAAG,gBAAgB,CAAC,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,KAAK,CAAC,CAAA;IACvE,MAAM,KAAK,GAAmB,MAAM,CAAC,MAAM,CAAC;QAC3C,CAAC,IAAI,CAAC,EAAE,OAAgB;QACxB,IAAI;QACJ,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,IAAI;KACJ,CAAC,CAAA;IACF,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;IACtD,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,OAAgB,EAAE,IAAI,EAAE,CAAC,CAAC,CAAA;IAC5E,OAAO,KAAK,CAAA;AACb,CAAC;AAED,oEAAoE;AACpE,SAAS,aAAa,CAAyB,QAAuB,EAAE,IAAU,EAAE,GAAa;IAChG,oBAAoB,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;IACpC,MAAM,IAAI,GAAG,gBAAgB,CAAC,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,KAAK,CAAC,CAAA;IACvE,MAAM,KAAK,GAAsB,MAAM,CAAC,MAAM,CAAC;QAC9C,CAAC,IAAI,CAAC,EAAE,UAAmB;QAC3B,IAAI;QACJ,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,IAAI;KACJ,CAAC,CAAA;IACF,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;IACtD,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAc,EAAE,IAAI,EAAE,CAAC,CAAC,CAAA;IAC1E,OAAO,KAAK,CAAA;AACb,CAAC;AAED,6EAA6E;AAC7E,SAAS,eAAe,CAAsB,QAAuB,EAAE,IAAU;IAChF,oBAAoB,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;IACpC,MAAM,KAAK,GAAoB,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,WAAoB,EAAE,IAAI,EAAE,CAAC,CAAA;IACpF,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;IACtD,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAe,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC,CAAA;IACtF,OAAO,KAAK,CAAA;AACb,CAAC;AAmBD,OAAO,EAAE,cAAc,EAAE,MAAM,EAAE,gBAAgB,EAAE,eAAe,EAAE,UAAU,EAAE,aAAa,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAA"}

package/dist/query/select.d.ts

@@ -0,0 +1,106 @@
+/**
+ * Select entries and aggregates (PRD-08) — the head vocabulary, mirroring
+ * the IR's aggregate roster exactly (`bumbledb/crates/bumbledb/src/ir.rs`
+ * `AggOp`/`FindTerm`; `docs/architecture/20-query-ir.md` § aggregation):
+ * `count` (nullary), `countDistinct`, `sum`/`min`/`max` (over a u64/i64
+ * variable or the measure), `argmax`/`argmin` (arg-restriction: carried
+ * value + orderable key; a tie yields every attaining row), and `pack`
+ * (the coalescing fold — RELATION-SHAPED: one answer row per (group,
+ * maximal segment), the result position interval-typed). Grouping is
+ * implicit: the non-aggregate select entries are the group key; over empty
+ * input an all-aggregate select yields the EMPTY SET, never a zero row.
+ */
+import type { IntervalValue } from "#brand.ts";
+import { phantom } from "#brand.ts";
+import type { Duration } from "#query/atom.ts";
+import type { AnyVar, Flatten, Var } from "#query/scope.ts";
+import { term } from "#query/scope.ts";
+/** The three folds the measure admits (and the plain-variable folds). */
+type FoldOp = "sum" | "min" | "max";
+/** One aggregate's runtime description. */
+type AggregateData = {
+    readonly op: "count";
+} | {
+    readonly op: "countDistinct";
+    readonly over: AnyVar;
+} | {
+    readonly op: "fold";
+    readonly fold: FoldOp;
+    readonly over: AnyVar | Duration;
+} | {
+    readonly op: "arg";
+    readonly direction: "argMax" | "argMin";
+    readonly key: AnyVar;
+    readonly over: AnyVar;
+} | {
+    readonly op: "pack";
+    readonly over: AnyVar;
+};
+/**
+ * One aggregate select value; the phantom carries the answer column's
+ * host type (`count`/`countDistinct` → `bigint` whatever they counted;
+ * folds carry their input's type; the Arg forms the carried payload's
+ * type; `pack` its interval type).
+ */
+interface Aggregate<R> {
+    readonly aggregate: AggregateData;
+    readonly [phantom]?: R;
+}
+/** What a select record's values may be: a projection, a measure, or an aggregate. */
+type SelectEntryInput = AnyVar | Duration | Aggregate<unknown>;
+/** The select record: answer column name to entry, written order = column order. */
+type SelectShape = Readonly<Record<string, SelectEntryInput>>;
+/** One select entry's answer type. */
+type SelectValue<T> = T extends {
+    readonly aggregate: AggregateData;
+    readonly [phantom]?: infer R;
+} ? Exclude<R, undefined> : T extends {
+    readonly measure: AnyVar;
+} ? bigint : T extends {
+    readonly [term]: "var";
+    readonly [phantom]?: infer V;
+} ? Exclude<V, undefined> : never;
+/** The inferred answer-row object type of a select record. */
+type RowOf<Sel extends SelectShape> = Flatten<{
+    [K in keyof Sel]: SelectValue<Sel[K]>;
+}>;
+/** Nullary count: |the group's set of distinct full bindings|, `bigint`. */
+declare function count(): Aggregate<bigint>;
+/** |the distinct values of `over` across the group|, `bigint`; legal over every type. */
+declare function countDistinct<V>(over: Var<V>): Aggregate<bigint>;
+/**
+ * Exact checked sum over a u64/i64 variable (wide accumulator, one
+ * finalize range check — overflow is the engine's typed runtime error,
+ * never a wrap), or over the measure (`sum(duration(v))`).
+ */
+declare function sum<V extends bigint>(over: Var<V>): Aggregate<V>;
+declare function sum(over: Duration): Aggregate<bigint>;
+/** Minimum over a u64/i64 variable or the measure (orderable types only). */
+declare function min<V extends bigint>(over: Var<V>): Aggregate<V>;
+declare function min(over: Duration): Aggregate<bigint>;
+/** Maximum over a u64/i64 variable or the measure (orderable types only). */
+declare function max<V extends bigint>(over: Var<V>): Aggregate<V>;
+declare function max(over: Duration): Aggregate<bigint>;
+/**
+ * Arg-restriction toward the maximum of `key` (`ir::AggOp::ArgMax`): the
+ * group's binding set is restricted to the bindings attaining the extreme
+ * of the orderable key, and `value` is the carried payload — a tie yields
+ * every attaining row. All Arg entries of one query share one key and one
+ * direction; Arg and fold aggregates never mix (both the engine's typed
+ * rules).
+ */
+declare function argmax<K extends bigint, V>(key: Var<K>, value: Var<V>): Aggregate<V>;
+/** Arg-restriction toward the minimum of `key`; rules as {@link argmax}. */
+declare function argmin<K extends bigint, V>(key: Var<K>, value: Var<V>): Aggregate<V>;
+/**
+ * The coalescing fold (Snodgrass coalesce, `ir::AggOp::Pack`): per group,
+ * the maximal disjoint half-open segments of the union of the group's
+ * interval point sets — RELATION-SHAPED, one answer row per (group,
+ * maximal segment), the result position carrying one interval of the
+ * input's element type. At most one `pack` per select, never beside a
+ * fold or an Arg entry (the engine's typed rules).
+ */
+declare function pack<IV extends IntervalValue>(over: Var<IV>): Aggregate<IV>;
+export type { Aggregate, AggregateData, FoldOp, RowOf, SelectEntryInput, SelectShape, SelectValue };
+export { argmax, argmin, count, countDistinct, max, min, pack, sum };
+//# sourceMappingURL=select.d.ts.map

package/dist/query/select.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"select.d.ts","sourceRoot":"","sources":["../../src/query/select.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,WAAW,CAAA;AAC9C,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AACnC,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AAC9C,OAAO,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,iBAAiB,CAAA;AAC3D,OAAO,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAA;AAEtC,yEAAyE;AACzE,KAAK,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,CAAA;AAEnC,2CAA2C;AAC3C,KAAK,aAAa,GACf;IAAE,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAA;CAAE,GACxB;IAAE,QAAQ,CAAC,EAAE,EAAE,eAAe,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GACvD;IAAE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,CAAA;CAAE,GAChF;IACA,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAA;IAClB,QAAQ,CAAC,SAAS,EAAE,QAAQ,GAAG,QAAQ,CAAA;IACvC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CACpB,GACD;IAAE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAA;AAEjD;;;;;GAKG;AACH,UAAU,SAAS,CAAC,CAAC;IACpB,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAA;IACjC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAA;CACtB;AAED,sFAAsF;AACtF,KAAK,gBAAgB,GAAG,MAAM,GAAG,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,CAAA;AAE9D,oFAAoF;AACpF,KAAK,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC,CAAA;AAE7D,sCAAsC;AACtC,KAAK,WAAW,CAAC,CAAC,IAAI,CAAC,SAAS;IAAE,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC;IAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,CAAA;CAAE,GAChG,OAAO,CAAC,CAAC,EAAE,SAAS,CAAC,GACrB,CAAC,SAAS;IAAE,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACrC,MAAM,GACN,CAAC,SAAS;IAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC;IAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,CAAA;CAAE,GACjE,OAAO,CAAC,CAAC,EAAE,SAAS,CAAC,GACrB,KAAK,CAAA;AAEV,8DAA8D;AAC9D,KAAK,KAAK,CAAC,GAAG,SAAS,WAAW,IAAI,OAAO,CAAC;KAAG,CAAC,IAAI,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;CAAE,CAAC,CAAA;AAExF,4EAA4E;AAC5E,iBAAS,KAAK,IAAI,SAAS,CAAC,MAAM,CAAC,CAElC;AAED,yFAAyF;AACzF,iBAAS,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAEzD;AAED;;;;GAIG;AACH,iBAAS,GAAG,CAAC,CAAC,SAAS,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;AAC1D,iBAAS,GAAG,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAA;AAO/C,6EAA6E;AAC7E,iBAAS,GAAG,CAAC,CAAC,SAAS,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;AAC1D,iBAAS,GAAG,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAA;AAO/C,6EAA6E;AAC7E,iBAAS,GAAG,CAAC,CAAC,SAAS,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;AAC1D,iBAAS,GAAG,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAA;AAO/C;;;;;;;GAOG;AACH,iBAAS,MAAM,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAI7E;AAED,4EAA4E;AAC5E,iBAAS,MAAM,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAI7E;AAED;;;;;;;GAOG;AACH,iBAAS,IAAI,CAAC,EAAE,SAAS,aAAa,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC,CAEpE;AAED,YAAY,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,EAAE,KAAK,EAAE,gBAAgB,EAAE,WAAW,EAAE,WAAW,EAAE,CAAA;AACnG,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAA"}

package/dist/query/select.js

@@ -0,0 +1,69 @@
+/**
+ * Select entries and aggregates (PRD-08) — the head vocabulary, mirroring
+ * the IR's aggregate roster exactly (`bumbledb/crates/bumbledb/src/ir.rs`
+ * `AggOp`/`FindTerm`; `docs/architecture/20-query-ir.md` § aggregation):
+ * `count` (nullary), `countDistinct`, `sum`/`min`/`max` (over a u64/i64
+ * variable or the measure), `argmax`/`argmin` (arg-restriction: carried
+ * value + orderable key; a tie yields every attaining row), and `pack`
+ * (the coalescing fold — RELATION-SHAPED: one answer row per (group,
+ * maximal segment), the result position interval-typed). Grouping is
+ * implicit: the non-aggregate select entries are the group key; over empty
+ * input an all-aggregate select yields the EMPTY SET, never a zero row.
+ */
+import { phantom } from "#brand.ts";
+import { term } from "#query/scope.ts";
+/** Nullary count: |the group's set of distinct full bindings|, `bigint`. */
+function count() {
+    return Object.freeze({ aggregate: Object.freeze({ op: "count" }) });
+}
+/** |the distinct values of `over` across the group|, `bigint`; legal over every type. */
+function countDistinct(over) {
+    return Object.freeze({ aggregate: Object.freeze({ op: "countDistinct", over }) });
+}
+function sum(over) {
+    return Object.freeze({
+        aggregate: Object.freeze({ op: "fold", fold: "sum", over })
+    });
+}
+function min(over) {
+    return Object.freeze({
+        aggregate: Object.freeze({ op: "fold", fold: "min", over })
+    });
+}
+function max(over) {
+    return Object.freeze({
+        aggregate: Object.freeze({ op: "fold", fold: "max", over })
+    });
+}
+/**
+ * Arg-restriction toward the maximum of `key` (`ir::AggOp::ArgMax`): the
+ * group's binding set is restricted to the bindings attaining the extreme
+ * of the orderable key, and `value` is the carried payload — a tie yields
+ * every attaining row. All Arg entries of one query share one key and one
+ * direction; Arg and fold aggregates never mix (both the engine's typed
+ * rules).
+ */
+function argmax(key, value) {
+    return Object.freeze({
+        aggregate: Object.freeze({ op: "arg", direction: "argMax", key, over: value })
+    });
+}
+/** Arg-restriction toward the minimum of `key`; rules as {@link argmax}. */
+function argmin(key, value) {
+    return Object.freeze({
+        aggregate: Object.freeze({ op: "arg", direction: "argMin", key, over: value })
+    });
+}
+/**
+ * The coalescing fold (Snodgrass coalesce, `ir::AggOp::Pack`): per group,
+ * the maximal disjoint half-open segments of the union of the group's
+ * interval point sets — RELATION-SHAPED, one answer row per (group,
+ * maximal segment), the result position carrying one interval of the
+ * input's element type. At most one `pack` per select, never beside a
+ * fold or an Arg entry (the engine's typed rules).
+ */
+function pack(over) {
+    return Object.freeze({ aggregate: Object.freeze({ op: "pack", over }) });
+}
+export { argmax, argmin, count, countDistinct, max, min, pack, sum };
+//# sourceMappingURL=select.js.map

package/dist/query/select.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"select.js","sourceRoot":"","sources":["../../src/query/select.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AAGnC,OAAO,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAA;AA+CtC,4EAA4E;AAC5E,SAAS,KAAK;IACb,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,OAAgB,EAAE,CAAC,EAAE,CAAC,CAAA;AAC7E,CAAC;AAED,yFAAyF;AACzF,SAAS,aAAa,CAAI,IAAY;IACrC,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,eAAwB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;AAC3F,CAAC;AASD,SAAS,GAAG,CAAC,IAA4B;IACxC,OAAO,MAAM,CAAC,MAAM,CAAC;QACpB,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,MAAe,EAAE,IAAI,EAAE,KAAc,EAAE,IAAI,EAAE,CAAC;KAC7E,CAAC,CAAA;AACH,CAAC;AAKD,SAAS,GAAG,CAAC,IAA4B;IACxC,OAAO,MAAM,CAAC,MAAM,CAAC;QACpB,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,MAAe,EAAE,IAAI,EAAE,KAAc,EAAE,IAAI,EAAE,CAAC;KAC7E,CAAC,CAAA;AACH,CAAC;AAKD,SAAS,GAAG,CAAC,IAA4B;IACxC,OAAO,MAAM,CAAC,MAAM,CAAC;QACpB,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,MAAe,EAAE,IAAI,EAAE,KAAc,EAAE,IAAI,EAAE,CAAC;KAC7E,CAAC,CAAA;AACH,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,MAAM,CAAsB,GAAW,EAAE,KAAa;IAC9D,OAAO,MAAM,CAAC,MAAM,CAAC;QACpB,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,KAAc,EAAE,SAAS,EAAE,QAAiB,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;KAChG,CAAC,CAAA;AACH,CAAC;AAED,4EAA4E;AAC5E,SAAS,MAAM,CAAsB,GAAW,EAAE,KAAa;IAC9D,OAAO,MAAM,CAAC,MAAM,CAAC;QACpB,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,KAAc,EAAE,SAAS,EAAE,QAAiB,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;KAChG,CAAC,CAAA;AACH,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,IAAI,CAA2B,IAAa;IACpD,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,MAAe,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;AAClF,CAAC;AAGD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAA"}

package/dist/relation.d.ts

@@ -0,0 +1,120 @@
+/**
+ * `relation()` — the ordinary-relation half of the theory's signature. A
+ * relation value is a frozen plain object carrying its name, its ordered
+ * field metadata (declaration order = ordinal ids, the macro's law), typed
+ * field references (`R.fields.holder`), and — since selections are the
+ * relation's own vocabulary — `where()`, which resolves a selection into
+ * lowered bindings eagerly (handles re-verified against their roster at
+ * construction). `Fact<>`/`InsertFact<>` are the inferred row object
+ * types: fresh fields are optional on insert input (omit-to-mint) and
+ * present on read (resupply-to-preserve-identity), typed exactly.
+ */
+import { phantom } from "#brand.ts";
+import type { OneOf } from "#face.ts";
+import { type AnyField, type FieldData, type FieldValue } from "#fields.ts";
+import type { LiteralSetSpec } from "#spec.ts";
+/** Flattens an intersection into one displayed object type (hover legibility). */
+type Flatten<T> = {
+    [K in keyof T]: T[K];
+};
+/** The field block of a relation: field name to field constructor value. */
+type FieldsShape = Record<string, AnyField>;
+/**
+ * A typed field reference (`Account.fields.holder`) — the value statements,
+ * selections, and queries address a field through; its hover shows the
+ * field's brand in the phantom position.
+ */
+interface FieldRef<Rel extends string, Name extends string, V> {
+    readonly relation: Rel;
+    readonly field: Name;
+    readonly [phantom]?: V;
+}
+/** The typed field-reference record of a relation. */
+type FieldRefs<RName extends string, Fields extends FieldsShape> = {
+    readonly [K in keyof Fields & string]: FieldRef<RName, K, FieldValue<Fields[K]>>;
+};
+/** One declared field: name plus its runtime description, in declaration order. */
+interface RelationField {
+    readonly name: string;
+    readonly field: FieldData;
+}
+/** A relation's runtime description. */
+interface RelationData {
+    readonly name: string;
+    readonly fields: readonly RelationField[];
+}
+/**
+ * One resolved σ binding: the field name and its lowered literal set —
+ * handles already resolved to names, values already tagged by structural
+ * type.
+ */
+interface SelectionBinding {
+    readonly field: string;
+    readonly set: LiteralSetSpec;
+}
+/**
+ * The `where()` argument: per field, a branded literal of that field's
+ * type (a closed handle constant IS such a literal — it carries the closed
+ * relation's brand, so it is legal exactly where the field is that closed
+ * relation's id type), an `oneOf(a, b, ...)` literal set, or a `span(start,
+ * end)` interval literal. Equality-only by construction: no operator
+ * parameter exists anywhere.
+ */
+type SelectionInput<Fields extends FieldsShape> = {
+    readonly [K in keyof Fields]?: FieldValue<Fields[K]> | OneOf<FieldValue<Fields[K]>>;
+};
+/** A relation with a selection applied — what `on()` consumes as a σ-carrying source. */
+interface Selected<Name extends string, Fields extends FieldsShape> {
+    readonly relation: Relation<Name, Fields>;
+    readonly selection: readonly SelectionBinding[];
+}
+/** A relation value. */
+interface Relation<Name extends string, Fields extends FieldsShape> {
+    readonly name: Name;
+    readonly data: RelationData;
+    readonly fields: FieldRefs<Name, Fields>;
+    where(selection: SelectionInput<Fields>): Selected<Name, Fields>;
+}
+/** Any relation value, whatever its name and field block. */
+type AnyRelation = Relation<string, FieldsShape>;
+/** Any selected relation value. */
+interface AnySelected {
+    readonly relation: AnyRelation;
+    readonly selection: readonly SelectionBinding[];
+}
+/** Extracts a relation's field block type. */
+type RelationFields<R extends AnyRelation> = R extends Relation<string, infer F> ? F : never;
+/**
+ * The inferred row object type of a relation as READ: every field present,
+ * branded. Closed relations have no `Fact` — they are unwritable, and the
+ * type constraint refuses them because a closed value lacks the relation
+ * shape.
+ */
+type Fact<R extends AnyRelation> = {
+    [K in keyof RelationFields<R>]: FieldValue<RelationFields<R>[K]>;
+};
+/** The field names of `R` that carry the fresh mint mark. */
+type FreshKeys<R extends AnyRelation> = {
+    [K in keyof RelationFields<R>]: RelationFields<R>[K] extends {
+        readonly data: {
+            readonly minted: true;
+        };
+    } ? K : never;
+}[keyof RelationFields<R>];
+/**
+ * The inferred row object type of a relation as INSERTED: fresh fields
+ * optional — omitted, the engine mints; supplied, identity is preserved
+ * (the ETL resupply idiom).
+ */
+type InsertFact<R extends AnyRelation> = Flatten<Omit<Fact<R>, FreshKeys<R>> & Partial<Pick<Fact<R>, FreshKeys<R>>>>;
+/**
+ * Declares one relation: `relation("Account", { id: AccountId.fresh,
+ * holder: HolderId, ... })` — every field references a declared newtype
+ * (`const AccountId = u64.newtype("AccountId")`) or a bare constructor.
+ * Field declaration order is ordinal-id order (macro parity); the returned
+ * value is frozen and side-effect free.
+ */
+declare function relation<const Name extends string, Fields extends FieldsShape>(name: Name, fields: Fields): Relation<Name, Fields>;
+export type { AnyRelation, AnySelected, Fact, FieldRef, FieldRefs, FieldsShape, FreshKeys, InsertFact, Relation, RelationData, RelationField, RelationFields, Selected, SelectionBinding, SelectionInput };
+export { relation };
+//# sourceMappingURL=relation.d.ts.map

package/dist/relation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"relation.d.ts","sourceRoot":"","sources":["../src/relation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AACnC,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,UAAU,CAAA;AACrC,OAAO,EAAE,KAAK,QAAQ,EAA6B,KAAK,SAAS,EAAE,KAAK,UAAU,EAAa,MAAM,YAAY,CAAA;AACjH,OAAO,KAAK,EAAE,cAAc,EAAe,MAAM,UAAU,CAAA;AAE3D,kFAAkF;AAClF,KAAK,OAAO,CAAC,CAAC,IAAI;KAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;CAAE,CAAA;AAqE1C,4EAA4E;AAC5E,KAAK,WAAW,GAAG,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;AAE3C;;;;GAIG;AACH,UAAU,QAAQ,CAAC,GAAG,SAAS,MAAM,EAAE,IAAI,SAAS,MAAM,EAAE,CAAC;IAC5D,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAA;IACtB,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAA;IACpB,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAA;CACtB;AAED,sDAAsD;AACtD,KAAK,SAAS,CAAC,KAAK,SAAS,MAAM,EAAE,MAAM,SAAS,WAAW,IAAI;IAClE,QAAQ,EAAE,CAAC,IAAI,MAAM,MAAM,GAAG,MAAM,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;CAChF,CAAA;AAED,mFAAmF;AACnF,UAAU,aAAa;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAA;CACzB;AAED,wCAAwC;AACxC,UAAU,YAAY;IACrB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,MAAM,EAAE,SAAS,aAAa,EAAE,CAAA;CACzC;AAED;;;;GAIG;AACH,UAAU,gBAAgB;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,GAAG,EAAE,cAAc,CAAA;CAC5B;AAED;;;;;;;GAOG;AACH,KAAK,cAAc,CAAC,MAAM,SAAS,WAAW,IAAI;IACjD,QAAQ,EAAE,CAAC,IAAI,MAAM,MAAM,CAAC,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;CACnF,CAAA;AAED,yFAAyF;AACzF,UAAU,QAAQ,CAAC,IAAI,SAAS,MAAM,EAAE,MAAM,SAAS,WAAW;IACjE,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;IACzC,QAAQ,CAAC,SAAS,EAAE,SAAS,gBAAgB,EAAE,CAAA;CAC/C;AAED,wBAAwB;AACxB,UAAU,QAAQ,CAAC,IAAI,SAAS,MAAM,EAAE,MAAM,SAAS,WAAW;IACjE,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAA;IAC3B,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;IACxC,KAAK,CAAC,SAAS,EAAE,cAAc,CAAC,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;CAChE;AAED,6DAA6D;AAC7D,KAAK,WAAW,GAAG,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;AAEhD,mCAAmC;AACnC,UAAU,WAAW;IACpB,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAA;IAC9B,QAAQ,CAAC,SAAS,EAAE,SAAS,gBAAgB,EAAE,CAAA;CAC/C;AAED,8CAA8C;AAC9C,KAAK,cAAc,CAAC,CAAC,SAAS,WAAW,IAAI,CAAC,SAAS,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAA;AAE5F;;;;;GAKG;AACH,KAAK,IAAI,CAAC,CAAC,SAAS,WAAW,IAAI;KACjC,CAAC,IAAI,MAAM,cAAc,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAChE,CAAA;AAED,6DAA6D;AAC7D,KAAK,SAAS,CAAC,CAAC,SAAS,WAAW,IAAI;KACtC,CAAC,IAAI,MAAM,cAAc,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS;QAC5D,QAAQ,CAAC,IAAI,EAAE;YAAE,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAA;SAAE,CAAA;KACxC,GACE,CAAC,GACD,KAAK;CACR,CAAC,MAAM,cAAc,CAAC,CAAC,CAAC,CAAC,CAAA;AAE1B;;;;GAIG;AACH,KAAK,UAAU,CAAC,CAAC,SAAS,WAAW,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAEpH;;;;;;GAMG;AACH,iBAAS,QAAQ,CAAC,KAAK,CAAC,IAAI,SAAS,MAAM,EAAE,MAAM,SAAS,WAAW,EACtE,IAAI,EAAE,IAAI,EACV,MAAM,EAAE,MAAM,GACZ,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CA6BxB;AAED,YAAY,EACX,WAAW,EACX,WAAW,EACX,IAAI,EACJ,QAAQ,EACR,SAAS,EACT,WAAW,EACX,SAAS,EACT,UAAU,EACV,QAAQ,EACR,YAAY,EACZ,aAAa,EACb,cAAc,EACd,QAAQ,EACR,gBAAgB,EAChB,cAAc,EACd,CAAA;AACD,OAAO,EAAE,QAAQ,EAAE,CAAA"}

package/dist/relation.js

@@ -0,0 +1,108 @@
+/**
+ * `relation()` — the ordinary-relation half of the theory's signature. A
+ * relation value is a frozen plain object carrying its name, its ordered
+ * field metadata (declaration order = ordinal ids, the macro's law), typed
+ * field references (`R.fields.holder`), and — since selections are the
+ * relation's own vocabulary — `where()`, which resolves a selection into
+ * lowered bindings eagerly (handles re-verified against their roster at
+ * construction). `Fact<>`/`InsertFact<>` are the inferred row object
+ * types: fresh fields are optional on insert input (omit-to-mint) and
+ * present on read (resupply-to-preserve-identity), typed exactly.
+ */
+import * as errors from "@superbuilders/errors";
+import { phantom } from "#brand.ts";
+import { assertDeclarationOrderKey, literalOf } from "#fields.ts";
+/**
+ * The one nominal step of `relation()`: the reference record is built by
+ * iterating the declared fields, and this guard verifies the checkable
+ * facts — one reference per declared field, each carrying its own name —
+ * before the record is admitted as the typed {@link FieldRefs}. The
+ * phantom halves (brands) are carried by construction; this is the
+ * module's single trusted seam, the macro-emission analog.
+ */
+function refsComplete(refs, fields) {
+    return Object.keys(fields).every(function hasRef(fieldName) {
+        const ref = refs[fieldName];
+        return typeof ref === "object" && ref !== null && "field" in ref && ref.field === fieldName;
+    });
+}
+/**
+ * Resolves one selection entry to its lowered literal set: an `oneOf`
+ * value (detected by its `literals` tuple — no field value is ever an
+ * object carrying `literals`) becomes a disjunctive set (≥ 2 by the
+ * `oneOf` signature — the one-element set is unwritable); anything else is
+ * the bare literal.
+ */
+function resolveEntry(field, entry) {
+    if (typeof entry === "object" && entry !== null && "literals" in entry && Array.isArray(entry.literals)) {
+        const literals = entry.literals.map(function lowerSetLiteral(literal) {
+            return Object.freeze(literalOf(field, literal));
+        });
+        return Object.freeze({ kind: "many", literals: Object.freeze(literals) });
+    }
+    return Object.freeze({ kind: "one", literal: Object.freeze(literalOf(field, entry)) });
+}
+/**
+ * Resolves a whole `where()` selection against the declared fields, in the
+ * selection's written order (macro parity: σ is spelled, not sorted). An
+ * empty selection is the bare relation respelled and rejected (the
+ * canonical-utterance law).
+ */
+function resolveSelection(name, ordered, entries) {
+    const bindings = [];
+    for (const [fieldName, entry] of entries) {
+        if (entry === undefined) {
+            continue;
+        }
+        const declared = ordered.find(function byName(candidate) {
+            return candidate.name === fieldName;
+        });
+        if (declared === undefined) {
+            throw errors.new(`relation ${name} has no field ${fieldName}`);
+        }
+        bindings.push(Object.freeze({ field: fieldName, set: resolveEntry(declared.field, entry) }));
+    }
+    if (bindings.length === 0) {
+        throw errors.new(`relation ${name}: an empty selection is the bare relation respelled — pass the relation itself (the canonical-utterance law: one meaning, one spelling)`);
+    }
+    return Object.freeze(bindings);
+}
+/**
+ * Declares one relation: `relation("Account", { id: AccountId.fresh,
+ * holder: HolderId, ... })` — every field references a declared newtype
+ * (`const AccountId = u64.newtype("AccountId")`) or a bare constructor.
+ * Field declaration order is ordinal-id order (macro parity); the returned
+ * value is frozen and side-effect free.
+ */
+function relation(name, fields) {
+    const ordered = [];
+    for (const [fieldName, field] of Object.entries(fields)) {
+        assertDeclarationOrderKey(`relation ${name} field`, fieldName);
+        ordered.push(Object.freeze({ name: fieldName, field: field.data }));
+    }
+    const data = Object.freeze({ name, fields: Object.freeze(ordered) });
+    const refs = {};
+    for (const declared of ordered) {
+        refs[declared.name] = Object.freeze({ relation: name, field: declared.name });
+    }
+    Object.freeze(refs);
+    if (!refsComplete(refs, fields)) {
+        throw errors.new(`relation ${name}: field-reference construction incomplete`);
+    }
+    const holder = { value: undefined };
+    function where(selection) {
+        const owner = holder.value;
+        if (owner === undefined) {
+            throw errors.new(`relation ${name}: self-reference read before construction completed`);
+        }
+        return Object.freeze({
+            relation: owner,
+            selection: resolveSelection(name, ordered, Object.entries(selection))
+        });
+    }
+    const value = Object.freeze({ name, data, fields: refs, where });
+    holder.value = value;
+    return value;
+}
+export { relation };
+//# sourceMappingURL=relation.js.map

package/dist/relation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relation.js","sourceRoot":"","sources":["../src/relation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,MAAM,MAAM,uBAAuB,CAAA;AAC/C,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AAEnC,OAAO,EAAiB,yBAAyB,EAAmC,SAAS,EAAE,MAAM,YAAY,CAAA;AAMjH;;;;;;;GAOG;AACH,SAAS,YAAY,CACpB,IAA6B,EAC7B,MAAc;IAEd,OAAO,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,SAAS,MAAM,CAAC,SAAS;QACzD,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAA;QAC3B,OAAO,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,KAAK,SAAS,CAAA;IAC5F,CAAC,CAAC,CAAA;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAS,YAAY,CAAC,KAAgB,EAAE,KAAc;IACrD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,UAAU,IAAI,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;QACzG,MAAM,QAAQ,GAAkB,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,eAAe,CAAC,OAAgB;YAC3F,OAAO,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAA;QAChD,CAAC,CAAC,CAAA;QACF,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;IAC1E,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAA;AACvF,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CACxB,IAAY,EACZ,OAAiC,EACjC,OAAkD;IAElD,MAAM,QAAQ,GAAuB,EAAE,CAAA;IACvC,KAAK,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;QAC1C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACzB,SAAQ;QACT,CAAC;QACD,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,SAAS,MAAM,CAAC,SAAS;YACtD,OAAO,SAAS,CAAC,IAAI,KAAK,SAAS,CAAA;QACpC,CAAC,CAAC,CAAA;QACF,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,MAAM,CAAC,GAAG,CAAC,YAAY,IAAI,iBAAiB,SAAS,EAAE,CAAC,CAAA;QAC/D,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,EAAE,YAAY,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;IAC7F,CAAC;IACD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,MAAM,MAAM,CAAC,GAAG,CACf,YAAY,IAAI,yIAAyI,CACzJ,CAAA;IACF,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;AAC/B,CAAC;AA2GD;;;;;;GAMG;AACH,SAAS,QAAQ,CAChB,IAAU,EACV,MAAc;IAEd,MAAM,OAAO,GAAoB,EAAE,CAAA;IACnC,KAAK,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACzD,yBAAyB,CAAC,YAAY,IAAI,QAAQ,EAAE,SAAS,CAAC,CAAA;QAC9D,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;IACpE,CAAC;IACD,MAAM,IAAI,GAAiB,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;IAClF,MAAM,IAAI,GAA4B,EAAE,CAAA;IACxC,KAAK,MAAM,QAAQ,IAAI,OAAO,EAAE,CAAC;QAChC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAA;IAC9E,CAAC;IACD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IACnB,IAAI,CAAC,YAAY,CAAe,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;QAC/C,MAAM,MAAM,CAAC,GAAG,CAAC,YAAY,IAAI,2CAA2C,CAAC,CAAA;IAC9E,CAAC;IACD,MAAM,MAAM,GAAkD,EAAE,KAAK,EAAE,SAAS,EAAE,CAAA;IAClF,SAAS,KAAK,CAAC,SAAiC;QAC/C,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAA;QAC1B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,MAAM,CAAC,GAAG,CAAC,YAAY,IAAI,qDAAqD,CAAC,CAAA;QACxF,CAAC;QACD,OAAO,MAAM,CAAC,MAAM,CAAC;YACpB,QAAQ,EAAE,KAAK;YACf,SAAS,EAAE,gBAAgB,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;SACrE,CAAC,CAAA;IACH,CAAC;IACD,MAAM,KAAK,GAA2B,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAA;IACxF,MAAM,CAAC,KAAK,GAAG,KAAK,CAAA;IACpB,OAAO,KAAK,CAAA;AACb,CAAC;AAmBD,OAAO,EAAE,QAAQ,EAAE,CAAA"}

package/dist/schema.d.ts

@@ -0,0 +1,50 @@
+/**
+ * `schema()` — assembles relations and statements into a theory value (the
+ * `Theory` analog; what `Db.create`/`Db.open` take). Construction-time
+ * validation is the macro-EXPANSION-boundary analog and nothing more:
+ * membership, implied-key duplicates, duplicate statements, and a
+ * belt-and-braces handle re-verification. Everything semantically deeper
+ * (containment targets resolving declared keys, fresh-on-u64, …) is
+ * DELIBERATELY left to the engine's `SchemaError` at `Db.create` — the
+ * same judge, the same two-boundary split as Rust.
+ */
+import type { AnyClosed } from "#closed.ts";
+import type { AnyRelation } from "#relation.ts";
+import { type Statement } from "#statements.ts";
+/** One member of a schema's relation record. */
+type SchemaRelation = AnyRelation | AnyClosed;
+/** The relation record a schema is generic over — what `Db` and queries key on. */
+type SchemaRelations = Record<string, SchemaRelation>;
+/** A theory value: named relations plus the DECLARED dependency statements. */
+interface Schema<Rels extends SchemaRelations> {
+    readonly name: string;
+    readonly relations: Rels;
+    readonly statements: readonly Statement[];
+}
+/** Any schema value, whatever its relation record. */
+type AnySchema = Schema<SchemaRelations>;
+/**
+ * Assembles a theory:
+ * `schema("Ledger", { Kind, Account, Holder }, [ ...statements ])`.
+ *
+ * Rejected here, each with the offending statement rendered canonically:
+ * a record key differing from its relation's declared name; a statement
+ * whose relation is not (identically) a member of the record; an explicit
+ * duplicate of a fresh-implied or closedness-implied key (macro parity:
+ * "redundant here — and rejected as a duplicate"); a duplicate statement
+ * (two statements rendering to one canonical utterance ARE one judgment);
+ * a handle selection that its roster does not hold (belt-and-braces —
+ * the type level already blocks it); and a handle selection whose closed
+ * reference no declared containment resolves (the engine's canonical
+ * renderer would print the raw row id where `renderStatement` prints the
+ * handle — the paste-back law demands the two spellings agree).
+ *
+ * The fresh-implied and closed auto-keys are NOT added to the statement
+ * list: the engine materializes them itself, in its own pinned order
+ * (`SchemaDescriptor::materialized_statements`), and restating them would
+ * double them.
+ */
+declare function schema<const Rels extends SchemaRelations>(name: string, relations: Rels, statements: readonly Statement[]): Schema<Rels>;
+export type { AnySchema, Schema, SchemaRelation, SchemaRelations };
+export { schema };
+//# sourceMappingURL=schema.d.ts.map

package/dist/schema.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema.d.ts","sourceRoot":"","sources":["../src/schema.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAA;AAG3C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAE/C,OAAO,EAAmB,KAAK,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAwNhE,gDAAgD;AAChD,KAAK,cAAc,GAAG,WAAW,GAAG,SAAS,CAAA;AAE7C,mFAAmF;AACnF,KAAK,eAAe,GAAG,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAA;AAErD,+EAA+E;AAC/E,UAAU,MAAM,CAAC,IAAI,SAAS,eAAe;IAC5C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAA;IACxB,QAAQ,CAAC,UAAU,EAAE,SAAS,SAAS,EAAE,CAAA;CACzC;AAED,sDAAsD;AACtD,KAAK,SAAS,GAAG,MAAM,CAAC,eAAe,CAAC,CAAA;AAExC;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,iBAAS,MAAM,CAAC,KAAK,CAAC,IAAI,SAAS,eAAe,EACjD,IAAI,EAAE,MAAM,EACZ,SAAS,EAAE,IAAI,EACf,UAAU,EAAE,SAAS,SAAS,EAAE,GAC9B,MAAM,CAAC,IAAI,CAAC,CAmBd;AAED,YAAY,EAAE,SAAS,EAAE,MAAM,EAAE,cAAc,EAAE,eAAe,EAAE,CAAA;AAClE,OAAO,EAAE,MAAM,EAAE,CAAA"}