@vsirotin/ts-stop 0.5.2 → 1.9.2

package/lib/sfsm/FaLoader.d.ts

@@ -0,0 +1,22 @@
+import { FaDefinition } from './types';
+/**
+ * Reads and parses a JSON file at the given path and returns it as a FaDefinition.
+ * Works with both extended and compact formats.
+ *
+ * Node.js only — uses `fs.readFileSync` and is not available in browser environments.
+ *
+ * @param filePath - Absolute or relative path to a JSON file containing an FA definition.
+ * @returns Parsed FaDefinition ready to pass to `Sfsm.loadFA()`.
+ * @throws If the file cannot be read or the contents are not valid JSON.
+ */
+export declare function loadFAFromFile(filePath: string): FaDefinition;
+/**
+ * Fetches and parses a JSON FA definition from a URL.
+ * Works in both browser and Node.js (≥ 18) environments — uses the standard `fetch` API.
+ *
+ * @param url - Absolute URL to a JSON file containing an FA definition.
+ * @returns Promise resolving to a FaDefinition ready to pass to `Sfsm.loadFA()`.
+ * @throws If the request fails, the server returns a non-2xx status, or the body is not valid JSON.
+ */
+export declare function loadFAFromURL(url: string): Promise<FaDefinition>;
+//# sourceMappingURL=FaLoader.d.ts.map

package/lib/sfsm/FaLoader.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"FaLoader.d.ts","sourceRoot":"","sources":["../../src/sfsm/FaLoader.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAEvC;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,MAAM,GAAG,YAAY,CAG7D;AAED;;;;;;;GAOG;AACH,wBAAsB,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC,CAMtE"}

package/lib/sfsm/FaLoader.js

@@ -0,0 +1,68 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.loadFAFromFile = loadFAFromFile;
+exports.loadFAFromURL = loadFAFromURL;
+const fs = __importStar(require("fs"));
+/**
+ * Reads and parses a JSON file at the given path and returns it as a FaDefinition.
+ * Works with both extended and compact formats.
+ *
+ * Node.js only — uses `fs.readFileSync` and is not available in browser environments.
+ *
+ * @param filePath - Absolute or relative path to a JSON file containing an FA definition.
+ * @returns Parsed FaDefinition ready to pass to `Sfsm.loadFA()`.
+ * @throws If the file cannot be read or the contents are not valid JSON.
+ */
+function loadFAFromFile(filePath) {
+    const content = fs.readFileSync(filePath, 'utf-8');
+    return JSON.parse(content);
+}
+/**
+ * Fetches and parses a JSON FA definition from a URL.
+ * Works in both browser and Node.js (≥ 18) environments — uses the standard `fetch` API.
+ *
+ * @param url - Absolute URL to a JSON file containing an FA definition.
+ * @returns Promise resolving to a FaDefinition ready to pass to `Sfsm.loadFA()`.
+ * @throws If the request fails, the server returns a non-2xx status, or the body is not valid JSON.
+ */
+async function loadFAFromURL(url) {
+    const response = await fetch(url);
+    if (!response.ok) {
+        throw new Error(`loadFAFromURL: request failed with status ${response.status} ${response.statusText} for URL: ${url}`);
+    }
+    return response.json();
+}
+//# sourceMappingURL=FaLoader.js.map

package/lib/sfsm/FaLoader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"FaLoader.js","sourceRoot":"","sources":["../../src/sfsm/FaLoader.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAaA,wCAGC;AAUD,sCAMC;AAhCD,uCAAyB;AAGzB;;;;;;;;;GASG;AACH,SAAgB,cAAc,CAAC,QAAgB;IAC3C,MAAM,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACnD,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAiB,CAAC;AAC/C,CAAC;AAED;;;;;;;GAOG;AACI,KAAK,UAAU,aAAa,CAAC,GAAW;IAC3C,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC;IAClC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;QACf,MAAM,IAAI,KAAK,CAAC,6CAA6C,QAAQ,CAAC,MAAM,IAAI,QAAQ,CAAC,UAAU,aAAa,GAAG,EAAE,CAAC,CAAC;IAC3H,CAAC;IACD,OAAO,QAAQ,CAAC,IAAI,EAA2B,CAAC;AACpD,CAAC"}

