@ttt-productions/query-core 0.14.1 → 0.14.2

package/dist/domain-events/cache-invalidation.d.ts

@@ -24,5 +24,26 @@ export declare function predicate(description: string, match: (query: Query) =>
     refetchType?: RefetchType;
 }): CacheInvalidation;
 export declare function serializeInvalidation(inv: CacheInvalidation): string;
+/**
+ * Dispatch a deduplicated list of cache invalidations.
+ *
+ * Synchronous by contract: the underlying `invalidateQueries` / `cancelQueries`
+ * promises are fire-and-forget, so a mutation success path never awaits its own
+ * cache refresh.
+ *
+ * Before each invalidation, any query it matches that is mid-PENDING-INITIAL-READ
+ * is cancelled (see `cancelPendingInitialReads`) so a read that started before
+ * the write committed can never land as the query's first — and freshly-marked —
+ * value.
+ *
+ * `refetchType` governs whether that cancellation happens:
+ * - `'active'` (the default) and `'all'` cancel-then-invalidate every matched
+ *   pending initial read — including one TanStack's refetch pass will not
+ *   restart, since a stale first value would otherwise land and mark the query
+ *   fresh, while a cancelled one simply refetches for its next observer.
+ * - `'none'` invalidates WITHOUT cancelling: the caller has asked for no
+ *   refetch at all, so cancelling would abandon the only in-flight read the
+ *   consumer has and leave it with no data and no pending request.
+ */
 export declare function applyInvalidations(queryClient: QueryClient, invalidations: ReadonlyArray<CacheInvalidation>): void;
 //# sourceMappingURL=cache-invalidation.d.ts.map

