@statewalker/fsm-charts 0.2.3 → 0.2.5

package/src/dagre/layout.js

@@ -1,113 +1,111 @@
-import { _ } from '../lodash-es/index.ts';
-import { Graph } from '../graphlib/index.js';
-import { addBorderSegments } from './add-border-segments.js';
-import * as coordinateSystem from './coordinate-system.js';
-import * as acyclic from './acyclic.js';
-import * as normalize from './normalize.js';
-import { rank } from './rank/index.js';
-import * as nestingGraph from './nesting-graph.js';
-import { order } from './order/index.js';
-import { parentDummyChains } from './parent-dummy-chains.js';
-import { position } from './position/index.js';
-import * as util from './util.js';
+import { Graph } from "../graphlib/index.js";
+import { _ } from "../lodash-es/index.ts";
+import * as acyclic from "./acyclic.js";
+import { addBorderSegments } from "./add-border-segments.js";
+import * as coordinateSystem from "./coordinate-system.js";
+import * as nestingGraph from "./nesting-graph.js";
+import * as normalize from "./normalize.js";
+import { order } from "./order/index.js";
+import { parentDummyChains } from "./parent-dummy-chains.js";
+import { position } from "./position/index.js";
+import { rank } from "./rank/index.js";
+import * as util from "./util.js";
 
 export { layout };
 
 function layout(g, opts) {
-  var time = opts && opts.debugTiming ? util.time : util.notime;
-  time('layout', function () {
-    var layoutGraph = time('  buildLayoutGraph', function () {
-      return buildLayoutGraph(g);
-    });
-    time('  runLayout', function () {
+  var time = opts?.debugTiming ? util.time : util.notime;
+  time("layout", () => {
+    var layoutGraph = time("  buildLayoutGraph", () => buildLayoutGraph(g));
+    time("  runLayout", () => {
       runLayout(layoutGraph, time);
     });
-    time('  updateInputGraph', function () {
+    time("  updateInputGraph", () => {
       updateInputGraph(g, layoutGraph);
     });
   });
 }
 
 function runLayout(g, time) {
-  time('    makeSpaceForEdgeLabels', function () {
+  time("    makeSpaceForEdgeLabels", () => {
     makeSpaceForEdgeLabels(g);
   });
-  time('    removeSelfEdges', function () {
+  time("    removeSelfEdges", () => {
     removeSelfEdges(g);
   });
-  time('    acyclic', function () {
+  time("    acyclic", () => {
     acyclic.run(g);
   });
-  time('    nestingGraph.run', function () {
+  time("    nestingGraph.run", () => {
     nestingGraph.run(g);
   });
-  time('    rank', function () {
+  time("    rank", () => {
     rank(util.asNonCompoundGraph(g));
   });
-  time('    injectEdgeLabelProxies', function () {
+  time("    injectEdgeLabelProxies", () => {
     injectEdgeLabelProxies(g);
   });
-  time('    removeEmptyRanks', function () {
+  time("    removeEmptyRanks", () => {
     util.removeEmptyRanks(g);
   });
-  time('    nestingGraph.cleanup', function () {
+  time("    nestingGraph.cleanup", () => {
     nestingGraph.cleanup(g);
   });
-  time('    normalizeRanks', function () {
+  time("    normalizeRanks", () => {
     util.normalizeRanks(g);
   });
-  time('    assignRankMinMax', function () {
+  time("    assignRankMinMax", () => {
     assignRankMinMax(g);
   });
-  time('    removeEdgeLabelProxies', function () {
+  time("    removeEdgeLabelProxies", () => {
     removeEdgeLabelProxies(g);
   });
-  time('    normalize.run', function () {
+  time("    normalize.run", () => {
     normalize.run(g);
   });
-  time('    parentDummyChains', function () {
+  time("    parentDummyChains", () => {
     parentDummyChains(g);
   });
-  time('    addBorderSegments', function () {
+  time("    addBorderSegments", () => {
     addBorderSegments(g);
   });
-  time('    order', function () {
+  time("    order", () => {
     order(g);
   });
-  time('    insertSelfEdges', function () {
+  time("    insertSelfEdges", () => {
     insertSelfEdges(g);
   });
-  time('    adjustCoordinateSystem', function () {
+  time("    adjustCoordinateSystem", () => {
     coordinateSystem.adjust(g);
   });
-  time('    position', function () {
+  time("    position", () => {
     position(g);
   });
-  time('    positionSelfEdges', function () {
+  time("    positionSelfEdges", () => {
     positionSelfEdges(g);
   });
-  time('    removeBorderNodes', function () {
+  time("    removeBorderNodes", () => {
     removeBorderNodes(g);
   });
-  time('    normalize.undo', function () {
+  time("    normalize.undo", () => {
     normalize.undo(g);
   });
-  time('    fixupEdgeLabelCoords', function () {
+  time("    fixupEdgeLabelCoords", () => {
     fixupEdgeLabelCoords(g);
   });
-  time('    undoCoordinateSystem', function () {
+  time("    undoCoordinateSystem", () => {
     coordinateSystem.undo(g);
   });
-  time('    translateGraph', function () {
+  time("    translateGraph", () => {
     translateGraph(g);
   });
-  time('    assignNodeIntersects', function () {
+  time("    assignNodeIntersects", () => {
     assignNodeIntersects(g);
   });
-  time('    reversePoints', function () {
+  time("    reversePoints", () => {
     reversePointsForReversedEdges(g);
   });
-  time('    acyclic.undo', function () {
+  time("    acyclic.undo", () => {
     acyclic.undo(g);
   });
 }
@@ -119,7 +117,7 @@ function runLayout(g, time) {
  * attributes can influence layout.
  */
 function updateInputGraph(inputGraph, layoutGraph) {
-  _.forEach(inputGraph.nodes(), function (v) {
+  _.forEach(inputGraph.nodes(), (v) => {
     var inputLabel = inputGraph.node(v);
     var layoutLabel = layoutGraph.node(v);
 
@@ -134,12 +132,12 @@ function updateInputGraph(inputGraph, layoutGraph) {
     }
   });
 
-  _.forEach(inputGraph.edges(), function (e) {
+  _.forEach(inputGraph.edges(), (e) => {
     var inputLabel = inputGraph.edge(e);
     var layoutLabel = layoutGraph.edge(e);
 
     inputLabel.points = layoutLabel.points;
-    if (_.has(layoutLabel, 'x')) {
+    if (_.has(layoutLabel, "x")) {
       inputLabel.x = layoutLabel.x;
       inputLabel.y = layoutLabel.y;
     }
@@ -149,21 +147,21 @@ function updateInputGraph(inputGraph, layoutGraph) {
   inputGraph.graph().height = layoutGraph.graph().height;
 }
 
-var graphNumAttrs = ['nodesep', 'edgesep', 'ranksep', 'marginx', 'marginy'];
-var graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: 'tb' };
-var graphAttrs = ['acyclicer', 'ranker', 'rankdir', 'align'];
-var nodeNumAttrs = ['width', 'height'];
+var graphNumAttrs = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"];
+var graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" };
+var graphAttrs = ["acyclicer", "ranker", "rankdir", "align"];
+var nodeNumAttrs = ["width", "height"];
 var nodeDefaults = { width: 0, height: 0 };
-var edgeNumAttrs = ['minlen', 'weight', 'width', 'height', 'labeloffset'];
+var edgeNumAttrs = ["minlen", "weight", "width", "height", "labeloffset"];
 var edgeDefaults = {
   minlen: 1,
   weight: 1,
   width: 0,
   height: 0,
   labeloffset: 10,
-  labelpos: 'r',
+  labelpos: "r",
 };
-var edgeAttrs = ['labelpos'];
+var edgeAttrs = ["labelpos"];
 
 /*
  * Constructs a new graph from the input graph, which can be used for layout.
@@ -176,20 +174,33 @@ function buildLayoutGraph(inputGraph) {
   var graph = canonicalize(inputGraph.graph());
 
   g.setGraph(
-    _.merge({}, graphDefaults, selectNumberAttrs(graph, graphNumAttrs), _.pick(graph, graphAttrs))
+    _.merge(
+      {},
+      graphDefaults,
+      selectNumberAttrs(graph, graphNumAttrs),
+      _.pick(graph, graphAttrs),
+    ),
   );
 
-  _.forEach(inputGraph.nodes(), function (v) {
+  _.forEach(inputGraph.nodes(), (v) => {
     var node = canonicalize(inputGraph.node(v));
-    g.setNode(v, _.defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));
+    g.setNode(
+      v,
+      _.defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults),
+    );
     g.setParent(v, inputGraph.parent(v));
   });
 
-  _.forEach(inputGraph.edges(), function (e) {
+  _.forEach(inputGraph.edges(), (e) => {
     var edge = canonicalize(inputGraph.edge(e));
     g.setEdge(
       e,
-      _.merge({}, edgeDefaults, selectNumberAttrs(edge, edgeNumAttrs), _.pick(edge, edgeAttrs))
+      _.merge(
+        {},
+        edgeDefaults,
+        selectNumberAttrs(edge, edgeNumAttrs),
+        _.pick(edge, edgeAttrs),
+      ),
     );
   });
 
@@ -207,11 +218,11 @@ function buildLayoutGraph(inputGraph) {
 function makeSpaceForEdgeLabels(g) {
   var graph = g.graph();
   graph.ranksep /= 2;
-  _.forEach(g.edges(), function (e) {
+  _.forEach(g.edges(), (e) => {
     var edge = g.edge(e);
     edge.minlen *= 2;
-    if (edge.labelpos.toLowerCase() !== 'c') {
-      if (graph.rankdir === 'TB' || graph.rankdir === 'BT') {
+    if (edge.labelpos.toLowerCase() !== "c") {
+      if (graph.rankdir === "TB" || graph.rankdir === "BT") {
         edge.width += edge.labeloffset;
       } else {
         edge.height += edge.labeloffset;
@@ -227,20 +238,20 @@ function makeSpaceForEdgeLabels(g) {
  * label's position.
  */
 function injectEdgeLabelProxies(g) {
-  _.forEach(g.edges(), function (e) {
+  _.forEach(g.edges(), (e) => {
     var edge = g.edge(e);
     if (edge.width && edge.height) {
       var v = g.node(e.v);
       var w = g.node(e.w);
       var label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };
-      util.addDummyNode(g, 'edge-proxy', label, '_ep');
+      util.addDummyNode(g, "edge-proxy", label, "_ep");
     }
   });
 }
 
 function assignRankMinMax(g) {
   var maxRank = 0;
-  _.forEach(g.nodes(), function (v) {
+  _.forEach(g.nodes(), (v) => {
     var node = g.node(v);
     if (node.borderTop) {
       node.minRank = g.node(node.borderTop).rank;
@@ -253,9 +264,9 @@ function assignRankMinMax(g) {
 }
 
 function removeEdgeLabelProxies(g) {
-  _.forEach(g.nodes(), function (v) {
+  _.forEach(g.nodes(), (v) => {
     var node = g.node(v);
-    if (node.dummy === 'edge-proxy') {
+    if (node.dummy === "edge-proxy") {
       g.edge(node.e).labelRank = node.rank;
       g.removeNode(v);
     }
@@ -282,12 +293,12 @@ function translateGraph(g) {
     maxY = Math.max(maxY, y + h / 2);
   }
 
-  _.forEach(g.nodes(), function (v) {
+  _.forEach(g.nodes(), (v) => {
     getExtremes(g.node(v));
   });
-  _.forEach(g.edges(), function (e) {
+  _.forEach(g.edges(), (e) => {
     var edge = g.edge(e);
-    if (_.has(edge, 'x')) {
+    if (_.has(edge, "x")) {
       getExtremes(edge);
     }
   });
@@ -295,22 +306,22 @@ function translateGraph(g) {
   minX -= marginX;
   minY -= marginY;
 
-  _.forEach(g.nodes(), function (v) {
+  _.forEach(g.nodes(), (v) => {
     var node = g.node(v);
     node.x -= minX;
     node.y -= minY;
   });
 
-  _.forEach(g.edges(), function (e) {
+  _.forEach(g.edges(), (e) => {
     var edge = g.edge(e);
-    _.forEach(edge.points, function (p) {
+    _.forEach(edge.points, (p) => {
       p.x -= minX;
       p.y -= minY;
     });
-    if (_.has(edge, 'x')) {
+    if (_.has(edge, "x")) {
       edge.x -= minX;
     }
-    if (_.has(edge, 'y')) {
+    if (_.has(edge, "y")) {
       edge.y -= minY;
     }
   });
@@ -320,7 +331,7 @@ function translateGraph(g) {
 }
 
 function assignNodeIntersects(g) {
-  _.forEach(g.edges(), function (e) {
+  _.forEach(g.edges(), (e) => {
     var edge = g.edge(e);
     var nodeV = g.node(e.v);
     var nodeW = g.node(e.w);
@@ -339,17 +350,17 @@ function assignNodeIntersects(g) {
 }
 
 function fixupEdgeLabelCoords(g) {
-  _.forEach(g.edges(), function (e) {
+  _.forEach(g.edges(), (e) => {
     var edge = g.edge(e);
-    if (_.has(edge, 'x')) {
-      if (edge.labelpos === 'l' || edge.labelpos === 'r') {
+    if (_.has(edge, "x")) {
+      if (edge.labelpos === "l" || edge.labelpos === "r") {
         edge.width -= edge.labeloffset;
       }
       switch (edge.labelpos) {
-        case 'l':
+        case "l":
           edge.x -= edge.width / 2 + edge.labeloffset;
           break;
-        case 'r':
+        case "r":
           edge.x += edge.width / 2 + edge.labeloffset;
           break;
       }
@@ -358,7 +369,7 @@ function fixupEdgeLabelCoords(g) {
 }
 
 function reversePointsForReversedEdges(g) {
-  _.forEach(g.edges(), function (e) {
+  _.forEach(g.edges(), (e) => {
     var edge = g.edge(e);
     if (edge.reversed) {
       edge.points.reverse();
@@ -367,7 +378,7 @@ function reversePointsForReversedEdges(g) {
 }
 
 function removeBorderNodes(g) {
-  _.forEach(g.nodes(), function (v) {
+  _.forEach(g.nodes(), (v) => {
     if (g.children(v).length) {
       var node = g.node(v);
       var t = g.node(node.borderTop);
@@ -382,15 +393,15 @@ function removeBorderNodes(g) {
     }
   });
 
-  _.forEach(g.nodes(), function (v) {
-    if (g.node(v).dummy === 'border') {
+  _.forEach(g.nodes(), (v) => {
+    if (g.node(v).dummy === "border") {
       g.removeNode(v);
     }
   });
 }
 
 function removeSelfEdges(g) {
-  _.forEach(g.edges(), function (e) {
+  _.forEach(g.edges(), (e) => {
     if (e.v === e.w) {
       var node = g.node(e.v);
       if (!node.selfEdges) {
@@ -404,15 +415,15 @@ function removeSelfEdges(g) {
 
 function insertSelfEdges(g) {
   var layers = util.buildLayerMatrix(g);
-  _.forEach(layers, function (layer) {
+  _.forEach(layers, (layer) => {
     var orderShift = 0;
-    _.forEach(layer, function (v, i) {
+    _.forEach(layer, (v, i) => {
       var node = g.node(v);
       node.order = i + orderShift;
-      _.forEach(node.selfEdges, function (selfEdge) {
+      _.forEach(node.selfEdges, (selfEdge) => {
         util.addDummyNode(
           g,
-          'selfedge',
+          "selfedge",
           {
             width: selfEdge.label.width,
             height: selfEdge.label.height,
@@ -421,7 +432,7 @@ function insertSelfEdges(g) {
             e: selfEdge.e,
             label: selfEdge.label,
           },
-          '_se'
+          "_se",
         );
       });
       delete node.selfEdges;
@@ -430,9 +441,9 @@ function insertSelfEdges(g) {
 }
 
 function positionSelfEdges(g) {
-  _.forEach(g.nodes(), function (v) {
+  _.forEach(g.nodes(), (v) => {
     var node = g.node(v);
-    if (node.dummy === 'selfedge') {
+    if (node.dummy === "selfedge") {
       var selfNode = g.node(node.e.v);
       var x = selfNode.x + selfNode.width / 2;
       var y = selfNode.y;
@@ -459,7 +470,7 @@ function selectNumberAttrs(obj, attrs) {
 
 function canonicalize(attrs) {
   var newAttrs = {};
-  _.forEach(attrs, function (v, k) {
+  _.forEach(attrs, (v, k) => {
     newAttrs[k.toLowerCase()] = v;
   });
   return newAttrs;

package/src/dagre/nesting-graph.js

@@ -1,5 +1,5 @@
-import { _ } from '../lodash-es/index.ts';
-import * as util from './util.js';
+import { _ } from "../lodash-es/index.ts";
+import * as util from "./util.js";
 
 export { run, cleanup };
 
@@ -27,7 +27,7 @@ export { run, cleanup };
  * Graphs."
  */
 function run(g) {
-  var root = util.addDummyNode(g, 'root', {}, '_root');
+  var root = util.addDummyNode(g, "root", {}, "_root");
   var depths = treeDepths(g);
   var height = _.max(_.values(depths)) - 1; // Note: depths is an Object not an array
   var nodeSep = 2 * height + 1;
@@ -35,7 +35,7 @@ function run(g) {
   g.graph().nestingRoot = root;
 
   // Multiply minlen by nodeSep to align nodes on non-border ranks.
-  _.forEach(g.edges(), function (e) {
+  _.forEach(g.edges(), (e) => {
     g.edge(e).minlen *= nodeSep;
   });
 
@@ -43,7 +43,7 @@ function run(g) {
   var weight = sumWeights(g) + 1;
 
   // Create border nodes and link them up
-  _.forEach(g.children(), function (child) {
+  _.forEach(g.children(), (child) => {
     dfs(g, root, nodeSep, weight, height, depths, child);
   });
 
@@ -61,8 +61,8 @@ function dfs(g, root, nodeSep, weight, height, depths, v) {
     return;
   }
 
-  var top = util.addBorderNode(g, '_bt');
-  var bottom = util.addBorderNode(g, '_bb');
+  var top = util.addBorderNode(g, "_bt");
+  var bottom = util.addBorderNode(g, "_bb");
   var label = g.node(v);
 
   g.setParent(top, v);
@@ -70,7 +70,7 @@ function dfs(g, root, nodeSep, weight, height, depths, v) {
   g.setParent(bottom, v);
   label.borderBottom = bottom;
 
-  _.forEach(children, function (child) {
+  _.forEach(children, (child) => {
     dfs(g, root, nodeSep, weight, height, depths, child);
 
     var childNode = g.node(child);
@@ -101,34 +101,28 @@ function treeDepths(g) {
   var depths = {};
   function dfs(v, depth) {
     var children = g.children(v);
-    if (children && children.length) {
-      _.forEach(children, function (child) {
+    if (children?.length) {
+      _.forEach(children, (child) => {
         dfs(child, depth + 1);
       });
     }
     depths[v] = depth;
   }
-  _.forEach(g.children(), function (v) {
+  _.forEach(g.children(), (v) => {
     dfs(v, 1);
   });
   return depths;
 }
 
 function sumWeights(g) {
-  return _.reduce(
-    g.edges(),
-    function (acc, e) {
-      return acc + g.edge(e).weight;
-    },
-    0
-  );
+  return _.reduce(g.edges(), (acc, e) => acc + g.edge(e).weight, 0);
 }
 
 function cleanup(g) {
   var graphLabel = g.graph();
   g.removeNode(graphLabel.nestingRoot);
   delete graphLabel.nestingRoot;
-  _.forEach(g.edges(), function (e) {
+  _.forEach(g.edges(), (e) => {
     var edge = g.edge(e);
     if (edge.nestingEdge) {
       g.removeEdge(e);

package/src/dagre/normalize.js

@@ -1,5 +1,5 @@
-import { _ } from '../lodash-es/index.ts';
-import * as util from './util.js';
+import { _ } from "../lodash-es/index.ts";
+import * as util from "./util.js";
 
 export { run, undo };
 
@@ -21,7 +21,7 @@ export { run, undo };
  */
 function run(g) {
   g.graph().dummyChains = [];
-  _.forEach(g.edges(), function (edge) {
+  _.forEach(g.edges(), (edge) => {
     normalizeEdge(g, edge);
   });
 }
@@ -49,12 +49,12 @@ function normalizeEdge(g, e) {
       edgeObj: e,
       rank: vRank,
     };
-    dummy = util.addDummyNode(g, 'edge', attrs, '_d');
+    dummy = util.addDummyNode(g, "edge", attrs, "_d");
     if (vRank === labelRank) {
       attrs.width = edgeLabel.width;
       attrs.height = edgeLabel.height;
       // @ts-expect-error
-      attrs.dummy = 'edge-label';
+      attrs.dummy = "edge-label";
       // @ts-expect-error
       attrs.labelpos = edgeLabel.labelpos;
     }
@@ -69,7 +69,7 @@ function normalizeEdge(g, e) {
 }
 
 function undo(g) {
-  _.forEach(g.graph().dummyChains, function (v) {
+  _.forEach(g.graph().dummyChains, (v) => {
     var node = g.node(v);
     var origLabel = node.edgeLabel;
     var w;
@@ -78,7 +78,7 @@ function undo(g) {
       w = g.successors(v)[0];
       g.removeNode(v);
       origLabel.points.push({ x: node.x, y: node.y });
-      if (node.dummy === 'edge-label') {
+      if (node.dummy === "edge-label") {
         origLabel.x = node.x;
         origLabel.y = node.y;
         origLabel.width = node.width;

package/src/dagre/order/add-subgraph-constraints.js

@@ -1,4 +1,4 @@
-import { _ } from '../../lodash-es/index.ts';
+import { _ } from "../../lodash-es/index.ts";
 
 export { addSubgraphConstraints };
 
@@ -6,7 +6,7 @@ function addSubgraphConstraints(g, cg, vs) {
   var prev = {},
     rootPrev;
 
-  _.forEach(vs, function (v) {
+  _.forEach(vs, (v) => {
     var child = g.parent(v),
       parent,
       prevChild;

package/src/dagre/order/barycenter.d.ts

@@ -1,6 +1,6 @@
 export function barycenter(
   g: any,
-  movable: any
+  movable: any,
 ): (
   | {
       v: any;

package/src/dagre/order/barycenter.js

@@ -1,16 +1,16 @@
-import { _ } from '../../lodash-es/index.ts';
+import { _ } from "../../lodash-es/index.ts";
 
 export { barycenter };
 
 function barycenter(g, movable) {
-  return _.map(movable, function (v) {
+  return _.map(movable, (v) => {
     var inV = g.inEdges(v);
     if (!inV.length) {
       return { v: v };
     } else {
       var result = _.reduce(
         inV,
-        function (acc, e) {
+        (acc, e) => {
           var edge = g.edge(e),
             nodeU = g.node(e.v);
           return {
@@ -18,7 +18,7 @@ function barycenter(g, movable) {
             weight: acc.weight + edge.weight,
           };
         },
-        { sum: 0, weight: 0 }
+        { sum: 0, weight: 0 },
       );
 
       return {

package/src/dagre/order/build-layer-graph.d.ts

@@ -1,2 +1,2 @@
 export function buildLayerGraph(g: any, rank: any, relationship: any): Graph;
-import { Graph } from '../../graphlib/index.js';
+import { Graph } from "../../graphlib/index.js";