@fecp/designer 5.6.6 → 5.6.8

package/es/node_modules/dagre-d3-es/src/dagre/order/index.mjs

@@ -0,0 +1,54 @@
+import { Graph } from "../../graphlib/graph.mjs";
+import { maxRank, buildLayerMatrix } from "../util.mjs";
+import { addSubgraphConstraints } from "./add-subgraph-constraints.mjs";
+import { buildLayerGraph } from "./build-layer-graph.mjs";
+import { crossCount } from "./cross-count.mjs";
+import { initOrder } from "./init-order.mjs";
+import { sortSubgraph } from "./sort-subgraph.mjs";
+import range from "../../../../lodash-es/range.mjs";
+import cloneDeep from "../../../../lodash-es/cloneDeep.mjs";
+import map from "../../../../lodash-es/map.mjs";
+import forEach from "../../../../lodash-es/forEach.mjs";
+function order(g) {
+  var maxRank$1 = maxRank(g), downLayerGraphs = buildLayerGraphs(g, range(1, maxRank$1 + 1), "inEdges"), upLayerGraphs = buildLayerGraphs(g, range(maxRank$1 - 1, -1, -1), "outEdges");
+  var layering = initOrder(g);
+  assignOrder(g, layering);
+  var bestCC = Number.POSITIVE_INFINITY, best;
+  for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {
+    sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);
+    layering = buildLayerMatrix(g);
+    var cc = crossCount(g, layering);
+    if (cc < bestCC) {
+      lastBest = 0;
+      best = cloneDeep(layering);
+      bestCC = cc;
+    }
+  }
+  assignOrder(g, best);
+}
+function buildLayerGraphs(g, ranks, relationship) {
+  return map(ranks, function(rank) {
+    return buildLayerGraph(g, rank, relationship);
+  });
+}
+function sweepLayerGraphs(layerGraphs, biasRight) {
+  var cg = new Graph();
+  forEach(layerGraphs, function(lg) {
+    var root = lg.graph().root;
+    var sorted = sortSubgraph(lg, root, cg, biasRight);
+    forEach(sorted.vs, function(v, i) {
+      lg.node(v).order = i;
+    });
+    addSubgraphConstraints(lg, cg, sorted.vs);
+  });
+}
+function assignOrder(g, layering) {
+  forEach(layering, function(layer) {
+    forEach(layer, function(v, i) {
+      g.node(v).order = i;
+    });
+  });
+}
+export {
+  order
+};

package/es/node_modules/dagre-d3-es/src/dagre/order/init-order.mjs

@@ -0,0 +1,36 @@
+import filter from "../../../../lodash-es/filter.mjs";
+import max from "../../../../lodash-es/max.mjs";
+import map from "../../../../lodash-es/map.mjs";
+import range from "../../../../lodash-es/range.mjs";
+import sortBy from "../../../../lodash-es/sortBy.mjs";
+import forEach from "../../../../lodash-es/forEach.mjs";
+import has from "../../../../lodash-es/has.mjs";
+function initOrder(g) {
+  var visited = {};
+  var simpleNodes = filter(g.nodes(), function(v) {
+    return !g.children(v).length;
+  });
+  var maxRank = max(
+    map(simpleNodes, function(v) {
+      return g.node(v).rank;
+    })
+  );
+  var layers = map(range(maxRank + 1), function() {
+    return [];
+  });
+  function dfs(v) {
+    if (has(visited, v)) return;
+    visited[v] = true;
+    var node = g.node(v);
+    layers[node.rank].push(v);
+    forEach(g.successors(v), dfs);
+  }
+  var orderedVs = sortBy(simpleNodes, function(v) {
+    return g.node(v).rank;
+  });
+  forEach(orderedVs, dfs);
+  return layers;
+}
+export {
+  initOrder
+};

package/es/node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.mjs

