@adonis-agora/durable 0.49.0 → 0.50.0

package/dist/src/testing/in-memory-state-store.d.ts

@@ -1,45 +1,66 @@
-import type { ChildWait, RunFacetQuery, RunQuery, RunStatus, RunValueAxis, RunValueFacetOptions, RunValueFacetRow, ScheduleQuery, ScheduleRecord, SignalWaiter, StateStore, StepCheckpoint, WorkflowRun } from '../interfaces.js';
-/**
- * A non-durable, in-process `StateStore` for tests and local development.
- * The shipped `@dudousxd/nestjs-durable-store` package re-exports an equivalent.
- */
+import type { CheckpointQuery, CheckpointStat, ChildWait, RunFacetQuery, RunFacetRow, RunQuery, RunStatus, RunValueAxis, RunValueFacetOptions, RunValueFacetRow, ScheduleQuery, ScheduleRecord, SignalWaiter, StateStore, StepCheckpoint, WorkflowRun } from '../interfaces.js';
 export declare class InMemoryStateStore implements StateStore {
-    private readonly runs;
-    private readonly checkpoints;
-    private readonly signalWaiters;
+    /** All of this store's data; shared by reference with every {@link withScope} view. */
+    private state;
+    private get runs();
+    private get checkpoints();
+    private get signalWaiters();
     /**
      * Normalized search-attribute side-table, the in-memory analog of the SQL stores'
      * `durable_run_attributes`: `key -> (runId -> row)`. Maintained on every create/update so an
      * attribute query can be pushed DOWN to a key-indexed candidate set instead of scanning every run
      * and comparing in-process. Mirrors {@link normalizeAttributeRows} so behavior matches the SQL path.
      */
-    private readonly attributeIndex;
+    private get attributeIndex();
     /** Test/observability hook: how many candidate runs the last attribute query's index produced. */
-    lastAttributeCandidates: number;
+    get lastAttributeCandidates(): number;
+    set lastAttributeCandidates(value: number);
     /**
      * Test/observability hook: how many checkpoint rows the LAST checkpoint read materialized (the rows
      * actually returned to the caller). `listCheckpoints` returns all rows for the run; the targeted
      * {@link getLatestCheckpointByName} / {@link listCheckpointsByNamePrefix} return only the matches —
      * so this lets the benchmark contrast "fetch N, scan in JS" against "fetch the k that match".
      */
-    lastCheckpointRowsRead: number;
+    get lastCheckpointRowsRead(): number;
+    set lastCheckpointRowsRead(value: number);
+    /**
+     * Test/observability hook: checkpoint rows materialized since construction, across every
+     * checkpoint read that returns rows — what a run-detail test compares between paths.
+     */
+    get checkpointRowsRead(): number;
+    set checkpointRowsRead(value: number);
+    /** The namespace run reads are fenced to (see {@link withScope}); undefined sees every run. */
+    private scopeNamespace;
+    /**
+     * A view of THIS store (same data) whose run reads — `getRun`, `listRuns`, the counts and the
+     * recovery/dispatch/timer scans — only see `scope.namespace`. Writes stay unscoped. Mirrors
+     * `LucidStateStore.withScope`; `{ namespace: undefined }` is the operator view.
+     */
+    withScope(scope: {
+        namespace?: string | undefined;
+    }): InMemoryStateStore;
+    private inScope;
+    private visibleRuns;
     private key;
     /** Drop then re-add a run's normalized attribute rows so the index tracks its current attributes. */
     private reindexAttributes;
     createRun(run: WorkflowRun): Promise<void>;
     updateRun(runId: string, patch: Partial<WorkflowRun>): Promise<void>;
     updateRunIf(runId: string, expectedStatuses: RunStatus[], patch: Partial<WorkflowRun>): Promise<boolean>;
+    tryAdmitSingleton(runId: string, tag: string, workflow: string, limit: number, retryWakeAt?: number): Promise<boolean>;
     getRun(runId: string): Promise<WorkflowRun | null>;
     deleteRun(runId: string): Promise<void>;
+    deleteRuns(runIds: string[]): Promise<void>;
     getCheckpoint(runId: string, seq: number): Promise<StepCheckpoint | null>;
     saveCheckpoint(checkpoint: StepCheckpoint): Promise<void>;
     saveCheckpointIfPending(checkpoint: StepCheckpoint): Promise<boolean>;
+    saveCheckpointsIfPending(checkpoints: StepCheckpoint[]): Promise<boolean[]>;
     /** Mirror of `LucidStateStore.recordStepHeartbeat`: mutate in place, no-op when absent. */
     recordStepHeartbeat(runId: string, seq: number, at: Date, progress?: unknown): Promise<void>;
     listIncompleteRuns(namespace?: string): Promise<WorkflowRun[]>;
     listPendingRuns(limit: number, namespace?: string): Promise<WorkflowRun[]>;
     listDueTimers(nowMs: number, namespace?: string, limit?: number): Promise<WorkflowRun[]>;
-    listOrphanedRuns(nowMs: number, limit: number, namespace?: string): Promise<WorkflowRun[]>;
+    listOrphanedRuns(nowMs: number, limit: number, namespace?: string, owner?: string): Promise<WorkflowRun[]>;
     tryLockRun(runId: string, owner: string, leaseUntilMs: number, nowMs: number): Promise<boolean>;
     releaseRunLock(runId: string, owner?: string): Promise<void>;
     renewRunLock(runId: string, owner: string, leaseUntilMs: number): Promise<boolean>;
@@ -55,14 +76,15 @@ export declare class InMemoryStateStore implements StateStore {
         raw: unknown;
         saveCheckpoint: (cp: StepCheckpoint) => Promise<void>;
     }) => Promise<T>): Promise<T>;
