@rindle/client 0.1.0-rc.5

package/dist/query.js

@@ -0,0 +1,348 @@
+// The fluent, type-safe query builder. It accumulates state immutably and compiles to the
+// Zero-wire {@link Ast} via `.ast()` (which the wasm `Db.query`/a remote server parses).
+//
+// Two runtime Proxies give the requested ergonomics (WASM-CLIENT-DESIGN.md §6):
+//   - `where` is callable (`where(or(...))`) AND a field proxy (`where.closed(false)`);
+//   - `where<Field>(…)` camelCase sugar (`whereClosed(false)`) is intercepted too.
+// Both are fully typed via mapped types + template-literal keys.
+import { stableKey } from "./key.js";
+import { fieldCondition } from "./operators.js";
+import { isRelationship, SCHEMA } from "./schema.js";
+const STAMP_NAMED_QUERY = Symbol("rindle.stampNamedQuery");
+function stampNamedQuery(query, name, args) {
+    const stamp = query[STAMP_NAMED_QUERY];
+    if (typeof stamp !== "function") {
+        throw new Error("defineQuery's build must return a Query built by newQueryBuilder/queries");
+    }
+    return stamp(name, args);
+}
+export function defineQuery(name, validateOrBuild, maybeBuild) {
+    const hasValidator = maybeBuild !== undefined;
+    const validate = (hasValidator ? validateOrBuild : (raw) => raw);
+    const build = (hasValidator ? maybeBuild : validateOrBuild);
+    const resolve = (rawArgs, ...ctx) => build(validate(rawArgs), ...ctx);
+    // The wire identity is (name, args) ONLY — ctx is never stamped, so it never crosses the wire.
+    const call = (args, ...ctx) => stampNamedQuery(build(validate(args), ...ctx), name, args ?? null);
+    return Object.assign(call, { queryName: name, resolve });
+}
+// ----------------------------- fragments (FRAGMENT-COMPOSITION-DESIGN.md, Phase 0) -----------------------------
+const FRAGMENT_BRAND = Symbol("rindle.fragment");
+/**
+ * Define a co-located, composable {@link Fragment}: a named selection over `table`. The returned
+ * value is callable (the `build` transform), so it threads through the existing `sub`/`Rels`
+ * spine — no GraphQL, no codegen, no schema change (design §3).
+ *
+ * ```ts
+ * const UserAvatar = defineFragment(schema.user, (f) => f.select("id", "name", "avatarUrl"));
+ * const CommentRow = defineFragment(schema.comment, (f) =>
+ *   f.select("id", "body", "authorId")
+ *    .sub("author", schema.user, { parent: ["authorId"], child: ["id"] }, UserAvatar));
+ * ```
+ */
+export function defineFragment(table, build) {
+    const frag = (q) => build(q);
+    return Object.assign(frag, { table, [FRAGMENT_BRAND]: true });
+}
+/** Runtime guard: is `v` a {@link Fragment} (a `defineFragment` value, not a plain build fn)? */
+export function isFragment(v) {
+    return typeof v === "function" && v[FRAGMENT_BRAND] === true;
+}
+function emptyState(table) {
+    return { table, wheres: [], orderBy: [], related: [], one: false };
+}
+function compile(s) {
+    const ast = { table: s.table };
+    if (s.alias !== undefined)
+        ast.alias = s.alias;
+    if (s.wheres.length === 1)
+        ast.where = s.wheres[0];
+    else if (s.wheres.length > 1)
+        ast.where = { type: "and", conditions: s.wheres };
+    if (s.related.length > 0)
+        ast.related = s.related;
+    if (s.start !== undefined)
+        ast.start = s.start;
+    if (s.orderBy.length > 0)
+        ast.orderBy = s.orderBy;
+    if (s.limit !== undefined)
+        ast.limit = s.limit;
+    if (s.one)
+        ast.one = true;
+    if (s.select && s.select.length > 0)
+        ast.select = s.select;
+    return ast;
+}
+/** Build a child AST for `sub`/`exists`: a fresh child query, the optional `build`, compiled. */
+function childAst(child, build) {
+    const cm = child[SCHEMA];
+    let cq = makeQuery(cm, emptyState(cm.name));
+    if (build)
+        cq = build(cq);
+    return cq.ast();
+}
+/** Resolve the two `sub`/`countAs`/`exists` call shapes to a common `{ child, corr, build }`:
+ *  either a named {@link Relationship} (`(rel, build?)`) or an explicit `(child, corr, build?)`. */
+function resolveCorrelated(a, b, c) {
+    if (isRelationship(a)) {
+        return {
+            child: a.child,
+            corr: { parent: [...a.correlation.parent], child: [...a.correlation.child] },
+            build: b,
+        };
+    }
+    return {
+        child: a,
+        corr: b,
+        build: c,
+    };
+}
+// ----------------------------- the merge pass (`include`, FRAGMENT-COMPOSITION-DESIGN §5) -----------
+//
+// `include(fragment)` folds a fragment's selection into the CURRENT node (same table). The merge is
+// canonical (sorted) so include order is irrelevant — `q.include(A).include(B)` and
+// `q.include(B).include(A)` compile to byte-identical ASTs → one `viewKey` → one materialization
+// (§10.5). Two fragments that spread the same relationship `alias` are merged recursively; if they
+// disagree on what rows that edge selects (correlation / table / where / orderBy / limit / paging /
+// aggregate), that is an unresolvable conflict and we throw (§10.2).
+function uniqSort(cols) {
+    return [...new Set(cols)].sort();
+}
+/** Merge two same-node *fragment* selections: an empty (absent) `select` means "all columns", so
+ *  merging "all" with anything stays "all" (§5). Both sides here are fragment-contributed. */
+function mergeNestedSelect(a, b) {
+    if (a === undefined || a.length === 0 || b === undefined || b.length === 0)
+        return undefined;
+    return uniqSort([...a, ...b]);
+}
+/** Merge a fragment's `select` into the ROOTING query's `select`. A pure **union** — this mirrors
+ *  the type level (`Sel | FSel`, where a fragment that selects nothing contributes `never`) and keeps
+ *  `q.include(Frag)` equivalent to applying `Frag(q)`. An absent `select` (on either side) means
+ *  "contributes no columns", NOT "all columns" — so a relationship-only fragment (e.g. an edge that
+ *  just `sub`s, no root columns) doesn't blow the projection open. The result is "all columns" (a
+ *  dropped `select`) only when nothing anywhere selected, i.e. the union is empty. (This differs from
+ *  {@link mergeNestedSelect}: a *nested* same-alias child is an INTERSECTION of row types at the
+ *  type level — `Proj<A> & Proj<B>` — so there a no-select side, meaning "all child columns", wins.) */
+function mergeRootSelect(baseSel, fragSel) {
+    const union = uniqSort([...(baseSel ?? []), ...(fragSel ?? [])]);
+    return union.length === 0 ? undefined : union;
+}
+function aliasOf(csq) {
+    return csq.subquery.alias ?? "";
+}
+/** A canonical key over everything that defines *which* rows a related edge yields — the fields
+ *  two same-alias spreads must AGREE on (select + related are merged, so they're excluded). */
+function edgeShapeKey(csq) {
+    const sq = csq.subquery;
+    return stableKey({
+        correlation: csq.correlation,
+        system: csq.system,
+        table: sq.table,
+        where: sq.where,
+        orderBy: sq.orderBy,
+        limit: sq.limit,
+        start: sq.start,
+        one: sq.one,
+        aggregate: sq.aggregate,
+        aggregatePrecomputed: sq.aggregatePrecomputed,
+    });
+}
+/** Merge the `select` + nested `related` of two same-alias subqueries (callers verified the edge
+ *  shape agrees). Returns a canonical (sorted) AST, omitting empty `select`/`related` like compile. */
+function mergeSubqueryAst(base, frag) {
+    const out = { ...base };
+    const select = mergeNestedSelect(base.select, frag.select);
+    if (select === undefined)
+        delete out.select;
+    else
+        out.select = select;
+    const related = mergeRelatedLists(base.related ?? [], frag.related ?? []);
+    if (related.length === 0)
+        delete out.related;
+    else
+        out.related = related;
+    return out;
+}
+/** Merge two related lists by `alias`: same alias ⇒ recurse (after an edge-shape agreement check);
+ *  distinct aliases ⇒ kept side by side. Output is ordered by alias (canonical, §10.5). */
+function mergeRelatedLists(base, add) {
+    const byAlias = new Map();
+    for (const csq of base)
+        byAlias.set(aliasOf(csq), csq);
+    for (const csq of add) {
+        const alias = aliasOf(csq);
+        const existing = byAlias.get(alias);
+        if (existing === undefined) {
+            byAlias.set(alias, csq);
+            continue;
+        }
+        if (edgeShapeKey(existing) !== edgeShapeKey(csq)) {
+            throw new Error(`include(): conflicting definitions for relationship "${alias}" — two fragments spread the ` +
+                `same alias with different correlation/table/where/orderBy/limit. Give them distinct aliases ` +
+                `or align them (FRAGMENT-COMPOSITION-DESIGN §10.2).`);
+        }
+        byAlias.set(alias, { ...existing, subquery: mergeSubqueryAst(existing.subquery, csq.subquery) });
+    }
+    return [...byAlias.values()].sort((a, b) => {
+        const x = aliasOf(a);
+        const y = aliasOf(b);
+        return x < y ? -1 : x > y ? 1 : 0;
+    });
+}
+/** Fold an `include`d fragment's compiled AST into the current builder {@link State}. An included
+ *  fragment contributes only `select` + nested relationships; it may not constrain the node's row
+ *  set / window — adding a root `where` (§10.3) or `orderBy`/`limit`/`start`/`one` throws. */
+function mergeIncludedFragment(s, frag) {
+    if (frag.where !== undefined) {
+        throw new Error("include(): a fragment may not add a root `where` — only the rooting query filters " +
+            "(FRAGMENT-COMPOSITION-DESIGN §10.3).");
+    }
+    if (frag.orderBy !== undefined || frag.limit !== undefined || frag.start !== undefined || frag.one) {
+        throw new Error("include(): a fragment may not set a root `orderBy`/`limit`/`start`/`one` — it contributes only " +
+            "`select` and nested relationships (those define the node's window, which is the rooting query's job).");
+    }
+    const select = mergeRootSelect(s.select, frag.select);
+    const next = { ...s, related: mergeRelatedLists(s.related, frag.related ?? []) };
+    if (select === undefined)
+        delete next.select;
+    else
+        next.select = select;
+    return next;
+}
+// Internal: the runtime is untyped (Proxy magic); the public `Query<C,Rels>` type is the contract.
+function makeQuery(meta, s, onMat, named) {
+    const next = (patch) => makeQuery(meta, { ...s, ...patch }, onMat, named);
+    const applyField = (field, arg) => next({ wheres: [...s.wheres, fieldCondition(field, arg)] });
+    let proxy;
+    const base = {
+        name: named?.name,
+        args: named?.args,
+        where: (cond) => next({ wheres: [...s.wheres, cond] }),
+        orderBy: (col, dir) => next({ orderBy: [...s.orderBy, [col, dir]] }),
+        select: (...cols) => next({ select: [...(s.select ?? []), ...cols] }),
+        limit: (n) => next({ limit: n }),
+        start: (cursor, opts) => next({ start: { row: { ...cursor }, exclusive: opts?.exclusive ?? false } }),
+        one: () => next({ one: true }),
+        include: (fragment) => {
+            const fragTable = fragment.table;
+            if (fragTable[SCHEMA].name !== s.table) {
+                throw new Error(`include(): the fragment is over "${fragTable[SCHEMA].name}" but this query is over "${s.table}". ` +
+                    `include() merges a fragment into the SAME table — use sub() to nest a different table.`);
+            }
+            const fragAst = childAst(fragTable, fragment);
+            return makeQuery(meta, mergeIncludedFragment(s, fragAst), onMat, named);
+        },
+        sub: (alias, childOrRel, b, c) => {
+            const { child, corr, build } = resolveCorrelated(childOrRel, b, c);
+            const sub = childAst(child, build);
+            sub.alias = alias;
+            const csq = {
+                correlation: { parentField: corr.parent, childField: corr.child },
+                subquery: sub,
+            };
+            return next({ related: [...s.related, csq] });
+        },
+        countAs: (alias, childOrRel, b, c) => {
+            // Same correlated-child mechanism as `sub`, but mark the child a `count` aggregate:
+            // the builder lowers it to a scalar-projected singular relationship (REDUCE-DESIGN §9).
+            const { child, corr, build } = resolveCorrelated(childOrRel, b, c);
+            const sub = childAst(child, build);
+            sub.alias = alias;
+            sub.aggregate = "count";
+            const csq = {
+                correlation: { parentField: corr.parent, childField: corr.child },
+                subquery: sub,
+            };
+            return next({ related: [...s.related, csq] });
+        },
+        ast: () => compile(s),
+        materialize: () => {
+            if (!onMat)
+                throw new Error("materialize() requires a Store — use store.query.<table>");
+            return onMat(proxy);
+        },
+    };
+    // `where` is callable AND a field proxy.
+    const whereProxy = new Proxy(base.where, {
+        get(_t, prop) {
+            if (typeof prop === "string")
+                return (arg) => applyField(prop, arg);
+            return undefined;
+        },
+    });
+    proxy = new Proxy(base, {
+        get(target, prop) {
+            if (prop === "where")
+                return whereProxy;
+            if (prop === STAMP_NAMED_QUERY)
+                return (name, args) => makeQuery(meta, s, onMat, { name, args });
+            if (typeof prop === "string" && prop.length > 5 && prop.startsWith("where")) {
+                const field = prop[5].toLowerCase() + prop.slice(6);
+                return (arg) => applyField(field, arg);
+            }
+            return target[prop];
+        },
+    });
+    return proxy;
+}
+function existsImpl(child, corr, build, op, 
+// `"permissions"` ⇒ a server-only, non-syncing gate (`exists_noSync`): the normalized
+// serializer prunes its witnesses so the permission table is never synced to the client.
+system, opts) {
+    const sub = childAst(child, build);
+    sub.alias = child[SCHEMA].name;
+    const related = {
+        correlation: { parentField: corr.parent, childField: corr.child },
+        subquery: sub,
+    };
+    if (system)
+        related.system = system;
+    return {
+        type: "correlatedSubquery",
+        op,
+        related,
+        ...(opts?.scalar ? { scalar: true } : {}),
+    };
+}
+export function exists(a, b, c, d) {
+    const { child, corr, build } = resolveCorrelated(a, b, c);
+    const opts = (isRelationship(a) ? c : d);
+    return existsImpl(child, corr, build, "EXISTS", undefined, opts);
+}
+export function notExists(a, b, c, d) {
+    const { child, corr, build } = resolveCorrelated(a, b, c);
+    const opts = (isRelationship(a) ? c : d);
+    return existsImpl(child, corr, build, "NOT EXISTS", undefined, opts);
+}
+export function existsNoSync(a, b, c) {
+    const { child, corr, build } = resolveCorrelated(a, b, c);
+    return existsImpl(child, corr, build, "EXISTS", "permissions");
+}
+export function notExistsNoSync(a, b, c) {
+    const { child, corr, build } = resolveCorrelated(a, b, c);
+    return existsImpl(child, corr, build, "NOT EXISTS", "permissions");
+}
+/** A typed query entry over a schema: `queries(schema).issue.where.closed(false)…`. */
+export function queries(schema, onMaterialize) {
+    return new Proxy({}, {
+        get(_t, prop) {
+            if (typeof prop !== "string")
+                return undefined;
+            // Framework/JS introspection probes are never table names — return undefined instead of
+            // throwing so the query root (and a `Store` carrying it) can be safely enumerated by code
+            // that inspects objects. React 19's dev-mode prop diffing reads `$$typeof` on every prop
+            // value; `then` is the thenable check; `toJSON` is JSON serialization. A real typo'd table
+            // (`store.query.isue`) is a plain identifier and still throws below.
+            if (prop[0] === "$" || prop === "then" || prop === "toJSON")
+                return undefined;
+            const meta = schema.tables[prop];
+            if (!meta)
+                throw new Error(`unknown table: ${prop}`);
+            return makeQuery(meta, emptyState(meta.name), onMaterialize);
+        },
+    });
+}
+/** A schema-bound query-builder factory for portable client/server query definitions. */
+export function newQueryBuilder(schema) {
+    return queries(schema);
+}
+//# sourceMappingURL=query.js.map