package/lib/sfsm/FaReducer.d.ts

@@ -0,0 +1,12 @@
+import { FaDefinition } from './types';
+/**
+ * Converts an extended FA definition (nested FaNode tree) into compact format
+ * (flat Record<string, Transition[]> with each FA's name as a top-level key).
+ *
+ * If the input is already in compact multi-FA format (all values are Transition[]),
+ * it is returned unchanged.
+ *
+ * Metadata (state names, descriptions, signal/command metadata) is discarded in the output.
+ */
+export declare function reduceFA(definition: FaDefinition): FaDefinition;
+//# sourceMappingURL=FaReducer.d.ts.map

package/lib/sfsm/FaReducer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"FaReducer.d.ts","sourceRoot":"","sources":["../../src/sfsm/FaReducer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAsB,MAAM,SAAS,CAAC;AAE3D;;;;;;;;GAQG;AACH,wBAAgB,QAAQ,CAAC,UAAU,EAAE,YAAY,GAAG,YAAY,CAY/D"}

package/lib/sfsm/FaReducer.js

@@ -0,0 +1,40 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.reduceFA = reduceFA;
+/**
+ * Converts an extended FA definition (nested FaNode tree) into compact format
+ * (flat Record<string, Transition[]> with each FA's name as a top-level key).
+ *
+ * If the input is already in compact multi-FA format (all values are Transition[]),
+ * it is returned unchanged.
+ *
+ * Metadata (state names, descriptions, signal/command metadata) is discarded in the output.
+ */
+function reduceFA(definition) {
+    const entries = Object.entries(definition);
+    // Already compact: all values are arrays
+    if (entries.every(([, v]) => Array.isArray(v))) {
+        return definition;
+    }
+    const result = {};
+    const [rootName, rootValue] = entries[0];
+    collectNodes(rootName, rootValue, result);
+    return result;
+}
+function collectNodes(name, node, result) {
+    result[name] = node.ts;
+    if (node.states) {
+        for (const [stateName, stateValue] of Object.entries(node.states)) {
+            if (isSubFaNode(stateValue)) {
+                collectNodes(stateName, stateValue, result);
+            }
+        }
+    }
+}
+function isSubFaNode(value) {
+    return (typeof value === 'object' &&
+        value !== null &&
+        'ts' in value &&
+        Array.isArray(value.ts));
+}
+//# sourceMappingURL=FaReducer.js.map

package/lib/sfsm/FaReducer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"FaReducer.js","sourceRoot":"","sources":["../../src/sfsm/FaReducer.ts"],"names":[],"mappings":";;AAWA,4BAYC;AArBD;;;;;;;;GAQG;AACH,SAAgB,QAAQ,CAAC,UAAwB;IAC7C,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;IAE3C,yCAAyC;IACzC,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7C,OAAO,UAAU,CAAC;IACtB,CAAC;IAED,MAAM,MAAM,GAAiC,EAAE,CAAC;IAChD,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACzC,YAAY,CAAC,QAAQ,EAAE,SAAmB,EAAE,MAAM,CAAC,CAAC;IACpD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED,SAAS,YAAY,CAAC,IAAY,EAAE,IAAY,EAAE,MAAoC;IAClF,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;IAEvB,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,KAAK,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAChE,IAAI,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC1B,YAAY,CAAC,SAAS,EAAE,UAAoB,EAAE,MAAM,CAAC,CAAC;YAC1D,CAAC;QACL,CAAC;IACL,CAAC;AACL,CAAC;AAED,SAAS,WAAW,CAAC,KAAc;IAC/B,OAAO,CACH,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,KAAK,IAAI;QACd,IAAI,IAAI,KAAK;QACb,KAAK,CAAC,OAAO,CAAE,KAAgB,CAAC,EAAE,CAAC,CACtC,CAAC;AACN,CAAC"}

