@ttt-productions/query-core 0.14.21 → 0.14.23

package/dist/react/defaults.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"defaults.d.ts","sourceRoot":"","sources":["../../src/react/defaults.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAE/E,eAAO,MAAM,mBAAmB,EAAE,cAcjC,CAAC;AAEF,eAAO,MAAM,wBAAwB,EAAE,iBAEtC,CAAC"}

package/dist/react/defaults.js

@@ -0,0 +1,17 @@
+export const defaultQueryOptions = {
+    queries: {
+        refetchOnWindowFocus: false,
+        refetchOnReconnect: true,
+        refetchOnMount: false,
+        staleTime: 30_000,
+        gcTime: 5 * 60_000,
+        retry: (failureCount) => failureCount < 2,
+    },
+    mutations: {
+        retry: 0,
+    },
+};
+export const defaultQueryClientConfig = {
+    defaultOptions: defaultQueryOptions,
+};
+//# sourceMappingURL=defaults.js.map

package/dist/react/defaults.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"defaults.js","sourceRoot":"","sources":["../../src/react/defaults.ts"],"names":[],"mappings":"AAEA,MAAM,CAAC,MAAM,mBAAmB,GAAmB;IACjD,OAAO,EAAE;QACP,oBAAoB,EAAE,KAAK;QAC3B,kBAAkB,EAAE,IAAI;QACxB,cAAc,EAAE,KAAK;QAErB,SAAS,EAAE,MAAM;QACjB,MAAM,EAAE,CAAC,GAAG,MAAM;QAElB,KAAK,EAAE,CAAC,YAAY,EAAE,EAAE,CAAC,YAAY,GAAG,CAAC;KAC1C;IACD,SAAS,EAAE;QACT,KAAK,EAAE,CAAC;KACT;CACF,CAAC;AAEF,MAAM,CAAC,MAAM,wBAAwB,GAAsB;IACzD,cAAc,EAAE,mBAAmB;CACpC,CAAC","sourcesContent":["import type { DefaultOptions, QueryClientConfig } from '@tanstack/react-query';\n\nexport const defaultQueryOptions: DefaultOptions = {\n  queries: {\n    refetchOnWindowFocus: false,\n    refetchOnReconnect: true,\n    refetchOnMount: false,\n\n    staleTime: 30_000,\n    gcTime: 5 * 60_000,\n\n    retry: (failureCount) => failureCount < 2,\n  },\n  mutations: {\n    retry: 0,\n  },\n};\n\nexport const defaultQueryClientConfig: QueryClientConfig = {\n  defaultOptions: defaultQueryOptions,\n};\n"]}

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

@@ -0,0 +1,33 @@
+import type { Query, QueryClient, QueryKey } from '@tanstack/react-query';
+export type RefetchType = 'active' | 'all' | 'none';
+export type CacheAction = 'refresh' | 'remove' | 'reset';
+export type CacheInvalidation = {
+    kind: 'exact';
+    queryKey: QueryKey;
+    refetchType?: RefetchType;
+    action?: CacheAction;
+} | {
+    kind: 'prefix';
+    queryKey: QueryKey;
+    refetchType?: RefetchType;
+    action?: CacheAction;
+} | {
+    kind: 'predicate';
+    description: string;
+    match: (query: Query) => boolean;
+    refetchType?: RefetchType;
+    action?: CacheAction;
+};
+type EntryOptions = {
+    refetchType?: RefetchType;
+    action?: 'refresh';
+} | {
+    action: 'remove' | 'reset';
+};
+export declare function exact(queryKey: QueryKey, opts?: EntryOptions): CacheInvalidation;
+export declare function prefix(queryKey: QueryKey, opts?: EntryOptions): CacheInvalidation;
+export declare function predicate(description: string, match: (query: Query) => boolean, opts?: EntryOptions): CacheInvalidation;
+export declare function serializeInvalidation(inv: CacheInvalidation): string;
+export declare function applyInvalidations(queryClient: QueryClient, invalidations: ReadonlyArray<CacheInvalidation>): Promise<void>;
+export {};
+//# sourceMappingURL=cache-invalidation.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"cache-invalidation.d.ts","sourceRoot":"","sources":["../../../src/react/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,WAAW,GAAG,SAAS,GAAG,QAAQ,GAAG,OAAO,CAAC;AAEzD,MAAM,MAAM,iBAAiB,GACzB;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,EAAE,QAAQ,CAAC;IAAC,WAAW,CAAC,EAAE,WAAW,CAAC;IAAC,MAAM,CAAC,EAAE,WAAW,CAAA;CAAE,GACtF;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,QAAQ,EAAE,QAAQ,CAAC;IAAC,WAAW,CAAC,EAAE,WAAW,CAAC;IAAC,MAAM,CAAC,EAAE,WAAW,CAAA;CAAE,GACvF;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;IAC1B,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB,CAAC;AAEN,KAAK,YAAY,GACf;IAAE,WAAW,CAAC,EAAE,WAAW,CAAC;IAAC,MAAM,CAAC,EAAE,SAAS,CAAA;CAAE,GAAG;IAAE,MAAM,EAAE,QAAQ,GAAG,OAAO,CAAA;CAAE,CAAC;AAOrF,wBAAgB,KAAK,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,YAAY,GAAG,iBAAiB,CAEhF;AAED,wBAAgB,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,YAAY,GAAG,iBAAiB,CAEjF;AAED,wBAAgB,SAAS,CACvB,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,EAChC,IAAI,CAAC,EAAE,YAAY,GAClB,iBAAiB,CAEnB;AAED,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,iBAAiB,GAAG,MAAM,CAIpE;AA0BD,wBAAgB,kBAAkB,CAChC,WAAW,EAAE,WAAW,EACxB,aAAa,EAAE,aAAa,CAAC,iBAAiB,CAAC,GAC9C,OAAO,CAAC,IAAI,CAAC,CA+Bf"}

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

