@rayfold/server 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,70 @@
+# @rayfold/server
+
+The Rayfold server for Node.js. Give it a schema and resolvers. It serves batches with pipelining, applies the
+policies, costs and cache rules the schema declares, pushes live-query updates, and can expose REST bindings,
+OpenAPI 3.2 and an MCP endpoint from the same schema.
+
+```sh
+npm install @rayfold/server
+```
+
+```ts
+import { createRayfoldServer, listen } from "@rayfold/server";
+
+interface Book { id: string; title: string; stock: number }
+const books = new Map<string, Book>([["b1", { id: "b1", title: "Dune", stock: 3 }]]);
+
+const server = createRayfoldServer({
+  schema: `
+    entity Book {
+      id: ID
+      title: String
+      stock: Int
+    }
+    query book(id: ID): Book?
+    command restock(id: ID, qty: Int): Book
+  `,
+  resolvers: {
+    Query: {
+      book: ({ id }: { id: string }) => books.get(id) ?? null,
+    },
+    Command: {
+      // The returned entity becomes a cache patch, so every client showing Book:b1 updates without refetching.
+      restock: ({ id, qty }: { id: string; qty: number }) => {
+        const book = books.get(id);
+        if (!book) throw new Error(`no book ${id}`);
+        book.stock += qty;
+        return book;
+      },
+    },
+  },
+});
+
+// Commands need a signed-in viewer: turn the request into one (here, a fixed demo token).
+await listen(server, 4000, {
+  viewer: (req) => (req.headers.authorization === "Bearer demo" ? { id: "demo-user" } : null),
+});
+```
+
+`POST /rayfold` now answers batches:
+
+```sh
+curl -s localhost:4000/rayfold -H 'content-type: application/rayfold+json' -H 'rayfold-safe: true' \
+  -d '{"rayfold":"0.1","ops":[{"id":1,"op":"book","args":{"id":"b1"}}]}'
+```
+
+What else is in the package:
+
+| Export | What it does |
+|---|---|
+| `createHttpHandler(server, options)` | The same endpoint as a plain `(req, res)` handler for your own `http` server, Express or Fastify. |
+| `attachWebSocket(server, httpServer)` | Batches and live queries over one WebSocket. |
+| `createBindingHandler(server)` | REST routes from `@http(...)` annotations in the schema. |
+| `openApiFor(server)` | An OpenAPI 3.2 document for those routes. |
+| `createMcpHandler(server)` | The schema as an MCP server: commands become tools, queries become resources. |
+
+Security defaults: JSON-only bodies, an Origin check on state-changing requests, a Host check on loopback servers,
+a 1 MiB body limit, nesting and cost limits, and a redacted manifest. See `spec/12-security.md` in the Rayfold
+repository.
+
+Apache-2.0.

package/args.d.ts

@@ -0,0 +1,15 @@
+/** Argument validation and coercion at the system boundary. */
+import { type Annotation, type ArgDef, type RayfoldSchemaIR, type TypeRef } from "@rayfold/schema";
+export declare function coerceArgs(ir: RayfoldSchemaIR, defs: ArgDef[], raw: unknown, path: string): Record<string, unknown>;
+/**
+ * Declarative value constraints from the schema (spec 01 section 4): `@range(min, max)` on numbers and
+ * on string/list lengths. Enforced before any resolver runs, so a bad value never causes a side effect.
+ */
+export declare function checkConstraints(annotations: Annotation[], t: TypeRef, v: unknown, path: string): void;
+export declare function coerceValue(ir: RayfoldSchemaIR, t: TypeRef, v: unknown, path: string): unknown;
+export declare function coerceScalar(name: string, v: unknown, path: string): unknown;
+/** Replace `{ "$ref": "id.path" }` objects with values from earlier results. Spec 03 §2. */
+export declare function resolveRefs(value: unknown, lookup: (opId: number, path: string[]) => unknown, at: string): unknown;
+/** Ids of ops referenced by `$ref` anywhere inside `value`. */
+export declare function collectRefs(value: unknown, out?: Set<number>): Set<number>;
+export declare function getPath(value: unknown, path: string[]): unknown;

package/args.js

