jssm 5.144.2 → 5.144.3

package/README.md

@@ -18,10 +18,10 @@ Please edit the file it's derived from, instead: `./src/md/readme_base.md`
 
 
 
-* Generated for version 5.144.2 at 6/22/2026, 6:51:17 AM
+* Generated for version 5.144.3 at 6/22/2026, 7:57:57 AM
 
 -->
-# jssm 5.144.2
+# jssm 5.144.3
 
 [**Try the live editor**](https://stonecypher.github.io/jssm-viz-demo/graph_explorer.html) ·
 [Documentation](https://stonecypher.github.io/jssm/docs/) ·
@@ -312,7 +312,7 @@ That decision shows up everywhere downstream:
   or run `npm run benny` against your own machine.
 
 - **More thoroughly tested than any other JavaScript state-machine
-  library.**  7,310 tests at 100.0% line coverage
+  library.**  7,313 tests at 100.0% line coverage
   ([report](https://coveralls.io/github/StoneCypher/jssm)), plus
   fuzz testing via `fast-check`, with parser test data across ten natural
   languages and Emoji.
@@ -445,11 +445,11 @@ If your contribution is missing here, please open an issue.
 
 <br/>
 
-***7,310 tests***, run 82,352 times.
+***7,313 tests***, run 82,355 times.
 
-- 6,552 specs with 100.0% coverage
-- 758 fuzz tests with 73.9% coverage
-- 6,892 TypeScript lines - 1.1 tests per line, 11.9 generated tests per line
+- 6,555 specs with 100.0% coverage
+- 758 fuzz tests with 73.8% coverage
+- 6,888 TypeScript lines - 1.1 tests per line, 12.0 generated tests per line
 
 [![Actions Status](https://github.com/StoneCypher/jssm/workflows/Node%20CI/badge.svg)](https://github.com/StoneCypher/jssm/actions)
 [![NPM version](https://img.shields.io/npm/v/jssm.svg)](https://www.npmjs.com/package/jssm)

package/dist/cdn/instance.js

@@ -22423,26 +22423,24 @@ function resolve_group_refs(tree, registry) {
  *
  */
 function compile_rule_transition_step(acc, from, to, this_se, next_se) {
-    const edges = [];
     const uFrom = (Array.isArray(from) ? from : [from]), uTo = (Array.isArray(to) ? to : [to]);
-    uFrom.map((f) => {
-        uTo.map((t) => {
+    for (const f of uFrom) {
+        for (const t of uTo) {
             const right = makeTransition(this_se, f, t, true);
             if (right.kind !== 'none') {
-                edges.push(right);
+                acc.push(right);
             }
             const left = makeTransition(this_se, t, f, false);
             if (left.kind !== 'none') {
-                edges.push(left);
+                acc.push(left);
             }
-        });
-    });
-    const new_acc = acc.concat(edges);
+        }
+    }
     if (next_se) {
-        return compile_rule_transition_step(new_acc, to, next_se.to, next_se, next_se.se);
+        return compile_rule_transition_step(acc, to, next_se.to, next_se, next_se.se);
     }
     else {
-        return new_acc;
+        return acc;
     }
 }
 /*********
@@ -23514,10 +23512,11 @@ var constants = /*#__PURE__*/Object.freeze({
  *  Useful for runtime diagnostics and for embedding in serialized machine
  *  snapshots so that deserializers can detect version-skew.
  */
-const version = "5.144.2";
+const version = "5.144.3";
 
 // whargarbl lots of these return arrays could/should be sets
 const { state_name_chars, state_name_first_chars, action_label_chars } = constants;
+const empty_string_set = new Set();
 /*********
  *
  *  An internal method meant to take a series of declarations and fold them into
@@ -25377,10 +25376,10 @@ class Machine {
             }
             throw new JssmError(this, `No such state ${JSON.stringify(whichState)}`);
         }
-        return Array.from(ra_base.values())
-            .map((edgeId) => this._edges[edgeId])
-            .filter((o) => o.from === whichState)
-            .map((filtered) => filtered.action);
+        // `_reverse_actions` is keyed by edge.from (see its population), so every
+        // action stored under whichState belongs to whichState by construction — no
+        // from-filter is needed, and the keys are exactly the exit actions.
+        return Array.from(ra_base.keys());
     }
     /** List all action exits from a state with their probabilities.
      *  @param whichState - The state to inspect.  Defaults to the current state.
@@ -25395,13 +25394,16 @@ class Machine {
             }
             throw new JssmError(this, `No such state ${JSON.stringify(whichState)}`);
         }
-        return Array.from(ra_base.values())
-            .map((edgeId) => this._edges[edgeId])
-            .filter((o) => o.from === whichState)
-            .map((filtered) => ({
-            action: filtered.action,
-            probability: filtered.probability
-        }));
+        const exits = []; // TODO FIXME no any
+        // `_reverse_actions` is keyed by edge.from, so every entry belongs to
+        // whichState by construction; no from-filter is needed.
+        ra_base.forEach((edgeId, action) => {
+            exits.push({
+                action,
+                probability: this._edges[edgeId].probability
+            });
+        });
+        return exits;
     }
     /** Check whether a state has no incoming transitions (unreachable after start).
      *  @param whichState - The state to check.
@@ -26597,8 +26599,8 @@ class Machine {
                 + `crossing from ${JSON.stringify(prev_state)} to ${JSON.stringify(next_state)} `
                 + `(possible infinite loop)`);
         }
-        const prev_groups = (_a = this._state_to_groups.get(prev_state)) !== null && _a !== void 0 ? _a : new Set();
-        const next_groups = (_b = this._state_to_groups.get(next_state)) !== null && _b !== void 0 ? _b : new Set();
+        const prev_groups = (_a = this._state_to_groups.get(prev_state)) !== null && _a !== void 0 ? _a : empty_string_set;
+        const next_groups = (_b = this._state_to_groups.get(next_state)) !== null && _b !== void 0 ? _b : empty_string_set;
         // The labels to dispatch, gathered before any firing so that re-entrant
         // transitions caused by an early action cannot perturb which boundaries the
         // *current* crossing fires.  Exits precede enters (statechart convention).

package/dist/cdn/viz.js

@@ -22448,26 +22448,24 @@ function resolve_group_refs(tree, registry) {
  *
  */
 function compile_rule_transition_step(acc, from, to, this_se, next_se) {
-    const edges = [];
     const uFrom = (Array.isArray(from) ? from : [from]), uTo = (Array.isArray(to) ? to : [to]);
-    uFrom.map((f) => {
-        uTo.map((t) => {
+    for (const f of uFrom) {
+        for (const t of uTo) {
             const right = makeTransition(this_se, f, t, true);
             if (right.kind !== 'none') {
-                edges.push(right);
+                acc.push(right);
             }
             const left = makeTransition(this_se, t, f, false);
             if (left.kind !== 'none') {
-                edges.push(left);
+                acc.push(left);
             }
-        });
-    });
-    const new_acc = acc.concat(edges);
+        }
+    }
     if (next_se) {
-        return compile_rule_transition_step(new_acc, to, next_se.to, next_se, next_se.se);
+        return compile_rule_transition_step(acc, to, next_se.to, next_se, next_se.se);
     }
     else {
-        return new_acc;
+        return acc;
     }
 }
 /*********
@@ -23539,10 +23537,11 @@ var constants = /*#__PURE__*/Object.freeze({
  *  Useful for runtime diagnostics and for embedding in serialized machine
  *  snapshots so that deserializers can detect version-skew.
  */
-const version = "5.144.2";
+const version = "5.144.3";
 
 // whargarbl lots of these return arrays could/should be sets
 const { state_name_chars, state_name_first_chars, action_label_chars } = constants;
+const empty_string_set = new Set();
 /*********
  *
  *  An internal method meant to take a series of declarations and fold them into
@@ -25402,10 +25401,10 @@ class Machine {
             }
             throw new JssmError(this, `No such state ${JSON.stringify(whichState)}`);
         }
-        return Array.from(ra_base.values())
-            .map((edgeId) => this._edges[edgeId])
-            .filter((o) => o.from === whichState)
-            .map((filtered) => filtered.action);
+        // `_reverse_actions` is keyed by edge.from (see its population), so every
+        // action stored under whichState belongs to whichState by construction — no
+        // from-filter is needed, and the keys are exactly the exit actions.
+        return Array.from(ra_base.keys());
     }
     /** List all action exits from a state with their probabilities.
      *  @param whichState - The state to inspect.  Defaults to the current state.
@@ -25420,13 +25419,16 @@ class Machine {
             }
             throw new JssmError(this, `No such state ${JSON.stringify(whichState)}`);
         }
-        return Array.from(ra_base.values())
-            .map((edgeId) => this._edges[edgeId])
-            .filter((o) => o.from === whichState)
-            .map((filtered) => ({
-            action: filtered.action,
-            probability: filtered.probability
-        }));
+        const exits = []; // TODO FIXME no any
+        // `_reverse_actions` is keyed by edge.from, so every entry belongs to
+        // whichState by construction; no from-filter is needed.
+        ra_base.forEach((edgeId, action) => {
+            exits.push({
+                action,
+                probability: this._edges[edgeId].probability
+            });
+        });
+        return exits;
     }
     /** Check whether a state has no incoming transitions (unreachable after start).
      *  @param whichState - The state to check.
@@ -26622,8 +26624,8 @@ class Machine {
                 + `crossing from ${JSON.stringify(prev_state)} to ${JSON.stringify(next_state)} `
                 + `(possible infinite loop)`);
         }
-        const prev_groups = (_a = this._state_to_groups.get(prev_state)) !== null && _a !== void 0 ? _a : new Set();
-        const next_groups = (_b = this._state_to_groups.get(next_state)) !== null && _b !== void 0 ? _b : new Set();
+        const prev_groups = (_a = this._state_to_groups.get(prev_state)) !== null && _a !== void 0 ? _a : empty_string_set;
+        const next_groups = (_b = this._state_to_groups.get(next_state)) !== null && _b !== void 0 ? _b : empty_string_set;
         // The labels to dispatch, gathered before any firing so that re-entrant
         // transitions caused by an early action cannot perturb which boundaries the
         // *current* crossing fires.  Exits precede enters (statechart convention).

package/dist/cli/fsl-export-system-prompt.cjs

@@ -108,7 +108,7 @@ function parseFslArgs(argv, spec) {
   return { positional, flags, helpText };
 }
 
-const getVersion = () => "5.144.2";
+const getVersion = () => "5.144.3";
 const SPEC = {
   flags: {
     help: { short: "h", boolean: true },