@@ -0,0 +1,74 @@
+const entryFields = (opts) => ({
+    refetchType: opts && 'refetchType' in opts ? opts.refetchType : undefined,
+    action: opts?.action,
+});
+export function exact(queryKey, opts) {
+    return { kind: 'exact', queryKey, ...entryFields(opts) };
+}
+export function prefix(queryKey, opts) {
+    return { kind: 'prefix', queryKey, ...entryFields(opts) };
+}
+export function predicate(description, match, opts) {
+    return { kind: 'predicate', description, match, ...entryFields(opts) };
+}
+export function serializeInvalidation(inv) {
+    const action = inv.action && inv.action !== 'refresh' ? `${inv.action}:` : '';
+    if (inv.kind === 'predicate')
+        return `${action}predicate:${inv.description}`;
+    return `${action}${inv.kind}:${JSON.stringify(inv.queryKey)}`;
+}
+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 };
+}
+/**
+ * TanStack's `Query.fetch` reuses an in-flight initial fetch instead of cancelling it, so without
+ * this cancel the invalidation would resolve with the value read before the mutation committed.
+ */
+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 });
+    }
+}
+/** A cancel or reset changes the state a predicate reads, so the second step must not re-apply the filter. */
+function matchedNow(queryClient, filters) {
+    const matched = new Set(queryClient.getQueryCache().findAll(filters));
+    return { predicate: (query) => matched.has(query) };
+}
+export function applyInvalidations(queryClient, invalidations) {
+    const seen = new Set();
+    const refreshes = [];
+    for (const inv of invalidations) {
+        const sig = serializeInvalidation(inv);
+        if (seen.has(sig))
+            continue;
+        seen.add(sig);
+        const filters = invalidationFilters(inv);
+        const action = inv.action ?? 'refresh';
+        if (action === 'remove') {
+            const matched = matchedNow(queryClient, filters);
+            // Removing a query abandons its in-flight read silently, leaving a watching screen on fetching; cancelling first ends it visibly.
+            void queryClient.cancelQueries(matched);
+            queryClient.removeQueries(matched);
+            continue;
+        }
+        if (action === 'reset') {
+            refreshes.push(queryClient.resetQueries(matchedNow(queryClient, filters)));
+            continue;
+        }
+        const refetchType = inv.refetchType ?? 'active';
+        if (refetchType !== 'none') {
+            cancelPendingInitialReads(queryClient, filters);
+        }
+        refreshes.push(queryClient.invalidateQueries({ ...filters, refetchType }));
+    }
+    return Promise.all(refreshes).then(() => undefined);
+}
+//# sourceMappingURL=cache-invalidation.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"cache-invalidation.js","sourceRoot":"","sources":["../../../src/react/domain-events/cache-invalidation.ts"],"names":[],"mappings":"AAoBA,MAAM,WAAW,GAAG,CAAC,IAAmB,EAAE,EAAE,CAAC,CAAC;IAC5C,WAAW,EAAE,IAAI,IAAI,aAAa,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS;IACzE,MAAM,EAAE,IAAI,EAAE,MAAM;CACrB,CAAC,CAAC;AAEH,MAAM,UAAU,KAAK,CAAC,QAAkB,EAAE,IAAmB;IAC3D,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;AAC3D,CAAC;AAED,MAAM,UAAU,MAAM,CAAC,QAAkB,EAAE,IAAmB;IAC5D,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;AAC5D,CAAC;AAED,MAAM,UAAU,SAAS,CACvB,WAAmB,EACnB,KAAgC,EAChC,IAAmB;IAEnB,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,WAAW,EAAE,KAAK,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;AACzE,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,GAAsB;IAC1D,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAC9E,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW;QAAE,OAAO,GAAG,MAAM,aAAa,GAAG,CAAC,WAAW,EAAE,CAAC;IAC7E,OAAO,GAAG,MAAM,GAAG,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;AAChE,CAAC;AAED,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;;;GAGG;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,8GAA8G;AAC9G,SAAS,UAAU,CAAC,WAAwB,EAAE,OAAqB;IACjE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,aAAa,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;IACtE,OAAO,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;AACtD,CAAC;AAED,MAAM,UAAU,kBAAkB,CAChC,WAAwB,EACxB,aAA+C;IAE/C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,SAAS,GAAoB,EAAE,CAAC;IACtC,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,OAAO,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAC;QACzC,MAAM,MAAM,GAAgB,GAAG,CAAC,MAAM,IAAI,SAAS,CAAC;QAEpD,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACjD,kIAAkI;YAClI,KAAK,WAAW,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YACxC,WAAW,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YACnC,SAAS;QACX,CAAC;QACD,IAAI,MAAM,KAAK,OAAO,EAAE,CAAC;YACvB,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YAC3E,SAAS;QACX,CAAC;QAED,MAAM,WAAW,GAAgB,GAAG,CAAC,WAAW,IAAI,QAAQ,CAAC;QAC7D,IAAI,WAAW,KAAK,MAAM,EAAE,CAAC;YAC3B,yBAAyB,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;QAClD,CAAC;QAED,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,EAAE,GAAG,OAAO,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;AACtD,CAAC","sourcesContent":["import type { Query, QueryClient, QueryFilters, QueryKey } from '@tanstack/react-query';\n\nexport type RefetchType = 'active' | 'all' | 'none';\n\nexport type CacheAction = 'refresh' | 'remove' | 'reset';\n\nexport type CacheInvalidation =\n  | { kind: 'exact'; queryKey: QueryKey; refetchType?: RefetchType; action?: CacheAction }\n  | { kind: 'prefix'; queryKey: QueryKey; refetchType?: RefetchType; action?: CacheAction }\n  | {\n      kind: 'predicate';\n      description: string;\n      match: (query: Query) => boolean;\n      refetchType?: RefetchType;\n      action?: CacheAction;\n    };\n\ntype EntryOptions =\n  { refetchType?: RefetchType; action?: 'refresh' } | { action: 'remove' | 'reset' };\n\nconst entryFields = (opts?: EntryOptions) => ({\n  refetchType: opts && 'refetchType' in opts ? opts.refetchType : undefined,\n  action: opts?.action,\n});\n\nexport function exact(queryKey: QueryKey, opts?: EntryOptions): CacheInvalidation {\n  return { kind: 'exact', queryKey, ...entryFields(opts) };\n}\n\nexport function prefix(queryKey: QueryKey, opts?: EntryOptions): CacheInvalidation {\n  return { kind: 'prefix', queryKey, ...entryFields(opts) };\n}\n\nexport function predicate(\n  description: string,\n  match: (query: Query) => boolean,\n  opts?: EntryOptions,\n): CacheInvalidation {\n  return { kind: 'predicate', description, match, ...entryFields(opts) };\n}\n\nexport function serializeInvalidation(inv: CacheInvalidation): string {\n  const action = inv.action && inv.action !== 'refresh' ? `${inv.action}:` : '';\n  if (inv.kind === 'predicate') return `${action}predicate:${inv.description}`;\n  return `${action}${inv.kind}:${JSON.stringify(inv.queryKey)}`;\n}\n\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 * TanStack's `Query.fetch` reuses an in-flight initial fetch instead of cancelling it, so without\n * this cancel the invalidation would resolve with the value read before the mutation committed.\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/** A cancel or reset changes the state a predicate reads, so the second step must not re-apply the filter. */\nfunction matchedNow(queryClient: QueryClient, filters: QueryFilters): QueryFilters {\n  const matched = new Set(queryClient.getQueryCache().findAll(filters));\n  return { predicate: (query) => matched.has(query) };\n}\n\nexport function applyInvalidations(\n  queryClient: QueryClient,\n  invalidations: ReadonlyArray<CacheInvalidation>,\n): Promise<void> {\n  const seen = new Set<string>();\n  const refreshes: Promise<void>[] = [];\n  for (const inv of invalidations) {\n    const sig = serializeInvalidation(inv);\n    if (seen.has(sig)) continue;\n    seen.add(sig);\n\n    const filters = invalidationFilters(inv);\n    const action: CacheAction = inv.action ?? 'refresh';\n\n    if (action === 'remove') {\n      const matched = matchedNow(queryClient, filters);\n      // Removing a query abandons its in-flight read silently, leaving a watching screen on fetching; cancelling first ends it visibly.\n      void queryClient.cancelQueries(matched);\n      queryClient.removeQueries(matched);\n      continue;\n    }\n    if (action === 'reset') {\n      refreshes.push(queryClient.resetQueries(matchedNow(queryClient, filters)));\n      continue;\n    }\n\n    const refetchType: RefetchType = inv.refetchType ?? 'active';\n    if (refetchType !== 'none') {\n      cancelPendingInitialReads(queryClient, filters);\n    }\n\n    refreshes.push(queryClient.invalidateQueries({ ...filters, refetchType }));\n  }\n  return Promise.all(refreshes).then(() => undefined);\n}\n"]}

