service-flow-designer 0.0.1-beta.0 → 0.0.1-beta.2

package/dist/es/node_modules/.pnpm/@dagrejs_graphlib@2.1.4/node_modules/@dagrejs/graphlib/lib/alg/postorder.js

@@ -0,0 +1,9 @@
+import { d as dfs_1 } from "./dfs.js";
+var dfs = dfs_1;
+var postorder_1 = postorder;
+function postorder(g, vs) {
+  return dfs(g, vs, "post");
+}
+export {
+  postorder_1 as p
+};

package/dist/es/node_modules/.pnpm/@dagrejs_graphlib@2.1.4/node_modules/@dagrejs/graphlib/lib/alg/preorder.js

@@ -0,0 +1,9 @@
+import { d as dfs_1 } from "./dfs.js";
+var dfs = dfs_1;
+var preorder_1 = preorder;
+function preorder(g, vs) {
+  return dfs(g, vs, "pre");
+}
+export {
+  preorder_1 as p
+};

package/dist/es/node_modules/.pnpm/@dagrejs_graphlib@2.1.4/node_modules/@dagrejs/graphlib/lib/alg/prim.js

@@ -0,0 +1,42 @@
+import { l as lodash_1 } from "../lodash.js";
+import { g as graph } from "../graph.js";
+import { p as priorityQueue } from "../data/priority-queue.js";
+var _ = lodash_1, Graph = graph, PriorityQueue = priorityQueue;
+var prim_1 = prim;
+function prim(g, weightFunc) {
+  var result = new Graph(), parents = {}, pq = new PriorityQueue(), v;
+  function updateNeighbors(edge) {
+    var w = edge.v === v ? edge.w : edge.v, pri = pq.priority(w);
+    if (pri !== void 0) {
+      var edgeWeight = weightFunc(edge);
+      if (edgeWeight < pri) {
+        parents[w] = v;
+        pq.decrease(w, edgeWeight);
+      }
+    }
+  }
+  if (g.nodeCount() === 0) {
+    return result;
+  }
+  _.each(g.nodes(), function(v2) {
+    pq.add(v2, Number.POSITIVE_INFINITY);
+    result.setNode(v2);
+  });
+  pq.decrease(g.nodes()[0], 0);
+  var init = false;
+  while (pq.size() > 0) {
+    v = pq.removeMin();
+    if (_.has(parents, v)) {
+      result.setEdge(v, parents[v]);
+    } else if (init) {
+      throw new Error("Input graph is not connected: " + g);
+    } else {
+      init = true;
+    }
+    g.nodeEdges(v).forEach(updateNeighbors);
+  }
+  return result;
+}
+export {
+  prim_1 as p
+};

package/dist/es/node_modules/.pnpm/@dagrejs_graphlib@2.1.4/node_modules/@dagrejs/graphlib/lib/alg/tarjan.js

@@ -0,0 +1,40 @@
+import { l as lodash_1 } from "../lodash.js";
+var _ = lodash_1;
+var tarjan_1 = tarjan;
+function tarjan(g) {
+  var index = 0, stack = [], visited = {}, results = [];
+  function dfs(v) {
+    var entry = visited[v] = {
+      onStack: true,
+      lowlink: index,
+      index: index++
+    };
+    stack.push(v);
+    g.successors(v).forEach(function(w2) {
+      if (!_.has(visited, w2)) {
+        dfs(w2);
+        entry.lowlink = Math.min(entry.lowlink, visited[w2].lowlink);
+      } else if (visited[w2].onStack) {
+        entry.lowlink = Math.min(entry.lowlink, visited[w2].index);
+      }
+    });
+    if (entry.lowlink === entry.index) {
+      var cmpt = [], w;
+      do {
+        w = stack.pop();
+        visited[w].onStack = false;
+        cmpt.push(w);
+      } while (v !== w);
+      results.push(cmpt);
+    }
+  }
+  g.nodes().forEach(function(v) {
+    if (!_.has(visited, v)) {
+      dfs(v);
+    }
+  });
+  return results;
+}
+export {
+  tarjan_1 as t
+};

