@almadar/core 2.5.0 → 2.5.2

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

@@ -71,9 +71,20 @@ interface GraphTransition {
  */
 
 /**
- * Build an adjacency list: state -> [{ event, to }].
- * Wildcard transitions (from === '*') are excluded since they
- * don't represent fixed edges in the graph.
+ * Builds an adjacency list from state machine transitions.
+ *
+ * Constructs a state transition graph where each state maps to an array
+ * of outgoing edges (events and target states). Wildcard transitions
+ * (from === '*') are excluded since they don't represent fixed edges.
+ * Used as the foundation for state machine analysis, traversal, and verification.
+ *
+ * @param {GraphTransition[]} transitions - Array of state transitions
+ * @returns {Map<string, StateEdge[]>} State transition graph
+ *
+ * @example
+ * const graph = buildStateGraph(transitions);
+ * const edgesFromInitial = graph.get('initial'); // Array of outgoing edges
+ * console.log(`Initial state has ${edgesFromInitial?.length} transitions`);
  */
 declare function buildStateGraph(transitions: GraphTransition[]): Map<string, StateEdge[]>;
 
@@ -87,23 +98,41 @@ declare function buildStateGraph(transitions: GraphTransition[]): Map<string, St
  */
 
 /**
- * Collect all reachable states from an initial state via BFS.
+ * Collects all reachable states from an initial state using breadth-first search.
+ *
+ * Performs BFS traversal of the state machine to find all states reachable
+ * from the initial state, up to the specified maximum depth. Used for
+ * state machine analysis, verification, and test coverage assessment.
  *
- * @param transitions - State machine transitions
- * @param initialState - Starting state
- * @param maxDepth - Maximum BFS depth (default: 5)
- * @returns Set of reachable state names
+ * @param {GraphTransition[]} transitions - Array of state transitions
+ * @param {string} initialState - Starting state name
+ * @param {number} [maxDepth=5] - Maximum search depth
+ * @returns {Set<string>} Set of reachable state names
+ *
+ * @example
+ * const reachable = collectReachableStates(transitions, 'initial', 10);
+ * console.log('Reachable states:', Array.from(reachable));
  */
 declare function collectReachableStates(transitions: GraphTransition[], initialState: string, maxDepth?: number): Set<string>;
 /**
- * Walk all (state, event) pairs reachable via BFS and invoke a callback for each.
- * Used by the server verification to POST each transition and check the response.
- *
- * @param transitions - State machine transitions
- * @param initialState - Starting state
- * @param maxDepth - Maximum BFS depth (default: 5)
- * @param visitor - Callback invoked for each (state, edge) pair.
- *   Return true to enqueue the target state for further exploration.
+ * Walks all reachable (state, event) pairs using BFS and invokes callback for each.
+ *
+ * Traverses the state machine using breadth-first search and calls the visitor
+ * function for each (state, edge) pair encountered. Used by server verification
+ * to test transitions by POSTing to endpoints and checking responses.
+ *
+ * @param {GraphTransition[]} transitions - Array of state transitions
+ * @param {string} initialState - Starting state name
+ * @param {number} maxDepth - Maximum BFS depth
+ * @param {(state: string, edge: StateEdge, depth: number) => Promise<boolean>} visitor - Callback for each pair
+ * @returns {Promise<{ visitedPairs: Set<string>; walkedEdges: number }>} Traversal statistics
+ *
+ * @example
+ * const result = await walkStatePairs(transitions, 'initial', 5, async (state, edge) => {
+ *   console.log(`Transition: ${state} --${edge.event}--> ${edge.to}`);
+ *   return true; // Continue exploration
+ * });
+ * console.log(`Visited ${result.visitedPairs.size} state-event pairs`);
  */
 declare function walkStatePairs(transitions: GraphTransition[], initialState: string, maxDepth: number, visitor: (state: string, edge: StateEdge, depth: number) => Promise<boolean>): Promise<{
     visitedPairs: Set<string>;
@@ -120,21 +149,49 @@ declare function walkStatePairs(transitions: GraphTransition[], initialState: st
  */
 
 /**
- * Extract the first @payload path segment from a binding reference.
- * "@payload.item" -> "item", "@payload.data.weight" -> "data".
- * Returns null for non-payload refs (@entity, @state, @user, etc.).
+ * Extracts the first segment of a payload field reference.
+ *
+ * Parses binding references in the format "@payload.field" and extracts
+ * the first field name segment. Used for identifying payload fields in
+ * guard conditions for test data generation.
+ *
+ * @param {unknown} ref - Binding reference to extract from
+ * @returns {string | null} First field segment or null for non-payload references
+ *
+ * @example
+ * extractPayloadFieldRef('@payload.item'); // returns 'item'
+ * extractPayloadFieldRef('@payload.data.weight'); // returns 'data'
+ * extractPayloadFieldRef('@entity.id'); // returns null
+ * extractPayloadFieldRef('@user.name'); // returns null
  */
 declare function extractPayloadFieldRef(ref: unknown): string | null;
 /**
- * Derive pass and fail payloads from a guard s-expression.
+ * Builds test payloads that satisfy or violate guard conditions.
  *
- * Pass payload: satisfies the guard condition (transition fires).
- * Fail payload: violates the guard condition (transition is blocked).
+ * Generates pass/fail test data for guard s-expressions used in state machine
+ * transitions. Pass payloads satisfy the guard condition (allowing transition),
+ * fail payloads violate it (blocking transition). Used for automated testing
+ * and validation of state machine behavior.
  *
- * For @entity.* and @user.* guards: returns { pass: {}, fail: {} } because
- * these reference runtime state that cannot be directly faked in tests.
+ * Supports operators: not-nil, nil, eq, not-eq, gt, gte, lt, lte, and, or, not
  *
- * Handles operators: not-nil, nil, eq, not-eq, gt, gte, lt, lte, and, or, not
+ * @param {unknown} guard - Guard s-expression to analyze
+ * @returns {GuardPayload} Object with pass and fail payloads
+ *
+ * @example
+ * // Guard: ['not-nil', '@payload.completed']
+ * buildGuardPayloads(['not-nil', '@payload.completed']);
+ * // Returns: { pass: { completed: 'mock-test-value' }, fail: { completed: null } }
+ *
+ * @example
+ * // Guard: ['eq', '@payload.status', 'active']
+ * buildGuardPayloads(['eq', '@payload.status', 'active']);
+ * // Returns: { pass: { status: 'active' }, fail: { status: 'not-active' } }
+ *
+ * @example
+ * // Guard: ['and', ['not-nil', '@payload.id'], ['eq', '@payload.status', 'ready']]
+ * buildGuardPayloads(['and', ['not-nil', '@payload.id'], ['eq', '@payload.status', 'ready']]);
+ * // Returns: { pass: { id: 'mock-test-value', status: 'ready' }, fail: { id: null } }
  */
 declare function buildGuardPayloads(guard: unknown): GuardPayload;
 
@@ -165,12 +222,29 @@ interface ReplayTransition extends GraphTransition {
     }>;
 }
 /**
- * Build the shortest replay path from initialState to every reachable state.
+ * Builds the shortest replay paths from initial state to all reachable states.
+ *
+ * Computes step-by-step navigation paths for state machine testing and verification.
+ * Uses breadth-first search to find shortest paths up to specified depth limit.
+ * Each path contains replay steps with event, state, and payload information
+ * needed to reproduce state transitions in tests.
+ *
+ * @param {ReplayTransition[]} transitions - Transitions with render/payload information
+ * @param {string} initialState - Starting state name
+ * @param {number} [maxDepth=3] - Maximum path length (default: 3)
+ * @returns {Map<string, ReplayStep[]>} Map of state names to replay step arrays
+ *
+ * @example
+ * // Build paths from 'initial' state
+ * const paths = buildReplayPaths(transitions, 'initial', 5);
+ *
+ * // Get steps to reach 'completed' state
+ * const stepsToComplete = paths.get('completed');
  *
- * @param transitions - Transitions with render/payload info
- * @param initialState - Starting state
- * @param maxDepth - Maximum path length (default: 3, shorter than BFS exploration)
- * @returns Map of state -> replay steps to reach it
+ * // Execute replay steps
+ * for (const step of stepsToComplete) {
+ *   await dispatchEvent(step.event, step.payload);
+ * }
  */
 declare function buildReplayPaths(transitions: ReplayTransition[], initialState: string, maxDepth?: number): Map<string, ReplayStep[]>;
 

package/dist/state-machine/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/state-machine/graph.ts","../../src/state-machine/bfs.ts","../../src/state-machine/guard-payloads.ts","../../src/state-machine/replay-paths.ts"],"names":[],"mappings":";AAgBO,SAAS,gBACd,WAAA,EAC0B;AAC1B,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAyB;AAC3C,EAAA,KAAA,MAAW,KAAK,WAAA,EAAa;AAC3B,IAAA,IAAI,CAAA,CAAE,SAAS,GAAA,EAAK;AACpB,IAAA,IAAI,CAAC,KAAA,CAAM,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,EAAG,KAAA,CAAM,GAAA,CAAI,CAAA,CAAE,IAAA,EAAM,EAAE,CAAA;AAC5C,IAAA,KAAA,CAAM,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,CAAG,IAAA,CAAK,EAAE,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA;AAAA,EACtD;AACA,EAAA,OAAO,KAAA;AACT;;;ACLO,SAAS,sBAAA,CACd,WAAA,EACA,YAAA,EACA,QAAA,GAAW,CAAA,EACE;AACb,EAAA,MAAM,KAAA,GAAQ,gBAAgB,WAAW,CAAA;AACzC,EAAA,MAAM,OAAA,mBAAU,IAAI,GAAA,CAAY,CAAC,YAAY,CAAC,CAAA;AAC9C,EAAA,MAAM,QAAmB,CAAC,EAAE,OAAO,YAAA,EAAc,KAAA,EAAO,GAAG,CAAA;AAE3D,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,OAAA,GAAU,MAAM,KAAA,EAAM;AAC5B,IAAA,IAAI,OAAA,CAAQ,SAAS,QAAA,EAAU;AAE/B,IAAA,MAAM,QAAQ,KAAA,CAAM,GAAA,CAAI,OAAA,CAAQ,KAAK,KAAK,EAAC;AAC3C,IAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,MAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AACzB,QAAA,OAAA,CAAQ,GAAA,CAAI,KAAK,EAAE,CAAA;AACnB,QAAA,KAAA,CAAM,IAAA,CAAK,EAAE,KAAA,EAAO,IAAA,CAAK,IAAI,KAAA,EAAO,OAAA,CAAQ,KAAA,GAAQ,CAAA,EAAG,CAAA;AAAA,MACzD;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,OAAA;AACT;AAYA,eAAsB,cAAA,CACpB,WAAA,EACA,YAAA,EACA,QAAA,EACA,OAAA,EAC6D;AAC7D,EAAA,MAAM,KAAA,GAAQ,gBAAgB,WAAW,CAAA;AACzC,EAAA,MAAM,YAAA,uBAAmB,GAAA,EAAY;AACrC,EAAA,MAAM,QAAmB,CAAC,EAAE,OAAO,YAAA,EAAc,KAAA,EAAO,GAAG,CAAA;AAC3D,EAAA,IAAI,WAAA,GAAc,CAAA;AAElB,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,OAAA,GAAU,MAAM,KAAA,EAAM;AAC5B,IAAA,IAAI,OAAA,CAAQ,SAAS,QAAA,EAAU;AAE/B,IAAA,MAAM,QAAQ,KAAA,CAAM,GAAA,CAAI,OAAA,CAAQ,KAAK,KAAK,EAAC;AAC3C,IAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,MAAA,MAAM,UAAU,CAAA,EAAG,OAAA,CAAQ,KAAK,CAAA,CAAA,EAAI,KAAK,KAAK,CAAA,CAAA;AAC9C,MAAA,IAAI,YAAA,CAAa,GAAA,CAAI,OAAO,CAAA,EAAG;AAC/B,MAAA,YAAA,CAAa,IAAI,OAAO,CAAA;AAExB,MAAA,MAAM,gBAAgB,MAAM,OAAA,CAAQ,QAAQ,KAAA,EAAO,IAAA,EAAM,QAAQ,KAAK,CAAA;AACtE,MAAA,WAAA,EAAA;AAEA,MAAA,IAAI,aAAA,EAAe;AACjB,QAAA,MAAM,YAAA,GAAe,CAAC,GAAG,YAAY,EAAE,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,UAAA,CAAW,CAAA,EAAG,IAAA,CAAK,EAAE,GAAG,CAAC,CAAA;AAC9E,QAAA,IAAI,CAAC,YAAA,EAAc;AACjB,UAAA,KAAA,CAAM,IAAA,CAAK,EAAE,KAAA,EAAO,IAAA,CAAK,IAAI,KAAA,EAAO,OAAA,CAAQ,KAAA,GAAQ,CAAA,EAAG,CAAA;AAAA,QACzD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,cAAc,WAAA,EAAY;AACrC;;;AC1EO,SAAS,uBAAuB,GAAA,EAA6B;AAClE,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,EAAU,OAAO,IAAA;AACpC,EAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,KAAA,CAAM,4BAA4B,CAAA;AACpD,EAAA,OAAO,KAAA,GAAQ,KAAA,CAAM,CAAC,CAAA,GAAI,IAAA;AAC5B;AAaO,SAAS,mBAAmB,KAAA,EAA8B;AAC/D,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,IAAK,KAAA,CAAM,WAAW,CAAA,EAAG;AAC/C,IAAA,OAAO,EAAE,IAAA,EAAM,EAAC,EAAG,IAAA,EAAM,EAAC,EAAE;AAAA,EAC9B;AAEA,EAAA,MAAM,EAAA,GAAK,MAAA,CAAO,KAAA,CAAM,CAAC,CAAC,CAAA;AAE1B,EAAA,IAAI,EAAA,KAAO,SAAA,IAAa,EAAA,KAAO,SAAA,EAAW;AACxC,IAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,IAAI,OAAO,OAAO,EAAE,IAAA,EAAM,EAAE,CAAC,KAAK,GAAG,iBAAA,EAAkB,EAAG,MAAM,EAAE,CAAC,KAAK,GAAG,MAAK,EAAE;AAAA,EACpF;AAEA,EAAA,IAAI,OAAO,KAAA,EAAO;AAChB,IAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,IAAI,KAAA,EAAO,OAAO,EAAE,IAAA,EAAM,EAAC,EAAG,IAAA,EAAM,EAAE,CAAC,KAAK,GAAG,iBAAA,EAAkB,EAAE;AAAA,EACrE;AAEA,EAAA,IAAI,EAAA,KAAO,IAAA,IAAQ,EAAA,KAAO,IAAA,IAAQ,OAAO,GAAA,EAAK;AAC5C,IAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,MAAM,GAAA,GAAM,MAAM,CAAC,CAAA;AACnB,IAAA,IAAI,KAAA,IAAS,QAAQ,MAAA,EAAW;AAC9B,MAAA,MAAM,OAAA,GACJ,OAAO,GAAA,KAAQ,QAAA,GAAW,GAAA,GAAM,CAAA,GAC9B,OAAO,GAAA,KAAQ,QAAA,GAAW,CAAA,IAAA,EAAO,GAAG,CAAA,CAAA,GACpC,IAAA;AACJ,MAAA,OAAO,EAAE,IAAA,EAAM,EAAE,CAAC,KAAK,GAAG,GAAA,EAAI,EAAG,IAAA,EAAM,EAAE,CAAC,KAAK,GAAG,SAAQ,EAAE;AAAA,IAC9D;AAAA,EACF;AAEA,EAAA,IAAI,EAAA,KAAO,QAAA,IAAY,EAAA,KAAO,IAAA,IAAQ,OAAO,KAAA,EAAO;AAClD,IAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,MAAM,GAAA,GAAM,MAAM,CAAC,CAAA;AACnB,IAAA,IAAI,KAAA,IAAS,QAAQ,MAAA,EAAW;AAC9B,MAAA,MAAM,OAAA,GACJ,OAAO,GAAA,KAAQ,QAAA,GAAW,GAAA,GAAM,CAAA,GAC9B,OAAO,GAAA,KAAQ,QAAA,GAAW,CAAA,IAAA,EAAO,GAAG,CAAA,CAAA,GACpC,OAAA;AACJ,MAAA,OAAO,EAAE,IAAA,EAAM,EAAE,CAAC,KAAK,GAAG,OAAA,EAAQ,EAAG,IAAA,EAAM,EAAE,CAAC,KAAK,GAAG,KAAI,EAAE;AAAA,IAC9D;AAAA,EACF;AAEA,EAAA,IAAI,EAAA,KAAO,IAAA,IAAQ,EAAA,KAAO,GAAA,EAAK;AAC7B,IAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,MAAM,CAAA,GAAI,OAAO,KAAA,CAAM,CAAC,MAAM,QAAA,GAAW,KAAA,CAAM,CAAC,CAAA,GAAI,CAAA;AACpD,IAAA,IAAI,OAAO,OAAO,EAAE,MAAM,EAAE,CAAC,KAAK,GAAG,CAAA,GAAI,CAAA,EAAE,EAAG,MAAM,EAAE,CAAC,KAAK,GAAG,CAAA,GAAI,GAAE,EAAE;AAAA,EACzE;AAEA,EAAA,IAAI,EAAA,KAAO,KAAA,IAAS,EAAA,KAAO,IAAA,EAAM;AAC/B,IAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,MAAM,CAAA,GAAI,OAAO,KAAA,CAAM,CAAC,MAAM,QAAA,GAAW,KAAA,CAAM,CAAC,CAAA,GAAI,CAAA;AACpD,IAAA,IAAI,OAAO,OAAO,EAAE,IAAA,EAAM,EAAE,CAAC,KAAK,GAAG,CAAA,EAAE,EAAG,MAAM,EAAE,CAAC,KAAK,GAAG,CAAA,GAAI,GAAE,EAAE;AAAA,EACrE;AAEA,EAAA,IAAI,EAAA,KAAO,IAAA,IAAQ,EAAA,KAAO,GAAA,EAAK;AAC7B,IAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,MAAM,CAAA,GAAI,OAAO,KAAA,CAAM,CAAC,MAAM,QAAA,GAAW,KAAA,CAAM,CAAC,CAAA,GAAI,CAAA;AACpD,IAAA,IAAI,OAAO,OAAO,EAAE,MAAM,EAAE,CAAC,KAAK,GAAG,CAAA,GAAI,CAAA,EAAE,EAAG,MAAM,EAAE,CAAC,KAAK,GAAG,CAAA,GAAI,GAAE,EAAE;AAAA,EACzE;AAEA,EAAA,IAAI,EAAA,KAAO,KAAA,IAAS,EAAA,KAAO,IAAA,EAAM;AAC/B,IAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,MAAM,CAAA,GAAI,OAAO,KAAA,CAAM,CAAC,MAAM,QAAA,GAAW,KAAA,CAAM,CAAC,CAAA,GAAI,CAAA;AACpD,IAAA,IAAI,OAAO,OAAO,EAAE,IAAA,EAAM,EAAE,CAAC,KAAK,GAAG,CAAA,EAAE,EAAG,MAAM,EAAE,CAAC,KAAK,GAAG,CAAA,GAAI,GAAE,EAAE;AAAA,EACrE;AAEA,EAAA,IAAI,OAAO,KAAA,EAAO;AAChB,IAAA,MAAM,OAAQ,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA,CAAgB,MAAA,CAAO,MAAM,OAAO,CAAA;AAC/D,IAAA,IAAI,IAAA,CAAK,UAAU,CAAA,EAAG;AACpB,MAAA,MAAM,EAAA,GAAK,kBAAA,CAAmB,IAAA,CAAK,CAAC,CAAC,CAAA;AACrC,MAAA,MAAM,EAAA,GAAK,kBAAA,CAAmB,IAAA,CAAK,CAAC,CAAC,CAAA;AACrC,MAAA,OAAO,EAAE,IAAA,EAAM,EAAE,GAAG,EAAA,CAAG,IAAA,EAAM,GAAG,EAAA,CAAG,IAAA,EAAK,EAAG,IAAA,EAAM,EAAA,CAAG,IAAA,EAAK;AAAA,IAC3D;AACA,IAAA,IAAI,KAAK,MAAA,KAAW,CAAA,SAAU,kBAAA,CAAmB,IAAA,CAAK,CAAC,CAAC,CAAA;AAAA,EAC1D;AAEA,EAAA,IAAI,OAAO,IAAA,EAAM;AACf,IAAA,MAAM,OAAQ,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA,CAAgB,MAAA,CAAO,MAAM,OAAO,CAAA;AAC/D,IAAA,IAAI,IAAA,CAAK,UAAU,CAAA,EAAG;AACpB,MAAA,MAAM,EAAA,GAAK,kBAAA,CAAmB,IAAA,CAAK,CAAC,CAAC,CAAA;AACrC,MAAA,MAAM,EAAA,GAAK,kBAAA,CAAmB,IAAA,CAAK,CAAC,CAAC,CAAA;AACrC,MAAA,OAAO,EAAE,IAAA,EAAM,EAAA,CAAG,IAAA,EAAM,IAAA,EAAM,EAAE,GAAG,EAAA,CAAG,IAAA,EAAM,GAAG,EAAA,CAAG,IAAA,EAAK,EAAE;AAAA,IAC3D;AACA,IAAA,IAAI,KAAK,MAAA,KAAW,CAAA,SAAU,kBAAA,CAAmB,IAAA,CAAK,CAAC,CAAC,CAAA;AAAA,EAC1D;AAEA,EAAA,IAAI,OAAO,KAAA,EAAO;AAChB,IAAA,MAAM,KAAA,GAAQ,kBAAA,CAAmB,KAAA,CAAM,CAAC,CAAC,CAAA;AACzC,IAAA,OAAO,EAAE,IAAA,EAAM,KAAA,CAAM,IAAA,EAAM,IAAA,EAAM,MAAM,IAAA,EAAK;AAAA,EAC9C;AAEA,EAAA,OAAO,EAAE,IAAA,EAAM,EAAC,EAAG,IAAA,EAAM,EAAC,EAAE;AAC9B;;;AC7GA,IAAM,qBAAA,uBAA4B,GAAA,CAAI,CAAC,QAAQ,KAAA,EAAO,MAAA,EAAQ,IAAI,CAAC,CAAA;AAyB5D,SAAS,gBAAA,CACd,WAAA,EACA,YAAA,EACA,QAAA,GAAW,CAAA,EACgB;AAG3B,EAAA,MAAM,KAAA,GAAqB,CAAC,EAAE,KAAA,EAAO,cAAc,IAAA,EAAM,IAAI,CAAA;AAC7D,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAA0B;AAClD,EAAA,WAAA,CAAY,GAAA,CAAI,YAAA,EAAc,EAAE,CAAA;AAEhC,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,EAAE,KAAA,EAAO,IAAA,EAAK,GAAI,MAAM,KAAA,EAAM;AACpC,IAAA,IAAI,IAAA,CAAK,UAAU,QAAA,EAAU;AAE7B,IAAA,MAAM,WAAW,WAAA,CAAY,MAAA;AAAA,MAC3B,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,KAAA,IAAS,EAAE,KAAA,KAAU;AAAA,KACzC;AAEA,IAAA,KAAA,MAAW,cAAc,QAAA,EAAU;AACjC,MAAA,IAAI,WAAA,CAAY,GAAA,CAAI,UAAA,CAAW,EAAE,CAAA,EAAG;AAEpC,MAAA,MAAM,YAAA,GAAe,WAAW,aAAA,CAAc,IAAA,CAAK,CAAC,EAAA,KAAO,EAAA,CAAG,gBAAgB,IAAI,CAAA;AAClF,MAAA,MAAM,mBAAA,GACJ,UAAA,CAAW,QAAA,IACX,UAAA,CAAW,aAAA,CAAc,IAAA,CAAK,CAAC,CAAA,KAAM,qBAAA,CAAsB,GAAA,CAAI,CAAC,CAAC,CAAA;AAEnE,MAAA,MAAM,IAAA,GAAmB;AAAA,QACvB,OAAO,UAAA,CAAW,KAAA;AAAA,QAClB,SAAA,EAAW,KAAA;AAAA,QACX,SAAS,UAAA,CAAW,EAAA;AAAA,QACpB,IAAA,EAAM,cAAc,IAAA,IAAQ,MAAA;AAAA,QAC5B,eAAA,EAAiB,cAAc,WAAA,IAAe,MAAA;AAAA,QAC9C,eAAA,EAAiB,mBAAA;AAAA,QACjB,eAAe,UAAA,CAAW,aAAA,CAAc,MAAA,GAAS,CAAA,GAAI,WAAW,aAAA,GAAgB;AAAA,OAClF;AAEA,MAAA,MAAM,OAAA,GAAU,CAAC,GAAG,IAAA,EAAM,IAAI,CAAA;AAC9B,MAAA,WAAA,CAAY,GAAA,CAAI,UAAA,CAAW,EAAA,EAAI,OAAO,CAAA;AACtC,MAAA,KAAA,CAAM,KAAK,EAAE,KAAA,EAAO,WAAW,EAAA,EAAI,IAAA,EAAM,SAAS,CAAA;AAAA,IACpD;AAAA,EACF;AAEA,EAAA,OAAO,WAAA;AACT","file":"index.js","sourcesContent":["/**\n * State Graph Construction\n *\n * Build an adjacency list from state machine transitions.\n * Extracted from orbital-verify-unified/src/analyze.ts.\n *\n * @packageDocumentation\n */\n\nimport type { GraphTransition, StateEdge } from './types.js';\n\n/**\n * Build an adjacency list: state -> [{ event, to }].\n * Wildcard transitions (from === '*') are excluded since they\n * don't represent fixed edges in the graph.\n */\nexport function buildStateGraph(\n  transitions: GraphTransition[]\n): Map<string, StateEdge[]> {\n  const graph = new Map<string, StateEdge[]>();\n  for (const t of transitions) {\n    if (t.from === '*') continue;\n    if (!graph.has(t.from)) graph.set(t.from, []);\n    graph.get(t.from)!.push({ event: t.event, to: t.to });\n  }\n  return graph;\n}\n","/**\n * BFS Reachability Algorithms\n *\n * Breadth-first search over state machine graphs.\n * Extracted from orbital-verify-unified/src/analyze.ts and phase3-server.ts.\n *\n * @packageDocumentation\n */\n\nimport type { BFSNode, StateEdge } from './types.js';\nimport { buildStateGraph } from './graph.js';\nimport type { GraphTransition } from './types.js';\n\n/**\n * Collect all reachable states from an initial state via BFS.\n *\n * @param transitions - State machine transitions\n * @param initialState - Starting state\n * @param maxDepth - Maximum BFS depth (default: 5)\n * @returns Set of reachable state names\n */\nexport function collectReachableStates(\n  transitions: GraphTransition[],\n  initialState: string,\n  maxDepth = 5\n): Set<string> {\n  const graph = buildStateGraph(transitions);\n  const visited = new Set<string>([initialState]);\n  const queue: BFSNode[] = [{ state: initialState, depth: 0 }];\n\n  while (queue.length > 0) {\n    const current = queue.shift()!;\n    if (current.depth >= maxDepth) continue;\n\n    const edges = graph.get(current.state) ?? [];\n    for (const edge of edges) {\n      if (!visited.has(edge.to)) {\n        visited.add(edge.to);\n        queue.push({ state: edge.to, depth: current.depth + 1 });\n      }\n    }\n  }\n\n  return visited;\n}\n\n/**\n * Walk all (state, event) pairs reachable via BFS and invoke a callback for each.\n * Used by the server verification to POST each transition and check the response.\n *\n * @param transitions - State machine transitions\n * @param initialState - Starting state\n * @param maxDepth - Maximum BFS depth (default: 5)\n * @param visitor - Callback invoked for each (state, edge) pair.\n *   Return true to enqueue the target state for further exploration.\n */\nexport async function walkStatePairs(\n  transitions: GraphTransition[],\n  initialState: string,\n  maxDepth: number,\n  visitor: (state: string, edge: StateEdge, depth: number) => Promise<boolean>\n): Promise<{ visitedPairs: Set<string>; walkedEdges: number }> {\n  const graph = buildStateGraph(transitions);\n  const visitedPairs = new Set<string>();\n  const queue: BFSNode[] = [{ state: initialState, depth: 0 }];\n  let walkedEdges = 0;\n\n  while (queue.length > 0) {\n    const current = queue.shift()!;\n    if (current.depth >= maxDepth) continue;\n\n    const edges = graph.get(current.state) ?? [];\n    for (const edge of edges) {\n      const pairKey = `${current.state}:${edge.event}`;\n      if (visitedPairs.has(pairKey)) continue;\n      visitedPairs.add(pairKey);\n\n      const shouldEnqueue = await visitor(current.state, edge, current.depth);\n      walkedEdges++;\n\n      if (shouldEnqueue) {\n        const stateVisited = [...visitedPairs].some((k) => k.startsWith(`${edge.to}:`));\n        if (!stateVisited) {\n          queue.push({ state: edge.to, depth: current.depth + 1 });\n        }\n      }\n    }\n  }\n\n  return { visitedPairs, walkedEdges };\n}\n","/**\n * Guard Payload Builder\n *\n * Derive pass and fail payloads from guard s-expressions.\n * Extracted from orbital-verify-unified/src/analyze.ts.\n *\n * @packageDocumentation\n */\n\nimport type { GuardPayload } from './types.js';\n\n/**\n * Extract the first @payload path segment from a binding reference.\n * \"@payload.item\" -> \"item\", \"@payload.data.weight\" -> \"data\".\n * Returns null for non-payload refs (@entity, @state, @user, etc.).\n */\nexport function extractPayloadFieldRef(ref: unknown): string | null {\n  if (typeof ref !== 'string') return null;\n  const match = ref.match(/^@payload\\.([A-Za-z0-9_]+)/);\n  return match ? match[1] : null;\n}\n\n/**\n * Derive pass and fail payloads from a guard s-expression.\n *\n * Pass payload: satisfies the guard condition (transition fires).\n * Fail payload: violates the guard condition (transition is blocked).\n *\n * For @entity.* and @user.* guards: returns { pass: {}, fail: {} } because\n * these reference runtime state that cannot be directly faked in tests.\n *\n * Handles operators: not-nil, nil, eq, not-eq, gt, gte, lt, lte, and, or, not\n */\nexport function buildGuardPayloads(guard: unknown): GuardPayload {\n  if (!Array.isArray(guard) || guard.length === 0) {\n    return { pass: {}, fail: {} };\n  }\n\n  const op = String(guard[0]);\n\n  if (op === 'not-nil' || op === 'not_nil') {\n    const field = extractPayloadFieldRef(guard[1]);\n    if (field) return { pass: { [field]: 'mock-test-value' }, fail: { [field]: null } };\n  }\n\n  if (op === 'nil') {\n    const field = extractPayloadFieldRef(guard[1]);\n    if (field) return { pass: {}, fail: { [field]: 'mock-test-value' } };\n  }\n\n  if (op === 'eq' || op === '==' || op === '=') {\n    const field = extractPayloadFieldRef(guard[1]);\n    const val = guard[2];\n    if (field && val !== undefined) {\n      const failVal =\n        typeof val === 'number' ? val + 1\n        : typeof val === 'string' ? `not-${val}`\n        : null;\n      return { pass: { [field]: val }, fail: { [field]: failVal } };\n    }\n  }\n\n  if (op === 'not-eq' || op === '!=' || op === 'neq') {\n    const field = extractPayloadFieldRef(guard[1]);\n    const val = guard[2];\n    if (field && val !== undefined) {\n      const passVal =\n        typeof val === 'number' ? val + 1\n        : typeof val === 'string' ? `not-${val}`\n        : 'other';\n      return { pass: { [field]: passVal }, fail: { [field]: val } };\n    }\n  }\n\n  if (op === 'gt' || op === '>') {\n    const field = extractPayloadFieldRef(guard[1]);\n    const n = typeof guard[2] === 'number' ? guard[2] : 0;\n    if (field) return { pass: { [field]: n + 1 }, fail: { [field]: n - 1 } };\n  }\n\n  if (op === 'gte' || op === '>=') {\n    const field = extractPayloadFieldRef(guard[1]);\n    const n = typeof guard[2] === 'number' ? guard[2] : 0;\n    if (field) return { pass: { [field]: n }, fail: { [field]: n - 1 } };\n  }\n\n  if (op === 'lt' || op === '<') {\n    const field = extractPayloadFieldRef(guard[1]);\n    const n = typeof guard[2] === 'number' ? guard[2] : 0;\n    if (field) return { pass: { [field]: n - 1 }, fail: { [field]: n + 1 } };\n  }\n\n  if (op === 'lte' || op === '<=') {\n    const field = extractPayloadFieldRef(guard[1]);\n    const n = typeof guard[2] === 'number' ? guard[2] : 0;\n    if (field) return { pass: { [field]: n }, fail: { [field]: n + 1 } };\n  }\n\n  if (op === 'and') {\n    const subs = (guard.slice(1) as unknown[]).filter(Array.isArray);\n    if (subs.length >= 2) {\n      const s1 = buildGuardPayloads(subs[0]);\n      const s2 = buildGuardPayloads(subs[1]);\n      return { pass: { ...s1.pass, ...s2.pass }, fail: s1.fail };\n    }\n    if (subs.length === 1) return buildGuardPayloads(subs[0]);\n  }\n\n  if (op === 'or') {\n    const subs = (guard.slice(1) as unknown[]).filter(Array.isArray);\n    if (subs.length >= 2) {\n      const s1 = buildGuardPayloads(subs[0]);\n      const s2 = buildGuardPayloads(subs[1]);\n      return { pass: s1.pass, fail: { ...s1.fail, ...s2.fail } };\n    }\n    if (subs.length === 1) return buildGuardPayloads(subs[0]);\n  }\n\n  if (op === 'not') {\n    const inner = buildGuardPayloads(guard[1]);\n    return { pass: inner.fail, fail: inner.pass };\n  }\n\n  return { pass: {}, fail: {} };\n}\n","/**\n * Replay Path Builder\n *\n * Compute the shortest path (replay steps) from an initial state\n * to every reachable state in a state machine. Used by browser\n * verification to navigate through states before running assertions.\n *\n * Extracted from orbital-verify-unified/src/analyze.ts (collectDataMutationTests).\n *\n * @packageDocumentation\n */\n\nimport type { GraphTransition, ReplayStep, PayloadFieldSchema } from './types.js';\n\n/** Entity-data sentinel payload fields: presence means transition needs a selected row */\nconst ENTITY_PAYLOAD_FIELDS = new Set(['data', 'row', 'item', 'id']);\n\n/**\n * Extended transition with render and payload info needed for replay path building.\n * Compatible with orbital-verify's UnifiedTransition.\n */\nexport interface ReplayTransition extends GraphTransition {\n  hasGuard: boolean;\n  guard?: unknown[];\n  payloadFields: string[];\n  payloadSchema: PayloadFieldSchema[];\n  renderEffects: Array<{\n    slot: string;\n    patternType: string | null;\n  }>;\n}\n\n/**\n * Build the shortest replay path from initialState to every reachable state.\n *\n * @param transitions - Transitions with render/payload info\n * @param initialState - Starting state\n * @param maxDepth - Maximum path length (default: 3, shorter than BFS exploration)\n * @returns Map of state -> replay steps to reach it\n */\nexport function buildReplayPaths(\n  transitions: ReplayTransition[],\n  initialState: string,\n  maxDepth = 3\n): Map<string, ReplayStep[]> {\n  type QueueNode = { state: string; path: ReplayStep[] };\n\n  const queue: QueueNode[] = [{ state: initialState, path: [] }];\n  const replayPaths = new Map<string, ReplayStep[]>();\n  replayPaths.set(initialState, []);\n\n  while (queue.length > 0) {\n    const { state, path } = queue.shift()!;\n    if (path.length >= maxDepth) continue;\n\n    const fromHere = transitions.filter(\n      (t) => t.from === state && t.event !== 'INIT',\n    );\n\n    for (const transition of fromHere) {\n      if (replayPaths.has(transition.to)) continue;\n\n      const renderEffect = transition.renderEffects.find((re) => re.patternType !== null);\n      const stepNeedsEntityData =\n        transition.hasGuard ||\n        transition.payloadFields.some((f) => ENTITY_PAYLOAD_FIELDS.has(f));\n\n      const step: ReplayStep = {\n        event: transition.event,\n        fromState: state,\n        toState: transition.to,\n        slot: renderEffect?.slot ?? 'main',\n        expectedPattern: renderEffect?.patternType ?? undefined,\n        needsEntityData: stepNeedsEntityData,\n        payloadSchema: transition.payloadSchema.length > 0 ? transition.payloadSchema : undefined,\n      };\n\n      const newPath = [...path, step];\n      replayPaths.set(transition.to, newPath);\n      queue.push({ state: transition.to, path: newPath });\n    }\n  }\n\n  return replayPaths;\n}\n"]}
+{"version":3,"sources":["../../src/state-machine/graph.ts","../../src/state-machine/bfs.ts","../../src/state-machine/guard-payloads.ts","../../src/state-machine/replay-paths.ts"],"names":[],"mappings":";AA2BO,SAAS,gBACd,WAAA,EAC0B;AAC1B,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAyB;AAC3C,EAAA,KAAA,MAAW,KAAK,WAAA,EAAa;AAC3B,IAAA,IAAI,CAAA,CAAE,SAAS,GAAA,EAAK;AACpB,IAAA,IAAI,CAAC,KAAA,CAAM,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,EAAG,KAAA,CAAM,GAAA,CAAI,CAAA,CAAE,IAAA,EAAM,EAAE,CAAA;AAC5C,IAAA,KAAA,CAAM,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,CAAG,IAAA,CAAK,EAAE,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAA;AAAA,EACtD;AACA,EAAA,OAAO,KAAA;AACT;;;ACRO,SAAS,sBAAA,CACd,WAAA,EACA,YAAA,EACA,QAAA,GAAW,CAAA,EACE;AACb,EAAA,MAAM,KAAA,GAAQ,gBAAgB,WAAW,CAAA;AACzC,EAAA,MAAM,OAAA,mBAAU,IAAI,GAAA,CAAY,CAAC,YAAY,CAAC,CAAA;AAC9C,EAAA,MAAM,QAAmB,CAAC,EAAE,OAAO,YAAA,EAAc,KAAA,EAAO,GAAG,CAAA;AAE3D,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,OAAA,GAAU,MAAM,KAAA,EAAM;AAC5B,IAAA,IAAI,OAAA,CAAQ,SAAS,QAAA,EAAU;AAE/B,IAAA,MAAM,QAAQ,KAAA,CAAM,GAAA,CAAI,OAAA,CAAQ,KAAK,KAAK,EAAC;AAC3C,IAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,MAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AACzB,QAAA,OAAA,CAAQ,GAAA,CAAI,KAAK,EAAE,CAAA;AACnB,QAAA,KAAA,CAAM,IAAA,CAAK,EAAE,KAAA,EAAO,IAAA,CAAK,IAAI,KAAA,EAAO,OAAA,CAAQ,KAAA,GAAQ,CAAA,EAAG,CAAA;AAAA,MACzD;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,OAAA;AACT;AAsBA,eAAsB,cAAA,CACpB,WAAA,EACA,YAAA,EACA,QAAA,EACA,OAAA,EAC6D;AAC7D,EAAA,MAAM,KAAA,GAAQ,gBAAgB,WAAW,CAAA;AACzC,EAAA,MAAM,YAAA,uBAAmB,GAAA,EAAY;AACrC,EAAA,MAAM,QAAmB,CAAC,EAAE,OAAO,YAAA,EAAc,KAAA,EAAO,GAAG,CAAA;AAC3D,EAAA,IAAI,WAAA,GAAc,CAAA;AAElB,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,OAAA,GAAU,MAAM,KAAA,EAAM;AAC5B,IAAA,IAAI,OAAA,CAAQ,SAAS,QAAA,EAAU;AAE/B,IAAA,MAAM,QAAQ,KAAA,CAAM,GAAA,CAAI,OAAA,CAAQ,KAAK,KAAK,EAAC;AAC3C,IAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,MAAA,MAAM,UAAU,CAAA,EAAG,OAAA,CAAQ,KAAK,CAAA,CAAA,EAAI,KAAK,KAAK,CAAA,CAAA;AAC9C,MAAA,IAAI,YAAA,CAAa,GAAA,CAAI,OAAO,CAAA,EAAG;AAC/B,MAAA,YAAA,CAAa,IAAI,OAAO,CAAA;AAExB,MAAA,MAAM,gBAAgB,MAAM,OAAA,CAAQ,QAAQ,KAAA,EAAO,IAAA,EAAM,QAAQ,KAAK,CAAA;AACtE,MAAA,WAAA,EAAA;AAEA,MAAA,IAAI,aAAA,EAAe;AACjB,QAAA,MAAM,YAAA,GAAe,CAAC,GAAG,YAAY,EAAE,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,UAAA,CAAW,CAAA,EAAG,IAAA,CAAK,EAAE,GAAG,CAAC,CAAA;AAC9E,QAAA,IAAI,CAAC,YAAA,EAAc;AACjB,UAAA,KAAA,CAAM,IAAA,CAAK,EAAE,KAAA,EAAO,IAAA,CAAK,IAAI,KAAA,EAAO,OAAA,CAAQ,KAAA,GAAQ,CAAA,EAAG,CAAA;AAAA,QACzD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,cAAc,WAAA,EAAY;AACrC;;;ACjFO,SAAS,uBAAuB,GAAA,EAA6B;AAClE,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,EAAU,OAAO,IAAA;AACpC,EAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,KAAA,CAAM,4BAA4B,CAAA;AACpD,EAAA,OAAO,KAAA,GAAQ,KAAA,CAAM,CAAC,CAAA,GAAI,IAAA;AAC5B;AA8BO,SAAS,mBAAmB,KAAA,EAA8B;AAC/D,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,IAAK,KAAA,CAAM,WAAW,CAAA,EAAG;AAC/C,IAAA,OAAO,EAAE,IAAA,EAAM,EAAC,EAAG,IAAA,EAAM,EAAC,EAAE;AAAA,EAC9B;AAEA,EAAA,MAAM,EAAA,GAAK,MAAA,CAAO,KAAA,CAAM,CAAC,CAAC,CAAA;AAE1B,EAAA,IAAI,EAAA,KAAO,SAAA,IAAa,EAAA,KAAO,SAAA,EAAW;AACxC,IAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,IAAI,OAAO,OAAO,EAAE,IAAA,EAAM,EAAE,CAAC,KAAK,GAAG,iBAAA,EAAkB,EAAG,MAAM,EAAE,CAAC,KAAK,GAAG,MAAK,EAAE;AAAA,EACpF;AAEA,EAAA,IAAI,OAAO,KAAA,EAAO;AAChB,IAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,IAAI,KAAA,EAAO,OAAO,EAAE,IAAA,EAAM,EAAC,EAAG,IAAA,EAAM,EAAE,CAAC,KAAK,GAAG,iBAAA,EAAkB,EAAE;AAAA,EACrE;AAEA,EAAA,IAAI,EAAA,KAAO,IAAA,IAAQ,EAAA,KAAO,IAAA,IAAQ,OAAO,GAAA,EAAK;AAC5C,IAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,MAAM,GAAA,GAAM,MAAM,CAAC,CAAA;AACnB,IAAA,IAAI,KAAA,IAAS,QAAQ,MAAA,EAAW;AAC9B,MAAA,MAAM,OAAA,GACJ,OAAO,GAAA,KAAQ,QAAA,GAAW,GAAA,GAAM,CAAA,GAC9B,OAAO,GAAA,KAAQ,QAAA,GAAW,CAAA,IAAA,EAAO,GAAG,CAAA,CAAA,GACpC,IAAA;AACJ,MAAA,OAAO,EAAE,IAAA,EAAM,EAAE,CAAC,KAAK,GAAG,GAAA,EAAI,EAAG,IAAA,EAAM,EAAE,CAAC,KAAK,GAAG,SAAQ,EAAE;AAAA,IAC9D;AAAA,EACF;AAEA,EAAA,IAAI,EAAA,KAAO,QAAA,IAAY,EAAA,KAAO,IAAA,IAAQ,OAAO,KAAA,EAAO;AAClD,IAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,MAAM,GAAA,GAAM,MAAM,CAAC,CAAA;AACnB,IAAA,IAAI,KAAA,IAAS,QAAQ,MAAA,EAAW;AAC9B,MAAA,MAAM,OAAA,GACJ,OAAO,GAAA,KAAQ,QAAA,GAAW,GAAA,GAAM,CAAA,GAC9B,OAAO,GAAA,KAAQ,QAAA,GAAW,CAAA,IAAA,EAAO,GAAG,CAAA,CAAA,GACpC,OAAA;AACJ,MAAA,OAAO,EAAE,IAAA,EAAM,EAAE,CAAC,KAAK,GAAG,OAAA,EAAQ,EAAG,IAAA,EAAM,EAAE,CAAC,KAAK,GAAG,KAAI,EAAE;AAAA,IAC9D;AAAA,EACF;AAEA,EAAA,IAAI,EAAA,KAAO,IAAA,IAAQ,EAAA,KAAO,GAAA,EAAK;AAC7B,IAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,MAAM,CAAA,GAAI,OAAO,KAAA,CAAM,CAAC,MAAM,QAAA,GAAW,KAAA,CAAM,CAAC,CAAA,GAAI,CAAA;AACpD,IAAA,IAAI,OAAO,OAAO,EAAE,MAAM,EAAE,CAAC,KAAK,GAAG,CAAA,GAAI,CAAA,EAAE,EAAG,MAAM,EAAE,CAAC,KAAK,GAAG,CAAA,GAAI,GAAE,EAAE;AAAA,EACzE;AAEA,EAAA,IAAI,EAAA,KAAO,KAAA,IAAS,EAAA,KAAO,IAAA,EAAM;AAC/B,IAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,MAAM,CAAA,GAAI,OAAO,KAAA,CAAM,CAAC,MAAM,QAAA,GAAW,KAAA,CAAM,CAAC,CAAA,GAAI,CAAA;AACpD,IAAA,IAAI,OAAO,OAAO,EAAE,IAAA,EAAM,EAAE,CAAC,KAAK,GAAG,CAAA,EAAE,EAAG,MAAM,EAAE,CAAC,KAAK,GAAG,CAAA,GAAI,GAAE,EAAE;AAAA,EACrE;AAEA,EAAA,IAAI,EAAA,KAAO,IAAA,IAAQ,EAAA,KAAO,GAAA,EAAK;AAC7B,IAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,MAAM,CAAA,GAAI,OAAO,KAAA,CAAM,CAAC,MAAM,QAAA,GAAW,KAAA,CAAM,CAAC,CAAA,GAAI,CAAA;AACpD,IAAA,IAAI,OAAO,OAAO,EAAE,MAAM,EAAE,CAAC,KAAK,GAAG,CAAA,GAAI,CAAA,EAAE,EAAG,MAAM,EAAE,CAAC,KAAK,GAAG,CAAA,GAAI,GAAE,EAAE;AAAA,EACzE;AAEA,EAAA,IAAI,EAAA,KAAO,KAAA,IAAS,EAAA,KAAO,IAAA,EAAM;AAC/B,IAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C,IAAA,MAAM,CAAA,GAAI,OAAO,KAAA,CAAM,CAAC,MAAM,QAAA,GAAW,KAAA,CAAM,CAAC,CAAA,GAAI,CAAA;AACpD,IAAA,IAAI,OAAO,OAAO,EAAE,IAAA,EAAM,EAAE,CAAC,KAAK,GAAG,CAAA,EAAE,EAAG,MAAM,EAAE,CAAC,KAAK,GAAG,CAAA,GAAI,GAAE,EAAE;AAAA,EACrE;AAEA,EAAA,IAAI,OAAO,KAAA,EAAO;AAChB,IAAA,MAAM,OAAQ,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA,CAAgB,MAAA,CAAO,MAAM,OAAO,CAAA;AAC/D,IAAA,IAAI,IAAA,CAAK,UAAU,CAAA,EAAG;AACpB,MAAA,MAAM,EAAA,GAAK,kBAAA,CAAmB,IAAA,CAAK,CAAC,CAAC,CAAA;AACrC,MAAA,MAAM,EAAA,GAAK,kBAAA,CAAmB,IAAA,CAAK,CAAC,CAAC,CAAA;AACrC,MAAA,OAAO,EAAE,IAAA,EAAM,EAAE,GAAG,EAAA,CAAG,IAAA,EAAM,GAAG,EAAA,CAAG,IAAA,EAAK,EAAG,IAAA,EAAM,EAAA,CAAG,IAAA,EAAK;AAAA,IAC3D;AACA,IAAA,IAAI,KAAK,MAAA,KAAW,CAAA,SAAU,kBAAA,CAAmB,IAAA,CAAK,CAAC,CAAC,CAAA;AAAA,EAC1D;AAEA,EAAA,IAAI,OAAO,IAAA,EAAM;AACf,IAAA,MAAM,OAAQ,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA,CAAgB,MAAA,CAAO,MAAM,OAAO,CAAA;AAC/D,IAAA,IAAI,IAAA,CAAK,UAAU,CAAA,EAAG;AACpB,MAAA,MAAM,EAAA,GAAK,kBAAA,CAAmB,IAAA,CAAK,CAAC,CAAC,CAAA;AACrC,MAAA,MAAM,EAAA,GAAK,kBAAA,CAAmB,IAAA,CAAK,CAAC,CAAC,CAAA;AACrC,MAAA,OAAO,EAAE,IAAA,EAAM,EAAA,CAAG,IAAA,EAAM,IAAA,EAAM,EAAE,GAAG,EAAA,CAAG,IAAA,EAAM,GAAG,EAAA,CAAG,IAAA,EAAK,EAAE;AAAA,IAC3D;AACA,IAAA,IAAI,KAAK,MAAA,KAAW,CAAA,SAAU,kBAAA,CAAmB,IAAA,CAAK,CAAC,CAAC,CAAA;AAAA,EAC1D;AAEA,EAAA,IAAI,OAAO,KAAA,EAAO;AAChB,IAAA,MAAM,KAAA,GAAQ,kBAAA,CAAmB,KAAA,CAAM,CAAC,CAAC,CAAA;AACzC,IAAA,OAAO,EAAE,IAAA,EAAM,KAAA,CAAM,IAAA,EAAM,IAAA,EAAM,MAAM,IAAA,EAAK;AAAA,EAC9C;AAEA,EAAA,OAAO,EAAE,IAAA,EAAM,EAAC,EAAG,IAAA,EAAM,EAAC,EAAE;AAC9B;;;ACzIA,IAAM,qBAAA,uBAA4B,GAAA,CAAI,CAAC,QAAQ,KAAA,EAAO,MAAA,EAAQ,IAAI,CAAC,CAAA;AA0C5D,SAAS,gBAAA,CACd,WAAA,EACA,YAAA,EACA,QAAA,GAAW,CAAA,EACgB;AAG3B,EAAA,MAAM,KAAA,GAAqB,CAAC,EAAE,KAAA,EAAO,cAAc,IAAA,EAAM,IAAI,CAAA;AAC7D,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAA0B;AAClD,EAAA,WAAA,CAAY,GAAA,CAAI,YAAA,EAAc,EAAE,CAAA;AAEhC,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,EAAE,KAAA,EAAO,IAAA,EAAK,GAAI,MAAM,KAAA,EAAM;AACpC,IAAA,IAAI,IAAA,CAAK,UAAU,QAAA,EAAU;AAE7B,IAAA,MAAM,WAAW,WAAA,CAAY,MAAA;AAAA,MAC3B,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,KAAA,IAAS,EAAE,KAAA,KAAU;AAAA,KACzC;AAEA,IAAA,KAAA,MAAW,cAAc,QAAA,EAAU;AACjC,MAAA,IAAI,WAAA,CAAY,GAAA,CAAI,UAAA,CAAW,EAAE,CAAA,EAAG;AAEpC,MAAA,MAAM,YAAA,GAAe,WAAW,aAAA,CAAc,IAAA,CAAK,CAAC,EAAA,KAAO,EAAA,CAAG,gBAAgB,IAAI,CAAA;AAClF,MAAA,MAAM,mBAAA,GACJ,UAAA,CAAW,QAAA,IACX,UAAA,CAAW,aAAA,CAAc,IAAA,CAAK,CAAC,CAAA,KAAM,qBAAA,CAAsB,GAAA,CAAI,CAAC,CAAC,CAAA;AAEnE,MAAA,MAAM,IAAA,GAAmB;AAAA,QACvB,OAAO,UAAA,CAAW,KAAA;AAAA,QAClB,SAAA,EAAW,KAAA;AAAA,QACX,SAAS,UAAA,CAAW,EAAA;AAAA,QACpB,IAAA,EAAM,cAAc,IAAA,IAAQ,MAAA;AAAA,QAC5B,eAAA,EAAiB,cAAc,WAAA,IAAe,MAAA;AAAA,QAC9C,eAAA,EAAiB,mBAAA;AAAA,QACjB,eAAe,UAAA,CAAW,aAAA,CAAc,MAAA,GAAS,CAAA,GAAI,WAAW,aAAA,GAAgB;AAAA,OAClF;AAEA,MAAA,MAAM,OAAA,GAAU,CAAC,GAAG,IAAA,EAAM,IAAI,CAAA;AAC9B,MAAA,WAAA,CAAY,GAAA,CAAI,UAAA,CAAW,EAAA,EAAI,OAAO,CAAA;AACtC,MAAA,KAAA,CAAM,KAAK,EAAE,KAAA,EAAO,WAAW,EAAA,EAAI,IAAA,EAAM,SAAS,CAAA;AAAA,IACpD;AAAA,EACF;AAEA,EAAA,OAAO,WAAA;AACT","file":"index.js","sourcesContent":["/**\n * State Graph Construction\n *\n * Build an adjacency list from state machine transitions.\n * Extracted from orbital-verify-unified/src/analyze.ts.\n *\n * @packageDocumentation\n */\n\nimport type { GraphTransition, StateEdge } from './types.js';\n\n/**\n * Builds an adjacency list from state machine transitions.\n * \n * Constructs a state transition graph where each state maps to an array\n * of outgoing edges (events and target states). Wildcard transitions\n * (from === '*') are excluded since they don't represent fixed edges.\n * Used as the foundation for state machine analysis, traversal, and verification.\n * \n * @param {GraphTransition[]} transitions - Array of state transitions\n * @returns {Map<string, StateEdge[]>} State transition graph\n * \n * @example\n * const graph = buildStateGraph(transitions);\n * const edgesFromInitial = graph.get('initial'); // Array of outgoing edges\n * console.log(`Initial state has ${edgesFromInitial?.length} transitions`);\n */\nexport function buildStateGraph(\n  transitions: GraphTransition[]\n): Map<string, StateEdge[]> {\n  const graph = new Map<string, StateEdge[]>();\n  for (const t of transitions) {\n    if (t.from === '*') continue;\n    if (!graph.has(t.from)) graph.set(t.from, []);\n    graph.get(t.from)!.push({ event: t.event, to: t.to });\n  }\n  return graph;\n}\n","/**\n * BFS Reachability Algorithms\n *\n * Breadth-first search over state machine graphs.\n * Extracted from orbital-verify-unified/src/analyze.ts and phase3-server.ts.\n *\n * @packageDocumentation\n */\n\nimport type { BFSNode, StateEdge } from './types.js';\nimport { buildStateGraph } from './graph.js';\nimport type { GraphTransition } from './types.js';\n\n/**\n * Collects all reachable states from an initial state using breadth-first search.\n * \n * Performs BFS traversal of the state machine to find all states reachable\n * from the initial state, up to the specified maximum depth. Used for\n * state machine analysis, verification, and test coverage assessment.\n * \n * @param {GraphTransition[]} transitions - Array of state transitions\n * @param {string} initialState - Starting state name\n * @param {number} [maxDepth=5] - Maximum search depth\n * @returns {Set<string>} Set of reachable state names\n * \n * @example\n * const reachable = collectReachableStates(transitions, 'initial', 10);\n * console.log('Reachable states:', Array.from(reachable));\n */\nexport function collectReachableStates(\n  transitions: GraphTransition[],\n  initialState: string,\n  maxDepth = 5\n): Set<string> {\n  const graph = buildStateGraph(transitions);\n  const visited = new Set<string>([initialState]);\n  const queue: BFSNode[] = [{ state: initialState, depth: 0 }];\n\n  while (queue.length > 0) {\n    const current = queue.shift()!;\n    if (current.depth >= maxDepth) continue;\n\n    const edges = graph.get(current.state) ?? [];\n    for (const edge of edges) {\n      if (!visited.has(edge.to)) {\n        visited.add(edge.to);\n        queue.push({ state: edge.to, depth: current.depth + 1 });\n      }\n    }\n  }\n\n  return visited;\n}\n\n/**\n * Walks all reachable (state, event) pairs using BFS and invokes callback for each.\n * \n * Traverses the state machine using breadth-first search and calls the visitor\n * function for each (state, edge) pair encountered. Used by server verification\n * to test transitions by POSTing to endpoints and checking responses.\n * \n * @param {GraphTransition[]} transitions - Array of state transitions\n * @param {string} initialState - Starting state name\n * @param {number} maxDepth - Maximum BFS depth\n * @param {(state: string, edge: StateEdge, depth: number) => Promise<boolean>} visitor - Callback for each pair\n * @returns {Promise<{ visitedPairs: Set<string>; walkedEdges: number }>} Traversal statistics\n * \n * @example\n * const result = await walkStatePairs(transitions, 'initial', 5, async (state, edge) => {\n *   console.log(`Transition: ${state} --${edge.event}--> ${edge.to}`);\n *   return true; // Continue exploration\n * });\n * console.log(`Visited ${result.visitedPairs.size} state-event pairs`);\n */\nexport async function walkStatePairs(\n  transitions: GraphTransition[],\n  initialState: string,\n  maxDepth: number,\n  visitor: (state: string, edge: StateEdge, depth: number) => Promise<boolean>\n): Promise<{ visitedPairs: Set<string>; walkedEdges: number }> {\n  const graph = buildStateGraph(transitions);\n  const visitedPairs = new Set<string>();\n  const queue: BFSNode[] = [{ state: initialState, depth: 0 }];\n  let walkedEdges = 0;\n\n  while (queue.length > 0) {\n    const current = queue.shift()!;\n    if (current.depth >= maxDepth) continue;\n\n    const edges = graph.get(current.state) ?? [];\n    for (const edge of edges) {\n      const pairKey = `${current.state}:${edge.event}`;\n      if (visitedPairs.has(pairKey)) continue;\n      visitedPairs.add(pairKey);\n\n      const shouldEnqueue = await visitor(current.state, edge, current.depth);\n      walkedEdges++;\n\n      if (shouldEnqueue) {\n        const stateVisited = [...visitedPairs].some((k) => k.startsWith(`${edge.to}:`));\n        if (!stateVisited) {\n          queue.push({ state: edge.to, depth: current.depth + 1 });\n        }\n      }\n    }\n  }\n\n  return { visitedPairs, walkedEdges };\n}\n","/**\n * Guard Payload Builder\n *\n * Derive pass and fail payloads from guard s-expressions.\n * Extracted from orbital-verify-unified/src/analyze.ts.\n *\n * @packageDocumentation\n */\n\nimport type { GuardPayload } from './types.js';\n\n/**\n * Extracts the first segment of a payload field reference.\n * \n * Parses binding references in the format \"@payload.field\" and extracts\n * the first field name segment. Used for identifying payload fields in\n * guard conditions for test data generation.\n * \n * @param {unknown} ref - Binding reference to extract from\n * @returns {string | null} First field segment or null for non-payload references\n * \n * @example\n * extractPayloadFieldRef('@payload.item'); // returns 'item'\n * extractPayloadFieldRef('@payload.data.weight'); // returns 'data'\n * extractPayloadFieldRef('@entity.id'); // returns null\n * extractPayloadFieldRef('@user.name'); // returns null\n */\nexport function extractPayloadFieldRef(ref: unknown): string | null {\n  if (typeof ref !== 'string') return null;\n  const match = ref.match(/^@payload\\.([A-Za-z0-9_]+)/);\n  return match ? match[1] : null;\n}\n\n/**\n * Builds test payloads that satisfy or violate guard conditions.\n * \n * Generates pass/fail test data for guard s-expressions used in state machine\n * transitions. Pass payloads satisfy the guard condition (allowing transition),\n * fail payloads violate it (blocking transition). Used for automated testing\n * and validation of state machine behavior.\n * \n * Supports operators: not-nil, nil, eq, not-eq, gt, gte, lt, lte, and, or, not\n * \n * @param {unknown} guard - Guard s-expression to analyze\n * @returns {GuardPayload} Object with pass and fail payloads\n * \n * @example\n * // Guard: ['not-nil', '@payload.completed']\n * buildGuardPayloads(['not-nil', '@payload.completed']);\n * // Returns: { pass: { completed: 'mock-test-value' }, fail: { completed: null } }\n * \n * @example\n * // Guard: ['eq', '@payload.status', 'active']\n * buildGuardPayloads(['eq', '@payload.status', 'active']);\n * // Returns: { pass: { status: 'active' }, fail: { status: 'not-active' } }\n * \n * @example\n * // Guard: ['and', ['not-nil', '@payload.id'], ['eq', '@payload.status', 'ready']]\n * buildGuardPayloads(['and', ['not-nil', '@payload.id'], ['eq', '@payload.status', 'ready']]);\n * // Returns: { pass: { id: 'mock-test-value', status: 'ready' }, fail: { id: null } }\n */\nexport function buildGuardPayloads(guard: unknown): GuardPayload {\n  if (!Array.isArray(guard) || guard.length === 0) {\n    return { pass: {}, fail: {} };\n  }\n\n  const op = String(guard[0]);\n\n  if (op === 'not-nil' || op === 'not_nil') {\n    const field = extractPayloadFieldRef(guard[1]);\n    if (field) return { pass: { [field]: 'mock-test-value' }, fail: { [field]: null } };\n  }\n\n  if (op === 'nil') {\n    const field = extractPayloadFieldRef(guard[1]);\n    if (field) return { pass: {}, fail: { [field]: 'mock-test-value' } };\n  }\n\n  if (op === 'eq' || op === '==' || op === '=') {\n    const field = extractPayloadFieldRef(guard[1]);\n    const val = guard[2];\n    if (field && val !== undefined) {\n      const failVal =\n        typeof val === 'number' ? val + 1\n        : typeof val === 'string' ? `not-${val}`\n        : null;\n      return { pass: { [field]: val }, fail: { [field]: failVal } };\n    }\n  }\n\n  if (op === 'not-eq' || op === '!=' || op === 'neq') {\n    const field = extractPayloadFieldRef(guard[1]);\n    const val = guard[2];\n    if (field && val !== undefined) {\n      const passVal =\n        typeof val === 'number' ? val + 1\n        : typeof val === 'string' ? `not-${val}`\n        : 'other';\n      return { pass: { [field]: passVal }, fail: { [field]: val } };\n    }\n  }\n\n  if (op === 'gt' || op === '>') {\n    const field = extractPayloadFieldRef(guard[1]);\n    const n = typeof guard[2] === 'number' ? guard[2] : 0;\n    if (field) return { pass: { [field]: n + 1 }, fail: { [field]: n - 1 } };\n  }\n\n  if (op === 'gte' || op === '>=') {\n    const field = extractPayloadFieldRef(guard[1]);\n    const n = typeof guard[2] === 'number' ? guard[2] : 0;\n    if (field) return { pass: { [field]: n }, fail: { [field]: n - 1 } };\n  }\n\n  if (op === 'lt' || op === '<') {\n    const field = extractPayloadFieldRef(guard[1]);\n    const n = typeof guard[2] === 'number' ? guard[2] : 0;\n    if (field) return { pass: { [field]: n - 1 }, fail: { [field]: n + 1 } };\n  }\n\n  if (op === 'lte' || op === '<=') {\n    const field = extractPayloadFieldRef(guard[1]);\n    const n = typeof guard[2] === 'number' ? guard[2] : 0;\n    if (field) return { pass: { [field]: n }, fail: { [field]: n + 1 } };\n  }\n\n  if (op === 'and') {\n    const subs = (guard.slice(1) as unknown[]).filter(Array.isArray);\n    if (subs.length >= 2) {\n      const s1 = buildGuardPayloads(subs[0]);\n      const s2 = buildGuardPayloads(subs[1]);\n      return { pass: { ...s1.pass, ...s2.pass }, fail: s1.fail };\n    }\n    if (subs.length === 1) return buildGuardPayloads(subs[0]);\n  }\n\n  if (op === 'or') {\n    const subs = (guard.slice(1) as unknown[]).filter(Array.isArray);\n    if (subs.length >= 2) {\n      const s1 = buildGuardPayloads(subs[0]);\n      const s2 = buildGuardPayloads(subs[1]);\n      return { pass: s1.pass, fail: { ...s1.fail, ...s2.fail } };\n    }\n    if (subs.length === 1) return buildGuardPayloads(subs[0]);\n  }\n\n  if (op === 'not') {\n    const inner = buildGuardPayloads(guard[1]);\n    return { pass: inner.fail, fail: inner.pass };\n  }\n\n  return { pass: {}, fail: {} };\n}\n","/**\n * Replay Path Builder\n *\n * Compute the shortest path (replay steps) from an initial state\n * to every reachable state in a state machine. Used by browser\n * verification to navigate through states before running assertions.\n *\n * Extracted from orbital-verify-unified/src/analyze.ts (collectDataMutationTests).\n *\n * @packageDocumentation\n */\n\nimport type { GraphTransition, ReplayStep, PayloadFieldSchema } from './types.js';\n\n/** Entity-data sentinel payload fields: presence means transition needs a selected row */\nconst ENTITY_PAYLOAD_FIELDS = new Set(['data', 'row', 'item', 'id']);\n\n/**\n * Extended transition with render and payload info needed for replay path building.\n * Compatible with orbital-verify's UnifiedTransition.\n */\nexport interface ReplayTransition extends GraphTransition {\n  hasGuard: boolean;\n  guard?: unknown[];\n  payloadFields: string[];\n  payloadSchema: PayloadFieldSchema[];\n  renderEffects: Array<{\n    slot: string;\n    patternType: string | null;\n  }>;\n}\n\n/**\n * Builds the shortest replay paths from initial state to all reachable states.\n * \n * Computes step-by-step navigation paths for state machine testing and verification.\n * Uses breadth-first search to find shortest paths up to specified depth limit.\n * Each path contains replay steps with event, state, and payload information\n * needed to reproduce state transitions in tests.\n * \n * @param {ReplayTransition[]} transitions - Transitions with render/payload information\n * @param {string} initialState - Starting state name\n * @param {number} [maxDepth=3] - Maximum path length (default: 3)\n * @returns {Map<string, ReplayStep[]>} Map of state names to replay step arrays\n * \n * @example\n * // Build paths from 'initial' state\n * const paths = buildReplayPaths(transitions, 'initial', 5);\n * \n * // Get steps to reach 'completed' state\n * const stepsToComplete = paths.get('completed');\n * \n * // Execute replay steps\n * for (const step of stepsToComplete) {\n *   await dispatchEvent(step.event, step.payload);\n * }\n */\nexport function buildReplayPaths(\n  transitions: ReplayTransition[],\n  initialState: string,\n  maxDepth = 3\n): Map<string, ReplayStep[]> {\n  type QueueNode = { state: string; path: ReplayStep[] };\n\n  const queue: QueueNode[] = [{ state: initialState, path: [] }];\n  const replayPaths = new Map<string, ReplayStep[]>();\n  replayPaths.set(initialState, []);\n\n  while (queue.length > 0) {\n    const { state, path } = queue.shift()!;\n    if (path.length >= maxDepth) continue;\n\n    const fromHere = transitions.filter(\n      (t) => t.from === state && t.event !== 'INIT',\n    );\n\n    for (const transition of fromHere) {\n      if (replayPaths.has(transition.to)) continue;\n\n      const renderEffect = transition.renderEffects.find((re) => re.patternType !== null);\n      const stepNeedsEntityData =\n        transition.hasGuard ||\n        transition.payloadFields.some((f) => ENTITY_PAYLOAD_FIELDS.has(f));\n\n      const step: ReplayStep = {\n        event: transition.event,\n        fromState: state,\n        toState: transition.to,\n        slot: renderEffect?.slot ?? 'main',\n        expectedPattern: renderEffect?.patternType ?? undefined,\n        needsEntityData: stepNeedsEntityData,\n        payloadSchema: transition.payloadSchema.length > 0 ? transition.payloadSchema : undefined,\n      };\n\n      const newPath = [...path, step];\n      replayPaths.set(transition.to, newPath);\n      queue.push({ state: transition.to, path: newPath });\n    }\n  }\n\n  return replayPaths;\n}\n"]}

package/dist/types/index.d.ts

@@ -1,5 +1,5 @@
-import { bs as SExpr } from '../schema-BrFR8WMF.js';
-export { A as AGENT_DOMAIN_CATEGORIES, e as ALLOWED_CUSTOM_COMPONENTS, f as AgentDomainCategory, g as AgentDomainCategorySchema, h as AllowedCustomComponent, i as AnimationDef, j as AnimationDefInput, k as AnimationDefSchema, b as AppSchema, l as AssetMap, m as AssetMapInput, n as AssetMapSchema, o as AssetMapping, p as AssetMappingInput, q as AssetMappingSchema, C as CORE_BINDINGS, r as CallServiceConfig, s as ComputedEventContract, t as ComputedEventContractSchema, u as ComputedEventListener, v as ComputedEventListenerSchema, w as CoreBinding, x as CustomPatternDefinition, y as CustomPatternDefinitionInput, z as CustomPatternDefinitionSchema, B as CustomPatternMap, D as CustomPatternMapInput, F as CustomPatternMapSchema, G as DesignPreferences, H as DesignPreferencesInput, I as DesignPreferencesSchema, J as DesignTokens, K as DesignTokensInput, L as DesignTokensSchema, M as DomainCategory, N as DomainCategorySchema, Q as DomainContext, R as DomainContextInput, U as DomainContextSchema, V as DomainVocabulary, W as DomainVocabularySchema, X as ENTITY_ROLES, Y as Effect, Z as EffectInput, _ as EffectSchema, d as Entity, E as EntityField, $ as EntityFieldInput, a0 as EntityFieldSchema, a as EntityPersistence, a1 as EntityPersistenceSchema, a2 as EntityRef, a3 as EntityRefSchema, a4 as EntityRefStringSchema, a5 as EntityRole, a6 as EntityRoleSchema, a7 as EntitySchema, a8 as EntitySemanticRole, a9 as EntitySemanticRoleSchema, aa as Event, ab as EventInput, ac as EventListener, ad as EventListenerSchema, ae as EventPayloadField, af as EventPayloadFieldSchema, ag as EventSchema, ah as EventScope, ai as EventScopeSchema, aj as EventSemanticRole, ak as EventSemanticRoleSchema, al as EventSource, am as EventSourceSchema, an as Expression, ao as ExpressionInput, ap as ExpressionSchema, aq as Field, ar as FieldFormat, as as FieldFormatSchema, at as FieldSchema, au as FieldType, av as FieldTypeSchema, aw as FullOrbitalUnit, ax as GAME_TYPES, ay as GameSubCategory, az as GameSubCategorySchema, aA as GameType, aB as GameTypeSchema, aC as Guard, aD as GuardInput, aE as GuardSchema, aF as McpServiceDef, aG as McpServiceDefSchema, aH as NodeClassification, aI as NodeClassificationSchema, aw as Orbital, aJ as OrbitalConfig, aK as OrbitalConfigInput, aL as OrbitalConfigSchema, O as OrbitalDefinition, aM as OrbitalDefinitionSchema, aN as OrbitalEntity, aO as OrbitalEntityInput, aP as OrbitalEntitySchema, aQ as OrbitalInput, aR as OrbitalPage, aS as OrbitalPageInput, aT as OrbitalPageSchema, aU as OrbitalPageStrictInput, aV as OrbitalPageStrictSchema, b as OrbitalSchema, aW as OrbitalSchemaInput, aX as OrbitalSchemaSchema, aY as OrbitalTraitRef, aZ as OrbitalTraitRefSchema, a_ as OrbitalUnit, a$ as OrbitalUnitSchema, b0 as OrbitalZodSchema, P as Page, b1 as PageRef, b2 as PageRefObject, b3 as PageRefObjectSchema, b4 as PageRefSchema, b5 as PageRefStringSchema, b6 as PageSchema, b7 as PageTraitRef, b8 as PageTraitRefSchema, b9 as ParsedBinding, ba as PayloadField, bb as PayloadFieldSchema, bc as PresentationType, bd as RelatedLink, be as RelatedLinkSchema, bf as RelationConfig, bg as RelationConfigSchema, bh as RenderUIConfig, bi as RequiredField, bj as RequiredFieldSchema, bk as ResolvedAsset, bl as ResolvedAssetInput, bm as ResolvedAssetSchema, bn as RestAuthConfig, bo as RestAuthConfigSchema, bp as RestServiceDef, bq as RestServiceDefSchema, br as SERVICE_TYPES, bt as SExprAtom, bu as SExprAtomSchema, bv as SExprInput, bw as SExprSchema, bx as SemanticAssetRef, by as SemanticAssetRefInput, bz as SemanticAssetRefSchema, bA as ServiceDefinition, bB as ServiceDefinitionSchema, bC as ServiceRef, bD as ServiceRefSchema, bE as ServiceRefStringSchema, bF as ServiceType, bG as ServiceTypeSchema, bH as SocketEvents, bI as SocketEventsSchema, bJ as SocketServiceDef, bK as SocketServiceDefSchema, S as State, bL as StateInput, bM as StateMachine, bN as StateMachineInput, bO as StateMachineSchema, bP as StateSchema, bQ as StateSemanticRole, bR as StateSemanticRoleSchema, bS as SuggestedGuard, bT as SuggestedGuardSchema, bU as ThemeDefinition, bV as ThemeDefinitionSchema, bW as ThemeRef, bX as ThemeRefSchema, bY as ThemeRefStringSchema, bZ as ThemeTokens, b_ as ThemeTokensSchema, b$ as ThemeVariant, c0 as ThemeVariantSchema, c as Trait, c1 as TraitCategory, c2 as TraitCategorySchema, c3 as TraitDataEntity, c4 as TraitDataEntitySchema, c5 as TraitEntityField, c6 as TraitEntityFieldSchema, T as TraitEventContract, c7 as TraitEventContractSchema, c8 as TraitEventListener, c9 as TraitEventListenerSchema, ca as TraitInput, cb as TraitRef, cc as TraitRefSchema, cd as TraitReference, ce as TraitReferenceInput, cf as TraitReferenceSchema, cg as TraitSchema, ch as TraitTick, ci as TraitTickSchema, cj as TraitUIBinding, ck as Transition, cl as TransitionInput, cm as TransitionSchema, cn as UISlot, co as UISlotSchema, cp as UI_SLOTS, cq as UXHints, cr as UXHintsSchema, cs as UseDeclaration, ct as UseDeclarationSchema, cu as UserPersona, cv as UserPersonaInput, cw as UserPersonaSchema, cx as VISUAL_STYLES, cy as ViewType, cz as ViewTypeSchema, cA as VisualStyle, cB as VisualStyleSchema, cC as callService, cD as collectBindings, cE as createAssetKey, cF as deriveCollection, cG as despawn, cH as doEffects, cI as emit, cJ as findService, cK as getArgs, cL as getDefaultAnimationsForRole, cM as getOperator, cN as getServiceNames, cO as getTraitConfig, cP as getTraitName, cQ as hasService, cR as isBinding, cS as isCircuitEvent, cT as isEffect, cU as isEntityReference, cV as isImportedTraitRef, cW as isInlineTrait, cX as isMcpService, cY as isOrbitalDefinition, cZ as isPageReference, c_ as isPageReferenceObject, c$ as isPageReferenceString, d0 as isRestService, d1 as isRuntimeEntity, d2 as isSExpr, d3 as isSExprAtom, d4 as isSExprCall, d5 as isSExprEffect, d6 as isServiceReference, d7 as isSingletonEntity, d8 as isSocketService, d9 as isThemeReference, da as isValidBinding, db as navigate, dc as normalizeTraitRef, dd as notify, de as parseAssetKey, df as parseBinding, dg as parseEntityRef, dh as parseImportedTraitRef, di as parseOrbitalSchema, dj as parsePageRef, dk as parseServiceRef, dl as persist, dm as renderUI, dn as safeParseOrbitalSchema, dp as set, dq as sexpr, dr as spawn, ds as validateAssetAnimations, dt as walkSExpr } from '../schema-BrFR8WMF.js';
+import { bs as SExpr } from '../schema-obC5T1Jm.js';
+export { A as AGENT_DOMAIN_CATEGORIES, e as ALLOWED_CUSTOM_COMPONENTS, f as AgentDomainCategory, g as AgentDomainCategorySchema, h as AllowedCustomComponent, i as AnimationDef, j as AnimationDefInput, k as AnimationDefSchema, b as AppSchema, l as AssetMap, m as AssetMapInput, n as AssetMapSchema, o as AssetMapping, p as AssetMappingInput, q as AssetMappingSchema, C as CORE_BINDINGS, r as CallServiceConfig, s as ComputedEventContract, t as ComputedEventContractSchema, u as ComputedEventListener, v as ComputedEventListenerSchema, w as CoreBinding, x as CustomPatternDefinition, y as CustomPatternDefinitionInput, z as CustomPatternDefinitionSchema, B as CustomPatternMap, D as CustomPatternMapInput, F as CustomPatternMapSchema, G as DesignPreferences, H as DesignPreferencesInput, I as DesignPreferencesSchema, J as DesignTokens, K as DesignTokensInput, L as DesignTokensSchema, M as DomainCategory, N as DomainCategorySchema, Q as DomainContext, R as DomainContextInput, U as DomainContextSchema, V as DomainVocabulary, W as DomainVocabularySchema, X as ENTITY_ROLES, Y as Effect, Z as EffectInput, _ as EffectSchema, d as Entity, E as EntityField, $ as EntityFieldInput, a0 as EntityFieldSchema, a as EntityPersistence, a1 as EntityPersistenceSchema, a2 as EntityRef, a3 as EntityRefSchema, a4 as EntityRefStringSchema, a5 as EntityRole, a6 as EntityRoleSchema, a7 as EntitySchema, a8 as EntitySemanticRole, a9 as EntitySemanticRoleSchema, aa as Event, ab as EventInput, ac as EventListener, ad as EventListenerSchema, ae as EventPayloadField, af as EventPayloadFieldSchema, ag as EventSchema, ah as EventScope, ai as EventScopeSchema, aj as EventSemanticRole, ak as EventSemanticRoleSchema, al as EventSource, am as EventSourceSchema, an as Expression, ao as ExpressionInput, ap as ExpressionSchema, aq as Field, ar as FieldFormat, as as FieldFormatSchema, at as FieldSchema, au as FieldType, av as FieldTypeSchema, aw as FullOrbitalUnit, ax as GAME_TYPES, ay as GameSubCategory, az as GameSubCategorySchema, aA as GameType, aB as GameTypeSchema, aC as Guard, aD as GuardInput, aE as GuardSchema, aF as McpServiceDef, aG as McpServiceDefSchema, aH as NodeClassification, aI as NodeClassificationSchema, aw as Orbital, aJ as OrbitalConfig, aK as OrbitalConfigInput, aL as OrbitalConfigSchema, O as OrbitalDefinition, aM as OrbitalDefinitionSchema, aN as OrbitalEntity, aO as OrbitalEntityInput, aP as OrbitalEntitySchema, aQ as OrbitalInput, aR as OrbitalPage, aS as OrbitalPageInput, aT as OrbitalPageSchema, aU as OrbitalPageStrictInput, aV as OrbitalPageStrictSchema, b as OrbitalSchema, aW as OrbitalSchemaInput, aX as OrbitalSchemaSchema, aY as OrbitalTraitRef, aZ as OrbitalTraitRefSchema, a_ as OrbitalUnit, a$ as OrbitalUnitSchema, b0 as OrbitalZodSchema, P as Page, b1 as PageRef, b2 as PageRefObject, b3 as PageRefObjectSchema, b4 as PageRefSchema, b5 as PageRefStringSchema, b6 as PageSchema, b7 as PageTraitRef, b8 as PageTraitRefSchema, b9 as ParsedBinding, ba as PayloadField, bb as PayloadFieldSchema, bc as PresentationType, bd as RelatedLink, be as RelatedLinkSchema, bf as RelationConfig, bg as RelationConfigSchema, bh as RenderUIConfig, bi as RequiredField, bj as RequiredFieldSchema, bk as ResolvedAsset, bl as ResolvedAssetInput, bm as ResolvedAssetSchema, bn as RestAuthConfig, bo as RestAuthConfigSchema, bp as RestServiceDef, bq as RestServiceDefSchema, br as SERVICE_TYPES, bt as SExprAtom, bu as SExprAtomSchema, bv as SExprInput, bw as SExprSchema, bx as SemanticAssetRef, by as SemanticAssetRefInput, bz as SemanticAssetRefSchema, bA as ServiceDefinition, bB as ServiceDefinitionSchema, bC as ServiceRef, bD as ServiceRefSchema, bE as ServiceRefStringSchema, bF as ServiceType, bG as ServiceTypeSchema, bH as SocketEvents, bI as SocketEventsSchema, bJ as SocketServiceDef, bK as SocketServiceDefSchema, S as State, bL as StateInput, bM as StateMachine, bN as StateMachineInput, bO as StateMachineSchema, bP as StateSchema, bQ as StateSemanticRole, bR as StateSemanticRoleSchema, bS as SuggestedGuard, bT as SuggestedGuardSchema, bU as ThemeDefinition, bV as ThemeDefinitionSchema, bW as ThemeRef, bX as ThemeRefSchema, bY as ThemeRefStringSchema, bZ as ThemeTokens, b_ as ThemeTokensSchema, b$ as ThemeVariant, c0 as ThemeVariantSchema, c as Trait, c1 as TraitCategory, c2 as TraitCategorySchema, c3 as TraitDataEntity, c4 as TraitDataEntitySchema, c5 as TraitEntityField, c6 as TraitEntityFieldSchema, T as TraitEventContract, c7 as TraitEventContractSchema, c8 as TraitEventListener, c9 as TraitEventListenerSchema, ca as TraitInput, cb as TraitRef, cc as TraitRefSchema, cd as TraitReference, ce as TraitReferenceInput, cf as TraitReferenceSchema, cg as TraitSchema, ch as TraitTick, ci as TraitTickSchema, cj as TraitUIBinding, ck as Transition, cl as TransitionInput, cm as TransitionSchema, cn as UISlot, co as UISlotSchema, cp as UI_SLOTS, cq as UXHints, cr as UXHintsSchema, cs as UseDeclaration, ct as UseDeclarationSchema, cu as UserPersona, cv as UserPersonaInput, cw as UserPersonaSchema, cx as VISUAL_STYLES, cy as ViewType, cz as ViewTypeSchema, cA as VisualStyle, cB as VisualStyleSchema, cC as callService, cD as collectBindings, cE as createAssetKey, cF as deriveCollection, cG as despawn, cH as doEffects, cI as emit, cJ as findService, cK as getArgs, cL as getDefaultAnimationsForRole, cM as getOperator, cN as getServiceNames, cO as getTraitConfig, cP as getTraitName, cQ as hasService, cR as isBinding, cS as isCircuitEvent, cT as isEffect, cU as isEntityReference, cV as isImportedTraitRef, cW as isInlineTrait, cX as isMcpService, cY as isOrbitalDefinition, cZ as isPageReference, c_ as isPageReferenceObject, c$ as isPageReferenceString, d0 as isRestService, d1 as isRuntimeEntity, d2 as isSExpr, d3 as isSExprAtom, d4 as isSExprCall, d5 as isSExprEffect, d6 as isServiceReference, d7 as isSingletonEntity, d8 as isSocketService, d9 as isThemeReference, da as isValidBinding, db as navigate, dc as normalizeTraitRef, dd as notify, de as parseAssetKey, df as parseBinding, dg as parseEntityRef, dh as parseImportedTraitRef, di as parseOrbitalSchema, dj as parsePageRef, dk as parseServiceRef, dl as persist, dm as renderUI, dn as safeParseOrbitalSchema, dp as set, dq as sexpr, dr as spawn, ds as validateAssetAnimations, dt as walkSExpr } from '../schema-obC5T1Jm.js';
 import { z } from 'zod';
 export { CATEGORIES, CategoryMeta, OPERATORS, OPERATORS_SCHEMA, OPERATOR_NAMES, OperatorCategory, OperatorMeta, OperatorStats, OperatorsSchema, TargetPlatform, getOperatorMeta, getOperatorStats, getOperatorsByCategory, getOperatorsForTarget, isEffectOperator, isGuardOperator, isKnownOperator, validateOperatorArity } from '@almadar/operators';
 export { PATTERN_TYPES, PatternConfig, PatternType, isValidPatternType } from '@almadar/patterns';
@@ -13,7 +13,25 @@ export { PATTERN_TYPES, PatternConfig, PatternType, isValidPatternType } from '@
  * @packageDocumentation
  */
 
+/**
+ * Get all operator names.
+ *
+ * Returns a list of all registered S-expression operator names.
+ * This is a legacy alias - prefer importing OPERATOR_NAMES directly
+ * from @almadar/operators for new code.
+ *
+ * @returns {string[]} Array of operator names
+ *
+ * @example
+ * const operators = getAllOperators();
+ * // Returns: ['set', 'emit', 'navigate', 'renderUI', ...]
+ */
 declare const getAllOperators: () => string[];
+/**
+ * Operator name type.
+ *
+ * Represents a valid operator name string.
+ */
 type OperatorName = string;
 
 /**
@@ -201,7 +219,18 @@ declare const InteractionModelSchema: z.ZodObject<{
  */
 declare const DEFAULT_INTERACTION_MODELS: Record<string, InteractionModel>;
 /**
- * Get the default interaction model for a domain
+ * Gets the interaction model for a domain.
+ *
+ * Retrieves the appropriate interaction model configuration based on the
+ * specified domain. Falls back to the business model if no specific
+ * domain match is found.
+ *
+ * @param {string} domain - Domain name (e.g., 'healthcare', 'education')
+ * @returns {InteractionModel} Interaction model configuration
+ *
+ * @example
+ * getInteractionModelForDomain('healthcare'); // returns healthcare-specific model
+ * getInteractionModelForDomain('unknown'); // returns business fallback model
  */
 declare function getInteractionModelForDomain(domain: string): InteractionModel;
 type InteractionModelInput = z.input<typeof InteractionModelSchema>;
@@ -222,7 +251,16 @@ type InteractionModelInput = z.input<typeof InteractionModelSchema>;
 declare const PatternTypeSchema: z.ZodString;
 /**
  * Get all valid pattern types from the registry.
- * Delegates to @almadar/patterns which is the SSOT.
+ *
+ * Returns a complete list of pattern type names from the canonical
+ * @almadar/patterns registry. Use this to iterate over or validate
+ * pattern types programmatically.
+ *
+ * @returns {string[]} Array of pattern type names
+ *
+ * @example
+ * const types = getAllPatternTypes();
+ * // Returns: ['data-table', 'detail-view', 'form-section', ...]
  */
 declare function getAllPatternTypes(): string[];
 
@@ -523,6 +561,27 @@ interface ServiceEvents<EventMap extends Record<string, Record<string, unknown>>
  * typedBus.on('LLM_ERROR', (payload) => { payload.error; }); // payload is typed
  * ```
  */
+/**
+ * Creates a typed event bus from an untyped bus implementation.
+ *
+ * This wrapper adds TypeScript type safety to event emission and listening.
+ * The generic `EventMap` defines the shape of all events and their payloads.
+ *
+ * @template EventMap - Type mapping event names to their payload types
+ * @param {Object} bus - Untyped event bus implementation
+ * @param {Function} bus.emit - Function to emit events
+ * @param {Function} bus.on - Function to listen to events
+ * @returns {ServiceEvents<EventMap>} Typed event bus interface
+ *
+ * @example
+ * interface MyEvents {
+ *   'user.created': { id: string; name: string };
+ *   'user.deleted': { id: string };
+ * }
+ *
+ * const typedBus = createTypedEventBus<MyEvents>(rawBus);
+ * typedBus.emit('user.created', { id: '123', name: 'Alice' });
+ */
 declare function createTypedEventBus<EventMap extends Record<string, Record<string, unknown>>>(bus: {
     emit(event: string, payload?: unknown, meta?: Record<string, unknown>): void;
     on(event: string, handler: (payload: unknown, meta?: Record<string, unknown>) => void): () => void;
@@ -584,6 +643,17 @@ interface LazyService<T> {
 }
 /**
  * Create a lazy singleton from a factory function.
+ *
+ * Creates a service that lazily initializes on first access and caches the instance.
+ * Useful for expensive resources like database connections or API clients.
+ *
+ * @template T - The type of service to create
+ * @param {() => T} factory - Factory function that creates the service instance
+ * @returns {LazyService<T>} Lazy service with get() and reset() methods
+ *
+ * @example
+ * const dbService = createLazyService(() => new DatabaseClient(config));
+ * const db = dbService.get(); // Initializes on first call
  */
 declare function createLazyService<T>(factory: () => T): LazyService<T>;
 
@@ -853,6 +923,22 @@ declare function createResolvedField(field: {
     validation?: unknown;
     values?: string[];
 }): ResolvedField;
+/**
+ * Type guard to check if an object is a ResolvedIR.
+ *
+ * Validates that an unknown value conforms to the ResolvedIR structure.
+ * Checks for required properties and correct types. Used for runtime
+ * type checking and validation.
+ *
+ * @param {unknown} ir - Value to check
+ * @returns {boolean} True if value is ResolvedIR, false otherwise
+ *
+ * @example
+ * if (isResolvedIR(schema)) {
+ *   // Type-safe access to ResolvedIR properties
+ *   console.log('Valid IR:', schema.appName);
+ * }
+ */
 declare function isResolvedIR(ir: unknown): ir is ResolvedIR;
 
 export { type AppSummary, BINDING_CONTEXT_RULES, BINDING_DOCS, type BindingContext, BindingSchema, type CategorizedRemovals, type ChangeAuthor, type ChangeSetDocument, type ChangeSummary, type CreateFlow, DEFAULT_INTERACTION_MODELS, type DeleteFlow, type EditFlow, type GitHubLink, type HistoryMeta, type InteractionModel, type InteractionModelInput, InteractionModelSchema, type LazyService, type ListInteraction, type OperatorName, type PageContentReduction, PatternTypeSchema, type PersistActionName, type ResolvedEntity, type ResolvedEntityBinding, type ResolvedField, type ResolvedIR, type ResolvedNavigation, type ResolvedPage, type ResolvedPattern, type ResolvedSection, type ResolvedSectionEvent, type ResolvedTrait, type ResolvedTraitBinding, type ResolvedTraitDataEntity, type ResolvedTraitEvent, type ResolvedTraitGuard, type ResolvedTraitListener, type ResolvedTraitState, type ResolvedTraitTick, type ResolvedTraitTransition, type ResolvedTraitUIBinding, SExpr, type SaveOptions, type SaveResult, type SchemaChange, type ServiceAction, type ServiceActionName, type ServiceContract, type ServiceEvents, type SnapshotDocument, type StatsView, type StoreContract, type StoreFilter, type StoreFilterOp, type TransitionFrom, type ValidationDocument, type ValidationIssue, type ValidationMeta, type ValidationResults, type ViewFlow, createEmptyResolvedPage, createEmptyResolvedTrait, createLazyService, createResolvedField, createTypedEventBus, getAllOperators, getAllPatternTypes, getBindingExamples, getInteractionModelForDomain, inferTsType, isResolvedIR, validateBindingInContext };