package/lib/sfsm/FaResolver.d.ts

@@ -0,0 +1,37 @@
+import { FaDefinition, FaNode, Transition } from './types';
+/**
+ * Resolved, flat representation of one FA ready for engine processing.
+ */
+export interface ResolvedFa {
+    name: string;
+    transitions: Transition[];
+    /** Keys of states that are themselves sub-FAs (have their own ts list). */
+    subFaNames: Set<string>;
+    node: FaNode;
+}
+/**
+ * Parses a raw FaDefinition and builds a flat index of all FAs by name.
+ *
+ * A state entry is considered a sub-FA if its value object contains a "ts" key.
+ * Leaf states (no "ts") are plain named states.
+ */
+export declare class FaResolver {
+    private definition;
+    private index;
+    constructor(definition: FaDefinition);
+    /** Returns the resolved FA for the given name, or throws if not found. */
+    get(name: string): ResolvedFa;
+    /** Returns the name of the root FA.
+     *
+     * For single-key definitions (compact single FA or extended FA), the sole key is the root.
+     * For multi-key compact definitions (all values are Transition[]), the root is the FA whose
+     * name is never referenced as a target state (3rd element) in any other FA's transitions.
+     */
+    getRootName(): string;
+    private buildIndex;
+    private buildCompactMultiIndex;
+    private indexNode;
+    /** A state value is a sub-FA if it has a "ts" array property. */
+    private isSubFa;
+}
+//# sourceMappingURL=FaResolver.d.ts.map

package/lib/sfsm/FaResolver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"FaResolver.d.ts","sourceRoot":"","sources":["../../src/sfsm/FaResolver.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAE3D;;GAEG;AACH,MAAM,WAAW,UAAU;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,UAAU,EAAE,CAAC;IAC1B,2EAA2E;IAC3E,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACxB,IAAI,EAAE,MAAM,CAAC;CAChB;AAED;;;;;GAKG;AACH,qBAAa,UAAU;IAIP,OAAO,CAAC,UAAU;IAF9B,OAAO,CAAC,KAAK,CAAiC;gBAE1B,UAAU,EAAE,YAAY;IAI5C,0EAA0E;IAC1E,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU;IAQ7B;;;;;OAKG;IACH,WAAW,IAAI,MAAM;IAiCrB,OAAO,CAAC,UAAU;IA2BlB,OAAO,CAAC,sBAAsB;IAgB9B,OAAO,CAAC,SAAS;IAoBjB,iEAAiE;IACjE,OAAO,CAAC,OAAO;CAQlB"}

package/lib/sfsm/FaResolver.js