@@ -0,0 +1,226 @@
+/** Argument validation and coercion at the system boundary. */
+import { typeRefToString } from "@rayfold/schema";
+import { RayfoldError } from "./protocol.js";
+const MAX_PAGE_FIRST = 200;
+const NUMERIC = new Set(["Int", "Long", "Float", "Decimal"]);
+export function coerceArgs(ir, defs, raw, path) {
+    if (raw !== undefined && (raw === null || typeof raw !== "object" || Array.isArray(raw))) {
+        throw new RayfoldError("invalid_argument", `${path}: expected an object`);
+    }
+    const input = (raw ?? {});
+    for (const k of Object.keys(input)) {
+        if (!defs.some((d) => d.name === k))
+            throw new RayfoldError("invalid_argument", `${path}.${k}: unknown argument`);
+    }
+    const out = {};
+    for (const d of defs) {
+        const v = input[d.name];
+        const p = `${path}.${d.name}`;
+        if (v === undefined) {
+            if (d.default !== undefined) {
+                out[d.name] = coerceValue(ir, d.type, d.default, p);
+                continue;
+            }
+            if (!d.type.nullable)
+                throw new RayfoldError("invalid_argument", `${p}: required`);
+            continue; // absent stays absent: partial updates (PATCH) depend on the difference from null
+        }
+        if (v === null) {
+            // An explicit null is never replaced by the default: the caller asked for null.
+            if (!d.type.nullable)
+                throw new RayfoldError("invalid_argument", d.default === undefined ? `${p}: required` : `${p}: must not be null`);
+            out[d.name] = null;
+            continue;
+        }
+        out[d.name] = coerceValue(ir, d.type, v, p);
+        checkConstraints(d.annotations, d.type, out[d.name], p);
+    }
+    return out;
+}
+/**
+ * Declarative value constraints from the schema (spec 01 section 4): `@range(min, max)` on numbers and
+ * on string/list lengths. Enforced before any resolver runs, so a bad value never causes a side effect.
+ */
+export function checkConstraints(annotations, t, v, path) {
+    if (v === null || v === undefined)
+        return;
+    const range = annotations.find((a) => a.name === "range");
+    if (range) {
+        const min = typeof range.args["min"] === "number" ? range.args["min"] : undefined;
+        const max = typeof range.args["max"] === "number" ? range.args["max"] : undefined;
+        // The declared type decides: a String "1984" is four characters long, a Decimal "10.50" is a value.
+        const n = t.kind === "list" ? (Array.isArray(v) ? v.length : undefined)
+            : NUMERIC.has(t.name) ? (typeof v === "number" ? v : typeof v === "string" ? Number(v) : undefined)
+                : typeof v === "string" ? v.length
+                    : undefined;
+        if (n !== undefined) {
+            if (min !== undefined && n < min)
+                throw new RayfoldError("invalid_argument", `${path}: must be >= ${min}`);
+            if (max !== undefined && n > max)
+                throw new RayfoldError("invalid_argument", `${path}: must be <= ${max}`);
+        }
+    }
+    const fmt = annotations.find((a) => a.name === "format");
+    const pattern = fmt?.args["pattern"];
+    if (typeof pattern === "string" && typeof v === "string" && !new RegExp(pattern).test(v))
+        throw new RayfoldError("invalid_argument", `${path}: must match ${pattern}`);
+}
+export function coerceValue(ir, t, v, path) {
+    if (v === null || v === undefined) {
+        if (t.nullable)
+            return null;
+        throw new RayfoldError("invalid_argument", `${path}: must not be null`);
+    }
+    if (t.kind === "list") {
+        if (!Array.isArray(v))
+            throw new RayfoldError("invalid_argument", `${path}: expected a list`);
+        return v.map((x, i) => coerceValue(ir, t.of, x, `${path}.${i}`));
+    }
+    const def = ir.types[t.name];
+    if (!def)
+        throw new RayfoldError("internal", `${path}: unknown type ${t.name}`);
+    switch (def.kind) {
+        case "scalar":
+            return coerceScalar(t.name, v, path);
+        case "enum":
+            if (typeof v !== "string" || !def.values.some((x) => x.name === v)) {
+                throw new RayfoldError("invalid_argument", `${path}: expected one of ${def.values.map((x) => x.name).join(", ")}`);
+            }
+            return v;
+        case "input": {
+            if (typeof v !== "object" || Array.isArray(v))
+                throw new RayfoldError("invalid_argument", `${path}: expected ${t.name}`);
+            const obj = coerceArgs(ir, def.fields.map(fieldAsArg), v, path);
+            if (t.name === "PageArgs") {
+                const first = obj["first"];
+                if (typeof first === "number" && first > MAX_PAGE_FIRST)
+                    obj["first"] = MAX_PAGE_FIRST;
+                if (typeof first === "number" && first < 0)
+                    throw new RayfoldError("invalid_argument", `${path}.first: must be >= 0`);
+                const offset = obj["offset"];
+                if (typeof offset === "number" && offset < 0)
+                    throw new RayfoldError("invalid_argument", `${path}.offset: must be >= 0`);
+            }
+            return obj;
+        }
+        default:
+            throw new RayfoldError("invalid_argument", `${path}: ${typeRefToString(t)} is not an input type`);
+    }
+}
+function fieldAsArg(f) {
+    const a = { name: f.name, type: f.type, annotations: f.annotations };
+    if (f.default !== undefined)
+        a.default = f.default;
+    return a;
+}
+const RFC3339 = /^\d{4}-\d{2}-\d{2}T\d{2}:\d{2}:\d{2}(\.\d+)?(Z|[+-]\d{2}:\d{2})$/;
+const DATE = /^\d{4}-\d{2}-\d{2}$/;
+const DECIMAL = /^-?\d+(\.\d+)?$/;
+export function coerceScalar(name, v, path) {
+    const bad = (want) => {
+        throw new RayfoldError("invalid_argument", `${path}: expected ${want}`);
+    };
+    switch (name) {
+        case "ID":
+            if (typeof v === "string" && v.length > 0)
+                return v;
+            if (typeof v === "number" && Number.isSafeInteger(v))
+                return String(v);
+            return bad("ID");
+        case "String":
+            return typeof v === "string" ? v : bad("String");
+        case "Int":
+            return typeof v === "number" && Number.isInteger(v) && Math.abs(v) <= 2_147_483_647 ? v : bad("Int");
+        case "Long":
+            if (typeof v === "number" && Number.isSafeInteger(v))
+                return v; // larger values lose digits as JSON numbers: send them as text
+            if (typeof v === "string" && /^-?\d+$/.test(v))
+                return v;
+            return bad("Long");
+        case "Float":
+            return typeof v === "number" && Number.isFinite(v) ? v : bad("Float");
+        case "Boolean":
+            return typeof v === "boolean" ? v : bad("Boolean");
+        case "Decimal":
+            if (typeof v === "string" && DECIMAL.test(v))
+                return v;
+            if (typeof v === "number" && Number.isFinite(v) && DECIMAL.test(String(v)))
+                return String(v); // 1e21 would become "1e+21"
+            return bad("Decimal");
+        case "Instant":
+            return typeof v === "string" && RFC3339.test(v) ? v : bad("Instant (RFC 3339)");
+        case "Date":
+            return typeof v === "string" && DATE.test(v) ? v : bad("Date (YYYY-MM-DD)");
+        case "Duration":
+            if (typeof v === "number" && v >= 0)
+                return v;
+            if (typeof v === "string" && /^\d+(ms|s|m|h|d)$/.test(v))
+                return v;
+            return bad("Duration");
+        case "Bytes":
+            return typeof v === "string" && /^[A-Za-z0-9_-]*$/.test(v) ? v : bad("Bytes (base64url)");
+        case "JSON":
+            return v;
+        default:
+            // user-defined scalar: accept any JSON scalar
+            return typeof v === "object" ? bad(`scalar ${name}`) : v;
+    }
+}
+/** Replace `{ "$ref": "id.path" }` objects with values from earlier results. Spec 03 §2. */
+export function resolveRefs(value, lookup, at) {
+    if (value === null || typeof value !== "object")
+        return value;
+    if (Array.isArray(value))
+        return value.map((x, i) => resolveRefs(x, lookup, `${at}.${i}`));
+    const obj = value;
+    const ref = obj["$ref"];
+    if (typeof ref === "string" && Object.keys(obj).length === 1) {
+        const [idText, ...path] = ref.split(".");
+        const id = Number(idText);
+        if (!Number.isInteger(id) || id <= 0)
+            throw new RayfoldError("invalid_argument", `${at}: bad $ref ${JSON.stringify(ref)}`);
+        const v = lookup(id, path);
+        if (v === undefined)
+            throw new RayfoldError("invalid_argument", `${at}: $ref ${ref} resolved to nothing`);
+        return v;
+    }
+    const out = {};
+    for (const [k, v] of Object.entries(obj))
+        out[k] = resolveRefs(v, lookup, `${at}.${k}`);
+    return out;
+}
+/** Ids of ops referenced by `$ref` anywhere inside `value`. */
+export function collectRefs(value, out = new Set()) {
+    if (value === null || typeof value !== "object")
+        return out;
+    if (Array.isArray(value)) {
+        value.forEach((x) => collectRefs(x, out));
+        return out;
+    }
+    const obj = value;
+    const ref = obj["$ref"];
+    if (typeof ref === "string" && Object.keys(obj).length === 1) {
+        out.add(Number(ref.split(".")[0]));
+        return out;
+    }
+    for (const v of Object.values(obj))
+        collectRefs(v, out);
+    return out;
+}
+export function getPath(value, path) {
+    let cur = value;
+    for (const p of path) {
+        if (cur === null || cur === undefined || typeof cur !== "object")
+            return undefined;
+        if (Array.isArray(cur)) {
+            cur = cur[Number(p)];
+            continue;
+        }
+        // own data only: "__proto__", "constructor" and friends are never reachable through a $ref path
+        if (!Object.prototype.hasOwnProperty.call(cur, p))
+            return undefined;
+        cur = cur[p];
+    }
+    return cur;
+}
+//# sourceMappingURL=args.js.map

