jssm 5.157.6 → 5.157.8

package/jssm.es5.d.cts

@@ -3023,6 +3023,13 @@ declare class Machine<mDT> {
      *
      *  @param start - State to begin the walk from.
      *  @param max_steps - Maximum transitions before the walk is step-capped.
+     *  @param exit_memo - Per-run-set cache of {@link Machine.probable_exits_for}
+     *    results.  The graph is immutable after construction, so a state's
+     *    probable exits never change; sharing one memo across a generator's
+     *    runs collapses runs×steps re-derivations (two array allocations and an
+     *    exit rescan per step) to one per distinct state.  The memo only reuses
+     *    the derived arrays — RNG draw order is untouched, so seeded walks
+     *    reproduce exactly.
      *  @returns The {@link JssmStochasticRun} for this walk.
      */
     private _stochastic_one_walk;

package/jssm.es6.d.ts

@@ -3023,6 +3023,13 @@ declare class Machine<mDT> {
      *
      *  @param start - State to begin the walk from.
      *  @param max_steps - Maximum transitions before the walk is step-capped.
+     *  @param exit_memo - Per-run-set cache of {@link Machine.probable_exits_for}
+     *    results.  The graph is immutable after construction, so a state's
+     *    probable exits never change; sharing one memo across a generator's
+     *    runs collapses runs×steps re-derivations (two array allocations and an
+     *    exit rescan per step) to one per distinct state.  The memo only reuses
+     *    the derived arrays — RNG draw order is untouched, so seeded walks
+     *    reproduce exactly.
      *  @returns The {@link JssmStochasticRun} for this walk.
      */
     private _stochastic_one_walk;

package/jssm_viz.es5.d.cts

@@ -2193,6 +2193,13 @@ declare class Machine<mDT> {
      *
      *  @param start - State to begin the walk from.
      *  @param max_steps - Maximum transitions before the walk is step-capped.
+     *  @param exit_memo - Per-run-set cache of {@link Machine.probable_exits_for}
+     *    results.  The graph is immutable after construction, so a state's
+     *    probable exits never change; sharing one memo across a generator's
+     *    runs collapses runs×steps re-derivations (two array allocations and an
+     *    exit rescan per step) to one per distinct state.  The memo only reuses
+     *    the derived arrays — RNG draw order is untouched, so seeded walks
+     *    reproduce exactly.
      *  @returns The {@link JssmStochasticRun} for this walk.
      */
     private _stochastic_one_walk;

package/jssm_viz.es6.d.ts

@@ -2193,6 +2193,13 @@ declare class Machine<mDT> {
      *
      *  @param start - State to begin the walk from.
      *  @param max_steps - Maximum transitions before the walk is step-capped.
+     *  @param exit_memo - Per-run-set cache of {@link Machine.probable_exits_for}
+     *    results.  The graph is immutable after construction, so a state's
+     *    probable exits never change; sharing one memo across a generator's
+     *    runs collapses runs×steps re-derivations (two array allocations and an
+     *    exit rescan per step) to one per distinct state.  The memo only reuses
+     *    the derived arrays — RNG draw order is untouched, so seeded walks
+     *    reproduce exactly.
      *  @returns The {@link JssmStochasticRun} for this walk.
      */
     private _stochastic_one_walk;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "jssm",
-  "version": "5.157.6",
+  "version": "5.157.8",
   "engines": {
     "node": ">=10.0.0"
   },