@omg-dev/app 0.1.308

package/dist-lib/chunk-RYQCIY6F-fkeERzIG.js

@@ -0,0 +1,315 @@
+import { _ as d, l as i } from "./index-JkCQXUYs.js";
+import { i as C, G as y } from "./graph-B68L3K2T.js";
+import { b as _, m as X } from "./map-hbfFlSln.js";
+var j = 4;
+function p(e) {
+  return _(e, j);
+}
+function b(e) {
+  var r = {
+    options: {
+      directed: e.isDirected(),
+      multigraph: e.isMultigraph(),
+      compound: e.isCompound()
+    },
+    nodes: F(e),
+    edges: M(e)
+  };
+  return C(e.graph()) || (r.value = p(e.graph())), r;
+}
+function F(e) {
+  return X(e.nodes(), function(r) {
+    var s = e.node(r), n = e.parent(r), a = { v: r };
+    return C(s) || (a.value = s), C(n) || (a.parent = n), a;
+  });
+}
+function M(e) {
+  return X(e.edges(), function(r) {
+    var s = e.edge(r), n = { v: r.v, w: r.w };
+    return C(r.name) || (n.name = r.name), C(s) || (n.value = s), n;
+  });
+}
+var c = /* @__PURE__ */ new Map(), v = /* @__PURE__ */ new Map(), A = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ d(() => {
+  v.clear(), A.clear(), c.clear();
+}, "clear"), g = /* @__PURE__ */ d((e, r) => {
+  const s = v.get(r) || [];
+  return i.trace("In isDescendant", r, " ", e, " = ", s.includes(e)), s.includes(e);
+}, "isDescendant"), R = /* @__PURE__ */ d((e, r) => {
+  const s = v.get(r) || [];
+  return i.info("Descendants of ", r, " is ", s), i.info("Edge is ", e), e.v === r || e.w === r ? !1 : s ? s.includes(e.v) || g(e.v, r) || g(e.w, r) || s.includes(e.w) : (i.debug("Tilt, ", r, ",not in descendants"), !1);
+}, "edgeInCluster"), x = /* @__PURE__ */ d((e, r, s, n) => {
+  i.warn(
+    "Copying children of ",
+    e,
+    "root",
+    n,
+    "data",
+    r.node(e),
+    n
+  );
+  const a = r.children(e) || [];
+  e !== n && a.push(e), i.warn("Copying (nodes) clusterId", e, "nodes", a), a.forEach((o) => {
+    if (r.children(o).length > 0)
+      x(o, r, s, n);
+    else {
+      const l = r.node(o);
+      i.info("cp ", o, " to ", n, " with parent ", e), s.setNode(o, l), n !== r.parent(o) && (i.warn("Setting parent", o, r.parent(o)), s.setParent(o, r.parent(o))), e !== n && o !== e ? (i.debug("Setting parent", o, e), s.setParent(o, e)) : (i.info("In copy ", e, "root", n, "data", r.node(e), n), i.debug(
+        "Not Setting parent for node=",
+        o,
+        "cluster!==rootId",
+        e !== n,
+        "node!==clusterId",
+        o !== e
+      ));
+      const u = r.edges(o);
+      i.debug("Copying Edges", u), u.forEach((t) => {
+        i.info("Edge", t);
+        const f = r.edge(t.v, t.w, t.name);
+        i.info("Edge data", f, n);
+        try {
+          if (R(t, n)) {
+            const w = v.get(n) || [], m = w.includes(t.v) || g(t.v, n) || t.v === n, D = w.includes(t.w) || g(t.w, n) || t.w === n;
+            if (m && D)
+              i.info("Copying as ", t.v, t.w, f, t.name), s.setEdge(t.v, t.w, f, t.name), i.info("newGraph edges ", s.edges(), s.edge(s.edges()[0]));
+            else {
+              const N = m ? n : t.v, h = D ? n : t.w;
+              i.info("Rebinding cross-boundary edge as ", N, h, f, t.name), r.setEdge(N, h, f, t.name);
+            }
+          } else
+            i.info(
+              "Skipping copy of edge ",
+              t.v,
+              "-->",
+              t.w,
+              " rootId: ",
+              n,
+              " clusterId:",
+              e
+            );
+        } catch (w) {
+          i.error(w);
+        }
+      });
+    }
+    i.debug("Removing node", o), r.removeNode(o);
+  });
+}, "copy"), O = /* @__PURE__ */ d((e, r) => {
+  const s = r.children(e);
+  let n = [...s];
+  for (const a of s)
+    A.set(a, e), n = [...n, ...O(a, r)];
+  return n;
+}, "extractDescendants"), P = /* @__PURE__ */ d((e, r, s) => {
+  const n = e.edges().filter((t) => t.v === r || t.w === r), a = e.edges().filter((t) => t.v === s || t.w === s), o = n.map((t) => ({ v: t.v === r ? s : t.v, w: t.w === r ? r : t.w })), l = a.map((t) => ({ v: t.v, w: t.w }));
+  return o.filter((t) => l.some((f) => t.v === f.v && t.w === f.w));
+}, "findCommonEdges"), E = /* @__PURE__ */ d((e, r, s) => {
+  const n = r.children(e);
+  if (i.trace("Searching children of id ", e, n), n.length < 1)
+    return e;
+  let a;
+  for (const o of n) {
+    const l = E(o, r, s), u = P(r, s, l);
+    if (l)
+      if (u.length > 0)
+        a = l;
+      else
+        return l;
+  }
+  return a;
+}, "findNonClusterChild"), S = /* @__PURE__ */ d((e) => !c.has(e) || !c.get(e).externalConnections ? e : c.has(e) ? c.get(e).id : e, "getAnchorId"), U = /* @__PURE__ */ d((e, r) => {
+  var s;
+  if (!e || r > 10) {
+    i.debug("Opting out, no graph ");
+    return;
+  } else
+    i.debug("Opting in, graph ");
+  e.nodes().forEach(function(n) {
+    e.children(n).length > 0 && (i.warn(
+      "Cluster identified",
+      n,
+      " Replacement id in edges: ",
+      E(n, e, n)
+    ), v.set(n, O(n, e)), c.set(n, { id: E(n, e, n), clusterData: e.node(n) }));
+  }), e.nodes().forEach(function(n) {
+    const a = e.children(n), o = e.edges();
+    a.length > 0 ? (i.debug("Cluster identified", n, v), o.forEach((l) => {
+      const u = g(l.v, n), t = g(l.w, n);
+      u ^ t && (i.warn("Edge: ", l, " leaves cluster ", n), i.warn("Descendants of XXX ", n, ": ", v.get(n)), c.get(n).externalConnections = !0);
+    })) : i.debug("Not a cluster ", n, v);
+  });
+  for (let n of c.keys()) {
+    const a = c.get(n).id, o = e.parent(a);
+    o !== n && c.has(o) && !c.get(o).externalConnections && (c.get(n).id = o);
+    const l = e.edges().some((u) => u.v === n);
+    if (a && ((s = c.get(n)) != null && s.externalConnections) && l && L(e, a, n)) {
+      const u = T(e, n, e.parent(a));
+      u && (c.get(n).id = u);
+    }
+  }
+  e.edges().forEach(function(n) {
+    const a = e.edge(n);
+    i.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(n)), i.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(e.edge(n)));
+    let o = n.v, l = n.w;
+    if (i.warn(
+      "Fix XXX",
+      c,
+      "ids:",
+      n.v,
+      n.w,
+      "Translating: ",
+      c.get(n.v),
+      " --- ",
+      c.get(n.w)
+    ), c.get(n.v) || c.get(n.w)) {
+      if (i.warn("Fixing and trying - removing XXX", n.v, n.w, n.name), o = S(n.v), l = S(n.w), e.removeEdge(n.v, n.w, n.name), o !== n.v) {
+        const u = e.parent(o);
+        c.get(u).externalConnections = !0, a.fromCluster = n.v;
+      }
+      if (l !== n.w) {
+        const u = e.parent(l);
+        c.get(u).externalConnections = !0, a.toCluster = n.w;
+      }
+      i.warn("Fix Replacing with XXX", o, l, n.name), e.setEdge(o, l, a, n.name);
+    }
+  }), i.warn("Adjusted Graph", b(e)), k(e, 0), i.trace(c);
+}, "adjustClustersAndEdges"), k = /* @__PURE__ */ d((e, r) => {
+  var a, o, l, u;
+  if (i.warn("extractor - ", r, b(e), e.children("D")), r > 10) {
+    i.error("Bailing out");
+    return;
+  }
+  let s = e.nodes(), n = !1;
+  for (const t of s) {
+    const f = e.children(t);
+    n = n || f.length > 0;
+  }
+  if (!n) {
+    i.debug("Done, no node has children", e.nodes());
+    return;
+  }
+  i.debug("Nodes = ", s, r);
+  for (const t of s)
+    if (i.debug(
+      "Extracting node",
+      t,
+      c,
+      c.has(t) && !c.get(t).externalConnections,
+      !e.parent(t),
+      e.node(t),
+      e.children("D"),
+      " Depth ",
+      r
+    ), !c.has(t))
+      i.debug("Not a cluster", t, r);
+    else if ((o = (a = c.get(t)) == null ? void 0 : a.clusterData) != null && o.explicitDir && e.children(t) && e.children(t).length > 0) {
+      i.warn("Cluster with explicit dir, creating subgraph for children", t, r);
+      const f = c.get(t).clusterData.dir, w = new y({
+        multigraph: !0,
+        compound: !0
+      }).setGraph({
+        rankdir: f,
+        nodesep: 50,
+        ranksep: 50,
+        marginx: 8,
+        marginy: 8
+      }).setDefaultEdgeLabel(function() {
+        return {};
+      });
+      x(t, e, w, t);
+      const m = e.node(t) || {};
+      e.setNode(t, {
+        ...m,
+        clusterNode: !0,
+        id: t,
+        clusterData: c.get(t).clusterData,
+        label: c.get(t).label,
+        graph: w
+      }), i.warn(
+        "Subgraph for cluster with explicit dir created:",
+        t,
+        b(w)
+      );
+    } else if (!c.get(t).externalConnections && e.children(t) && e.children(t).length > 0) {
+      i.warn(
+        "Cluster without external connections, without a parent and with children",
+        t,
+        r
+      );
+      let w = e.graph().rankdir === "TB" ? "LR" : "TB";
+      (u = (l = c.get(t)) == null ? void 0 : l.clusterData) != null && u.dir && (w = c.get(t).clusterData.dir, i.warn("Fixing dir", c.get(t).clusterData.dir, w));
+      const m = new y({
+        multigraph: !0,
+        compound: !0
+      }).setGraph({
+        rankdir: w,
+        nodesep: 50,
+        ranksep: 50,
+        marginx: 8,
+        marginy: 8
+      }).setDefaultEdgeLabel(function() {
+        return {};
+      });
+      x(t, e, m, t);
+      const D = e.node(t) || {};
+      e.setNode(t, {
+        ...D,
+        clusterNode: !0,
+        id: t,
+        clusterData: c.get(t).clusterData,
+        label: c.get(t).label,
+        graph: m
+      }), i.debug("Old graph after copy", b(e));
+    } else
+      i.warn(
+        "Cluster ** ",
+        t,
+        " **not meeting the criteria !externalConnections:",
+        !c.get(t).externalConnections,
+        " no parent: ",
+        !e.parent(t),
+        " children ",
+        e.children(t) && e.children(t).length > 0,
+        e.children("D"),
+        r
+      ), i.debug(c);
+  s = e.nodes(), i.warn("New list of nodes", s);
+  for (const t of s) {
+    const f = e.node(t);
+    i.warn(" Now next level", t, f), f != null && f.clusterNode && k(f.graph, r + 1);
+  }
+}, "extractor"), B = /* @__PURE__ */ d((e, r) => {
+  if (r.length === 0)
+    return [];
+  let s = Object.assign([], r);
+  return r.forEach((n) => {
+    const a = e.children(n), o = B(e, a);
+    s = [...s, ...o];
+  }), s;
+}, "sorter"), W = /* @__PURE__ */ d((e) => B(e, e.children()), "sortNodesByHierarchy"), L = /* @__PURE__ */ d((e, r, s) => {
+  let n = e.parent(r);
+  for (; n && n !== s; ) {
+    const a = c.get(n);
+    if (a && !a.externalConnections)
+      return !0;
+    n = e.parent(n);
+  }
+  return !1;
+}, "isNodeInExtractableCluster"), T = /* @__PURE__ */ d((e, r, s) => {
+  const n = e.children(r) ?? [];
+  for (const a of n) {
+    if (a === s || g(a, s))
+      continue;
+    const o = E(a, e, r);
+    if (o && !L(e, o, r))
+      return o;
+  }
+  return null;
+}, "findSafeAnchorNode");
+export {
+  U as a,
+  c as b,
+  J as c,
+  E as f,
+  W as s,
+  b as w
+};