package/dist/react/domain-events/create-domain-event-invalidator.d.ts

@@ -0,0 +1,28 @@
+import type { QueryClient } from '@tanstack/react-query';
+import { exact, prefix, predicate, type CacheInvalidation } from './cache-invalidation.js';
+export type DomainEventInvalidationRegistry<TEvent extends {
+    type: string;
+    ids: unknown;
+}> = {
+    [K in TEvent['type']]: (ids: Extract<TEvent, {
+        type: K;
+    }>['ids']) => ReadonlyArray<CacheInvalidation>;
+};
+export interface DomainEventInvalidator<TEvent extends {
+    type: string;
+    ids: unknown;
+}> {
+    notify(queryClient: QueryClient, event: TEvent): Promise<void>;
+    notifyAll(queryClient: QueryClient, events: ReadonlyArray<TEvent>): Promise<void>;
+    readonly helpers: {
+        exact: typeof exact;
+        prefix: typeof prefix;
+        predicate: typeof predicate;
+    };
+    readonly registry: DomainEventInvalidationRegistry<TEvent>;
+}
+export declare function createDomainEventInvalidator<TEvent extends {
+    type: string;
+    ids: unknown;
+}>(registry: DomainEventInvalidationRegistry<TEvent>): DomainEventInvalidator<TEvent>;
+//# sourceMappingURL=create-domain-event-invalidator.d.ts.map

package/dist/react/domain-events/create-domain-event-invalidator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"create-domain-event-invalidator.d.ts","sourceRoot":"","sources":["../../../src/react/domain-events/create-domain-event-invalidator.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAEL,KAAK,EACL,MAAM,EACN,SAAS,EACT,KAAK,iBAAiB,EACvB,MAAM,yBAAyB,CAAC;AAEjC,MAAM,MAAM,+BAA+B,CAAC,MAAM,SAAS;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,OAAO,CAAA;CAAE,IAAI;KAC1F,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,GAAG,CACrB,GAAG,EAAE,OAAO,CAAC,MAAM,EAAE;QAAE,IAAI,EAAE,CAAC,CAAA;KAAE,CAAC,CAAC,KAAK,CAAC,KACrC,aAAa,CAAC,iBAAiB,CAAC;CACtC,CAAC;AAEF,MAAM,WAAW,sBAAsB,CAAC,MAAM,SAAS;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,OAAO,CAAA;CAAE;IACnF,MAAM,CAAC,WAAW,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/D,SAAS,CAAC,WAAW,EAAE,WAAW,EAAE,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAClF,QAAQ,CAAC,OAAO,EAAE;QAChB,KAAK,EAAE,OAAO,KAAK,CAAC;QACpB,MAAM,EAAE,OAAO,MAAM,CAAC;QACtB,SAAS,EAAE,OAAO,SAAS,CAAC;KAC7B,CAAC;IACF,QAAQ,CAAC,QAAQ,EAAE,+BAA+B,CAAC,MAAM,CAAC,CAAC;CAC5D;AAED,wBAAgB,4BAA4B,CAAC,MAAM,SAAS;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,OAAO,CAAA;CAAE,EACxF,QAAQ,EAAE,+BAA+B,CAAC,MAAM,CAAC,GAChD,sBAAsB,CAAC,MAAM,CAAC,CA4BhC"}

package/dist/{domain-events → react/domain-events}/create-domain-event-invalidator.js