@@ -0,0 +1,88 @@
+import forEach from "../../../../lodash-es/forEach.mjs";
+import isUndefined from "../../../../lodash-es/isUndefined.mjs";
+import filter from "../../../../lodash-es/filter.mjs";
+import map from "../../../../lodash-es/map.mjs";
+import pick from "../../../../lodash-es/pick.mjs";
+function resolveConflicts(entries, cg) {
+  var mappedEntries = {};
+  forEach(entries, function(entry, i) {
+    var tmp = mappedEntries[entry.v] = {
+      indegree: 0,
+      in: [],
+      out: [],
+      vs: [entry.v],
+      i
+    };
+    if (!isUndefined(entry.barycenter)) {
+      tmp.barycenter = entry.barycenter;
+      tmp.weight = entry.weight;
+    }
+  });
+  forEach(cg.edges(), function(e) {
+    var entryV = mappedEntries[e.v];
+    var entryW = mappedEntries[e.w];
+    if (!isUndefined(entryV) && !isUndefined(entryW)) {
+      entryW.indegree++;
+      entryV.out.push(mappedEntries[e.w]);
+    }
+  });
+  var sourceSet = filter(mappedEntries, function(entry) {
+    return !entry.indegree;
+  });
+  return doResolveConflicts(sourceSet);
+}
+function doResolveConflicts(sourceSet) {
+  var entries = [];
+  function handleIn(vEntry) {
+    return function(uEntry) {
+      if (uEntry.merged) {
+        return;
+      }
+      if (isUndefined(uEntry.barycenter) || isUndefined(vEntry.barycenter) || uEntry.barycenter >= vEntry.barycenter) {
+        mergeEntries(vEntry, uEntry);
+      }
+    };
+  }
+  function handleOut(vEntry) {
+    return function(wEntry) {
+      wEntry["in"].push(vEntry);
+      if (--wEntry.indegree === 0) {
+        sourceSet.push(wEntry);
+      }
+    };
+  }
+  while (sourceSet.length) {
+    var entry = sourceSet.pop();
+    entries.push(entry);
+    forEach(entry["in"].reverse(), handleIn(entry));
+    forEach(entry.out, handleOut(entry));
+  }
+  return map(
+    filter(entries, function(entry2) {
+      return !entry2.merged;
+    }),
+    function(entry2) {
+      return pick(entry2, ["vs", "i", "barycenter", "weight"]);
+    }
+  );
+}
+function mergeEntries(target, source) {
+  var sum = 0;
+  var weight = 0;
+  if (target.weight) {
+    sum += target.barycenter * target.weight;
+    weight += target.weight;
+  }
+  if (source.weight) {
+    sum += source.barycenter * source.weight;
+    weight += source.weight;
+  }
+  target.vs = source.vs.concat(target.vs);
+  target.barycenter = sum / weight;
+  target.weight = weight;
+  target.i = Math.min(source.i, target.i);
+  source.merged = true;
+}
+export {
+  resolveConflicts
+};

package/es/node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.mjs

@@ -0,0 +1,69 @@
+import { barycenter } from "./barycenter.mjs";
+import { resolveConflicts } from "./resolve-conflicts.mjs";
+import { sort } from "./sort.mjs";
+import filter from "../../../../lodash-es/filter.mjs";
+import forEach from "../../../../lodash-es/forEach.mjs";
+import flatten from "../../../../lodash-es/flatten.mjs";
+import isUndefined from "../../../../lodash-es/isUndefined.mjs";
+function sortSubgraph(g, v, cg, biasRight) {
+  var movable = g.children(v);
+  var node = g.node(v);
+  var bl = node ? node.borderLeft : void 0;
+  var br = node ? node.borderRight : void 0;
+  var subgraphs = {};
+  if (bl) {
+    movable = filter(movable, function(w) {
+      return w !== bl && w !== br;
+    });
+  }
+  var barycenters = barycenter(g, movable);
+  forEach(barycenters, function(entry) {
+    if (g.children(entry.v).length) {
+      var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);
+      subgraphs[entry.v] = subgraphResult;
+      if (Object.prototype.hasOwnProperty.call(subgraphResult, "barycenter")) {
+        mergeBarycenters(entry, subgraphResult);
+      }
+    }
+  });
+  var entries = resolveConflicts(barycenters, cg);
+  expandSubgraphs(entries, subgraphs);
+  var result = sort(entries, biasRight);
+  if (bl) {
+    result.vs = flatten([bl, result.vs, br]);
+    if (g.predecessors(bl).length) {
+      var blPred = g.node(g.predecessors(bl)[0]), brPred = g.node(g.predecessors(br)[0]);
+      if (!Object.prototype.hasOwnProperty.call(result, "barycenter")) {
+        result.barycenter = 0;
+        result.weight = 0;
+      }
+      result.barycenter = (result.barycenter * result.weight + blPred.order + brPred.order) / (result.weight + 2);
+      result.weight += 2;
+    }
+  }
+  return result;
+}
+function expandSubgraphs(entries, subgraphs) {
+  forEach(entries, function(entry) {
+    entry.vs = flatten(
+      entry.vs.map(function(v) {
+        if (subgraphs[v]) {
+          return subgraphs[v].vs;
+        }
+        return v;
+      })
+    );
+  });
+}
+function mergeBarycenters(target, other) {
+  if (!isUndefined(target.barycenter)) {
+    target.barycenter = (target.barycenter * target.weight + other.barycenter * other.weight) / (target.weight + other.weight);
+    target.weight += other.weight;
+  } else {
+    target.barycenter = other.barycenter;
+    target.weight = other.weight;
+  }
+}
+export {
+  sortSubgraph
+};

