@statewalker/fsm-charts 0.2.4 → 0.2.5

package/src/dagre/acyclic.js

@@ -1,22 +1,21 @@
-import { _ } from '../lodash-es/index.ts';
-import { greedyFAS } from './greedy-fas.js';
+import { _ } from "../lodash-es/index.ts";
+import { greedyFAS } from "./greedy-fas.js";
 
 export { run, undo };
 
 function run(g) {
-  var fas = g.graph().acyclicer === 'greedy' ? greedyFAS(g, weightFn(g)) : dfsFAS(g);
-  _.forEach(fas, function (e) {
+  var fas =
+    g.graph().acyclicer === "greedy" ? greedyFAS(g, weightFn(g)) : dfsFAS(g);
+  _.forEach(fas, (e) => {
     var label = g.edge(e);
     g.removeEdge(e);
     label.forwardName = e.name;
     label.reversed = true;
-    g.setEdge(e.w, e.v, label, _.uniqueId('rev'));
+    g.setEdge(e.w, e.v, label, _.uniqueId("rev"));
   });
 
   function weightFn(g) {
-    return function (e) {
-      return g.edge(e).weight;
-    };
+    return (e) => g.edge(e).weight;
   }
 }
 
@@ -31,7 +30,7 @@ function dfsFAS(g) {
     }
     visited[v] = true;
     stack[v] = true;
-    _.forEach(g.outEdges(v), function (e) {
+    _.forEach(g.outEdges(v), (e) => {
       if (_.has(stack, e.w)) {
         fas.push(e);
       } else {
@@ -46,7 +45,7 @@ function dfsFAS(g) {
 }
 
 function undo(g) {
-  _.forEach(g.edges(), function (e) {
+  _.forEach(g.edges(), (e) => {
     var label = g.edge(e);
     if (label.reversed) {
       g.removeEdge(e);

package/src/dagre/add-border-segments.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 { addBorderSegments };
 
@@ -11,12 +11,16 @@ function addBorderSegments(g) {
       _.forEach(children, dfs);
     }
 
-    if (_.has(node, 'minRank')) {
+    if (_.has(node, "minRank")) {
       node.borderLeft = [];
       node.borderRight = [];
-      for (var rank = node.minRank, maxRank = node.maxRank + 1; rank < maxRank; ++rank) {
-        addBorderNode(g, 'borderLeft', '_bl', v, node, rank);
-        addBorderNode(g, 'borderRight', '_br', v, node, rank);
+      for (
+        var rank = node.minRank, maxRank = node.maxRank + 1;
+        rank < maxRank;
+        ++rank
+      ) {
+        addBorderNode(g, "borderLeft", "_bl", v, node, rank);
+        addBorderNode(g, "borderRight", "_br", v, node, rank);
       }
     }
   }
@@ -27,7 +31,7 @@ function addBorderSegments(g) {
 function addBorderNode(g, prop, prefix, sg, sgNode, rank) {
   var label = { width: 0, height: 0, rank: rank, borderType: prop };
   var prev = sgNode[prop][rank - 1];
-  var curr = util.addDummyNode(g, 'border', label, prefix);
+  var curr = util.addDummyNode(g, "border", label, prefix);
   sgNode[prop][rank] = curr;
   g.setParent(curr, sg);
   if (prev) {

package/src/dagre/coordinate-system.js

@@ -1,31 +1,31 @@
-import { _ } from '../lodash-es/index.ts';
+import { _ } from "../lodash-es/index.ts";
 
 export { adjust, undo };
 
 function adjust(g) {
   var rankDir = g.graph().rankdir.toLowerCase();
-  if (rankDir === 'lr' || rankDir === 'rl') {
+  if (rankDir === "lr" || rankDir === "rl") {
     swapWidthHeight(g);
   }
 }
 
 function undo(g) {
   var rankDir = g.graph().rankdir.toLowerCase();
-  if (rankDir === 'bt' || rankDir === 'rl') {
+  if (rankDir === "bt" || rankDir === "rl") {
     reverseY(g);
   }
 
-  if (rankDir === 'lr' || rankDir === 'rl') {
+  if (rankDir === "lr" || rankDir === "rl") {
     swapXY(g);
     swapWidthHeight(g);
   }
 }
 
 function swapWidthHeight(g) {
-  _.forEach(g.nodes(), function (v) {
+  _.forEach(g.nodes(), (v) => {
     swapWidthHeightOne(g.node(v));
   });
-  _.forEach(g.edges(), function (e) {
+  _.forEach(g.edges(), (e) => {
     swapWidthHeightOne(g.edge(e));
   });
 }
@@ -37,14 +37,14 @@ function swapWidthHeightOne(attrs) {
 }
 
 function reverseY(g) {
-  _.forEach(g.nodes(), function (v) {
+  _.forEach(g.nodes(), (v) => {
     reverseYOne(g.node(v));
   });
 
-  _.forEach(g.edges(), function (e) {
+  _.forEach(g.edges(), (e) => {
     var edge = g.edge(e);
     _.forEach(edge.points, reverseYOne);
-    if (_.has(edge, 'y')) {
+    if (_.has(edge, "y")) {
       reverseYOne(edge);
     }
   });
@@ -55,14 +55,14 @@ function reverseYOne(attrs) {
 }
 
 function swapXY(g) {
-  _.forEach(g.nodes(), function (v) {
+  _.forEach(g.nodes(), (v) => {
     swapXYOne(g.node(v));
   });
 
-  _.forEach(g.edges(), function (e) {
+  _.forEach(g.edges(), (e) => {
     var edge = g.edge(e);
     _.forEach(edge.points, swapXYOne);
-    if (_.has(edge, 'x')) {
+    if (_.has(edge, "x")) {
       swapXYOne(edge);
     }
   });

package/src/dagre/data/list.js

@@ -37,7 +37,7 @@ class List {
       strs.push(JSON.stringify(curr, filterOutLinks));
       curr = curr._prev;
     }
-    return '[' + strs.join(', ') + ']';
+    return `[${strs.join(", ")}]`;
   }
 }
 
@@ -49,7 +49,7 @@ function unlink(entry) {
 }
 
 function filterOutLinks(k, v) {
-  if (k !== '_next' && k !== '_prev') {
+  if (k !== "_next" && k !== "_prev") {
     return v;
   }
 }

package/src/dagre/debug.d.ts

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

package/src/dagre/debug.js

@@ -1,6 +1,6 @@
-import { _ } from '../lodash-es/index.ts';
-import { Graph } from '../graphlib/index.js';
-import * as util from './util.js';
+import { Graph } from "../graphlib/index.js";
+import { _ } from "../lodash-es/index.ts";
+import * as util from "./util.js";
 
 export { debugOrdering };
 
@@ -10,20 +10,20 @@ function debugOrdering(g) {
 
   var h = new Graph({ compound: true, multigraph: true }).setGraph({});
 
-  _.forEach(g.nodes(), function (v) {
+  _.forEach(g.nodes(), (v) => {
     h.setNode(v, { label: v });
-    h.setParent(v, 'layer' + g.node(v).rank);
+    h.setParent(v, `layer${g.node(v).rank}`);
   });
 
-  _.forEach(g.edges(), function (e) {
+  _.forEach(g.edges(), (e) => {
     h.setEdge(e.v, e.w, {}, e.name);
   });
 
-  _.forEach(layerMatrix, function (layer, i) {
-    var layerV = 'layer' + i;
-    h.setNode(layerV, { rank: 'same' });
-    _.reduce(layer, function (u, v) {
-      h.setEdge(u, v, { style: 'invis' });
+  _.forEach(layerMatrix, (layer, i) => {
+    var layerV = `layer${i}`;
+    h.setNode(layerV, { rank: "same" });
+    _.reduce(layer, (u, v) => {
+      h.setEdge(u, v, { style: "invis" });
       return v;
     });
   });

package/src/dagre/greedy-fas.js

@@ -1,6 +1,6 @@
-import { _ } from '../lodash-es/index.ts';
-import { Graph } from '../graphlib/index.js';
-import { List } from './data/list.js';
+import { Graph } from "../graphlib/index.js";
+import { _ } from "../lodash-es/index.ts";
+import { List } from "./data/list.js";
 
 /*
  * A greedy heuristic for finding a feedback arc set for a graph. A feedback
@@ -21,11 +21,7 @@ function greedyFAS(g, weightFn) {
   var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);
 
   // Expand multi-edges
-  return _.flatten(
-    _.map(results, function (e) {
-      return g.outEdges(e.v, e.w);
-    })
-  );
+  return _.flatten(_.map(results, (e) => g.outEdges(e.v, e.w)));
 }
 
 function doGreedyFAS(g, buckets, zeroIdx) {
@@ -45,7 +41,9 @@ function doGreedyFAS(g, buckets, zeroIdx) {
       for (var i = buckets.length - 2; i > 0; --i) {
         entry = buckets[i].dequeue();
         if (entry) {
-          results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));
+          results = results.concat(
+            removeNode(g, buckets, zeroIdx, entry, true),
+          );
           break;
         }
       }
@@ -58,7 +56,7 @@ function doGreedyFAS(g, buckets, zeroIdx) {
 function removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {
   var results = collectPredecessors ? [] : undefined;
 
-  _.forEach(g.inEdges(entry.v), function (edge) {
+  _.forEach(g.inEdges(entry.v), (edge) => {
     var weight = g.edge(edge);
     var uEntry = g.node(edge.v);
 
@@ -70,11 +68,11 @@ function removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {
     assignBucket(buckets, zeroIdx, uEntry);
   });
 
-  _.forEach(g.outEdges(entry.v), function (edge) {
+  _.forEach(g.outEdges(entry.v), (edge) => {
     var weight = g.edge(edge);
     var w = edge.w;
     var wEntry = g.node(w);
-    wEntry['in'] -= weight;
+    wEntry.in -= weight;
     assignBucket(buckets, zeroIdx, wEntry);
   });
 
@@ -88,27 +86,25 @@ function buildState(g, weightFn) {
   var maxIn = 0;
   var maxOut = 0;
 
-  _.forEach(g.nodes(), function (v) {
+  _.forEach(g.nodes(), (v) => {
     fasGraph.setNode(v, { v: v, in: 0, out: 0 });
   });
 
   // Aggregate weights on nodes, but also sum the weights across multi-edges
   // into a single edge for the fasGraph.
-  _.forEach(g.edges(), function (e) {
+  _.forEach(g.edges(), (e) => {
     var prevWeight = fasGraph.edge(e.v, e.w) || 0;
     var weight = weightFn(e);
     var edgeWeight = prevWeight + weight;
     fasGraph.setEdge(e.v, e.w, edgeWeight);
     maxOut = Math.max(maxOut, (fasGraph.node(e.v).out += weight));
-    maxIn = Math.max(maxIn, (fasGraph.node(e.w)['in'] += weight));
+    maxIn = Math.max(maxIn, (fasGraph.node(e.w).in += weight));
   });
 
-  var buckets = _.range(maxOut + maxIn + 3).map(function () {
-    return new List();
-  });
+  var buckets = _.range(maxOut + maxIn + 3).map(() => new List());
   var zeroIdx = maxIn + 1;
 
-  _.forEach(fasGraph.nodes(), function (v) {
+  _.forEach(fasGraph.nodes(), (v) => {
     assignBucket(buckets, zeroIdx, fasGraph.node(v));
   });
 
@@ -118,9 +114,9 @@ function buildState(g, weightFn) {
 function assignBucket(buckets, zeroIdx, entry) {
   if (!entry.out) {
     buckets[0].enqueue(entry);
-  } else if (!entry['in']) {
+  } else if (!entry.in) {
     buckets[buckets.length - 1].enqueue(entry);
   } else {
-    buckets[entry.out - entry['in'] + zeroIdx].enqueue(entry);
+    buckets[entry.out - entry.in + zeroIdx].enqueue(entry);
   }
 }

package/src/dagre/index.d.ts

@@ -1,5 +1,5 @@
-import * as acyclic from './acyclic.js';
-import * as normalize from './normalize.js';
-import { rank } from './rank/index.js';
-import { layout } from './layout.js';
+import * as acyclic from "./acyclic.js";
+import * as normalize from "./normalize.js";
+import { rank } from "./rank/index.js";
+import { layout } from "./layout.js";
 export { acyclic, normalize, rank, layout };

package/src/dagre/index.js

@@ -1,6 +1,6 @@
-import * as acyclic from './acyclic.js';
-import { layout } from './layout.js';
-import * as normalize from './normalize.js';
-import { rank } from './rank/index.js';
+import * as acyclic from "./acyclic.js";
+import { layout } from "./layout.js";
+import * as normalize from "./normalize.js";
+import { rank } from "./rank/index.js";
 
 export { acyclic, normalize, rank, layout };