package/dist/es/node_modules/.pnpm/@dagrejs_graphlib@2.1.4/node_modules/@dagrejs/graphlib/lib/alg/topsort.js

@@ -0,0 +1,29 @@
+import { l as lodash_1 } from "../lodash.js";
+var _ = lodash_1;
+var topsort_1 = topsort;
+topsort.CycleException = CycleException;
+function topsort(g) {
+  var visited = {}, stack = {}, results = [];
+  function visit(node) {
+    if (_.has(stack, node)) {
+      throw new CycleException();
+    }
+    if (!_.has(visited, node)) {
+      stack[node] = true;
+      visited[node] = true;
+      _.each(g.predecessors(node), visit);
+      delete stack[node];
+      results.push(node);
+    }
+  }
+  _.each(g.sinks(), visit);
+  if (_.size(visited) !== g.nodeCount()) {
+    throw new CycleException();
+  }
+  return results;
+}
+function CycleException() {
+}
+export {
+  topsort_1 as t
+};

package/dist/es/node_modules/.pnpm/@dagrejs_graphlib@2.1.4/node_modules/@dagrejs/graphlib/lib/data/priority-queue.js

@@ -0,0 +1,98 @@
+import { l as lodash_1 } from "../lodash.js";
+var _ = lodash_1;
+var priorityQueue = PriorityQueue;
+function PriorityQueue() {
+  this._arr = [];
+  this._keyIndices = {};
+}
+PriorityQueue.prototype.size = function() {
+  return this._arr.length;
+};
+PriorityQueue.prototype.keys = function() {
+  return this._arr.map(function(x) {
+    return x.key;
+  });
+};
+PriorityQueue.prototype.has = function(key) {
+  return _.has(this._keyIndices, key);
+};
+PriorityQueue.prototype.priority = function(key) {
+  var index = this._keyIndices[key];
+  if (index !== void 0) {
+    return this._arr[index].priority;
+  }
+};
+PriorityQueue.prototype.min = function() {
+  if (this.size() === 0) {
+    throw new Error("Queue underflow");
+  }
+  return this._arr[0].key;
+};
+PriorityQueue.prototype.add = function(key, priority) {
+  var keyIndices = this._keyIndices;
+  key = String(key);
+  if (!_.has(keyIndices, key)) {
+    var arr = this._arr;
+    var index = arr.length;
+    keyIndices[key] = index;
+    arr.push({ key, priority });
+    this._decrease(index);
+    return true;
+  }
+  return false;
+};
+PriorityQueue.prototype.removeMin = function() {
+  this._swap(0, this._arr.length - 1);
+  var min = this._arr.pop();
+  delete this._keyIndices[min.key];
+  this._heapify(0);
+  return min.key;
+};
+PriorityQueue.prototype.decrease = function(key, priority) {
+  var index = this._keyIndices[key];
+  if (priority > this._arr[index].priority) {
+    throw new Error("New priority is greater than current priority. Key: " + key + " Old: " + this._arr[index].priority + " New: " + priority);
+  }
+  this._arr[index].priority = priority;
+  this._decrease(index);
+};
+PriorityQueue.prototype._heapify = function(i) {
+  var arr = this._arr;
+  var l = 2 * i, r = l + 1, largest = i;
+  if (l < arr.length) {
+    largest = arr[l].priority < arr[largest].priority ? l : largest;
+    if (r < arr.length) {
+      largest = arr[r].priority < arr[largest].priority ? r : largest;
+    }
+    if (largest !== i) {
+      this._swap(i, largest);
+      this._heapify(largest);
+    }
+  }
+};
+PriorityQueue.prototype._decrease = function(index) {
+  var arr = this._arr;
+  var priority = arr[index].priority;
+  var parent;
+  while (index !== 0) {
+    parent = index >> 1;
+    if (arr[parent].priority < priority) {
+      break;
+    }
+    this._swap(index, parent);
+    index = parent;
+  }
+};
+PriorityQueue.prototype._swap = function(i, j) {
+  var arr = this._arr;
+  var keyIndices = this._keyIndices;
+  var origArrI = arr[i];
+  var origArrJ = arr[j];
+  arr[i] = origArrJ;
+  arr[j] = origArrI;
+  keyIndices[origArrJ.key] = i;
+  keyIndices[origArrI.key] = j;
+};
+export {
+  priorityQueue as p
+};

