@demlik/tea 0.5.1 → 0.7.0

package/dist/{core-JPHsMZVB.d.ts → core-Bjc0bS8j.d.ts}

@@ -20,10 +20,37 @@ declare function applyCell<S, M extends {
     update: object;
     __form?: UpdateForm;
 }, state: S, msg: M): readonly [S, readonly C[]];
+declare function applyCellChecked<S, M extends {
+    type: string;
+}, C extends Cmd>(machine: {
+    update: object;
+    __form?: UpdateForm;
+}, state: S, msg: M): readonly [S, readonly C[]];
 declare function msgKeysOf(machine: {
     update: object;
     __form?: UpdateForm;
 }): readonly string[];
+type MachineShape = {
+    readonly form: "reducer";
+    /** Every `Msg.type` the flat reducer has a cell for. */
+    readonly msgs: readonly string[];
+} | {
+    readonly form: "transitions";
+    /** The union of every row's `Msg.type` keys (see `msgKeysOf`). */
+    readonly msgs: readonly string[];
+    /** Every `state.type` the table has a row for, in table order. */
+    readonly states: readonly string[];
+    /** `state.type` → the `Msg.type`s that state has a cell for. */
+    readonly accepts: Readonly<Record<string, readonly string[]>>;
+};
+declare function describeMachine(machine: {
+    update: object;
+    __form?: UpdateForm;
+}): MachineShape;
+declare function acceptsOf(machine: {
+    update: object;
+    __form?: UpdateForm;
+}, stateType: string): readonly string[];
 type Reducer<S, M extends {
     type: string;
 }, C extends Cmd> = {
@@ -283,8 +310,17 @@ type Machine<S, M extends {
     subscriptions: (state: S) => readonly U[];
     subscribe: Subscribe<M, U, Ctx>;
 });
+declare function foldUpdates<S, M extends {
+    type: string;
+}, C extends Cmd>(machine: {
+    update: object;
+    __form?: UpdateForm;
+}, initialState: S, msgs: readonly M[]): {
+    state: S;
+    cmds: C[];
+};
 declare function foldMsgs<S, M extends {
     type: string;
 }, C extends Cmd, U extends Sub, Ctx>(machine: Machine<S, M, C, U, Ctx>, base: S, msgs: readonly M[]): S;
 
-export { Cmd as C, type DepKeyedSub as D, type Interpret as I, type Machine as M, NoCellError as N, type PortEmitter as P, type Reducer as R, type Sub as S, type Transitions as T, type UpdateForm as U, type Port as a, type SubId as b, type InterpretDetached as c, type ContextFree as d, type Dispose as e, type Identity as f, type NoCtx as g, type Subscribe as h, type SyncReturn as i, applyCell as j, detectUpdateForm as k, foldMsgs as l, formOf as m, msgKeysOf as n, subId as o, structuralHash as s };
+export { Cmd as C, type DepKeyedSub as D, type Interpret as I, type Machine as M, NoCellError as N, type PortEmitter as P, type Reducer as R, type Sub as S, type Transitions as T, type UpdateForm as U, type Port as a, type SubId as b, type InterpretDetached as c, type ContextFree as d, type Dispose as e, type Identity as f, type MachineShape as g, type NoCtx as h, type Subscribe as i, type SyncReturn as j, acceptsOf as k, applyCell as l, applyCellChecked as m, describeMachine as n, detectUpdateForm as o, foldMsgs as p, foldUpdates as q, formOf as r, msgKeysOf as s, structuralHash as t, subId as u };

package/dist/deadline/index.d.ts