package/dist/query.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"query.js","sourceRoot":"","sources":["../src/query.ts"],"names":[],"mappings":"AAAA,0FAA0F;AAC1F,yFAAyF;AACzF,EAAE;AACF,gFAAgF;AAChF,wFAAwF;AACxF,mFAAmF;AACnF,iEAAiE;AAGjE,OAAO,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAErC,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAEhD,OAAO,EAAE,cAAc,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AA6HrD,MAAM,iBAAiB,GAAkB,MAAM,CAAC,wBAAwB,CAAC,CAAC;AAM1E,SAAS,eAAe,CAAqB,KAAQ,EAAE,IAAY,EAAE,IAAa;IAChF,MAAM,KAAK,GAAI,KAAmC,CAAC,iBAAiB,CAAC,CAAC;IACtE,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;QAChC,MAAM,IAAI,KAAK,CAAC,0EAA0E,CAAC,CAAC;IAC9F,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,EAAE,IAAI,CAAM,CAAC;AAChC,CAAC;AA6FD,MAAM,UAAU,WAAW,CACzB,IAAY,EACZ,eAAqC,EACrC,UAAiC;IAEjC,MAAM,YAAY,GAAG,UAAU,KAAK,SAAS,CAAC;IAC9C,MAAM,QAAQ,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,GAAY,EAAE,EAAE,CAAC,GAAG,CAA8B,CAAC;IACvG,MAAM,KAAK,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,eAAe,CAAmD,CAAC;IAC9G,MAAM,OAAO,GAAG,CAAC,OAAgB,EAAE,GAAG,GAAc,EAAY,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC;IACpG,+FAA+F;IAC/F,MAAM,IAAI,GAAG,CAAC,IAAa,EAAE,GAAG,GAAc,EAAY,EAAE,CAC1D,eAAe,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,IAAI,IAAI,CAAC,CAAC;IACrE,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,CAAmC,CAAC;AAC7F,CAAC;AAED,kHAAkH;AAElH,MAAM,cAAc,GAAkB,MAAM,CAAC,iBAAiB,CAAC,CAAC;AAkChE;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,cAAc,CAC5B,KAAmB,EACnB,KAAoD;IAEpD,MAAM,IAAI,GAAG,CAAC,CAAW,EAA8B,EAAE,CAAC,KAAK,CAAC,CAAC,CAA+B,CAAC;IACjG,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,IAAa,EAAE,CAAsC,CAAC;AAC9G,CAAC;AAED,iGAAiG;AACjG,MAAM,UAAU,UAAU,CAAC,CAAU;IACnC,OAAO,OAAO,CAAC,KAAK,UAAU,IAAK,CAAgC,CAAC,cAAc,CAAC,KAAK,IAAI,CAAC;AAC/F,CAAC;AAqBD,SAAS,UAAU,CAAC,KAAa;IAC/B,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC;AACrE,CAAC;AAED,SAAS,OAAO,CAAC,CAAQ;IACvB,MAAM,GAAG,GAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;IACpC,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS;QAAE,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;IAC/C,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;SAC9C,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,KAAK,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;IAChF,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC;IAClD,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS;QAAE,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;IAC/C,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC;IAClD,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS;QAAE,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;IAC/C,IAAI,CAAC,CAAC,GAAG;QAAE,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC;IAC1B,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;IAC3D,OAAO,GAAG,CAAC;AACb,CAAC;AAED,iGAAiG;AACjG,SAAS,QAAQ,CAAC,KAAe,EAAE,KAA4C;IAC7E,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;IACzB,IAAI,EAAE,GAAY,SAAS,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IACrD,IAAI,KAAK;QAAE,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;IAC1B,OAAQ,EAAqB,CAAC,GAAG,EAAE,CAAC;AACtC,CAAC;AAQD;oGACoG;AACpG,SAAS,iBAAiB,CAAC,CAA6B,EAAE,CAAU,EAAE,CAAU;IAC9E,IAAI,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC;QACtB,OAAO;YACL,KAAK,EAAE,CAAC,CAAC,KAAiB;YAC1B,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE;YAC5E,KAAK,EAAE,CAA0C;SAClD,CAAC;IACJ,CAAC;IACD,OAAO;QACL,KAAK,EAAE,CAAC;QACR,IAAI,EAAE,CAA0C;QAChD,KAAK,EAAE,CAA0C;KAClD,CAAC;AACJ,CAAC;AAED,uGAAuG;AACvG,EAAE;AACF,oGAAoG;AACpG,oFAAoF;AACpF,iGAAiG;AACjG,mGAAmG;AACnG,oGAAoG;AACpG,qEAAqE;AAErE,SAAS,QAAQ,CAAC,IAAc;IAC9B,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;AACnC,CAAC;AAED;8FAC8F;AAC9F,SAAS,iBAAiB,CAAC,CAAuB,EAAE,CAAuB;IACzE,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC7F,OAAO,QAAQ,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;AAChC,CAAC;AAED;;;;;;;wGAOwG;AACxG,SAAS,eAAe,CAAC,OAA6B,EAAE,OAA6B;IACnF,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACjE,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;AAChD,CAAC;AAED,SAAS,OAAO,CAAC,GAAuB;IACtC,OAAO,GAAG,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE,CAAC;AAClC,CAAC;AAED;+FAC+F;AAC/F,SAAS,YAAY,CAAC,GAAuB;IAC3C,MAAM,EAAE,GAAG,GAAG,CAAC,QAAQ,CAAC;IACxB,OAAO,SAAS,CAAC;QACf,WAAW,EAAE,GAAG,CAAC,WAAW;QAC5B,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,KAAK,EAAE,EAAE,CAAC,KAAK;QACf,KAAK,EAAE,EAAE,CAAC,KAAK;QACf,OAAO,EAAE,EAAE,CAAC,OAAO;QACnB,KAAK,EAAE,EAAE,CAAC,KAAK;QACf,KAAK,EAAE,EAAE,CAAC,KAAK;QACf,GAAG,EAAE,EAAE,CAAC,GAAG;QACX,SAAS,EAAE,EAAE,CAAC,SAAS;QACvB,oBAAoB,EAAE,EAAE,CAAC,oBAAoB;KAC9C,CAAC,CAAC;AACL,CAAC;AAED;uGACuG;AACvG,SAAS,gBAAgB,CAAC,IAAS,EAAE,IAAS;IAC5C,MAAM,GAAG,GAAQ,EAAE,GAAG,IAAI,EAAE,CAAC;IAC7B,MAAM,MAAM,GAAG,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAC3D,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,GAAG,CAAC,MAAM,CAAC;;QACvC,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC;IACzB,MAAM,OAAO,GAAG,iBAAiB,CAAC,IAAI,CAAC,OAAO,IAAI,EAAE,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;IAC1E,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC,OAAO,CAAC;;QACxC,GAAG,CAAC,OAAO,GAAG,OAAO,CAAC;IAC3B,OAAO,GAAG,CAAC;AACb,CAAC;AAED;2FAC2F;AAC3F,SAAS,iBAAiB,CAAC,IAA0B,EAAE,GAAyB;IAC9E,MAAM,OAAO,GAAG,IAAI,GAAG,EAA8B,CAAC;IACtD,KAAK,MAAM,GAAG,IAAI,IAAI;QAAE,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;IACvD,KAAK,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACtB,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;QAC3B,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACxB,SAAS;QACX,CAAC;QACD,IAAI,YAAY,CAAC,QAAQ,CAAC,KAAK,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;YACjD,MAAM,IAAI,KAAK,CACb,wDAAwD,KAAK,+BAA+B;gBAC1F,8FAA8F;gBAC9F,oDAAoD,CACvD,CAAC;QACJ,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,GAAG,QAAQ,EAAE,QAAQ,EAAE,gBAAgB,CAAC,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IACnG,CAAC;IACD,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACzC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;8FAE8F;AAC9F,SAAS,qBAAqB,CAAC,CAAQ,EAAE,IAAS;IAChD,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CACb,oFAAoF;YAClF,sCAAsC,CACzC,CAAC;IACJ,CAAC;IACD,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;QACnG,MAAM,IAAI,KAAK,CACb,iGAAiG;YAC/F,uGAAuG,CAC1G,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACtD,MAAM,IAAI,GAAU,EAAE,GAAG,CAAC,EAAE,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC;IACxF,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC,MAAM,CAAC;;QACxC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IAC1B,OAAO,IAAI,CAAC;AACd,CAAC;AAED,mGAAmG;AACnG,SAAS,SAAS,CAChB,IAAe,EACf,CAAQ,EACR,KAAoC,EACpC,KAAuB;IAEvB,MAAM,IAAI,GAAG,CAAC,KAAqB,EAAW,EAAE,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,EAAE,GAAG,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACnG,MAAM,UAAU,GAAG,CAAC,KAAa,EAAE,GAAY,EAAE,EAAE,CACjD,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAC9D,IAAI,KAAc,CAAC;IAEnB,MAAM,IAAI,GAA4B;QACpC,IAAI,EAAE,KAAK,EAAE,IAAI;QACjB,IAAI,EAAE,KAAK,EAAE,IAAI;QACjB,KAAK,EAAE,CAAC,IAAe,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;QACjE,OAAO,EAAE,CAAC,GAAW,EAAE,GAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;QACjF,MAAM,EAAE,CAAC,GAAG,IAAc,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QAC/E,KAAK,EAAE,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QACxC,KAAK,EAAE,CAAC,MAAgC,EAAE,IAA8B,EAAE,EAAE,CAC1E,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,IAAI,KAAK,EAAE,EAAE,CAAC;QAC9E,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;QAC9B,OAAO,EAAE,CAAC,QAA4C,EAAE,EAAE;YACxD,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC;YACjC,IAAI,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;gBACvC,MAAM,IAAI,KAAK,CACb,oCAAoC,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,6BAA6B,CAAC,CAAC,KAAK,KAAK;oBACjG,wFAAwF,CAC3F,CAAC;YACJ,CAAC;YACD,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAqB,EAAE,QAA8C,CAAC,CAAC;YAChG,OAAO,SAAS,CAAC,IAAI,EAAE,qBAAqB,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAC1E,CAAC;QACD,GAAG,EAAE,CAAC,KAAa,EAAE,UAAsC,EAAE,CAAW,EAAE,CAAW,EAAE,EAAE;YACvF,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,iBAAiB,CAAC,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnE,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACnC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC;YAClB,MAAM,GAAG,GAAuB;gBAC9B,WAAW,EAAE,EAAE,WAAW,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,KAAK,EAAE;gBACjE,QAAQ,EAAE,GAAG;aACd,CAAC;YACF,OAAO,IAAI,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,EAAE,CAAC,KAAa,EAAE,UAAsC,EAAE,CAAW,EAAE,CAAW,EAAE,EAAE;YAC3F,oFAAoF;YACpF,wFAAwF;YACxF,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,iBAAiB,CAAC,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnE,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACnC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC;YAClB,GAAG,CAAC,SAAS,GAAG,OAAO,CAAC;YACxB,MAAM,GAAG,GAAuB;gBAC9B,WAAW,EAAE,EAAE,WAAW,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,KAAK,EAAE;gBACjE,QAAQ,EAAE,GAAG;aACd,CAAC;YACF,OAAO,IAAI,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QAChD,CAAC;QACD,GAAG,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACrB,WAAW,EAAE,GAAG,EAAE;YAChB,IAAI,CAAC,KAAK;gBAAE,MAAM,IAAI,KAAK,CAAC,0DAA0D,CAAC,CAAC;YACxF,OAAO,KAAK,CAAC,KAAiB,CAAC,CAAC;QAClC,CAAC;KACF,CAAC;IAEF,yCAAyC;IACzC,MAAM,UAAU,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,KAAe,EAAE;QACjD,GAAG,CAAC,EAAE,EAAE,IAAI;YACV,IAAI,OAAO,IAAI,KAAK,QAAQ;gBAAE,OAAO,CAAC,GAAY,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC7E,OAAO,SAAS,CAAC;QACnB,CAAC;KACF,CAAC,CAAC;IAEH,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,EAAE;QACtB,GAAG,CAAC,MAAM,EAAE,IAAI;YACd,IAAI,IAAI,KAAK,OAAO;gBAAE,OAAO,UAAU,CAAC;YACxC,IAAI,IAAI,KAAK,iBAAiB;gBAAE,OAAO,CAAC,IAAY,EAAE,IAAa,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;YAClH,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC5E,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACpD,OAAO,CAAC,GAAY,EAAE,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAClD,CAAC;YACD,OAAO,MAAM,CAAC,IAAc,CAAC,CAAC;QAChC,CAAC;KACF,CAAC,CAAC;IACH,OAAO,KAAK,CAAC;AACf,CAAC;AAeD,SAAS,UAAU,CACjB,KAAe,EACf,IAA2C,EAC3C,KAA4C,EAC5C,EAAY;AACZ,sFAAsF;AACtF,yFAAyF;AACzF,MAAsB,EACtB,IAAiB;IAEjB,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACnC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC;IAC/B,MAAM,OAAO,GAAuB;QAClC,WAAW,EAAE,EAAE,WAAW,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,KAAK,EAAE;QACjE,QAAQ,EAAE,GAAG;KACd,CAAC;IACF,IAAI,MAAM;QAAE,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC;IACpC,OAAO;QACL,IAAI,EAAE,oBAAoB;QAC1B,EAAE;QACF,OAAO;QACP,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC1C,CAAC;AACJ,CAAC;AAgBD,MAAM,UAAU,MAAM,CAAC,CAA6B,EAAE,CAAW,EAAE,CAAW,EAAE,CAAW;IACzF,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,MAAM,IAAI,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAA2B,CAAC;IACnE,OAAO,UAAU,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,CAAkB,CAAC;AACpF,CAAC;AAeD,MAAM,UAAU,SAAS,CAAC,CAA6B,EAAE,CAAW,EAAE,CAAW,EAAE,CAAW;IAC5F,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,MAAM,IAAI,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAA2B,CAAC;IACnE,OAAO,UAAU,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,IAAI,CAAkB,CAAC;AACxF,CAAC;AAmBD,MAAM,UAAU,YAAY,CAAC,CAA6B,EAAE,CAAW,EAAE,CAAW;IAClF,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,OAAO,UAAU,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,aAAa,CAAkB,CAAC;AAClF,CAAC;AAYD,MAAM,UAAU,eAAe,CAAC,CAA6B,EAAE,CAAW,EAAE,CAAW;IACrF,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,OAAO,UAAU,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,EAAE,aAAa,CAAkB,CAAC;AACtF,CAAC;AAMD,uFAAuF;AACvF,MAAM,UAAU,OAAO,CACrB,MAAiB,EACjB,aAA4C;IAE5C,OAAO,IAAI,KAAK,CAAC,EAA6B,EAAE;QAC9C,GAAG,CAAC,EAAE,EAAE,IAAI;YACV,IAAI,OAAO,IAAI,KAAK,QAAQ;gBAAE,OAAO,SAAS,CAAC;YAC/C,wFAAwF;YACxF,0FAA0F;YAC1F,yFAAyF;YACzF,2FAA2F;YAC3F,qEAAqE;YACrE,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,QAAQ;gBAAE,OAAO,SAAS,CAAC;YAC9E,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,CAAC,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,IAAI,EAAE,CAAC,CAAC;YACrD,OAAO,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,aAAa,CAAC,CAAC;QAC/D,CAAC;KACF,CAAiB,CAAC;AACrB,CAAC;AAED,yFAAyF;AACzF,MAAM,UAAU,eAAe,CAAoB,MAAiB;IAClE,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC;AACzB,CAAC"}