package/args.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"args.js","sourceRoot":"","sources":["../src/args.ts"],"names":[],"mappings":"AAAA,+DAA+D;AAC/D,OAAO,EAAE,eAAe,EAAmF,MAAM,iBAAiB,CAAC;AACnI,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAE7C,MAAM,cAAc,GAAG,GAAG,CAAC;AAC3B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC;AAE7D,MAAM,UAAU,UAAU,CAAC,EAAmB,EAAE,IAAc,EAAE,GAAY,EAAE,IAAY;IACxF,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QACzF,MAAM,IAAI,YAAY,CAAC,kBAAkB,EAAE,GAAG,IAAI,sBAAsB,CAAC,CAAC;IAC5E,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,EAAE,CAA4B,CAAC;IACrD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACnC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC;YAAE,MAAM,IAAI,YAAY,CAAC,kBAAkB,EAAE,GAAG,IAAI,IAAI,CAAC,oBAAoB,CAAC,CAAC;IACpH,CAAC;IACD,MAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,IAAI,CAAC,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC5B,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;gBACpD,SAAS;YACX,CAAC;YACD,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ;gBAAE,MAAM,IAAI,YAAY,CAAC,kBAAkB,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;YACnF,SAAS,CAAC,kFAAkF;QAC9F,CAAC;QACD,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACf,gFAAgF;YAChF,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ;gBAAE,MAAM,IAAI,YAAY,CAAC,kBAAkB,EAAE,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC;YACxI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YACnB,SAAS;QACX,CAAC;QACD,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5C,gBAAgB,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,WAAyB,EAAE,CAAU,EAAE,CAAU,EAAE,IAAY;IAC9F,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO;IAC1C,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;IAC1D,IAAI,KAAK,EAAE,CAAC;QACV,MAAM,GAAG,GAAG,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAClF,MAAM,GAAG,GAAG,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAClF,oGAAoG;QACpG,MAAM,CAAC,GACL,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;YAC7D,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;gBACnG,CAAC,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM;oBAClC,CAAC,CAAC,SAAS,CAAC;QACd,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,GAAG,GAAG;gBAAE,MAAM,IAAI,YAAY,CAAC,kBAAkB,EAAE,GAAG,IAAI,gBAAgB,GAAG,EAAE,CAAC,CAAC;YAC3G,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,GAAG,GAAG;gBAAE,MAAM,IAAI,YAAY,CAAC,kBAAkB,EAAE,GAAG,IAAI,gBAAgB,GAAG,EAAE,CAAC,CAAC;QAC7G,CAAC;IACH,CAAC;IACD,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;IACzD,MAAM,OAAO,GAAG,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IACrC,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,YAAY,CAAC,kBAAkB,EAAE,GAAG,IAAI,gBAAgB,OAAO,EAAE,CAAC,CAAC;AACzK,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,EAAmB,EAAE,CAAU,EAAE,CAAU,EAAE,IAAY;IACnF,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QAClC,IAAI,CAAC,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC;QAC5B,MAAM,IAAI,YAAY,CAAC,kBAAkB,EAAE,GAAG,IAAI,oBAAoB,CAAC,CAAC;IAC1E,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,YAAY,CAAC,kBAAkB,EAAE,GAAG,IAAI,mBAAmB,CAAC,CAAC;QAC9F,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACnE,CAAC;IACD,MAAM,GAAG,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC7B,IAAI,CAAC,GAAG;QAAE,MAAM,IAAI,YAAY,CAAC,UAAU,EAAE,GAAG,IAAI,kBAAkB,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAChF,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,QAAQ;YACX,OAAO,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACvC,KAAK,MAAM;YACT,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC;gBACnE,MAAM,IAAI,YAAY,CAAC,kBAAkB,EAAE,GAAG,IAAI,qBAAqB,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACrH,CAAC;YACD,OAAO,CAAC,CAAC;QACX,KAAK,OAAO,EAAE,CAAC;YACb,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;gBAAE,MAAM,IAAI,YAAY,CAAC,kBAAkB,EAAE,GAAG,IAAI,cAAc,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YACzH,MAAM,GAAG,GAAG,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YAChE,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBAC1B,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC3B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,GAAG,cAAc;oBAAE,GAAG,CAAC,OAAO,CAAC,GAAG,cAAc,CAAC;gBACvF,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,GAAG,CAAC;oBAAE,MAAM,IAAI,YAAY,CAAC,kBAAkB,EAAE,GAAG,IAAI,sBAAsB,CAAC,CAAC;gBACtH,MAAM,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC7B,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,GAAG,CAAC;oBAAE,MAAM,IAAI,YAAY,CAAC,kBAAkB,EAAE,GAAG,IAAI,uBAAuB,CAAC,CAAC;YAC3H,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QACD;YACE,MAAM,IAAI,YAAY,CAAC,kBAAkB,EAAE,GAAG,IAAI,KAAK,eAAe,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC;IACtG,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CAAC,CAAW;IAC7B,MAAM,CAAC,GAAW,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;IAC7E,IAAI,CAAC,CAAC,OAAO,KAAK,SAAS;QAAE,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC;IACnD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,MAAM,OAAO,GAAG,kEAAkE,CAAC;AACnF,MAAM,IAAI,GAAG,qBAAqB,CAAC;AACnC,MAAM,OAAO,GAAG,iBAAiB,CAAC;AAElC,MAAM,UAAU,YAAY,CAAC,IAAY,EAAE,CAAU,EAAE,IAAY;IACjE,MAAM,GAAG,GAAG,CAAC,IAAY,EAAS,EAAE;QAClC,MAAM,IAAI,YAAY,CAAC,kBAAkB,EAAE,GAAG,IAAI,cAAc,IAAI,EAAE,CAAC,CAAC;IAC1E,CAAC,CAAC;IACF,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,IAAI;YACP,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;gBAAE,OAAO,CAAC,CAAC;YACpD,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC;gBAAE,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;YACvE,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC;QACnB,KAAK,QAAQ;YACX,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACnD,KAAK,KAAK;YACR,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACvG,KAAK,MAAM;YACT,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC,CAAC,+DAA+D;YAC/H,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC;YACzD,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC;QACrB,KAAK,OAAO;YACV,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACxE,KAAK,SAAS;YACZ,OAAO,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACrD,KAAK,SAAS;YACZ,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC;YACvD,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,4BAA4B;YAC1H,OAAO,GAAG,CAAC,SAAS,CAAC,CAAC;QACxB,KAAK,SAAS;YACZ,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC;QAClF,KAAK,MAAM;YACT,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;QAC9E,KAAK,UAAU;YACb,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,IAAI,CAAC;gBAAE,OAAO,CAAC,CAAC;YAC9C,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC;YACnE,OAAO,GAAG,CAAC,UAAU,CAAC,CAAC;QACzB,KAAK,OAAO;YACV,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;QAC5F,KAAK,MAAM;YACT,OAAO,CAAC,CAAC;QACX;YACE,8CAA8C;YAC9C,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC;AACH,CAAC;AAED,4FAA4F;AAC5F,MAAM,UAAU,WAAW,CAAC,KAAc,EAAE,MAAiD,EAAE,EAAU;IACvG,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC9D,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3F,MAAM,GAAG,GAAG,KAAgC,CAAC;IAC7C,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;IACxB,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7D,MAAM,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC1B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;YAAE,MAAM,IAAI,YAAY,CAAC,kBAAkB,EAAE,GAAG,EAAE,cAAc,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3H,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,SAAS;YAAE,MAAM,IAAI,YAAY,CAAC,kBAAkB,EAAE,GAAG,EAAE,UAAU,GAAG,sBAAsB,CAAC,CAAC;QAC1G,OAAO,CAAC,CAAC;IACX,CAAC;IACD,MAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC;QAAE,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;IACxF,OAAO,GAAG,CAAC;AACb,CAAC;AAED,+DAA+D;AAC/D,MAAM,UAAU,WAAW,CAAC,KAAc,EAAE,GAAG,GAAG,IAAI,GAAG,EAAU;IACjE,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,GAAG,CAAC;IAC5D,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QAC1C,OAAO,GAAG,CAAC;IACb,CAAC;IACD,MAAM,GAAG,GAAG,KAAgC,CAAC;IAC7C,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;IACxB,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7D,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,OAAO,GAAG,CAAC;IACb,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC;QAAE,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACxD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,OAAO,CAAC,KAAc,EAAE,IAAc;IACpD,IAAI,GAAG,GAAG,KAAK,CAAC;IAChB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS,IAAI,OAAO,GAAG,KAAK,QAAQ;YAAE,OAAO,SAAS,CAAC;QACnF,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,SAAS;QACX,CAAC;QACD,gGAAgG;QAChG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QACpE,GAAG,GAAI,GAA+B,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC","sourcesContent":["/** Argument validation and coercion at the system boundary. */\nimport { typeRefToString, type Annotation, type ArgDef, type FieldDef, type RayfoldSchemaIR, type TypeRef } from \"@rayfold/schema\";\nimport { RayfoldError } from \"./protocol.ts\";\n\nconst MAX_PAGE_FIRST = 200;\nconst NUMERIC = new Set([\"Int\", \"Long\", \"Float\", \"Decimal\"]);\n\nexport function coerceArgs(ir: RayfoldSchemaIR, defs: ArgDef[], raw: unknown, path: string): Record<string, unknown> {\n  if (raw !== undefined && (raw === null || typeof raw !== \"object\" || Array.isArray(raw))) {\n    throw new RayfoldError(\"invalid_argument\", `${path}: expected an object`);\n  }\n  const input = (raw ?? {}) as Record<string, unknown>;\n  for (const k of Object.keys(input)) {\n    if (!defs.some((d) => d.name === k)) throw new RayfoldError(\"invalid_argument\", `${path}.${k}: unknown argument`);\n  }\n  const out: Record<string, unknown> = {};\n  for (const d of defs) {\n    const v = input[d.name];\n    const p = `${path}.${d.name}`;\n    if (v === undefined) {\n      if (d.default !== undefined) {\n        out[d.name] = coerceValue(ir, d.type, d.default, p);\n        continue;\n      }\n      if (!d.type.nullable) throw new RayfoldError(\"invalid_argument\", `${p}: required`);\n      continue; // absent stays absent: partial updates (PATCH) depend on the difference from null\n    }\n    if (v === null) {\n      // An explicit null is never replaced by the default: the caller asked for null.\n      if (!d.type.nullable) throw new RayfoldError(\"invalid_argument\", d.default === undefined ? `${p}: required` : `${p}: must not be null`);\n      out[d.name] = null;\n      continue;\n    }\n    out[d.name] = coerceValue(ir, d.type, v, p);\n    checkConstraints(d.annotations, d.type, out[d.name], p);\n  }\n  return out;\n}\n\n/**\n * Declarative value constraints from the schema (spec 01 section 4): `@range(min, max)` on numbers and\n * on string/list lengths. Enforced before any resolver runs, so a bad value never causes a side effect.\n */\nexport function checkConstraints(annotations: Annotation[], t: TypeRef, v: unknown, path: string): void {\n  if (v === null || v === undefined) return;\n  const range = annotations.find((a) => a.name === \"range\");\n  if (range) {\n    const min = typeof range.args[\"min\"] === \"number\" ? range.args[\"min\"] : undefined;\n    const max = typeof range.args[\"max\"] === \"number\" ? range.args[\"max\"] : undefined;\n    // The declared type decides: a String \"1984\" is four characters long, a Decimal \"10.50\" is a value.\n    const n =\n      t.kind === \"list\" ? (Array.isArray(v) ? v.length : undefined)\n      : NUMERIC.has(t.name) ? (typeof v === \"number\" ? v : typeof v === \"string\" ? Number(v) : undefined)\n      : typeof v === \"string\" ? v.length\n      : undefined;\n    if (n !== undefined) {\n      if (min !== undefined && n < min) throw new RayfoldError(\"invalid_argument\", `${path}: must be >= ${min}`);\n      if (max !== undefined && n > max) throw new RayfoldError(\"invalid_argument\", `${path}: must be <= ${max}`);\n    }\n  }\n  const fmt = annotations.find((a) => a.name === \"format\");\n  const pattern = fmt?.args[\"pattern\"];\n  if (typeof pattern === \"string\" && typeof v === \"string\" && !new RegExp(pattern).test(v)) throw new RayfoldError(\"invalid_argument\", `${path}: must match ${pattern}`);\n}\n\nexport function coerceValue(ir: RayfoldSchemaIR, t: TypeRef, v: unknown, path: string): unknown {\n  if (v === null || v === undefined) {\n    if (t.nullable) return null;\n    throw new RayfoldError(\"invalid_argument\", `${path}: must not be null`);\n  }\n  if (t.kind === \"list\") {\n    if (!Array.isArray(v)) throw new RayfoldError(\"invalid_argument\", `${path}: expected a list`);\n    return v.map((x, i) => coerceValue(ir, t.of, x, `${path}.${i}`));\n  }\n  const def = ir.types[t.name];\n  if (!def) throw new RayfoldError(\"internal\", `${path}: unknown type ${t.name}`);\n  switch (def.kind) {\n    case \"scalar\":\n      return coerceScalar(t.name, v, path);\n    case \"enum\":\n      if (typeof v !== \"string\" || !def.values.some((x) => x.name === v)) {\n        throw new RayfoldError(\"invalid_argument\", `${path}: expected one of ${def.values.map((x) => x.name).join(\", \")}`);\n      }\n      return v;\n    case \"input\": {\n      if (typeof v !== \"object\" || Array.isArray(v)) throw new RayfoldError(\"invalid_argument\", `${path}: expected ${t.name}`);\n      const obj = coerceArgs(ir, def.fields.map(fieldAsArg), v, path);\n      if (t.name === \"PageArgs\") {\n        const first = obj[\"first\"];\n        if (typeof first === \"number\" && first > MAX_PAGE_FIRST) obj[\"first\"] = MAX_PAGE_FIRST;\n        if (typeof first === \"number\" && first < 0) throw new RayfoldError(\"invalid_argument\", `${path}.first: must be >= 0`);\n        const offset = obj[\"offset\"];\n        if (typeof offset === \"number\" && offset < 0) throw new RayfoldError(\"invalid_argument\", `${path}.offset: must be >= 0`);\n      }\n      return obj;\n    }\n    default:\n      throw new RayfoldError(\"invalid_argument\", `${path}: ${typeRefToString(t)} is not an input type`);\n  }\n}\n\nfunction fieldAsArg(f: FieldDef): ArgDef {\n  const a: ArgDef = { name: f.name, type: f.type, annotations: f.annotations };\n  if (f.default !== undefined) a.default = f.default;\n  return a;\n}\n\nconst RFC3339 = /^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}(\\.\\d+)?(Z|[+-]\\d{2}:\\d{2})$/;\nconst DATE = /^\\d{4}-\\d{2}-\\d{2}$/;\nconst DECIMAL = /^-?\\d+(\\.\\d+)?$/;\n\nexport function coerceScalar(name: string, v: unknown, path: string): unknown {\n  const bad = (want: string): never => {\n    throw new RayfoldError(\"invalid_argument\", `${path}: expected ${want}`);\n  };\n  switch (name) {\n    case \"ID\":\n      if (typeof v === \"string\" && v.length > 0) return v;\n      if (typeof v === \"number\" && Number.isSafeInteger(v)) return String(v);\n      return bad(\"ID\");\n    case \"String\":\n      return typeof v === \"string\" ? v : bad(\"String\");\n    case \"Int\":\n      return typeof v === \"number\" && Number.isInteger(v) && Math.abs(v) <= 2_147_483_647 ? v : bad(\"Int\");\n    case \"Long\":\n      if (typeof v === \"number\" && Number.isSafeInteger(v)) return v; // larger values lose digits as JSON numbers: send them as text\n      if (typeof v === \"string\" && /^-?\\d+$/.test(v)) return v;\n      return bad(\"Long\");\n    case \"Float\":\n      return typeof v === \"number\" && Number.isFinite(v) ? v : bad(\"Float\");\n    case \"Boolean\":\n      return typeof v === \"boolean\" ? v : bad(\"Boolean\");\n    case \"Decimal\":\n      if (typeof v === \"string\" && DECIMAL.test(v)) return v;\n      if (typeof v === \"number\" && Number.isFinite(v) && DECIMAL.test(String(v))) return String(v); // 1e21 would become \"1e+21\"\n      return bad(\"Decimal\");\n    case \"Instant\":\n      return typeof v === \"string\" && RFC3339.test(v) ? v : bad(\"Instant (RFC 3339)\");\n    case \"Date\":\n      return typeof v === \"string\" && DATE.test(v) ? v : bad(\"Date (YYYY-MM-DD)\");\n    case \"Duration\":\n      if (typeof v === \"number\" && v >= 0) return v;\n      if (typeof v === \"string\" && /^\\d+(ms|s|m|h|d)$/.test(v)) return v;\n      return bad(\"Duration\");\n    case \"Bytes\":\n      return typeof v === \"string\" && /^[A-Za-z0-9_-]*$/.test(v) ? v : bad(\"Bytes (base64url)\");\n    case \"JSON\":\n      return v;\n    default:\n      // user-defined scalar: accept any JSON scalar\n      return typeof v === \"object\" ? bad(`scalar ${name}`) : v;\n  }\n}\n\n/** Replace `{ \"$ref\": \"id.path\" }` objects with values from earlier results. Spec 03 §2. */\nexport function resolveRefs(value: unknown, lookup: (opId: number, path: string[]) => unknown, at: string): unknown {\n  if (value === null || typeof value !== \"object\") return value;\n  if (Array.isArray(value)) return value.map((x, i) => resolveRefs(x, lookup, `${at}.${i}`));\n  const obj = value as Record<string, unknown>;\n  const ref = obj[\"$ref\"];\n  if (typeof ref === \"string\" && Object.keys(obj).length === 1) {\n    const [idText, ...path] = ref.split(\".\");\n    const id = Number(idText);\n    if (!Number.isInteger(id) || id <= 0) throw new RayfoldError(\"invalid_argument\", `${at}: bad $ref ${JSON.stringify(ref)}`);\n    const v = lookup(id, path);\n    if (v === undefined) throw new RayfoldError(\"invalid_argument\", `${at}: $ref ${ref} resolved to nothing`);\n    return v;\n  }\n  const out: Record<string, unknown> = {};\n  for (const [k, v] of Object.entries(obj)) out[k] = resolveRefs(v, lookup, `${at}.${k}`);\n  return out;\n}\n\n/** Ids of ops referenced by `$ref` anywhere inside `value`. */\nexport function collectRefs(value: unknown, out = new Set<number>()): Set<number> {\n  if (value === null || typeof value !== \"object\") return out;\n  if (Array.isArray(value)) {\n    value.forEach((x) => collectRefs(x, out));\n    return out;\n  }\n  const obj = value as Record<string, unknown>;\n  const ref = obj[\"$ref\"];\n  if (typeof ref === \"string\" && Object.keys(obj).length === 1) {\n    out.add(Number(ref.split(\".\")[0]));\n    return out;\n  }\n  for (const v of Object.values(obj)) collectRefs(v, out);\n  return out;\n}\n\nexport function getPath(value: unknown, path: string[]): unknown {\n  let cur = value;\n  for (const p of path) {\n    if (cur === null || cur === undefined || typeof cur !== \"object\") return undefined;\n    if (Array.isArray(cur)) {\n      cur = cur[Number(p)];\n      continue;\n    }\n    // own data only: \"__proto__\", \"constructor\" and friends are never reachable through a $ref path\n    if (!Object.prototype.hasOwnProperty.call(cur, p)) return undefined;\n    cur = (cur as Record<string, unknown>)[p];\n  }\n  return cur;\n}\n"]}