@@ -0,0 +1,120 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.FaResolver = void 0;
+/**
+ * Parses a raw FaDefinition and builds a flat index of all FAs by name.
+ *
+ * A state entry is considered a sub-FA if its value object contains a "ts" key.
+ * Leaf states (no "ts") are plain named states.
+ */
+class FaResolver {
+    constructor(definition) {
+        this.definition = definition;
+        this.index = new Map();
+        this.buildIndex();
+    }
+    /** Returns the resolved FA for the given name, or throws if not found. */
+    get(name) {
+        const fa = this.index.get(name);
+        if (!fa) {
+            throw new Error(`SFSM: FA "${name}" not found in definition.`);
+        }
+        return fa;
+    }
+    /** Returns the name of the root FA.
+     *
+     * For single-key definitions (compact single FA or extended FA), the sole key is the root.
+     * For multi-key compact definitions (all values are Transition[]), the root is the FA whose
+     * name is never referenced as a target state (3rd element) in any other FA's transitions.
+     */
+    getRootName() {
+        const keys = Object.keys(this.definition);
+        if (keys.length === 1) {
+            return keys[0];
+        }
+        // Multi-key: all values must be Transition[]
+        const allCompact = keys.every(k => Array.isArray(this.definition[k]));
+        if (!allCompact) {
+            throw new Error(`SFSM: Multi-key FA definition must use compact format (all values must be Transition[]).`);
+        }
+        // Collect all target state names referenced across all transitions
+        const referenced = new Set();
+        for (const key of keys) {
+            const transitions = this.definition[key];
+            for (const t of transitions) {
+                referenced.add(t[2]); // newState is at index 2
+            }
+        }
+        // Root = the FA name that is never a target in any other FA's transitions
+        const roots = keys.filter(k => !referenced.has(k));
+        if (roots.length !== 1) {
+            throw new Error(`SFSM: Cannot determine root FA. Candidates: [${roots.join(', ')}]. ` +
+                `All FA names: [${keys.join(', ')}].`);
+        }
+        return roots[0];
+    }
+    buildIndex() {
+        const entries = Object.entries(this.definition);
+        const allCompact = entries.every(([, v]) => Array.isArray(v));
+        if (allCompact && entries.length > 1) {
+            // Multi-key compact format: index all FAs, sub-FA names derived from definition keys
+            this.buildCompactMultiIndex();
+        }
+        else {
+            const rootName = this.getRootName();
+            const rootValue = this.definition[rootName];
+            if (Array.isArray(rootValue)) {
+                // Single-key compact format
+                const node = { ts: rootValue };
+                this.index.set(rootName, {
+                    name: rootName,
+                    transitions: rootValue,
+                    subFaNames: new Set(),
+                    node
+                });
+            }
+            else {
+                // Extended format
+                this.indexNode(rootName, rootValue);
+            }
+        }
+    }
+    buildCompactMultiIndex() {
+        const definedFaNames = new Set(Object.keys(this.definition));
+        for (const [name, value] of Object.entries(this.definition)) {
+            const transitions = value;
+            // A state is a sub-FA if its name is a key in the definition
+            const subFaNames = new Set(transitions
+                .map(t => t[2])
+                .filter(target => definedFaNames.has(target)));
+            const node = { ts: transitions };
+            this.index.set(name, { name, transitions, subFaNames, node });
+        }
+    }
+    indexNode(name, node) {
+        const subFaNames = new Set();
+        if (node.states) {
+            for (const [stateName, stateValue] of Object.entries(node.states)) {
+                if (this.isSubFa(stateValue)) {
+                    subFaNames.add(stateName);
+                    this.indexNode(stateName, stateValue);
+                }
+            }
+        }
+        this.index.set(name, {
+            name,
+            transitions: node.ts,
+            subFaNames,
+            node
+        });
+    }
+    /** A state value is a sub-FA if it has a "ts" array property. */
+    isSubFa(value) {
+        return (typeof value === 'object' &&
+            value !== null &&
+            'ts' in value &&
+            Array.isArray(value.ts));
+    }
+}
+exports.FaResolver = FaResolver;
+//# sourceMappingURL=FaResolver.js.map