package/dist/es/node_modules/.pnpm/@dagrejs_graphlib@2.1.4/node_modules/@dagrejs/graphlib/lib/graph.js

@@ -0,0 +1,407 @@
+import { l as lodash_1 } from "./lodash.js";
+var _ = lodash_1;
+var graph = Graph;
+var DEFAULT_EDGE_NAME = "\0", GRAPH_NODE = "\0", EDGE_KEY_DELIM = "
";
+function Graph(opts) {
+  this._isDirected = _.has(opts, "directed") ? opts.directed : true;
+  this._isMultigraph = _.has(opts, "multigraph") ? opts.multigraph : false;
+  this._isCompound = _.has(opts, "compound") ? opts.compound : false;
+  this._label = void 0;
+  this._defaultNodeLabelFn = _.constant(void 0);
+  this._defaultEdgeLabelFn = _.constant(void 0);
+  this._nodes = {};
+  if (this._isCompound) {
+    this._parent = {};
+    this._children = {};
+    this._children[GRAPH_NODE] = {};
+  }
+  this._in = {};
+  this._preds = {};
+  this._out = {};
+  this._sucs = {};
+  this._edgeObjs = {};
+  this._edgeLabels = {};
+}
+Graph.prototype._nodeCount = 0;
+Graph.prototype._edgeCount = 0;
+Graph.prototype.isDirected = function() {
+  return this._isDirected;
+};
+Graph.prototype.isMultigraph = function() {
+  return this._isMultigraph;
+};
+Graph.prototype.isCompound = function() {
+  return this._isCompound;
+};
+Graph.prototype.setGraph = function(label) {
+  this._label = label;
+  return this;
+};
+Graph.prototype.graph = function() {
+  return this._label;
+};
+Graph.prototype.setDefaultNodeLabel = function(newDefault) {
+  if (!_.isFunction(newDefault)) {
+    newDefault = _.constant(newDefault);
+  }
+  this._defaultNodeLabelFn = newDefault;
+  return this;
+};
+Graph.prototype.nodeCount = function() {
+  return this._nodeCount;
+};
+Graph.prototype.nodes = function() {
+  return _.keys(this._nodes);
+};
+Graph.prototype.sources = function() {
+  return _.filter(this.nodes(), _.bind(function(v) {
+    return _.isEmpty(this._in[v]);
+  }, this));
+};
+Graph.prototype.sinks = function() {
+  return _.filter(this.nodes(), _.bind(function(v) {
+    return _.isEmpty(this._out[v]);
+  }, this));
+};
+Graph.prototype.setNodes = function(vs, value) {
+  var args = arguments;
+  _.each(vs, _.bind(function(v) {
+    if (args.length > 1) {
+      this.setNode(v, value);
+    } else {
+      this.setNode(v);
+    }
+  }, this));
+  return this;
+};
+Graph.prototype.setNode = function(v, value) {
+  if (_.has(this._nodes, v)) {
+    if (arguments.length > 1) {
+      this._nodes[v] = value;
+    }
+    return this;
+  }
+  this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);
+  if (this._isCompound) {
+    this._parent[v] = GRAPH_NODE;
+    this._children[v] = {};
+    this._children[GRAPH_NODE][v] = true;
+  }
+  this._in[v] = {};
+  this._preds[v] = {};
+  this._out[v] = {};
+  this._sucs[v] = {};
+  ++this._nodeCount;
+  return this;
+};
+Graph.prototype.node = function(v) {
+  return this._nodes[v];
+};
+Graph.prototype.hasNode = function(v) {
+  return _.has(this._nodes, v);
+};
+Graph.prototype.removeNode = function(v) {
+  var self = this;
+  if (_.has(this._nodes, v)) {
+    var removeEdge = function(e) {
+      self.removeEdge(self._edgeObjs[e]);
+    };
+    delete this._nodes[v];
+    if (this._isCompound) {
+      this._removeFromParentsChildList(v);
+      delete this._parent[v];
+      _.each(this.children(v), _.bind(function(child) {
+        this.setParent(child);
+      }, this));
+      delete this._children[v];
+    }
+    _.each(_.keys(this._in[v]), removeEdge);
+    delete this._in[v];
+    delete this._preds[v];
+    _.each(_.keys(this._out[v]), removeEdge);
+    delete this._out[v];
+    delete this._sucs[v];
+    --this._nodeCount;
+  }
+  return this;
+};
+Graph.prototype.setParent = function(v, parent) {
+  if (!this._isCompound) {
+    throw new Error("Cannot set parent in a non-compound graph");
+  }
+  if (_.isUndefined(parent)) {
+    parent = GRAPH_NODE;
+  } else {
+    parent += "";
+    for (var ancestor = parent; !_.isUndefined(ancestor); ancestor = this.parent(ancestor)) {
+      if (ancestor === v) {
+        throw new Error("Setting " + parent + " as parent of " + v + " would create create a cycle");
+      }
+    }
+    this.setNode(parent);
+  }
+  this.setNode(v);
+  this._removeFromParentsChildList(v);
+  this._parent[v] = parent;
+  this._children[parent][v] = true;
+  return this;
+};
+Graph.prototype._removeFromParentsChildList = function(v) {
+  delete this._children[this._parent[v]][v];
+};
+Graph.prototype.parent = function(v) {
+  if (this._isCompound) {
+    var parent = this._parent[v];
+    if (parent !== GRAPH_NODE) {
+      return parent;
+    }
+  }
+};
+Graph.prototype.children = function(v) {
+  if (_.isUndefined(v)) {
+    v = GRAPH_NODE;
+  }
+  if (this._isCompound) {
+    var children = this._children[v];
+    if (children) {
+      return _.keys(children);
+    }
+  } else if (v === GRAPH_NODE) {
+    return this.nodes();
+  } else if (this.hasNode(v)) {
+    return [];
+  }
+};
+Graph.prototype.predecessors = function(v) {
+  var predsV = this._preds[v];
+  if (predsV) {
+    return _.keys(predsV);
+  }
+};
+Graph.prototype.successors = function(v) {
+  var sucsV = this._sucs[v];
+  if (sucsV) {
+    return _.keys(sucsV);
+  }
+};
+Graph.prototype.neighbors = function(v) {
+  var preds = this.predecessors(v);
+  if (preds) {
+    return _.union(preds, this.successors(v));
+  }
+};
+Graph.prototype.isLeaf = function(v) {
+  var neighbors;
+  if (this.isDirected()) {
+    neighbors = this.successors(v);
+  } else {
+    neighbors = this.neighbors(v);
+  }
+  return neighbors.length === 0;
+};
+Graph.prototype.filterNodes = function(filter) {
+  var copy = new this.constructor({
+    directed: this._isDirected,
+    multigraph: this._isMultigraph,
+    compound: this._isCompound
+  });
+  copy.setGraph(this.graph());
+  _.each(this._nodes, _.bind(function(value, v) {
+    if (filter(v)) {
+      copy.setNode(v, value);
+    }
+  }, this));
+  _.each(this._edgeObjs, _.bind(function(e) {
+    if (copy.hasNode(e.v) && copy.hasNode(e.w)) {
+      copy.setEdge(e, this.edge(e));
+    }
+  }, this));
+  var self = this;
+  var parents = {};
+  function findParent(v) {
+    var parent = self.parent(v);
+    if (parent === void 0 || copy.hasNode(parent)) {
+      parents[v] = parent;
+      return parent;
+    } else if (parent in parents) {
+      return parents[parent];
+    } else {
+      return findParent(parent);
+    }
+  }
+  if (this._isCompound) {
+    _.each(copy.nodes(), function(v) {
+      copy.setParent(v, findParent(v));
+    });
+  }
+  return copy;
+};
+Graph.prototype.setDefaultEdgeLabel = function(newDefault) {
+  if (!_.isFunction(newDefault)) {
+    newDefault = _.constant(newDefault);
+  }
+  this._defaultEdgeLabelFn = newDefault;
+  return this;
+};
+Graph.prototype.edgeCount = function() {
+  return this._edgeCount;
+};
+Graph.prototype.edges = function() {
+  return _.values(this._edgeObjs);
+};
+Graph.prototype.setPath = function(vs, value) {
+  var self = this, args = arguments;
+  _.reduce(vs, function(v, w) {
+    if (args.length > 1) {
+      self.setEdge(v, w, value);
+    } else {
+      self.setEdge(v, w);
+    }
+    return w;
+  });
+  return this;
+};
+Graph.prototype.setEdge = function() {
+  var v, w, name, value, valueSpecified = false, arg0 = arguments[0];
+  if (typeof arg0 === "object" && arg0 !== null && "v" in arg0) {
+    v = arg0.v;
+    w = arg0.w;
+    name = arg0.name;
+    if (arguments.length === 2) {
+      value = arguments[1];
+      valueSpecified = true;
+    }
+  } else {
+    v = arg0;
+    w = arguments[1];
+    name = arguments[3];
+    if (arguments.length > 2) {
+      value = arguments[2];
+      valueSpecified = true;
+    }
+  }
+  v = "" + v;
+  w = "" + w;
+  if (!_.isUndefined(name)) {
+    name = "" + name;
+  }
+  var e = edgeArgsToId(this._isDirected, v, w, name);
+  if (_.has(this._edgeLabels, e)) {
+    if (valueSpecified) {
+      this._edgeLabels[e] = value;
+    }
+    return this;
+  }
+  if (!_.isUndefined(name) && !this._isMultigraph) {
+    throw new Error("Cannot set a named edge when isMultigraph = false");
+  }
+  this.setNode(v);
+  this.setNode(w);
+  this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);
+  var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);
+  v = edgeObj.v;
+  w = edgeObj.w;
+  Object.freeze(edgeObj);
+  this._edgeObjs[e] = edgeObj;
+  incrementOrInitEntry(this._preds[w], v);
+  incrementOrInitEntry(this._sucs[v], w);
+  this._in[w][e] = edgeObj;
+  this._out[v][e] = edgeObj;
+  this._edgeCount++;
+  return this;
+};
+Graph.prototype.edge = function(v, w, name) {
+  var e = arguments.length === 1 ? edgeObjToId(this._isDirected, arguments[0]) : edgeArgsToId(this._isDirected, v, w, name);
+  return this._edgeLabels[e];
+};
+Graph.prototype.hasEdge = function(v, w, name) {
+  var e = arguments.length === 1 ? edgeObjToId(this._isDirected, arguments[0]) : edgeArgsToId(this._isDirected, v, w, name);
+  return _.has(this._edgeLabels, e);
+};
+Graph.prototype.removeEdge = function(v, w, name) {
+  var e = arguments.length === 1 ? edgeObjToId(this._isDirected, arguments[0]) : edgeArgsToId(this._isDirected, v, w, name), edge = this._edgeObjs[e];
+  if (edge) {
+    v = edge.v;
+    w = edge.w;
+    delete this._edgeLabels[e];
+    delete this._edgeObjs[e];
+    decrementOrRemoveEntry(this._preds[w], v);
+    decrementOrRemoveEntry(this._sucs[v], w);
+    delete this._in[w][e];
+    delete this._out[v][e];
+    this._edgeCount--;
+  }
+  return this;
+};
+Graph.prototype.inEdges = function(v, u) {
+  var inV = this._in[v];
+  if (inV) {
+    var edges = _.values(inV);
+    if (!u) {
+      return edges;
+    }
+    return _.filter(edges, function(edge) {
+      return edge.v === u;
+    });
+  }
+};
+Graph.prototype.outEdges = function(v, w) {
+  var outV = this._out[v];
+  if (outV) {
+    var edges = _.values(outV);
+    if (!w) {
+      return edges;
+    }
+    return _.filter(edges, function(edge) {
+      return edge.w === w;
+    });
+  }
+};
+Graph.prototype.nodeEdges = function(v, w) {
+  var inEdges = this.inEdges(v, w);
+  if (inEdges) {
+    return inEdges.concat(this.outEdges(v, w));
+  }
+};
+function incrementOrInitEntry(map, k) {
+  if (map[k]) {
+    map[k]++;
+  } else {
+    map[k] = 1;
+  }
+}
+function decrementOrRemoveEntry(map, k) {
+  if (!--map[k]) {
+    delete map[k];
+  }
+}
+function edgeArgsToId(isDirected, v_, w_, name) {
+  var v = "" + v_;
+  var w = "" + w_;
+  if (!isDirected && v > w) {
+    var tmp = v;
+    v = w;
+    w = tmp;
+  }
+  return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM + (_.isUndefined(name) ? DEFAULT_EDGE_NAME : name);
+}
+function edgeArgsToObj(isDirected, v_, w_, name) {
+  var v = "" + v_;
+  var w = "" + w_;
+  if (!isDirected && v > w) {
+    var tmp = v;
+    v = w;
+    w = tmp;
+  }
+  var edgeObj = { v, w };
+  if (name) {
+    edgeObj.name = name;
+  }
+  return edgeObj;
+}
+function edgeObjToId(isDirected, edgeObj) {
+  return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);
+}
+export {
+  graph as g
+};