package/dist/schema.d.ts

@@ -0,0 +1,111 @@
+import type { Arg, Cond } from "./operators.ts";
+import type { ColType } from "./types.ts";
+/** A column descriptor. `type` drives the comparator + JSON parsing; `__t` is a phantom. */
+export interface Col<T> {
+    readonly type: ColType;
+    readonly __t?: T;
+}
+export type ColT<X> = X extends Col<infer T> ? T : never;
+export type AnyCols = Record<string, Col<unknown>>;
+export type RowOf<C extends AnyCols> = {
+    [K in keyof C]: ColT<C[K]>;
+};
+export declare const string: () => Col<string>;
+export declare const number: () => Col<number>;
+export declare const boolean: () => Col<boolean>;
+export declare const json: <T = unknown>() => Col<T>;
+/** Metadata key on a {@link TableDef} (a `unique symbol`, so no column name collides). */
+export declare const SCHEMA: unique symbol;
+export interface TableMeta<N extends string = string, C extends AnyCols = AnyCols> {
+    readonly name: N;
+    readonly columns: C;
+    readonly primaryKey: readonly string[];
+}
+export type TableDef<N extends string, C extends AnyCols> = {
+    readonly [SCHEMA]: TableMeta<N, C>;
+} & {
+    readonly [K in keyof C]: (arg: Arg<ColT<C[K]>>) => Cond<RowOf<C>>;
+};
+/** Any table, for positions that only read its metadata. The field-factory part of a
+ *  `TableDef` is invariant in `C`, so callers constrain on the `[SCHEMA]` meta only — to
+ *  which every concrete `TableDef<N, C>` is assignable. */
+export type TableLike<C extends AnyCols> = {
+    readonly [SCHEMA]: TableMeta<string, C>;
+};
+export type AnyTable = TableLike<AnyCols>;
+/** The row type of a table definition: `Row<typeof issue>` → `{ id: string; … }`. The
+ *  whole-table ergonomic form of {@link RowOf}, so app code derives its row interfaces from
+ *  the schema instead of hand-maintaining a parallel twin. */
+export type Row<T extends AnyTable> = RowOf<T[typeof SCHEMA]["columns"]>;
+/** `table("issue").columns({ id: string(), … }).primaryKey("id")`. */
+export declare function table<N extends string>(name: N): {
+    columns<C extends AnyCols>(cols: C): {
+        primaryKey<K extends keyof C & string>(...keys: K[]): TableDef<N, C>;
+    };
+};
+/** Read a table's metadata (columns / PK / name). */
+export declare function tableMeta(t: AnyTable): TableMeta;
+/** name → columns, derived from the tables array (for typing `store.query.<table>`). */
+export type SchemaOf<T extends readonly AnyTable[]> = {
+    [E in T[number] as E[typeof SCHEMA]["name"]]: E[typeof SCHEMA]["columns"];
+};
+/** name → columns, the resolved schema map carried in the {@link Schema} type. */
+export type ColsMap = Record<string, AnyCols>;
+export interface Schema<S extends ColsMap = ColsMap> {
+    readonly tables: Readonly<Record<string, TableMeta>>;
+    /** Phantom carrying name→columns for query-root inference (never read at runtime). */
+    readonly __cols: S;
+}
+export declare function createSchema<const T extends readonly AnyTable[]>(opts: {
+    tables: T;
+}): Schema<SchemaOf<T>>;
+/** Brand on a {@link Relationship} value (a `unique symbol`, distinct from a {@link TableDef}). */
+declare const RELATIONSHIP_BRAND: unique symbol;
+/**
+ * A reusable, typed JOIN between two tables — the correlation declared once (design §4). Built with
+ * {@link rel}; parameterized by the parent columns `PC` (so a `sub` checks the relationship belongs to
+ * the query's table) and the child columns `CC` (which flow into the nested result type). Pass it to
+ * `sub`/`countAs`/`exists` in place of an explicit `child` + `{ parent, child }` correlation.
+ */
+export interface Relationship<PC extends AnyCols, CC extends AnyCols> {
+    /** The child table the relationship points at. */
+    readonly child: TableLike<CC>;
+    /** Correlation keys: `parent[i]` (a parent column) joins to `child[i]` (a child column). */
+    readonly correlation: {
+        readonly parent: readonly string[];
+        readonly child: readonly string[];
+    };
+    /** Phantom binding the parent columns so `Query<C>.sub(alias, rel)` rejects a rel for another table. */
+    readonly __parent?: PC;
+    readonly [RELATIONSHIP_BRAND]: true;
+}
+/** Any relationship, for positions that only read its correlation / child table. */
+export type AnyRelationship = Relationship<AnyCols, AnyCols>;
+/**
+ * Declare a relationship once: `rel(issue, user, { ownerId: "id" })` means `issue.ownerId → user.id`.
+ * `mapping` is `{ [parentColumn]: childColumn }` (a composite join is multiple entries). The `parent`
+ * table is used only to type-check the keys; pass the result to `sub`/`countAs`/`exists`.
+ */
+export declare function rel<PC extends AnyCols, CC extends AnyCols>(_parent: TableLike<PC>, child: TableLike<CC>, mapping: Partial<Record<keyof PC & string, keyof CC & string>>): Relationship<PC, CC>;
+/** A typed registry of named {@link Relationship}s — `defineRelationships({ issueOwner: rel(...) })`.
+ *  A thin identity helper that names the bag and constrains its values; the keys are yours to choose. */
+export declare function defineRelationships<R extends Record<string, AnyRelationship>>(rels: R): R;
+/** Runtime guard: is `v` a {@link Relationship} value (not a table or a plain object)? */
+export declare function isRelationship(v: unknown): v is AnyRelationship;
+/** The `SchemaSpec` (`columns` + `primaryKey` indices) the wasm `Db.registerTable` wants. */
+export declare function tableSpec(meta: TableMeta): {
+    columns: string[];
+    primaryKey: number[];
+};
+/** The client's per-table flat schema (name + column order + PK indices), the shape a
+ *  normalized `hello` advertises (NORMALIZED-CHANGES-DESIGN.md §3). Used to validate a
+ *  server hello against the CLIENT's own typed schema so a column-order / PK skew is caught
+ *  instead of silently transposing positional cells (CRIT#4). Sorted by name for stable
+ *  ordering. */
+export declare function normalizedTableSchemas<S extends ColsMap>(schema: Schema<S>): {
+    name: string;
+    columns: string[];
+    primaryKey: number[];
+}[];
+export {};
+//# 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":"AAQA,OAAO,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAEhD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAE1C,4FAA4F;AAC5F,MAAM,WAAW,GAAG,CAAC,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;CAClB;AACD,MAAM,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;AACzD,MAAM,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;AACnD,MAAM,MAAM,KAAK,CAAC,CAAC,SAAS,OAAO,IAAI;KAAG,CAAC,IAAI,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAAE,CAAC;AAEtE,eAAO,MAAM,MAAM,QAAO,GAAG,CAAC,MAAM,CAAyB,CAAC;AAC9D,eAAO,MAAM,MAAM,QAAO,GAAG,CAAC,MAAM,CAAyB,CAAC;AAC9D,eAAO,MAAM,OAAO,QAAO,GAAG,CAAC,OAAO,CAA0B,CAAC;AACjE,eAAO,MAAM,IAAI,GAAI,CAAC,GAAG,OAAO,OAAK,GAAG,CAAC,CAAC,CAAuB,CAAC;AAElE,0FAA0F;AAC1F,eAAO,MAAM,MAAM,EAAE,OAAO,MAAgC,CAAC;AAE7D,MAAM,WAAW,SAAS,CAAC,CAAC,SAAS,MAAM,GAAG,MAAM,EAAE,CAAC,SAAS,OAAO,GAAG,OAAO;IAC/E,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;IACjB,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;IAIpB,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;CACxC;AAED,MAAM,MAAM,QAAQ,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC,SAAS,OAAO,IAAI;IAC1D,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CACpC,GAAG;IACF,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;CAClE,CAAC;AAEF;;2DAE2D;AAC3D,MAAM,MAAM,SAAS,CAAC,CAAC,SAAS,OAAO,IAAI;IAAE,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;CAAE,CAAC;AACvF,MAAM,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;AAE1C;;8DAE8D;AAC9D,MAAM,MAAM,GAAG,CAAC,CAAC,SAAS,QAAQ,IAAI,KAAK,CAAC,CAAC,CAAC,OAAO,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;AAEzE,sEAAsE;AACtE,wBAAgB,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,IAAI,EAAE,CAAC;YAEnC,CAAC,SAAS,OAAO,QAAQ,CAAC;mBAEnB,CAAC,SAAS,MAAM,CAAC,GAAG,MAAM,WAAW,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;;EAM3E;AAYD,qDAAqD;AACrD,wBAAgB,SAAS,CAAC,CAAC,EAAE,QAAQ,GAAG,SAAS,CAEhD;AAED,wFAAwF;AACxF,MAAM,MAAM,QAAQ,CAAC,CAAC,SAAS,SAAS,QAAQ,EAAE,IAAI;KACnD,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,MAAM,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,MAAM,CAAC,CAAC,SAAS,CAAC;CAC1E,CAAC;AAEF,kFAAkF;AAClF,MAAM,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAE9C,MAAM,WAAW,MAAM,CAAC,CAAC,SAAS,OAAO,GAAG,OAAO;IACjD,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;IACrD,sFAAsF;IACtF,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;CACpB;AAED,wBAAgB,YAAY,CAAC,KAAK,CAAC,CAAC,SAAS,SAAS,QAAQ,EAAE,EAAE,IAAI,EAAE;IACtE,MAAM,EAAE,CAAC,CAAC;CACX,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAOtB;AAQD,mGAAmG;AACnG,QAAA,MAAM,kBAAkB,EAAE,OAAO,MAAsC,CAAC;AAExE;;;;;GAKG;AACH,MAAM,WAAW,YAAY,CAAC,EAAE,SAAS,OAAO,EAAE,EAAE,SAAS,OAAO;IAClE,kDAAkD;IAClD,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC;IAC9B,4FAA4F;IAC5F,QAAQ,CAAC,WAAW,EAAE;QAAE,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAA;KAAE,CAAC;IAChG,wGAAwG;IACxG,QAAQ,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;IACvB,QAAQ,CAAC,CAAC,kBAAkB,CAAC,EAAE,IAAI,CAAC;CACrC;AAED,oFAAoF;AACpF,MAAM,MAAM,eAAe,GAAG,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;AAE7D;;;;GAIG;AACH,wBAAgB,GAAG,CAAC,EAAE,SAAS,OAAO,EAAE,EAAE,SAAS,OAAO,EACxD,OAAO,EAAE,SAAS,CAAC,EAAE,CAAC,EACtB,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC,EACpB,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAC7D,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAItB;AAED;yGACyG;AACzG,wBAAgB,mBAAmB,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAEzF;AAED,0FAA0F;AAC1F,wBAAgB,cAAc,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI,eAAe,CAE/D;AAED,6FAA6F;AAC7F,wBAAgB,SAAS,CAAC,IAAI,EAAE,SAAS,GAAG;IAAE,OAAO,EAAE,MAAM,EAAE,CAAC;IAAC,UAAU,EAAE,MAAM,EAAE,CAAA;CAAE,CAItF;AAED;;;;gBAIgB;AAChB,wBAAgB,sBAAsB,CAAC,CAAC,SAAS,OAAO,EACtD,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,GAChB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,EAAE,CAAC;IAAC,UAAU,EAAE,MAAM,EAAE,CAAA;CAAE,EAAE,CAI7D"}