package/dist/domain-events/cache-invalidation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cache-invalidation.d.ts","sourceRoot":"","sources":["../../src/domain-events/cache-invalidation.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAE1E,MAAM,MAAM,WAAW,GAAG,QAAQ,GAAG,KAAK,GAAG,MAAM,CAAC;AAEpD,MAAM,MAAM,iBAAiB,GACzB;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,EAAE,QAAQ,CAAC;IAAC,WAAW,CAAC,EAAE,WAAW,CAAA;CAAE,GAChE;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,QAAQ,EAAE,QAAQ,CAAC;IAAC,WAAW,CAAC,EAAE,WAAW,CAAA;CAAE,GACjE;IACE,IAAI,EAAE,WAAW,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,CAAC;IACjC,WAAW,CAAC,EAAE,WAAW,CAAC;CAC3B,CAAC;AAEN,wBAAgB,KAAK,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE;IAAE,WAAW,CAAC,EAAE,WAAW,CAAA;CAAE,GAAG,iBAAiB,CAEjG;AAED,wBAAgB,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE;IAAE,WAAW,CAAC,EAAE,WAAW,CAAA;CAAE,GAAG,iBAAiB,CAElG;AAED,wBAAgB,SAAS,CACvB,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,EAChC,IAAI,CAAC,EAAE;IAAE,WAAW,CAAC,EAAE,WAAW,CAAA;CAAE,GACnC,iBAAiB,CAEnB;AAED,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,iBAAiB,GAAG,MAAM,CAGpE;AAED,wBAAgB,kBAAkB,CAChC,WAAW,EAAE,WAAW,EACxB,aAAa,EAAE,aAAa,CAAC,iBAAiB,CAAC,GAC9C,IAAI,CA4BN"}
+{"version":3,"file":"cache-invalidation.d.ts","sourceRoot":"","sources":["../../src/domain-events/cache-invalidation.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,WAAW,EAAgB,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAExF,MAAM,MAAM,WAAW,GAAG,QAAQ,GAAG,KAAK,GAAG,MAAM,CAAC;AAEpD,MAAM,MAAM,iBAAiB,GACzB;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,EAAE,QAAQ,CAAC;IAAC,WAAW,CAAC,EAAE,WAAW,CAAA;CAAE,GAChE;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,QAAQ,EAAE,QAAQ,CAAC;IAAC,WAAW,CAAC,EAAE,WAAW,CAAA;CAAE,GACjE;IACE,IAAI,EAAE,WAAW,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,CAAC;IACjC,WAAW,CAAC,EAAE,WAAW,CAAC;CAC3B,CAAC;AAEN,wBAAgB,KAAK,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE;IAAE,WAAW,CAAC,EAAE,WAAW,CAAA;CAAE,GAAG,iBAAiB,CAEjG;AAED,wBAAgB,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE;IAAE,WAAW,CAAC,EAAE,WAAW,CAAA;CAAE,GAAG,iBAAiB,CAElG;AAED,wBAAgB,SAAS,CACvB,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,EAChC,IAAI,CAAC,EAAE;IAAE,WAAW,CAAC,EAAE,WAAW,CAAA;CAAE,GACnC,iBAAiB,CAEnB;AAED,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,iBAAiB,GAAG,MAAM,CAGpE;AAiCD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,kBAAkB,CAChC,WAAW,EAAE,WAAW,EACxB,aAAa,EAAE,aAAa,CAAC,iBAAiB,CAAC,GAC9C,IAAI,CAgBN"}

package/dist/domain-events/cache-invalidation.js

@@ -12,6 +12,60 @@ export function serializeInvalidation(inv) {
         return `predicate:${inv.description}`;
     return `${inv.kind}:${JSON.stringify(inv.queryKey)}`;
 }
+/** The cache filter that selects exactly the queries one invalidation targets. */
+function invalidationFilters(inv) {
+    if (inv.kind === "exact")
+        return { queryKey: inv.queryKey, exact: true };
+    if (inv.kind === "prefix")
+        return { queryKey: inv.queryKey, exact: false };
+    return { predicate: inv.match };
+}
+/**
+ * Cancel every query matched by `filters` that is in a PENDING INITIAL READ —
+ * currently fetching with no data yet.
+ *
+ * TanStack's `Query.fetch` only cancels a running request on refetch when the
+ * query already holds data; an initial fetch in flight is REUSED instead, so
+ * the invalidation's refetch resolves with the value the server returned BEFORE
+ * the mutation committed and then marks the query fresh. Cancelling first makes
+ * the invalidation's refetch a genuinely new request: the retryer is rejected
+ * synchronously (its `onCancel` reverts state to idle in the same tick), so the
+ * `invalidateQueries` call that follows starts a fresh fetch, and the abandoned
+ * promise's late, stale resolution is discarded.
+ *
+ * Cancellation is always scoped to one concrete query key — never a bare
+ * `cancelQueries()`.
+ */
+function cancelPendingInitialReads(queryClient, filters) {
+    for (const query of queryClient.getQueryCache().findAll(filters)) {
+        if (query.state.fetchStatus !== "fetching")
+            continue;
+        if (query.state.data !== undefined)
+            continue;
+        void queryClient.cancelQueries({ queryKey: query.queryKey, exact: true });
+    }
+}
+/**
+ * Dispatch a deduplicated list of cache invalidations.
+ *
+ * Synchronous by contract: the underlying `invalidateQueries` / `cancelQueries`
+ * promises are fire-and-forget, so a mutation success path never awaits its own
+ * cache refresh.
+ *
+ * Before each invalidation, any query it matches that is mid-PENDING-INITIAL-READ
+ * is cancelled (see `cancelPendingInitialReads`) so a read that started before
+ * the write committed can never land as the query's first — and freshly-marked —
+ * value.
+ *
+ * `refetchType` governs whether that cancellation happens:
+ * - `'active'` (the default) and `'all'` cancel-then-invalidate every matched
+ *   pending initial read — including one TanStack's refetch pass will not
+ *   restart, since a stale first value would otherwise land and mark the query
+ *   fresh, while a cancelled one simply refetches for its next observer.
+ * - `'none'` invalidates WITHOUT cancelling: the caller has asked for no
+ *   refetch at all, so cancelling would abandon the only in-flight read the
+ *   consumer has and leave it with no data and no pending request.
+ */
 export function applyInvalidations(queryClient, invalidations) {
     const seen = new Set();
     for (const inv of invalidations) {
@@ -20,26 +74,11 @@ export function applyInvalidations(queryClient, invalidations) {
             continue;
         seen.add(sig);
         const refetchType = inv.refetchType ?? "active";
-        if (inv.kind === "exact") {
-            void queryClient.invalidateQueries({
-                queryKey: inv.queryKey,
-                exact: true,
-                refetchType,
-            });
-        }
-        else if (inv.kind === "prefix") {
-            void queryClient.invalidateQueries({
-                queryKey: inv.queryKey,
-                exact: false,
-                refetchType,
-            });
-        }
-        else {
-            void queryClient.invalidateQueries({
-                predicate: inv.match,
-                refetchType,
-            });
+        const filters = invalidationFilters(inv);
+        if (refetchType !== "none") {
+            cancelPendingInitialReads(queryClient, filters);
         }
+        void queryClient.invalidateQueries({ ...filters, refetchType });
     }
 }
 //# sourceMappingURL=cache-invalidation.js.map

package/dist/domain-events/cache-invalidation.js.map

@@ -1 +1 @@
-{"version":3,"file":"cache-invalidation.js","sourceRoot":"","sources":["../../src/domain-events/cache-invalidation.ts"],"names":[],"mappings":"AAcA,MAAM,UAAU,KAAK,CAAC,QAAkB,EAAE,IAAoC;IAC5E,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;AACrE,CAAC;AAED,MAAM,UAAU,MAAM,CAAC,QAAkB,EAAE,IAAoC;IAC7E,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;AACtE,CAAC;AAED,MAAM,UAAU,SAAS,CACvB,WAAmB,EACnB,KAAgC,EAChC,IAAoC;IAEpC,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;AACnF,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,GAAsB;IAC1D,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW;QAAE,OAAO,aAAa,GAAG,CAAC,WAAW,EAAE,CAAC;IACpE,OAAO,GAAG,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;AACvD,CAAC;AAED,MAAM,UAAU,kBAAkB,CAChC,WAAwB,EACxB,aAA+C;IAE/C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;QAChC,MAAM,GAAG,GAAG,qBAAqB,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEd,MAAM,WAAW,GAAgB,GAAG,CAAC,WAAW,IAAI,QAAQ,CAAC;QAE7D,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YACzB,KAAK,WAAW,CAAC,iBAAiB,CAAC;gBACjC,QAAQ,EAAE,GAAG,CAAC,QAAQ;gBACtB,KAAK,EAAE,IAAI;gBACX,WAAW;aACZ,CAAC,CAAC;QACL,CAAC;aAAM,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACjC,KAAK,WAAW,CAAC,iBAAiB,CAAC;gBACjC,QAAQ,EAAE,GAAG,CAAC,QAAQ;gBACtB,KAAK,EAAE,KAAK;gBACZ,WAAW;aACZ,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,KAAK,WAAW,CAAC,iBAAiB,CAAC;gBACjC,SAAS,EAAE,GAAG,CAAC,KAAK;gBACpB,WAAW;aACZ,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC","sourcesContent":["import type { Query, QueryClient, QueryKey } from \"@tanstack/react-query\";\n\nexport type RefetchType = \"active\" | \"all\" | \"none\";\n\nexport type CacheInvalidation =\n  | { kind: \"exact\"; queryKey: QueryKey; refetchType?: RefetchType }\n  | { kind: \"prefix\"; queryKey: QueryKey; refetchType?: RefetchType }\n  | {\n      kind: \"predicate\";\n      description: string;\n      match: (query: Query) => boolean;\n      refetchType?: RefetchType;\n    };\n\nexport function exact(queryKey: QueryKey, opts?: { refetchType?: RefetchType }): CacheInvalidation {\n  return { kind: \"exact\", queryKey, refetchType: opts?.refetchType };\n}\n\nexport function prefix(queryKey: QueryKey, opts?: { refetchType?: RefetchType }): CacheInvalidation {\n  return { kind: \"prefix\", queryKey, refetchType: opts?.refetchType };\n}\n\nexport function predicate(\n  description: string,\n  match: (query: Query) => boolean,\n  opts?: { refetchType?: RefetchType },\n): CacheInvalidation {\n  return { kind: \"predicate\", description, match, refetchType: opts?.refetchType };\n}\n\nexport function serializeInvalidation(inv: CacheInvalidation): string {\n  if (inv.kind === \"predicate\") return `predicate:${inv.description}`;\n  return `${inv.kind}:${JSON.stringify(inv.queryKey)}`;\n}\n\nexport function applyInvalidations(\n  queryClient: QueryClient,\n  invalidations: ReadonlyArray<CacheInvalidation>,\n): void {\n  const seen = new Set<string>();\n  for (const inv of invalidations) {\n    const sig = serializeInvalidation(inv);\n    if (seen.has(sig)) continue;\n    seen.add(sig);\n\n    const refetchType: RefetchType = inv.refetchType ?? \"active\";\n\n    if (inv.kind === \"exact\") {\n      void queryClient.invalidateQueries({\n        queryKey: inv.queryKey,\n        exact: true,\n        refetchType,\n      });\n    } else if (inv.kind === \"prefix\") {\n      void queryClient.invalidateQueries({\n        queryKey: inv.queryKey,\n        exact: false,\n        refetchType,\n      });\n    } else {\n      void queryClient.invalidateQueries({\n        predicate: inv.match,\n        refetchType,\n      });\n    }\n  }\n}\n"]}
+{"version":3,"file":"cache-invalidation.js","sourceRoot":"","sources":["../../src/domain-events/cache-invalidation.ts"],"names":[],"mappings":"AAcA,MAAM,UAAU,KAAK,CAAC,QAAkB,EAAE,IAAoC;IAC5E,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;AACrE,CAAC;AAED,MAAM,UAAU,MAAM,CAAC,QAAkB,EAAE,IAAoC;IAC7E,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;AACtE,CAAC;AAED,MAAM,UAAU,SAAS,CACvB,WAAmB,EACnB,KAAgC,EAChC,IAAoC;IAEpC,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;AACnF,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,GAAsB;IAC1D,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW;QAAE,OAAO,aAAa,GAAG,CAAC,WAAW,EAAE,CAAC;IACpE,OAAO,GAAG,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;AACvD,CAAC;AAED,kFAAkF;AAClF,SAAS,mBAAmB,CAAC,GAAsB;IACjD,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO;QAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IACzE,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAC3E,OAAO,EAAE,SAAS,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC;AAClC,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,SAAS,yBAAyB,CAAC,WAAwB,EAAE,OAAqB;IAChF,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,aAAa,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QACjE,IAAI,KAAK,CAAC,KAAK,CAAC,WAAW,KAAK,UAAU;YAAE,SAAS;QACrD,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS;YAAE,SAAS;QAC7C,KAAK,WAAW,CAAC,aAAa,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IAC5E,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,kBAAkB,CAChC,WAAwB,EACxB,aAA+C;IAE/C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;QAChC,MAAM,GAAG,GAAG,qBAAqB,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEd,MAAM,WAAW,GAAgB,GAAG,CAAC,WAAW,IAAI,QAAQ,CAAC;QAC7D,MAAM,OAAO,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAC;QAEzC,IAAI,WAAW,KAAK,MAAM,EAAE,CAAC;YAC3B,yBAAyB,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;QAClD,CAAC;QAED,KAAK,WAAW,CAAC,iBAAiB,CAAC,EAAE,GAAG,OAAO,EAAE,WAAW,EAAE,CAAC,CAAC;IAClE,CAAC;AACH,CAAC","sourcesContent":["import type { Query, QueryClient, QueryFilters, QueryKey } from \"@tanstack/react-query\";\n\nexport type RefetchType = \"active\" | \"all\" | \"none\";\n\nexport type CacheInvalidation =\n  | { kind: \"exact\"; queryKey: QueryKey; refetchType?: RefetchType }\n  | { kind: \"prefix\"; queryKey: QueryKey; refetchType?: RefetchType }\n  | {\n      kind: \"predicate\";\n      description: string;\n      match: (query: Query) => boolean;\n      refetchType?: RefetchType;\n    };\n\nexport function exact(queryKey: QueryKey, opts?: { refetchType?: RefetchType }): CacheInvalidation {\n  return { kind: \"exact\", queryKey, refetchType: opts?.refetchType };\n}\n\nexport function prefix(queryKey: QueryKey, opts?: { refetchType?: RefetchType }): CacheInvalidation {\n  return { kind: \"prefix\", queryKey, refetchType: opts?.refetchType };\n}\n\nexport function predicate(\n  description: string,\n  match: (query: Query) => boolean,\n  opts?: { refetchType?: RefetchType },\n): CacheInvalidation {\n  return { kind: \"predicate\", description, match, refetchType: opts?.refetchType };\n}\n\nexport function serializeInvalidation(inv: CacheInvalidation): string {\n  if (inv.kind === \"predicate\") return `predicate:${inv.description}`;\n  return `${inv.kind}:${JSON.stringify(inv.queryKey)}`;\n}\n\n/** The cache filter that selects exactly the queries one invalidation targets. */\nfunction invalidationFilters(inv: CacheInvalidation): QueryFilters {\n  if (inv.kind === \"exact\") return { queryKey: inv.queryKey, exact: true };\n  if (inv.kind === \"prefix\") return { queryKey: inv.queryKey, exact: false };\n  return { predicate: inv.match };\n}\n\n/**\n * Cancel every query matched by `filters` that is in a PENDING INITIAL READ —\n * currently fetching with no data yet.\n *\n * TanStack's `Query.fetch` only cancels a running request on refetch when the\n * query already holds data; an initial fetch in flight is REUSED instead, so\n * the invalidation's refetch resolves with the value the server returned BEFORE\n * the mutation committed and then marks the query fresh. Cancelling first makes\n * the invalidation's refetch a genuinely new request: the retryer is rejected\n * synchronously (its `onCancel` reverts state to idle in the same tick), so the\n * `invalidateQueries` call that follows starts a fresh fetch, and the abandoned\n * promise's late, stale resolution is discarded.\n *\n * Cancellation is always scoped to one concrete query key — never a bare\n * `cancelQueries()`.\n */\nfunction cancelPendingInitialReads(queryClient: QueryClient, filters: QueryFilters): void {\n  for (const query of queryClient.getQueryCache().findAll(filters)) {\n    if (query.state.fetchStatus !== \"fetching\") continue;\n    if (query.state.data !== undefined) continue;\n    void queryClient.cancelQueries({ queryKey: query.queryKey, exact: true });\n  }\n}\n\n/**\n * Dispatch a deduplicated list of cache invalidations.\n *\n * Synchronous by contract: the underlying `invalidateQueries` / `cancelQueries`\n * promises are fire-and-forget, so a mutation success path never awaits its own\n * cache refresh.\n *\n * Before each invalidation, any query it matches that is mid-PENDING-INITIAL-READ\n * is cancelled (see `cancelPendingInitialReads`) so a read that started before\n * the write committed can never land as the query's first — and freshly-marked —\n * value.\n *\n * `refetchType` governs whether that cancellation happens:\n * - `'active'` (the default) and `'all'` cancel-then-invalidate every matched\n *   pending initial read — including one TanStack's refetch pass will not\n *   restart, since a stale first value would otherwise land and mark the query\n *   fresh, while a cancelled one simply refetches for its next observer.\n * - `'none'` invalidates WITHOUT cancelling: the caller has asked for no\n *   refetch at all, so cancelling would abandon the only in-flight read the\n *   consumer has and leave it with no data and no pending request.\n */\nexport function applyInvalidations(\n  queryClient: QueryClient,\n  invalidations: ReadonlyArray<CacheInvalidation>,\n): void {\n  const seen = new Set<string>();\n  for (const inv of invalidations) {\n    const sig = serializeInvalidation(inv);\n    if (seen.has(sig)) continue;\n    seen.add(sig);\n\n    const refetchType: RefetchType = inv.refetchType ?? \"active\";\n    const filters = invalidationFilters(inv);\n\n    if (refetchType !== \"none\") {\n      cancelPendingInitialReads(queryClient, filters);\n    }\n\n    void queryClient.invalidateQueries({ ...filters, refetchType });\n  }\n}\n"]}

package/dist/react/firestore/absence-scheduler.d.ts

@@ -0,0 +1,39 @@
+import type { QueryClient, QueryKey } from '@tanstack/react-query';
+/**
+ * Bounded re-read ladder for a document that resolved ABSENT.
+ *
+ * A one-shot lookup that lands `null` has no listener to tell it when the doc appears —
+ * the row would stay blank until something invalidates it. That is the real failure the
+ * realtime path was introduced to fix (a mirror doc that is missing or lagging at fetch
+ * time: just after a create-and-redirect, or in a second tab racing the server mirror).
+ * This scheduler restores the recovery without a listener: after an absent result it
+ * re-reads a few times on a widening ladder, then gives up.
+ *
+ * Delays (ms) between re-reads within one absence episode. After the last rung the episode
+ * is exhausted and never restarts on its own; only a later PRESENT→absent transition opens
+ * a new one.
+ */
+export declare const ABSENT_RETRY_DELAYS_MS: readonly [5000, 15000, 45000, 120000];
+export interface TrackAbsentDocParams {
+    queryClient: QueryClient;
+    /** Exact key of the per-id lookup query. */
+    queryKey: QueryKey;
+    /**
+     * Ladder this registrant wants; an empty array means it wants no re-reads. Registrants
+     * on the same key combine by union — the longest ladder among them governs — so one
+     * consumer passing `[]` never disables polling another consumer asked for.
+     */
+    delays?: readonly number[];
+}
+/**
+ * Register interest in re-reading `queryKey` while it resolves absent. Returns an
+ * idempotent release function; releasing the last interested consumer pauses the ladder
+ * without spending the episode's remaining budget, and releasing the last registrant that
+ * wanted polling shrinks the effective ladder for the episode still in progress.
+ */
+export declare function trackAbsentDoc({ queryClient, queryKey, delays, }: TrackAbsentDocParams): () => void;
+/** Test-only: number of absence episodes currently tracked for a QueryClient. */
+export declare function __absenceEpisodeCount(queryClient: QueryClient): number;
+/** Test-only: rungs already spent on a key's current episode, or `null` if there is none. */
+export declare function __absenceAttempt(queryClient: QueryClient, queryKey: QueryKey): number | null;
+//# sourceMappingURL=absence-scheduler.d.ts.map

package/dist/react/firestore/absence-scheduler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"absence-scheduler.d.ts","sourceRoot":"","sources":["../../../src/react/firestore/absence-scheduler.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAEnE;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,sBAAsB,uCAA4C,CAAC;AAgLhF,MAAM,WAAW,oBAAoB;IACnC,WAAW,EAAE,WAAW,CAAC;IACzB,4CAA4C;IAC5C,QAAQ,EAAE,QAAQ,CAAC;IACnB;;;;OAIG;IACH,MAAM,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAC5B;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,EAC7B,WAAW,EACX,QAAQ,EACR,MAA+B,GAChC,EAAE,oBAAoB,GAAG,MAAM,IAAI,CAmCnC;AAED,iFAAiF;AACjF,wBAAgB,qBAAqB,CAAC,WAAW,EAAE,WAAW,GAAG,MAAM,CAEtE;AAED,6FAA6F;AAC7F,wBAAgB,gBAAgB,CAAC,WAAW,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,GAAG,MAAM,GAAG,IAAI,CAE5F"}

package/dist/react/firestore/absence-scheduler.js

@@ -0,0 +1,182 @@
+'use client';
+/**
+ * Bounded re-read ladder for a document that resolved ABSENT.
+ *
+ * A one-shot lookup that lands `null` has no listener to tell it when the doc appears —
+ * the row would stay blank until something invalidates it. That is the real failure the
+ * realtime path was introduced to fix (a mirror doc that is missing or lagging at fetch
+ * time: just after a create-and-redirect, or in a second tab racing the server mirror).
+ * This scheduler restores the recovery without a listener: after an absent result it
+ * re-reads a few times on a widening ladder, then gives up.
+ *
+ * Delays (ms) between re-reads within one absence episode. After the last rung the episode
+ * is exhausted and never restarts on its own; only a later PRESENT→absent transition opens
+ * a new one.
+ */
+export const ABSENT_RETRY_DELAYS_MS = [5_000, 15_000, 45_000, 120_000];
+const NO_DELAYS = [];
+// Per-QueryClient, like the doc-subscription registry: a discarded client is GC'd with its
+// bookkeeping, and each browser tab schedules independently.
+const schedulers = new WeakMap();
+/**
+ * Hash a key the way THIS client hashes it, so a consumer with a custom
+ * `queryKeyHashFn` still lines up with `QueryCache.get()`.
+ */
+function hashOf(queryClient, queryKey) {
+    return queryClient.defaultQueryOptions({ queryKey }).queryHash;
+}
+/** Union of the registrants' ladders: the longest one wins; none means no polling. */
+function effectiveDelays(tracked) {
+    if (!tracked)
+        return NO_DELAYS;
+    let longest = NO_DELAYS;
+    for (const registration of tracked.registrations) {
+        if (registration.delays.length > longest.length)
+            longest = registration.delays;
+    }
+    return longest;
+}
+function clearTimer(episode) {
+    if (episode?.timer != null) {
+        clearTimeout(episode.timer);
+        episode.timer = null;
+    }
+}
+function discardEpisode(state, hash) {
+    clearTimer(state.episodes.get(hash));
+    state.episodes.delete(hash);
+}
+function schedule(queryClient, state, hash) {
+    const tracked = state.tracked.get(hash);
+    const episode = state.episodes.get(hash);
+    if (!tracked || !episode || episode.timer !== null)
+        return;
+    const delays = effectiveDelays(tracked);
+    if (episode.attempt >= delays.length)
+        return;
+    episode.timer = setTimeout(() => {
+        episode.timer = null;
+        episode.attempt += 1;
+        const current = state.tracked.get(hash);
+        if (!current || !isAbsentAndActive(queryClient, hash))
+            return;
+        void queryClient.refetchQueries({ queryKey: current.queryKey, exact: true, type: 'active' });
+        // Lay the next rung; the ladder stops the moment the doc appears, the budget runs
+        // out, or the last enabled observer goes away.
+        evaluate(queryClient, state, hash);
+    }, delays[episode.attempt]);
+}
+function isAbsentAndActive(queryClient, hash) {
+    const query = queryClient.getQueryCache().get(hash);
+    if (!query)
+        return false;
+    return query.state.status === 'success' && query.state.data === null && query.isActive();
+}
+function evaluate(queryClient, state, hash) {
+    const query = queryClient.getQueryCache().get(hash);
+    if (!query) {
+        discardEpisode(state, hash);
+        return;
+    }
+    const { status, data } = query.state;
+    if (status === 'success' && data !== null) {
+        // The doc is present — the episode is over.
+        discardEpisode(state, hash);
+        return;
+    }
+    if (status !== 'success') {
+        // Pending or errored: never polled, but the budget survives so an error mid-episode
+        // cannot hand the id a fresh ladder when it returns to absent.
+        clearTimer(state.episodes.get(hash));
+        return;
+    }
+    const tracked = state.tracked.get(hash);
+    if (!tracked) {
+        clearTimer(state.episodes.get(hash));
+        return;
+    }
+    let episode = state.episodes.get(hash);
+    if (!episode) {
+        // No registrant wants polling — do not open an episode that could never spend a rung.
+        if (effectiveDelays(tracked).length === 0)
+            return;
+        episode = { attempt: 0, timer: null };
+        state.episodes.set(hash, episode);
+    }
+    if (!query.isActive()) {
+        clearTimer(episode);
+        return;
+    }
+    schedule(queryClient, state, hash);
+}
+function getState(queryClient) {
+    let state = schedulers.get(queryClient);
+    if (state)
+        return state;
+    state = { episodes: new Map(), tracked: new Map() };
+    schedulers.set(queryClient, state);
+    const scheduler = state;
+    // Exactly ONE cache listener per QueryClient, created with this state and never detached:
+    // it is WeakMap-scoped, so it is collected together with the client it belongs to.
+    queryClient.getQueryCache().subscribe((event) => {
+        const hash = event.query.queryHash;
+        if (!scheduler.tracked.has(hash) && !scheduler.episodes.has(hash))
+            return;
+        if (event.type === 'removed') {
+            discardEpisode(scheduler, hash);
+            return;
+        }
+        evaluate(queryClient, scheduler, hash);
+    });
+    return state;
+}
+/**
+ * Register interest in re-reading `queryKey` while it resolves absent. Returns an
+ * idempotent release function; releasing the last interested consumer pauses the ladder
+ * without spending the episode's remaining budget, and releasing the last registrant that
+ * wanted polling shrinks the effective ladder for the episode still in progress.
+ */
+export function trackAbsentDoc({ queryClient, queryKey, delays = ABSENT_RETRY_DELAYS_MS, }) {
+    const state = getState(queryClient);
+    const hash = hashOf(queryClient, queryKey);
+    const registration = { delays };
+    const existing = state.tracked.get(hash);
+    if (existing)
+        existing.registrations.push(registration);
+    else
+        state.tracked.set(hash, { queryKey, registrations: [registration] });
+    evaluate(queryClient, state, hash);
+    let released = false;
+    return () => {
+        if (released)
+            return;
+        released = true;
+        const current = state.tracked.get(hash);
+        if (!current)
+            return;
+        const before = effectiveDelays(current).length;
+        const index = current.registrations.indexOf(registration);
+        if (index >= 0)
+            current.registrations.splice(index, 1);
+        if (current.registrations.length === 0) {
+            state.tracked.delete(hash);
+            clearTimer(state.episodes.get(hash));
+            return;
+        }
+        if (effectiveDelays(current).length !== before) {
+            // The effective ladder changed: re-derive under the new one rather than letting a
+            // timer from the departed registrant's ladder fire.
+            clearTimer(state.episodes.get(hash));
+            evaluate(queryClient, state, hash);
+        }
+    };
+}
+/** Test-only: number of absence episodes currently tracked for a QueryClient. */
+export function __absenceEpisodeCount(queryClient) {
+    return schedulers.get(queryClient)?.episodes.size ?? 0;
+}
+/** Test-only: rungs already spent on a key's current episode, or `null` if there is none. */
+export function __absenceAttempt(queryClient, queryKey) {
+    return schedulers.get(queryClient)?.episodes.get(hashOf(queryClient, queryKey))?.attempt ?? null;
+}
+//# sourceMappingURL=absence-scheduler.js.map

package/dist/react/firestore/absence-scheduler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"absence-scheduler.js","sourceRoot":"","sources":["../../../src/react/firestore/absence-scheduler.ts"],"names":[],"mappings":"AAAA,YAAY,CAAC;AAIb;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAU,CAAC;AA+ChF,MAAM,SAAS,GAAsB,EAAE,CAAC;AAExC,2FAA2F;AAC3F,6DAA6D;AAC7D,MAAM,UAAU,GAAG,IAAI,OAAO,EAA+B,CAAC;AAE9D;;;GAGG;AACH,SAAS,MAAM,CAAC,WAAwB,EAAE,QAAkB;IAC1D,OAAO,WAAW,CAAC,mBAAmB,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,SAAS,CAAC;AACjE,CAAC;AAED,sFAAsF;AACtF,SAAS,eAAe,CAAC,OAA4B;IACnD,IAAI,CAAC,OAAO;QAAE,OAAO,SAAS,CAAC;IAC/B,IAAI,OAAO,GAAsB,SAAS,CAAC;IAC3C,KAAK,MAAM,YAAY,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC;QACjD,IAAI,YAAY,CAAC,MAAM,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM;YAAE,OAAO,GAAG,YAAY,CAAC,MAAM,CAAC;IACjF,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,UAAU,CAAC,OAA4B;IAC9C,IAAI,OAAO,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC;QAC3B,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC;IACvB,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CAAC,KAAqB,EAAE,IAAY;IACzD,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IACrC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAC9B,CAAC;AAED,SAAS,QAAQ,CAAC,WAAwB,EAAE,KAAqB,EAAE,IAAY;IAC7E,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACxC,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACzC,IAAI,CAAC,OAAO,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,KAAK,KAAK,IAAI;QAAE,OAAO;IAE3D,MAAM,MAAM,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;IACxC,IAAI,OAAO,CAAC,OAAO,IAAI,MAAM,CAAC,MAAM;QAAE,OAAO;IAE7C,OAAO,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE;QAC9B,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC;QACrB,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC;QACrB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACxC,IAAI,CAAC,OAAO,IAAI,CAAC,iBAAiB,CAAC,WAAW,EAAE,IAAI,CAAC;YAAE,OAAO;QAC9D,KAAK,WAAW,CAAC,cAAc,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC7F,kFAAkF;QAClF,+CAA+C;QAC/C,QAAQ,CAAC,WAAW,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;IACrC,CAAC,EAAE,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;AAC9B,CAAC;AAED,SAAS,iBAAiB,CAAC,WAAwB,EAAE,IAAY;IAC/D,MAAM,KAAK,GAAG,WAAW,CAAC,aAAa,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACpD,IAAI,CAAC,KAAK;QAAE,OAAO,KAAK,CAAC;IACzB,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,SAAS,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;AAC3F,CAAC;AAED,SAAS,QAAQ,CAAC,WAAwB,EAAE,KAAqB,EAAE,IAAY;IAC7E,MAAM,KAAK,GAAG,WAAW,CAAC,aAAa,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACpD,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC5B,OAAO;IACT,CAAC;IAED,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC;IAErC,IAAI,MAAM,KAAK,SAAS,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAC1C,4CAA4C;QAC5C,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC5B,OAAO;IACT,CAAC;IAED,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,oFAAoF;QACpF,+DAA+D;QAC/D,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QACrC,OAAO;IACT,CAAC;IAED,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACxC,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QACrC,OAAO;IACT,CAAC;IAED,IAAI,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,sFAAsF;QACtF,IAAI,eAAe,CAAC,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAClD,OAAO,GAAG,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QACtC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACpC,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC;QACtB,UAAU,CAAC,OAAO,CAAC,CAAC;QACpB,OAAO;IACT,CAAC;IAED,QAAQ,CAAC,WAAW,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;AACrC,CAAC;AAED,SAAS,QAAQ,CAAC,WAAwB;IACxC,IAAI,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IACxC,IAAI,KAAK;QAAE,OAAO,KAAK,CAAC;IAExB,KAAK,GAAG,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;IACpD,UAAU,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;IAEnC,MAAM,SAAS,GAAG,KAAK,CAAC;IACxB,0FAA0F;IAC1F,mFAAmF;IACnF,WAAW,CAAC,aAAa,EAAE,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE;QAC9C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC;QACnC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO;QAC1E,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC7B,cAAc,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;YAChC,OAAO;QACT,CAAC;QACD,QAAQ,CAAC,WAAW,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,OAAO,KAAK,CAAC;AACf,CAAC;AAcD;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,EAC7B,WAAW,EACX,QAAQ,EACR,MAAM,GAAG,sBAAsB,GACV;IACrB,MAAM,KAAK,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC;IACpC,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IAC3C,MAAM,YAAY,GAAiB,EAAE,MAAM,EAAE,CAAC;IAE9C,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACzC,IAAI,QAAQ;QAAE,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;;QACnD,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;IAE1E,QAAQ,CAAC,WAAW,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;IAEnC,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,OAAO,GAAG,EAAE;QACV,IAAI,QAAQ;YAAE,OAAO;QACrB,QAAQ,GAAG,IAAI,CAAC;QAChB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACxC,IAAI,CAAC,OAAO;YAAE,OAAO;QAErB,MAAM,MAAM,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;QAC/C,MAAM,KAAK,GAAG,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QAC1D,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAEvD,IAAI,OAAO,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC3B,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YACrC,OAAO;QACT,CAAC;QAED,IAAI,eAAe,CAAC,OAAO,CAAC,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YAC/C,kFAAkF;YAClF,oDAAoD;YACpD,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YACrC,QAAQ,CAAC,WAAW,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QACrC,CAAC;IACH,CAAC,CAAC;AACJ,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,qBAAqB,CAAC,WAAwB;IAC5D,OAAO,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,CAAC;AACzD,CAAC;AAED,6FAA6F;AAC7F,MAAM,UAAU,gBAAgB,CAAC,WAAwB,EAAE,QAAkB;IAC3E,OAAO,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC,EAAE,OAAO,IAAI,IAAI,CAAC;AACnG,CAAC","sourcesContent":["'use client';\n\nimport type { QueryClient, QueryKey } from '@tanstack/react-query';\n\n/**\n * Bounded re-read ladder for a document that resolved ABSENT.\n *\n * A one-shot lookup that lands `null` has no listener to tell it when the doc appears —\n * the row would stay blank until something invalidates it. That is the real failure the\n * realtime path was introduced to fix (a mirror doc that is missing or lagging at fetch\n * time: just after a create-and-redirect, or in a second tab racing the server mirror).\n * This scheduler restores the recovery without a listener: after an absent result it\n * re-reads a few times on a widening ladder, then gives up.\n *\n * Delays (ms) between re-reads within one absence episode. After the last rung the episode\n * is exhausted and never restarts on its own; only a later PRESENT→absent transition opens\n * a new one.\n */\nexport const ABSENT_RETRY_DELAYS_MS = [5_000, 15_000, 45_000, 120_000] as const;\n\n/**\n * The rules the scheduler holds to:\n *\n * - It polls ONLY a query in `status: 'success'` whose data is `null`. An error state is\n *   never polled (a denial is not an absence), and an error mid-episode pauses the ladder\n *   with its remaining budget intact.\n * - One timer per query key and one budget per absence episode: the first successful\n *   `undefined → null` opens the episode, and neither a repeated `null` nor an additional\n *   consumer resets it. A `present → null` transition opens a NEW episode.\n * - Several consumers may register the same key with DIFFERENT ladders. The effective\n *   ladder is the union: poll if any registrant wants polling, using the LONGEST ladder\n *   among them, recomputed on every register and release. Mount order never decides.\n * - Eligibility is TanStack's `query.isActive()` — at least one observer that is not\n *   disabled. Subscribe-mode and disabled observers therefore never keep an episode\n *   polling, while disabling ONE consumer cannot stop polling another still needs.\n * - Losing the last enabled observer PAUSES the ladder and retains the episode's remaining\n *   rungs; a later enabled observer resumes from there. A new observer on an EXHAUSTED\n *   episode does not restart it.\n * - Cache removal (gc) discards the episode outright, so a later re-fetch that lands absent\n *   starts fresh.\n *\n * Because the timer is per key rather than per observer, N consumers of one absent id cost\n * one re-read per rung, not N.\n */\n\ntype Episode = {\n  /** Rungs consumed so far; `>= effectiveDelays().length` means exhausted. */\n  attempt: number;\n  timer: ReturnType<typeof setTimeout> | null;\n};\n\ntype Registration = {\n  delays: readonly number[];\n};\n\ntype Tracked = {\n  queryKey: QueryKey;\n  registrations: Registration[];\n};\n\ntype SchedulerState = {\n  episodes: Map<string, Episode>;\n  tracked: Map<string, Tracked>;\n};\n\nconst NO_DELAYS: readonly number[] = [];\n\n// Per-QueryClient, like the doc-subscription registry: a discarded client is GC'd with its\n// bookkeeping, and each browser tab schedules independently.\nconst schedulers = new WeakMap<QueryClient, SchedulerState>();\n\n/**\n * Hash a key the way THIS client hashes it, so a consumer with a custom\n * `queryKeyHashFn` still lines up with `QueryCache.get()`.\n */\nfunction hashOf(queryClient: QueryClient, queryKey: QueryKey): string {\n  return queryClient.defaultQueryOptions({ queryKey }).queryHash;\n}\n\n/** Union of the registrants' ladders: the longest one wins; none means no polling. */\nfunction effectiveDelays(tracked: Tracked | undefined): readonly number[] {\n  if (!tracked) return NO_DELAYS;\n  let longest: readonly number[] = NO_DELAYS;\n  for (const registration of tracked.registrations) {\n    if (registration.delays.length > longest.length) longest = registration.delays;\n  }\n  return longest;\n}\n\nfunction clearTimer(episode: Episode | undefined): void {\n  if (episode?.timer != null) {\n    clearTimeout(episode.timer);\n    episode.timer = null;\n  }\n}\n\nfunction discardEpisode(state: SchedulerState, hash: string): void {\n  clearTimer(state.episodes.get(hash));\n  state.episodes.delete(hash);\n}\n\nfunction schedule(queryClient: QueryClient, state: SchedulerState, hash: string): void {\n  const tracked = state.tracked.get(hash);\n  const episode = state.episodes.get(hash);\n  if (!tracked || !episode || episode.timer !== null) return;\n\n  const delays = effectiveDelays(tracked);\n  if (episode.attempt >= delays.length) return;\n\n  episode.timer = setTimeout(() => {\n    episode.timer = null;\n    episode.attempt += 1;\n    const current = state.tracked.get(hash);\n    if (!current || !isAbsentAndActive(queryClient, hash)) return;\n    void queryClient.refetchQueries({ queryKey: current.queryKey, exact: true, type: 'active' });\n    // Lay the next rung; the ladder stops the moment the doc appears, the budget runs\n    // out, or the last enabled observer goes away.\n    evaluate(queryClient, state, hash);\n  }, delays[episode.attempt]);\n}\n\nfunction isAbsentAndActive(queryClient: QueryClient, hash: string): boolean {\n  const query = queryClient.getQueryCache().get(hash);\n  if (!query) return false;\n  return query.state.status === 'success' && query.state.data === null && query.isActive();\n}\n\nfunction evaluate(queryClient: QueryClient, state: SchedulerState, hash: string): void {\n  const query = queryClient.getQueryCache().get(hash);\n  if (!query) {\n    discardEpisode(state, hash);\n    return;\n  }\n\n  const { status, data } = query.state;\n\n  if (status === 'success' && data !== null) {\n    // The doc is present — the episode is over.\n    discardEpisode(state, hash);\n    return;\n  }\n\n  if (status !== 'success') {\n    // Pending or errored: never polled, but the budget survives so an error mid-episode\n    // cannot hand the id a fresh ladder when it returns to absent.\n    clearTimer(state.episodes.get(hash));\n    return;\n  }\n\n  const tracked = state.tracked.get(hash);\n  if (!tracked) {\n    clearTimer(state.episodes.get(hash));\n    return;\n  }\n\n  let episode = state.episodes.get(hash);\n  if (!episode) {\n    // No registrant wants polling — do not open an episode that could never spend a rung.\n    if (effectiveDelays(tracked).length === 0) return;\n    episode = { attempt: 0, timer: null };\n    state.episodes.set(hash, episode);\n  }\n\n  if (!query.isActive()) {\n    clearTimer(episode);\n    return;\n  }\n\n  schedule(queryClient, state, hash);\n}\n\nfunction getState(queryClient: QueryClient): SchedulerState {\n  let state = schedulers.get(queryClient);\n  if (state) return state;\n\n  state = { episodes: new Map(), tracked: new Map() };\n  schedulers.set(queryClient, state);\n\n  const scheduler = state;\n  // Exactly ONE cache listener per QueryClient, created with this state and never detached:\n  // it is WeakMap-scoped, so it is collected together with the client it belongs to.\n  queryClient.getQueryCache().subscribe((event) => {\n    const hash = event.query.queryHash;\n    if (!scheduler.tracked.has(hash) && !scheduler.episodes.has(hash)) return;\n    if (event.type === 'removed') {\n      discardEpisode(scheduler, hash);\n      return;\n    }\n    evaluate(queryClient, scheduler, hash);\n  });\n\n  return state;\n}\n\nexport interface TrackAbsentDocParams {\n  queryClient: QueryClient;\n  /** Exact key of the per-id lookup query. */\n  queryKey: QueryKey;\n  /**\n   * Ladder this registrant wants; an empty array means it wants no re-reads. Registrants\n   * on the same key combine by union — the longest ladder among them governs — so one\n   * consumer passing `[]` never disables polling another consumer asked for.\n   */\n  delays?: readonly number[];\n}\n\n/**\n * Register interest in re-reading `queryKey` while it resolves absent. Returns an\n * idempotent release function; releasing the last interested consumer pauses the ladder\n * without spending the episode's remaining budget, and releasing the last registrant that\n * wanted polling shrinks the effective ladder for the episode still in progress.\n */\nexport function trackAbsentDoc({\n  queryClient,\n  queryKey,\n  delays = ABSENT_RETRY_DELAYS_MS,\n}: TrackAbsentDocParams): () => void {\n  const state = getState(queryClient);\n  const hash = hashOf(queryClient, queryKey);\n  const registration: Registration = { delays };\n\n  const existing = state.tracked.get(hash);\n  if (existing) existing.registrations.push(registration);\n  else state.tracked.set(hash, { queryKey, registrations: [registration] });\n\n  evaluate(queryClient, state, hash);\n\n  let released = false;\n  return () => {\n    if (released) return;\n    released = true;\n    const current = state.tracked.get(hash);\n    if (!current) return;\n\n    const before = effectiveDelays(current).length;\n    const index = current.registrations.indexOf(registration);\n    if (index >= 0) current.registrations.splice(index, 1);\n\n    if (current.registrations.length === 0) {\n      state.tracked.delete(hash);\n      clearTimer(state.episodes.get(hash));\n      return;\n    }\n\n    if (effectiveDelays(current).length !== before) {\n      // The effective ladder changed: re-derive under the new one rather than letting a\n      // timer from the departed registrant's ladder fire.\n      clearTimer(state.episodes.get(hash));\n      evaluate(queryClient, state, hash);\n    }\n  };\n}\n\n/** Test-only: number of absence episodes currently tracked for a QueryClient. */\nexport function __absenceEpisodeCount(queryClient: QueryClient): number {\n  return schedulers.get(queryClient)?.episodes.size ?? 0;\n}\n\n/** Test-only: rungs already spent on a key's current episode, or `null` if there is none. */\nexport function __absenceAttempt(queryClient: QueryClient, queryKey: QueryKey): number | null {\n  return schedulers.get(queryClient)?.episodes.get(hashOf(queryClient, queryKey))?.attempt ?? null;\n}\n"]}

package/dist/react/firestore/batch-doc-loader.d.ts

@@ -0,0 +1,45 @@
+import { type Firestore } from 'firebase/firestore';
+import type { QueryClient } from '@tanstack/react-query';
+/**
+ * Coalescing document loader behind {@link useBatchFirestoreDocs}'s one-shot mode.
+ *
+ * Every id is its own observed React Query query, so without coalescing N ids would issue
+ * N Firestore round-trips. The loader collects the ids enqueued in a single microtask and
+ * dispatches them as `where(documentId(), 'in', chunk)` queries of at most 30 ids each
+ * (`'batch'` transport), or as concurrent per-document gets (`'get'` transport — required
+ * for collections whose rules gate reads on `resource.data`, where an unconstrained list
+ * query is denied wholesale but per-document gets are evaluated per doc).
+ *
+ * Two properties are load-bearing:
+ *
+ * - **The loader resolves promises only — it NEVER writes the query cache.** TanStack's
+ *   per-query fetch identity is therefore the sole guard against a late batch response
+ *   overwriting a newer per-id result.
+ * - **A dispatched batch is closed.** A later enqueue of the same id (a refetch after a
+ *   cancellation, say) always joins a NEW batch, never the in-flight one — so a cancelled
+ *   read can never be served by the request it was cancelled out of.
+ *
+ * Cancelling one per-id query detaches only that waiter; the shared request still completes
+ * for its batch-mates.
+ *
+ * Loaders are scoped per `(QueryClient, Firestore instance, collectionPath)`. The Firestore
+ * instance is part of the scope on purpose: two `db` instances sharing a collection path
+ * must never share a request.
+ */
+/** Firestore's hard cap on the number of values in an `in` filter. */
+export declare const FIRESTORE_IN_LIMIT = 30;
+/** Maximum `in`-query requests in flight at once, per loader scope. */
+export declare const MAX_CONCURRENT_BATCH_REQUESTS = 4;
+/** Maximum per-document gets in flight at once, per loader scope. */
+export declare const MAX_CONCURRENT_DOC_GETS = 12;
+export type LoadedDoc = Record<string, unknown> & {
+    id: string;
+};
+export type DocLoader = {
+    /** Resolve one id through the coalescing `in`-query batcher. */
+    loadBatched(id: string, signal?: AbortSignal): Promise<LoadedDoc | null>;
+    /** Resolve one id through its own `getDoc`, bounded by the get concurrency limit. */
+    loadOne(id: string, signal?: AbortSignal): Promise<LoadedDoc | null>;
+};
+export declare function getDocLoader(queryClient: QueryClient, db: Firestore, collectionPath: string): DocLoader;
+//# sourceMappingURL=batch-doc-loader.d.ts.map

package/dist/react/firestore/batch-doc-loader.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"batch-doc-loader.d.ts","sourceRoot":"","sources":["../../../src/react/firestore/batch-doc-loader.ts"],"names":[],"mappings":"AAEA,OAAO,EAQL,KAAK,SAAS,EACf,MAAM,oBAAoB,CAAC;AAC5B,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAEzD;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,sEAAsE;AACtE,eAAO,MAAM,kBAAkB,KAAK,CAAC;AAErC,uEAAuE;AACvE,eAAO,MAAM,6BAA6B,IAAI,CAAC;AAE/C,qEAAqE;AACrE,eAAO,MAAM,uBAAuB,KAAK,CAAC;AAE1C,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG;IAAE,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC;AAOjE,MAAM,MAAM,SAAS,GAAG;IACtB,gEAAgE;IAChE,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC;IACzE,qFAAqF;IACrF,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC;CACtE,CAAC;AAoJF,wBAAgB,YAAY,CAC1B,WAAW,EAAE,WAAW,EACxB,EAAE,EAAE,SAAS,EACb,cAAc,EAAE,MAAM,GACrB,SAAS,CAiBX"}

package/dist/react/firestore/batch-doc-loader.js

@@ -0,0 +1,179 @@
+'use client';
+import { collection, doc, documentId, getDoc, getDocs, query, where, } from 'firebase/firestore';
+/**
+ * Coalescing document loader behind {@link useBatchFirestoreDocs}'s one-shot mode.
+ *
+ * Every id is its own observed React Query query, so without coalescing N ids would issue
+ * N Firestore round-trips. The loader collects the ids enqueued in a single microtask and
+ * dispatches them as `where(documentId(), 'in', chunk)` queries of at most 30 ids each
+ * (`'batch'` transport), or as concurrent per-document gets (`'get'` transport — required
+ * for collections whose rules gate reads on `resource.data`, where an unconstrained list
+ * query is denied wholesale but per-document gets are evaluated per doc).
+ *
+ * Two properties are load-bearing:
+ *
+ * - **The loader resolves promises only — it NEVER writes the query cache.** TanStack's
+ *   per-query fetch identity is therefore the sole guard against a late batch response
+ *   overwriting a newer per-id result.
+ * - **A dispatched batch is closed.** A later enqueue of the same id (a refetch after a
+ *   cancellation, say) always joins a NEW batch, never the in-flight one — so a cancelled
+ *   read can never be served by the request it was cancelled out of.
+ *
+ * Cancelling one per-id query detaches only that waiter; the shared request still completes
+ * for its batch-mates.
+ *
+ * Loaders are scoped per `(QueryClient, Firestore instance, collectionPath)`. The Firestore
+ * instance is part of the scope on purpose: two `db` instances sharing a collection path
+ * must never share a request.
+ */
+/** Firestore's hard cap on the number of values in an `in` filter. */
+export const FIRESTORE_IN_LIMIT = 30;
+/** Maximum `in`-query requests in flight at once, per loader scope. */
+export const MAX_CONCURRENT_BATCH_REQUESTS = 4;
+/** Maximum per-document gets in flight at once, per loader scope. */
+export const MAX_CONCURRENT_DOC_GETS = 12;
+/** Runs at most `max` tasks concurrently; a slot is released when its task settles. */
+function createConcurrencyLimiter(max) {
+    let active = 0;
+    const waiting = [];
+    const pump = () => {
+        while (active < max && waiting.length > 0) {
+            const start = waiting.shift();
+            active += 1;
+            start?.();
+        }
+    };
+    const release = () => {
+        active -= 1;
+        pump();
+    };
+    return (task) => new Promise((resolve, reject) => {
+        waiting.push(() => {
+            task().then((value) => {
+                release();
+                resolve(value);
+            }, (error) => {
+                release();
+                reject(error);
+            });
+        });
+        pump();
+    });
+}
+function abortReason(signal) {
+    return signal.reason ?? new Error('Document read was cancelled');
+}
+function createDocLoader(db, collectionPath) {
+    const runBatchRequest = createConcurrencyLimiter(MAX_CONCURRENT_BATCH_REQUESTS);
+    const runDocGet = createConcurrencyLimiter(MAX_CONCURRENT_DOC_GETS);
+    // Ids enqueued in the CURRENT microtask. Nulled out at dispatch so the dispatched batch
+    // is closed and a later enqueue opens a fresh one.
+    let openBatch = null;
+    const runChunk = (chunk, batch) => runBatchRequest(async () => {
+        let found = null;
+        let failure;
+        try {
+            const snapshot = await getDocs(query(collection(db, collectionPath), where(documentId(), 'in', chunk)));
+            found = new Map();
+            snapshot.forEach((snap) => {
+                found.set(snap.id, { id: snap.id, ...snap.data() });
+            });
+        }
+        catch (error) {
+            failure = error;
+        }
+        for (const id of chunk) {
+            const waiters = batch.get(id);
+            batch.delete(id);
+            if (!waiters)
+                continue;
+            for (const waiter of [...waiters]) {
+                if (found)
+                    waiter.resolve(found.get(id) ?? null);
+                else
+                    waiter.reject(failure);
+            }
+        }
+    });
+    const dispatch = () => {
+        const batch = openBatch;
+        openBatch = null;
+        if (!batch || batch.size === 0)
+            return;
+        const ids = [...batch.keys()];
+        for (let i = 0; i < ids.length; i += FIRESTORE_IN_LIMIT) {
+            void runChunk(ids.slice(i, i + FIRESTORE_IN_LIMIT), batch);
+        }
+    };
+    const loadBatched = (id, signal) => new Promise((resolve, reject) => {
+        if (signal?.aborted) {
+            reject(abortReason(signal));
+            return;
+        }
+        if (!openBatch) {
+            openBatch = new Map();
+            queueMicrotask(dispatch);
+        }
+        const batch = openBatch;
+        let slot = batch.get(id);
+        if (!slot) {
+            slot = [];
+            batch.set(id, slot);
+        }
+        const waiters = slot;
+        let settled = false;
+        let onAbort;
+        const settle = (run) => {
+            if (settled)
+                return;
+            settled = true;
+            const index = waiters.indexOf(waiter);
+            if (index >= 0)
+                waiters.splice(index, 1);
+            // An id nobody is waiting on any more must not ride into a billed `in` query.
+            if (waiters.length === 0 && batch.get(id) === waiters)
+                batch.delete(id);
+            if (onAbort)
+                signal?.removeEventListener('abort', onAbort);
+            run();
+        };
+        const waiter = {
+            resolve: (value) => settle(() => resolve(value)),
+            reject: (error) => settle(() => reject(error)),
+        };
+        waiters.push(waiter);
+        if (signal) {
+            onAbort = () => waiter.reject(abortReason(signal));
+            signal.addEventListener('abort', onAbort, { once: true });
+        }
+    });
+    const loadOne = (id, signal) => runDocGet(async () => {
+        if (signal?.aborted)
+            throw abortReason(signal);
+        const snapshot = await getDoc(doc(db, collectionPath, id));
+        return snapshot.exists() ? { id: snapshot.id, ...snapshot.data() } : null;
+    });
+    return { loadBatched, loadOne };
+}
+// Per-QueryClient → per-Firestore-instance → per-collectionPath. WeakMaps so a discarded
+// client or db instance takes its loaders with it.
+const loaderScopes = new WeakMap();
+export function getDocLoader(queryClient, db, collectionPath) {
+    let byDb = loaderScopes.get(queryClient);
+    if (!byDb) {
+        byDb = new WeakMap();
+        loaderScopes.set(queryClient, byDb);
+    }
+    let byPath = byDb.get(db);
+    if (!byPath) {
+        byPath = new Map();
+        byDb.set(db, byPath);
+    }
+    let loader = byPath.get(collectionPath);
+    if (!loader) {
+        loader = createDocLoader(db, collectionPath);
+        byPath.set(collectionPath, loader);
+    }
+    return loader;
+}
+//# sourceMappingURL=batch-doc-loader.js.map