@rayfold/postgres 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,67 @@
+# @rayfold/postgres
+
+Postgres for [Rayfold](https://github.com/eddyboutros/rayfold) resolvers: batch loads by id, keyset pages, one query
+per level of a nested shape, and read policies pushed into the SQL `WHERE`, so a list never fetches rows its viewer
+may not see.
+
+```sh
+npm install @rayfold/postgres pg
+```
+
+```ts
+import pg from "pg";
+import { createRayfoldServer } from "@rayfold/server";
+import { createPgStore } from "@rayfold/postgres";
+
+const db = new pg.Pool({ connectionString: process.env.DATABASE_URL });
+const schema = `
+  entity Author { id: ID name: String books(page: PageArgs = { first: 10 }): Page<Book> }
+  entity Book { id: ID title: String author: Author }
+  entity Order @allow(read: viewer.id == customerId) { id: ID customerId: ID total: Decimal }
+  query books(page: PageArgs = { first: 20 }): Page<Book>
+  query myOrders: [Order]
+`;
+const server = createRayfoldServer({ schema, resolvers: {} }); // for its IR; see below
+const store = createPgStore(db, {
+  ir: server.ir,
+  naming: "snake", // authorId -> author_id
+  tables: { Author: { table: "authors" }, Book: { table: "books", columns: { authorId: "author_id" } }, Order: { table: "orders" } },
+});
+
+export const resolvers = {
+  Query: {
+    books: (args, ctx) => store.page("Book", args.page, {}, ctx),
+    myOrders: (_args, ctx) => store.find("Order", {}, ctx), // the policy becomes WHERE customer_id = $viewer
+  },
+  Book: { author: (books, _args, ctx) => store.byIds("Author", books.map((b) => b.authorId), ctx) },
+  Author: { books: (authors, args, ctx) => store.pagesByField("Book", "authorId", authors.map((a) => a.id), args.page, ctx) },
+};
+```
+
+Any client with `query(text, params)` works: `pg.Pool`, `pg.Client`, [PGlite](https://pglite.dev), or your own
+wrapper (for logging or transactions).
+
+## What each call does
+
+| Call | SQL | Use it for |
+|---|---|---|
+| `byIds(type, ids, ctx)` | one `SELECT ... WHERE id = ANY($1)` | a to-one field's batch loader; returns rows in the order asked, `null` for a missing or hidden row |
+| `find(type, where, ctx)` | one `SELECT ... WHERE field = $n ... ORDER BY id` | a short list |
+| `page(type, { first, after }, where, ctx)` | one query with `count(*) OVER ()` | a `Page<T>` in key order: `items`, `cursor`, `hasMore`, `total` |
+| `pagesByField(type, field, parents, { first, after }, ctx)` | one query with window functions | a paged one-to-many field for a whole level of parents at once |
+
+## Read policies in SQL
+
+When a resolver loads an entity whose read policy is pushable (it reads only the viewer, the arguments, literals and
+the row's own scalar fields; spec 06 §4), the runtime hands it to the resolver as `ctx.policy.filter`. Pass `ctx` to the
+store and the policy becomes part of the `WHERE` clause: a customer's list query reads only their rows, and a page's
+`total` counts only what they may see.
+
+The translation never drops a row the policy allows. Where SQL cannot match the runtime exactly (ordering text,
+comparing values of different types, `Decimal` inequality) it lets the row through and the runtime's own check, which
+always runs, removes it. Without the pushdown, a list that returns rows the viewer may not see is refused as a whole
+(spec 06 §3); with it, the list holds exactly the permitted rows.
+
+## License
+
+Apache-2.0

package/index.d.ts

@@ -0,0 +1,124 @@
+/**
+ * Postgres for Rayfold resolvers: batch loads by id, keyset pages, one-to-many pages for a whole level in one query,
+ * and read policies pushed into the SQL `WHERE` (spec 06 §4), so a list never fetches rows its viewer may not see.
+ *
+ * Works with any client that has `query(text, params)`: pg's `Pool` and `Client`, PGlite, or a wrapper of your own.
+ * Every value travels as a bound parameter and every identifier is quoted.
+ *
+ * The pushed-down filter is a superset of the policy: it may let through a row the policy denies (the runtime's own
+ * check then removes it), but it never drops a row the policy allows. Comparisons it cannot translate exactly, such as
+ * ordering text or comparing across types, are left to the runtime.
+ */
+import { type Expr, type ExprEnv, type RayfoldSchemaIR, type Shape } from "@rayfold/schema";
+/** Anything with pg's `query(text, params)`: `pg.Pool`, `pg.Client`, `PGlite`. */
+export interface Queryable {
+    query<R = Record<string, unknown>>(text: string, params?: unknown[]): Promise<{
+        rows: R[];
+    }>;
+}
+export interface TableMapping {
+    /** The table, optionally schema-qualified (`"public.books"`). */
+    table: string;
+    /** The key column; default `"id"`. Pages are ordered by it. */
+    id?: string;
+    /** Field name to column name, for fields whose column is named otherwise (after `naming`). */
+    columns?: Record<string, string>;
+    /** Fields that lead to another mapped type. `screen` needs these; the batch loaders do not. */
+    relations?: Record<string, Relation>;
+}
+/**
+ * How a field reaches another table. `one`: `key` is the field on *this* type holding the other row's key
+ * (`Book.authorId`). `page`: `key` is the field on the *other* type holding this row's key (`Book.authorId`, as seen
+ * from `Author.books`).
+ */
+export interface Relation {
+    type: string;
+    kind: "one" | "page";
+    key: string;
+}
+export interface PgStoreOptions {
+    ir: RayfoldSchemaIR;
+    /** One mapping per entity type the store serves. */
+    tables: Record<string, TableMapping>;
+    /** How field names become column names when `columns` does not say: as they are (default) or snake_case. */
+    naming?: "same" | "snake";
+}
+/** What the store needs from a resolver's context: the viewer and the read policy the runtime pushed down (`ctx.policy`). */
+export interface PolicyContext {
+    viewer?: unknown;
+    policy?: {
+        filter?: Expr;
+    };
+    now?: () => number;
+}
+export type Row = Record<string, unknown>;
+export interface Page<T = Row> {
+    items: T[];
+    cursor: string | null;
+    hasMore: boolean;
+    total: number;
+}
+export interface PageRequest {
+    first: number;
+    after?: string | null;
+}
+/** A SQL fragment with its parameters numbered from 1. */
+export interface Fragment {
+    sql: string;
+    exact: boolean;
+}
+export declare function createPgStore(db: Queryable, opts: PgStoreOptions): PgStore;
+export declare class PgStore {
+    private readonly db;
+    private readonly opts;
+    private readonly tables;
+    constructor(db: Queryable, opts: PgStoreOptions);
+    /**
+     * Rows of `type` for `ids`, in the order asked: `null` where a row is missing or hidden by the pushed-down read policy.
+     * One query for any number of ids, which makes it the batch loader for a to-one field.
+     */
+    byIds(type: string, ids: readonly unknown[], ctx?: PolicyContext, args?: Record<string, unknown>): Promise<Array<Row | null>>;
+    /** Rows of `type` whose fields equal `where` (a `null` value matches NULL), in key order. One query. */
+    find(type: string, where?: Record<string, unknown>, ctx?: PolicyContext, args?: Record<string, unknown>): Promise<Row[]>;
+    /**
+     * One page of `type` in key order, after `page.after` (a key), with `total` counting every visible matching row.
+     * One query; a second one counts only when the page comes back empty.
+     */
+    page(type: string, page: PageRequest, where?: Record<string, unknown>, ctx?: PolicyContext, args?: Record<string, unknown>): Promise<Page>;
+    /**
+     * For each parent key in `values`, the page of `type` rows whose `field` equals it: the batch loader for a paged
+     * one-to-many field (an author's books). One query for the whole level, whatever the number of parents.
+     */
+    pagesByField(type: string, field: string, values: readonly unknown[], page: PageRequest, ctx?: PolicyContext, args?: Record<string, unknown>): Promise<Page[]>;
+    /**
+     * One statement for a whole screen: a page of `type` with every nested field the shape asks for, gathered as JSON
+     * by correlated subqueries. Depth costs no extra round trip, and each level's read policy is pushed into its own
+     * `WHERE`, so a nested list never carries rows its viewer may not see.
+     *
+     * Nested pages are first pages (`first`), which is what a screen shows; the root page takes a cursor as usual.
+     * Every selected field must be a mapped column or a declared relation.
+     */
+    screen(type: string, shape: Shape, page: PageRequest, where?: Record<string, unknown>, ctx?: PolicyContext, args?: Record<string, unknown>): Promise<Page>;
+    /** The JSON projection of one level of a screen: scalars from columns, relations from correlated subqueries. */
+    private project;
+    /** The WHERE fragment for the read policy the runtime pushed down, or nothing when there is none to push. */
+    private policyWhere;
+    /** The read policy declared on a type, for the levels of a screen the runtime handed no hint for. */
+    private filterFor;
+    private equalities;
+    private select;
+    private row;
+    private table;
+    private scalarOf;
+}
+/** A column a policy may read, with the Rayfold scalar type of its field. */
+export interface PolicyColumn {
+    column: string;
+    scalar: string;
+}
+/**
+ * Translates a pushable read policy (spec 06 §4) into a WHERE fragment under `env` (the viewer and args), appending
+ * its values to `params`. Parts that read no field of the row are evaluated here, as the runtime would. `exact` is true
+ * when the fragment selects exactly the rows the policy allows; otherwise it selects more, never fewer.
+ */
+export declare function compilePolicy(e: Expr, env: ExprEnv, columnOf: (field: string) => PolicyColumn | undefined, params: unknown[]): Fragment;

package/index.js

@@ -0,0 +1,435 @@
+/**
+ * Postgres for Rayfold resolvers: batch loads by id, keyset pages, one-to-many pages for a whole level in one query,
+ * and read policies pushed into the SQL `WHERE` (spec 06 §4), so a list never fetches rows its viewer may not see.
+ *
+ * Works with any client that has `query(text, params)`: pg's `Pool` and `Client`, PGlite, or a wrapper of your own.
+ * Every value travels as a bound parameter and every identifier is quoted.
+ *
+ * The pushed-down filter is a superset of the policy: it may let through a row the policy denies (the runtime's own
+ * check then removes it), but it never drops a row the policy allows. Comparisons it cannot translate exactly, such as
+ * ordering text or comparing across types, are left to the runtime.
+ */
+import { evalExpr } from "@rayfold/schema";
+export function createPgStore(db, opts) {
+    return new PgStore(db, opts);
+}
+export class PgStore {
+    db;
+    opts;
+    tables = new Map();
+    constructor(db, opts) {
+        this.db = db;
+        this.opts = opts;
+        for (const [type, m] of Object.entries(opts.tables)) {
+            const def = opts.ir.types[type];
+            if (!def || !("fields" in def))
+                throw new Error(`@rayfold/postgres: ${type} is not an entity or object of the schema`);
+            const columns = new Map();
+            for (const f of def.fields)
+                columns.set(f.name, m.columns?.[f.name] ?? (opts.naming === "snake" ? snake(f.name) : f.name));
+            for (const [f, c] of Object.entries(m.columns ?? {}))
+                columns.set(f, c);
+            const id = m.id ?? "id";
+            const idField = [...columns].find(([, c]) => c === id)?.[0] ?? "id";
+            const fields = new Map([...columns].map(([f, c]) => [c, f]));
+            this.tables.set(type, {
+                name: m.table.split(".").map(quote).join("."),
+                id: quote(id),
+                idField,
+                column: (f) => (columns.has(f) ? quote(columns.get(f)) : undefined),
+                field: (c) => fields.get(c) ?? c,
+                def: { name: def.name, fields: def.fields },
+            });
+        }
+    }
+    /**
+     * Rows of `type` for `ids`, in the order asked: `null` where a row is missing or hidden by the pushed-down read policy.
+     * One query for any number of ids, which makes it the batch loader for a to-one field.
+     */
+    async byIds(type, ids, ctx = {}, args = {}) {
+        if (!ids.length)
+            return [];
+        const t = this.table(type);
+        const params = [[...new Set(ids.filter((x) => x !== null && x !== undefined).map(String))]];
+        const where = [`${t.id}::text = ANY($1::text[])`, ...this.policyWhere(t, ctx, args, params)];
+        const rows = await this.select(t, `SELECT * FROM ${t.name} WHERE ${where.join(" AND ")}`, params);
+        const byId = new Map(rows.map((r) => [String(r[t.idField]), r]));
+        return ids.map((id) => (id === null || id === undefined ? null : (byId.get(String(id)) ?? null)));
+    }
+    /** Rows of `type` whose fields equal `where` (a `null` value matches NULL), in key order. One query. */
+    async find(type, where = {}, ctx = {}, args = {}) {
+        const t = this.table(type);
+        const params = [];
+        const conds = [...this.equalities(t, where, params), ...this.policyWhere(t, ctx, args, params)];
+        return this.select(t, `SELECT * FROM ${t.name}${conds.length ? ` WHERE ${conds.join(" AND ")}` : ""} ORDER BY ${t.id}`, params);
+    }
+    /**
+     * One page of `type` in key order, after `page.after` (a key), with `total` counting every visible matching row.
+     * One query; a second one counts only when the page comes back empty.
+     */
+    async page(type, page, where = {}, ctx = {}, args = {}) {
+        const t = this.table(type);
+        const params = [];
+        const conds = [...this.equalities(t, where, params), ...this.policyWhere(t, ctx, args, params)];
+        const filtered = `SELECT *, count(*) OVER () AS "__total" FROM ${t.name}${conds.length ? ` WHERE ${conds.join(" AND ")}` : ""}`;
+        let after = "";
+        if (page.after) {
+            params.push(page.after);
+            after = ` WHERE "__s".${t.id}::text > $${params.length}::text`;
+        }
+        params.push(page.first + 1);
+        const raw = (await this.db.query(`SELECT * FROM (${filtered}) AS "__s"${after} ORDER BY "__s".${t.id}::text LIMIT $${params.length}`, params)).rows;
+        let total = raw.length ? Number(raw[0]["__total"]) : 0;
+        if (!raw.length && page.after) {
+            const count = await this.db.query(`SELECT count(*)::int AS n FROM ${t.name}${conds.length ? ` WHERE ${conds.join(" AND ")}` : ""}`, params.slice(0, params.length - 2));
+            total = Number(count.rows[0]?.n ?? 0);
+        }
+        const rows = raw.map((r) => this.row(t, r));
+        const items = rows.slice(0, page.first);
+        return { items, cursor: items.length ? String(items[items.length - 1][t.idField]) : null, hasMore: rows.length > page.first, total };
+    }
+    /**
+     * For each parent key in `values`, the page of `type` rows whose `field` equals it: the batch loader for a paged
+     * one-to-many field (an author's books). One query for the whole level, whatever the number of parents.
+     */
+    async pagesByField(type, field, values, page, ctx = {}, args = {}) {
+        if (!values.length)
+            return [];
+        const t = this.table(type);
+        const col = t.column(field);
+        if (!col)
+            throw new Error(`@rayfold/postgres: ${type} has no field ${field}`);
+        const params = [[...new Set(values.map(String))]];
+        const conds = [`${col}::text = ANY($1::text[])`, ...this.policyWhere(t, ctx, args, params)];
+        let after = "";
+        if (page.after) {
+            params.push(page.after);
+            after = ` AND "__s".${t.id}::text > $${params.length}::text`;
+        }
+        params.push(page.first + 1);
+        const sql = `SELECT * FROM (SELECT *, count(*) OVER (PARTITION BY ${col}) AS "__total", ` +
+            `row_number() OVER (PARTITION BY ${col} ORDER BY ${t.id}::text) AS "__n" FROM ${t.name} WHERE ${conds.join(" AND ")}) AS "__s" ` +
+            `WHERE TRUE${after} ORDER BY "__s".${t.id}::text`;
+        const raw = (await this.db.query(sql, params.slice(0, -1))).rows;
+        const groups = new Map();
+        for (const r of raw) {
+            const key = String(r[col.slice(1, -1).replace(/""/g, '"')]);
+            const g = groups.get(key) ?? { rows: [], total: Number(r["__total"]) };
+            g.rows.push(this.row(t, r));
+            groups.set(key, g);
+        }
+        return values.map((v) => {
+            const g = groups.get(String(v));
+            if (!g)
+                return { items: [], cursor: null, hasMore: false, total: 0 };
+            const items = g.rows.slice(0, page.first);
+            return { items, cursor: items.length ? String(items[items.length - 1][t.idField]) : null, hasMore: g.rows.length > page.first, total: g.total };
+        });
+    }
+    /**
+     * One statement for a whole screen: a page of `type` with every nested field the shape asks for, gathered as JSON
+     * by correlated subqueries. Depth costs no extra round trip, and each level's read policy is pushed into its own
+     * `WHERE`, so a nested list never carries rows its viewer may not see.
+     *
+     * Nested pages are first pages (`first`), which is what a screen shows; the root page takes a cursor as usual.
+     * Every selected field must be a mapped column or a declared relation.
+     */
+    async screen(type, shape, page, where = {}, ctx = {}, args = {}) {
+        const t = this.table(type);
+        const params = [];
+        // The caller may pass the shape of the Page the query returns, or the shape of one row.
+        const rowShape = t.def.fields.some((f) => f.name === "items") ? shape : itemsOf(shape);
+        const projection = this.project(t, "__r0", rowShape, ctx, args, params, 0);
+        const conds = [...this.equalities(t, where, params), ...this.policyWhere(t, ctx, args, params, "__r0", ctx.policy?.filter ?? this.filterFor(type))];
+        const filtered = `SELECT ${projection} AS "__row", __r0.${t.id}::text AS "__key", count(*) OVER () AS "__total" ` +
+            `FROM ${t.name} AS __r0${conds.length ? ` WHERE ${conds.join(" AND ")}` : ""}`;
+        let after = "";
+        if (page.after) {
+            params.push(page.after);
+            after = ` WHERE "__s"."__key" > $${params.length}::text`;
+        }
+        params.push(page.first + 1);
+        const raw = (await this.db.query(`SELECT * FROM (${filtered}) AS "__s"${after} ORDER BY "__s"."__key" LIMIT $${params.length}`, params)).rows;
+        let total = raw.length ? Number(raw[0]["__total"]) : 0;
+        if (!raw.length && page.after) {
+            const cp = [];
+            const cc = [...this.equalities(t, where, cp), ...this.policyWhere(t, ctx, args, cp, "__r0", ctx.policy?.filter ?? this.filterFor(type))];
+            const counted = await this.db.query(`SELECT count(*)::int AS n FROM ${t.name} AS __r0${cc.length ? ` WHERE ${cc.join(" AND ")}` : ""}`, cp);
+            total = Number(counted.rows[0]?.n ?? 0);
+        }
+        const rows = raw.slice(0, page.first);
+        return {
+            items: rows.map((r) => r["__row"]),
+            cursor: rows.length ? String(rows[rows.length - 1]["__key"]) : null,
+            hasMore: raw.length > page.first,
+            total,
+        };
+    }
+    /** The JSON projection of one level of a screen: scalars from columns, relations from correlated subqueries. */
+    project(t, alias, shape, ctx, args, params, depth) {
+        if (depth > 8)
+            throw new Error("@rayfold/postgres: a screen nested deeper than 8 levels");
+        const relations = this.opts.tables[t.def.name]?.relations ?? {};
+        const parts = [];
+        for (const item of shape.items) {
+            if (item.kind !== "field")
+                continue; // views and type conditions are expanded before a shape reaches the store
+            const name = item.name;
+            const out = item.alias ?? name;
+            const def = t.def.fields.find((f) => f.name === name);
+            if (!def)
+                throw new Error(`@rayfold/postgres: ${t.def.name} has no field ${name}`);
+            const rel = relations[name];
+            if (!rel) {
+                const col = t.column(name);
+                if (!col)
+                    throw new Error(`@rayfold/postgres: ${t.def.name}.${name} has no column and no relation`);
+                const scalar = def.type.kind === "named" ? this.scalarOf(def.type.name) : "";
+                parts.push(`'${out}', ${alias}.${col}${AS_TEXT.has(scalar) ? "::text" : ""}`);
+                continue;
+            }
+            const child = this.table(rel.type);
+            const ca = `__r${depth + 1}`;
+            // A paged field is selected through its Page envelope, so the rows are described by its `items`.
+            const selected = item.shape ?? { items: [] };
+            const childProjection = this.project(child, ca, rel.kind === "page" ? itemsOf(selected) : selected, ctx, args, params, depth + 1);
+            const childPolicy = this.policyWhere(child, ctx, args, params, ca, this.filterFor(rel.type));
+            if (rel.kind === "one") {
+                const parentCol = t.column(rel.key);
+                if (!parentCol)
+                    throw new Error(`@rayfold/postgres: ${t.def.name} has no field ${rel.key}`);
+                const conds = [`${ca}.${child.id} = ${alias}.${parentCol}`, ...childPolicy];
+                parts.push(`'${out}', (SELECT ${childProjection} FROM ${child.name} AS ${ca} WHERE ${conds.join(" AND ")} LIMIT 1)`);
+                continue;
+            }
+            const childCol = child.column(rel.key);
+            if (!childCol)
+                throw new Error(`@rayfold/postgres: ${rel.type} has no field ${rel.key}`);
+            params.push(firstOf(item.args) ?? 10);
+            const conds = [`${ca}.${childCol} = ${alias}.${t.id}`, ...childPolicy];
+            const rows = `SELECT ${childProjection} AS "__row", ${ca}.${child.id}::text AS "__key", count(*) OVER () AS "__total" ` +
+                `FROM ${child.name} AS ${ca} WHERE ${conds.join(" AND ")} ORDER BY ${ca}.${child.id}::text LIMIT $${params.length}`;
+            parts.push(`'${out}', (SELECT json_build_object(` +
+                `'items', coalesce(json_agg("__p"."__row" ORDER BY "__p"."__key"), '[]'::json), ` +
+                `'total', coalesce(max("__p"."__total"), 0)::int, ` +
+                `'hasMore', coalesce(count(*) < max("__p"."__total"), false), ` +
+                `'cursor', max("__p"."__key")` +
+                `) FROM (${rows}) AS "__p")`);
+        }
+        return `json_build_object(${parts.join(", ")})`;
+    }
+    /** The WHERE fragment for the read policy the runtime pushed down, or nothing when there is none to push. */
+    policyWhere(t, ctx, args, params, alias, own) {
+        const filter = own ?? ctx.policy?.filter;
+        if (!filter)
+            return [];
+        const env = { viewer: ctx.viewer ?? null, args, this: null, ...(ctx.now ? { now: ctx.now } : {}) };
+        const f = compilePolicy(filter, env, (name) => {
+            const col = t.column(name);
+            const def = t.def.fields.find((x) => x.name === name);
+            const qualified = col && alias ? `${alias}.${col}` : col;
+            return qualified && def && def.type.kind === "named" ? { column: qualified, scalar: this.scalarOf(def.type.name) } : undefined;
+        }, params);
+        return f.sql === "TRUE" ? [] : [f.sql];
+    }
+    /** The read policy declared on a type, for the levels of a screen the runtime handed no hint for. */
+    filterFor(type) {
+        const def = this.opts.ir.types[type];
+        return def ? pushableFilterOf(def.annotations) : undefined;
+    }
+    equalities(t, where, params) {
+        return Object.entries(where).map(([f, v]) => {
+            const col = t.column(f);
+            if (!col)
+                throw new Error(`@rayfold/postgres: ${t.def.name} has no field ${f}`);
+            if (v === null || v === undefined)
+                return `${col} IS NULL`;
+            params.push(v);
+            return `${col} = $${params.length}`;
+        });
+    }
+    async select(t, sql, params) {
+        return (await this.db.query(sql, params)).rows.map((r) => this.row(t, r));
+    }
+    row(t, r) {
+        const out = {};
+        for (const [k, v] of Object.entries(r))
+            if (k !== "__total" && k !== "__n")
+                out[t.field(k)] = v;
+        return out;
+    }
+    table(type) {
+        const t = this.tables.get(type);
+        if (!t)
+            throw new Error(`@rayfold/postgres: no table mapped for ${type}`);
+        return t;
+    }
+    scalarOf(name) {
+        const def = this.opts.ir.types[name];
+        return def?.kind === "enum" ? "String" : name;
+    }
+}
+// ---------------------------------------------------------------- policies to SQL
+/** The rows of a `Page<T>` selection: the sub-shape of its `items`, or the shape itself when it selects rows. */
+function itemsOf(shape) {
+    const items = shape.items.find((i) => i.kind === "field" && i.name === "items");
+    return items && items.kind === "field" && items.shape ? items.shape : shape;
+}
+/** Scalars Postgres would render as a JSON number, but Rayfold carries as text. */
+const AS_TEXT = new Set(["Decimal", "Long"]);
+/** The page size a shape asked for (`page: { first: n }` or `first: n`), when it is a plain number. */
+function firstOf(a) {
+    const page = a?.["page"];
+    const n = page && typeof page === "object" && !Array.isArray(page) ? page["first"] : a?.["first"];
+    return typeof n === "number" && Number.isInteger(n) && n >= 0 ? n : undefined;
+}
+/** The pushable part of a type's `@allow(read:)`, for the levels of a screen the runtime gave no hint for. */
+function pushableFilterOf(annotations) {
+    const allow = annotations.find((a) => a.name === "allow");
+    const read = allow?.args["read"];
+    return read && typeof read === "object" && "$expr" in read ? read.$expr : undefined;
+}
+const LOOSE = { sql: "TRUE", exact: false };
+const constant = (b) => ({ sql: b ? "TRUE" : "FALSE", exact: true });
+const TEXT = new Set(["String", "ID"]);
+const NUMBER = new Set(["Int", "Float"]);
+const DECIMAL = new Set(["Decimal", "Long"]);
+const DECIMAL_TEXT = /^-?\d+(\.\d+)?$/;
+/**
+ * Translates a pushable read policy (spec 06 §4) into a WHERE fragment under `env` (the viewer and args), appending
+ * its values to `params`. Parts that read no field of the row are evaluated here, as the runtime would. `exact` is true
+ * when the fragment selects exactly the rows the policy allows; otherwise it selects more, never fewer.
+ */
+export function compilePolicy(e, env, columnOf, params) {
+    if (!readsRow(e)) {
+        try {
+            return constant(truthy(evalExpr(e, env)));
+        }
+        catch {
+            return LOOSE; // an expression that cannot be evaluated denies, but maybe only where it is reached: leave it to the runtime
+        }
+    }
+    switch (e.k) {
+        case "path": {
+            const c = e.path.length === 1 ? columnOf(e.path[0]) : undefined;
+            if (!c)
+                return LOOSE;
+            return { sql: c.scalar === "Boolean" ? `(${c.column} IS TRUE)` : `(${c.column} IS NOT NULL)`, exact: true };
+        }
+        case "not": {
+            const f = compilePolicy(e.e, env, columnOf, params);
+            // negating a superset would give a subset, so only an exact fragment can be negated
+            return f.exact ? { sql: `(NOT ${f.sql})`, exact: true } : LOOSE;
+        }
+        case "bin": {
+            if (e.op === "&&" || e.op === "||") {
+                const l = compilePolicy(e.l, env, columnOf, params);
+                const r = compilePolicy(e.r, env, columnOf, params);
+                return { sql: `(${l.sql} ${e.op === "&&" ? "AND" : "OR"} ${r.sql})`, exact: l.exact && r.exact };
+            }
+            const left = rowField(e.l);
+            const right = rowField(e.r);
+            if ((left === undefined) === (right === undefined))
+                return LOOSE; // both sides read the row, or neither is a plain field
+            const field = (left ?? right);
+            const other = left !== undefined ? e.r : e.l;
+            if (readsRow(other))
+                return LOOSE;
+            const c = columnOf(field);
+            if (!c)
+                return LOOSE;
+            let v;
+            try {
+                v = evalExpr(other, env);
+            }
+            catch {
+                return LOOSE;
+            }
+            const op = left !== undefined ? e.op : flip(e.op);
+            return compare(c, op, v, params);
+        }
+        default:
+            return LOOSE;
+    }
+}
+function compare(c, op, v, params) {
+    const add = (x) => `$${params.push(x)}`;
+    if (op === "in") {
+        if (!Array.isArray(v))
+            return constant(false);
+        if (!v.every((x) => kindMatches(c.scalar, x)))
+            return LOOSE;
+        if (TEXT.has(c.scalar))
+            return { sql: `COALESCE(${c.column}::text = ANY(${add(v.map(String))}::text[]), FALSE)`, exact: true };
+        if (NUMBER.has(c.scalar))
+            return { sql: `COALESCE(${c.column} = ANY(${add(v)}::numeric[]), FALSE)`, exact: true };
+        return LOOSE;
+    }
+    if (op === "==" || op === "!=") {
+        if (v === null || v === undefined)
+            return { sql: `(${c.column} IS ${op === "==" ? "" : "NOT "}NULL)`, exact: true };
+        if (!kindMatches(c.scalar, v))
+            return LOOSE;
+        const not = op === "==" ? "NOT " : "";
+        if (TEXT.has(c.scalar))
+            return { sql: `(${c.column}::text IS ${not}DISTINCT FROM ${add(String(v))}::text)`, exact: true };
+        if (NUMBER.has(c.scalar))
+            return { sql: `(${c.column} IS ${not}DISTINCT FROM ${add(v)}::numeric)`, exact: true };
+        if (c.scalar === "Boolean")
+            return { sql: `(${c.column} IS ${not}DISTINCT FROM ${add(v)}::boolean)`, exact: true };
+        // Decimal and Long travel as text: SQL compares by value, the runtime may compare the text, so equality selects
+        // more rows than the policy and inequality could select fewer; only equality is pushed
+        if (DECIMAL.has(c.scalar) && op === "==")
+            return { sql: `(${c.column} = ${add(String(v))}::numeric)`, exact: false };
+        return LOOSE;
+    }
+    if (["<", "<=", ">", ">="].includes(op) && typeof v === "number" && NUMBER.has(c.scalar)) {
+        return { sql: `COALESCE(${c.column} ${op} ${add(v)}::numeric, FALSE)`, exact: true };
+    }
+    return LOOSE;
+}
+/** Whether `v` is a value the runtime could find equal to a field of this scalar type. */
+function kindMatches(scalar, v) {
+    if (TEXT.has(scalar))
+        return typeof v === "string";
+    if (NUMBER.has(scalar))
+        return typeof v === "number" && Number.isFinite(v);
+    if (scalar === "Boolean")
+        return typeof v === "boolean";
+    if (DECIMAL.has(scalar))
+        return (typeof v === "string" && DECIMAL_TEXT.test(v)) || (typeof v === "number" && Number.isFinite(v));
+    return false;
+}
+function flip(op) {
+    return op === "<" ? ">" : op === ">" ? "<" : op === "<=" ? ">=" : op === ">=" ? "<=" : op;
+}
+/** The field name when `e` is `this.<field>`. */
+function rowField(e) {
+    return e.k === "path" && e.root === "this" && e.path.length === 1 ? e.path[0] : undefined;
+}
+function readsRow(e) {
+    switch (e.k) {
+        case "lit":
+            return false;
+        case "path":
+            return e.root === "this";
+        case "not":
+            return readsRow(e.e);
+        case "bin":
+            return readsRow(e.l) || readsRow(e.r);
+        case "list":
+            return e.items.some(readsRow);
+        case "call":
+            return e.args.some(readsRow);
+    }
+}
+function truthy(v) {
+    return v !== null && v !== undefined && v !== false;
+}
+function quote(name) {
+    return `"${name.replace(/"/g, '""')}"`;
+}
+function snake(name) {
+    return name.replace(/[A-Z]/g, (c) => `_${c.toLowerCase()}`);
+}
+//# sourceMappingURL=index.js.map

package/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,EAAE,QAAQ,EAA4E,MAAM,iBAAiB,CAAC;AAmDrH,MAAM,UAAU,aAAa,CAAC,EAAa,EAAE,IAAoB;IAC/D,OAAO,IAAI,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;AAC/B,CAAC;AAID,MAAM,OAAO,OAAO;IAGW,EAAE;IAA8B,IAAI;IAFhD,MAAM,GAAG,IAAI,GAAG,EAAiB,CAAC;IAEnD,YAA6B,EAAa,EAAmB,IAAoB;kBAApD,EAAE;oBAA8B,IAAI;QAC/D,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACpD,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,QAAQ,IAAI,GAAG,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,IAAI,2CAA2C,CAAC,CAAC;YACvH,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC1C,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM;gBAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAC3H,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC;gBAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACxE,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC;YACxB,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;YACpE,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7D,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE;gBACpB,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;gBAC7C,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC;gBACb,OAAO;gBACP,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;gBACpE,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;gBAChC,GAAG,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE;aAC5C,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,KAAK,CAAC,IAAY,EAAE,GAAuB,EAAE,GAAG,GAAkB,EAAE,EAAE,IAAI,GAA4B,EAAE;QAC5G,IAAI,CAAC,GAAG,CAAC,MAAM;YAAE,OAAO,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,MAAM,MAAM,GAAc,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACvG,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,0BAA0B,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;QAC7F,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,IAAI,UAAU,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAClG,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;IACpG,CAAC;IAED,wGAAwG;IACxG,KAAK,CAAC,IAAI,CAAC,IAAY,EAAE,KAAK,GAA4B,EAAE,EAAE,GAAG,GAAkB,EAAE,EAAE,IAAI,GAA4B,EAAE;QACvH,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;QAChG,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;IAClI,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,IAAI,CAAC,IAAY,EAAE,IAAiB,EAAE,KAAK,GAA4B,EAAE,EAAE,GAAG,GAAkB,EAAE,EAAE,IAAI,GAA4B,EAAE;QAC1I,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;QAChG,MAAM,QAAQ,GAAG,gDAAgD,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;QAChI,IAAI,KAAK,GAAG,EAAE,CAAC;QACf,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxB,KAAK,GAAG,gBAAgB,CAAC,CAAC,EAAE,aAAa,MAAM,CAAC,MAAM,QAAQ,CAAC;QACjE,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAC5B,MAAM,GAAG,GAAG,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAM,kBAAkB,QAAQ,aAAa,KAAK,mBAAmB,CAAC,CAAC,EAAE,iBAAiB,MAAM,CAAC,MAAM,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;QACzJ,IAAI,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAgB,kCAAkC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YACvL,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACxC,CAAC;QACD,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACxC,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC;IACxI,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,YAAY,CAAC,IAAY,EAAE,KAAa,EAAE,MAA0B,EAAE,IAAiB,EAAE,GAAG,GAAkB,EAAE,EAAE,IAAI,GAA4B,EAAE;QACxJ,IAAI,CAAC,MAAM,CAAC,MAAM;YAAE,OAAO,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,IAAI,iBAAiB,KAAK,EAAE,CAAC,CAAC;QAC9E,MAAM,MAAM,GAAc,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,KAAK,GAAG,CAAC,GAAG,GAAG,0BAA0B,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;QAC5F,IAAI,KAAK,GAAG,EAAE,CAAC;QACf,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxB,KAAK,GAAG,cAAc,CAAC,CAAC,EAAE,aAAa,MAAM,CAAC,MAAM,QAAQ,CAAC;QAC/D,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAC5B,MAAM,GAAG,GACP,wDAAwD,GAAG,kBAAkB;YAC7E,mCAAmC,GAAG,aAAa,CAAC,CAAC,EAAE,yBAAyB,CAAC,CAAC,IAAI,UAAU,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,aAAa;YAChI,aAAa,KAAK,mBAAmB,CAAC,CAAC,EAAE,QAAQ,CAAC;QACpD,MAAM,GAAG,GAAG,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAM,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACtE,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0C,CAAC;QACjE,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5D,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC;YACvE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACtB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,CAAC;gBAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YACrE,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1C,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;QACnJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,MAAM,CAAC,IAAY,EAAE,KAAY,EAAE,IAAiB,EAAE,KAAK,GAA4B,EAAE,EAAE,GAAG,GAAkB,EAAE,EAAE,IAAI,GAA4B,EAAE;QAC1J,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,wFAAwF;QACxF,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACvF,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;QAC3E,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpJ,MAAM,QAAQ,GACZ,UAAU,UAAU,qBAAqB,CAAC,CAAC,EAAE,mDAAmD;YAChG,QAAQ,CAAC,CAAC,IAAI,WAAW,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;QACjF,IAAI,KAAK,GAAG,EAAE,CAAC;QACf,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxB,KAAK,GAAG,2BAA2B,MAAM,CAAC,MAAM,QAAQ,CAAC;QAC3D,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAC5B,MAAM,GAAG,GAAG,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAM,kBAAkB,QAAQ,aAAa,KAAK,kCAAkC,MAAM,CAAC,MAAM,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;QACnJ,IAAI,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,MAAM,EAAE,GAAc,EAAE,CAAC;YACzB,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzI,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAgB,kCAAkC,CAAC,CAAC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3J,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1C,CAAC;QACD,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACtC,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAQ,CAAC;YACzC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;YACpE,OAAO,EAAE,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK;YAChC,KAAK;SACN,CAAC;IACJ,CAAC;IAED,gHAAgH;IACxG,OAAO,CAAC,CAAQ,EAAE,KAAa,EAAE,KAAY,EAAE,GAAkB,EAAE,IAA6B,EAAE,MAAiB,EAAE,KAAa;QACxI,IAAI,KAAK,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,yDAAyD,CAAC,CAAC;QAC1F,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,SAAS,IAAI,EAAE,CAAC;QAChE,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;gBAAE,SAAS,CAAC,0EAA0E;YAC/G,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC;YAC/B,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;YACtD,IAAI,CAAC,GAAG;gBAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC,GAAG,CAAC,IAAI,iBAAiB,IAAI,EAAE,CAAC,CAAC;YACnF,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,CAAC,GAAG,EAAE,CAAC;gBACT,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC3B,IAAI,CAAC,GAAG;oBAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,gCAAgC,CAAC,CAAC;gBACpG,MAAM,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7E,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,MAAM,KAAK,IAAI,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC9E,SAAS;YACX,CAAC;YACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACnC,MAAM,EAAE,GAAG,MAAM,KAAK,GAAG,CAAC,EAAE,CAAC;YAC7B,iGAAiG;YACjG,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;YAC7C,MAAM,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,EAAE,GAAG,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAClI,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7F,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;gBACvB,MAAM,SAAS,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACpC,IAAI,CAAC,SAAS;oBAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC,GAAG,CAAC,IAAI,iBAAiB,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;gBAC5F,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,IAAI,KAAK,CAAC,EAAE,MAAM,KAAK,IAAI,SAAS,EAAE,EAAE,GAAG,WAAW,CAAC,CAAC;gBAC5E,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,cAAc,eAAe,SAAS,KAAK,CAAC,IAAI,OAAO,EAAE,UAAU,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;gBACrH,SAAS;YACX,CAAC;YACD,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACvC,IAAI,CAAC,QAAQ;gBAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,GAAG,CAAC,IAAI,iBAAiB,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;YACzF,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;YACtC,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,IAAI,QAAQ,MAAM,KAAK,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,WAAW,CAAC,CAAC;YACvE,MAAM,IAAI,GACR,UAAU,eAAe,gBAAgB,EAAE,IAAI,KAAK,CAAC,EAAE,mDAAmD;gBAC1G,QAAQ,KAAK,CAAC,IAAI,OAAO,EAAE,UAAU,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,IAAI,KAAK,CAAC,EAAE,iBAAiB,MAAM,CAAC,MAAM,EAAE,CAAC;YACtH,KAAK,CAAC,IAAI,CACR,IAAI,GAAG,+BAA+B;gBACpC,iFAAiF;gBACjF,mDAAmD;gBACnD,+DAA+D;gBAC/D,8BAA8B;gBAC9B,WAAW,IAAI,aAAa,CAC/B,CAAC;QACJ,CAAC;QACD,OAAO,qBAAqB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IAClD,CAAC;IAED,6GAA6G;IACrG,WAAW,CAAC,CAAQ,EAAE,GAAkB,EAAE,IAA6B,EAAE,MAAiB,EAAE,KAAc,EAAE,GAAU;QAC5H,MAAM,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;QACzC,IAAI,CAAC,MAAM;YAAE,OAAO,EAAE,CAAC;QACvB,MAAM,GAAG,GAAY,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,IAAI,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;QAC5G,MAAM,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE;YAC5C,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC3B,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;YACtD,MAAM,SAAS,GAAG,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;YACzD,OAAO,SAAS,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;QACjI,CAAC,EAAE,MAAM,CAAC,CAAC;QACX,OAAO,CAAC,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACzC,CAAC;IAED,qGAAqG;IAC7F,SAAS,CAAC,IAAY;QAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACrC,OAAO,GAAG,CAAC,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7D,CAAC;IAEO,UAAU,CAAC,CAAQ,EAAE,KAA8B,EAAE,MAAiB;QAC5E,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE;YAC1C,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,GAAG;gBAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC,GAAG,CAAC,IAAI,iBAAiB,CAAC,EAAE,CAAC,CAAC;YAChF,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS;gBAAE,OAAO,GAAG,GAAG,UAAU,CAAC;YAC3D,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,OAAO,GAAG,GAAG,OAAO,MAAM,CAAC,MAAM,EAAE,CAAC;QACtC,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,KAAK,CAAC,MAAM,CAAC,CAAQ,EAAE,GAAW,EAAE,MAAiB;QAC3D,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAM,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACjF,CAAC;IAEO,GAAG,CAAC,CAAQ,EAAE,CAAM;QAC1B,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;YAAE,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,KAAK;gBAAE,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAChG,OAAO,GAAG,CAAC;IACb,CAAC;IAEO,KAAK,CAAC,IAAY;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,0CAA0C,IAAI,EAAE,CAAC,CAAC;QAC1E,OAAO,CAAC,CAAC;IACX,CAAC;IAEO,QAAQ,CAAC,IAAY;QAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACrC,OAAO,GAAG,EAAE,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;IAChD,CAAC;CACF;AAED,mFAAmF;AAEnF,iHAAiH;AACjH,SAAS,OAAO,CAAC,KAAY;IAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;IAChF,OAAO,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;AAC9E,CAAC;AAED,mFAAmF;AACnF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC;AAE7C,uGAAuG;AACvG,SAAS,OAAO,CAAC,CAAsC;IACrD,MAAM,IAAI,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;IACzB,MAAM,CAAC,GAAG,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,IAAgC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;IAC/H,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAChF,CAAC;AAED,8GAA8G;AAC9G,SAAS,gBAAgB,CAAC,WAAmE;IAC3F,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;IAC1D,MAAM,IAAI,GAAG,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACjC,OAAO,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,OAAO,IAAI,IAAI,CAAC,CAAC,CAAE,IAAwB,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;AAC3G,CAAC;AAKD,MAAM,KAAK,GAAa,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AACtD,MAAM,QAAQ,GAAG,CAAC,CAAU,EAAY,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;AACxF,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC;AACvC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC;AACzC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC;AAC7C,MAAM,YAAY,GAAG,iBAAiB,CAAC;AAEvC;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,CAAO,EAAE,GAAY,EAAE,QAAqD,EAAE,MAAiB;IAC3H,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;QACjB,IAAI,CAAC;YACH,OAAO,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC,CAAC,6GAA6G;QAC7H,CAAC;IACH,CAAC;IACD,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;QACZ,KAAK,MAAM,EAAE,CAAC;YACZ,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACjE,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,eAAe,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QAC9G,CAAC;QACD,KAAK,KAAK,EAAE,CAAC;YACX,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;YACpD,oFAAoF;YACpF,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,GAAG,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;QAClE,CAAC;QACD,KAAK,KAAK,EAAE,CAAC;YACX,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC;gBACnC,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;gBACpD,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;gBACpD,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;YACnG,CAAC;YACD,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,KAAK,CAAC,KAAK,KAAK,SAAS,CAAC;gBAAE,OAAO,KAAK,CAAC,CAAC,uDAAuD;YACzH,MAAM,KAAK,GAAG,CAAC,IAAI,IAAI,KAAK,CAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,IAAI,QAAQ,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAClC,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC1B,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,IAAI,CAAU,CAAC;YACf,IAAI,CAAC;gBACH,CAAC,GAAG,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC3B,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,KAAK,CAAC;YACf,CAAC;YACD,MAAM,EAAE,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAClD,OAAO,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;QACnC,CAAC;QACD;YACE,OAAO,KAAK,CAAC;IACjB,CAAC;AACH,CAAC;AAED,SAAS,OAAO,CAAC,CAAe,EAAE,EAAU,EAAE,CAAU,EAAE,MAAiB;IACzE,MAAM,GAAG,GAAG,CAAC,CAAU,EAAE,EAAE,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;IACjD,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;QAChB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YAAE,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC9C,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAC5D,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,OAAO,EAAE,GAAG,EAAE,YAAY,CAAC,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,mBAAmB,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QAC/H,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,OAAO,EAAE,GAAG,EAAE,YAAY,CAAC,CAAC,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC,sBAAsB,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QAClH,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;QAC/B,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,MAAM,OAAO,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QACpH,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAC5C,MAAM,GAAG,GAAG,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;QACtC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,MAAM,aAAa,GAAG,iBAAiB,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QAC1H,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,MAAM,OAAO,GAAG,iBAAiB,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QACjH,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS;YAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,MAAM,OAAO,GAAG,iBAAiB,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QACnH,gHAAgH;QAChH,uFAAuF;QACvF,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,IAAI;YAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,MAAM,MAAM,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QACrH,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;QACzF,OAAO,EAAE,GAAG,EAAE,YAAY,CAAC,CAAC,MAAM,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,mBAAmB,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IACvF,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,0FAA0F;AAC1F,SAAS,WAAW,CAAC,MAAc,EAAE,CAAU;IAC7C,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;QAAE,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC;IACnD,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC;QAAE,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC3E,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,OAAO,CAAC,KAAK,SAAS,CAAC;IACxD,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;QAAE,OAAO,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACjI,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,IAAI,CAAC,EAAU;IACtB,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;AAC5F,CAAC;AAED,iDAAiD;AACjD,SAAS,QAAQ,CAAC,CAAO;IACvB,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC5F,CAAC;AAED,SAAS,QAAQ,CAAC,CAAO;IACvB,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;QACZ,KAAK,KAAK;YACR,OAAO,KAAK,CAAC;QACf,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC;QAC3B,KAAK,KAAK;YACR,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,KAAK,KAAK;YACR,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACjC,CAAC;AACH,CAAC;AAED,SAAS,MAAM,CAAC,CAAU;IACxB,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,KAAK,CAAC;AACtD,CAAC;AAED,SAAS,KAAK,CAAC,IAAY;IACzB,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC;AACzC,CAAC;AAED,SAAS,KAAK,CAAC,IAAY;IACzB,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;AAC9D,CAAC","sourcesContent":["/**\n * Postgres for Rayfold resolvers: batch loads by id, keyset pages, one-to-many pages for a whole level in one query,\n * and read policies pushed into the SQL `WHERE` (spec 06 §4), so a list never fetches rows its viewer may not see.\n *\n * Works with any client that has `query(text, params)`: pg's `Pool` and `Client`, PGlite, or a wrapper of your own.\n * Every value travels as a bound parameter and every identifier is quoted.\n *\n * The pushed-down filter is a superset of the policy: it may let through a row the policy denies (the runtime's own\n * check then removes it), but it never drops a row the policy allows. Comparisons it cannot translate exactly, such as\n * ordering text or comparing across types, are left to the runtime.\n */\nimport { evalExpr, type Expr, type ExprEnv, type FieldDef, type RayfoldSchemaIR, type Shape } from \"@rayfold/schema\";\n\n/** Anything with pg's `query(text, params)`: `pg.Pool`, `pg.Client`, `PGlite`. */\nexport interface Queryable {\n  query<R = Record<string, unknown>>(text: string, params?: unknown[]): Promise<{ rows: R[] }>;\n}\n\nexport interface TableMapping {\n  /** The table, optionally schema-qualified (`\"public.books\"`). */\n  table: string;\n  /** The key column; default `\"id\"`. Pages are ordered by it. */\n  id?: string;\n  /** Field name to column name, for fields whose column is named otherwise (after `naming`). */\n  columns?: Record<string, string>;\n  /** Fields that lead to another mapped type. `screen` needs these; the batch loaders do not. */\n  relations?: Record<string, Relation>;\n}\n\n/**\n * How a field reaches another table. `one`: `key` is the field on *this* type holding the other row's key\n * (`Book.authorId`). `page`: `key` is the field on the *other* type holding this row's key (`Book.authorId`, as seen\n * from `Author.books`).\n */\nexport interface Relation {\n  type: string;\n  kind: \"one\" | \"page\";\n  key: string;\n}\n\nexport interface PgStoreOptions {\n  ir: RayfoldSchemaIR;\n  /** One mapping per entity type the store serves. */\n  tables: Record<string, TableMapping>;\n  /** How field names become column names when `columns` does not say: as they are (default) or snake_case. */\n  naming?: \"same\" | \"snake\";\n}\n\n/** What the store needs from a resolver's context: the viewer and the read policy the runtime pushed down (`ctx.policy`). */\nexport interface PolicyContext {\n  viewer?: unknown;\n  policy?: { filter?: Expr };\n  now?: () => number;\n}\n\nexport type Row = Record<string, unknown>;\nexport interface Page<T = Row> { items: T[]; cursor: string | null; hasMore: boolean; total: number }\nexport interface PageRequest { first: number; after?: string | null }\n\n/** A SQL fragment with its parameters numbered from 1. */\nexport interface Fragment { sql: string; exact: boolean }\n\nexport function createPgStore(db: Queryable, opts: PgStoreOptions): PgStore {\n  return new PgStore(db, opts);\n}\n\ninterface Table { name: string; id: string; idField: string; column(field: string): string | undefined; field(column: string): string; def: { name: string; fields: FieldDef[] } }\n\nexport class PgStore {\n  private readonly tables = new Map<string, Table>();\n\n  constructor(private readonly db: Queryable, private readonly opts: PgStoreOptions) {\n    for (const [type, m] of Object.entries(opts.tables)) {\n      const def = opts.ir.types[type];\n      if (!def || !(\"fields\" in def)) throw new Error(`@rayfold/postgres: ${type} is not an entity or object of the schema`);\n      const columns = new Map<string, string>();\n      for (const f of def.fields) columns.set(f.name, m.columns?.[f.name] ?? (opts.naming === \"snake\" ? snake(f.name) : f.name));\n      for (const [f, c] of Object.entries(m.columns ?? {})) columns.set(f, c);\n      const id = m.id ?? \"id\";\n      const idField = [...columns].find(([, c]) => c === id)?.[0] ?? \"id\";\n      const fields = new Map([...columns].map(([f, c]) => [c, f]));\n      this.tables.set(type, {\n        name: m.table.split(\".\").map(quote).join(\".\"),\n        id: quote(id),\n        idField,\n        column: (f) => (columns.has(f) ? quote(columns.get(f)!) : undefined),\n        field: (c) => fields.get(c) ?? c,\n        def: { name: def.name, fields: def.fields },\n      });\n    }\n  }\n\n  /**\n   * Rows of `type` for `ids`, in the order asked: `null` where a row is missing or hidden by the pushed-down read policy.\n   * One query for any number of ids, which makes it the batch loader for a to-one field.\n   */\n  async byIds(type: string, ids: readonly unknown[], ctx: PolicyContext = {}, args: Record<string, unknown> = {}): Promise<Array<Row | null>> {\n    if (!ids.length) return [];\n    const t = this.table(type);\n    const params: unknown[] = [[...new Set(ids.filter((x) => x !== null && x !== undefined).map(String))]];\n    const where = [`${t.id}::text = ANY($1::text[])`, ...this.policyWhere(t, ctx, args, params)];\n    const rows = await this.select(t, `SELECT * FROM ${t.name} WHERE ${where.join(\" AND \")}`, params);\n    const byId = new Map(rows.map((r) => [String(r[t.idField]), r]));\n    return ids.map((id) => (id === null || id === undefined ? null : (byId.get(String(id)) ?? null)));\n  }\n\n  /** Rows of `type` whose fields equal `where` (a `null` value matches NULL), in key order. One query. */\n  async find(type: string, where: Record<string, unknown> = {}, ctx: PolicyContext = {}, args: Record<string, unknown> = {}): Promise<Row[]> {\n    const t = this.table(type);\n    const params: unknown[] = [];\n    const conds = [...this.equalities(t, where, params), ...this.policyWhere(t, ctx, args, params)];\n    return this.select(t, `SELECT * FROM ${t.name}${conds.length ? ` WHERE ${conds.join(\" AND \")}` : \"\"} ORDER BY ${t.id}`, params);\n  }\n\n  /**\n   * One page of `type` in key order, after `page.after` (a key), with `total` counting every visible matching row.\n   * One query; a second one counts only when the page comes back empty.\n   */\n  async page(type: string, page: PageRequest, where: Record<string, unknown> = {}, ctx: PolicyContext = {}, args: Record<string, unknown> = {}): Promise<Page> {\n    const t = this.table(type);\n    const params: unknown[] = [];\n    const conds = [...this.equalities(t, where, params), ...this.policyWhere(t, ctx, args, params)];\n    const filtered = `SELECT *, count(*) OVER () AS \"__total\" FROM ${t.name}${conds.length ? ` WHERE ${conds.join(\" AND \")}` : \"\"}`;\n    let after = \"\";\n    if (page.after) {\n      params.push(page.after);\n      after = ` WHERE \"__s\".${t.id}::text > $${params.length}::text`;\n    }\n    params.push(page.first + 1);\n    const raw = (await this.db.query<Row>(`SELECT * FROM (${filtered}) AS \"__s\"${after} ORDER BY \"__s\".${t.id}::text LIMIT $${params.length}`, params)).rows;\n    let total = raw.length ? Number(raw[0]![\"__total\"]) : 0;\n    if (!raw.length && page.after) {\n      const count = await this.db.query<{ n: number }>(`SELECT count(*)::int AS n FROM ${t.name}${conds.length ? ` WHERE ${conds.join(\" AND \")}` : \"\"}`, params.slice(0, params.length - 2));\n      total = Number(count.rows[0]?.n ?? 0);\n    }\n    const rows = raw.map((r) => this.row(t, r));\n    const items = rows.slice(0, page.first);\n    return { items, cursor: items.length ? String(items[items.length - 1]![t.idField]) : null, hasMore: rows.length > page.first, total };\n  }\n\n  /**\n   * For each parent key in `values`, the page of `type` rows whose `field` equals it: the batch loader for a paged\n   * one-to-many field (an author's books). One query for the whole level, whatever the number of parents.\n   */\n  async pagesByField(type: string, field: string, values: readonly unknown[], page: PageRequest, ctx: PolicyContext = {}, args: Record<string, unknown> = {}): Promise<Page[]> {\n    if (!values.length) return [];\n    const t = this.table(type);\n    const col = t.column(field);\n    if (!col) throw new Error(`@rayfold/postgres: ${type} has no field ${field}`);\n    const params: unknown[] = [[...new Set(values.map(String))]];\n    const conds = [`${col}::text = ANY($1::text[])`, ...this.policyWhere(t, ctx, args, params)];\n    let after = \"\";\n    if (page.after) {\n      params.push(page.after);\n      after = ` AND \"__s\".${t.id}::text > $${params.length}::text`;\n    }\n    params.push(page.first + 1);\n    const sql =\n      `SELECT * FROM (SELECT *, count(*) OVER (PARTITION BY ${col}) AS \"__total\", ` +\n      `row_number() OVER (PARTITION BY ${col} ORDER BY ${t.id}::text) AS \"__n\" FROM ${t.name} WHERE ${conds.join(\" AND \")}) AS \"__s\" ` +\n      `WHERE TRUE${after} ORDER BY \"__s\".${t.id}::text`;\n    const raw = (await this.db.query<Row>(sql, params.slice(0, -1))).rows;\n    const groups = new Map<string, { rows: Row[]; total: number }>();\n    for (const r of raw) {\n      const key = String(r[col.slice(1, -1).replace(/\"\"/g, '\"')]);\n      const g = groups.get(key) ?? { rows: [], total: Number(r[\"__total\"]) };\n      g.rows.push(this.row(t, r));\n      groups.set(key, g);\n    }\n    return values.map((v) => {\n      const g = groups.get(String(v));\n      if (!g) return { items: [], cursor: null, hasMore: false, total: 0 };\n      const items = g.rows.slice(0, page.first);\n      return { items, cursor: items.length ? String(items[items.length - 1]![t.idField]) : null, hasMore: g.rows.length > page.first, total: g.total };\n    });\n  }\n\n  /**\n   * One statement for a whole screen: a page of `type` with every nested field the shape asks for, gathered as JSON\n   * by correlated subqueries. Depth costs no extra round trip, and each level's read policy is pushed into its own\n   * `WHERE`, so a nested list never carries rows its viewer may not see.\n   *\n   * Nested pages are first pages (`first`), which is what a screen shows; the root page takes a cursor as usual.\n   * Every selected field must be a mapped column or a declared relation.\n   */\n  async screen(type: string, shape: Shape, page: PageRequest, where: Record<string, unknown> = {}, ctx: PolicyContext = {}, args: Record<string, unknown> = {}): Promise<Page> {\n    const t = this.table(type);\n    const params: unknown[] = [];\n    // The caller may pass the shape of the Page the query returns, or the shape of one row.\n    const rowShape = t.def.fields.some((f) => f.name === \"items\") ? shape : itemsOf(shape);\n    const projection = this.project(t, \"__r0\", rowShape, ctx, args, params, 0);\n    const conds = [...this.equalities(t, where, params), ...this.policyWhere(t, ctx, args, params, \"__r0\", ctx.policy?.filter ?? this.filterFor(type))];\n    const filtered =\n      `SELECT ${projection} AS \"__row\", __r0.${t.id}::text AS \"__key\", count(*) OVER () AS \"__total\" ` +\n      `FROM ${t.name} AS __r0${conds.length ? ` WHERE ${conds.join(\" AND \")}` : \"\"}`;\n    let after = \"\";\n    if (page.after) {\n      params.push(page.after);\n      after = ` WHERE \"__s\".\"__key\" > $${params.length}::text`;\n    }\n    params.push(page.first + 1);\n    const raw = (await this.db.query<Row>(`SELECT * FROM (${filtered}) AS \"__s\"${after} ORDER BY \"__s\".\"__key\" LIMIT $${params.length}`, params)).rows;\n    let total = raw.length ? Number(raw[0]![\"__total\"]) : 0;\n    if (!raw.length && page.after) {\n      const cp: unknown[] = [];\n      const cc = [...this.equalities(t, where, cp), ...this.policyWhere(t, ctx, args, cp, \"__r0\", ctx.policy?.filter ?? this.filterFor(type))];\n      const counted = await this.db.query<{ n: number }>(`SELECT count(*)::int AS n FROM ${t.name} AS __r0${cc.length ? ` WHERE ${cc.join(\" AND \")}` : \"\"}`, cp);\n      total = Number(counted.rows[0]?.n ?? 0);\n    }\n    const rows = raw.slice(0, page.first);\n    return {\n      items: rows.map((r) => r[\"__row\"] as Row),\n      cursor: rows.length ? String(rows[rows.length - 1]![\"__key\"]) : null,\n      hasMore: raw.length > page.first,\n      total,\n    };\n  }\n\n  /** The JSON projection of one level of a screen: scalars from columns, relations from correlated subqueries. */\n  private project(t: Table, alias: string, shape: Shape, ctx: PolicyContext, args: Record<string, unknown>, params: unknown[], depth: number): string {\n    if (depth > 8) throw new Error(\"@rayfold/postgres: a screen nested deeper than 8 levels\");\n    const relations = this.opts.tables[t.def.name]?.relations ?? {};\n    const parts: string[] = [];\n    for (const item of shape.items) {\n      if (item.kind !== \"field\") continue; // views and type conditions are expanded before a shape reaches the store\n      const name = item.name;\n      const out = item.alias ?? name;\n      const def = t.def.fields.find((f) => f.name === name);\n      if (!def) throw new Error(`@rayfold/postgres: ${t.def.name} has no field ${name}`);\n      const rel = relations[name];\n      if (!rel) {\n        const col = t.column(name);\n        if (!col) throw new Error(`@rayfold/postgres: ${t.def.name}.${name} has no column and no relation`);\n        const scalar = def.type.kind === \"named\" ? this.scalarOf(def.type.name) : \"\";\n        parts.push(`'${out}', ${alias}.${col}${AS_TEXT.has(scalar) ? \"::text\" : \"\"}`);\n        continue;\n      }\n      const child = this.table(rel.type);\n      const ca = `__r${depth + 1}`;\n      // A paged field is selected through its Page envelope, so the rows are described by its `items`.\n      const selected = item.shape ?? { items: [] };\n      const childProjection = this.project(child, ca, rel.kind === \"page\" ? itemsOf(selected) : selected, ctx, args, params, depth + 1);\n      const childPolicy = this.policyWhere(child, ctx, args, params, ca, this.filterFor(rel.type));\n      if (rel.kind === \"one\") {\n        const parentCol = t.column(rel.key);\n        if (!parentCol) throw new Error(`@rayfold/postgres: ${t.def.name} has no field ${rel.key}`);\n        const conds = [`${ca}.${child.id} = ${alias}.${parentCol}`, ...childPolicy];\n        parts.push(`'${out}', (SELECT ${childProjection} FROM ${child.name} AS ${ca} WHERE ${conds.join(\" AND \")} LIMIT 1)`);\n        continue;\n      }\n      const childCol = child.column(rel.key);\n      if (!childCol) throw new Error(`@rayfold/postgres: ${rel.type} has no field ${rel.key}`);\n      params.push(firstOf(item.args) ?? 10);\n      const conds = [`${ca}.${childCol} = ${alias}.${t.id}`, ...childPolicy];\n      const rows =\n        `SELECT ${childProjection} AS \"__row\", ${ca}.${child.id}::text AS \"__key\", count(*) OVER () AS \"__total\" ` +\n        `FROM ${child.name} AS ${ca} WHERE ${conds.join(\" AND \")} ORDER BY ${ca}.${child.id}::text LIMIT $${params.length}`;\n      parts.push(\n        `'${out}', (SELECT json_build_object(` +\n          `'items', coalesce(json_agg(\"__p\".\"__row\" ORDER BY \"__p\".\"__key\"), '[]'::json), ` +\n          `'total', coalesce(max(\"__p\".\"__total\"), 0)::int, ` +\n          `'hasMore', coalesce(count(*) < max(\"__p\".\"__total\"), false), ` +\n          `'cursor', max(\"__p\".\"__key\")` +\n          `) FROM (${rows}) AS \"__p\")`,\n      );\n    }\n    return `json_build_object(${parts.join(\", \")})`;\n  }\n\n  /** The WHERE fragment for the read policy the runtime pushed down, or nothing when there is none to push. */\n  private policyWhere(t: Table, ctx: PolicyContext, args: Record<string, unknown>, params: unknown[], alias?: string, own?: Expr): string[] {\n    const filter = own ?? ctx.policy?.filter;\n    if (!filter) return [];\n    const env: ExprEnv = { viewer: ctx.viewer ?? null, args, this: null, ...(ctx.now ? { now: ctx.now } : {}) };\n    const f = compilePolicy(filter, env, (name) => {\n      const col = t.column(name);\n      const def = t.def.fields.find((x) => x.name === name);\n      const qualified = col && alias ? `${alias}.${col}` : col;\n      return qualified && def && def.type.kind === \"named\" ? { column: qualified, scalar: this.scalarOf(def.type.name) } : undefined;\n    }, params);\n    return f.sql === \"TRUE\" ? [] : [f.sql];\n  }\n\n  /** The read policy declared on a type, for the levels of a screen the runtime handed no hint for. */\n  private filterFor(type: string): Expr | undefined {\n    const def = this.opts.ir.types[type];\n    return def ? pushableFilterOf(def.annotations) : undefined;\n  }\n\n  private equalities(t: Table, where: Record<string, unknown>, params: unknown[]): string[] {\n    return Object.entries(where).map(([f, v]) => {\n      const col = t.column(f);\n      if (!col) throw new Error(`@rayfold/postgres: ${t.def.name} has no field ${f}`);\n      if (v === null || v === undefined) return `${col} IS NULL`;\n      params.push(v);\n      return `${col} = $${params.length}`;\n    });\n  }\n\n  private async select(t: Table, sql: string, params: unknown[]): Promise<Row[]> {\n    return (await this.db.query<Row>(sql, params)).rows.map((r) => this.row(t, r));\n  }\n\n  private row(t: Table, r: Row): Row {\n    const out: Row = {};\n    for (const [k, v] of Object.entries(r)) if (k !== \"__total\" && k !== \"__n\") out[t.field(k)] = v;\n    return out;\n  }\n\n  private table(type: string): Table {\n    const t = this.tables.get(type);\n    if (!t) throw new Error(`@rayfold/postgres: no table mapped for ${type}`);\n    return t;\n  }\n\n  private scalarOf(name: string): string {\n    const def = this.opts.ir.types[name];\n    return def?.kind === \"enum\" ? \"String\" : name;\n  }\n}\n\n// ---------------------------------------------------------------- policies to SQL\n\n/** The rows of a `Page<T>` selection: the sub-shape of its `items`, or the shape itself when it selects rows. */\nfunction itemsOf(shape: Shape): Shape {\n  const items = shape.items.find((i) => i.kind === \"field\" && i.name === \"items\");\n  return items && items.kind === \"field\" && items.shape ? items.shape : shape;\n}\n\n/** Scalars Postgres would render as a JSON number, but Rayfold carries as text. */\nconst AS_TEXT = new Set([\"Decimal\", \"Long\"]);\n\n/** The page size a shape asked for (`page: { first: n }` or `first: n`), when it is a plain number. */\nfunction firstOf(a: Record<string, unknown> | undefined): number | undefined {\n  const page = a?.[\"page\"];\n  const n = page && typeof page === \"object\" && !Array.isArray(page) ? (page as Record<string, unknown>)[\"first\"] : a?.[\"first\"];\n  return typeof n === \"number\" && Number.isInteger(n) && n >= 0 ? n : undefined;\n}\n\n/** The pushable part of a type's `@allow(read:)`, for the levels of a screen the runtime gave no hint for. */\nfunction pushableFilterOf(annotations: Array<{ name: string; args: Record<string, unknown> }>): Expr | undefined {\n  const allow = annotations.find((a) => a.name === \"allow\");\n  const read = allow?.args[\"read\"];\n  return read && typeof read === \"object\" && \"$expr\" in read ? (read as { $expr: Expr }).$expr : undefined;\n}\n\n/** A column a policy may read, with the Rayfold scalar type of its field. */\nexport interface PolicyColumn { column: string; scalar: string }\n\nconst LOOSE: Fragment = { sql: \"TRUE\", exact: false };\nconst constant = (b: boolean): Fragment => ({ sql: b ? \"TRUE\" : \"FALSE\", exact: true });\nconst TEXT = new Set([\"String\", \"ID\"]);\nconst NUMBER = new Set([\"Int\", \"Float\"]);\nconst DECIMAL = new Set([\"Decimal\", \"Long\"]);\nconst DECIMAL_TEXT = /^-?\\d+(\\.\\d+)?$/;\n\n/**\n * Translates a pushable read policy (spec 06 §4) into a WHERE fragment under `env` (the viewer and args), appending\n * its values to `params`. Parts that read no field of the row are evaluated here, as the runtime would. `exact` is true\n * when the fragment selects exactly the rows the policy allows; otherwise it selects more, never fewer.\n */\nexport function compilePolicy(e: Expr, env: ExprEnv, columnOf: (field: string) => PolicyColumn | undefined, params: unknown[]): Fragment {\n  if (!readsRow(e)) {\n    try {\n      return constant(truthy(evalExpr(e, env)));\n    } catch {\n      return LOOSE; // an expression that cannot be evaluated denies, but maybe only where it is reached: leave it to the runtime\n    }\n  }\n  switch (e.k) {\n    case \"path\": {\n      const c = e.path.length === 1 ? columnOf(e.path[0]!) : undefined;\n      if (!c) return LOOSE;\n      return { sql: c.scalar === \"Boolean\" ? `(${c.column} IS TRUE)` : `(${c.column} IS NOT NULL)`, exact: true };\n    }\n    case \"not\": {\n      const f = compilePolicy(e.e, env, columnOf, params);\n      // negating a superset would give a subset, so only an exact fragment can be negated\n      return f.exact ? { sql: `(NOT ${f.sql})`, exact: true } : LOOSE;\n    }\n    case \"bin\": {\n      if (e.op === \"&&\" || e.op === \"||\") {\n        const l = compilePolicy(e.l, env, columnOf, params);\n        const r = compilePolicy(e.r, env, columnOf, params);\n        return { sql: `(${l.sql} ${e.op === \"&&\" ? \"AND\" : \"OR\"} ${r.sql})`, exact: l.exact && r.exact };\n      }\n      const left = rowField(e.l);\n      const right = rowField(e.r);\n      if ((left === undefined) === (right === undefined)) return LOOSE; // both sides read the row, or neither is a plain field\n      const field = (left ?? right)!;\n      const other = left !== undefined ? e.r : e.l;\n      if (readsRow(other)) return LOOSE;\n      const c = columnOf(field);\n      if (!c) return LOOSE;\n      let v: unknown;\n      try {\n        v = evalExpr(other, env);\n      } catch {\n        return LOOSE;\n      }\n      const op = left !== undefined ? e.op : flip(e.op);\n      return compare(c, op, v, params);\n    }\n    default:\n      return LOOSE;\n  }\n}\n\nfunction compare(c: PolicyColumn, op: string, v: unknown, params: unknown[]): Fragment {\n  const add = (x: unknown) => `$${params.push(x)}`;\n  if (op === \"in\") {\n    if (!Array.isArray(v)) return constant(false);\n    if (!v.every((x) => kindMatches(c.scalar, x))) return LOOSE;\n    if (TEXT.has(c.scalar)) return { sql: `COALESCE(${c.column}::text = ANY(${add(v.map(String))}::text[]), FALSE)`, exact: true };\n    if (NUMBER.has(c.scalar)) return { sql: `COALESCE(${c.column} = ANY(${add(v)}::numeric[]), FALSE)`, exact: true };\n    return LOOSE;\n  }\n  if (op === \"==\" || op === \"!=\") {\n    if (v === null || v === undefined) return { sql: `(${c.column} IS ${op === \"==\" ? \"\" : \"NOT \"}NULL)`, exact: true };\n    if (!kindMatches(c.scalar, v)) return LOOSE;\n    const not = op === \"==\" ? \"NOT \" : \"\";\n    if (TEXT.has(c.scalar)) return { sql: `(${c.column}::text IS ${not}DISTINCT FROM ${add(String(v))}::text)`, exact: true };\n    if (NUMBER.has(c.scalar)) return { sql: `(${c.column} IS ${not}DISTINCT FROM ${add(v)}::numeric)`, exact: true };\n    if (c.scalar === \"Boolean\") return { sql: `(${c.column} IS ${not}DISTINCT FROM ${add(v)}::boolean)`, exact: true };\n    // Decimal and Long travel as text: SQL compares by value, the runtime may compare the text, so equality selects\n    // more rows than the policy and inequality could select fewer; only equality is pushed\n    if (DECIMAL.has(c.scalar) && op === \"==\") return { sql: `(${c.column} = ${add(String(v))}::numeric)`, exact: false };\n    return LOOSE;\n  }\n  if ([\"<\", \"<=\", \">\", \">=\"].includes(op) && typeof v === \"number\" && NUMBER.has(c.scalar)) {\n    return { sql: `COALESCE(${c.column} ${op} ${add(v)}::numeric, FALSE)`, exact: true };\n  }\n  return LOOSE;\n}\n\n/** Whether `v` is a value the runtime could find equal to a field of this scalar type. */\nfunction kindMatches(scalar: string, v: unknown): boolean {\n  if (TEXT.has(scalar)) return typeof v === \"string\";\n  if (NUMBER.has(scalar)) return typeof v === \"number\" && Number.isFinite(v);\n  if (scalar === \"Boolean\") return typeof v === \"boolean\";\n  if (DECIMAL.has(scalar)) return (typeof v === \"string\" && DECIMAL_TEXT.test(v)) || (typeof v === \"number\" && Number.isFinite(v));\n  return false;\n}\n\nfunction flip(op: string): string {\n  return op === \"<\" ? \">\" : op === \">\" ? \"<\" : op === \"<=\" ? \">=\" : op === \">=\" ? \"<=\" : op;\n}\n\n/** The field name when `e` is `this.<field>`. */\nfunction rowField(e: Expr): string | undefined {\n  return e.k === \"path\" && e.root === \"this\" && e.path.length === 1 ? e.path[0] : undefined;\n}\n\nfunction readsRow(e: Expr): boolean {\n  switch (e.k) {\n    case \"lit\":\n      return false;\n    case \"path\":\n      return e.root === \"this\";\n    case \"not\":\n      return readsRow(e.e);\n    case \"bin\":\n      return readsRow(e.l) || readsRow(e.r);\n    case \"list\":\n      return e.items.some(readsRow);\n    case \"call\":\n      return e.args.some(readsRow);\n  }\n}\n\nfunction truthy(v: unknown): boolean {\n  return v !== null && v !== undefined && v !== false;\n}\n\nfunction quote(name: string): string {\n  return `\"${name.replace(/\"/g, '\"\"')}\"`;\n}\n\nfunction snake(name: string): string {\n  return name.replace(/[A-Z]/g, (c) => `_${c.toLowerCase()}`);\n}\n"]}

package/package.json

@@ -0,0 +1,43 @@
+{
+  "name": "@rayfold/postgres",
+  "version": "0.1.0",
+  "description": "Postgres for Rayfold resolvers: batch loads, keyset pages, one query per level, and read policies pushed into SQL.",
+  "keywords": [
+    "rayfold",
+    "api",
+    "protocol",
+    "postgres",
+    "sql",
+    "batch",
+    "authorization"
+  ],
+  "license": "Apache-2.0",
+  "homepage": "https://eddyboutros.github.io/rayfold/",
+  "bugs": {
+    "url": "https://github.com/eddyboutros/rayfold/issues"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/eddyboutros/rayfold.git",
+    "directory": "packages/postgres"
+  },
+  "type": "module",
+  "sideEffects": false,
+  "engines": {
+    "node": ">=22"
+  },
+  "main": "./index.js",
+  "types": "./index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./index.d.ts",
+      "default": "./index.js"
+    }
+  },
+  "peerDependencies": {
+    "@rayfold/schema": "^0.1.0"
+  },
+  "publishConfig": {
+    "access": "public"
+  }
+}