package/dist/schema.js

@@ -0,0 +1,92 @@
+// The typed schema: `table("issue").columns({...}).primaryKey("id")` + `createSchema`.
+//
+// A table definition doubles as a field→condition factory (a runtime Proxy):
+// `issue.priority(gt(8))` produces a `Cond<RowOf<issue>>`. THAT is where the table type is
+// bound — which is why `or`/`exists` are plain top-level functions, no closure needed
+// (WASM-CLIENT-DESIGN.md §6). Schema metadata is stored under a `unique symbol` key so it
+// never collides with a column name.
+import { fieldCondition } from "./operators.js";
+export const string = () => ({ type: "string" });
+export const number = () => ({ type: "number" });
+export const boolean = () => ({ type: "boolean" });
+export const json = () => ({ type: "json" });
+/** Metadata key on a {@link TableDef} (a `unique symbol`, so no column name collides). */
+export const SCHEMA = Symbol("rindle.schema");
+/** `table("issue").columns({ id: string(), … }).primaryKey("id")`. */
+export function table(name) {
+    return {
+        columns(cols) {
+            return {
+                primaryKey(...keys) {
+                    return makeTableDef({ name, columns: cols, primaryKey: keys });
+                },
+            };
+        },
+    };
+}
+function makeTableDef(meta) {
+    return new Proxy({}, {
+        get(_target, prop) {
+            if (prop === SCHEMA)
+                return meta;
+            if (typeof prop === "string")
+                return (arg) => fieldCondition(prop, arg);
+            return undefined;
+        },
+    });
+}
+/** Read a table's metadata (columns / PK / name). */
+export function tableMeta(t) {
+    return t[SCHEMA];
+}
+export function createSchema(opts) {
+    const tables = {};
+    for (const t of opts.tables) {
+        const m = t[SCHEMA];
+        tables[m.name] = m;
+    }
+    return { tables };
+}
+// ----------------------------- relationships (FRAGMENT-COMPOSITION-DESIGN §4.2, named edges) -----
+//
+// A relationship is the correlation (`parent.col → child.col`) declared ONCE as a value, so `sub`,
+// `countAs`, and `exists` don't restate `{ parent, child }` keys at every spread/filter site. It is a
+// plain typed value (not registered on the schema), passed where `(child, corr)` used to go.
+/** Brand on a {@link Relationship} value (a `unique symbol`, distinct from a {@link TableDef}). */
+const RELATIONSHIP_BRAND = Symbol("rindle.relationship");
+/**
+ * Declare a relationship once: `rel(issue, user, { ownerId: "id" })` means `issue.ownerId → user.id`.
+ * `mapping` is `{ [parentColumn]: childColumn }` (a composite join is multiple entries). The `parent`
+ * table is used only to type-check the keys; pass the result to `sub`/`countAs`/`exists`.
+ */
+export function rel(_parent, child, mapping) {
+    const parent = Object.keys(mapping);
+    const childKeys = parent.map((k) => mapping[k]);
+    return { child, correlation: { parent, child: childKeys }, [RELATIONSHIP_BRAND]: true };
+}
+/** A typed registry of named {@link Relationship}s — `defineRelationships({ issueOwner: rel(...) })`.
+ *  A thin identity helper that names the bag and constrains its values; the keys are yours to choose. */
+export function defineRelationships(rels) {
+    return rels;
+}
+/** Runtime guard: is `v` a {@link Relationship} value (not a table or a plain object)? */
+export function isRelationship(v) {
+    return typeof v === "object" && v !== null && v[RELATIONSHIP_BRAND] === true;
+}
+/** The `SchemaSpec` (`columns` + `primaryKey` indices) the wasm `Db.registerTable` wants. */
+export function tableSpec(meta) {
+    const columns = Object.keys(meta.columns);
+    const primaryKey = meta.primaryKey.map((k) => columns.indexOf(k));
+    return { columns, primaryKey };
+}
+/** The client's per-table flat schema (name + column order + PK indices), the shape a
+ *  normalized `hello` advertises (NORMALIZED-CHANGES-DESIGN.md §3). Used to validate a
+ *  server hello against the CLIENT's own typed schema so a column-order / PK skew is caught
+ *  instead of silently transposing positional cells (CRIT#4). Sorted by name for stable
+ *  ordering. */
+export function normalizedTableSchemas(schema) {
+    return Object.keys(schema.tables)
+        .sort()
+        .map((name) => ({ name, ...tableSpec(schema.tables[name]) }));
+}
+//# sourceMappingURL=schema.js.map