@@ -1,5 +1,5 @@
-import { S as Sub, b as SubId } from '../core-JPHsMZVB.js';
-import { S as SubscribeHandler } from '../types-BMZ7IMrd.js';
+import { S as Sub, b as SubId } from '../core-Bjc0bS8j.js';
+import { S as SubscribeHandler } from '../types-D7u9DkH7.js';
 
 /**
  * @demlik/tea/deadline — a one-shot Sub that fires when an ABSOLUTE wall-clock

package/dist/deadline/index.js

@@ -1,6 +1,6 @@
-export { deadlineExceeded, deadlineSub, setTimeoutArmTimer, subscribeDeadline, subscribeWith } from '../chunk-ASX7PL2K.js';
+export { deadlineExceeded, deadlineSub, setTimeoutArmTimer, subscribeDeadline, subscribeWith } from '../chunk-JGVL3WPL.js';
 import '../chunk-2YFLOCWX.js';
-import '../chunk-ZH454CR5.js';
-import '../chunk-O7ED34JH.js';
+import '../chunk-5EHLEUTL.js';
+import '../chunk-B5VXOFMZ.js';
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map

package/dist/do/index.d.ts

@@ -1,13 +1,14 @@
-import { S as Store, R as Runtime, B as BootingRuntime } from '../runtime-types-BbBq4LWo.js';
-import { P as PendingEffectsRecorder, b as EffectOwed, a as EffectConfirmed } from '../durable-effects-MRnCBCxV.js';
-export { D as DeliveryId, E as EffectLedgerEvent, O as OwedEffect, c as PendingEffectsLedger, d as applyEffectEvent, e as emptyLedger, f as foldLedger, i as isOwed, p as pendingEffectsLedger, s as survivingEffects } from '../durable-effects-MRnCBCxV.js';
+import { S as Store, R as Runtime, B as BootingRuntime } from '../runtime-types-Bxc637bp.js';
+import { P as PendingEffectsRecorder, b as EffectOwed, a as EffectConfirmed } from '../durable-effects-D8SqU_if.js';
+export { D as DeliveryId, E as EffectLedgerEvent, O as OwedEffect, c as PendingEffectsLedger, d as applyEffectEvent, e as emptyLedger, f as foldLedger, i as isOwed, p as pendingEffectsLedger, s as survivingEffects } from '../durable-effects-D8SqU_if.js';
 import { RetryPolicy, Rng } from '../retry-backoff/index.js';
-import { C as Cmd, S as Sub, M as Machine } from '../core-JPHsMZVB.js';
-import { k as AgentEvent, A as AgentTurn, s as AgentState, p as AgentMachineMsg, t as AgentStatus } from '../machine-nGXCMyHn.js';
+import { C as Cmd, S as Sub, M as Machine } from '../core-Bjc0bS8j.js';
+import { k as AgentEvent, A as AgentTurn, s as AgentState, p as AgentMachineMsg, t as AgentStatus } from '../machine-0OmPvsy_.js';
+import 'better-result';
 import '../llm-call/index.js';
 import '../resilient-call/index.js';
 import '../cache/index.js';
-import '../types-BMZ7IMrd.js';
+import '../types-D7u9DkH7.js';
 import '../circuit-breaker/index.js';
 import '../deadline/index.js';
 import '../protocol-B5YmJr0d.js';

package/dist/do/index.js

@@ -1,27 +1,27 @@
-import { status, agentBootMsg, agentEvents } from '../chunk-UV7VCTNC.js';
+import { status, agentBootMsg, agentEvents } from '../chunk-ZF6WDK2D.js';
 export { applyEffectEvent, emptyLedger, foldLedger, isOwed, pendingEffectsLedger, survivingEffects } from '../chunk-25LBDCBC.js';
-import '../chunk-66S2KEQQ.js';
-import '../chunk-ERYY5P6W.js';
-import '../chunk-XMHZ44QC.js';
-import '../chunk-EC6FO42Q.js';
+import '../chunk-WLGO64WC.js';
+import '../chunk-ND3DH6KM.js';
+import '../chunk-7V4EVLZA.js';
+import '../chunk-EUF7XOEE.js';
 import '../chunk-JELSZN25.js';
 import '../chunk-D736QUGF.js';
 import { createIntake } from '../chunk-ZVJZ72HY.js';
-import '../chunk-ASX7PL2K.js';
+import '../chunk-JGVL3WPL.js';
 import { defaultRetryPolicy, initRetry, recordFailure, shouldRetry, nextDelayMs } from '../chunk-Q2UM7BXU.js';
 import '../chunk-S2EGRPCM.js';
 import '../chunk-BYQUGDD3.js';
 import '../chunk-K575PT4S.js';
 import '../chunk-UF4MZSLT.js';
-import '../chunk-WF46FABO.js';
+import '../chunk-7SVIRMC6.js';
 import '../chunk-MU6MCIAC.js';
 import '../chunk-FV3Z5MBE.js';
-import '../chunk-2UGTDYOK.js';
+import '../chunk-3JU6657S.js';
 import '../chunk-2YFLOCWX.js';
 import '../chunk-ZJ5AOYBH.js';
 import '../chunk-G5E74IJB.js';
-import { replay, run } from '../chunk-ZH454CR5.js';
-import '../chunk-O7ED34JH.js';
+import { replay, run } from '../chunk-5EHLEUTL.js';
+import '../chunk-B5VXOFMZ.js';
 
 // src/do/durable-timer.ts
 function durableTimer(config) {

package/dist/{durable-effects-MRnCBCxV.d.ts → durable-effects-D8SqU_if.d.ts}

@@ -1,4 +1,4 @@
-import { C as Cmd } from './core-JPHsMZVB.js';
+import { C as Cmd } from './core-Bjc0bS8j.js';
 
 /**
  * @demlik/tea/do — the durable pending-effects ledger (substrate primitive #1).

package/dist/extension/index.d.ts

@@ -1,5 +1,6 @@
-import { R as Runtime, S as Store } from '../runtime-types-BbBq4LWo.js';
-import '../core-JPHsMZVB.js';
+import { R as Runtime, S as Store } from '../runtime-types-Bxc637bp.js';
+import 'better-result';
+import '../core-Bjc0bS8j.js';
 
 /**
  * Runtime bridge — expose a `@demlik/tea` runtime running in one chrome context

package/dist/extension/index.js

@@ -1,7 +1,7 @@
-export { bridgeClient, bridgeRuntime, bridgeTabClient, passThroughMsg } from '../chunk-IVHQCVFX.js';
+export { bridgeClient, bridgeRuntime, bridgeTabClient, passThroughMsg } from '../chunk-A56OR5RF.js';
 import '../chunk-G5E74IJB.js';
-import '../chunk-ZH454CR5.js';
-import '../chunk-O7ED34JH.js';
+import '../chunk-5EHLEUTL.js';
+import '../chunk-B5VXOFMZ.js';
 
 // src/extension/index.ts
 var MALFORMED = "chromeStorageStore: stored value is not a string";

package/dist/extension/react.js

@@ -1,7 +1,7 @@
-import { bridgeClient, passThroughMsg } from '../chunk-IVHQCVFX.js';
+import { bridgeClient, passThroughMsg } from '../chunk-A56OR5RF.js';
 import '../chunk-G5E74IJB.js';
-import '../chunk-ZH454CR5.js';
-import '../chunk-O7ED34JH.js';
+import '../chunk-5EHLEUTL.js';
+import '../chunk-B5VXOFMZ.js';
 import { useRef, useSyncExternalStore, useEffect, useCallback, createContext, useMemo, useContext } from 'react';
 import { jsx } from 'react/jsx-runtime';
 

package/dist/extension/subs/index.d.ts

@@ -1,5 +1,5 @@
-import { S as Sub } from '../../core-JPHsMZVB.js';
-import { S as SubscribeHandler } from '../../types-BMZ7IMrd.js';
+import { S as Sub } from '../../core-Bjc0bS8j.js';
+import { S as SubscribeHandler } from '../../types-D7u9DkH7.js';
 
 type AlarmSubData = {
     alarmName: string;

package/dist/fan-out/index.d.ts

@@ -1,6 +1,7 @@
-import { C as Cmd, a as Port } from '../core-JPHsMZVB.js';
+import { C as Cmd, a as Port } from '../core-Bjc0bS8j.js';
 import { QueueItem } from '../work-queue/index.js';
-import '../runtime-types-BbBq4LWo.js';
+import '../runtime-types-Bxc637bp.js';
+import 'better-result';
 
 /**
  * @demlik/tea/fan-out — scatter-gather over a bounded-concurrency work list.

package/dist/idempotent-intake/index.d.ts

@@ -1,7 +1,8 @@
 import { IdempotencyStore } from '../idempotency/index.js';
-import { C as Cmd } from '../core-JPHsMZVB.js';
+import { C as Cmd } from '../core-Bjc0bS8j.js';
 import { QueueItem } from '../work-queue/index.js';
-import '../runtime-types-BbBq4LWo.js';
+import '../runtime-types-Bxc637bp.js';
+import 'better-result';
 
 /**
  * @demlik/tea/idempotent-intake — receive-once intake for webhooks / queue

package/dist/index.d.ts

@@ -1,7 +1,8 @@
-import { B as BootingRuntime, C as CtxArg, S as Store, O as OnError, a as Supervision } from './runtime-types-BbBq4LWo.js';
-export { b as Branded, D as DispatchDiscardedError, c as DispatchSettle, d as DisposeTimeoutNotice, I as IdentityDropNotice, P as PortNameCollisionError, Q as QuiescenceTimeoutError, R as Runtime, e as RuntimeDiscardNotice, f as RuntimeDiscardedError, g as RuntimeErrorContext, h as RuntimeErrorPhase, i as RuntimeRef, j as Schema, k as SubIdCollisionError, l as SupervisionStrategy, _ as __resetPortRegistry, m as absurd, n as asReducer, o as defineMachine, p as definePort, q as noop, r as replay, s as schemaMigrate, t as tryInterpret, w as wrapDetached } from './runtime-types-BbBq4LWo.js';
-import { C as Cmd, S as Sub, M as Machine } from './core-JPHsMZVB.js';
-export { d as ContextFree, D as DepKeyedSub, e as Dispose, f as Identity, I as Interpret, c as InterpretDetached, N as NoCellError, g as NoCtx, a as Port, P as PortEmitter, R as Reducer, b as SubId, h as Subscribe, i as SyncReturn, T as Transitions, U as UpdateForm, j as applyCell, k as detectUpdateForm, l as foldMsgs, m as formOf, n as msgKeysOf, s as structuralHash, o as subId } from './core-JPHsMZVB.js';
+import { B as BootingRuntime, C as CtxArg, S as Store, O as OnError, a as Supervision } from './runtime-types-Bxc637bp.js';
+export { b as Branded, D as DispatchDiscardedError, c as DispatchSettle, d as DisposeTimeoutNotice, F as FoldRefusal, I as IdentityDropNotice, P as PortNameCollisionError, Q as QuiescenceTimeoutError, R as Runtime, e as RuntimeDiscardNotice, f as RuntimeDiscardedError, g as RuntimeErrorContext, h as RuntimeErrorPhase, i as RuntimeRef, j as Schema, k as SubIdCollisionError, l as SupervisionStrategy, _ as __resetPortRegistry, m as absurd, n as asReducer, o as defineMachine, p as definePort, q as noop, r as replay, s as schemaMigrate, t as tryApplyCell, u as tryFoldMsgs, v as tryInterpret, w as wrapDetached } from './runtime-types-Bxc637bp.js';
+import { C as Cmd, S as Sub, M as Machine } from './core-Bjc0bS8j.js';
+export { d as ContextFree, D as DepKeyedSub, e as Dispose, f as Identity, I as Interpret, c as InterpretDetached, g as MachineShape, N as NoCellError, h as NoCtx, a as Port, P as PortEmitter, R as Reducer, b as SubId, i as Subscribe, j as SyncReturn, T as Transitions, U as UpdateForm, k as acceptsOf, l as applyCell, m as applyCellChecked, n as describeMachine, o as detectUpdateForm, p as foldMsgs, q as foldUpdates, r as formOf, s as msgKeysOf, t as structuralHash, u as subId } from './core-Bjc0bS8j.js';
+import 'better-result';
 
 interface HistoryTracker<S, M extends {
     type: string;

package/dist/index.js

@@ -1,4 +1,4 @@
-export { DispatchDiscardedError, DisposeTimeoutNotice, IdentityDropNotice, PortNameCollisionError, QuiescenceTimeoutError, RuntimeDiscardNotice, RuntimeDiscardedError, SubIdCollisionError, __resetPortRegistry, absurd, asReducer, defineMachine, definePort, historyTracker, noop, replay, run, schemaMigrate, tryInterpret, wrapDetached } from './chunk-ZH454CR5.js';
-export { Cmd, NoCellError, applyCell, detectUpdateForm, foldMsgs, formOf, msgKeysOf, structuralHash, subId } from './chunk-O7ED34JH.js';
+export { DispatchDiscardedError, DisposeTimeoutNotice, IdentityDropNotice, PortNameCollisionError, QuiescenceTimeoutError, RuntimeDiscardNotice, RuntimeDiscardedError, SubIdCollisionError, __resetPortRegistry, absurd, asReducer, defineMachine, definePort, historyTracker, noop, replay, run, schemaMigrate, tryApplyCell, tryFoldMsgs, tryInterpret, wrapDetached } from './chunk-5EHLEUTL.js';
+export { Cmd, NoCellError, acceptsOf, applyCell, applyCellChecked, describeMachine, detectUpdateForm, foldMsgs, foldUpdates, formOf, msgKeysOf, structuralHash, subId } from './chunk-B5VXOFMZ.js';
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map

package/dist/llm-call/index.d.ts

@@ -1,10 +1,10 @@
-import { C as Cmd } from '../core-JPHsMZVB.js';
+import { C as Cmd } from '../core-Bjc0bS8j.js';
 import { RunCmd, SucceedMsg, FailMsg, ResilientState } from '../resilient-call/index.js';
 import { RetryPolicy } from '../retry-backoff/index.js';
 import { DeadlineExceeded, DeadlineSub } from '../deadline/index.js';
 export { deadlineSub, subscribeDeadline } from '../deadline/index.js';
 import '../cache/index.js';
-import '../types-BMZ7IMrd.js';
+import '../types-D7u9DkH7.js';
 import '../circuit-breaker/index.js';
 import '../protocol-B5YmJr0d.js';
 import '../rate-limit/index.js';

package/dist/llm-call/index.js

@@ -1,16 +1,16 @@
-export { createLlmCall, liftLlmCall } from '../chunk-ERYY5P6W.js';
-import '../chunk-EC6FO42Q.js';
+export { createLlmCall, liftLlmCall } from '../chunk-ND3DH6KM.js';
+import '../chunk-EUF7XOEE.js';
 import '../chunk-JELSZN25.js';
-export { deadlineSub, subscribeDeadline } from '../chunk-ASX7PL2K.js';
+export { deadlineSub, subscribeDeadline } from '../chunk-JGVL3WPL.js';
 import '../chunk-Q2UM7BXU.js';
 import '../chunk-S2EGRPCM.js';
 import '../chunk-UF4MZSLT.js';
-import '../chunk-WF46FABO.js';
-import '../chunk-2UGTDYOK.js';
+import '../chunk-7SVIRMC6.js';
+import '../chunk-3JU6657S.js';
 import '../chunk-2YFLOCWX.js';
 import '../chunk-ZJ5AOYBH.js';
 import '../chunk-G5E74IJB.js';
-import '../chunk-ZH454CR5.js';
-import '../chunk-O7ED34JH.js';
+import '../chunk-5EHLEUTL.js';
+import '../chunk-B5VXOFMZ.js';
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map

package/dist/{machine-nGXCMyHn.d.ts → machine-0OmPvsy_.d.ts}

@@ -1,4 +1,4 @@
-import { C as Cmd, I as Interpret, M as Machine } from './core-JPHsMZVB.js';
+import { C as Cmd, I as Interpret, M as Machine } from './core-Bjc0bS8j.js';
 import { ModelFactory, Schema, MessageLoader, LlmCall, LlmOk, LlmErr, LlmRunCmd, LlmSucceedMsg, LlmFailMsg, LlmTimerMsg, LlmCallPorts } from './llm-call/index.js';
 import { MonitoredRunState, RunFailure, MonitoredRunCmd } from './monitored-run/index.js';
 import { M as MsgType } from './protocol-B5YmJr0d.js';

package/dist/machine-viz/index.d.ts

@@ -1,4 +1,4 @@
-import { C as Cmd, S as Sub, M as Machine } from '../core-JPHsMZVB.js';
+import { C as Cmd, S as Sub, M as Machine } from '../core-Bjc0bS8j.js';
 
 /**
  * @demlik/tea/machine-viz — turn a `Machine` into a Mermaid diagram string.

package/dist/machine-viz/index.js

@@ -1,5 +1,5 @@
-import '../chunk-ZH454CR5.js';
-import { formOf } from '../chunk-O7ED34JH.js';
+import '../chunk-5EHLEUTL.js';
+import { formOf } from '../chunk-B5VXOFMZ.js';
 
 // src/machine-viz/index.ts
 function safeId(raw) {

package/dist/mem/index.d.ts

@@ -1,5 +1,6 @@
-import { S as Store } from '../runtime-types-BbBq4LWo.js';
-import '../core-JPHsMZVB.js';
+import { S as Store } from '../runtime-types-Bxc637bp.js';
+import 'better-result';
+import '../core-Bjc0bS8j.js';
 
 /**
  * @packageDocumentation

package/dist/monitored-run/index.d.ts

@@ -1,10 +1,11 @@
 import { DeadlineExceeded, DeadlineSub } from '../deadline/index.js';
 export { deadlineSub, subscribeDeadline } from '../deadline/index.js';
-import { I as Interpret, C as Cmd } from '../core-JPHsMZVB.js';
+import { I as Interpret, C as Cmd } from '../core-Bjc0bS8j.js';
 import { SnapshotWriteCmd, SnapshotState, SnapshotStore, SnapshotSavedMsg, SnapshotFailedMsg, SnapshotLoadedMsg, SnapshotLoadFailedMsg, SnapshotLoadCmd } from '../snapshot/index.js';
 import { QueueItem } from '../work-queue/index.js';
-import '../types-BMZ7IMrd.js';
-import '../runtime-types-BbBq4LWo.js';
+import '../types-D7u9DkH7.js';
+import '../runtime-types-Bxc637bp.js';
+import 'better-result';
 
 /**
  * @demlik/tea/monitored-run — a long-running operation that is BOTH staged and

package/dist/monitored-run/index.js

@@ -1,10 +1,10 @@
-export { createMonitoredRun, liftRun } from '../chunk-66S2KEQQ.js';
-import '../chunk-XMHZ44QC.js';
-export { deadlineSub, subscribeDeadline } from '../chunk-ASX7PL2K.js';
+export { createMonitoredRun, liftRun } from '../chunk-WLGO64WC.js';
+import '../chunk-7V4EVLZA.js';
+export { deadlineSub, subscribeDeadline } from '../chunk-JGVL3WPL.js';
 import '../chunk-MU6MCIAC.js';
 import '../chunk-FV3Z5MBE.js';
 import '../chunk-2YFLOCWX.js';
-import '../chunk-ZH454CR5.js';
-import '../chunk-O7ED34JH.js';
+import '../chunk-5EHLEUTL.js';
+import '../chunk-B5VXOFMZ.js';
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map

package/dist/node/index.d.ts

@@ -1,6 +1,7 @@
 import WebSocket from 'ws';
-import { S as Store } from '../runtime-types-BbBq4LWo.js';
-import { S as Sub, b as SubId } from '../core-JPHsMZVB.js';
+import { S as Store } from '../runtime-types-Bxc637bp.js';
+import { S as Sub, b as SubId } from '../core-Bjc0bS8j.js';
+import 'better-result';
 
 /**
  * @packageDocumentation

package/dist/paginated-walk/index.d.ts

@@ -1,11 +1,11 @@
-import { C as Cmd } from '../core-JPHsMZVB.js';
+import { C as Cmd } from '../core-Bjc0bS8j.js';
 import { PaginatorState } from '../paginator/index.js';
 import { RunCmd, FailMsg, SucceedMsg, CircuitConfig, RateLimitConfig, DeadlineConfig, ResilientPorts, ResilientState, ResilientTimerMsg } from '../resilient-call/index.js';
 import { RetryPolicy } from '../retry-backoff/index.js';
 import { DeadlineSub } from '../deadline/index.js';
 export { deadlineSub, subscribeDeadline } from '../deadline/index.js';
 import '../cache/index.js';
-import '../types-BMZ7IMrd.js';
+import '../types-D7u9DkH7.js';
 import '../circuit-breaker/index.js';
 import '../protocol-B5YmJr0d.js';
 import '../rate-limit/index.js';

package/dist/paginated-walk/index.js

@@ -1,16 +1,16 @@
-export { PAGE_KEY, createPaginatedWalk, liftWalk } from '../chunk-XOAP3LOT.js';
+export { PAGE_KEY, createPaginatedWalk, liftWalk } from '../chunk-I5OV65MS.js';
 import '../chunk-SINXE47Y.js';
-import '../chunk-EC6FO42Q.js';
+import '../chunk-EUF7XOEE.js';
 import '../chunk-JELSZN25.js';
-export { deadlineSub, subscribeDeadline } from '../chunk-ASX7PL2K.js';
+export { deadlineSub, subscribeDeadline } from '../chunk-JGVL3WPL.js';
 import '../chunk-Q2UM7BXU.js';
 import '../chunk-S2EGRPCM.js';
 import '../chunk-UF4MZSLT.js';
-import '../chunk-WF46FABO.js';
-import '../chunk-2UGTDYOK.js';
+import '../chunk-7SVIRMC6.js';
+import '../chunk-3JU6657S.js';
 import '../chunk-2YFLOCWX.js';
 import '../chunk-ZJ5AOYBH.js';
-import '../chunk-ZH454CR5.js';
-import '../chunk-O7ED34JH.js';
+import '../chunk-5EHLEUTL.js';
+import '../chunk-B5VXOFMZ.js';
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map

package/dist/parity/index.d.ts

@@ -1,6 +1,35 @@
-import { B as BootingRuntime } from '../runtime-types-BbBq4LWo.js';
-import { C as Cmd, S as Sub, M as Machine } from '../core-JPHsMZVB.js';
+import { B as BootingRuntime } from '../runtime-types-Bxc637bp.js';
+import { C as Cmd, S as Sub, M as Machine } from '../core-Bjc0bS8j.js';
 import { Trace, RecorderOptions } from '../recorder/index.js';
+import 'better-result';
+
+/**
+ * the record → replay → normalized-diff go/no-go gate.
+ *
+ * The parity spike proved the mechanism already composes from in-tree
+ * primitives: `recorder` captures a run's Msg sequence (the recording), `replay`
+ * re-folds it purely, and `trace-replay`'s order-insensitive deep-equal diffs
+ * the result. Non-determinism is a RECORD-TIME property — ids/timestamps freeze
+ * into the recording, `replay` never re-mints them — so the same recording
+ * replays byte-identical every time.
+ *
+ * This module is the thin packaging over that substrate plus the one genuinely
+ * new helper, `normalizeForParity`: the finding-normalizer that strips
+ * record-time non-determinism (generated ids/timestamps) and stable-key-sorts
+ * collections, so an OLD-engine golden run and a NEW-engine run diff as equal
+ * exactly when they are behaviourally equivalent. Every domain (audit, auth,
+ * ingest, …) gets its old-vs-new parity check without reinventing the capture,
+ * the normalization, and the diff.
+ *
+ * ```text
+ *   recordRun(runtime)            → Recording        // wraps the recorder
+ *   goldenReplay(machine, rec)    → State            // wraps replay
+ *   normalizeForParity(schema)    → (finding) => norm // strip + stable-sort
+ *   parityEqual(a, b)             → boolean           // normalized deep-equal
+ * ```
+ *
+ * @packageDocumentation
+ */
 
 /**
  * A live parity recording attached to a Runtime — the go/no-go gate's golden

package/dist/parity/index.js

@@ -1,8 +1,8 @@
 import { recorder } from '../chunk-MUUROGIH.js';
-import { deepEqual } from '../chunk-A7USKARI.js';
+import { deepEqual } from '../chunk-SUST46KO.js';
 import '../chunk-EWJP3YYP.js';
-import { replay } from '../chunk-ZH454CR5.js';
-import '../chunk-O7ED34JH.js';
+import { replay } from '../chunk-5EHLEUTL.js';
+import '../chunk-B5VXOFMZ.js';
 
 // src/parity/index.ts
 function recordRun(runtime, opts) {

package/dist/parity/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/parity/index.ts"],"names":["key"],"mappings":";;;;;;;AA6DO,SAAS,SAAA,CACd,SACA,IAAA,EACiB;AACjB,EAAA,MAAM,GAAA,GAAM,QAAA,CAAS,OAAA,EAAS,IAAI,CAAA;AAClC,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,MAAM,GAAA,CAAI,IAAA,EAAK;AAAA,IACtB,OAAA,EAAS,MAAM,GAAA,CAAI,OAAA,EAAQ;AAAA,IAC3B,IAAA,EAAM,MAAM,GAAA,CAAI,IAAA;AAAK,GACvB;AACF;AAaO,SAAS,YAAA,CAOd,OAAA,EACA,SAAA,EACA,GAAA,EACG;AACH,EAAA,MAAM,KAAA,GAAQ,QAAQ,SAAS,CAAA;AAC/B,EAAA,MAAM,EAAE,KAAA,EAAM,GAAI,MAAA,CAAO,OAAA,EAAS;AAAA,IAChC,MAAM,KAAA,CAAM,IAAA;AAAA,IACZ,GAAA;AAAA,IACA,QAAQ,KAAA,CAAM;AAAA,GACf,CAAA;AACD,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,QAAc,SAAA,EAAuD;AAC5E,EAAA,OAAO,OAAQ,SAAA,CAA8B,KAAA,KAAU,UAAA,GAClD,SAAA,CAA8B,OAAM,GACpC,SAAA;AACP;AAuBA,IAAM,kBAAA,GAAwC,CAAC,IAAA,EAAM,OAAA,EAAS,WAAW,CAAA;AACzE,IAAM,iBAAA,GAAuC,CAAC,QAAA,EAAU,UAAA,EAAY,KAAK,CAAA;AAUlE,SAAS,mBACd,MAAA,EAC6B;AAC7B,EAAA,MAAM,SAAA,GAAY,IAAI,GAAA,CAAI,MAAA,EAAQ,aAAa,kBAAkB,CAAA;AACjE,EAAA,MAAM,QAAA,GAAW,QAAQ,QAAA,IAAY,iBAAA;AAErC,EAAA,MAAM,SAAA,GAAY,CAAC,KAAA,KAA4B;AAC7C,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,MAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,SAAS,CAAA;AAIjC,MAAA,OAAO,KAAA,CACJ,GAAA,CAAI,CAAC,IAAA,EAAM,KAAA,MAAW;AAAA,QACrB,IAAA;AAAA,QACA,KAAA;AAAA,QACA,OAAA,EAAS,cAAA,CAAe,IAAA,EAAM,QAAQ,CAAA;AAAA,QACtC,IAAA,EAAM,IAAA,CAAK,SAAA,CAAU,IAAI,CAAA,IAAK;AAAA,QAC9B,CAAA,CACD,IAAA;AAAA,QACC,CAAC,CAAA,EAAG,CAAA,KACF,cAAA,CAAe,CAAA,CAAE,SAAS,CAAA,CAAE,OAAO,CAAA,IACnC,cAAA,CAAe,EAAE,IAAA,EAAM,CAAA,CAAE,IAAI,CAAA,IAC7B,CAAA,CAAE,QAAQ,CAAA,CAAE;AAAA,OAChB,CACC,GAAA,CAAI,CAAC,SAAA,KAAc,UAAU,IAAI,CAAA;AAAA,IACtC;AACA,IAAA,IAAI,aAAA,CAAc,KAAK,CAAA,EAAG;AACxB,MAAA,MAAM,MAA+B,EAAC;AACtC,MAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,IAAA,CAAK,KAAK,EAChC,MAAA,CAAO,CAACA,IAAAA,KAAQ,CAAC,UAAU,GAAA,CAAIA,IAAG,CAAC,CAAA,CACnC,MAAK,EAAG;AACT,QAAA,GAAA,CAAI,GAAG,CAAA,GAAI,SAAA,CAAU,KAAA,CAAM,GAAG,CAAC,CAAA;AAAA,MACjC;AACA,MAAA,OAAO,GAAA;AAAA,IACT;AACA,IAAA,OAAO,KAAA;AAAA,EACT,CAAA;AAEA,EAAA,OAAO,SAAA;AACT;AAGA,SAAS,cAAA,CAAe,MAAe,QAAA,EAAqC;AAC1E,EAAA,IAAI,CAAC,aAAA,CAAc,IAAI,CAAA,EAAG,OAAO,EAAA;AACjC,EAAA,KAAA,MAAW,OAAO,QAAA,EAAU;AAC1B,IAAA,MAAM,SAAA,GAAY,KAAK,GAAG,CAAA;AAC1B,IAAA,IACE,OAAO,cAAc,QAAA,IACrB,OAAO,cAAc,QAAA,IACrB,OAAO,cAAc,SAAA,EACrB;AACA,MAAA,OAAO,OAAO,SAAS,CAAA;AAAA,IACzB;AAAA,EACF;AACA,EAAA,OAAO,EAAA;AACT;AAEA,SAAS,cAAA,CAAe,GAAW,CAAA,EAAmB;AACpD,EAAA,OAAO,CAAA,GAAI,CAAA,GAAI,EAAA,GAAK,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA;AAClC;AAEA,SAAS,cAAc,KAAA,EAAkD;AACvE,EAAA,OAAO,OAAO,UAAU,QAAA,IAAY,KAAA,KAAU,QAAQ,CAAC,KAAA,CAAM,QAAQ,KAAK,CAAA;AAC5E;AASO,SAAS,WAAA,CAAY,GAAY,CAAA,EAAqB;AAC3D,EAAA,OAAO,SAAA,CAAU,GAAG,CAAC,CAAA;AACvB;AAOO,IAAM,IAAA,GAAO","file":"index.js","sourcesContent":["// ---------------------------------------------------------------------------\n// parity — the record → replay → normalized-diff go/no-go gate.\n//\n// The parity spike proved the mechanism already composes from in-tree\n// primitives: `recorder` captures a run's Msg sequence (the recording), `replay`\n// re-folds it purely, and `trace-replay`'s order-insensitive deep-equal diffs\n// the result. Non-determinism is a RECORD-TIME property — ids/timestamps freeze\n// into the recording, `replay` never re-mints them — so the same recording\n// replays byte-identical every time.\n//\n// This module is the thin packaging over that substrate plus the one genuinely\n// new helper, `normalizeForParity`: the finding-normalizer that strips\n// record-time non-determinism (generated ids/timestamps) and stable-key-sorts\n// collections, so an OLD-engine golden run and a NEW-engine run diff as equal\n// exactly when they are behaviourally equivalent. Every domain (audit, auth,\n// ingest, …) gets its old-vs-new parity check without reinventing the capture,\n// the normalization, and the diff.\n//\n//   recordRun(runtime)            → Recording        // wraps the recorder\n//   goldenReplay(machine, rec)    → State            // wraps replay\n//   normalizeForParity(schema)    → (finding) => norm // strip + stable-sort\n//   parityEqual(a, b)             → boolean           // normalized deep-equal\n// ---------------------------------------------------------------------------\n\nimport type { BootingRuntime, Cmd, Machine, Sub } from \"../index\";\nimport { replay } from \"../index\";\nimport { type RecorderOptions, recorder, type Trace } from \"../recorder\";\nimport { deepEqual } from \"../trace-replay\";\n\n/**\n * A live parity recording attached to a Runtime — the go/no-go gate's golden\n * artifact. Wraps a {@link recorder}: drive the runtime, then snapshot with\n * {@link Recording.trace} (or hand the live `Recording` straight to\n * {@link goldenReplay}, which snapshots for you).\n *\n * @typeParam S - the machine's State type.\n * @typeParam M - the machine's Msg union.\n */\nexport interface Recording<S, M> {\n  /**\n   * Snapshot the recording so far as a replayable {@link Trace} — `loaded`\n   * (boot state), the ordered non-null `msgs`, and `finalState`. Sufficient to\n   * reproduce the run via {@link goldenReplay}. Fresh object each call.\n   */\n  trace(): Trace<S, M>;\n  /** Serialize the recording as JSONL (see {@link recorder}'s `toJSONL`). */\n  toJSONL(): string;\n  /** Detach the underlying observer. Idempotent. */\n  stop(): void;\n}\n\n/**\n * Attach a parity recording to a Runtime, reusing the `recorder`/`historyTracker`\n * capture (the boot observe for `loaded` + every non-null msg in order) rather\n * than a fresh observer path.\n *\n * Attach on the synchronous `run()` handle so the boot transition is captured\n * as `loaded`; drive the runtime; then `trace()` (or pass the handle to\n * {@link goldenReplay}). See {@link RecorderOptions} for `captureSteps` (needed\n * only for the per-step / resume-cache-prefix inspection, not for replay).\n */\nexport function recordRun<S, M extends { type: string }>(\n  runtime: BootingRuntime<S, M>,\n  opts?: RecorderOptions,\n): Recording<S, M> {\n  const rec = recorder(runtime, opts);\n  return {\n    trace: () => rec.dump(),\n    toJSONL: () => rec.toJSONL(),\n    stop: () => rec.stop(),\n  };\n}\n\n/**\n * Reproduce a recording's final state by folding its msgs through the pure\n * `replay` — `init(loaded, ctx)` then `update` per msg, never `interpret`,\n * never a `Store`, never a live subscription. Accepts a live {@link Recording}\n * (snapshotted here) or a bare {@link Trace}.\n *\n * `ctx` is the ENVIRONMENT supplied fresh at replay time (the trace is the\n * INPUT: `loaded` + `msgs`), mirroring `replayTrace`. It is optional so a\n * void-ctx machine can call `goldenReplay(machine, rec)`; a machine that reads\n * ctx passes it explicitly.\n */\nexport function goldenReplay<\n  S,\n  M extends { type: string },\n  C extends Cmd,\n  U extends Sub,\n  Ctx,\n>(\n  machine: Machine<S, M, C, U, Ctx>,\n  recording: Recording<S, M> | Trace<S, M>,\n  ctx?: Ctx,\n): S {\n  const trace = asTrace(recording);\n  const { state } = replay(machine, {\n    msgs: trace.msgs,\n    ctx: ctx as Ctx,\n    loaded: trace.loaded,\n  });\n  return state;\n}\n\n/** Narrow a `Recording | Trace` to a `Trace`, snapshotting a live recording. */\nfunction asTrace<S, M>(recording: Recording<S, M> | Trace<S, M>): Trace<S, M> {\n  return typeof (recording as Recording<S, M>).trace === \"function\"\n    ? (recording as Recording<S, M>).trace()\n    : (recording as Trace<S, M>);\n}\n\n/** Configuration for {@link normalizeForParity}. */\nexport interface ParitySchema {\n  /**\n   * Object keys stripped wherever they appear — the record-time\n   * non-determinism `replay` never re-mints. Default: `id`, `runId`,\n   * `timestamp`.\n   */\n  readonly stripKeys?: readonly string[];\n  /**\n   * Candidate keys used to stable-sort arrays of objects. For each array the\n   * first candidate present (as a primitive) on the items decides the order;\n   * arrays with no candidate fall back to canonical-JSON order. Default:\n   * `ruleId`, `selector`, `url`.\n   */\n  readonly sortKeys?: readonly string[];\n}\n\n// Defaults proven by the spike: strip the generated id/runId/timestamp,\n// stable-key-sort by ruleId | selector | url. Fan-out ordering is already\n// deterministic on this substrate (array order); the sort only defends against\n// intra-effect concurrency (Promise.all / Set).\nconst DEFAULT_STRIP_KEYS: readonly string[] = [\"id\", \"runId\", \"timestamp\"];\nconst DEFAULT_SORT_KEYS: readonly string[] = [\"ruleId\", \"selector\", \"url\"];\n\n/**\n * Build a finding-normalizer: a pure `(value) => normalized` that strips the\n * schema's `stripKeys`, recursively sorts object keys, and stable-key-sorts\n * arrays by the schema's `sortKeys`. Two runs that differ only in generated\n * ids/timestamps or intra-effect ordering normalize to a byte-identical value,\n * so {@link parityEqual} on the normalized pair reflects behavioural (not incidental)\n * difference.\n */\nexport function normalizeForParity(\n  schema?: ParitySchema,\n): (value: unknown) => unknown {\n  const stripKeys = new Set(schema?.stripKeys ?? DEFAULT_STRIP_KEYS);\n  const sortKeys = schema?.sortKeys ?? DEFAULT_SORT_KEYS;\n\n  const normalize = (value: unknown): unknown => {\n    if (Array.isArray(value)) {\n      const items = value.map(normalize);\n      // Decorate-sort-undecorate: primary key = first present sortKey value,\n      // secondary = canonical JSON (items are already normalized so keys are\n      // sorted), original index last for a stable total order.\n      return items\n        .map((item, index) => ({\n          item,\n          index,\n          primary: primarySortKey(item, sortKeys),\n          json: JSON.stringify(item) ?? \"\",\n        }))\n        .sort(\n          (a, b) =>\n            compareStrings(a.primary, b.primary) ||\n            compareStrings(a.json, b.json) ||\n            a.index - b.index,\n        )\n        .map((decorated) => decorated.item);\n    }\n    if (isPlainObject(value)) {\n      const out: Record<string, unknown> = {};\n      for (const key of Object.keys(value)\n        .filter((key) => !stripKeys.has(key))\n        .sort()) {\n        out[key] = normalize(value[key]);\n      }\n      return out;\n    }\n    return value;\n  };\n\n  return normalize;\n}\n\n/** The first present `sortKeys` candidate on `item` as a string, or `\"\"`. */\nfunction primarySortKey(item: unknown, sortKeys: readonly string[]): string {\n  if (!isPlainObject(item)) return \"\";\n  for (const key of sortKeys) {\n    const candidate = item[key];\n    if (\n      typeof candidate === \"string\" ||\n      typeof candidate === \"number\" ||\n      typeof candidate === \"boolean\"\n    ) {\n      return String(candidate);\n    }\n  }\n  return \"\";\n}\n\nfunction compareStrings(a: string, b: string): number {\n  return a < b ? -1 : a > b ? 1 : 0;\n}\n\nfunction isPlainObject(value: unknown): value is Record<string, unknown> {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\n/**\n * The parity verdict: `true` iff `a` and `b` are structurally equal. Reuses\n * `trace-replay`'s order-insensitive deep-equal (the comparator the\n * record/replay lane owns) rather than adding another boolean deep-compare —\n * feed it the pair produced by {@link normalizeForParity} for the\n * normalized-JSON equality the gate rests on.\n */\nexport function parityEqual(a: unknown, b: unknown): boolean {\n  return deepEqual(a, b);\n}\n\n/**\n * @deprecated Inverted name — it returns `true` when the values are EQUAL, so\n * `if (diff(old, new))` reads backwards (#278). Use {@link parityEqual}.\n * Alias kept for one minor, then removed.\n */\nexport const diff = parityEqual;\n"]}
+{"version":3,"sources":["../../src/parity/index.ts"],"names":["key"],"mappings":";;;;;;;AAiEO,SAAS,SAAA,CACd,SACA,IAAA,EACiB;AACjB,EAAA,MAAM,GAAA,GAAM,QAAA,CAAS,OAAA,EAAS,IAAI,CAAA;AAClC,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,MAAM,GAAA,CAAI,IAAA,EAAK;AAAA,IACtB,OAAA,EAAS,MAAM,GAAA,CAAI,OAAA,EAAQ;AAAA,IAC3B,IAAA,EAAM,MAAM,GAAA,CAAI,IAAA;AAAK,GACvB;AACF;AAaO,SAAS,YAAA,CAOd,OAAA,EACA,SAAA,EACA,GAAA,EACG;AACH,EAAA,MAAM,KAAA,GAAQ,QAAQ,SAAS,CAAA;AAC/B,EAAA,MAAM,EAAE,KAAA,EAAM,GAAI,MAAA,CAAO,OAAA,EAAS;AAAA,IAChC,MAAM,KAAA,CAAM,IAAA;AAAA,IACZ,GAAA;AAAA,IACA,QAAQ,KAAA,CAAM;AAAA,GACf,CAAA;AACD,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,QAAc,SAAA,EAAuD;AAC5E,EAAA,OAAO,OAAQ,SAAA,CAA8B,KAAA,KAAU,UAAA,GAClD,SAAA,CAA8B,OAAM,GACpC,SAAA;AACP;AAuBA,IAAM,kBAAA,GAAwC,CAAC,IAAA,EAAM,OAAA,EAAS,WAAW,CAAA;AACzE,IAAM,iBAAA,GAAuC,CAAC,QAAA,EAAU,UAAA,EAAY,KAAK,CAAA;AAUlE,SAAS,mBACd,MAAA,EAC6B;AAC7B,EAAA,MAAM,SAAA,GAAY,IAAI,GAAA,CAAI,MAAA,EAAQ,aAAa,kBAAkB,CAAA;AACjE,EAAA,MAAM,QAAA,GAAW,QAAQ,QAAA,IAAY,iBAAA;AAErC,EAAA,MAAM,SAAA,GAAY,CAAC,KAAA,KAA4B;AAC7C,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,MAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,SAAS,CAAA;AAIjC,MAAA,OAAO,KAAA,CACJ,GAAA,CAAI,CAAC,IAAA,EAAM,KAAA,MAAW;AAAA,QACrB,IAAA;AAAA,QACA,KAAA;AAAA,QACA,OAAA,EAAS,cAAA,CAAe,IAAA,EAAM,QAAQ,CAAA;AAAA,QACtC,IAAA,EAAM,IAAA,CAAK,SAAA,CAAU,IAAI,CAAA,IAAK;AAAA,QAC9B,CAAA,CACD,IAAA;AAAA,QACC,CAAC,CAAA,EAAG,CAAA,KACF,cAAA,CAAe,CAAA,CAAE,SAAS,CAAA,CAAE,OAAO,CAAA,IACnC,cAAA,CAAe,EAAE,IAAA,EAAM,CAAA,CAAE,IAAI,CAAA,IAC7B,CAAA,CAAE,QAAQ,CAAA,CAAE;AAAA,OAChB,CACC,GAAA,CAAI,CAAC,SAAA,KAAc,UAAU,IAAI,CAAA;AAAA,IACtC;AACA,IAAA,IAAI,aAAA,CAAc,KAAK,CAAA,EAAG;AACxB,MAAA,MAAM,MAA+B,EAAC;AACtC,MAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,IAAA,CAAK,KAAK,EAChC,MAAA,CAAO,CAACA,IAAAA,KAAQ,CAAC,UAAU,GAAA,CAAIA,IAAG,CAAC,CAAA,CACnC,MAAK,EAAG;AACT,QAAA,GAAA,CAAI,GAAG,CAAA,GAAI,SAAA,CAAU,KAAA,CAAM,GAAG,CAAC,CAAA;AAAA,MACjC;AACA,MAAA,OAAO,GAAA;AAAA,IACT;AACA,IAAA,OAAO,KAAA;AAAA,EACT,CAAA;AAEA,EAAA,OAAO,SAAA;AACT;AAGA,SAAS,cAAA,CAAe,MAAe,QAAA,EAAqC;AAC1E,EAAA,IAAI,CAAC,aAAA,CAAc,IAAI,CAAA,EAAG,OAAO,EAAA;AACjC,EAAA,KAAA,MAAW,OAAO,QAAA,EAAU;AAC1B,IAAA,MAAM,SAAA,GAAY,KAAK,GAAG,CAAA;AAC1B,IAAA,IACE,OAAO,cAAc,QAAA,IACrB,OAAO,cAAc,QAAA,IACrB,OAAO,cAAc,SAAA,EACrB;AACA,MAAA,OAAO,OAAO,SAAS,CAAA;AAAA,IACzB;AAAA,EACF;AACA,EAAA,OAAO,EAAA;AACT;AAEA,SAAS,cAAA,CAAe,GAAW,CAAA,EAAmB;AACpD,EAAA,OAAO,CAAA,GAAI,CAAA,GAAI,EAAA,GAAK,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA;AAClC;AAEA,SAAS,cAAc,KAAA,EAAkD;AACvE,EAAA,OAAO,OAAO,UAAU,QAAA,IAAY,KAAA,KAAU,QAAQ,CAAC,KAAA,CAAM,QAAQ,KAAK,CAAA;AAC5E;AASO,SAAS,WAAA,CAAY,GAAY,CAAA,EAAqB;AAC3D,EAAA,OAAO,SAAA,CAAU,GAAG,CAAC,CAAA;AACvB;AAOO,IAAM,IAAA,GAAO","file":"index.js","sourcesContent":["/**\n * the record → replay → normalized-diff go/no-go gate.\n *\n * The parity spike proved the mechanism already composes from in-tree\n * primitives: `recorder` captures a run's Msg sequence (the recording), `replay`\n * re-folds it purely, and `trace-replay`'s order-insensitive deep-equal diffs\n * the result. Non-determinism is a RECORD-TIME property — ids/timestamps freeze\n * into the recording, `replay` never re-mints them — so the same recording\n * replays byte-identical every time.\n *\n * This module is the thin packaging over that substrate plus the one genuinely\n * new helper, `normalizeForParity`: the finding-normalizer that strips\n * record-time non-determinism (generated ids/timestamps) and stable-key-sorts\n * collections, so an OLD-engine golden run and a NEW-engine run diff as equal\n * exactly when they are behaviourally equivalent. Every domain (audit, auth,\n * ingest, …) gets its old-vs-new parity check without reinventing the capture,\n * the normalization, and the diff.\n *\n * ```text\n *   recordRun(runtime)            → Recording        // wraps the recorder\n *   goldenReplay(machine, rec)    → State            // wraps replay\n *   normalizeForParity(schema)    → (finding) => norm // strip + stable-sort\n *   parityEqual(a, b)             → boolean           // normalized deep-equal\n * ```\n *\n * @packageDocumentation\n */\n\nimport type { BootingRuntime, Cmd, Machine, Sub } from \"../index\";\nimport { replay } from \"../index\";\nimport { type RecorderOptions, recorder, type Trace } from \"../recorder\";\nimport { deepEqual } from \"../trace-replay\";\n\n/**\n * A live parity recording attached to a Runtime — the go/no-go gate's golden\n * artifact. Wraps a {@link recorder}: drive the runtime, then snapshot with\n * {@link Recording.trace} (or hand the live `Recording` straight to\n * {@link goldenReplay}, which snapshots for you).\n *\n * @typeParam S - the machine's State type.\n * @typeParam M - the machine's Msg union.\n */\nexport interface Recording<S, M> {\n  /**\n   * Snapshot the recording so far as a replayable {@link Trace} — `loaded`\n   * (boot state), the ordered non-null `msgs`, and `finalState`. Sufficient to\n   * reproduce the run via {@link goldenReplay}. Fresh object each call.\n   */\n  trace(): Trace<S, M>;\n  /** Serialize the recording as JSONL (see {@link recorder}'s `toJSONL`). */\n  toJSONL(): string;\n  /** Detach the underlying observer. Idempotent. */\n  stop(): void;\n}\n\n/**\n * Attach a parity recording to a Runtime, reusing the `recorder`/`historyTracker`\n * capture (the boot observe for `loaded` + every non-null msg in order) rather\n * than a fresh observer path.\n *\n * Attach on the synchronous `run()` handle so the boot transition is captured\n * as `loaded`; drive the runtime; then `trace()` (or pass the handle to\n * {@link goldenReplay}). See {@link RecorderOptions} for `captureSteps` (needed\n * only for the per-step / resume-cache-prefix inspection, not for replay).\n */\nexport function recordRun<S, M extends { type: string }>(\n  runtime: BootingRuntime<S, M>,\n  opts?: RecorderOptions,\n): Recording<S, M> {\n  const rec = recorder(runtime, opts);\n  return {\n    trace: () => rec.dump(),\n    toJSONL: () => rec.toJSONL(),\n    stop: () => rec.stop(),\n  };\n}\n\n/**\n * Reproduce a recording's final state by folding its msgs through the pure\n * `replay` — `init(loaded, ctx)` then `update` per msg, never `interpret`,\n * never a `Store`, never a live subscription. Accepts a live {@link Recording}\n * (snapshotted here) or a bare {@link Trace}.\n *\n * `ctx` is the ENVIRONMENT supplied fresh at replay time (the trace is the\n * INPUT: `loaded` + `msgs`), mirroring `replayTrace`. It is optional so a\n * void-ctx machine can call `goldenReplay(machine, rec)`; a machine that reads\n * ctx passes it explicitly.\n */\nexport function goldenReplay<\n  S,\n  M extends { type: string },\n  C extends Cmd,\n  U extends Sub,\n  Ctx,\n>(\n  machine: Machine<S, M, C, U, Ctx>,\n  recording: Recording<S, M> | Trace<S, M>,\n  ctx?: Ctx,\n): S {\n  const trace = asTrace(recording);\n  const { state } = replay(machine, {\n    msgs: trace.msgs,\n    ctx: ctx as Ctx,\n    loaded: trace.loaded,\n  });\n  return state;\n}\n\n/** Narrow a `Recording | Trace` to a `Trace`, snapshotting a live recording. */\nfunction asTrace<S, M>(recording: Recording<S, M> | Trace<S, M>): Trace<S, M> {\n  return typeof (recording as Recording<S, M>).trace === \"function\"\n    ? (recording as Recording<S, M>).trace()\n    : (recording as Trace<S, M>);\n}\n\n/** Configuration for {@link normalizeForParity}. */\nexport interface ParitySchema {\n  /**\n   * Object keys stripped wherever they appear — the record-time\n   * non-determinism `replay` never re-mints. Default: `id`, `runId`,\n   * `timestamp`.\n   */\n  readonly stripKeys?: readonly string[];\n  /**\n   * Candidate keys used to stable-sort arrays of objects. For each array the\n   * first candidate present (as a primitive) on the items decides the order;\n   * arrays with no candidate fall back to canonical-JSON order. Default:\n   * `ruleId`, `selector`, `url`.\n   */\n  readonly sortKeys?: readonly string[];\n}\n\n// Defaults proven by the spike: strip the generated id/runId/timestamp,\n// stable-key-sort by ruleId | selector | url. Fan-out ordering is already\n// deterministic on this substrate (array order); the sort only defends against\n// intra-effect concurrency (Promise.all / Set).\nconst DEFAULT_STRIP_KEYS: readonly string[] = [\"id\", \"runId\", \"timestamp\"];\nconst DEFAULT_SORT_KEYS: readonly string[] = [\"ruleId\", \"selector\", \"url\"];\n\n/**\n * Build a finding-normalizer: a pure `(value) => normalized` that strips the\n * schema's `stripKeys`, recursively sorts object keys, and stable-key-sorts\n * arrays by the schema's `sortKeys`. Two runs that differ only in generated\n * ids/timestamps or intra-effect ordering normalize to a byte-identical value,\n * so {@link parityEqual} on the normalized pair reflects behavioural (not incidental)\n * difference.\n */\nexport function normalizeForParity(\n  schema?: ParitySchema,\n): (value: unknown) => unknown {\n  const stripKeys = new Set(schema?.stripKeys ?? DEFAULT_STRIP_KEYS);\n  const sortKeys = schema?.sortKeys ?? DEFAULT_SORT_KEYS;\n\n  const normalize = (value: unknown): unknown => {\n    if (Array.isArray(value)) {\n      const items = value.map(normalize);\n      // Decorate-sort-undecorate: primary key = first present sortKey value,\n      // secondary = canonical JSON (items are already normalized so keys are\n      // sorted), original index last for a stable total order.\n      return items\n        .map((item, index) => ({\n          item,\n          index,\n          primary: primarySortKey(item, sortKeys),\n          json: JSON.stringify(item) ?? \"\",\n        }))\n        .sort(\n          (a, b) =>\n            compareStrings(a.primary, b.primary) ||\n            compareStrings(a.json, b.json) ||\n            a.index - b.index,\n        )\n        .map((decorated) => decorated.item);\n    }\n    if (isPlainObject(value)) {\n      const out: Record<string, unknown> = {};\n      for (const key of Object.keys(value)\n        .filter((key) => !stripKeys.has(key))\n        .sort()) {\n        out[key] = normalize(value[key]);\n      }\n      return out;\n    }\n    return value;\n  };\n\n  return normalize;\n}\n\n/** The first present `sortKeys` candidate on `item` as a string, or `\"\"`. */\nfunction primarySortKey(item: unknown, sortKeys: readonly string[]): string {\n  if (!isPlainObject(item)) return \"\";\n  for (const key of sortKeys) {\n    const candidate = item[key];\n    if (\n      typeof candidate === \"string\" ||\n      typeof candidate === \"number\" ||\n      typeof candidate === \"boolean\"\n    ) {\n      return String(candidate);\n    }\n  }\n  return \"\";\n}\n\nfunction compareStrings(a: string, b: string): number {\n  return a < b ? -1 : a > b ? 1 : 0;\n}\n\nfunction isPlainObject(value: unknown): value is Record<string, unknown> {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\n/**\n * The parity verdict: `true` iff `a` and `b` are structurally equal. Reuses\n * `trace-replay`'s order-insensitive deep-equal (the comparator the\n * record/replay lane owns) rather than adding another boolean deep-compare —\n * feed it the pair produced by {@link normalizeForParity} for the\n * normalized-JSON equality the gate rests on.\n */\nexport function parityEqual(a: unknown, b: unknown): boolean {\n  return deepEqual(a, b);\n}\n\n/**\n * @deprecated Inverted name — it returns `true` when the values are EQUAL, so\n * `if (diff(old, new))` reads backwards (#278). Use {@link parityEqual}.\n * Alias kept for one minor, then removed.\n */\nexport const diff = parityEqual;\n"]}