package/lib/sfsm/FaResolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"FaResolver.js","sourceRoot":"","sources":["../../src/sfsm/FaResolver.ts"],"names":[],"mappings":";;;AAaA;;;;;GAKG;AACH,MAAa,UAAU;IAInB,YAAoB,UAAwB;QAAxB,eAAU,GAAV,UAAU,CAAc;QAFpC,UAAK,GAAG,IAAI,GAAG,EAAsB,CAAC;QAG1C,IAAI,CAAC,UAAU,EAAE,CAAC;IACtB,CAAC;IAED,0EAA0E;IAC1E,GAAG,CAAC,IAAY;QACZ,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,EAAE,EAAE,CAAC;YACN,MAAM,IAAI,KAAK,CAAC,aAAa,IAAI,4BAA4B,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,EAAE,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACH,WAAW;QACP,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAE1C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpB,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,CAAC;QAED,6CAA6C;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,IAAI,CAAC,UAAU,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,0FAA0F,CAAC,CAAC;QAChH,CAAC;QAED,mEAAmE;QACnE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QACrC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACrB,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAiB,CAAC;YACzD,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;gBAC1B,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,yBAAyB;YACnD,CAAC;QACL,CAAC;QAED,0EAA0E;QAC1E,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,IAAI,KAAK,CACX,gDAAgD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;gBACrE,kBAAkB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CACxC,CAAC;QACN,CAAC;QACD,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC;IAEO,UAAU;QACd,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9D,IAAI,UAAU,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACnC,qFAAqF;YACrF,IAAI,CAAC,sBAAsB,EAAE,CAAC;QAClC,CAAC;aAAM,CAAC;YACJ,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YACpC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YAE5C,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC3B,4BAA4B;gBAC5B,MAAM,IAAI,GAAW,EAAE,EAAE,EAAE,SAAyB,EAAE,CAAC;gBACvD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE;oBACrB,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,SAAyB;oBACtC,UAAU,EAAE,IAAI,GAAG,EAAE;oBACrB,IAAI;iBACP,CAAC,CAAC;YACP,CAAC;iBAAM,CAAC;gBACJ,kBAAkB;gBAClB,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,SAAmB,CAAC,CAAC;YAClD,CAAC;QACL,CAAC;IACL,CAAC;IAEO,sBAAsB;QAC1B,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAE7D,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YAC1D,MAAM,WAAW,GAAG,KAAqB,CAAC;YAC1C,6DAA6D;YAC7D,MAAM,UAAU,GAAG,IAAI,GAAG,CACtB,WAAW;iBACN,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;iBACd,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CACpD,CAAC;YACF,MAAM,IAAI,GAAW,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC;YACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;QAClE,CAAC;IACL,CAAC;IAEO,SAAS,CAAC,IAAY,EAAE,IAAY;QACxC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QAErC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,KAAK,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAChE,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC3B,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;oBAC1B,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,UAAoB,CAAC,CAAC;gBACpD,CAAC;YACL,CAAC;QACL,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE;YACjB,IAAI;YACJ,WAAW,EAAE,IAAI,CAAC,EAAE;YACpB,UAAU;YACV,IAAI;SACP,CAAC,CAAC;IACP,CAAC;IAED,iEAAiE;IACzD,OAAO,CAAC,KAAc;QAC1B,OAAO,CACH,OAAO,KAAK,KAAK,QAAQ;YACzB,KAAK,KAAK,IAAI;YACd,IAAI,IAAI,KAAK;YACb,KAAK,CAAC,OAAO,CAAE,KAAgB,CAAC,EAAE,CAAC,CACtC,CAAC;IACN,CAAC;CACJ;AAhID,gCAgIC"}

package/lib/sfsm/FaUpdater.d.ts

@@ -0,0 +1,25 @@
+import { FaDefinition, FaUpdate } from './types';
+/**
+ * Apply an update to a compact FA definition (flat Record<string, Transition[]>).
+ *
+ * Steps (in order):
+ * 1. remove: delete the named top-level keys; also prune every remaining FA's
+ *    transitions whose 3rd element (target state) is one of the removed names.
+ * 2. add: upsert the provided keys (existing entries are replaced, new ones are added).
+ *
+ * The source is not mutated — a deep-cloned result is returned.
+ */
+export declare function updateCompactFA(source: FaDefinition, update: FaUpdate): FaDefinition;
+/**
+ * Apply an update to an extended (full/declaration) FA definition.
+ *
+ * Steps (in order):
+ * 1. remove: recursively locate each named FA in the tree; remove it from its
+ *    parent's states map and prune the parent's ts of any transition targeting it.
+ * 2. add: for each entry, recursively locate the FA by name and replace it entirely.
+ *    If the name matches the root key, the root node is replaced.
+ *
+ * The source is not mutated — a deep-cloned result is returned.
+ */
+export declare function updateFullFA(source: FaDefinition, update: FaUpdate): FaDefinition;
+//# sourceMappingURL=FaUpdater.d.ts.map

