@rayfold/conformance 0.1.0

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,10 @@
+Rayfold
+Copyright 2026 The Rayfold Authors
+
+This product is licensed under the Apache License, Version 2.0 (see LICENSE).
+
+The data in data/gutenberg.json.gz is derived from the Project Gutenberg catalogue
+(https://www.gutenberg.org/ebooks/offline_catalogs.html) and is not covered by this
+project's copyright. See data/README.md for its source. Project Gutenberg is a
+registered trademark of the Project Gutenberg Literary Archive Foundation; Rayfold is
+not affiliated with or endorsed by Project Gutenberg.

package/README.md

@@ -0,0 +1,29 @@
+# @rayfold/conformance
+
+The shared test cases that every Rayfold implementation must pass. The TypeScript and Kotlin runtimes both run them.
+If you write a Rayfold server in another language, run these and you can show it behaves like the reference.
+
+What the package contains:
+
+- `fixtures/core/*.json`: one file per topic (default views, shapes, pipelining, commands, errors, auth, defer,
+  streams, limits, trusted shapes, ...). Each file holds a `.rayfold` schema, its parsed IR, seed data, and cases:
+  a request, the viewer, and the exact frames expected back.
+- The harness the reference runtime uses (`seedStore`, `fixtureResolvers`, `groupFrames`): it turns a fixture's
+  data and declarative resolver specs into resolvers for `@rayfold/server`, so you can see how each case is meant
+  to be served.
+
+```ts
+import { readFileSync, readdirSync } from "node:fs";
+import { createRequire } from "node:module";
+import { dirname, join } from "node:path";
+
+const dir = join(dirname(createRequire(import.meta.url).resolve("@rayfold/conformance/package.json")), "fixtures/core");
+for (const file of readdirSync(dir)) {
+  const fixture = JSON.parse(readFileSync(join(dir, file), "utf8"));
+  console.log(file, fixture.cases.length, "cases");
+}
+```
+
+The fixture format is documented in `conformance/README.md` and `conformance/src/fixture.ts` in the Rayfold repository.
+
+Apache-2.0.

package/fixture.d.ts

@@ -0,0 +1,107 @@
+/**
+ * Conformance fixture format and the declarative resolver interpreter.
+ * Both runtimes (TS, Kotlin) implement this interpreter so fixtures need no code.
+ */
+import { type Frame, type PatchOp, type RequestEnvelope, type Resolvers } from "@rayfold/server";
+export interface Fixture {
+    name: string;
+    /** `.rayfold` schema text */
+    schema: string;
+    /** rows per type name; re-seeded before every case */
+    data: Record<string, Array<Record<string, unknown>>>;
+    resolvers: {
+        Query?: Record<string, QuerySpec>;
+        Command?: Record<string, CommandSpec>;
+        Stream?: Record<string, StreamSpec>;
+        fields?: Record<string, Record<string, FieldSpec>>;
+    };
+    options?: {
+        budget?: number;
+        maxDepth?: number;
+        trustedShapes?: boolean;
+        registerShapes?: string[];
+    };
+    cases: Case[];
+}
+export interface Case {
+    name: string;
+    viewer?: unknown;
+    request: RequestEnvelope;
+    /** Expected frames. Frames of different ops may interleave; per-op order must match. */
+    frames: Frame[];
+    /** Expected loader call counts, e.g. { "Book.author": 1 } */
+    calls?: Record<string, number>;
+    /** Run this many times in sequence against the same store (idempotency cases). */
+    repeat?: number;
+}
+/** Value templates: "$args.x.y", "$viewer.id", "$parent.field", "$row.field", literals. */
+type Tmpl = unknown;
+export interface QuerySpec {
+    from: string;
+    where?: Record<string, Tmpl>;
+    /** "one" returns the first match or null; "page" returns a Page from $args.page; "list" returns all matches */
+    mode: "one" | "page" | "list";
+    pageArg?: string;
+}
+export interface FieldSpec {
+    from: string;
+    /** parent field to match against row field: parent[key] == row[match] */
+    key: string;
+    match: string;
+    mode: "one" | "page" | "list";
+    pageArg?: string;
+}
+export interface CommandSpec {
+    /** conditions evaluated in order; the first one that matches throws */
+    fail?: Array<{
+        when: {
+            field: string;
+            op: "lt" | "eq" | "missing";
+            value?: Tmpl;
+            from?: string;
+            where?: Record<string, Tmpl>;
+        };
+        type?: string;
+        code?: string;
+        data?: Record<string, Tmpl>;
+        message?: string;
+    }>;
+    insert?: {
+        into: string;
+        row: Record<string, Tmpl>;
+        idPrefix?: string;
+    };
+    /** `merge` copies the keys present in a template object (partial updates); `version` names a @version field to check and bump */
+    update?: {
+        table: string;
+        where: Record<string, Tmpl>;
+        set?: Record<string, Tmpl | {
+            $add: Tmpl;
+        } | {
+            $sub: Tmpl;
+        }>;
+        merge?: Tmpl;
+        version?: string;
+    };
+    /** which row to return: "inserted" | "updated" */
+    returns: "inserted" | "updated";
+    patch?: PatchOp[];
+    emit?: Array<{
+        event: string;
+        payload: Record<string, Tmpl>;
+    }>;
+}
+export interface StreamSpec {
+    /** yields these items in order, then ends */
+    items: Array<Record<string, unknown>>;
+}
+export interface FixtureStore {
+    tables: Record<string, Array<Record<string, unknown>>>;
+    calls: Record<string, number>;
+    nextId: number;
+}
+export declare function seedStore(f: Fixture): FixtureStore;
+export declare function fixtureResolvers(f: Fixture, store: FixtureStore): Resolvers;
+/** Group frames by op id (batch-level frames under key "batch"), preserving per-op order. */
+export declare function groupFrames(frames: Frame[]): Record<string, Frame[]>;
+export {};

package/fixture.js

@@ -0,0 +1,161 @@
+/**
+ * Conformance fixture format and the declarative resolver interpreter.
+ * Both runtimes (TS, Kotlin) implement this interpreter so fixtures need no code.
+ */
+import { RayfoldError, ok } from "@rayfold/server";
+export function seedStore(f) {
+    return { tables: structuredClone(f.data), calls: {}, nextId: 1 };
+}
+function tmpl(v, env) {
+    if (typeof v === "string" && v.startsWith("$")) {
+        const [root, ...path] = v.slice(1).split(".");
+        let cur = env[root];
+        for (const p of path)
+            cur = cur && typeof cur === "object" ? cur[p] : undefined;
+        return cur === undefined ? null : cur;
+    }
+    if (Array.isArray(v))
+        return v.map((x) => tmpl(x, env));
+    if (v && typeof v === "object") {
+        const o = {};
+        for (const [k, x] of Object.entries(v))
+            o[k] = tmpl(x, env);
+        return o;
+    }
+    return v;
+}
+function matches(row, where, env) {
+    if (!where)
+        return true;
+    return Object.entries(where).every(([k, v]) => {
+        const want = tmpl(v, env);
+        return want === null ? true : String(row[k]) === String(want);
+    });
+}
+function page(rows, p) {
+    const first = p?.first ?? 20;
+    let start = 0;
+    if (p?.after) {
+        const i = rows.findIndex((r) => String(r["id"]) === p.after);
+        start = i < 0 ? rows.length : i + 1;
+    }
+    const items = rows.slice(start, start + first);
+    return { items, cursor: items.length ? String(items[items.length - 1]["id"]) : null, hasMore: start + first < rows.length, total: rows.length };
+}
+function count(store, k) {
+    store.calls[k] = (store.calls[k] ?? 0) + 1;
+}
+export function fixtureResolvers(f, store) {
+    const r = { Query: {}, Command: {}, Stream: {} };
+    const table = (name) => store.tables[name] ?? (store.tables[name] = []);
+    for (const [name, spec] of Object.entries(f.resolvers.Query ?? {})) {
+        r.Query[name] = (args, ctx) => {
+            count(store, `Query.${name}`);
+            const env = { args, viewer: ctx.viewer };
+            const rows = table(spec.from).filter((row) => matches(row, spec.where, env));
+            if (spec.mode === "one")
+                return rows[0] ?? null;
+            if (spec.mode === "list")
+                return rows;
+            return page(rows, args[spec.pageArg ?? "page"]);
+        };
+    }
+    for (const [type, fields] of Object.entries(f.resolvers.fields ?? {})) {
+        r[type] = {};
+        for (const [field, spec] of Object.entries(fields)) {
+            r[type][field] = ((parents, args) => {
+                count(store, `${type}.${field}`);
+                const rows = table(spec.from);
+                return parents.map((p) => {
+                    const hits = rows.filter((row) => String(row[spec.match]) === String(p[spec.key]));
+                    if (spec.mode === "one")
+                        return hits[0] ?? null;
+                    if (spec.mode === "list")
+                        return hits;
+                    return page(hits, args[spec.pageArg ?? "page"]);
+                });
+            });
+        }
+    }
+    for (const [name, spec] of Object.entries(f.resolvers.Command ?? {})) {
+        r.Command[name] = (args, ctx) => {
+            count(store, `Command.${name}`);
+            const env = { args, viewer: ctx.viewer };
+            for (const fail of spec.fail ?? []) {
+                const w = fail.when;
+                let subject;
+                if (w.from)
+                    subject = table(w.from).find((row) => matches(row, w.where, env));
+                const actual = subject ? subject[w.field] : tmpl(`$args.${w.field}`, env);
+                const want = tmpl(w.value, { ...env, row: subject });
+                const hit = w.op === "missing" ? subject === undefined : w.op === "eq" ? String(actual) === String(want) : Number(actual) < Number(want);
+                if (hit) {
+                    const data = tmpl(fail.data ?? {}, { ...env, row: subject });
+                    if (fail.type)
+                        throw RayfoldError.domain(fail.type, data, fail.message ?? fail.type);
+                    throw new RayfoldError((fail.code ?? "failed_precondition"), fail.message ?? fail.code ?? "failed");
+                }
+            }
+            let inserted;
+            let updated;
+            if (spec.update) {
+                updated = table(spec.update.table).find((row) => matches(row, spec.update.where, env));
+                if (!updated)
+                    throw new RayfoldError("not_found", "row not found");
+                const vf = spec.update.version;
+                if (vf)
+                    ctx.checkVersion(`${spec.update.table}:${String(updated["id"])}`, updated[vf], { ...updated });
+                const target = ctx.simulate ? { ...updated } : updated;
+                if (spec.update.merge !== undefined) {
+                    const src = tmpl(spec.update.merge, env);
+                    if (src && typeof src === "object" && !Array.isArray(src))
+                        Object.assign(target, src);
+                }
+                if (vf)
+                    target[vf] = Number(target[vf]) + 1;
+                for (const [k, v] of Object.entries(spec.update.set ?? {})) {
+                    if (v && typeof v === "object" && "$add" in v)
+                        target[k] = Number(target[k]) + Number(tmpl(v.$add, env));
+                    else if (v && typeof v === "object" && "$sub" in v)
+                        target[k] = Number(target[k]) - Number(tmpl(v.$sub, env));
+                    else
+                        target[k] = tmpl(v, env);
+                }
+                updated = target;
+            }
+            if (spec.insert) {
+                inserted = { id: `${spec.insert.idPrefix ?? "n"}${store.nextId++}`, ...tmpl(spec.insert.row, env) };
+                if (!ctx.simulate)
+                    table(spec.insert.into).push(inserted);
+            }
+            const result = spec.returns === "inserted" ? inserted : updated;
+            const rowEnv = { ...env, row: result };
+            const extra = {};
+            if (spec.patch)
+                extra.patch = tmpl(spec.patch, rowEnv);
+            if (spec.emit)
+                extra.emit = spec.emit.map((e) => ({ event: e.event, payload: tmpl(e.payload, rowEnv) }));
+            return ok(result, extra);
+        };
+    }
+    for (const [name, spec] of Object.entries(f.resolvers.Stream ?? {})) {
+        r.Stream[name] = () => {
+            count(store, `Stream.${name}`);
+            return (async function* () {
+                for (const it of spec.items)
+                    yield it;
+            })();
+        };
+    }
+    return r;
+}
+/** Group frames by op id (batch-level frames under key "batch"), preserving per-op order. */
+export function groupFrames(frames) {
+    const out = {};
+    for (const f of frames) {
+        const k = "id" in f ? String(f.id) : "batch";
+        (out[k] ??= []).push(f);
+    }
+    return out;
+}
+//# sourceMappingURL=fixture.js.map

package/fixture.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fixture.js","sourceRoot":"","sources":["../src/fixture.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,YAAY,EAAE,EAAE,EAAuF,MAAM,iBAAiB,CAAC;AAyExI,MAAM,UAAU,SAAS,CAAC,CAAU;IAClC,OAAO,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;AACnE,CAAC;AAED,SAAS,IAAI,CAAC,CAAO,EAAE,GAA0E;IAC/F,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QAC/C,MAAM,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9C,IAAI,GAAG,GAAa,GAA+B,CAAC,IAAK,CAAC,CAAC;QAC3D,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,GAAG,GAAG,GAAG,IAAI,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAE,GAA+B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC7G,OAAO,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;IACxC,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACxD,IAAI,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;QAC/B,MAAM,CAAC,GAA4B,EAAE,CAAC;QACtC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;YAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC5D,OAAO,CAAC,CAAC;IACX,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,OAAO,CAAC,GAA4B,EAAE,KAAuC,EAAE,GAA+B;IACrH,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IACxB,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC1B,OAAO,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,IAAI,CAAC,IAAoC,EAAE,CAAsD;IACxG,MAAM,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC;IAC7B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;QACb,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;QAC7D,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACtC,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,KAAK,CAAC,CAAC;IAC/C,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;AACnJ,CAAC;AAED,SAAS,KAAK,CAAC,KAAmB,EAAE,CAAS;IAC3C,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AAC7C,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,CAAU,EAAE,KAAmB;IAC9D,MAAM,CAAC,GAAc,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IAC5D,MAAM,KAAK,GAAG,CAAC,IAAY,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;IAEhF,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE,CAAC;QACnE,CAAC,CAAC,KAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAA6B,EAAE,GAA0B,EAAE,EAAE;YAC7E,KAAK,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,CAAC,CAAC;YAC9B,MAAM,GAAG,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;YAC7E,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;gBAAE,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;YAChD,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;gBAAE,OAAO,IAAI,CAAC;YACtC,OAAO,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,MAAM,CAAU,CAAC,CAAC;QAC3D,CAAC,CAAC;IACJ,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,IAAI,EAAE,CAAC,EAAE,CAAC;QACtE,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;QACb,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACnD,CAAC,CAAC,IAAI,CAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,OAAuC,EAAE,IAA6B,EAAE,EAAE;gBAC5F,KAAK,CAAC,KAAK,EAAE,GAAG,IAAI,IAAI,KAAK,EAAE,CAAC,CAAC;gBACjC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC9B,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;oBACvB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACnF,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;wBAAE,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;oBAChD,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;wBAAE,OAAO,IAAI,CAAC;oBACtC,OAAO,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,MAAM,CAAU,CAAC,CAAC;gBAC3D,CAAC,CAAC,CAAC;YACL,CAAC,CAAU,CAAC;QACd,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC;QACrE,CAAC,CAAC,OAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,IAA6B,EAAE,GAA0B,EAAE,EAAE;YAC/E,KAAK,CAAC,KAAK,EAAE,WAAW,IAAI,EAAE,CAAC,CAAC;YAChC,MAAM,GAAG,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC;YACzC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC;gBACnC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;gBACpB,IAAI,OAA4C,CAAC;gBACjD,IAAI,CAAC,CAAC,IAAI;oBAAE,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;gBAC9E,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,GAAG,CAAC,CAAC;gBAC1E,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC;gBACrD,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;gBACzI,IAAI,GAAG,EAAE,CAAC;oBACR,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,CAA4B,CAAC;oBACxF,IAAI,IAAI,CAAC,IAAI;wBAAE,MAAM,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;oBACrF,MAAM,IAAI,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,qBAAqB,CAAU,EAAE,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,IAAI,IAAI,QAAQ,CAAC,CAAC;gBAC/G,CAAC;YACH,CAAC;YACD,IAAI,QAA6C,CAAC;YAClD,IAAI,OAA4C,CAAC;YACjD,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChB,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,MAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;gBACxF,IAAI,CAAC,OAAO;oBAAE,MAAM,IAAI,YAAY,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;gBACnE,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC;gBAC/B,IAAI,EAAE;oBAAE,GAAG,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,CAAC,CAAC;gBACvG,MAAM,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;gBACvD,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;oBACpC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;oBACzC,IAAI,GAAG,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;wBAAE,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;gBACxF,CAAC;gBACD,IAAI,EAAE;oBAAE,MAAM,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC5C,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,CAAC;oBAC3D,IAAI,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,IAAK,CAAY;wBAAE,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAE,CAAoB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;yBACpI,IAAI,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,IAAK,CAAY;wBAAE,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAE,CAAoB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;;wBACzI,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;gBAChC,CAAC;gBACD,OAAO,GAAG,MAAM,CAAC;YACnB,CAAC;YACD,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChB,QAAQ,GAAG,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,IAAI,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,EAAE,GAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAA6B,EAAE,CAAC;gBACjI,IAAI,CAAC,GAAG,CAAC,QAAQ;oBAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5D,CAAC;YACD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,KAAK,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC;YAChE,MAAM,MAAM,GAAG,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;YACvC,MAAM,KAAK,GAA6F,EAAE,CAAC;YAC3G,IAAI,IAAI,CAAC,KAAK;gBAAE,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAc,CAAC;YACpE,IAAI,IAAI,CAAC,IAAI;gBAAE,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,MAAM,CAA4B,EAAE,CAAC,CAAC,CAAC;YACpI,OAAO,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC3B,CAAC,CAAC;IACJ,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,IAAI,EAAE,CAAC,EAAE,CAAC;QACpE,CAAC,CAAC,MAAO,CAAC,IAAI,CAAC,GAAG,GAAG,EAAE;YACrB,KAAK,CAAC,KAAK,EAAE,UAAU,IAAI,EAAE,CAAC,CAAC;YAC/B,OAAO,CAAC,KAAK,SAAS,CAAC;gBACrB,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,KAAK;oBAAE,MAAM,EAAE,CAAC;YACxC,CAAC,CAAC,EAAE,CAAC;QACP,CAAC,CAAC;IACJ,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,6FAA6F;AAC7F,MAAM,UAAU,WAAW,CAAC,MAAe;IACzC,MAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;QAC7C,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC","sourcesContent":["/**\n * Conformance fixture format and the declarative resolver interpreter.\n * Both runtimes (TS, Kotlin) implement this interpreter so fixtures need no code.\n */\nimport { RayfoldError, ok, type Frame, type PatchOp, type RayfoldContext, type RequestEnvelope, type Resolvers } from \"@rayfold/server\";\n\nexport interface Fixture {\n  name: string;\n  /** `.rayfold` schema text */\n  schema: string;\n  /** rows per type name; re-seeded before every case */\n  data: Record<string, Array<Record<string, unknown>>>;\n  resolvers: {\n    Query?: Record<string, QuerySpec>;\n    Command?: Record<string, CommandSpec>;\n    Stream?: Record<string, StreamSpec>;\n    fields?: Record<string, Record<string, FieldSpec>>; // \"Type\": { \"field\": spec }\n  };\n  options?: { budget?: number; maxDepth?: number; trustedShapes?: boolean; registerShapes?: string[] };\n  cases: Case[];\n}\n\nexport interface Case {\n  name: string;\n  viewer?: unknown;\n  request: RequestEnvelope;\n  /** Expected frames. Frames of different ops may interleave; per-op order must match. */\n  frames: Frame[];\n  /** Expected loader call counts, e.g. { \"Book.author\": 1 } */\n  calls?: Record<string, number>;\n  /** Run this many times in sequence against the same store (idempotency cases). */\n  repeat?: number;\n}\n\n/** Value templates: \"$args.x.y\", \"$viewer.id\", \"$parent.field\", \"$row.field\", literals. */\ntype Tmpl = unknown;\n\nexport interface QuerySpec {\n  from: string;\n  where?: Record<string, Tmpl>;\n  /** \"one\" returns the first match or null; \"page\" returns a Page from $args.page; \"list\" returns all matches */\n  mode: \"one\" | \"page\" | \"list\";\n  pageArg?: string; // default \"page\"\n}\n\nexport interface FieldSpec {\n  from: string;\n  /** parent field to match against row field: parent[key] == row[match] */\n  key: string;\n  match: string;\n  mode: \"one\" | \"page\" | \"list\";\n  pageArg?: string;\n}\n\nexport interface CommandSpec {\n  /** conditions evaluated in order; the first one that matches throws */\n  fail?: Array<{ when: { field: string; op: \"lt\" | \"eq\" | \"missing\"; value?: Tmpl; from?: string; where?: Record<string, Tmpl> }; type?: string; code?: string; data?: Record<string, Tmpl>; message?: string }>;\n  insert?: { into: string; row: Record<string, Tmpl>; idPrefix?: string };\n  /** `merge` copies the keys present in a template object (partial updates); `version` names a @version field to check and bump */\n  update?: { table: string; where: Record<string, Tmpl>; set?: Record<string, Tmpl | { $add: Tmpl } | { $sub: Tmpl }>; merge?: Tmpl; version?: string };\n  /** which row to return: \"inserted\" | \"updated\" */\n  returns: \"inserted\" | \"updated\";\n  patch?: PatchOp[];\n  emit?: Array<{ event: string; payload: Record<string, Tmpl> }>;\n}\n\nexport interface StreamSpec {\n  /** yields these items in order, then ends */\n  items: Array<Record<string, unknown>>;\n}\n\nexport interface FixtureStore {\n  tables: Record<string, Array<Record<string, unknown>>>;\n  calls: Record<string, number>;\n  nextId: number;\n}\n\nexport function seedStore(f: Fixture): FixtureStore {\n  return { tables: structuredClone(f.data), calls: {}, nextId: 1 };\n}\n\nfunction tmpl(v: Tmpl, env: { args?: unknown; viewer?: unknown; parent?: unknown; row?: unknown }): unknown {\n  if (typeof v === \"string\" && v.startsWith(\"$\")) {\n    const [root, ...path] = v.slice(1).split(\".\");\n    let cur: unknown = (env as Record<string, unknown>)[root!];\n    for (const p of path) cur = cur && typeof cur === \"object\" ? (cur as Record<string, unknown>)[p] : undefined;\n    return cur === undefined ? null : cur;\n  }\n  if (Array.isArray(v)) return v.map((x) => tmpl(x, env));\n  if (v && typeof v === \"object\") {\n    const o: Record<string, unknown> = {};\n    for (const [k, x] of Object.entries(v)) o[k] = tmpl(x, env);\n    return o;\n  }\n  return v;\n}\n\nfunction matches(row: Record<string, unknown>, where: Record<string, Tmpl> | undefined, env: Parameters<typeof tmpl>[1]): boolean {\n  if (!where) return true;\n  return Object.entries(where).every(([k, v]) => {\n    const want = tmpl(v, env);\n    return want === null ? true : String(row[k]) === String(want);\n  });\n}\n\nfunction page(rows: Array<Record<string, unknown>>, p: { first: number; after: string | null } | undefined) {\n  const first = p?.first ?? 20;\n  let start = 0;\n  if (p?.after) {\n    const i = rows.findIndex((r) => String(r[\"id\"]) === p.after);\n    start = i < 0 ? rows.length : i + 1;\n  }\n  const items = rows.slice(start, start + first);\n  return { items, cursor: items.length ? String(items[items.length - 1]![\"id\"]) : null, hasMore: start + first < rows.length, total: rows.length };\n}\n\nfunction count(store: FixtureStore, k: string): void {\n  store.calls[k] = (store.calls[k] ?? 0) + 1;\n}\n\nexport function fixtureResolvers(f: Fixture, store: FixtureStore): Resolvers {\n  const r: Resolvers = { Query: {}, Command: {}, Stream: {} };\n  const table = (name: string) => store.tables[name] ?? (store.tables[name] = []);\n\n  for (const [name, spec] of Object.entries(f.resolvers.Query ?? {})) {\n    r.Query![name] = (args: Record<string, unknown>, ctx: RayfoldContext<never>) => {\n      count(store, `Query.${name}`);\n      const env = { args, viewer: ctx.viewer };\n      const rows = table(spec.from).filter((row) => matches(row, spec.where, env));\n      if (spec.mode === \"one\") return rows[0] ?? null;\n      if (spec.mode === \"list\") return rows;\n      return page(rows, args[spec.pageArg ?? \"page\"] as never);\n    };\n  }\n  for (const [type, fields] of Object.entries(f.resolvers.fields ?? {})) {\n    r[type] = {};\n    for (const [field, spec] of Object.entries(fields)) {\n      r[type]![field] = ((parents: Array<Record<string, unknown>>, args: Record<string, unknown>) => {\n        count(store, `${type}.${field}`);\n        const rows = table(spec.from);\n        return parents.map((p) => {\n          const hits = rows.filter((row) => String(row[spec.match]) === String(p[spec.key]));\n          if (spec.mode === \"one\") return hits[0] ?? null;\n          if (spec.mode === \"list\") return hits;\n          return page(hits, args[spec.pageArg ?? \"page\"] as never);\n        });\n      }) as never;\n    }\n  }\n  for (const [name, spec] of Object.entries(f.resolvers.Command ?? {})) {\n    r.Command![name] = (args: Record<string, unknown>, ctx: RayfoldContext<never>) => {\n      count(store, `Command.${name}`);\n      const env = { args, viewer: ctx.viewer };\n      for (const fail of spec.fail ?? []) {\n        const w = fail.when;\n        let subject: Record<string, unknown> | undefined;\n        if (w.from) subject = table(w.from).find((row) => matches(row, w.where, env));\n        const actual = subject ? subject[w.field] : tmpl(`$args.${w.field}`, env);\n        const want = tmpl(w.value, { ...env, row: subject });\n        const hit = w.op === \"missing\" ? subject === undefined : w.op === \"eq\" ? String(actual) === String(want) : Number(actual) < Number(want);\n        if (hit) {\n          const data = tmpl(fail.data ?? {}, { ...env, row: subject }) as Record<string, unknown>;\n          if (fail.type) throw RayfoldError.domain(fail.type, data, fail.message ?? fail.type);\n          throw new RayfoldError((fail.code ?? \"failed_precondition\") as never, fail.message ?? fail.code ?? \"failed\");\n        }\n      }\n      let inserted: Record<string, unknown> | undefined;\n      let updated: Record<string, unknown> | undefined;\n      if (spec.update) {\n        updated = table(spec.update.table).find((row) => matches(row, spec.update!.where, env));\n        if (!updated) throw new RayfoldError(\"not_found\", \"row not found\");\n        const vf = spec.update.version;\n        if (vf) ctx.checkVersion(`${spec.update.table}:${String(updated[\"id\"])}`, updated[vf], { ...updated });\n        const target = ctx.simulate ? { ...updated } : updated;\n        if (spec.update.merge !== undefined) {\n          const src = tmpl(spec.update.merge, env);\n          if (src && typeof src === \"object\" && !Array.isArray(src)) Object.assign(target, src);\n        }\n        if (vf) target[vf] = Number(target[vf]) + 1;\n        for (const [k, v] of Object.entries(spec.update.set ?? {})) {\n          if (v && typeof v === \"object\" && \"$add\" in (v as object)) target[k] = Number(target[k]) + Number(tmpl((v as { $add: Tmpl }).$add, env));\n          else if (v && typeof v === \"object\" && \"$sub\" in (v as object)) target[k] = Number(target[k]) - Number(tmpl((v as { $sub: Tmpl }).$sub, env));\n          else target[k] = tmpl(v, env);\n        }\n        updated = target;\n      }\n      if (spec.insert) {\n        inserted = { id: `${spec.insert.idPrefix ?? \"n\"}${store.nextId++}`, ...(tmpl(spec.insert.row, env) as Record<string, unknown>) };\n        if (!ctx.simulate) table(spec.insert.into).push(inserted);\n      }\n      const result = spec.returns === \"inserted\" ? inserted : updated;\n      const rowEnv = { ...env, row: result };\n      const extra: { patch?: PatchOp[]; emit?: Array<{ event: string; payload: Record<string, unknown> }> } = {};\n      if (spec.patch) extra.patch = tmpl(spec.patch, rowEnv) as PatchOp[];\n      if (spec.emit) extra.emit = spec.emit.map((e) => ({ event: e.event, payload: tmpl(e.payload, rowEnv) as Record<string, unknown> }));\n      return ok(result, extra);\n    };\n  }\n  for (const [name, spec] of Object.entries(f.resolvers.Stream ?? {})) {\n    r.Stream![name] = () => {\n      count(store, `Stream.${name}`);\n      return (async function* () {\n        for (const it of spec.items) yield it;\n      })();\n    };\n  }\n  return r;\n}\n\n/** Group frames by op id (batch-level frames under key \"batch\"), preserving per-op order. */\nexport function groupFrames(frames: Frame[]): Record<string, Frame[]> {\n  const out: Record<string, Frame[]> = {};\n  for (const f of frames) {\n    const k = \"id\" in f ? String(f.id) : \"batch\";\n    (out[k] ??= []).push(f);\n  }\n  return out;\n}\n"]}