package/es/node_modules/dagre-d3-es/src/dagre/order/sort.mjs

@@ -0,0 +1,50 @@
+import { partition } from "../util.mjs";
+import sortBy from "../../../../lodash-es/sortBy.mjs";
+import forEach from "../../../../lodash-es/forEach.mjs";
+import flatten from "../../../../lodash-es/flatten.mjs";
+import last from "../../../../lodash-es/last.mjs";
+function sort(entries, biasRight) {
+  var parts = partition(entries, function(entry) {
+    return Object.prototype.hasOwnProperty.call(entry, "barycenter");
+  });
+  var sortable = parts.lhs, unsortable = sortBy(parts.rhs, function(entry) {
+    return -entry.i;
+  }), vs = [], sum = 0, weight = 0, vsIndex = 0;
+  sortable.sort(compareWithBias(!!biasRight));
+  vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
+  forEach(sortable, function(entry) {
+    vsIndex += entry.vs.length;
+    vs.push(entry.vs);
+    sum += entry.barycenter * entry.weight;
+    weight += entry.weight;
+    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
+  });
+  var result = { vs: flatten(vs) };
+  if (weight) {
+    result.barycenter = sum / weight;
+    result.weight = weight;
+  }
+  return result;
+}
+function consumeUnsortable(vs, unsortable, index) {
+  var last$1;
+  while (unsortable.length && (last$1 = last(unsortable)).i <= index) {
+    unsortable.pop();
+    vs.push(last$1.vs);
+    index++;
+  }
+  return index;
+}
+function compareWithBias(bias) {
+  return function(entryV, entryW) {
+    if (entryV.barycenter < entryW.barycenter) {
+      return -1;
+    } else if (entryV.barycenter > entryW.barycenter) {
+      return 1;
+    }
+    return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;
+  };
+}
+export {
+  sort
+};

package/es/node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.mjs

