jssm 5.143.5 → 5.143.7

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.143.5 at 6/11/2026, 7:42:31 PM
+* Generated for version 5.143.7 at 6/11/2026, 8:01:49 PM
 
 -->
-# jssm 5.143.5
+# jssm 5.143.7
 
 [**Try the live editor**](https://stonecypher.github.io/jssm-viz-demo/graph_explorer.html) ·
 [Documentation](https://stonecypher.github.io/jssm/docs/) ·
@@ -418,7 +418,7 @@ If your contribution is missing here, please open an issue.
 
 - 6,201 specs with 100.0% coverage
 - 526 fuzz tests with 3.3% coverage
-- 5,780 TypeScript lines - 1.2 tests per line, 10.2 generated tests per line
+- 5,781 TypeScript lines - 1.2 tests per line, 10.2 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

@@ -22675,7 +22675,7 @@ 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.143.5";
+const version = "5.143.7";
 
 // whargarbl lots of these return arrays could/should be sets
 const { state_name_chars, state_name_first_chars, action_label_chars } = constants;
@@ -23047,8 +23047,11 @@ class Machine {
         // membership so the dedup check is O(1) per edge rather than an O(out-degree)
         // array scan (which made construction O(V*E) on dense graphs).  #673
         const seen_edges = new Map();
-        // walk the transitions
-        transitions.map((tr) => {
+        // walk the transitions.  single-lookup cursor fetches: each endpoint was
+        // previously a get followed by a has on the same key (four hashes per
+        // edge); the undefined check on the get's result carries the same
+        // information.  #706
+        for (const tr of transitions) {
             if (tr.from === undefined) {
                 throw new JssmError(this, `transition must define 'from': ${JSON.stringify(tr)}`);
             }
@@ -23056,14 +23059,14 @@ class Machine {
                 throw new JssmError(this, `transition must define 'to': ${JSON.stringify(tr)}`);
             }
             // get the cursors.  what a mess
-            const cursor_from = this._states.get(tr.from)
-                || { name: tr.from, from: [], to: [], complete: complete.includes(tr.from) };
-            if (!(this._states.has(tr.from))) {
+            let cursor_from = this._states.get(tr.from);
+            if (cursor_from === undefined) {
+                cursor_from = { name: tr.from, from: [], to: [], complete: complete.includes(tr.from) };
                 this._new_state(cursor_from);
             }
-            const cursor_to = this._states.get(tr.to)
-                || { name: tr.to, from: [], to: [], complete: complete.includes(tr.to) };
-            if (!(this._states.has(tr.to))) {
+            let cursor_to = this._states.get(tr.to);
+            if (cursor_to === undefined) {
+                cursor_to = { name: tr.to, from: [], to: [], complete: complete.includes(tr.to) };
                 this._new_state(cursor_to);
             }
             // guard against existing connections being re-added — O(1) via the
@@ -23103,8 +23106,9 @@ class Machine {
                 this._after_mapping.set(tr.from, [tr.to, tr.after_time]);
             }
             // set up the mapping, so that edges can be looked up by endpoint pairs
-            const from_mapping = this._edge_map.get(tr.from) || new Map();
-            if (!(this._edge_map.has(tr.from))) {
+            let from_mapping = this._edge_map.get(tr.from);
+            if (from_mapping === undefined) {
+                from_mapping = new Map();
                 this._edge_map.set(tr.from, from_mapping);
             }
             //    const to_mapping = from_mapping.get(tr.to);
@@ -23161,7 +23165,7 @@ class Machine {
                         }
                 */
             }
-        });
+        }
         if (Array.isArray(property_definition)) {
             property_definition.forEach(pr => {
                 this._property_keys.add(pr.name);
@@ -26613,6 +26617,26 @@ function _update_hook_fields(hook_args, res) {
     }
     return false;
 }
+/**
+ *
+ *  Shared, frozen outcomes for the simple hook results.  The transition
+ *  cascade runs up to ~10 hook steps per transition, and the overwhelmingly
+ *  common results — no hook installed, or a hook returning `undefined` /
+ *  `true` / `false` — previously allocated a fresh one-field object each
+ *  time, just to have `.pass` read once and be discarded.  Callers only read
+ *  `pass` and probe for an own `data` property ({@link _update_hook_fields}),
+ *  so a shared instance is observationally identical; freezing turns that
+ *  read-only contract from incidental into enforced.  Complex results (hooks
+ *  returning `{ pass, data, ... }`) still pass through untouched.  #705
+ *
+ *  @see abstract_hook_step
+ *  @see abstract_everything_hook_step
+ *
+ *  @internal
+ *
+ */
+const HOOK_PASSED = Object.freeze({ pass: true }); // eslint-disable-line @typescript-eslint/no-explicit-any
+const HOOK_REJECTED = Object.freeze({ pass: false }); // eslint-disable-line @typescript-eslint/no-explicit-any
 /**
  *
  *  Invoke an optional transition/action hook and normalize its return value
@@ -26654,16 +26678,16 @@ function abstract_hook_step(maybe_hook, hook_args) {
     if (maybe_hook !== undefined) {
         const result = maybe_hook(hook_args);
         if (result === undefined) {
-            return { pass: true };
+            return HOOK_PASSED;
         }
         if (result === true) {
-            return { pass: true };
+            return HOOK_PASSED;
         }
         if (result === false) {
-            return { pass: false };
+            return HOOK_REJECTED;
         }
         if (result === null) {
-            return { pass: false };
+            return HOOK_REJECTED;
         }
         if (is_hook_complex_result(result)) {
             return result;
@@ -26671,7 +26695,7 @@ function abstract_hook_step(maybe_hook, hook_args) {
         throw new TypeError(`Unknown hook result type ${result}`);
     }
     else {
-        return { pass: true };
+        return HOOK_PASSED;
     }
 }
 /**
@@ -26712,16 +26736,16 @@ function abstract_everything_hook_step(maybe_hook, hook_args) {
     if (maybe_hook !== undefined) {
         const result = maybe_hook(hook_args);
         if (result === undefined) {
-            return { pass: true };
+            return HOOK_PASSED;
         }
         if (result === true) {
-            return { pass: true };
+            return HOOK_PASSED;
         }
         if (result === false) {
-            return { pass: false };
+            return HOOK_REJECTED;
         }
         if (result === null) {
-            return { pass: false };
+            return HOOK_REJECTED;
         }
         if (is_hook_complex_result(result)) {
             return result;
@@ -26729,7 +26753,7 @@ function abstract_everything_hook_step(maybe_hook, hook_args) {
         throw new TypeError(`Unknown hook result type ${result}`);
     }
     else {
-        return { pass: true };
+        return HOOK_PASSED;
     }
 }
 

package/dist/cdn/viz.js

@@ -22700,7 +22700,7 @@ 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.143.5";
+const version = "5.143.7";
 
 // whargarbl lots of these return arrays could/should be sets
 const { state_name_chars, state_name_first_chars, action_label_chars } = constants;
@@ -23072,8 +23072,11 @@ class Machine {
         // membership so the dedup check is O(1) per edge rather than an O(out-degree)
         // array scan (which made construction O(V*E) on dense graphs).  #673
         const seen_edges = new Map();
-        // walk the transitions
-        transitions.map((tr) => {
+        // walk the transitions.  single-lookup cursor fetches: each endpoint was
+        // previously a get followed by a has on the same key (four hashes per
+        // edge); the undefined check on the get's result carries the same
+        // information.  #706
+        for (const tr of transitions) {
             if (tr.from === undefined) {
                 throw new JssmError(this, `transition must define 'from': ${JSON.stringify(tr)}`);
             }
@@ -23081,14 +23084,14 @@ class Machine {
                 throw new JssmError(this, `transition must define 'to': ${JSON.stringify(tr)}`);
             }
             // get the cursors.  what a mess
-            const cursor_from = this._states.get(tr.from)
-                || { name: tr.from, from: [], to: [], complete: complete.includes(tr.from) };
-            if (!(this._states.has(tr.from))) {
+            let cursor_from = this._states.get(tr.from);
+            if (cursor_from === undefined) {
+                cursor_from = { name: tr.from, from: [], to: [], complete: complete.includes(tr.from) };
                 this._new_state(cursor_from);
             }
-            const cursor_to = this._states.get(tr.to)
-                || { name: tr.to, from: [], to: [], complete: complete.includes(tr.to) };
-            if (!(this._states.has(tr.to))) {
+            let cursor_to = this._states.get(tr.to);
+            if (cursor_to === undefined) {
+                cursor_to = { name: tr.to, from: [], to: [], complete: complete.includes(tr.to) };
                 this._new_state(cursor_to);
             }
             // guard against existing connections being re-added — O(1) via the
@@ -23128,8 +23131,9 @@ class Machine {
                 this._after_mapping.set(tr.from, [tr.to, tr.after_time]);
             }
             // set up the mapping, so that edges can be looked up by endpoint pairs
-            const from_mapping = this._edge_map.get(tr.from) || new Map();
-            if (!(this._edge_map.has(tr.from))) {
+            let from_mapping = this._edge_map.get(tr.from);
+            if (from_mapping === undefined) {
+                from_mapping = new Map();
                 this._edge_map.set(tr.from, from_mapping);
             }
             //    const to_mapping = from_mapping.get(tr.to);
@@ -23186,7 +23190,7 @@ class Machine {
                         }
                 */
             }
-        });
+        }
         if (Array.isArray(property_definition)) {
             property_definition.forEach(pr => {
                 this._property_keys.add(pr.name);
@@ -26638,6 +26642,26 @@ function _update_hook_fields(hook_args, res) {
     }
     return false;
 }
+/**
+ *
+ *  Shared, frozen outcomes for the simple hook results.  The transition
+ *  cascade runs up to ~10 hook steps per transition, and the overwhelmingly
+ *  common results — no hook installed, or a hook returning `undefined` /
+ *  `true` / `false` — previously allocated a fresh one-field object each
+ *  time, just to have `.pass` read once and be discarded.  Callers only read
+ *  `pass` and probe for an own `data` property ({@link _update_hook_fields}),
+ *  so a shared instance is observationally identical; freezing turns that
+ *  read-only contract from incidental into enforced.  Complex results (hooks
+ *  returning `{ pass, data, ... }`) still pass through untouched.  #705
+ *
+ *  @see abstract_hook_step
+ *  @see abstract_everything_hook_step
+ *
+ *  @internal
+ *
+ */
+const HOOK_PASSED = Object.freeze({ pass: true }); // eslint-disable-line @typescript-eslint/no-explicit-any
+const HOOK_REJECTED = Object.freeze({ pass: false }); // eslint-disable-line @typescript-eslint/no-explicit-any
 /**
  *
  *  Invoke an optional transition/action hook and normalize its return value
@@ -26679,16 +26703,16 @@ function abstract_hook_step(maybe_hook, hook_args) {
     if (maybe_hook !== undefined) {
         const result = maybe_hook(hook_args);
         if (result === undefined) {
-            return { pass: true };
+            return HOOK_PASSED;
         }
         if (result === true) {
-            return { pass: true };
+            return HOOK_PASSED;
         }
         if (result === false) {
-            return { pass: false };
+            return HOOK_REJECTED;
         }
         if (result === null) {
-            return { pass: false };
+            return HOOK_REJECTED;
         }
         if (is_hook_complex_result(result)) {
             return result;
@@ -26696,7 +26720,7 @@ function abstract_hook_step(maybe_hook, hook_args) {
         throw new TypeError(`Unknown hook result type ${result}`);
     }
     else {
-        return { pass: true };
+        return HOOK_PASSED;
     }
 }
 /**
@@ -26737,16 +26761,16 @@ function abstract_everything_hook_step(maybe_hook, hook_args) {
     if (maybe_hook !== undefined) {
         const result = maybe_hook(hook_args);
         if (result === undefined) {
-            return { pass: true };
+            return HOOK_PASSED;
         }
         if (result === true) {
-            return { pass: true };
+            return HOOK_PASSED;
         }
         if (result === false) {
-            return { pass: false };
+            return HOOK_REJECTED;
         }
         if (result === null) {
-            return { pass: false };
+            return HOOK_REJECTED;
         }
         if (is_hook_complex_result(result)) {
             return result;
@@ -26754,7 +26778,7 @@ function abstract_everything_hook_step(maybe_hook, hook_args) {
         throw new TypeError(`Unknown hook result type ${result}`);
     }
     else {
-        return { pass: true };
+        return HOOK_PASSED;
     }
 }