package/lib/sfsm/FaUpdater.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"FaUpdater.d.ts","sourceRoot":"","sources":["../../src/sfsm/FaUpdater.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAU,QAAQ,EAAc,MAAM,SAAS,CAAC;AAErE;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,QAAQ,GAAG,YAAY,CAwBpF;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,QAAQ,GAAG,YAAY,CAqBjF"}

package/lib/sfsm/FaUpdater.js

@@ -0,0 +1,106 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.updateCompactFA = updateCompactFA;
+exports.updateFullFA = updateFullFA;
+/**
+ * Apply an update to a compact FA definition (flat Record<string, Transition[]>).
+ *
+ * Steps (in order):
+ * 1. remove: delete the named top-level keys; also prune every remaining FA's
+ *    transitions whose 3rd element (target state) is one of the removed names.
+ * 2. add: upsert the provided keys (existing entries are replaced, new ones are added).
+ *
+ * The source is not mutated — a deep-cloned result is returned.
+ */
+function updateCompactFA(source, update) {
+    var _a;
+    const result = JSON.parse(JSON.stringify(source));
+    const toRemove = new Set((_a = update.remove) !== null && _a !== void 0 ? _a : []);
+    for (const name of toRemove) {
+        delete result[name];
+    }
+    // Prune transitions referencing removed FAs from all surviving FAs.
+    for (const transitions of Object.values(result)) {
+        const arr = transitions;
+        const filtered = arr.filter(t => !toRemove.has(t[2]));
+        arr.length = 0;
+        arr.push(...filtered);
+    }
+    if (update.add) {
+        for (const [name, value] of Object.entries(update.add)) {
+            result[name] = JSON.parse(JSON.stringify(value));
+        }
+    }
+    return result;
+}
+/**
+ * Apply an update to an extended (full/declaration) FA definition.
+ *
+ * Steps (in order):
+ * 1. remove: recursively locate each named FA in the tree; remove it from its
+ *    parent's states map and prune the parent's ts of any transition targeting it.
+ * 2. add: for each entry, recursively locate the FA by name and replace it entirely.
+ *    If the name matches the root key, the root node is replaced.
+ *
+ * The source is not mutated — a deep-cloned result is returned.
+ */
+function updateFullFA(source, update) {
+    var _a;
+    const result = JSON.parse(JSON.stringify(source));
+    for (const name of ((_a = update.remove) !== null && _a !== void 0 ? _a : [])) {
+        const rootNode = Object.values(result)[0];
+        removeFromNode(rootNode, name);
+    }
+    if (update.add) {
+        const rootKey = Object.keys(result)[0];
+        for (const [name, newNode] of Object.entries(update.add)) {
+            if (name === rootKey) {
+                result[rootKey] = JSON.parse(JSON.stringify(newNode));
+            }
+            else {
+                const rootNode = Object.values(result)[0];
+                replaceInNode(rootNode, name, newNode);
+            }
+        }
+    }
+    return result;
+}
+// ---------------------------------------------------------------------------
+// Helpers
+// ---------------------------------------------------------------------------
+function removeFromNode(node, targetName) {
+    if (!node.states)
+        return false;
+    if (targetName in node.states && isSubFaNode(node.states[targetName])) {
+        delete node.states[targetName];
+        node.ts = node.ts.filter(t => t[2] !== targetName);
+        return true;
+    }
+    for (const stateValue of Object.values(node.states)) {
+        if (isSubFaNode(stateValue) && removeFromNode(stateValue, targetName)) {
+            return true;
+        }
+    }
+    return false;
+}
+function replaceInNode(node, targetName, newNode) {
+    if (!node.states)
+        return false;
+    if (targetName in node.states) {
+        node.states[targetName] = JSON.parse(JSON.stringify(newNode));
+        return true;
+    }
+    for (const stateValue of Object.values(node.states)) {
+        if (isSubFaNode(stateValue) && replaceInNode(stateValue, targetName, newNode)) {
+            return true;
+        }
+    }
+    return false;
+}
+function isSubFaNode(value) {
+    return (typeof value === 'object' &&
+        value !== null &&
+        'ts' in value &&
+        Array.isArray(value.ts));
+}
+//# sourceMappingURL=FaUpdater.js.map

