@laguzjs/client 0.0.0-stage → 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Maxence Leguery
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -1,3 +1,31 @@
-# Temporary Holding Version
+# @laguzjs/client
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+Batch every GraphQL query a React commit needs into one request, and stream the
+answer back field by field.
+
+```sh
+npm install @laguzjs/client
+```
+
+```tsx
+import { createPool, httpFetcher } from "@laguzjs/client";
+import { useData } from "@laguzjs/client/react";
+
+const pool = createPool(httpFetcher("/graphql", { stream: true }));
+
+function Header() {
+  const { data, loading, error } = useData(pool, "user", { id: 1 }, ["name"]);
+  return <h1>{data?.name}</h1>;
+}
+```
+
+Works with any GraphQL server. Pair it with
+[`@laguzjs/server`](https://www.npmjs.com/package/@laguzjs/server) to stream
+fields as they resolve and to resolve dependent queries in one round trip.
+
+Documentation: [guide](https://github.com/maxenceleguery/laguz/blob/main/docs/guide.md)
+and [laguz.maxenceleguery.net](https://laguz.maxenceleguery.net).
+
+## License
+
+MIT

package/dist/http.d.ts

@@ -0,0 +1,9 @@
+import type { Fetcher } from "./pool.ts";
+export type HttpOptions = {
+    /** Ask for one NDJSON line per root field. Falls back to JSON if the server doesn't stream. */
+    stream?: boolean;
+    headers?: Record<string, string>;
+};
+/** A fetcher that POSTs `{ query }` to `url`. */
+export declare function httpFetcher(url: string, options?: HttpOptions): Fetcher;
+//# sourceMappingURL=http.d.ts.map

package/dist/http.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"http.d.ts","sourceRoot":"","sources":["../src/http.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAA2B,MAAM,WAAW,CAAC;AAElE,MAAM,MAAM,WAAW,GAAG;IACxB,+FAA+F;IAC/F,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAClC,CAAC;AAEF,iDAAiD;AACjD,wBAAgB,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,GAAE,WAAgB,GAAG,OAAO,CAa3E"}

package/dist/http.js

@@ -0,0 +1,36 @@
+/** A fetcher that POSTs `{ query }` to `url`. */
+export function httpFetcher(url, options = {}) {
+    return (query) => {
+        const res = fetch(url, {
+            method: "POST",
+            headers: {
+                "content-type": "application/json",
+                accept: options.stream ? "application/x-ndjson, application/json" : "application/json",
+                ...options.headers,
+            },
+            body: JSON.stringify({ query }),
+        });
+        return options.stream ? lines(res) : res.then((r) => r.json());
+    };
+}
+async function* lines(pending) {
+    const res = await pending;
+    if (!res.headers.get("content-type")?.includes("ndjson")) {
+        yield await res.json();
+        return;
+    }
+    let buffer = "";
+    for await (const text of res.body.pipeThrough(new TextDecoderStream())) {
+        buffer += text;
+        let newline;
+        while ((newline = buffer.indexOf("\n")) >= 0) {
+            const line = buffer.slice(0, newline);
+            buffer = buffer.slice(newline + 1);
+            if (line.trim())
+                yield JSON.parse(line);
+        }
+    }
+    if (buffer.trim())
+        yield JSON.parse(buffer);
+}
+//# sourceMappingURL=http.js.map

package/dist/http.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"http.js","sourceRoot":"","sources":["../src/http.ts"],"names":[],"mappings":"AAQA,iDAAiD;AACjD,MAAM,UAAU,WAAW,CAAC,GAAW,EAAE,OAAO,GAAgB,EAAE;IAChE,OAAO,CAAC,KAAK,EAAE,EAAE;QACf,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE;YACrB,MAAM,EAAE,MAAM;YACd,OAAO,EAAE;gBACP,cAAc,EAAE,kBAAkB;gBAClC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,wCAAwC,CAAC,CAAC,CAAC,kBAAkB;gBACtF,GAAG,OAAO,CAAC,OAAO;aACnB;YACD,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,CAAC;SAChC,CAAC,CAAC;QACH,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IACjE,CAAC,CAAC;AACJ,CAAC;AAED,KAAK,SAAS,CAAC,CAAC,KAAK,CAAC,OAA0B;IAC9C,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC;IAC1B,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;QACzD,MAAM,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC;QACvB,OAAO;IACT,CAAC;IACD,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,GAAG,CAAC,IAAK,CAAC,WAAW,CAAC,IAAI,iBAAiB,EAAE,CAAC,EAAE,CAAC;QACxE,MAAM,IAAI,IAAI,CAAC;QACf,IAAI,OAAO,CAAC;QACZ,OAAO,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7C,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACtC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;YACnC,IAAI,IAAI,CAAC,IAAI,EAAE;gBAAE,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;IACD,IAAI,MAAM,CAAC,IAAI,EAAE;QAAE,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AAC9C,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,7 @@
+export { createPool, ready } from "./pool.ts";
+export type { Fetcher, GqlError, Match, Options, Pool, Response, Snapshot } from "./pool.ts";
+export { fieldKey, printField, ref, toTree, view } from "./selection.ts";
+export type { FieldArg, Fields, Ref, Tree } from "./selection.ts";
+export { httpFetcher } from "./http.ts";
+export type { HttpOptions } from "./http.ts";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AAC9C,YAAY,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAC7F,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,gBAAgB,CAAC;AACzE,YAAY,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AACxC,YAAY,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC"}

package/dist/index.js

@@ -0,0 +1,4 @@
+export { createPool, ready } from "./pool.js";
+export { fieldKey, printField, ref, toTree, view } from "./selection.js";
+export { httpFetcher } from "./http.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AAE9C,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAEzE,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC"}

package/dist/pool.d.ts

@@ -0,0 +1,52 @@
+import { type Fields, type Tree } from "./selection.ts";
+export type GqlError = {
+    message: string;
+    path?: (string | number)[];
+};
+export type Response = {
+    data?: Record<string, unknown> | null;
+    errors?: GqlError[];
+    extensions?: Record<string, unknown>;
+};
+/** Sends a query. Returns one response, or a stream of partial responses. */
+export type Fetcher = (query: string) => Promise<Response> | AsyncIterable<Response>;
+export type Snapshot = {
+    data?: any;
+    error?: Error;
+    has: Tree;
+};
+/** A root field name, or a predicate on the root field and its printed arguments. */
+export type Match = string | ((root: string, args: string) => boolean);
+export type Options = {
+    /** Milliseconds before cached data is refetched when a new consumer mounts. Default 0. */
+    staleTime?: number;
+    /** Milliseconds an entry without consumers stays cached. Default 5 minutes. */
+    gcTime?: number;
+    /** Retries before an error is reported. Default 3. */
+    retry?: number;
+    /** Delay before retry `attempt` (0-based). Default exponential, capped at 30 s. */
+    retryDelay?: (attempt: number) => number;
+    /** Maximum root fields per request, for servers that limit aliases. Default unlimited. */
+    maxBatch?: number;
+    /**
+     * Whether the server resolves refs itself (see @laguzjs/server), so dependent
+     * queries can share a request. `"auto"` (default) starts resolving refs on
+     * the client and switches once a response carries `extensions.laguz`.
+     */
+    serverRefs?: boolean | "auto";
+};
+/** Whether `snap` holds everything `tree` selects. */
+export declare const ready: (snap: Snapshot, tree: Tree) => boolean;
+export declare function createPool(fetcher: Fetcher, options?: Options): {
+    watch: (root: string, args: object, fields: Fields | Tree, cb: () => void, minStaleTime?: number) => () => void;
+    read: (root: string, args: object) => Snapshot;
+    load: (root: string, args: object, fields: Fields | Tree) => Promise<void>;
+    invalidate: (match?: Match) => void;
+    set: (root: string, args: object, fn: (data: any) => any) => () => void;
+    mutate: <T>(run: () => Promise<T>, o?: {
+        optimistic?: [root: string, args: object, fn: (data: any) => any][];
+        invalidate?: Match[];
+    }) => Promise<T>;
+};
+export type Pool = ReturnType<typeof createPool>;
+//# sourceMappingURL=pool.d.ts.map

package/dist/pool.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pool.d.ts","sourceRoot":"","sources":["../src/pool.ts"],"names":[],"mappings":"AAAA,OAAO,EAaL,KAAK,MAAM,EAEX,KAAK,IAAI,EACV,MAAM,gBAAgB,CAAC;AAExB,MAAM,MAAM,QAAQ,GAAG;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,CAAA;CAAE,CAAC;AACvE,MAAM,MAAM,QAAQ,GAAG;IACrB,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;IACtC,MAAM,CAAC,EAAE,QAAQ,EAAE,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACtC,CAAC;AACF,6EAA6E;AAC7E,MAAM,MAAM,OAAO,GAAG,CAAC,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC,QAAQ,CAAC,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;AACrF,MAAM,MAAM,QAAQ,GAAG;IAAE,IAAI,CAAC,EAAE,GAAG,CAAC;IAAC,KAAK,CAAC,EAAE,KAAK,CAAC;IAAC,GAAG,EAAE,IAAI,CAAA;CAAE,CAAC;AAChE,qFAAqF;AACrF,MAAM,MAAM,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC;AAEvE,MAAM,MAAM,OAAO,GAAG;IACpB,0FAA0F;IAC1F,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,+EAA+E;IAC/E,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,sDAAsD;IACtD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,mFAAmF;IACnF,UAAU,CAAC,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,MAAM,CAAC;IACzC,0FAA0F;IAC1F,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,UAAU,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC;CAC/B,CAAC;AA8BF,sDAAsD;AACtD,eAAO,MAAM,KAAK,SAAU,QAAQ,QAAQ,IAAI,KAAG,OACV,CAAC;AAS1C,wBAAgB,UAAU,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,GAAE,OAAY;kBAkRxD,MAAM,QACN,MAAM,UACJ,MAAM,GAAG,IAAI,MACjB,MAAM,IAAI;iBAsBI,MAAM,QAAQ,MAAM,KAAG,QAAQ;iBAO/B,MAAM,QAAQ,MAAM,UAAU,MAAM,GAAG,IAAI,KAAG,OAAO,CAAC,IAAI,CAAC;yBAlEnD,KAAK;gBAgBd,MAAM,QAAQ,MAAM,MAAM,CAAC,IAAI,EAAE,GAAG,KAAK,GAAG;aA2EzC,CAAC,OAChB,MAAM,OAAO,CAAC,CAAC,CAAC,MAClB;QACD,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC;QACpE,UAAU,CAAC,EAAE,KAAK,EAAE,CAAC;KACtB,KACA,OAAO,CAAC,CAAC,CAAC;EAad;AAED,MAAM,MAAM,IAAI,GAAG,UAAU,CAAC,OAAO,UAAU,CAAC,CAAC"}

package/dist/pool.js

@@ -0,0 +1,339 @@
+import { collectRefs, diff, getPath, merge, mergeData, name, pathTree, printArgs, printTree, printValue, toTree, touchesList, } from "./selection.js";
+const EMPTY = Object.freeze({ has: {} });
+/** Whether `snap` holds everything `tree` selects. */
+export const ready = (snap, tree) => "data" in snap && !diff(tree, snap.has);
+function unref(timer) {
+    timer?.unref?.();
+    return timer;
+}
+const toError = (err) => (err instanceof Error ? err : new Error(err.message));
+export function createPool(fetcher, options = {}) {
+    const { staleTime = 0, gcTime = 5 * 60_000, retry = 3, retryDelay = (attempt) => Math.min(1000 * 2 ** attempt, 30_000), maxBatch = Infinity, serverRefs = "auto", } = options;
+    let forward = serverRefs === true;
+    let scheduled = false;
+    let retryTimer;
+    const entries = new Map();
+    const dirty = new Set();
+    const retrying = new Set();
+    const loads = new Map();
+    function entry(root, args) {
+        const printed = printArgs(args);
+        const key = name(root) + printed;
+        let e = entries.get(key);
+        if (!e) {
+            e = {
+                key,
+                root,
+                args: printed,
+                argv: args,
+                refs: collectRefs(args),
+                snap: EMPTY,
+                subs: new Set(),
+                inflight: new Set(),
+                epoch: 0,
+                stale: false,
+                at: 0,
+                fails: 0,
+            };
+            entries.set(key, e);
+        }
+        return e;
+    }
+    // Everything touched before the current task ends is fetched together.
+    function touch(e) {
+        dirty.add(e);
+        if (scheduled)
+            return;
+        scheduled = true;
+        queueMicrotask(flush);
+    }
+    function release(e) {
+        if (e.subs.size)
+            return;
+        e.gc = unref(setTimeout(() => e.subs.size || entries.delete(e.key), gcTime));
+    }
+    function update(e, snap) {
+        e.snap = snap;
+        for (const sub of e.subs)
+            sub.cb();
+    }
+    /** What `e` still has to fetch, or null. `full` replaces the cached data. */
+    function need(e) {
+        const want = [...e.subs].reduce((tree, sub) => merge(tree, sub.tree), {});
+        // A refetch already in flight will call touch() again when it lands.
+        if (e.stale)
+            return e.inflight.size ? null : { tree: want, full: true };
+        const covered = [...e.inflight].reduce(merge, e.snap.has);
+        let tree = diff(want, covered);
+        // A scalar root field selects nothing but still needs one fetch.
+        if (!tree && !e.at && !e.inflight.size)
+            tree = want;
+        if (!tree)
+            return null;
+        return touchesList(tree, e.snap.data) ? { tree: want, full: true } : { tree, full: false };
+    }
+    /**
+     * The printed arguments of `e` with its refs replaced by their values. A ref
+     * whose dependency is part of `batch` becomes a placeholder the server fills
+     * in. Returns null while a value is unknown.
+     */
+    function resolve(e, batch) {
+        let known = true;
+        const printed = printArgs(e.argv, ({ $ref: [root, args, path] }) => {
+            const dep = entry(root, args);
+            if (ready(dep.snap, pathTree(path)))
+                return printValue(getPath(dep.snap.data, path));
+            const index = batch?.get(dep);
+            if (index !== undefined)
+                return `$_ref__q${index}__${path.replaceAll(".", "__")}`;
+            known = false;
+            return "null";
+        });
+        return known ? printed : null;
+    }
+    function dependencyError(e) {
+        for (const { $ref: [root, args, path], } of e.refs) {
+            const snap = entry(root, args).snap;
+            if (snap.error && !ready(snap, pathTree(path)))
+                return snap.error;
+        }
+    }
+    function flush() {
+        scheduled = false;
+        const todo = [...dirty].filter((e) => e.subs.size);
+        dirty.clear();
+        const reqs = [];
+        const batch = new Map();
+        // Loop until nothing changes: an entry whose ref points into this batch
+        // can only join after its dependency, so dependencies get lower aliases.
+        let progress = true;
+        while (progress) {
+            progress = false;
+            todo.forEach((e, i) => {
+                if (!e)
+                    return;
+                let args = e.args;
+                let forwarded = false;
+                if (e.refs.length) {
+                    const known = resolve(e);
+                    if (known !== null) {
+                        if (e.at && known !== e.sent) {
+                            // A dependency's value changed since the last fetch.
+                            e.epoch++;
+                            e.inflight.clear();
+                            e.stale = true;
+                        }
+                        args = known;
+                    }
+                    else {
+                        const err = dependencyError(e);
+                        if (err) {
+                            todo[i] = undefined;
+                            if (e.snap.error !== err)
+                                update(e, { ...e.snap, error: err });
+                            return;
+                        }
+                        const placeholder = forward ? resolve(e, batch) : null;
+                        // Otherwise wait: the dependency's watcher touches this entry when it lands.
+                        if (placeholder === null)
+                            return;
+                        args = placeholder;
+                        forwarded = true;
+                    }
+                }
+                todo[i] = undefined;
+                progress = true;
+                const n = need(e);
+                if (!n)
+                    return;
+                e.inflight.add(n.tree);
+                batch.set(e, reqs.length);
+                reqs.push({ e, ...n, epoch: e.epoch, args, forwarded });
+            });
+        }
+        // Placeholders name aliases across the whole batch, so it can't be split.
+        const step = reqs.some((r) => r.forwarded) ? Infinity : maxBatch;
+        for (let i = 0; i < reqs.length; i += step)
+            send(reqs.slice(i, i + step));
+    }
+    async function send(reqs) {
+        const query = `{ ${reqs.map((r, i) => `q${i}: ${r.e.root}${r.args}${printTree(r.tree)}`).join(" ")} }`;
+        const pending = new Map(reqs.map((r, i) => [`q${i}`, r]));
+        try {
+            const res = fetcher(query);
+            for await (const chunk of Symbol.asyncIterator in res ? res : [await res]) {
+                if (serverRefs === "auto" && Number(chunk.extensions?.laguz) >= 1)
+                    forward = true;
+                const fatal = !chunk.data && chunk.errors?.find((err) => !err.path);
+                if (fatal) {
+                    if (pending.size === 1) {
+                        for (const r of pending.values())
+                            settle(r, undefined, fatal);
+                        return;
+                    }
+                    // A single invalid field fails validation for the whole document.
+                    // Resend each field alone so only that one reports the error.
+                    for (const r of pending.values()) {
+                        if (!r.forwarded) {
+                            send([r]);
+                            continue;
+                        }
+                        // Alone, a forwarded field has no dependency to read from: it
+                        // waits and resolves on the client instead.
+                        r.e.inflight.delete(r.tree);
+                        touch(r.e);
+                    }
+                    return;
+                }
+                for (const [alias, r] of pending) {
+                    const err = chunk.errors?.find((e) => e.path?.[0] === alias);
+                    if (err || (chunk.data && alias in chunk.data)) {
+                        pending.delete(alias);
+                        settle(r, chunk.data?.[alias], err);
+                    }
+                }
+            }
+            for (const r of pending.values())
+                settle(r, undefined, { message: "no data in response" });
+        }
+        catch (err) {
+            for (const r of pending.values())
+                settle(r, undefined, err);
+        }
+    }
+    function settle(r, data, err) {
+        const e = r.e;
+        e.inflight.delete(r.tree);
+        if (r.epoch !== e.epoch)
+            return;
+        if (err) {
+            if (e.fails++ < retry) {
+                // One timer for every entry that failed in this window keeps the
+                // retries batched. They all wait for the first entry's delay.
+                retrying.add(e);
+                retryTimer ??= setTimeout(() => {
+                    retryTimer = undefined;
+                    retrying.forEach(touch);
+                    retrying.clear();
+                }, retryDelay(e.fails - 1));
+                return;
+            }
+            update(e, { ...e.snap, error: toError(err) });
+            return;
+        }
+        e.fails = 0;
+        e.at = Date.now();
+        // For a forwarded request the dependency arrived first, so the value is known now.
+        e.sent = r.forwarded ? (resolve(e) ?? r.args) : r.args;
+        if (r.full)
+            e.stale = false;
+        update(e, r.full
+            ? { data, has: r.tree }
+            : { data: mergeData(e.snap.data, data), has: merge(e.snap.has, r.tree) });
+        // Consumers that subscribed while this was in flight may want more.
+        if (e.subs.size)
+            touch(e);
+    }
+    /** Mark matching entries stale. Those in use refetch together, in one request. */
+    function invalidate(match) {
+        for (const e of entries.values()) {
+            const hit = !match || (typeof match === "string" ? e.root === match : match(e.root, e.args));
+            if (!hit)
+                continue;
+            e.epoch++;
+            e.inflight.clear();
+            e.stale = true;
+            if (e.subs.size)
+                touch(e);
+        }
+    }
+    /**
+     * Write to the cache, e.g. an optimistic update. In-flight reads of the entry
+     * are dropped so they can't overwrite it. Returns a function that restores
+     * the previous value.
+     */
+    function set(root, args, fn) {
+        const e = entry(root, args);
+        const prev = e.snap;
+        e.epoch++;
+        e.inflight.clear();
+        e.stale = false;
+        update(e, { ...prev, data: fn(prev.data) });
+        if (e.subs.size)
+            touch(e);
+        else
+            release(e);
+        return () => update(e, prev);
+    }
+    /**
+     * Subscribe to `fields` of `root(args)`. The fetch goes out at the end of the
+     * current task, together with everything else registered in it.
+     * Returns the unsubscribe function.
+     */
+    function watch(root, args, fields, cb, minStaleTime = 0) {
+        const e = entry(root, args);
+        clearTimeout(e.gc);
+        if (e.at && Date.now() - e.at > Math.max(staleTime, minStaleTime))
+            e.stale = true;
+        if (e.snap.error)
+            e.fails = 0;
+        const sub = { tree: Array.isArray(fields) ? toTree(fields) : fields, cb };
+        e.subs.add(sub);
+        touch(e);
+        // A ref depends on another field: subscribe to it and recheck this entry when it changes.
+        const deps = e.refs.map(({ $ref: [depRoot, depArgs, path] }) => watch(depRoot, depArgs, pathTree(path), () => touch(e)));
+        return () => {
+            e.subs.delete(sub);
+            deps.forEach((off) => off());
+            release(e);
+        };
+    }
+    /** The current snapshot of `root(args)`. Stable until the entry changes. */
+    const read = (root, args) => entries.get(name(root) + printArgs(args))?.snap ?? EMPTY;
+    /**
+     * Fetch without staying subscribed (Suspense, prefetching). Joins the current
+     * batch. Resolves once the data is ready or the fetch failed.
+     */
+    function load(root, args, fields) {
+        const tree = Array.isArray(fields) ? toTree(fields) : fields;
+        if (ready(read(root, args), tree))
+            return Promise.resolve();
+        const key = name(root) + printArgs(args) + JSON.stringify(tree);
+        const existing = loads.get(key);
+        if (existing)
+            return existing;
+        const before = read(root, args);
+        const promise = new Promise((resolve) => {
+            const stop = watch(root, args, tree, () => {
+                const snap = read(root, args);
+                const failed = snap.error && snap !== before;
+                if (!ready(snap, tree) && !failed)
+                    return;
+                stop();
+                loads.delete(key);
+                resolve();
+            });
+        });
+        loads.set(key, promise);
+        return promise;
+    }
+    /**
+     * Run a mutation. Optimistic writes apply at once and are rolled back if it
+     * throws; the `invalidate` matches refetch afterwards either way.
+     */
+    async function mutate(run, o = {}) {
+        const undo = (o.optimistic ?? []).map(([root, args, fn]) => set(root, args, fn));
+        try {
+            return await run();
+        }
+        catch (err) {
+            undo.reverse().forEach((restore) => restore());
+            throw err;
+        }
+        finally {
+            o.invalidate?.forEach((m) => invalidate(m));
+        }
+    }
+    return { watch, read, load, invalidate, set, mutate };
+}
+//# sourceMappingURL=pool.js.map

package/dist/pool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pool.js","sourceRoot":"","sources":["../src/pool.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,WAAW,EACX,IAAI,EACJ,OAAO,EACP,KAAK,EACL,SAAS,EACT,IAAI,EACJ,QAAQ,EACR,SAAS,EACT,SAAS,EACT,UAAU,EACV,MAAM,EACN,WAAW,GAIZ,MAAM,gBAAgB,CAAC;AA2DxB,MAAM,KAAK,GAAa,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;AAEnD,sDAAsD;AACtD,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,IAAc,EAAE,IAAU,EAAW,EAAE,CAC3D,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;AAE1C,SAAS,KAAK,CAAI,KAAQ;IACvB,KAAgC,EAAE,KAAK,EAAE,EAAE,CAAC;IAC7C,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,OAAO,GAAG,CAAC,GAAqB,EAAE,EAAE,CAAC,CAAC,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;AAEjG,MAAM,UAAU,UAAU,CAAC,OAAgB,EAAE,OAAO,GAAY,EAAE;IAChE,MAAM,EACJ,SAAS,GAAG,CAAC,EACb,MAAM,GAAG,CAAC,GAAG,MAAM,EACnB,KAAK,GAAG,CAAC,EACT,UAAU,GAAG,CAAC,OAAe,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,OAAO,EAAE,MAAM,CAAC,EACvE,QAAQ,GAAG,QAAQ,EACnB,UAAU,GAAG,MAAM,GACpB,GAAG,OAAO,CAAC;IAEZ,IAAI,OAAO,GAAG,UAAU,KAAK,IAAI,CAAC;IAClC,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,IAAI,UAAqD,CAAC;IAC1D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAiB,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAS,CAAC;IAC/B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAS,CAAC;IAClC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAyB,CAAC;IAE/C,SAAS,KAAK,CAAC,IAAY,EAAE,IAAY;QACvC,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;QACjC,IAAI,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,CAAC,EAAE,CAAC;YACP,CAAC,GAAG;gBACF,GAAG;gBACH,IAAI;gBACJ,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,IAAI;gBACV,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC;gBACvB,IAAI,EAAE,KAAK;gBACX,IAAI,EAAE,IAAI,GAAG,EAAE;gBACf,QAAQ,EAAE,IAAI,GAAG,EAAE;gBACnB,KAAK,EAAE,CAAC;gBACR,KAAK,EAAE,KAAK;gBACZ,EAAE,EAAE,CAAC;gBACL,KAAK,EAAE,CAAC;aACT,CAAC;YACF,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACtB,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,uEAAuE;IACvE,SAAS,KAAK,CAAC,CAAQ;QACrB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,IAAI,SAAS;YAAE,OAAO;QACtB,SAAS,GAAG,IAAI,CAAC;QACjB,cAAc,CAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IAED,SAAS,OAAO,CAAC,CAAQ;QACvB,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO;QACxB,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;IAC/E,CAAC;IAED,SAAS,MAAM,CAAC,CAAQ,EAAE,IAAc;QACtC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC;QACd,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,IAAI;YAAE,GAAG,CAAC,EAAE,EAAE,CAAC;IACrC,CAAC;IAED,6EAA6E;IAC7E,SAAS,IAAI,CAAC,CAAQ;QACpB,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,EAAU,CAAC,CAAC;QAClF,qEAAqE;QACrE,IAAI,CAAC,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;QACxE,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1D,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC/B,iEAAiE;QACjE,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI;YAAE,IAAI,GAAG,IAAI,CAAC;QACpD,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QACvB,OAAO,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IAC7F,CAAC;IAED;;;;OAIG;IACH,SAAS,OAAO,CAAC,CAAQ,EAAE,KAA0B;QACnD,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,MAAM,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE;YACjE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC9B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAAE,OAAO,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YACrF,MAAM,KAAK,GAAG,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,WAAW,KAAK,KAAK,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC;YAClF,KAAK,GAAG,KAAK,CAAC;YACd,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;IAChC,CAAC;IAED,SAAS,eAAe,CAAC,CAAQ;QAC/B,KAAK,MAAM,EACT,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,GACzB,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YACZ,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC;YACpC,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC,KAAK,CAAC;QACpE,CAAC;IACH,CAAC;IAED,SAAS,KAAK;QACZ,SAAS,GAAG,KAAK,CAAC;QAClB,MAAM,IAAI,GAA0B,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1E,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,MAAM,IAAI,GAAU,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAiB,CAAC;QAEvC,wEAAwE;QACxE,yEAAyE;QACzE,IAAI,QAAQ,GAAG,IAAI,CAAC;QACpB,OAAO,QAAQ,EAAE,CAAC;YAChB,QAAQ,GAAG,KAAK,CAAC;YACjB,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACpB,IAAI,CAAC,CAAC;oBAAE,OAAO;gBACf,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;gBAClB,IAAI,SAAS,GAAG,KAAK,CAAC;gBAEtB,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;oBAClB,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;oBACzB,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;wBACnB,IAAI,CAAC,CAAC,EAAE,IAAI,KAAK,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;4BAC7B,qDAAqD;4BACrD,CAAC,CAAC,KAAK,EAAE,CAAC;4BACV,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;4BACnB,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC;wBACjB,CAAC;wBACD,IAAI,GAAG,KAAK,CAAC;oBACf,CAAC;yBAAM,CAAC;wBACN,MAAM,GAAG,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;wBAC/B,IAAI,GAAG,EAAE,CAAC;4BACR,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;4BACpB,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,KAAK,GAAG;gCAAE,MAAM,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;4BAC/D,OAAO;wBACT,CAAC;wBACD,MAAM,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;wBACvD,6EAA6E;wBAC7E,IAAI,WAAW,KAAK,IAAI;4BAAE,OAAO;wBACjC,IAAI,GAAG,WAAW,CAAC;wBACnB,SAAS,GAAG,IAAI,CAAC;oBACnB,CAAC;gBACH,CAAC;gBAED,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;gBACpB,QAAQ,GAAG,IAAI,CAAC;gBAChB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,IAAI,CAAC,CAAC;oBAAE,OAAO;gBACf,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACvB,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;YAC1D,CAAC,CAAC,CAAC;QACL,CAAC;QAED,0EAA0E;QAC1E,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;QACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAC5E,CAAC;IAED,KAAK,UAAU,IAAI,CAAC,IAAW;QAC7B,MAAM,KAAK,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;QACvG,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;YAC3B,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,MAAM,CAAC,aAAa,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1E,IAAI,UAAU,KAAK,MAAM,IAAI,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC;oBAAE,OAAO,GAAG,IAAI,CAAC;gBAElF,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACpE,IAAI,KAAK,EAAE,CAAC;oBACV,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;wBACvB,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,MAAM,EAAE;4BAAE,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;wBAC9D,OAAO;oBACT,CAAC;oBACD,kEAAkE;oBAClE,8DAA8D;oBAC9D,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;wBACjC,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;4BACjB,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;4BACV,SAAS;wBACX,CAAC;wBACD,8DAA8D;wBAC9D,4CAA4C;wBAC5C,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;wBAC5B,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACb,CAAC;oBACD,OAAO;gBACT,CAAC;gBAED,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;oBACjC,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC;oBAC7D,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,KAAK,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;wBAC/C,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;wBACtB,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC;oBACtC,CAAC;gBACH,CAAC;YACH,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,MAAM,EAAE;gBAAE,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,OAAO,EAAE,qBAAqB,EAAE,CAAC,CAAC;QAC7F,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,MAAM,EAAE;gBAAE,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,GAAY,CAAC,CAAC;QACvE,CAAC;IACH,CAAC;IAED,SAAS,MAAM,CAAC,CAAM,EAAE,IAAa,EAAE,GAAsB;QAC3D,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACd,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK;YAAE,OAAO;QAEhC,IAAI,GAAG,EAAE,CAAC;YACR,IAAI,CAAC,CAAC,KAAK,EAAE,GAAG,KAAK,EAAE,CAAC;gBACtB,iEAAiE;gBACjE,8DAA8D;gBAC9D,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAChB,UAAU,KAAK,UAAU,CACvB,GAAG,EAAE;oBACH,UAAU,GAAG,SAAS,CAAC;oBACvB,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;oBACxB,QAAQ,CAAC,KAAK,EAAE,CAAC;gBACnB,CAAC,EACD,UAAU,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CACxB,CAAC;gBACF,OAAO;YACT,CAAC;YACD,MAAM,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9C,OAAO;QACT,CAAC;QAED,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QACZ,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAClB,mFAAmF;QACnF,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACvD,IAAI,CAAC,CAAC,IAAI;YAAE,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC;QAC5B,MAAM,CACJ,CAAC,EACD,CAAC,CAAC,IAAI;YACJ,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE;YACvB,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAC3E,CAAC;QACF,oEAAoE;QACpE,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI;YAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC;IAED,kFAAkF;IAClF,SAAS,UAAU,CAAC,KAAa;QAC/B,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YACjC,MAAM,GAAG,GAAG,CAAC,KAAK,IAAI,CAAC,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7F,IAAI,CAAC,GAAG;gBAAE,SAAS;YACnB,CAAC,CAAC,KAAK,EAAE,CAAC;YACV,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;YACnB,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC;YACf,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI;gBAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,SAAS,GAAG,CAAC,IAAY,EAAE,IAAY,EAAE,EAAsB;QAC7D,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;QACpB,CAAC,CAAC,KAAK,EAAE,CAAC;QACV,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACnB,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC;QAChB,MAAM,CAAC,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC5C,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI;YAAE,KAAK,CAAC,CAAC,CAAC,CAAC;;YACrB,OAAO,CAAC,CAAC,CAAC,CAAC;QAChB,OAAO,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED;;;;OAIG;IACH,SAAS,KAAK,CACZ,IAAY,EACZ,IAAY,EACZ,MAAqB,EACrB,EAAc,EACd,YAAY,GAAG,CAAC;QAEhB,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC5B,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACnB,IAAI,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,YAAY,CAAC;YAAE,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC;QAClF,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK;YAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC;QAC1E,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChB,KAAK,CAAC,CAAC,CAAC,CAAC;QACT,0FAA0F;QAC1F,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,CAC7D,KAAK,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CACxD,CAAC;QACF,OAAO,GAAG,EAAE;YACV,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACnB,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;YAC7B,OAAO,CAAC,CAAC,CAAC,CAAC;QACb,CAAC,CAAC;IACJ,CAAC;IAED,4EAA4E;IAC5E,MAAM,IAAI,GAAG,CAAC,IAAY,EAAE,IAAY,EAAY,EAAE,CACpD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,IAAI,KAAK,CAAC;IAE3D;;;OAGG;IACH,SAAS,IAAI,CAAC,IAAY,EAAE,IAAY,EAAE,MAAqB;QAC7D,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAC7D,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC;YAAE,OAAO,OAAO,CAAC,OAAO,EAAE,CAAC;QAC5D,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QAChE,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,QAAQ;YAAE,OAAO,QAAQ,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAChC,MAAM,OAAO,GAAG,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;YAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE;gBACxC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,KAAK,MAAM,CAAC;gBAC7C,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM;oBAAE,OAAO;gBAC1C,IAAI,EAAE,CAAC;gBACP,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBAClB,OAAO,EAAE,CAAC;YACZ,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACxB,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,KAAK,UAAU,MAAM,CACnB,GAAqB,EACrB,CAAC,GAGG,EAAE;QAEN,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;QACjF,IAAI,CAAC;YACH,OAAO,MAAM,GAAG,EAAE,CAAC;QACrB,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;YAC/C,MAAM,GAAG,CAAC;QACZ,CAAC;gBAAS,CAAC;YACT,CAAC,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;AACxD,CAAC"}

package/dist/react.d.ts

@@ -0,0 +1,45 @@
+import { type Pool } from "./pool.ts";
+import { type Fields } from "./selection.ts";
+/**
+ * Read `fields` of `root(args)`. Pass `args: null` to skip the query, for
+ * example until the value it depends on has loaded.
+ */
+export declare function useData<T = any>(pool: Pool, root: string, args: object | null, fields: Fields): {
+    data: T | undefined;
+    error: Error | undefined;
+    loading: boolean;
+};
+/**
+ * Like {@link useData}, but suspends until the data is ready and throws errors
+ * to the nearest error boundary. Call `pool.invalidate(root)` when the boundary
+ * resets to retry.
+ *
+ * Give each component its own `<Suspense>` boundary. React stops rendering the
+ * siblings of a component that suspends, so components sharing a boundary are
+ * fetched in two requests instead of one.
+ */
+export declare function useSuspenseData<T = any>(pool: Pool, root: string, args: object, fields: Fields): T;
+export type Page = {
+    root: string;
+    args: object;
+    fields: Fields;
+};
+/**
+ * An infinite list. `page(prev, index)` describes page `index` from the data of
+ * the previous page (its cursor), or returns null after the last page.
+ *
+ * Every page is a regular cache entry: refreshing refetches all loaded pages in
+ * one request, and pages whose cursor moved are fetched right after.
+ * `prefetch` keeps that many pages loaded ahead, so `loadMore` shows them at once.
+ */
+export declare function useInfiniteData<T = any>(pool: Pool, page: (prev: T | undefined, index: number) => Page | null, { prefetch }?: {
+    prefetch?: number | undefined;
+}): {
+    pages: T[];
+    hasMore: boolean;
+    loading: boolean;
+    loadingMore: boolean;
+    error: Error | undefined;
+    loadMore: () => void;
+};
+//# sourceMappingURL=react.d.ts.map

package/dist/react.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"react.d.ts","sourceRoot":"","sources":["../src/react.ts"],"names":[],"mappings":"AACA,OAAO,EAAS,KAAK,IAAI,EAAiB,MAAM,WAAW,CAAC;AAC5D,OAAO,EAAgB,KAAK,MAAM,EAAE,MAAM,gBAAgB,CAAC;AAqB3D;;;GAGG;AACH,wBAAgB,OAAO,CAAC,CAAC,GAAG,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,MAAM,EAAE,MAAM;IAG1F,IAAI,EAAU,CAAC,GAAG,SAAS;IAC3B,KAAK;IACL,OAAO;EAEV;AAED;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAAC,CAAC,GAAG,GAAG,EACrC,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,GACb,CAAC,CAMH;AAED,MAAM,MAAM,IAAI,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAElE;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,CAAC,GAAG,GAAG,EACrC,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,SAAS,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI,EACzD,EAAE,QAAY,EAAE;;CAAK;;;;;;;EA+EtB"}