package/dist/es/node_modules/.pnpm/@dagrejs_graphlib@2.1.4/node_modules/@dagrejs/graphlib/lib/index.js

@@ -0,0 +1,9 @@
+import { g as graph } from "./graph.js";
+import { v as version } from "./version.js";
+var lib = {
+  Graph: graph,
+  version
+};
+export {
+  lib as l
+};

package/dist/es/node_modules/.pnpm/@dagrejs_graphlib@2.1.4/node_modules/@dagrejs/graphlib/lib/json.js

@@ -0,0 +1,62 @@
+import { l as lodash_1 } from "./lodash.js";
+import { g as graph } from "./graph.js";
+var _ = lodash_1, Graph = graph;
+var json = {
+  write,
+  read
+};
+function write(g) {
+  var json2 = {
+    options: {
+      directed: g.isDirected(),
+      multigraph: g.isMultigraph(),
+      compound: g.isCompound()
+    },
+    nodes: writeNodes(g),
+    edges: writeEdges(g)
+  };
+  if (!_.isUndefined(g.graph())) {
+    json2.value = _.clone(g.graph());
+  }
+  return json2;
+}
+function writeNodes(g) {
+  return _.map(g.nodes(), function(v) {
+    var nodeValue = g.node(v), parent = g.parent(v), node = { v };
+    if (!_.isUndefined(nodeValue)) {
+      node.value = nodeValue;
+    }
+    if (!_.isUndefined(parent)) {
+      node.parent = parent;
+    }
+    return node;
+  });
+}
+function writeEdges(g) {
+  return _.map(g.edges(), function(e) {
+    var edgeValue = g.edge(e), edge = { v: e.v, w: e.w };
+    if (!_.isUndefined(e.name)) {
+      edge.name = e.name;
+    }
+    if (!_.isUndefined(edgeValue)) {
+      edge.value = edgeValue;
+    }
+    return edge;
+  });
+}
+function read(json2) {
+  var g = new Graph(json2.options).setGraph(json2.value);
+  _.each(json2.nodes, function(entry) {
+    g.setNode(entry.v, entry.value);
+    if (entry.parent) {
+      g.setParent(entry.v, entry.parent);
+    }
+  });
+  _.each(json2.edges, function(entry) {
+    g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);
+  });
+  return g;
+}
+export {
+  json as j
+};