package/lib/sfsm/FaUpdater.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"FaUpdater.js","sourceRoot":"","sources":["../../src/sfsm/FaUpdater.ts"],"names":[],"mappings":";;AAYA,0CAwBC;AAaD,oCAqBC;AApED;;;;;;;;;GASG;AACH,SAAgB,eAAe,CAAC,MAAoB,EAAE,MAAgB;;IAClE,MAAM,MAAM,GAAiC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;IAEhF,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAA,MAAM,CAAC,MAAM,mCAAI,EAAE,CAAC,CAAC;IAE9C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC1B,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IAED,oEAAoE;IACpE,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QAC9C,MAAM,GAAG,GAAG,WAA2B,CAAC;QACxC,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;QACf,GAAG,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;IAC1B,CAAC;IAED,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC;QACb,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YACrD,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAiB,CAAC;QACrE,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,YAAY,CAAC,MAAoB,EAAE,MAAgB;;IAC/D,MAAM,MAAM,GAAiB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;IAEhE,KAAK,MAAM,IAAI,IAAI,CAAC,MAAA,MAAM,CAAC,MAAM,mCAAI,EAAE,CAAC,EAAE,CAAC;QACvC,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAW,CAAC;QACpD,cAAc,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IACnC,CAAC;IAED,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC;QACb,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YACvD,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;gBACnB,MAAM,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;YAC1D,CAAC;iBAAM,CAAC;gBACJ,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAW,CAAC;gBACpD,aAAa,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAiB,CAAC,CAAC;YACrD,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAED,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E,SAAS,cAAc,CAAC,IAAY,EAAE,UAAkB;IACpD,IAAI,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAE/B,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;QACpE,OAAO,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAC/B,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QAClD,IAAI,WAAW,CAAC,UAAU,CAAC,IAAI,cAAc,CAAC,UAAoB,EAAE,UAAU,CAAC,EAAE,CAAC;YAC9E,OAAO,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,SAAS,aAAa,CAAC,IAAY,EAAE,UAAkB,EAAE,OAAe;IACpE,IAAI,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAE/B,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAC5B,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;QAC9D,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QAClD,IAAI,WAAW,CAAC,UAAU,CAAC,IAAI,aAAa,CAAC,UAAoB,EAAE,UAAU,EAAE,OAAO,CAAC,EAAE,CAAC;YACtF,OAAO,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,SAAS,WAAW,CAAC,KAAc;IAC/B,OAAO,CACH,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,KAAK,IAAI;QACd,IAAI,IAAI,KAAK;QACb,KAAK,CAAC,OAAO,CAAE,KAAgB,CAAC,EAAE,CAAC,CACtC,CAAC;AACN,CAAC"}

package/lib/sfsm/Sfsm.d.ts