@@ -1,9 +1,4 @@
-import { applyInvalidations, exact, prefix, predicate, } from "./cache-invalidation.js";
-/**
- * Build a domain-event → cache-invalidation notifier from a typed registry.
- * The registry's keys are statically tied to `TEvent["type"]`, so missing or
- * extra entries are compile errors.
- */
+import { applyInvalidations, exact, prefix, predicate, } from './cache-invalidation.js';
 export function createDomainEventInvalidator(registry) {
     function lookup(type) {
         return registry[type];

package/dist/react/domain-events/create-domain-event-invalidator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"create-domain-event-invalidator.js","sourceRoot":"","sources":["../../../src/react/domain-events/create-domain-event-invalidator.ts"],"names":[],"mappings":"AACA,OAAO,EACL,kBAAkB,EAClB,KAAK,EACL,MAAM,EACN,SAAS,GAEV,MAAM,yBAAyB,CAAC;AAmBjC,MAAM,UAAU,4BAA4B,CAC1C,QAAiD;IAEjD,SAAS,MAAM,CAA+B,IAAW;QACvD,OAAO,QAAQ,CAAC,IAAI,CAEiB,CAAC;IACxC,CAAC;IAED,SAAS,MAAM,CAAC,WAAwB,EAAE,KAAa;QACrD,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,IAAsB,CAAC,CAAC;QAChD,MAAM,aAAa,GAAG,EAAE,CAAC,KAAK,CAAC,GAAuD,CAAC,CAAC;QACxF,OAAO,kBAAkB,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;IACxD,CAAC;IAED,SAAS,SAAS,CAAC,WAAwB,EAAE,MAA6B;QACxE,MAAM,GAAG,GAAwB,EAAE,CAAC;QACpC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,IAAsB,CAAC,CAAC;YAChD,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAuD,CAAC,CAAC,CAAC;QACjF,CAAC;QACD,OAAO,kBAAkB,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;IAC9C,CAAC;IAED,OAAO;QACL,MAAM;QACN,SAAS;QACT,OAAO,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE;QACrC,QAAQ;KACT,CAAC;AACJ,CAAC","sourcesContent":["import type { QueryClient } from '@tanstack/react-query';\nimport {\n  applyInvalidations,\n  exact,\n  prefix,\n  predicate,\n  type CacheInvalidation,\n} from './cache-invalidation.js';\n\nexport type DomainEventInvalidationRegistry<TEvent extends { type: string; ids: unknown }> = {\n  [K in TEvent['type']]: (\n    ids: Extract<TEvent, { type: K }>['ids'],\n  ) => ReadonlyArray<CacheInvalidation>;\n};\n\nexport interface DomainEventInvalidator<TEvent extends { type: string; ids: unknown }> {\n  notify(queryClient: QueryClient, event: TEvent): Promise<void>;\n  notifyAll(queryClient: QueryClient, events: ReadonlyArray<TEvent>): Promise<void>;\n  readonly helpers: {\n    exact: typeof exact;\n    prefix: typeof prefix;\n    predicate: typeof predicate;\n  };\n  readonly registry: DomainEventInvalidationRegistry<TEvent>;\n}\n\nexport function createDomainEventInvalidator<TEvent extends { type: string; ids: unknown }>(\n  registry: DomainEventInvalidationRegistry<TEvent>,\n): DomainEventInvalidator<TEvent> {\n  function lookup<TType extends TEvent['type']>(type: TType) {\n    return registry[type] as (\n      ids: Extract<TEvent, { type: TType }>['ids'],\n    ) => ReadonlyArray<CacheInvalidation>;\n  }\n\n  function notify(queryClient: QueryClient, event: TEvent): Promise<void> {\n    const fn = lookup(event.type as TEvent['type']);\n    const invalidations = fn(event.ids as Extract<TEvent, { type: TEvent['type'] }>['ids']);\n    return applyInvalidations(queryClient, invalidations);\n  }\n\n  function notifyAll(queryClient: QueryClient, events: ReadonlyArray<TEvent>): Promise<void> {\n    const all: CacheInvalidation[] = [];\n    for (const event of events) {\n      const fn = lookup(event.type as TEvent['type']);\n      all.push(...fn(event.ids as Extract<TEvent, { type: TEvent['type'] }>['ids']));\n    }\n    return applyInvalidations(queryClient, all);\n  }\n\n  return {\n    notify,\n    notifyAll,\n    helpers: { exact, prefix, predicate },\n    registry,\n  };\n}\n"]}

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

@@ -1,39 +1,11 @@
 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

@@ -1 +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"}
+{"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,eAAO,MAAM,sBAAsB,uCAA4C,CAAC;AAwIhF,MAAM,WAAW,oBAAoB;IACnC,WAAW,EAAE,WAAW,CAAC;IACzB,QAAQ,EAAE,QAAQ,CAAC;IACnB,MAAM,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAC5B;AAED,wBAAgB,cAAc,CAAC,EAC7B,WAAW,EACX,QAAQ,EACR,MAA+B,GAChC,EAAE,oBAAoB,GAAG,MAAM,IAAI,CAiCnC;AAED,wBAAgB,qBAAqB,CAAC,WAAW,EAAE,WAAW,GAAG,MAAM,CAEtE;AAED,wBAAgB,gBAAgB,CAAC,WAAW,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,GAAG,MAAM,GAAG,IAAI,CAE5F"}

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

@@ -1,31 +1,11 @@
 '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()`.
- */
+/** Hashes with this client's `queryKeyHashFn` so a custom hash 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;
@@ -61,8 +41,6 @@ function schedule(queryClient, state, 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]);
 }
@@ -80,13 +58,10 @@ function evaluate(queryClient, state, hash) {
     }
     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;
     }
@@ -97,7 +72,6 @@ function evaluate(queryClient, state, hash) {
     }
     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 };
@@ -116,8 +90,6 @@ function getState(queryClient) {
     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))
@@ -130,12 +102,6 @@ function getState(queryClient) {
     });
     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);
@@ -164,18 +130,14 @@ export function trackAbsentDoc({ queryClient, queryKey, delays = ABSENT_RETRY_DE
             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;
 }

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

@@ -1 +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"]}
+{"version":3,"file":"absence-scheduler.js","sourceRoot":"","sources":["../../../src/react/firestore/absence-scheduler.ts"],"names":[],"mappings":"AAAA,YAAY,CAAC;AAIb,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAU,CAAC;AAqBhF,MAAM,SAAS,GAAsB,EAAE,CAAC;AAExC,MAAM,UAAU,GAAG,IAAI,OAAO,EAA+B,CAAC;AAE9D,0GAA0G;AAC1G,SAAS,MAAM,CAAC,WAAwB,EAAE,QAAkB;IAC1D,OAAO,WAAW,CAAC,mBAAmB,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,SAAS,CAAC;AACjE,CAAC;AAED,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,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,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC5B,OAAO;IACT,CAAC;IAED,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,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,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,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;AAQD,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,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,MAAM,UAAU,qBAAqB,CAAC,WAAwB;IAC5D,OAAO,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,CAAC;AACzD,CAAC;AAED,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\nexport const ABSENT_RETRY_DELAYS_MS = [5_000, 15_000, 45_000, 120_000] as const;\n\ntype Episode = {\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\nconst schedulers = new WeakMap<QueryClient, SchedulerState>();\n\n/** Hashes with this client's `queryKeyHashFn` so a custom hash still lines up with `QueryCache.get()`. */\nfunction hashOf(queryClient: QueryClient, queryKey: QueryKey): string {\n  return queryClient.defaultQueryOptions({ queryKey }).queryHash;\n}\n\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    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    discardEpisode(state, hash);\n    return;\n  }\n\n  if (status !== 'success') {\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    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  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  queryKey: QueryKey;\n  delays?: readonly number[];\n}\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      clearTimer(state.episodes.get(hash));\n      evaluate(queryClient, state, hash);\n    }\n  };\n}\n\nexport function __absenceEpisodeCount(queryClient: QueryClient): number {\n  return schedulers.get(queryClient)?.episodes.size ?? 0;\n}\n\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

@@ -1,42 +1,12 @@
 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 `FIRESTORE_IN_FILTER_LIMIT` 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.