@@ -0,0 +1,66 @@
+import forEach from "../../../lodash-es/forEach.mjs";
+function parentDummyChains(g) {
+  var postorderNums = postorder(g);
+  forEach(g.graph().dummyChains, function(v) {
+    var node = g.node(v);
+    var edgeObj = node.edgeObj;
+    var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);
+    var path = pathData.path;
+    var lca = pathData.lca;
+    var pathIdx = 0;
+    var pathV = path[pathIdx];
+    var ascending = true;
+    while (v !== edgeObj.w) {
+      node = g.node(v);
+      if (ascending) {
+        while ((pathV = path[pathIdx]) !== lca && g.node(pathV).maxRank < node.rank) {
+          pathIdx++;
+        }
+        if (pathV === lca) {
+          ascending = false;
+        }
+      }
+      if (!ascending) {
+        while (pathIdx < path.length - 1 && g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {
+          pathIdx++;
+        }
+        pathV = path[pathIdx];
+      }
+      g.setParent(v, pathV);
+      v = g.successors(v)[0];
+    }
+  });
+}
+function findPath(g, postorderNums, v, w) {
+  var vPath = [];
+  var wPath = [];
+  var low = Math.min(postorderNums[v].low, postorderNums[w].low);
+  var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);
+  var parent;
+  var lca;
+  parent = v;
+  do {
+    parent = g.parent(parent);
+    vPath.push(parent);
+  } while (parent && (postorderNums[parent].low > low || lim > postorderNums[parent].lim));
+  lca = parent;
+  parent = w;
+  while ((parent = g.parent(parent)) !== lca) {
+    wPath.push(parent);
+  }
+  return { path: vPath.concat(wPath.reverse()), lca };
+}
+function postorder(g) {
+  var result = {};
+  var lim = 0;
+  function dfs(v) {
+    var low = lim;
+    forEach(g.children(v), dfs);
+    result[v] = { low, lim: lim++ };
+  }
+  forEach(g.children(), dfs);
+  return result;
+}
+export {
+  parentDummyChains
+};

package/es/node_modules/dagre-d3-es/src/dagre/position/bk.mjs