@@ -0,0 +1,60 @@
+import { FaDefinition, LogEntry, SfsmOptions } from './types';
+import { ICommandReceiver, ISignalReceiver } from './interfaces';
+/**
+ * Stacked Finite State Machine engine.
+ *
+ * Usage:
+ *   const sfsm = new Sfsm(options);
+ *   sfsm.setCommandReceiver(receiver);
+ *   sfsm.loadFA(definition);   // auto-activates state I of root FA
+ *   sfsm.receiveSignal('TS.s');
+ *
+ * Signal re-entrancy: if receiveSignal is called while the engine is already
+ * processing a signal (e.g. from within a command receiver callback), the
+ * incoming signal is queued and processed after the current step completes.
+ * This prevents stack corruption and ensures deterministic ordering.
+ */
+export declare class Sfsm implements ISignalReceiver {
+    private resolver;
+    private stack;
+    private commandReceiver;
+    private options;
+    private log;
+    private processing;
+    private signalQueue;
+    constructor(options?: SfsmOptions);
+    /** Register the single command receiver for this SFSM instance. */
+    setCommandReceiver(receiver: ICommandReceiver): void;
+    /**
+     * Load a FA definition and initialise the engine.
+     * The root FA is pushed onto the stack with active state "I".
+     * No signal is sent automatically — the caller is responsible for
+     * sending the first signal (e.g. "TS.s") to drive out of state I.
+     */
+    loadFA(definition: FaDefinition): void;
+    /**
+     * Send a signal to the SFSM.
+     * If called re-entrantly (from within a command receiver), the signal
+     * is queued and will be processed after the current step finishes.
+     */
+    receiveSignal(signal: string, data?: unknown): void;
+    /** Returns the accumulated log entries. */
+    getLog(): LogEntry[];
+    /** Returns the current FA name stack (bottom = index 0, head = last). */
+    getCurrentStack(): string[];
+    /** Returns the active state of the head FA. */
+    getHeadState(): string;
+    private processSignal;
+    /**
+     * Rule 2: find a matching transition, searching from head down the stack.
+     * Returns { frameIndex, transition } or null if not found anywhere.
+     */
+    private findTransition;
+    private applySignal;
+    private resolveStateMeta;
+    private resolveSignalMeta;
+    private resolveCommandMeta;
+    private handleMissingTransition;
+    private handleMissingData;
+}
+//# sourceMappingURL=Sfsm.d.ts.map

package/lib/sfsm/Sfsm.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Sfsm.d.ts","sourceRoot":"","sources":["../../src/sfsm/Sfsm.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAC9D,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAQjE;;;;;;;;;;;;;GAaG;AACH,qBAAa,IAAK,YAAW,eAAe;IAExC,OAAO,CAAC,QAAQ,CAA2B;IAC3C,OAAO,CAAC,KAAK,CAAoB;IACjC,OAAO,CAAC,eAAe,CAAiC;IACxD,OAAO,CAAC,OAAO,CAAc;IAC7B,OAAO,CAAC,GAAG,CAAkB;IAC7B,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO,CAAC,WAAW,CAAiD;gBAExD,OAAO,GAAE,WAAgB;IAOrC,mEAAmE;IACnE,kBAAkB,CAAC,QAAQ,EAAE,gBAAgB,GAAG,IAAI;IAIpD;;;;;OAKG;IACH,MAAM,CAAC,UAAU,EAAE,YAAY,GAAG,IAAI;IAStC;;;;OAIG;IACH,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,OAAO,GAAG,IAAI;IAanD,2CAA2C;IAC3C,MAAM,IAAI,QAAQ,EAAE;IAIpB,yEAAyE;IACzE,eAAe,IAAI,MAAM,EAAE;IAI3B,+CAA+C;IAC/C,YAAY,IAAI,MAAM;IAOtB,OAAO,CAAC,aAAa;IAarB;;;OAGG;IACH,OAAO,CAAC,cAAc;IActB,OAAO,CAAC,WAAW;IAqFnB,OAAO,CAAC,gBAAgB;IAKxB,OAAO,CAAC,iBAAiB;IASzB,OAAO,CAAC,kBAAkB;IAU1B,OAAO,CAAC,uBAAuB;IAQ/B,OAAO,CAAC,iBAAiB;CAM5B"}