- */
-/** 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;

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

@@ -1 +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;AAGzD;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,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;AAmJF,wBAAgB,YAAY,CAC1B,WAAW,EAAE,WAAW,EACxB,EAAE,EAAE,SAAS,EACb,cAAc,EAAE,MAAM,GACrB,SAAS,CAiBX"}
+{"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;AAGzD,eAAO,MAAM,6BAA6B,IAAI,CAAC;AAE/C,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,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC;IACzE,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC;CACtE,CAAC;AA6IF,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

@@ -1,37 +1,8 @@
 'use client';
 import { collection, doc, documentId, getDoc, getDocs, query, where, } from 'firebase/firestore';
 import { chunk, FIRESTORE_IN_FILTER_LIMIT } from '@ttt-productions/firebase-helpers';
-/**
- * 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 `FIRESTORE_IN_FILTER_LIMIT` 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.
- */
-/** 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 = [];
@@ -65,8 +36,6 @@ function abortReason(signal) {
 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;
@@ -128,7 +97,6 @@ function createDocLoader(db, collectionPath) {
             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)
@@ -153,8 +121,6 @@ function createDocLoader(db, collectionPath) {
     });
     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);

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

@@ -1 +1 @@
-{"version":3,"file":"batch-doc-loader.js","sourceRoot":"","sources":["../../../src/react/firestore/batch-doc-loader.ts"],"names":[],"mappings":"AAAA,YAAY,CAAC;AAEb,OAAO,EACL,UAAU,EACV,GAAG,EACH,UAAU,EACV,MAAM,EACN,OAAO,EACP,KAAK,EACL,KAAK,GAEN,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EAAE,KAAK,EAAE,yBAAyB,EAAE,MAAM,mCAAmC,CAAC;AAErF;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,uEAAuE;AACvE,MAAM,CAAC,MAAM,6BAA6B,GAAG,CAAC,CAAC;AAE/C,qEAAqE;AACrE,MAAM,CAAC,MAAM,uBAAuB,GAAG,EAAE,CAAC;AAgB1C,uFAAuF;AACvF,SAAS,wBAAwB,CAAC,GAAW;IAC3C,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,OAAO,GAAmB,EAAE,CAAC;IAEnC,MAAM,IAAI,GAAG,GAAG,EAAE;QAChB,OAAO,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;YAC9B,MAAM,IAAI,CAAC,CAAC;YACZ,KAAK,EAAE,EAAE,CAAC;QACZ,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,GAAG,EAAE;QACnB,MAAM,IAAI,CAAC,CAAC;QACZ,IAAI,EAAE,CAAC;IACT,CAAC,CAAC;IAEF,OAAO,CAAI,IAAsB,EAAc,EAAE,CAC/C,IAAI,OAAO,CAAI,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACjC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE;YAChB,IAAI,EAAE,CAAC,IAAI,CACT,CAAC,KAAK,EAAE,EAAE;gBACR,OAAO,EAAE,CAAC;gBACV,OAAO,CAAC,KAAK,CAAC,CAAC;YACjB,CAAC,EACD,CAAC,KAAK,EAAE,EAAE;gBACR,OAAO,EAAE,CAAC;gBACV,MAAM,CAAC,KAAK,CAAC,CAAC;YAChB,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,IAAI,EAAE,CAAC;IACT,CAAC,CAAC,CAAC;AACP,CAAC;AAED,SAAS,WAAW,CAAC,MAAmB;IACtC,OAAO,MAAM,CAAC,MAAM,IAAI,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;AACnE,CAAC;AAED,SAAS,eAAe,CAAC,EAAa,EAAE,cAAsB;IAC5D,MAAM,eAAe,GAAG,wBAAwB,CAAC,6BAA6B,CAAC,CAAC;IAChF,MAAM,SAAS,GAAG,wBAAwB,CAAC,uBAAuB,CAAC,CAAC;IAEpE,wFAAwF;IACxF,mDAAmD;IACnD,IAAI,SAAS,GAAiC,IAAI,CAAC;IAEnD,MAAM,QAAQ,GAAG,CAAC,KAAe,EAAE,KAA4B,EAAE,EAAE,CACjE,eAAe,CAAC,KAAK,IAAI,EAAE;QACzB,IAAI,KAAK,GAAkC,IAAI,CAAC;QAChD,IAAI,OAAgB,CAAC;QACrB,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,MAAM,OAAO,CAC5B,KAAK,CAAC,UAAU,CAAC,EAAE,EAAE,cAAc,CAAC,EAAE,KAAK,CAAC,UAAU,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CACxE,CAAC;YACF,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAC;YACrC,QAAQ,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;gBACxB,KAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,EAAe,CAAC,CAAC;YACpE,CAAC,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,GAAG,KAAK,CAAC;QAClB,CAAC;QAED,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9B,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACjB,IAAI,CAAC,OAAO;gBAAE,SAAS;YACvB,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC;gBAClC,IAAI,KAAK;oBAAE,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC;;oBAC5C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IAEL,MAAM,QAAQ,GAAG,GAAG,EAAE;QACpB,MAAM,KAAK,GAAG,SAAS,CAAC;QACxB,SAAS,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO;QACvC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,yBAAyB,CAAC,EAAE,CAAC;YACtE,KAAK,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,WAAW,GAAG,CAAC,EAAU,EAAE,MAAoB,EAA6B,EAAE,CAClF,IAAI,OAAO,CAAmB,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QAChD,IAAI,MAAM,EAAE,OAAO,EAAE,CAAC;YACpB,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5B,OAAO;QACT,CAAC;QAED,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;YACtB,cAAc,CAAC,QAAQ,CAAC,CAAC;QAC3B,CAAC;QAED,MAAM,KAAK,GAAG,SAAS,CAAC;QACxB,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,GAAG,EAAE,CAAC;YACV,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACtB,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC;QAErB,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,OAAiC,CAAC;QAEtC,MAAM,MAAM,GAAG,CAAC,GAAe,EAAE,EAAE;YACjC,IAAI,OAAO;gBAAE,OAAO;YACpB,OAAO,GAAG,IAAI,CAAC;YACf,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,KAAK,IAAI,CAAC;gBAAE,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACzC,8EAA8E;YAC9E,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,OAAO;gBAAE,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACxE,IAAI,OAAO;gBAAE,MAAM,EAAE,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAC3D,GAAG,EAAE,CAAC;QACR,CAAC,CAAC;QAEF,MAAM,MAAM,GAAW;YACrB,OAAO,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAChD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;SAC/C,CAAC;QAEF,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAErB,IAAI,MAAM,EAAE,CAAC;YACX,OAAO,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;YACnD,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC,CAAC,CAAC;IAEL,MAAM,OAAO,GAAG,CAAC,EAAU,EAAE,MAAoB,EAA6B,EAAE,CAC9E,SAAS,CAAC,KAAK,IAAI,EAAE;QACnB,IAAI,MAAM,EAAE,OAAO;YAAE,MAAM,WAAW,CAAC,MAAM,CAAC,CAAC;QAC/C,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC;QAC3D,OAAO,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,GAAG,QAAQ,CAAC,IAAI,EAAE,EAAgB,CAAC,CAAC,CAAC,IAAI,CAAC;IAC3F,CAAC,CAAC,CAAC;IAEL,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;AAClC,CAAC;AAED,yFAAyF;AACzF,mDAAmD;AACnD,MAAM,YAAY,GAAG,IAAI,OAAO,EAA2D,CAAC;AAE5F,MAAM,UAAU,YAAY,CAC1B,WAAwB,EACxB,EAAa,EACb,cAAsB;IAEtB,IAAI,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IACzC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,IAAI,GAAG,IAAI,OAAO,EAAE,CAAC;QACrB,YAAY,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IACtC,CAAC;IACD,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC1B,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACvB,CAAC;IACD,IAAI,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IACxC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,GAAG,eAAe,CAAC,EAAE,EAAE,cAAc,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","sourcesContent":["'use client';\n\nimport {\n  collection,\n  doc,\n  documentId,\n  getDoc,\n  getDocs,\n  query,\n  where,\n  type Firestore,\n} from 'firebase/firestore';\nimport type { QueryClient } from '@tanstack/react-query';\nimport { chunk, FIRESTORE_IN_FILTER_LIMIT } from '@ttt-productions/firebase-helpers';\n\n/**\n * Coalescing document loader behind {@link useBatchFirestoreDocs}'s one-shot mode.\n *\n * Every id is its own observed React Query query, so without coalescing N ids would issue\n * N Firestore round-trips. The loader collects the ids enqueued in a single microtask and\n * dispatches them as `where(documentId(), 'in', chunk)` queries of at most `FIRESTORE_IN_FILTER_LIMIT` ids each\n * (`'batch'` transport), or as concurrent per-document gets (`'get'` transport — required\n * for collections whose rules gate reads on `resource.data`, where an unconstrained list\n * query is denied wholesale but per-document gets are evaluated per doc).\n *\n * Two properties are load-bearing:\n *\n * - **The loader resolves promises only — it NEVER writes the query cache.** TanStack's\n *   per-query fetch identity is therefore the sole guard against a late batch response\n *   overwriting a newer per-id result.\n * - **A dispatched batch is closed.** A later enqueue of the same id (a refetch after a\n *   cancellation, say) always joins a NEW batch, never the in-flight one — so a cancelled\n *   read can never be served by the request it was cancelled out of.\n *\n * Cancelling one per-id query detaches only that waiter; the shared request still completes\n * for its batch-mates.\n *\n * Loaders are scoped per `(QueryClient, Firestore instance, collectionPath)`. The Firestore\n * instance is part of the scope on purpose: two `db` instances sharing a collection path\n * must never share a request.\n */\n\n/** Maximum `in`-query requests in flight at once, per loader scope. */\nexport const MAX_CONCURRENT_BATCH_REQUESTS = 4;\n\n/** Maximum per-document gets in flight at once, per loader scope. */\nexport const MAX_CONCURRENT_DOC_GETS = 12;\n\nexport type LoadedDoc = Record<string, unknown> & { id: string };\n\ntype Waiter = {\n  resolve: (value: LoadedDoc | null) => void;\n  reject: (error: unknown) => void;\n};\n\nexport type DocLoader = {\n  /** Resolve one id through the coalescing `in`-query batcher. */\n  loadBatched(id: string, signal?: AbortSignal): Promise<LoadedDoc | null>;\n  /** Resolve one id through its own `getDoc`, bounded by the get concurrency limit. */\n  loadOne(id: string, signal?: AbortSignal): Promise<LoadedDoc | null>;\n};\n\n/** Runs at most `max` tasks concurrently; a slot is released when its task settles. */\nfunction createConcurrencyLimiter(max: number) {\n  let active = 0;\n  const waiting: (() => void)[] = [];\n\n  const pump = () => {\n    while (active < max && waiting.length > 0) {\n      const start = waiting.shift();\n      active += 1;\n      start?.();\n    }\n  };\n\n  const release = () => {\n    active -= 1;\n    pump();\n  };\n\n  return <R>(task: () => Promise<R>): Promise<R> =>\n    new Promise<R>((resolve, reject) => {\n      waiting.push(() => {\n        task().then(\n          (value) => {\n            release();\n            resolve(value);\n          },\n          (error) => {\n            release();\n            reject(error);\n          },\n        );\n      });\n      pump();\n    });\n}\n\nfunction abortReason(signal: AbortSignal): unknown {\n  return signal.reason ?? new Error('Document read was cancelled');\n}\n\nfunction createDocLoader(db: Firestore, collectionPath: string): DocLoader {\n  const runBatchRequest = createConcurrencyLimiter(MAX_CONCURRENT_BATCH_REQUESTS);\n  const runDocGet = createConcurrencyLimiter(MAX_CONCURRENT_DOC_GETS);\n\n  // Ids enqueued in the CURRENT microtask. Nulled out at dispatch so the dispatched batch\n  // is closed and a later enqueue opens a fresh one.\n  let openBatch: Map<string, Waiter[]> | null = null;\n\n  const runChunk = (chunk: string[], batch: Map<string, Waiter[]>) =>\n    runBatchRequest(async () => {\n      let found: Map<string, LoadedDoc> | null = null;\n      let failure: unknown;\n      try {\n        const snapshot = await getDocs(\n          query(collection(db, collectionPath), where(documentId(), 'in', chunk)),\n        );\n        found = new Map<string, LoadedDoc>();\n        snapshot.forEach((snap) => {\n          found!.set(snap.id, { id: snap.id, ...snap.data() } as LoadedDoc);\n        });\n      } catch (error) {\n        failure = error;\n      }\n\n      for (const id of chunk) {\n        const waiters = batch.get(id);\n        batch.delete(id);\n        if (!waiters) continue;\n        for (const waiter of [...waiters]) {\n          if (found) waiter.resolve(found.get(id) ?? null);\n          else waiter.reject(failure);\n        }\n      }\n    });\n\n  const dispatch = () => {\n    const batch = openBatch;\n    openBatch = null;\n    if (!batch || batch.size === 0) return;\n    for (const ids of chunk([...batch.keys()], FIRESTORE_IN_FILTER_LIMIT)) {\n      void runChunk(ids, batch);\n    }\n  };\n\n  const loadBatched = (id: string, signal?: AbortSignal): Promise<LoadedDoc | null> =>\n    new Promise<LoadedDoc | null>((resolve, reject) => {\n      if (signal?.aborted) {\n        reject(abortReason(signal));\n        return;\n      }\n\n      if (!openBatch) {\n        openBatch = new Map();\n        queueMicrotask(dispatch);\n      }\n\n      const batch = openBatch;\n      let slot = batch.get(id);\n      if (!slot) {\n        slot = [];\n        batch.set(id, slot);\n      }\n      const waiters = slot;\n\n      let settled = false;\n      let onAbort: (() => void) | undefined;\n\n      const settle = (run: () => void) => {\n        if (settled) return;\n        settled = true;\n        const index = waiters.indexOf(waiter);\n        if (index >= 0) waiters.splice(index, 1);\n        // An id nobody is waiting on any more must not ride into a billed `in` query.\n        if (waiters.length === 0 && batch.get(id) === waiters) batch.delete(id);\n        if (onAbort) signal?.removeEventListener('abort', onAbort);\n        run();\n      };\n\n      const waiter: Waiter = {\n        resolve: (value) => settle(() => resolve(value)),\n        reject: (error) => settle(() => reject(error)),\n      };\n\n      waiters.push(waiter);\n\n      if (signal) {\n        onAbort = () => waiter.reject(abortReason(signal));\n        signal.addEventListener('abort', onAbort, { once: true });\n      }\n    });\n\n  const loadOne = (id: string, signal?: AbortSignal): Promise<LoadedDoc | null> =>\n    runDocGet(async () => {\n      if (signal?.aborted) throw abortReason(signal);\n      const snapshot = await getDoc(doc(db, collectionPath, id));\n      return snapshot.exists() ? ({ id: snapshot.id, ...snapshot.data() } as LoadedDoc) : null;\n    });\n\n  return { loadBatched, loadOne };\n}\n\n// Per-QueryClient → per-Firestore-instance → per-collectionPath. WeakMaps so a discarded\n// client or db instance takes its loaders with it.\nconst loaderScopes = new WeakMap<QueryClient, WeakMap<Firestore, Map<string, DocLoader>>>();\n\nexport function getDocLoader(\n  queryClient: QueryClient,\n  db: Firestore,\n  collectionPath: string,\n): DocLoader {\n  let byDb = loaderScopes.get(queryClient);\n  if (!byDb) {\n    byDb = new WeakMap();\n    loaderScopes.set(queryClient, byDb);\n  }\n  let byPath = byDb.get(db);\n  if (!byPath) {\n    byPath = new Map();\n    byDb.set(db, byPath);\n  }\n  let loader = byPath.get(collectionPath);\n  if (!loader) {\n    loader = createDocLoader(db, collectionPath);\n    byPath.set(collectionPath, loader);\n  }\n  return loader;\n}\n"]}
+{"version":3,"file":"batch-doc-loader.js","sourceRoot":"","sources":["../../../src/react/firestore/batch-doc-loader.ts"],"names":[],"mappings":"AAAA,YAAY,CAAC;AAEb,OAAO,EACL,UAAU,EACV,GAAG,EACH,UAAU,EACV,MAAM,EACN,OAAO,EACP,KAAK,EACL,KAAK,GAEN,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EAAE,KAAK,EAAE,yBAAyB,EAAE,MAAM,mCAAmC,CAAC;AAErF,MAAM,CAAC,MAAM,6BAA6B,GAAG,CAAC,CAAC;AAE/C,MAAM,CAAC,MAAM,uBAAuB,GAAG,EAAE,CAAC;AAc1C,SAAS,wBAAwB,CAAC,GAAW;IAC3C,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,OAAO,GAAmB,EAAE,CAAC;IAEnC,MAAM,IAAI,GAAG,GAAG,EAAE;QAChB,OAAO,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;YAC9B,MAAM,IAAI,CAAC,CAAC;YACZ,KAAK,EAAE,EAAE,CAAC;QACZ,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,GAAG,EAAE;QACnB,MAAM,IAAI,CAAC,CAAC;QACZ,IAAI,EAAE,CAAC;IACT,CAAC,CAAC;IAEF,OAAO,CAAI,IAAsB,EAAc,EAAE,CAC/C,IAAI,OAAO,CAAI,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACjC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE;YAChB,IAAI,EAAE,CAAC,IAAI,CACT,CAAC,KAAK,EAAE,EAAE;gBACR,OAAO,EAAE,CAAC;gBACV,OAAO,CAAC,KAAK,CAAC,CAAC;YACjB,CAAC,EACD,CAAC,KAAK,EAAE,EAAE;gBACR,OAAO,EAAE,CAAC;gBACV,MAAM,CAAC,KAAK,CAAC,CAAC;YAChB,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,IAAI,EAAE,CAAC;IACT,CAAC,CAAC,CAAC;AACP,CAAC;AAED,SAAS,WAAW,CAAC,MAAmB;IACtC,OAAO,MAAM,CAAC,MAAM,IAAI,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;AACnE,CAAC;AAED,SAAS,eAAe,CAAC,EAAa,EAAE,cAAsB;IAC5D,MAAM,eAAe,GAAG,wBAAwB,CAAC,6BAA6B,CAAC,CAAC;IAChF,MAAM,SAAS,GAAG,wBAAwB,CAAC,uBAAuB,CAAC,CAAC;IAEpE,IAAI,SAAS,GAAiC,IAAI,CAAC;IAEnD,MAAM,QAAQ,GAAG,CAAC,KAAe,EAAE,KAA4B,EAAE,EAAE,CACjE,eAAe,CAAC,KAAK,IAAI,EAAE;QACzB,IAAI,KAAK,GAAkC,IAAI,CAAC;QAChD,IAAI,OAAgB,CAAC;QACrB,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,MAAM,OAAO,CAC5B,KAAK,CAAC,UAAU,CAAC,EAAE,EAAE,cAAc,CAAC,EAAE,KAAK,CAAC,UAAU,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CACxE,CAAC;YACF,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAC;YACrC,QAAQ,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;gBACxB,KAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,EAAe,CAAC,CAAC;YACpE,CAAC,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,GAAG,KAAK,CAAC;QAClB,CAAC;QAED,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9B,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACjB,IAAI,CAAC,OAAO;gBAAE,SAAS;YACvB,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC;gBAClC,IAAI,KAAK;oBAAE,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC;;oBAC5C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IAEL,MAAM,QAAQ,GAAG,GAAG,EAAE;QACpB,MAAM,KAAK,GAAG,SAAS,CAAC;QACxB,SAAS,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO;QACvC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,yBAAyB,CAAC,EAAE,CAAC;YACtE,KAAK,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,WAAW,GAAG,CAAC,EAAU,EAAE,MAAoB,EAA6B,EAAE,CAClF,IAAI,OAAO,CAAmB,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QAChD,IAAI,MAAM,EAAE,OAAO,EAAE,CAAC;YACpB,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5B,OAAO;QACT,CAAC;QAED,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;YACtB,cAAc,CAAC,QAAQ,CAAC,CAAC;QAC3B,CAAC;QAED,MAAM,KAAK,GAAG,SAAS,CAAC;QACxB,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,GAAG,EAAE,CAAC;YACV,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACtB,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC;QAErB,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,OAAiC,CAAC;QAEtC,MAAM,MAAM,GAAG,CAAC,GAAe,EAAE,EAAE;YACjC,IAAI,OAAO;gBAAE,OAAO;YACpB,OAAO,GAAG,IAAI,CAAC;YACf,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,KAAK,IAAI,CAAC;gBAAE,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACzC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,OAAO;gBAAE,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACxE,IAAI,OAAO;gBAAE,MAAM,EAAE,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAC3D,GAAG,EAAE,CAAC;QACR,CAAC,CAAC;QAEF,MAAM,MAAM,GAAW;YACrB,OAAO,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAChD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;SAC/C,CAAC;QAEF,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAErB,IAAI,MAAM,EAAE,CAAC;YACX,OAAO,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;YACnD,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC,CAAC,CAAC;IAEL,MAAM,OAAO,GAAG,CAAC,EAAU,EAAE,MAAoB,EAA6B,EAAE,CAC9E,SAAS,CAAC,KAAK,IAAI,EAAE;QACnB,IAAI,MAAM,EAAE,OAAO;YAAE,MAAM,WAAW,CAAC,MAAM,CAAC,CAAC;QAC/C,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC;QAC3D,OAAO,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,GAAG,QAAQ,CAAC,IAAI,EAAE,EAAgB,CAAC,CAAC,CAAC,IAAI,CAAC;IAC3F,CAAC,CAAC,CAAC;IAEL,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;AAClC,CAAC;AAED,MAAM,YAAY,GAAG,IAAI,OAAO,EAA2D,CAAC;AAE5F,MAAM,UAAU,YAAY,CAC1B,WAAwB,EACxB,EAAa,EACb,cAAsB;IAEtB,IAAI,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IACzC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,IAAI,GAAG,IAAI,OAAO,EAAE,CAAC;QACrB,YAAY,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IACtC,CAAC;IACD,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC1B,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACvB,CAAC;IACD,IAAI,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IACxC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,GAAG,eAAe,CAAC,EAAE,EAAE,cAAc,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","sourcesContent":["'use client';\n\nimport {\n  collection,\n  doc,\n  documentId,\n  getDoc,\n  getDocs,\n  query,\n  where,\n  type Firestore,\n} from 'firebase/firestore';\nimport type { QueryClient } from '@tanstack/react-query';\nimport { chunk, FIRESTORE_IN_FILTER_LIMIT } from '@ttt-productions/firebase-helpers';\n\nexport const MAX_CONCURRENT_BATCH_REQUESTS = 4;\n\nexport const MAX_CONCURRENT_DOC_GETS = 12;\n\nexport type LoadedDoc = Record<string, unknown> & { id: string };\n\ntype Waiter = {\n  resolve: (value: LoadedDoc | null) => void;\n  reject: (error: unknown) => void;\n};\n\nexport type DocLoader = {\n  loadBatched(id: string, signal?: AbortSignal): Promise<LoadedDoc | null>;\n  loadOne(id: string, signal?: AbortSignal): Promise<LoadedDoc | null>;\n};\n\nfunction createConcurrencyLimiter(max: number) {\n  let active = 0;\n  const waiting: (() => void)[] = [];\n\n  const pump = () => {\n    while (active < max && waiting.length > 0) {\n      const start = waiting.shift();\n      active += 1;\n      start?.();\n    }\n  };\n\n  const release = () => {\n    active -= 1;\n    pump();\n  };\n\n  return <R>(task: () => Promise<R>): Promise<R> =>\n    new Promise<R>((resolve, reject) => {\n      waiting.push(() => {\n        task().then(\n          (value) => {\n            release();\n            resolve(value);\n          },\n          (error) => {\n            release();\n            reject(error);\n          },\n        );\n      });\n      pump();\n    });\n}\n\nfunction abortReason(signal: AbortSignal): unknown {\n  return signal.reason ?? new Error('Document read was cancelled');\n}\n\nfunction createDocLoader(db: Firestore, collectionPath: string): DocLoader {\n  const runBatchRequest = createConcurrencyLimiter(MAX_CONCURRENT_BATCH_REQUESTS);\n  const runDocGet = createConcurrencyLimiter(MAX_CONCURRENT_DOC_GETS);\n\n  let openBatch: Map<string, Waiter[]> | null = null;\n\n  const runChunk = (chunk: string[], batch: Map<string, Waiter[]>) =>\n    runBatchRequest(async () => {\n      let found: Map<string, LoadedDoc> | null = null;\n      let failure: unknown;\n      try {\n        const snapshot = await getDocs(\n          query(collection(db, collectionPath), where(documentId(), 'in', chunk)),\n        );\n        found = new Map<string, LoadedDoc>();\n        snapshot.forEach((snap) => {\n          found!.set(snap.id, { id: snap.id, ...snap.data() } as LoadedDoc);\n        });\n      } catch (error) {\n        failure = error;\n      }\n\n      for (const id of chunk) {\n        const waiters = batch.get(id);\n        batch.delete(id);\n        if (!waiters) continue;\n        for (const waiter of [...waiters]) {\n          if (found) waiter.resolve(found.get(id) ?? null);\n          else waiter.reject(failure);\n        }\n      }\n    });\n\n  const dispatch = () => {\n    const batch = openBatch;\n    openBatch = null;\n    if (!batch || batch.size === 0) return;\n    for (const ids of chunk([...batch.keys()], FIRESTORE_IN_FILTER_LIMIT)) {\n      void runChunk(ids, batch);\n    }\n  };\n\n  const loadBatched = (id: string, signal?: AbortSignal): Promise<LoadedDoc | null> =>\n    new Promise<LoadedDoc | null>((resolve, reject) => {\n      if (signal?.aborted) {\n        reject(abortReason(signal));\n        return;\n      }\n\n      if (!openBatch) {\n        openBatch = new Map();\n        queueMicrotask(dispatch);\n      }\n\n      const batch = openBatch;\n      let slot = batch.get(id);\n      if (!slot) {\n        slot = [];\n        batch.set(id, slot);\n      }\n      const waiters = slot;\n\n      let settled = false;\n      let onAbort: (() => void) | undefined;\n\n      const settle = (run: () => void) => {\n        if (settled) return;\n        settled = true;\n        const index = waiters.indexOf(waiter);\n        if (index >= 0) waiters.splice(index, 1);\n        if (waiters.length === 0 && batch.get(id) === waiters) batch.delete(id);\n        if (onAbort) signal?.removeEventListener('abort', onAbort);\n        run();\n      };\n\n      const waiter: Waiter = {\n        resolve: (value) => settle(() => resolve(value)),\n        reject: (error) => settle(() => reject(error)),\n      };\n\n      waiters.push(waiter);\n\n      if (signal) {\n        onAbort = () => waiter.reject(abortReason(signal));\n        signal.addEventListener('abort', onAbort, { once: true });\n      }\n    });\n\n  const loadOne = (id: string, signal?: AbortSignal): Promise<LoadedDoc | null> =>\n    runDocGet(async () => {\n      if (signal?.aborted) throw abortReason(signal);\n      const snapshot = await getDoc(doc(db, collectionPath, id));\n      return snapshot.exists() ? ({ id: snapshot.id, ...snapshot.data() } as LoadedDoc) : null;\n    });\n\n  return { loadBatched, loadOne };\n}\n\nconst loaderScopes = new WeakMap<QueryClient, WeakMap<Firestore, Map<string, DocLoader>>>();\n\nexport function getDocLoader(\n  queryClient: QueryClient,\n  db: Firestore,\n  collectionPath: string,\n): DocLoader {\n  let byDb = loaderScopes.get(queryClient);\n  if (!byDb) {\n    byDb = new WeakMap();\n    loaderScopes.set(queryClient, byDb);\n  }\n  let byPath = byDb.get(db);\n  if (!byPath) {\n    byPath = new Map();\n    byDb.set(db, byPath);\n  }\n  let loader = byPath.get(collectionPath);\n  if (!loader) {\n    loader = createDocLoader(db, collectionPath);\n    byPath.set(collectionPath, loader);\n  }\n  return loader;\n}\n"]}