@statewalker/fsm 0.10.1 → 0.13.0

package/dist/index-umd.js

@@ -1,4 +1,4 @@
-// @statewalker/fsm v0.10.1 https://github.com/statewalker/statewalker-tree Copyright 2022 Mikhail Kotelnikov
+// @statewalker/fsm v0.13.0 https://github.com/statewalker/statewalker-tree Copyright 2022 Mikhail Kotelnikov
 (function (global, factory) {
 typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports, require('@statewalker/tree')) :
 typeof define === 'function' && define.amd ? define(['exports', '@statewalker/tree'], factory) :
@@ -138,38 +138,6 @@ function getAllStateKeys(descriptor) {
   }
 }
 
-/**
- * Returns all possible transitions from the current state of the process.
- * @param {Object} options - method parameters
- * @param {Process} options.process - the current process for which 
- * all transitions should be returned
- * @returns {Array<Object>} - an array of all transitions;
- * each entry in this returned array contains the following keys:
- * 1) parentStateKey - key of the state where the transition can be activated
- * 2) sourceStateKey - the initial transition state
- * 3) eventKey - key of the event activating transition
- * 4) targetStateKey - the resulting state for this transition
- * 
- */
-function getAllTransitions(process) {
-  const list = [];
-  let stateKey = process.current ? process.current.key : KEYS.STATE_INITIAL;
-  for (let i = process.stack.length - 1; i >= 0; i--) {
-    const parentState = process.stack[i];
-    const parentStateKey = parentState.key;
-    const descriptor = parentState.descriptor;
-    for (const sKey of [stateKey, KEYS.STATE_ANY]) {
-      const stateTransitions = descriptor.transitions[sKey];
-      if (!stateTransitions) continue;
-      for (const[eventKey, targetKey] of Object.entries(stateTransitions)) {
-        list.push([parentStateKey, sKey, eventKey, targetKey]);
-      }
-    }
-    stateKey = parentStateKey;
-  }
-  return list;
-}
-
 function getTargetStateKey(descriptor, stateKey, eventKey) {
   const pairs = [
     [stateKey, eventKey],
@@ -272,6 +240,98 @@ function newAsyncProcess({
   return process;
 }
 
+function initProcess({ config, handler, handleError = console.error }) {
+  let process;
+  const before = async (process) => {
+    process._started = true;
+    const state = process.current;
+    handler(state);
+    await state.init.run();
+  };
+  const after = async (process) => {
+    const state = process.current;
+    await state.done.run();
+  };
+
+  process = newAsyncProcess({
+    config,
+    before,
+    after,
+    newProcess: (descriptor) => {
+      return {
+        descriptor,
+        config,
+        status: 0,
+        stack: [],
+        event: undefined,
+        current: undefined
+      };
+    },
+    newState: (state) => {
+      state.init = newStateMethod();
+      state.done = newStateMethod();
+      state.dispatch = (...args) => state.process.dispatch(...args);
+      state.getEvent = () => state.process.event || {};
+      state.getEventKey = () => state.getEvent().key;
+      return state;
+    },
+    handleError
+  });
+  process.dispatch = (key, params = {}) => {
+    process.next({ key, params });
+  };
+  return process;
+
+  function newStateMethod() {
+    const list = [];
+    return Object.assign((m) => list.push(m), {
+      run: async (...args) => {
+        // We use the index to iterate over the list: the list can be updated by called methods
+        for (let i = 0; i < list.length; i++) {
+          try {
+            list[i] && (await list[i](...args));
+          } catch (error) {
+            console.error(error);
+            await handleError(error);
+          }
+        }
+      }
+    });
+  }
+}
+
+/**
+ * Returns all possible transitions from the current state of the process.
+ * @param {Object} options - method parameters
+ * @param {Process} options.process - the current process for which 
+ * all transitions should be returned
+ * @returns {Array<Object>} - an array of all transitions;
+ * each entry in this returned array contains the following keys:
+ * 1) parentStateKey - key of the state where the transition can be activated
+ * 2) sourceStateKey - the initial transition state
+ * 3) eventKey - key of the event activating transition
+ * 4) targetStateKey - the resulting state for this transition
+ * 
+ */
+function getAllTransitions(process) {
+  const list = [];
+  let stateKey = process.current ? process.current.key : KEYS.STATE_INITIAL;
+  for (let i = process.stack.length - 1; i >= 0; i--) {
+    const parentState = process.stack[i];
+    const parentStateKey = parentState.key;
+    const descriptor = parentState.descriptor;
+    for (const sKey of [stateKey, KEYS.STATE_ANY]) {
+      const stateTransitions = descriptor.transitions[sKey];
+      if (!stateTransitions) continue;
+      for (const[eventKey, targetKey] of Object.entries(stateTransitions)) {
+        list.push([parentStateKey, sKey, eventKey, targetKey]);
+      }
+    }
+    stateKey = parentStateKey;
+  }
+  return list;
+}
+
 function newSyncProcess({
   config,
   descriptor,
@@ -304,15 +364,9 @@ exports.getAllStateKeys = getAllStateKeys;
 exports.getAllTransitions = getAllTransitions;
 exports.getStateDescriptor = getStateDescriptor;
 exports.getTargetStateKey = getTargetStateKey;
-exports.newAsyncProcess = newAsyncProcess;
+exports.initAsyncProcess = initProcess;
 exports.newProcessInstance = newProcessInstance;
 exports.newSyncProcess = newSyncProcess;
-Object.keys(tree).forEach(function (k) {
-if (k !== 'default' && !exports.hasOwnProperty(k)) Object.defineProperty(exports, k, {
-enumerable: true,
-get: function () { return tree[k]; }
-});
-});
 
 Object.defineProperty(exports, '__esModule', { value: true });
 

package/dist/index-umd.min.js

@@ -1,2 +1,2 @@
-// @statewalker/fsm v0.10.1 https://github.com/statewalker/statewalker-tree Copyright 2022 Mikhail Kotelnikov
-!function(e,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports,require("@statewalker/tree")):"function"==typeof define&&define.amd?define(["exports","@statewalker/tree"],t):t(((e="undefined"!=typeof globalThis?globalThis:e||self).statewalker=e.statewalker||{},e.statewalker.fsm=e.statewalker.fsm||{}),e.statewalker.tree)}(this,(function(e,t){"use strict";function n(e={}){const{key:t,transitions:s=[],states:r={},options:o,...c}=e,i={key:t,transitions:{},states:{},options:Object.assign(o||{},c)};for(const e of s){let t,n,s;if(Array.isArray(e))t=e[0],n=e[1],s=e[2];else{const{from:r,event:o,to:c}=e;t=r,n=o,s=c}(i.transitions[t]=i.transitions[t]||{})[n]=s}if(Array.isArray(r))for(const e of r)i.states[e.key]=n(e);else if(r)for(const e of Object.keys(r))i.states[e]=n(r[e]);return i}var s={STATE_ANY:"*",STATE_INITIAL:"",STATE_FINAL:"",EVENT_ANY:"*",EVENT_EMPTY:""};function r(e,t){let n;for(let s=e.stack.length-1;!n&&s>=0;s--){n=(e.stack[s].descriptor.states||{})[t]}return n||{transitions:{},states:{}}}function o(e,t,n){const r=[[t,n],[s.STATE_ANY,n],[t,s.EVENT_ANY],[s.STATE_ANY,s.EVENT_ANY]];let o;for(let t=0,n=r.length;void 0===o&&t<n;t++){const[n,c]=r[t],i=e.transitions[n];i&&(o=i[c],void 0===o&&(o=i[s.EVENT_ANY]))}return void 0!==o?o:s.STATE_FINAL}function c({config:e,descriptor:c,newState:i=(e=>e),newProcess:a=(e=>({descriptor:e,status:0,stack:[],event:void 0,current:void 0}))}){const f=a(c=c||n(e));return[f,()=>{let e,n;if(f.status)if(f.stack.length){const c=f.event.key||s.EVENT_EMPTY;e=o(f.stack[f.stack.length-1].descriptor,f.status&t.MODE.ENTER?s.STATE_INITIAL:f.current?f.current.key:s.STATE_FINAL,c),e&&(n=r(f,e))}else e=s.STATE_FINAL;else n=f.descriptor,e=n.key;return e?i({process:f,key:e,descriptor:n}):null}]}e.KEYS=s,e.buildStateDescriptor=n,e.checkProcessDescriptor=function(e){return function e(t,n=[],r=[]){r=[...r,t.key];const o=Object.assign({key:t.key},function(e){const t={},n={};for(const[s,r]of Object.entries(e.transitions)){t[s]=(t[s]||0)+1;for(const e of Object.values(r))n[e]=(n[e]||0)+1}const r=[],o=[];for(const e of Object.keys(t))e===s.STATE_ANY||e===s.STATE_FINAL||e===s.STATE_INITIAL||e in n||r.push(e);for(const e of Object.keys(n))e===s.STATE_FINAL||e in t||o.push(e);return{unreachableStates:r,deadendStates:o}}(t));if(o.deadendStates.length||o.unreachableStates.length){const e={path:r};n.push(e),o.deadendStates.length&&(e.deadendStates=o.deadendStates),o.unreachableStates.length&&(e.unreachableStates=o.unreachableStates)}for(const s of Object.values(t.states))e(s,n,r);return n}(e)},e.getAllStateKeys=function(e){const t={},n=e=>t[e]=(t[e]||0)+1;return function e(t){n(t.key);for(const[e,s]of Object.entries(t.transitions)){n(e);for(const e of Object.values(s))n(e)}for(const[s,r]of Object.entries(t.states))n(s),e(r)}(e),Object.keys(t).sort()},e.getAllTransitions=function(e){const t=[];let n=e.current?e.current.key:s.STATE_INITIAL;for(let r=e.stack.length-1;r>=0;r--){const o=e.stack[r],c=o.key,i=o.descriptor;for(const e of[n,s.STATE_ANY]){const n=i.transitions[e];if(n)for(const[s,r]of Object.entries(n))t.push([c,e,s,r])}n=c}return t},e.getStateDescriptor=r,e.getTargetStateKey=o,e.newAsyncProcess=function({config:e,descriptor:n,before:s,after:r,newProcess:o,newState:i,handleError:a=console.error}){const[f,u]=c({config:e,descriptor:n,newProcess:o,newState:i}),l=t.newAsyncTreeWalker(s,r,f);return f.finished=!1,f.next=e=>(f.nextEvent=e,f.running=f.running||Promise.resolve().then((async()=>{try{for(f.event=f.nextEvent,f.nextEvent=void 0;!f.finished&&f.event;)if(f.finished=!await l(u),f.status&t.MODE.EXIT&&f.nextEvent)f.event=f.nextEvent,f.nextEvent=void 0;else if(f.status&t.MODE.LEAF)break}catch(e){a(e)}})).finally((()=>f.running=void 0)).then((()=>!f.finished))),f},e.newProcessInstance=c,e.newSyncProcess=function({config:e,descriptor:n,before:s,after:r,newProcess:o,newState:i}){const[a,f]=c({config:e,descriptor:n,newProcess:o,newState:i}),u=t.newTreeWalker(s,r,a);return a.dispatch=a.next=e=>{for("string"==typeof e&&(e={key:e}),a.event=e;a.event;){if(!u(f))return!1;if(a.status&t.MODE.LEAF)return!0}},a},Object.keys(t).forEach((function(n){"default"===n||e.hasOwnProperty(n)||Object.defineProperty(e,n,{enumerable:!0,get:function(){return t[n]}})})),Object.defineProperty(e,"__esModule",{value:!0})}));
+// @statewalker/fsm v0.13.0 https://github.com/statewalker/statewalker-tree Copyright 2022 Mikhail Kotelnikov
+!function(e,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports,require("@statewalker/tree")):"function"==typeof define&&define.amd?define(["exports","@statewalker/tree"],t):t(((e="undefined"!=typeof globalThis?globalThis:e||self).statewalker=e.statewalker||{},e.statewalker.fsm=e.statewalker.fsm||{}),e.statewalker.tree)}(this,(function(e,t){"use strict";function n(e={}){const{key:t,transitions:s=[],states:r={},options:o,...c}=e,a={key:t,transitions:{},states:{},options:Object.assign(o||{},c)};for(const e of s){let t,n,s;if(Array.isArray(e))t=e[0],n=e[1],s=e[2];else{const{from:r,event:o,to:c}=e;t=r,n=o,s=c}(a.transitions[t]=a.transitions[t]||{})[n]=s}if(Array.isArray(r))for(const e of r)a.states[e.key]=n(e);else if(r)for(const e of Object.keys(r))a.states[e]=n(r[e]);return a}var s={STATE_ANY:"*",STATE_INITIAL:"",STATE_FINAL:"",EVENT_ANY:"*",EVENT_EMPTY:""};function r(e,t){let n;for(let s=e.stack.length-1;!n&&s>=0;s--){n=(e.stack[s].descriptor.states||{})[t]}return n||{transitions:{},states:{}}}function o(e,t,n){const r=[[t,n],[s.STATE_ANY,n],[t,s.EVENT_ANY],[s.STATE_ANY,s.EVENT_ANY]];let o;for(let t=0,n=r.length;void 0===o&&t<n;t++){const[n,c]=r[t],a=e.transitions[n];a&&(o=a[c],void 0===o&&(o=a[s.EVENT_ANY]))}return void 0!==o?o:s.STATE_FINAL}function c({config:e,descriptor:c,newState:a=(e=>e),newProcess:i=(e=>({descriptor:e,status:0,stack:[],event:void 0,current:void 0}))}){const f=i(c=c||n(e));return[f,()=>{let e,n;if(f.status)if(f.stack.length){const c=f.event.key||s.EVENT_EMPTY;e=o(f.stack[f.stack.length-1].descriptor,f.status&t.MODE.ENTER?s.STATE_INITIAL:f.current?f.current.key:s.STATE_FINAL,c),e&&(n=r(f,e))}else e=s.STATE_FINAL;else n=f.descriptor,e=n.key;return e?a({process:f,key:e,descriptor:n}):null}]}e.KEYS=s,e.buildStateDescriptor=n,e.checkProcessDescriptor=function(e){return function e(t,n=[],r=[]){r=[...r,t.key];const o=Object.assign({key:t.key},function(e){const t={},n={};for(const[s,r]of Object.entries(e.transitions)){t[s]=(t[s]||0)+1;for(const e of Object.values(r))n[e]=(n[e]||0)+1}const r=[],o=[];for(const e of Object.keys(t))e===s.STATE_ANY||e===s.STATE_FINAL||e===s.STATE_INITIAL||e in n||r.push(e);for(const e of Object.keys(n))e===s.STATE_FINAL||e in t||o.push(e);return{unreachableStates:r,deadendStates:o}}(t));if(o.deadendStates.length||o.unreachableStates.length){const e={path:r};n.push(e),o.deadendStates.length&&(e.deadendStates=o.deadendStates),o.unreachableStates.length&&(e.unreachableStates=o.unreachableStates)}for(const s of Object.values(t.states))e(s,n,r);return n}(e)},e.getAllStateKeys=function(e){const t={},n=e=>t[e]=(t[e]||0)+1;return function e(t){n(t.key);for(const[e,s]of Object.entries(t.transitions)){n(e);for(const e of Object.values(s))n(e)}for(const[s,r]of Object.entries(t.states))n(s),e(r)}(e),Object.keys(t).sort()},e.getAllTransitions=function(e){const t=[];let n=e.current?e.current.key:s.STATE_INITIAL;for(let r=e.stack.length-1;r>=0;r--){const o=e.stack[r],c=o.key,a=o.descriptor;for(const e of[n,s.STATE_ANY]){const n=a.transitions[e];if(n)for(const[s,r]of Object.entries(n))t.push([c,e,s,r])}n=c}return t},e.getStateDescriptor=r,e.getTargetStateKey=o,e.initAsyncProcess=function({config:e,handler:n,handleError:s=console.error}){let r;return r=function({config:e,descriptor:n,before:s,after:r,newProcess:o,newState:a,handleError:i=console.error}){const[f,u]=c({config:e,descriptor:n,newProcess:o,newState:a}),l=t.newAsyncTreeWalker(s,r,f);return f.finished=!1,f.next=e=>(f.nextEvent=e,f.running=f.running||Promise.resolve().then((async()=>{try{for(f.event=f.nextEvent,f.nextEvent=void 0;!f.finished&&f.event;)if(f.finished=!await l(u),f.status&t.MODE.EXIT&&f.nextEvent)f.event=f.nextEvent,f.nextEvent=void 0;else if(f.status&t.MODE.LEAF)break}catch(e){i(e)}})).finally((()=>f.running=void 0)).then((()=>!f.finished))),f}({config:e,before:async e=>{e._started=!0;const t=e.current;n(t),await t.init.run()},after:async e=>{const t=e.current;await t.done.run()},newProcess:t=>({descriptor:t,config:e,status:0,stack:[],event:void 0,current:void 0}),newState:e=>(e.init=o(),e.done=o(),e.dispatch=(...t)=>e.process.dispatch(...t),e.getEvent=()=>e.process.event||{},e.getEventKey=()=>e.getEvent().key,e),handleError:s}),r.dispatch=(e,t={})=>{r.next({key:e,params:t})},r;function o(){const e=[];return Object.assign((t=>e.push(t)),{run:async(...t)=>{for(let n=0;n<e.length;n++)try{e[n]&&await e[n](...t)}catch(e){console.error(e),await s(e)}}})}},e.newProcessInstance=c,e.newSyncProcess=function({config:e,descriptor:n,before:s,after:r,newProcess:o,newState:a}){const[i,f]=c({config:e,descriptor:n,newProcess:o,newState:a}),u=t.newTreeWalker(s,r,i);return i.dispatch=i.next=e=>{for("string"==typeof e&&(e={key:e}),i.event=e;i.event;){if(!u(f))return!1;if(i.status&t.MODE.LEAF)return!0}},i},Object.defineProperty(e,"__esModule",{value:!0})}));

package/dist/index.js

@@ -1,6 +1,5 @@
-// @statewalker/fsm v0.10.1 https://github.com/statewalker/statewalker-tree Copyright 2022 Mikhail Kotelnikov
+// @statewalker/fsm v0.13.0 https://github.com/statewalker/statewalker-tree Copyright 2022 Mikhail Kotelnikov
 import { MODE, newAsyncTreeWalker, newTreeWalker } from '@statewalker/tree';
-export * from '@statewalker/tree';
 
 function buildStateDescriptor(config = {}) {
   const { key, transitions = [], states = {}, options, ...params } = config;
@@ -135,38 +134,6 @@ function getAllStateKeys(descriptor) {
   }
 }
 
-/**
- * Returns all possible transitions from the current state of the process.
- * @param {Object} options - method parameters
- * @param {Process} options.process - the current process for which 
- * all transitions should be returned
- * @returns {Array<Object>} - an array of all transitions;
- * each entry in this returned array contains the following keys:
- * 1) parentStateKey - key of the state where the transition can be activated
- * 2) sourceStateKey - the initial transition state
- * 3) eventKey - key of the event activating transition
- * 4) targetStateKey - the resulting state for this transition
- * 
- */
-function getAllTransitions(process) {
-  const list = [];
-  let stateKey = process.current ? process.current.key : KEYS.STATE_INITIAL;
-  for (let i = process.stack.length - 1; i >= 0; i--) {
-    const parentState = process.stack[i];
-    const parentStateKey = parentState.key;
-    const descriptor = parentState.descriptor;
-    for (const sKey of [stateKey, KEYS.STATE_ANY]) {
-      const stateTransitions = descriptor.transitions[sKey];
-      if (!stateTransitions) continue;
-      for (const[eventKey, targetKey] of Object.entries(stateTransitions)) {
-        list.push([parentStateKey, sKey, eventKey, targetKey]);
-      }
-    }
-    stateKey = parentStateKey;
-  }
-  return list;
-}
-
 function getTargetStateKey(descriptor, stateKey, eventKey) {
   const pairs = [
     [stateKey, eventKey],
@@ -269,6 +236,98 @@ function newAsyncProcess({
   return process;
 }
 
+function initProcess({ config, handler, handleError = console.error }) {
+  let process;
+  const before = async (process) => {
+    process._started = true;
+    const state = process.current;
+    handler(state);
+    await state.init.run();
+  };
+  const after = async (process) => {
+    const state = process.current;
+    await state.done.run();
+  };
+
+  process = newAsyncProcess({
+    config,
+    before,
+    after,
+    newProcess: (descriptor) => {
+      return {
+        descriptor,
+        config,
+        status: 0,
+        stack: [],
+        event: undefined,
+        current: undefined
+      };
+    },
+    newState: (state) => {
+      state.init = newStateMethod();
+      state.done = newStateMethod();
+      state.dispatch = (...args) => state.process.dispatch(...args);
+      state.getEvent = () => state.process.event || {};
+      state.getEventKey = () => state.getEvent().key;
+      return state;
+    },
+    handleError
+  });
+  process.dispatch = (key, params = {}) => {
+    process.next({ key, params });
+  };
+  return process;
+
+  function newStateMethod() {
+    const list = [];
+    return Object.assign((m) => list.push(m), {
+      run: async (...args) => {
+        // We use the index to iterate over the list: the list can be updated by called methods
+        for (let i = 0; i < list.length; i++) {
+          try {
+            list[i] && (await list[i](...args));
+          } catch (error) {
+            console.error(error);
+            await handleError(error);
+          }
+        }
+      }
+    });
+  }
+}
+
+/**
+ * Returns all possible transitions from the current state of the process.
+ * @param {Object} options - method parameters
+ * @param {Process} options.process - the current process for which 
+ * all transitions should be returned
+ * @returns {Array<Object>} - an array of all transitions;
+ * each entry in this returned array contains the following keys:
+ * 1) parentStateKey - key of the state where the transition can be activated
+ * 2) sourceStateKey - the initial transition state
+ * 3) eventKey - key of the event activating transition
+ * 4) targetStateKey - the resulting state for this transition
+ * 
+ */
+function getAllTransitions(process) {
+  const list = [];
+  let stateKey = process.current ? process.current.key : KEYS.STATE_INITIAL;
+  for (let i = process.stack.length - 1; i >= 0; i--) {
+    const parentState = process.stack[i];
+    const parentStateKey = parentState.key;
+    const descriptor = parentState.descriptor;
+    for (const sKey of [stateKey, KEYS.STATE_ANY]) {
+      const stateTransitions = descriptor.transitions[sKey];
+      if (!stateTransitions) continue;
+      for (const[eventKey, targetKey] of Object.entries(stateTransitions)) {
+        list.push([parentStateKey, sKey, eventKey, targetKey]);
+      }
+    }
+    stateKey = parentStateKey;
+  }
+  return list;
+}
+
 function newSyncProcess({
   config,
   descriptor,
@@ -294,4 +353,4 @@ function newSyncProcess({
   return process;
 }
 
-export { KEYS, buildStateDescriptor, checkProcessDescriptor, getAllStateKeys, getAllTransitions, getStateDescriptor, getTargetStateKey, newAsyncProcess, newProcessInstance, newSyncProcess };
+export { KEYS, buildStateDescriptor, checkProcessDescriptor, getAllStateKeys, getAllTransitions, getStateDescriptor, getTargetStateKey, initProcess as initAsyncProcess, newProcessInstance, newSyncProcess };

package/dist/index.min.js

@@ -1,2 +1,2 @@
-// @statewalker/fsm v0.10.1 https://github.com/statewalker/statewalker-tree Copyright 2022 Mikhail Kotelnikov
-import{MODE as t,newAsyncTreeWalker as e,newTreeWalker as n}from"@statewalker/tree";export*from"@statewalker/tree";function s(t={}){const{key:e,transitions:n=[],states:r={},options:o,...c}=t,i={key:e,transitions:{},states:{},options:Object.assign(o||{},c)};for(const t of n){let e,n,s;if(Array.isArray(t))e=t[0],n=t[1],s=t[2];else{const{from:r,event:o,to:c}=t;e=r,n=o,s=c}(i.transitions[e]=i.transitions[e]||{})[n]=s}if(Array.isArray(r))for(const t of r)i.states[t.key]=s(t);else if(r)for(const t of Object.keys(r))i.states[t]=s(r[t]);return i}var r={STATE_ANY:"*",STATE_INITIAL:"",STATE_FINAL:"",EVENT_ANY:"*",EVENT_EMPTY:""};function o(t){return function t(e,n=[],s=[]){s=[...s,e.key];const o=Object.assign({key:e.key},function(t){const e={},n={};for(const[s,r]of Object.entries(t.transitions)){e[s]=(e[s]||0)+1;for(const t of Object.values(r))n[t]=(n[t]||0)+1}const s=[],o=[];for(const t of Object.keys(e))t===r.STATE_ANY||t===r.STATE_FINAL||t===r.STATE_INITIAL||t in n||s.push(t);for(const t of Object.keys(n))t===r.STATE_FINAL||t in e||o.push(t);return{unreachableStates:s,deadendStates:o}}(e));if(o.deadendStates.length||o.unreachableStates.length){const t={path:s};n.push(t),o.deadendStates.length&&(t.deadendStates=o.deadendStates),o.unreachableStates.length&&(t.unreachableStates=o.unreachableStates)}for(const r of Object.values(e.states))t(r,n,s);return n}(t)}function c(t,e){let n;for(let s=t.stack.length-1;!n&&s>=0;s--){n=(t.stack[s].descriptor.states||{})[e]}return n||{transitions:{},states:{}}}function i(t){const e={},n=t=>e[t]=(e[t]||0)+1;return function t(e){n(e.key);for(const[t,s]of Object.entries(e.transitions)){n(t);for(const t of Object.values(s))n(t)}for(const[s,r]of Object.entries(e.states))n(s),t(r)}(t),Object.keys(e).sort()}function a(t){const e=[];let n=t.current?t.current.key:r.STATE_INITIAL;for(let s=t.stack.length-1;s>=0;s--){const o=t.stack[s],c=o.key,i=o.descriptor;for(const t of[n,r.STATE_ANY]){const n=i.transitions[t];if(n)for(const[s,r]of Object.entries(n))e.push([c,t,s,r])}n=c}return e}function f(t,e,n){const s=[[e,n],[r.STATE_ANY,n],[e,r.EVENT_ANY],[r.STATE_ANY,r.EVENT_ANY]];let o;for(let e=0,n=s.length;void 0===o&&e<n;e++){const[n,c]=s[e],i=t.transitions[n];i&&(o=i[c],void 0===o&&(o=i[r.EVENT_ANY]))}return void 0!==o?o:r.STATE_FINAL}function u({config:e,descriptor:n,newState:o=(t=>t),newProcess:i=(t=>({descriptor:t,status:0,stack:[],event:void 0,current:void 0}))}){const a=i(n=n||s(e));return[a,()=>{let e,n;if(a.status)if(a.stack.length){const s=a.event.key||r.EVENT_EMPTY;e=f(a.stack[a.stack.length-1].descriptor,a.status&t.ENTER?r.STATE_INITIAL:a.current?a.current.key:r.STATE_FINAL,s),e&&(n=c(a,e))}else e=r.STATE_FINAL;else n=a.descriptor,e=n.key;return e?o({process:a,key:e,descriptor:n}):null}]}function T({config:n,descriptor:s,before:r,after:o,newProcess:c,newState:i,handleError:a=console.error}){const[f,T]=u({config:n,descriptor:s,newProcess:c,newState:i}),E=e(r,o,f);return f.finished=!1,f.next=e=>(f.nextEvent=e,f.running=f.running||Promise.resolve().then((async()=>{try{for(f.event=f.nextEvent,f.nextEvent=void 0;!f.finished&&f.event;)if(f.finished=!await E(T),f.status&t.EXIT&&f.nextEvent)f.event=f.nextEvent,f.nextEvent=void 0;else if(f.status&t.LEAF)break}catch(t){a(t)}})).finally((()=>f.running=void 0)).then((()=>!f.finished))),f}function E({config:e,descriptor:s,before:r,after:o,newProcess:c,newState:i}){const[a,f]=u({config:e,descriptor:s,newProcess:c,newState:i}),T=n(r,o,a);return a.dispatch=a.next=e=>{for("string"==typeof e&&(e={key:e}),a.event=e;a.event;){if(!T(f))return!1;if(a.status&t.LEAF)return!0}},a}export{r as KEYS,s as buildStateDescriptor,o as checkProcessDescriptor,i as getAllStateKeys,a as getAllTransitions,c as getStateDescriptor,f as getTargetStateKey,T as newAsyncProcess,u as newProcessInstance,E as newSyncProcess};
+// @statewalker/fsm v0.13.0 https://github.com/statewalker/statewalker-tree Copyright 2022 Mikhail Kotelnikov
+import{MODE as t,newAsyncTreeWalker as e,newTreeWalker as n}from"@statewalker/tree";function s(t={}){const{key:e,transitions:n=[],states:r={},options:o,...c}=t,i={key:e,transitions:{},states:{},options:Object.assign(o||{},c)};for(const t of n){let e,n,s;if(Array.isArray(t))e=t[0],n=t[1],s=t[2];else{const{from:r,event:o,to:c}=t;e=r,n=o,s=c}(i.transitions[e]=i.transitions[e]||{})[n]=s}if(Array.isArray(r))for(const t of r)i.states[t.key]=s(t);else if(r)for(const t of Object.keys(r))i.states[t]=s(r[t]);return i}var r={STATE_ANY:"*",STATE_INITIAL:"",STATE_FINAL:"",EVENT_ANY:"*",EVENT_EMPTY:""};function o(t){return function t(e,n=[],s=[]){s=[...s,e.key];const o=Object.assign({key:e.key},function(t){const e={},n={};for(const[s,r]of Object.entries(t.transitions)){e[s]=(e[s]||0)+1;for(const t of Object.values(r))n[t]=(n[t]||0)+1}const s=[],o=[];for(const t of Object.keys(e))t===r.STATE_ANY||t===r.STATE_FINAL||t===r.STATE_INITIAL||t in n||s.push(t);for(const t of Object.keys(n))t===r.STATE_FINAL||t in e||o.push(t);return{unreachableStates:s,deadendStates:o}}(e));if(o.deadendStates.length||o.unreachableStates.length){const t={path:s};n.push(t),o.deadendStates.length&&(t.deadendStates=o.deadendStates),o.unreachableStates.length&&(t.unreachableStates=o.unreachableStates)}for(const r of Object.values(e.states))t(r,n,s);return n}(t)}function c(t,e){let n;for(let s=t.stack.length-1;!n&&s>=0;s--){n=(t.stack[s].descriptor.states||{})[e]}return n||{transitions:{},states:{}}}function i(t){const e={},n=t=>e[t]=(e[t]||0)+1;return function t(e){n(e.key);for(const[t,s]of Object.entries(e.transitions)){n(t);for(const t of Object.values(s))n(t)}for(const[s,r]of Object.entries(e.states))n(s),t(r)}(t),Object.keys(e).sort()}function a(t,e,n){const s=[[e,n],[r.STATE_ANY,n],[e,r.EVENT_ANY],[r.STATE_ANY,r.EVENT_ANY]];let o;for(let e=0,n=s.length;void 0===o&&e<n;e++){const[n,c]=s[e],i=t.transitions[n];i&&(o=i[c],void 0===o&&(o=i[r.EVENT_ANY]))}return void 0!==o?o:r.STATE_FINAL}function f({config:e,descriptor:n,newState:o=(t=>t),newProcess:i=(t=>({descriptor:t,status:0,stack:[],event:void 0,current:void 0}))}){const f=i(n=n||s(e));return[f,()=>{let e,n;if(f.status)if(f.stack.length){const s=f.event.key||r.EVENT_EMPTY;e=a(f.stack[f.stack.length-1].descriptor,f.status&t.ENTER?r.STATE_INITIAL:f.current?f.current.key:r.STATE_FINAL,s),e&&(n=c(f,e))}else e=r.STATE_FINAL;else n=f.descriptor,e=n.key;return e?o({process:f,key:e,descriptor:n}):null}]}function u({config:n,handler:s,handleError:r=console.error}){let o;return o=function({config:n,descriptor:s,before:r,after:o,newProcess:c,newState:i,handleError:a=console.error}){const[u,d]=f({config:n,descriptor:s,newProcess:c,newState:i}),l=e(r,o,u);return u.finished=!1,u.next=e=>(u.nextEvent=e,u.running=u.running||Promise.resolve().then((async()=>{try{for(u.event=u.nextEvent,u.nextEvent=void 0;!u.finished&&u.event;)if(u.finished=!await l(d),u.status&t.EXIT&&u.nextEvent)u.event=u.nextEvent,u.nextEvent=void 0;else if(u.status&t.LEAF)break}catch(t){a(t)}})).finally((()=>u.running=void 0)).then((()=>!u.finished))),u}({config:n,before:async t=>{t._started=!0;const e=t.current;s(e),await e.init.run()},after:async t=>{const e=t.current;await e.done.run()},newProcess:t=>({descriptor:t,config:n,status:0,stack:[],event:void 0,current:void 0}),newState:t=>(t.init=c(),t.done=c(),t.dispatch=(...e)=>t.process.dispatch(...e),t.getEvent=()=>t.process.event||{},t.getEventKey=()=>t.getEvent().key,t),handleError:r}),o.dispatch=(t,e={})=>{o.next({key:t,params:e})},o;function c(){const t=[];return Object.assign((e=>t.push(e)),{run:async(...e)=>{for(let n=0;n<t.length;n++)try{t[n]&&await t[n](...e)}catch(t){console.error(t),await r(t)}}})}}function d(t){const e=[];let n=t.current?t.current.key:r.STATE_INITIAL;for(let s=t.stack.length-1;s>=0;s--){const o=t.stack[s],c=o.key,i=o.descriptor;for(const t of[n,r.STATE_ANY]){const n=i.transitions[t];if(n)for(const[s,r]of Object.entries(n))e.push([c,t,s,r])}n=c}return e}function l({config:e,descriptor:s,before:r,after:o,newProcess:c,newState:i}){const[a,u]=f({config:e,descriptor:s,newProcess:c,newState:i}),d=n(r,o,a);return a.dispatch=a.next=e=>{for("string"==typeof e&&(e={key:e}),a.event=e;a.event;){if(!d(u))return!1;if(a.status&t.LEAF)return!0}},a}export{r as KEYS,s as buildStateDescriptor,o as checkProcessDescriptor,i as getAllStateKeys,d as getAllTransitions,c as getStateDescriptor,a as getTargetStateKey,u as initAsyncProcess,f as newProcessInstance,l as newSyncProcess};

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@statewalker/fsm",
-  "version": "0.10.1",
+  "version": "0.13.0",
   "description": "HFSM Implementation",
   "keywords": [],
   "homepage": "https://github.com/statewalker/statewalker-tree",

package/src/index.js

@@ -1,11 +1,10 @@
-export * from "@statewalker/tree";
 export { default as buildStateDescriptor } from "./buildStateDescriptor.js";
 export { default as checkProcessDescriptor } from "./checkProcessDescriptor.js";
 export { default as getStateDescriptor } from "./getStateDescriptor.js";
 export { default as getAllStateKeys } from "./getAllStateKeys.js";
-export { default as getAllTransitions } from "./getAllTransitions.js";
 export { default as getTargetStateKey } from "./getTargetStateKey.js";
 export { default as KEYS } from "./KEYS.js";
-export { default as newAsyncProcess } from "./newAsyncProcess.js";
+export { default as initAsyncProcess } from "./initAsyncProcess.js";
+export { default as getAllTransitions } from "./getAllTransitions.js";
 export { default as newProcessInstance } from "./newProcessInstance.js";
 export { default as newSyncProcess } from "./newSyncProcess.js";

package/src/initAsyncProcess.js

@@ -0,0 +1,61 @@
+import newAsyncProcess from "./newAsyncProcess.js";
+
+export default function initProcess({ config, handler, handleError = console.error }) {
+  let process;
+  const before = async (process) => {
+    process._started = true;
+    const state = process.current;
+    handler(state);
+    await state.init.run();
+  };
+  const after = async (process) => {
+    const state = process.current;
+    await state.done.run();
+  };
+
+  process = newAsyncProcess({
+    config,
+    before,
+    after,
+    newProcess: (descriptor) => {
+      return {
+        descriptor,
+        config,
+        status: 0,
+        stack: [],
+        event: undefined,
+        current: undefined
+      };
+    },
+    newState: (state) => {
+      state.init = newStateMethod();
+      state.done = newStateMethod();
+      state.dispatch = (...args) => state.process.dispatch(...args);
+      state.getEvent = () => state.process.event || {};
+      state.getEventKey = () => state.getEvent().key;
+      return state;
+    },
+    handleError
+  });
+  process.dispatch = (key, params = {}) => {
+    process.next({ key, params });
+  };
+  return process;
+
+  function newStateMethod() {
+    const list = [];
+    return Object.assign((m) => list.push(m), {
+      run: async (...args) => {
+        // We use the index to iterate over the list: the list can be updated by called methods
+        for (let i = 0; i < list.length; i++) {
+          try {
+            list[i] && (await list[i](...args));
+          } catch (error) {
+            console.error(error);
+            await handleError(error);
+          }
+        }
+      }
+    });
+  }
+}