package/dist/pbt/arbitraries/index.d.ts

@@ -1,5 +1,5 @@
 import * as fc from 'fast-check';
-import { C as Cmd, S as Sub, M as Machine } from '../../core-JPHsMZVB.js';
+import { C as Cmd, S as Sub, M as Machine } from '../../core-Bjc0bS8j.js';
 
 /**
  * Build a Ctx value whose every property access throws. Use as the `ctx`

package/dist/pbt/index.d.ts

@@ -1,6 +1,6 @@
 export { MsgArbitraryTable, arbConstantMsg, arbGuidedSequence, arbMsg, arbMsgSequence, arbRecordMsg, stubCtxThrowingProxy } from './arbitraries/index.js';
 export { Step, foldEvents, propertyInvariant, propertyTerminates, propertyTrace } from './runners/index.js';
-import { C as Cmd, R as Reducer, T as Transitions, U as UpdateForm } from '../core-JPHsMZVB.js';
+import { C as Cmd, R as Reducer, T as Transitions, U as UpdateForm } from '../core-Bjc0bS8j.js';
 import 'fast-check';
 
 /**

package/dist/pbt/index.js

@@ -1,7 +1,7 @@
 export { arbConstantMsg, arbGuidedSequence, arbMsg, arbMsgSequence, arbRecordMsg, stubCtxThrowingProxy } from '../chunk-AZZLE7XR.js';
-export { foldEvents, propertyInvariant, propertyTerminates, propertyTrace } from '../chunk-S6Y3RNX4.js';
-import '../chunk-ZH454CR5.js';
-import { msgKeysOf } from '../chunk-O7ED34JH.js';
+export { foldEvents, propertyInvariant, propertyTerminates, propertyTrace } from '../chunk-JP5D6GSL.js';
+import '../chunk-5EHLEUTL.js';
+import { msgKeysOf } from '../chunk-B5VXOFMZ.js';
 
 // src/pbt/util/msg-keys.ts
 function msgTypeKeys(machine) {

package/dist/pbt/runners/index.d.ts

@@ -1,5 +1,5 @@
 import * as fc from 'fast-check';
-import { C as Cmd, S as Sub, M as Machine } from '../../core-JPHsMZVB.js';
+import { C as Cmd, S as Sub, M as Machine } from '../../core-Bjc0bS8j.js';
 
 /**
  * One unit in a fold trace — the four pieces of data a property

package/dist/pbt/runners/index.js

@@ -1,5 +1,5 @@
-export { foldEvents, propertyInvariant, propertyTerminates, propertyTrace } from '../../chunk-S6Y3RNX4.js';
-import '../../chunk-ZH454CR5.js';
-import '../../chunk-O7ED34JH.js';
+export { foldEvents, propertyInvariant, propertyTerminates, propertyTrace } from '../../chunk-JP5D6GSL.js';
+import '../../chunk-5EHLEUTL.js';
+import '../../chunk-B5VXOFMZ.js';
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map