@@ -0,0 +1,319 @@
+import { Graph } from "../../graphlib/graph.mjs";
+import { buildLayerMatrix } from "../util.mjs";
+import merge from "../../../../lodash-es/merge.mjs";
+import forEach from "../../../../lodash-es/forEach.mjs";
+import reduce from "../../../../lodash-es/reduce.mjs";
+import minBy from "../../../../lodash-es/minBy.mjs";
+import values from "../../../../lodash-es/values.mjs";
+import min from "../../../../lodash-es/min.mjs";
+import max from "../../../../lodash-es/max.mjs";
+import mapValues from "../../../../lodash-es/mapValues.mjs";
+import sortBy from "../../../../lodash-es/sortBy.mjs";
+import map from "../../../../lodash-es/map.mjs";
+import last from "../../../../lodash-es/last.mjs";
+import find from "../../../../lodash-es/find.mjs";
+import forIn from "../../../../lodash-es/forIn.mjs";
+import range from "../../../../lodash-es/range.mjs";
+function findType1Conflicts(g, layering) {
+  var conflicts = {};
+  function visitLayer(prevLayer, layer) {
+    var k0 = 0, scanPos = 0, prevLayerLength = prevLayer.length, lastNode = last(layer);
+    forEach(layer, function(v, i) {
+      var w = findOtherInnerSegmentNode(g, v), k1 = w ? g.node(w).order : prevLayerLength;
+      if (w || v === lastNode) {
+        forEach(layer.slice(scanPos, i + 1), function(scanNode) {
+          forEach(g.predecessors(scanNode), function(u) {
+            var uLabel = g.node(u), uPos = uLabel.order;
+            if ((uPos < k0 || k1 < uPos) && !(uLabel.dummy && g.node(scanNode).dummy)) {
+              addConflict(conflicts, u, scanNode);
+            }
+          });
+        });
+        scanPos = i + 1;
+        k0 = k1;
+      }
+    });
+    return layer;
+  }
+  reduce(layering, visitLayer);
+  return conflicts;
+}
+function findType2Conflicts(g, layering) {
+  var conflicts = {};
+  function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {
+    var v;
+    forEach(range(southPos, southEnd), function(i) {
+      v = south[i];
+      if (g.node(v).dummy) {
+        forEach(g.predecessors(v), function(u) {
+          var uNode = g.node(u);
+          if (uNode.dummy && (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {
+            addConflict(conflicts, u, v);
+          }
+        });
+      }
+    });
+  }
+  function visitLayer(north, south) {
+    var prevNorthPos = -1, nextNorthPos, southPos = 0;
+    forEach(south, function(v, southLookahead) {
+      if (g.node(v).dummy === "border") {
+        var predecessors = g.predecessors(v);
+        if (predecessors.length) {
+          nextNorthPos = g.node(predecessors[0]).order;
+          scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);
+          southPos = southLookahead;
+          prevNorthPos = nextNorthPos;
+        }
+      }
+      scan(south, southPos, south.length, nextNorthPos, north.length);
+    });
+    return south;
+  }
+  reduce(layering, visitLayer);
+  return conflicts;
+}
+function findOtherInnerSegmentNode(g, v) {
+  if (g.node(v).dummy) {
+    return find(g.predecessors(v), function(u) {
+      return g.node(u).dummy;
+    });
+  }
+}
+function addConflict(conflicts, v, w) {
+  if (v > w) {
+    var tmp = v;
+    v = w;
+    w = tmp;
+  }
+  if (!Object.prototype.hasOwnProperty.call(conflicts, v)) {
+    Object.defineProperty(conflicts, v, {
+      enumerable: true,
+      configurable: true,
+      value: {},
+      writable: true
+    });
+  }
+  var conflictsV = conflicts[v];
+  Object.defineProperty(conflictsV, w, {
+    enumerable: true,
+    configurable: true,
+    value: true,
+    writable: true
+  });
+}
+function hasConflict(conflicts, v, w) {
+  if (v > w) {
+    var tmp = v;
+    v = w;
+    w = tmp;
+  }
+  return !!conflicts[v] && Object.prototype.hasOwnProperty.call(conflicts[v], w);
+}
+function verticalAlignment(g, layering, conflicts, neighborFn) {
+  var root = {}, align = {}, pos = {};
+  forEach(layering, function(layer) {
+    forEach(layer, function(v, order) {
+      root[v] = v;
+      align[v] = v;
+      pos[v] = order;
+    });
+  });
+  forEach(layering, function(layer) {
+    var prevIdx = -1;
+    forEach(layer, function(v) {
+      var ws = neighborFn(v);
+      if (ws.length) {
+        ws = sortBy(ws, function(w2) {
+          return pos[w2];
+        });
+        var mp = (ws.length - 1) / 2;
+        for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {
+          var w = ws[i];
+          if (align[v] === v && prevIdx < pos[w] && !hasConflict(conflicts, v, w)) {
+            align[w] = v;
+            align[v] = root[v] = root[w];
+            prevIdx = pos[w];
+          }
+        }
+      }
+    });
+  });
+  return { root, align };
+}
+function horizontalCompaction(g, layering, root, align, reverseSep) {
+  var xs = {}, blockG = buildBlockGraph(g, layering, root, reverseSep), borderType = reverseSep ? "borderLeft" : "borderRight";
+  function iterate(setXsFunc, nextNodesFunc) {
+    var stack = blockG.nodes();
+    var elem = stack.pop();
+    var visited = {};
+    while (elem) {
+      if (visited[elem]) {
+        setXsFunc(elem);
+      } else {
+        visited[elem] = true;
+        stack.push(elem);
+        stack = stack.concat(nextNodesFunc(elem));
+      }
+      elem = stack.pop();
+    }
+  }
+  function pass1(elem) {
+    xs[elem] = blockG.inEdges(elem).reduce(function(acc, e) {
+      return Math.max(acc, xs[e.v] + blockG.edge(e));
+    }, 0);
+  }
+  function pass2(elem) {
+    var min2 = blockG.outEdges(elem).reduce(function(acc, e) {
+      return Math.min(acc, xs[e.w] - blockG.edge(e));
+    }, Number.POSITIVE_INFINITY);
+    var node = g.node(elem);
+    if (min2 !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {
+      xs[elem] = Math.max(xs[elem], min2);
+    }
+  }
+  iterate(pass1, blockG.predecessors.bind(blockG));
+  iterate(pass2, blockG.successors.bind(blockG));
+  forEach(align, function(v) {
+    xs[v] = xs[root[v]];
+  });
+  return xs;
+}
+function buildBlockGraph(g, layering, root, reverseSep) {
+  var blockGraph = new Graph(), graphLabel = g.graph(), sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);
+  forEach(layering, function(layer) {
+    var u;
+    forEach(layer, function(v) {
+      var vRoot = root[v];
+      blockGraph.setNode(vRoot);
+      if (u) {
+        var uRoot = root[u], prevMax = blockGraph.edge(uRoot, vRoot);
+        blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));
+      }
+      u = v;
+    });
+  });
+  return blockGraph;
+}
+function findSmallestWidthAlignment(g, xss) {
+  return minBy(values(xss), function(xs) {
+    var max2 = Number.NEGATIVE_INFINITY;
+    var min2 = Number.POSITIVE_INFINITY;
+    forIn(xs, function(x, v) {
+      var halfWidth = width(g, v) / 2;
+      max2 = Math.max(x + halfWidth, max2);
+      min2 = Math.min(x - halfWidth, min2);
+    });
+    return max2 - min2;
+  });
+}
+function alignCoordinates(xss, alignTo) {
+  var alignToVals = values(alignTo), alignToMin = min(alignToVals), alignToMax = max(alignToVals);
+  forEach(["u", "d"], function(vert) {
+    forEach(["l", "r"], function(horiz) {
+      var alignment = vert + horiz, xs = xss[alignment], delta;
+      if (xs === alignTo) return;
+      var xsVals = values(xs);
+      delta = horiz === "l" ? alignToMin - min(xsVals) : alignToMax - max(xsVals);
+      if (delta) {
+        xss[alignment] = mapValues(xs, function(x) {
+          return x + delta;
+        });
+      }
+    });
+  });
+}
+function balance(xss, align) {
+  return mapValues(xss.ul, function(ignore, v) {
+    if (align) {
+      return xss[align.toLowerCase()][v];
+    } else {
+      var xs = sortBy(map(xss, v));
+      return (xs[1] + xs[2]) / 2;
+    }
+  });
+}
+function positionX(g) {
+  var layering = buildLayerMatrix(g);
+  var conflicts = merge(findType1Conflicts(g, layering), findType2Conflicts(g, layering));
+  var xss = {};
+  var adjustedLayering;
+  forEach(["u", "d"], function(vert) {
+    adjustedLayering = vert === "u" ? layering : values(layering).reverse();
+    forEach(["l", "r"], function(horiz) {
+      if (horiz === "r") {
+        adjustedLayering = map(adjustedLayering, function(inner) {
+          return values(inner).reverse();
+        });
+      }
+      var neighborFn = (vert === "u" ? g.predecessors : g.successors).bind(g);
+      var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);
+      var xs = horizontalCompaction(g, adjustedLayering, align.root, align.align, horiz === "r");
+      if (horiz === "r") {
+        xs = mapValues(xs, function(x) {
+          return -x;
+        });
+      }
+      xss[vert + horiz] = xs;
+    });
+  });
+  var smallestWidth = findSmallestWidthAlignment(g, xss);
+  alignCoordinates(xss, smallestWidth);
+  return balance(xss, g.graph().align);
+}
+function sep(nodeSep, edgeSep, reverseSep) {
+  return function(g, v, w) {
+    var vLabel = g.node(v);
+    var wLabel = g.node(w);
+    var sum = 0;
+    var delta;
+    sum += vLabel.width / 2;
+    if (Object.prototype.hasOwnProperty.call(vLabel, "labelpos")) {
+      switch (vLabel.labelpos.toLowerCase()) {
+        case "l":
+          delta = -vLabel.width / 2;
+          break;
+        case "r":
+          delta = vLabel.width / 2;
+          break;
+      }
+    }
+    if (delta) {
+      sum += reverseSep ? delta : -delta;
+    }
+    delta = 0;
+    sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;
+    sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;
+    sum += wLabel.width / 2;
+    if (Object.prototype.hasOwnProperty.call(wLabel, "labelpos")) {
+      switch (wLabel.labelpos.toLowerCase()) {
+        case "l":
+          delta = wLabel.width / 2;
+          break;
+        case "r":
+          delta = -wLabel.width / 2;
+          break;
+      }
+    }
+    if (delta) {
+      sum += reverseSep ? delta : -delta;
+    }
+    delta = 0;
+    return sum;
+  };
+}
+function width(g, v) {
+  return g.node(v).width;
+}
+export {
+  addConflict,
+  alignCoordinates,
+  balance,
+  findSmallestWidthAlignment,
+  findType1Conflicts,
+  findType2Conflicts,
+  hasConflict,
+  horizontalCompaction,
+  positionX,
+  verticalAlignment
+};