-    private readonly bufferedSignals;
+    private get bufferedSignals();
     bufferSignal(token: string, payload: unknown): Promise<void>;
+    listBufferedSignalTokens(prefix: string, limit: number): Promise<string[]>;
     takeBufferedSignal(token: string): Promise<{
         payload: unknown;
     } | null>;
     /** `id -> row`, so {@link removeBufferedEvent} can delete an exact row regardless of iteration
      *  order — mirrors the SQL store's PK-by-id delete. */
-    private readonly bufferedEvents;
+    private get bufferedEvents();
     bufferEvent(input: {
         name: string;
         payload: unknown;
@@ -75,6 +97,7 @@ export declare class InMemoryStateStore implements StateStore {
         publishedAt: number;
     }>>;
     removeBufferedEvent(id: string): Promise<boolean>;
+    pruneBufferedEvents(publishedBefore: number, limit: number): Promise<number>;
     /**
      * Candidate run ids satisfying ONE attribute predicate, served from {@link attributeIndex} — the
      * pushdown step. Numeric predicates scan only `numValue` rows under the key; string/boolean ones
@@ -82,7 +105,8 @@ export declare class InMemoryStateStore implements StateStore {
      */
     private candidatesForFilter;
     countRuns(query: Omit<RunQuery, 'page' | 'size'>): Promise<number>;
-    private readonly schedules;
+    runFacets(query: RunFacetQuery): Promise<RunFacetRow[]>;
+    private get schedules();
     saveSchedule(record: ScheduleRecord): Promise<void>;
     getSchedule(id: string): Promise<ScheduleRecord | null>;
     updateSchedule(id: string, patch: Partial<Omit<ScheduleRecord, 'id' | 'createdAt'>>, expectedNextFireAt?: number | null): Promise<boolean>;
@@ -97,6 +121,11 @@ export declare class InMemoryStateStore implements StateStore {
      */
     runValueFacets(axis: RunValueAxis, query: RunFacetQuery, opts?: RunValueFacetOptions): Promise<RunValueFacetRow[]>;
     listCheckpoints(runId: string): Promise<StepCheckpoint[]>;
+    checkpointStats(runId: string, opts?: {
+        group?: string | undefined;
+    }): Promise<CheckpointStat[]>;
+    queryCheckpoints(runId: string, query: CheckpointQuery): Promise<StepCheckpoint[]>;
+    private runCheckpoints;
     getLatestCheckpointByName(runId: string, name: string): Promise<StepCheckpoint | undefined>;
     countCheckpoints(runId: string, fromSeq: number, toSeq: number, statuses: StepCheckpoint['status'][]): Promise<number>;
     listCheckpointsByNamePrefix(runId: string, prefixes: string[]): Promise<StepCheckpoint[]>;

package/dist/src/testing/in-memory-state-store.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"in-memory-state-store.d.ts","sourceRoot":"","sources":["../../../src/testing/in-memory-state-store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAEV,SAAS,EACT,aAAa,EACb,QAAQ,EACR,SAAS,EACT,YAAY,EACZ,oBAAoB,EACpB,gBAAgB,EAChB,aAAa,EACb,cAAc,EACd,YAAY,EACZ,UAAU,EACV,cAAc,EACd,WAAW,EACZ,MAAM,kBAAkB,CAAC;AAK1B;;;GAGG;AACH,qBAAa,kBAAmB,YAAW,UAAU;IACnD,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAkC;IACvD,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAqC;IACjE,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAmC;IAEjE;;;;;OAKG;IACH,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAmD;IAClF,kGAAkG;IAClG,uBAAuB,SAAK;IAC5B;;;;;OAKG;IACH,sBAAsB,SAAK;IAE3B,OAAO,CAAC,GAAG;IAIX,qGAAqG;IACrG,OAAO,CAAC,iBAAiB;IAYnB,SAAS,CAAC,GAAG,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAW/C;IAEK,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAMzE;IAEK,WAAW,CACf,KAAK,EAAE,MAAM,EACb,gBAAgB,EAAE,SAAS,EAAE,EAC7B,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,GAC1B,OAAO,CAAC,OAAO,CAAC,CASlB;IAEK,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,CAGvD;IAEK,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAU5C;IAEK,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,GAAG,IAAI,CAAC,CAG9E;IAEK,cAAc,CAAC,UAAU,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,CAE9D;IAEK,uBAAuB,CAAC,UAAU,EAAE,cAAc,GAAG,OAAO,CAAC,OAAO,CAAC,CAK1E;IAED,2FAA2F;IACrF,mBAAmB,CACvB,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,EAAE,EAAE,IAAI,EACR,QAAQ,CAAC,EAAE,OAAO,GACjB,OAAO,CAAC,IAAI,CAAC,CAKf;IAEK,kBAAkB,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAMnE;IAEK,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAQ/E;IAEK,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAW7F;IAEK,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAW/F;IAEK,UAAU,CACd,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,YAAY,EAAE,MAAM,EACpB,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,OAAO,CAAC,CAOlB;IAEK,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAQjE;IAEK,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAKvF;IAEK,eAAe,CAAC,MAAM,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,CAEzD;IAEK,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,CAKlE;IAEK,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,CAI/D;IAEK,yBAAyB,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,CAIzE;IAEK,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAK1E;IAEK,kBAAkB,CAAC,OAAO,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAG5D;IAEK,kBAAkB,CACtB,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,cAAc,GACnB,OAAO,CAAC,IAAI,CAAC,CAGf;IAEK,kBAAkB,CAAC,MAAM,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,CAQ5D;IAIK,WAAW,CAAC,CAAC,EACjB,IAAI,EAAE,CAAC,EAAE,EAAE;QACT,GAAG,EAAE,OAAO,CAAC;QACb,cAAc,EAAE,CAAC,EAAE,EAAE,cAAc,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;KACvD,KAAK,OAAO,CAAC,CAAC,CAAC,GACf,OAAO,CAAC,CAAC,CAAC,CAEZ;IAED,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAgC;IAC1D,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAIjE;IACK,kBAAkB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,OAAO,EAAE,OAAO,CAAA;KAAE,GAAG,IAAI,CAAC,CAM5E;IAED;2DACuD;IACvD,OAAO,CAAC,QAAQ,CAAC,cAAc,CAG3B;IACE,WAAW,CAAC,KAAK,EAAE;QACvB,IAAI,EAAE,MAAM,CAAC;QACb,OAAO,EAAE,OAAO,CAAC;QACjB,EAAE,EAAE,MAAM,CAAC;QACX,WAAW,EAAE,MAAM,CAAC;KACrB,GAAG,OAAO,CAAC,IAAI,CAAC,CAMhB;IACK,kBAAkB,CACtB,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,OAAO,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAMvE;IACK,mBAAmB,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAEtD;IAED;;;;OAIG;IACH,OAAO,CAAC,mBAAmB;IAiDrB,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAEvE;IAED,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAqC;IAEzD,YAAY,CAAC,MAAM,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,CAExD;IAEK,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,GAAG,IAAI,CAAC,CAG5D;IAEK,cAAc,CAClB,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,GAAG,WAAW,CAAC,CAAC,EACxD,kBAAkB,CAAC,EAAE,MAAM,GAAG,IAAI,GACjC,OAAO,CAAC,OAAO,CAAC,CAMlB;IAEK,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAEjD;IAEK,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC,CAoBnE;IAEK,QAAQ,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAqEtD;IAED;;;;;OAKG;IACG,cAAc,CAClB,IAAI,EAAE,YAAY,EAClB,KAAK,EAAE,aAAa,EACpB,IAAI,CAAC,EAAE,oBAAoB,GAC1B,OAAO,CAAC,gBAAgB,EAAE,CAAC,CAE7B;IAEK,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC,CAO9D;IAEK,yBAAyB,CAC7B,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,GACX,OAAO,CAAC,cAAc,GAAG,SAAS,CAAC,CAQrC;IAEK,gBAAgB,CACpB,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,cAAc,CAAC,QAAQ,CAAC,EAAE,GACnC,OAAO,CAAC,MAAM,CAAC,CAYjB;IAEK,2BAA2B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC,CAO9F;CACF"}
+{"version":3,"file":"in-memory-state-store.d.ts","sourceRoot":"","sources":["../../../src/testing/in-memory-state-store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAEV,eAAe,EACf,cAAc,EACd,SAAS,EACT,aAAa,EACb,WAAW,EACX,QAAQ,EACR,SAAS,EACT,YAAY,EACZ,oBAAoB,EACpB,gBAAgB,EAChB,aAAa,EACb,cAAc,EACd,YAAY,EACZ,UAAU,EACV,cAAc,EACd,WAAW,EACZ,MAAM,kBAAkB,CAAC;AA2D1B,qBAAa,kBAAmB,YAAW,UAAU;IACnD,uFAAuF;IACvF,OAAO,CAAC,KAAK,CAA+B;IAC5C,OAAO,KAAK,IAAI,GAEf;IACD,OAAO,KAAK,WAAW,GAEtB;IACD,OAAO,KAAK,aAAa,GAExB;IAED;;;;;OAKG;IACH,OAAO,KAAK,cAAc,GAEzB;IACD,kGAAkG;IAClG,IAAI,uBAAuB,IAAI,MAAM,CAEpC;IACD,IAAI,uBAAuB,CAAC,KAAK,EAAE,MAAM,EAExC;IACD;;;;;OAKG;IACH,IAAI,sBAAsB,IAAI,MAAM,CAEnC;IACD,IAAI,sBAAsB,CAAC,KAAK,EAAE,MAAM,EAEvC;IACD;;;OAGG;IACH,IAAI,kBAAkB,IAAI,MAAM,CAE/B;IACD,IAAI,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAEnC;IACD,+FAA+F;IAC/F,OAAO,CAAC,cAAc,CAAqB;IAE3C;;;;OAIG;IACH,SAAS,CAAC,KAAK,EAAE;QAAE,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;KAAE,GAAG,kBAAkB,CAQvE;IAED,OAAO,CAAC,OAAO;IAMf,OAAO,CAAC,WAAW;IAKnB,OAAO,CAAC,GAAG;IAIX,qGAAqG;IACrG,OAAO,CAAC,iBAAiB;IAYnB,SAAS,CAAC,GAAG,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAW/C;IAEK,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAUzE;IAEK,WAAW,CACf,KAAK,EAAE,MAAM,EACb,gBAAgB,EAAE,SAAS,EAAE,EAC7B,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,GAC1B,OAAO,CAAC,OAAO,CAAC,CAalB;IAEK,iBAAiB,CACrB,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,EACb,WAAW,CAAC,EAAE,MAAM,GACnB,OAAO,CAAC,OAAO,CAAC,CAYlB;IAEK,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,CAGvD;IAEK,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAU5C;IAEK,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAEhD;IAEK,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,GAAG,IAAI,CAAC,CAG9E;IAEK,cAAc,CAAC,UAAU,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,CAE9D;IAEK,uBAAuB,CAAC,UAAU,EAAE,cAAc,GAAG,OAAO,CAAC,OAAO,CAAC,CAK1E;IAEK,wBAAwB,CAAC,WAAW,EAAE,cAAc,EAAE,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAOhF;IAED,2FAA2F;IACrF,mBAAmB,CACvB,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,EAAE,EAAE,IAAI,EACR,QAAQ,CAAC,EAAE,OAAO,GACjB,OAAO,CAAC,IAAI,CAAC,CAKf;IAEK,kBAAkB,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAQnE;IAEK,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAU/E;IAEK,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAW7F;IAEK,gBAAgB,CACpB,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,SAAS,CAAC,EAAE,MAAM,EAClB,KAAK,CAAC,EAAE,MAAM,GACb,OAAO,CAAC,WAAW,EAAE,CAAC,CAaxB;IAEK,UAAU,CACd,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,YAAY,EAAE,MAAM,EACpB,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,OAAO,CAAC,CAOlB;IAEK,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAQjE;IAEK,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAKvF;IAEK,eAAe,CAAC,MAAM,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,CAEzD;IAEK,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,CAKlE;IAEK,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,CAI/D;IAEK,yBAAyB,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,CAIzE;IAEK,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAK1E;IAEK,kBAAkB,CAAC,OAAO,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAG5D;IAEK,kBAAkB,CACtB,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,cAAc,GACnB,OAAO,CAAC,IAAI,CAAC,CAGf;IAEK,kBAAkB,CAAC,MAAM,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,CAQ5D;IAIK,WAAW,CAAC,CAAC,EACjB,IAAI,EAAE,CAAC,EAAE,EAAE;QACT,GAAG,EAAE,OAAO,CAAC;QACb,cAAc,EAAE,CAAC,EAAE,EAAE,cAAc,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;KACvD,KAAK,OAAO,CAAC,CAAC,CAAC,GACf,OAAO,CAAC,CAAC,CAAC,CAEZ;IAED,OAAO,KAAK,eAAe,GAE1B;IACK,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAIjE;IACK,wBAAwB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAO/E;IACK,kBAAkB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,OAAO,EAAE,OAAO,CAAA;KAAE,GAAG,IAAI,CAAC,CAM5E;IAED;2DACuD;IACvD,OAAO,KAAK,cAAc,GAEzB;IACK,WAAW,CAAC,KAAK,EAAE;QACvB,IAAI,EAAE,MAAM,CAAC;QACb,OAAO,EAAE,OAAO,CAAC;QACjB,EAAE,EAAE,MAAM,CAAC;QACX,WAAW,EAAE,MAAM,CAAC;KACrB,GAAG,OAAO,CAAC,IAAI,CAAC,CAMhB;IACK,kBAAkB,CACtB,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,OAAO,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAMvE;IACK,mBAAmB,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAEtD;IACK,mBAAmB,CAAC,eAAe,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAOjF;IAED;;;;OAIG;IACH,OAAO,CAAC,mBAAmB;IAiDrB,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAEvE;IAEK,SAAS,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAG5D;IAED,OAAO,KAAK,SAAS,GAEpB;IAEK,YAAY,CAAC,MAAM,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,CAKxD;IAEK,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,GAAG,IAAI,CAAC,CAG5D;IAEK,cAAc,CAClB,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,GAAG,WAAW,CAAC,CAAC,EACxD,kBAAkB,CAAC,EAAE,MAAM,GAAG,IAAI,GACjC,OAAO,CAAC,OAAO,CAAC,CAOlB;IAEK,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAEjD;IAEK,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC,CAsBnE;IAEK,QAAQ,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAsEtD;IAED;;;;;OAKG;IACG,cAAc,CAClB,IAAI,EAAE,YAAY,EAClB,KAAK,EAAE,aAAa,EACpB,IAAI,CAAC,EAAE,oBAAoB,GAC1B,OAAO,CAAC,gBAAgB,EAAE,CAAC,CAE7B;IAEK,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC,CAQ9D;IAEK,eAAe,CACnB,KAAK,EAAE,MAAM,EACb,IAAI,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;KAAE,GACpC,OAAO,CAAC,cAAc,EAAE,CAAC,CAE3B;IAEK,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC,CAKvF;IAED,OAAO,CAAC,cAAc;IAIhB,yBAAyB,CAC7B,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,GACX,OAAO,CAAC,cAAc,GAAG,SAAS,CAAC,CAQrC;IAEK,gBAAgB,CACpB,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,cAAc,CAAC,QAAQ,CAAC,EAAE,GACnC,OAAO,CAAC,MAAM,CAAC,CAYjB;IAEK,2BAA2B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC,CAQ9F;CACF"}

package/dist/src/testing/in-memory-state-store.js

@@ -1,30 +1,100 @@
+import { namespaceMatches, normalizeNamespace } from '../namespaces.js';
+import { checkpointStatsOf, queryCheckpointsOf } from '../run-detail-summary.js';
+import { mergeRunFacetRows } from '../run-facets.js';
 import { runPageWindow } from '../run-pagination.js';
 import { scanRunValueFacets } from '../run-value-facets.js';
 import { normalizeAttributeRows } from '../search-attributes.js';
-/**
- * A non-durable, in-process `StateStore` for tests and local development.
- * The shipped `@dudousxd/nestjs-durable-store` package re-exports an equivalent.
- */
+import { settlesTerminally, singletonAdmissionDenialPatch, singletonAdmissionTags, withoutAdmission, } from '../singleton-admission.js';
+/** A caller's copy of a stored run, with a legacy `''`/absent namespace read as `'default'`. */
+const copyRun = (run) => ({
+    ...run,
+    namespace: normalizeNamespace(run.namespace),
+});
+/** A run about to be stored, its namespace normalized (`''` is the default pool). */
+const withNormalizedNamespace = (run) => run.namespace === undefined || run.namespace === '' ? copyRun(run) : run;
+const freshState = () => ({
+    runs: new Map(),
+    checkpoints: new Map(),
+    signalWaiters: new Map(),
+    attributeIndex: new Map(),
+    bufferedSignals: new Map(),
+    bufferedEvents: new Map(),
+    schedules: new Map(),
+    stats: { lastAttributeCandidates: 0, lastCheckpointRowsRead: 0, checkpointRowsRead: 0 },
+});
 export class InMemoryStateStore {
-    runs = new Map();
-    checkpoints = new Map();
-    signalWaiters = new Map();
+    /** All of this store's data; shared by reference with every {@link withScope} view. */
+    state = freshState();
+    get runs() {
+        return this.state.runs;
+    }
+    get checkpoints() {
+        return this.state.checkpoints;
+    }
+    get signalWaiters() {
+        return this.state.signalWaiters;
+    }
     /**
      * Normalized search-attribute side-table, the in-memory analog of the SQL stores'
      * `durable_run_attributes`: `key -> (runId -> row)`. Maintained on every create/update so an
      * attribute query can be pushed DOWN to a key-indexed candidate set instead of scanning every run
      * and comparing in-process. Mirrors {@link normalizeAttributeRows} so behavior matches the SQL path.
      */
-    attributeIndex = new Map();
+    get attributeIndex() {
+        return this.state.attributeIndex;
+    }
     /** Test/observability hook: how many candidate runs the last attribute query's index produced. */
-    lastAttributeCandidates = 0;
+    get lastAttributeCandidates() {
+        return this.state.stats.lastAttributeCandidates;
+    }
+    set lastAttributeCandidates(value) {
+        this.state.stats.lastAttributeCandidates = value;
+    }
     /**
      * Test/observability hook: how many checkpoint rows the LAST checkpoint read materialized (the rows
      * actually returned to the caller). `listCheckpoints` returns all rows for the run; the targeted
      * {@link getLatestCheckpointByName} / {@link listCheckpointsByNamePrefix} return only the matches —
      * so this lets the benchmark contrast "fetch N, scan in JS" against "fetch the k that match".
      */
-    lastCheckpointRowsRead = 0;
+    get lastCheckpointRowsRead() {
+        return this.state.stats.lastCheckpointRowsRead;
+    }
+    set lastCheckpointRowsRead(value) {
+        this.state.stats.lastCheckpointRowsRead = value;
+    }
+    /**
+     * Test/observability hook: checkpoint rows materialized since construction, across every
+     * checkpoint read that returns rows — what a run-detail test compares between paths.
+     */
+    get checkpointRowsRead() {
+        return this.state.stats.checkpointRowsRead;
+    }
+    set checkpointRowsRead(value) {
+        this.state.stats.checkpointRowsRead = value;
+    }
+    /** The namespace run reads are fenced to (see {@link withScope}); undefined sees every run. */
+    scopeNamespace;
+    /**
+     * A view of THIS store (same data) whose run reads — `getRun`, `listRuns`, the counts and the
+     * recovery/dispatch/timer scans — only see `scope.namespace`. Writes stay unscoped. Mirrors
+     * `LucidStateStore.withScope`; `{ namespace: undefined }` is the operator view.
+     */
+    withScope(scope) {
+        // A plain store holding the SAME state object by reference (not an `Object.create(this)` child,
+        // whose own-property writes — a counter bump — would shadow the base's, and which would break on
+        // any `#private` field). Overrides of a subclass are not carried over to the view.
+        const view = new InMemoryStateStore();
+        view.state = this.state;
+        view.scopeNamespace = scope.namespace;
+        return view;
+    }
+    inScope(run) {
+        return (this.scopeNamespace === undefined || namespaceMatches(run.namespace, this.scopeNamespace));
+    }
+    visibleRuns() {
+        const runs = [...this.runs.values()];
+        return this.scopeNamespace === undefined ? runs : runs.filter((r) => this.inScope(r));
+    }
     key(runId, seq) {
         return `${runId}:${seq}`;
     }
@@ -50,14 +120,18 @@ export class InMemoryStateStore {
         // Normalize an undefined namespace to 'default', matching the SQL stores' column DEFAULT 'default'
         // — so a run created directly against this store (bypassing the engine, e.g. in tests) is still
         // reachable via a namespace='default' filter and partitions consistently.
-        this.runs.set(run.id, { ...run, namespace: run.namespace ?? 'default' });
+        this.runs.set(run.id, { ...run, namespace: normalizeNamespace(run.namespace) });
         this.reindexAttributes(run.id, run.searchAttributes);
     }
     async updateRun(runId, patch) {
         const existing = this.runs.get(runId);
         if (!existing)
             throw new Error(`run ${runId} not found`);
-        const next = { ...existing, ...patch };
+        const next = withNormalizedNamespace({
+            ...existing,
+            ...patch,
+            ...releasedSlot(existing, patch),
+        });
         this.runs.set(runId, next);
         if ('searchAttributes' in patch)
             this.reindexAttributes(runId, next.searchAttributes);
@@ -68,15 +142,33 @@ export class InMemoryStateStore {
         const existing = this.runs.get(runId);
         if (!existing || !expectedStatuses.includes(existing.status))
             return false;
-        const next = { ...existing, ...patch };
+        const next = withNormalizedNamespace({
+            ...existing,
+            ...patch,
+            ...releasedSlot(existing, patch),
+        });
         this.runs.set(runId, next);
         if ('searchAttributes' in patch)
             this.reindexAttributes(runId, next.searchAttributes);
         return true;
     }
+    async tryAdmitSingleton(runId, tag, workflow, limit, retryWakeAt) {
+        // No `await` between the snapshot and the claim: this synchronous turn is the critical section.
+        const runs = [...this.runs.values()];
+        const tags = singletonAdmissionTags(runs, runId, tag, workflow, limit);
+        const run = this.runs.get(runId);
+        if (!tags || !run) {
+            const parked = singletonAdmissionDenialPatch(runs, runId, tag, workflow, retryWakeAt);
+            if (parked && run)
+                this.runs.set(runId, { ...run, ...parked });
+            return false;
+        }
+        this.runs.set(runId, { ...run, tags });
+        return true;
+    }
     async getRun(runId) {
         const run = this.runs.get(runId);
-        return run ? { ...run } : null;
+        return run && this.inScope(run) ? copyRun(run) : null;
     }
     async deleteRun(runId) {
         this.runs.delete(runId);
@@ -91,6 +183,10 @@ export class InMemoryStateStore {
         // Drop the run's normalized attribute rows (reindex with no attributes clears them).
         this.reindexAttributes(runId, undefined);
     }
+    async deleteRuns(runIds) {
+        for (const runId of runIds)
+            await this.deleteRun(runId);
+    }
     async getCheckpoint(runId, seq) {
         const cp = this.checkpoints.get(this.key(runId, seq));
         return cp ? { ...cp } : null;
@@ -105,6 +201,15 @@ export class InMemoryStateStore {
         this.checkpoints.set(key, { ...checkpoint });
         return true;
     }
+    async saveCheckpointsIfPending(checkpoints) {
+        return checkpoints.map((checkpoint) => {
+            const key = this.key(checkpoint.runId, checkpoint.seq);
+            if (this.checkpoints.get(key)?.status !== 'pending')
+                return false;
+            this.checkpoints.set(key, { ...checkpoint });
+            return true;
+        });
+    }
     /** Mirror of `LucidStateStore.recordStepHeartbeat`: mutate in place, no-op when absent. */
     async recordStepHeartbeat(runId, seq, at, progress) {
         const cp = this.checkpoints.get(this.key(runId, seq));
@@ -114,34 +219,38 @@ export class InMemoryStateStore {
         cp.heartbeatProgress = progress;
     }
     async listIncompleteRuns(namespace) {
-        return [...this.runs.values()]
-            .filter((r) => r.status === 'running' && (namespace === undefined || r.namespace === namespace))
-            .map((r) => ({ ...r }));
+        return this.visibleRuns()
+            .filter((r) => r.status === 'running' &&
+            (namespace === undefined || namespaceMatches(r.namespace, namespace)))
+            .map(copyRun);
     }
     async listPendingRuns(limit, namespace) {
-        return [...this.runs.values()]
-            .filter((r) => r.status === 'pending' && (namespace === undefined || r.namespace === namespace))
+        return this.visibleRuns()
+            .filter((r) => r.status === 'pending' &&
+            (namespace === undefined || namespaceMatches(r.namespace, namespace)))
             .sort((a, b) => a.createdAt.getTime() - b.createdAt.getTime() || a.id.localeCompare(b.id))
             .slice(0, limit)
-            .map((r) => ({ ...r }));
+            .map(copyRun);
     }
     async listDueTimers(nowMs, namespace, limit) {
-        const due = [...this.runs.values()].filter((r) => r.status === 'suspended' &&
+        const due = this.visibleRuns().filter((r) => r.status === 'suspended' &&
             r.wakeAt !== undefined &&
             r.wakeAt <= nowMs &&
-            (namespace === undefined || r.namespace === namespace));
+            (namespace === undefined || namespaceMatches(r.namespace, namespace)));
         // Most overdue first (mirrors the SQL stores' ORDER BY wake_at).
         due.sort((a, b) => (a.wakeAt ?? 0) - (b.wakeAt ?? 0));
-        return (limit === undefined ? due : due.slice(0, limit)).map((r) => ({ ...r }));
+        return (limit === undefined ? due : due.slice(0, limit)).map(copyRun);
     }
-    async listOrphanedRuns(nowMs, limit, namespace) {
-        return [...this.runs.values()]
+    async listOrphanedRuns(nowMs, limit, namespace, owner) {
+        return this.visibleRuns()
             .filter((r) => r.status === 'running' &&
-            (r.lockedUntil === undefined || r.lockedUntil <= nowMs) &&
-            (namespace === undefined || r.namespace === namespace))
+            (r.lockedUntil === undefined ||
+                r.lockedUntil <= nowMs ||
+                (owner !== undefined && r.lockedBy === owner)) &&
+            (namespace === undefined || namespaceMatches(r.namespace, namespace)))
             .sort((a, b) => a.createdAt.getTime() - b.createdAt.getTime())
             .slice(0, limit)
-            .map((r) => ({ ...r }));
+            .map(copyRun);
     }
     async tryLockRun(runId, owner, leaseUntilMs, nowMs) {
         const run = this.runs.get(runId);
@@ -224,12 +333,24 @@ export class InMemoryStateStore {
     async transaction(work) {
         return work({ raw: this, saveCheckpoint: (cp) => this.saveCheckpoint(cp) });
     }
-    bufferedSignals = new Map();
+    get bufferedSignals() {
+        return this.state.bufferedSignals;
+    }
     async bufferSignal(token, payload) {
         const queue = this.bufferedSignals.get(token) ?? [];
         queue.push(payload);
         this.bufferedSignals.set(token, queue);
     }
+    async listBufferedSignalTokens(prefix, limit) {
+        const out = [];
+        for (const [token, queue] of this.bufferedSignals) {
+            if (out.length >= limit)
+                break;
+            if (token.startsWith(prefix) && queue.length > 0)
+                out.push(token);
+        }
+        return out;
+    }
     async takeBufferedSignal(token) {
         const queue = this.bufferedSignals.get(token);
         if (!queue || queue.length === 0)
@@ -241,7 +362,9 @@ export class InMemoryStateStore {
     }
     /** `id -> row`, so {@link removeBufferedEvent} can delete an exact row regardless of iteration
      *  order — mirrors the SQL store's PK-by-id delete. */
-    bufferedEvents = new Map();
+    get bufferedEvents() {
+        return this.state.bufferedEvents;
+    }
     async bufferEvent(input) {
         this.bufferedEvents.set(input.id, {
             name: input.name,
@@ -259,6 +382,15 @@ export class InMemoryStateStore {
     async removeBufferedEvent(id) {
         return this.bufferedEvents.delete(id);
     }
+    async pruneBufferedEvents(publishedBefore, limit) {
+        const expired = [...this.bufferedEvents.entries()]
+            .filter(([, e]) => e.publishedAt < publishedBefore)
+            .sort((a, b) => a[1].publishedAt - b[1].publishedAt)
+            .slice(0, Math.max(0, limit));
+        for (const [id] of expired)
+            this.bufferedEvents.delete(id);
+        return expired.length;
+    }
     /**
      * Candidate run ids satisfying ONE attribute predicate, served from {@link attributeIndex} — the
      * pushdown step. Numeric predicates scan only `numValue` rows under the key; string/boolean ones
@@ -318,9 +450,18 @@ export class InMemoryStateStore {
     async countRuns(query) {
         return (await this.listRuns(query)).length;
     }
-    schedules = new Map();
+    async runFacets(query) {
+        const runs = await this.listRuns(query);
+        return mergeRunFacetRows(runs.map((r) => ({ status: r.status, origin: r.origin, count: 1 })));
+    }
+    get schedules() {
+        return this.state.schedules;
+    }
     async saveSchedule(record) {
-        this.schedules.set(record.id, structuredClone(record));
+        this.schedules.set(record.id, {
+            ...structuredClone(record),
+            namespace: normalizeNamespace(record.namespace),
+        });
     }
     async getSchedule(id) {
         const record = this.schedules.get(id);
@@ -332,7 +473,8 @@ export class InMemoryStateStore {
             return false;
         if (expectedNextFireAt !== undefined && record.nextFireAt !== expectedNextFireAt)
             return false;
-        this.schedules.set(id, { ...record, ...structuredClone(patch) });
+        const next = { ...record, ...structuredClone(patch) };
+        this.schedules.set(id, { ...next, namespace: normalizeNamespace(next.namespace) });
         return true;
     }
     async deleteSchedule(id) {
@@ -340,7 +482,7 @@ export class InMemoryStateStore {
     }
     async listSchedules(query) {
         const rows = [...this.schedules.values()]
-            .filter((s) => query.namespace === undefined || s.namespace === query.namespace)
+            .filter((s) => query.namespace === undefined || namespaceMatches(s.namespace, query.namespace))
             .filter((s) => query.workflow === undefined || s.workflow === query.workflow)
             .filter((s) => query.tag === undefined || (s.tags ?? []).includes(query.tag))
             .filter((s) => query.paused === undefined || s.paused === query.paused)
@@ -354,7 +496,7 @@ export class InMemoryStateStore {
             .map((s) => structuredClone(s));
     }
     async listRuns(query) {
-        let runs = [...this.runs.values()];
+        let runs = this.visibleRuns();
         if (query.workflow)
             runs = runs.filter((r) => r.workflow === query.workflow);
         if (query.workflows) {
@@ -363,13 +505,15 @@ export class InMemoryStateStore {
                     ? []
                     : runs.filter((r) => query.workflows?.includes(r.workflow));
         }
-        if (query.namespace !== undefined)
-            runs = runs.filter((r) => r.namespace === query.namespace);
+        if (query.namespace !== undefined) {
+            const namespace = query.namespace;
+            runs = runs.filter((r) => namespaceMatches(r.namespace, namespace));
+        }
         if (query.namespaces) {
             runs =
                 query.namespaces.length === 0
                     ? []
-                    : runs.filter((r) => r.namespace !== undefined && query.namespaces?.includes(r.namespace));
+                    : runs.filter((r) => query.namespaces?.some((ns) => namespaceMatches(r.namespace, ns)) ?? false);
         }
         if (query.origin)
             runs = runs.filter((r) => r.origin === query.origin);
@@ -425,9 +569,7 @@ export class InMemoryStateStore {
         runs.sort((a, b) => b.createdAt.getTime() - a.createdAt.getTime());
         // 1-based `page`/`size` in, 0-based slice out — same resolution the SQL adapters apply.
         const { limit, offset } = runPageWindow(query);
-        return runs
-            .slice(offset, limit === undefined ? undefined : offset + limit)
-            .map((r) => ({ ...r }));
+        return runs.slice(offset, limit === undefined ? undefined : offset + limit).map(copyRun);
     }
     /**
      * The distinct values of ONE filter axis over the runs matching `query`, with counts — what a
@@ -444,8 +586,21 @@ export class InMemoryStateStore {
             .sort((a, b) => a.seq - b.seq)
             .map((cp) => ({ ...cp }));
         this.lastCheckpointRowsRead = rows.length;
+        this.checkpointRowsRead += rows.length;
+        return rows;
+    }
+    async checkpointStats(runId, opts) {
+        return checkpointStatsOf(this.runCheckpoints(runId), opts);
+    }
+    async queryCheckpoints(runId, query) {
+        const rows = queryCheckpointsOf(this.runCheckpoints(runId), query).map((cp) => ({ ...cp }));
+        this.lastCheckpointRowsRead = rows.length;
+        this.checkpointRowsRead += rows.length;
         return rows;
     }
+    runCheckpoints(runId) {
+        return [...this.checkpoints.values()].filter((cp) => cp.runId === runId);
+    }
     async getLatestCheckpointByName(runId, name) {
         let latest;
         for (const cp of this.checkpoints.values()) {
@@ -474,7 +629,15 @@ export class InMemoryStateStore {
             .sort((a, b) => a.seq - b.seq)
             .map((cp) => ({ ...cp }));
         this.lastCheckpointRowsRead = rows.length;
+        this.checkpointRowsRead += rows.length;
         return rows;
     }
 }
+/** A terminal settle releases the run's singleton slot: drop the admission marker from its tags. */
+function releasedSlot(existing, patch) {
+    if (!settlesTerminally(patch))
+        return undefined;
+    const tags = withoutAdmission('tags' in patch ? patch.tags : existing.tags);
+    return tags ? { tags } : undefined;
+}
 //# sourceMappingURL=in-memory-state-store.js.map