package/dist/schema.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema.js","sourceRoot":"","sources":["../src/schema.ts"],"names":[],"mappings":"AAAA,uFAAuF;AACvF,EAAE;AACF,6EAA6E;AAC7E,2FAA2F;AAC3F,sFAAsF;AACtF,0FAA0F;AAC1F,qCAAqC;AAGrC,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAYhD,MAAM,CAAC,MAAM,MAAM,GAAG,GAAgB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;AAC9D,MAAM,CAAC,MAAM,MAAM,GAAG,GAAgB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;AAC9D,MAAM,CAAC,MAAM,OAAO,GAAG,GAAiB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;AACjE,MAAM,CAAC,MAAM,IAAI,GAAG,GAAwB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;AAElE,0FAA0F;AAC1F,MAAM,CAAC,MAAM,MAAM,GAAkB,MAAM,CAAC,eAAe,CAAC,CAAC;AA4B7D,sEAAsE;AACtE,MAAM,UAAU,KAAK,CAAmB,IAAO;IAC7C,OAAO;QACL,OAAO,CAAoB,IAAO;YAChC,OAAO;gBACL,UAAU,CAA6B,GAAG,IAAS;oBACjD,OAAO,YAAY,CAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;gBACvE,CAAC;aACF,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC;AAED,SAAS,YAAY,CAAsC,IAAqB;IAC9E,OAAO,IAAI,KAAK,CAAC,EAAsC,EAAE;QACvD,GAAG,CAAC,OAAO,EAAE,IAAI;YACf,IAAI,IAAI,KAAK,MAAM;gBAAE,OAAO,IAAI,CAAC;YACjC,IAAI,OAAO,IAAI,KAAK,QAAQ;gBAAE,OAAO,CAAC,GAAY,EAAE,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACjF,OAAO,SAAS,CAAC;QACnB,CAAC;KACF,CAA8B,CAAC;AAClC,CAAC;AAED,qDAAqD;AACrD,MAAM,UAAU,SAAS,CAAC,CAAW;IACnC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC;AACnB,CAAC;AAgBD,MAAM,UAAU,YAAY,CAAsC,IAEjE;IACC,MAAM,MAAM,GAA8B,EAAE,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QACpB,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,EAAE,MAAM,EAAyB,CAAC;AAC3C,CAAC;AAED,oGAAoG;AACpG,EAAE;AACF,mGAAmG;AACnG,sGAAsG;AACtG,6FAA6F;AAE7F,mGAAmG;AACnG,MAAM,kBAAkB,GAAkB,MAAM,CAAC,qBAAqB,CAAC,CAAC;AAqBxE;;;;GAIG;AACH,MAAM,UAAU,GAAG,CACjB,OAAsB,EACtB,KAAoB,EACpB,OAA8D;IAE9D,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACpC,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAsB,CAAW,CAAC,CAAC;IAC/E,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,CAAC,kBAAkB,CAAC,EAAE,IAAI,EAAE,CAAC;AAC1F,CAAC;AAED;yGACyG;AACzG,MAAM,UAAU,mBAAmB,CAA4C,IAAO;IACpF,OAAO,IAAI,CAAC;AACd,CAAC;AAED,0FAA0F;AAC1F,MAAM,UAAU,cAAc,CAAC,CAAU;IACvC,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,IAAK,CAA8B,CAAC,kBAAkB,CAAC,KAAK,IAAI,CAAC;AAC7G,CAAC;AAED,6FAA6F;AAC7F,MAAM,UAAU,SAAS,CAAC,IAAe;IACvC,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC1C,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;AACjC,CAAC;AAED;;;;gBAIgB;AAChB,MAAM,UAAU,sBAAsB,CACpC,MAAiB;IAEjB,OAAO,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;SAC9B,IAAI,EAAE;SACN,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAClE,CAAC"}