package/batch.d.ts

@@ -0,0 +1,54 @@
+/** Batch scheduling: dependency waves, serial commands, deadlines, idempotency. Spec: spec/03. */
+import type { Instrumentation } from "./instrumentation.js";
+import { type RayfoldSchemaIR } from "@rayfold/schema";
+import { EventBus, type IdempotencyStore } from "./context.js";
+import { type Executor } from "./executor.js";
+import { type Frame, type RequestEnvelope } from "./protocol.js";
+import { type ShapeRegistry } from "./views.js";
+import type { UsageSink } from "./usage.js";
+import { ChangeBus } from "./live.js";
+export interface BatchOptions {
+    trustedShapes: boolean;
+    budget: number;
+    maxOps: number;
+    maxDepth: number;
+    maxFields: number;
+    timing: boolean;
+    now: () => number;
+}
+export interface BatchRuntime {
+    ir: RayfoldSchemaIR;
+    executor: Executor;
+    registry: ShapeRegistry;
+    idempotency: IdempotencyStore;
+    events: EventBus;
+    changes: ChangeBus;
+    options: BatchOptions;
+    instrumentation?: Instrumentation;
+    /** Records which operations each client called (spec 11). */
+    usage?: UsageSink;
+    /** Commands running right now, by idempotency scope and key: a concurrent retry waits for the first, then replays. */
+    inflight: Map<string, Promise<void>>;
+}
+export interface ExecuteOptions {
+    viewer?: unknown;
+    signal?: AbortSignal;
+    /**
+     * Set by transports whose HTTP method is itself idempotent (PUT, PATCH, DELETE bindings): commands may run
+     * without an idempotency key. Never settable from the wire envelope.
+     */
+    keyOptional?: boolean;
+    /** @internal Set by the batch itself: the memo every op of this request shares. Never read from the wire. */
+    batchState?: Map<string, unknown>;
+}
+/** Unbounded async queue of frames; `close()` ends iteration once drained. */
+export declare class FrameSink implements AsyncIterable<Frame> {
+    private readonly queue;
+    private waiting;
+    private closed;
+    readonly frames: Frame[];
+    push(f: Frame): void;
+    close(): void;
+    [Symbol.asyncIterator](): AsyncIterator<Frame>;
+}
+export declare function executeBatch(rt: BatchRuntime, envelope: RequestEnvelope, opts?: ExecuteOptions): AsyncIterable<Frame>;