langgraph-vue3-chatbot 0.1.0

package/dist-lib/chunks/d2_markstream-vue-DjWw6Iqb.js

@@ -0,0 +1,5 @@
+const a = {};
+export {
+  a as default
+};
+//# sourceMappingURL=d2_markstream-vue-DjWw6Iqb.js.map

package/dist-lib/chunks/d2_markstream-vue-DjWw6Iqb.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"d2_markstream-vue-DjWw6Iqb.js","sources":["../../__vite-optional-peer-dep:@terrastruct/d2:markstream-vue"],"sourcesContent":["export default {}"],"names":["d2_markstreamVue"],"mappings":"AAAA,MAAAA,IAAe,CAAA;"}

package/dist-lib/chunks/dagre-6UL2VRFP-BN-tqdJt.js

@@ -0,0 +1,448 @@
+import { _ as X, aw as F, ax as Y, ay as _, az as H, l as i, c as V, aA as z, aB as U, ai as $, an as q, aj as P, ah as K, aC as Q, aD as W, aE as Z } from "./mermaid.core-CfwBoKEG.js";
+import { G as B } from "./graph-CpqhRkc9.js";
+import { l as I } from "./layout-BsfUazBi.js";
+import { i as x } from "./_baseUniq-kZ8qh66z.js";
+import { c as L } from "./clone-Cr8OkUI6.js";
+import { m as A } from "./_basePickBy-CW66PkAm.js";
+function p(e) {
+  var t = {
+    options: {
+      directed: e.isDirected(),
+      multigraph: e.isMultigraph(),
+      compound: e.isCompound()
+    },
+    nodes: ee(e),
+    edges: ne(e)
+  };
+  return x(e.graph()) || (t.value = L(e.graph())), t;
+}
+function ee(e) {
+  return A(e.nodes(), function(t) {
+    var n = e.node(t), o = e.parent(t), c = { v: t };
+    return x(n) || (c.value = n), x(o) || (c.parent = o), c;
+  });
+}
+function ne(e) {
+  return A(e.edges(), function(t) {
+    var n = e.edge(t), o = { v: t.v, w: t.w };
+    return x(t.name) || (o.name = t.name), x(n) || (o.value = n), o;
+  });
+}
+var f = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(), te = /* @__PURE__ */ X(() => {
+  b.clear(), J.clear(), f.clear();
+}, "clear"), O = /* @__PURE__ */ X((e, t) => {
+  const n = b.get(t) || [];
+  return i.trace("In isDescendant", t, " ", e, " = ", n.includes(e)), n.includes(e);
+}, "isDescendant"), se = /* @__PURE__ */ X((e, t) => {
+  const n = b.get(t) || [];
+  return i.info("Descendants of ", t, " is ", n), i.info("Edge is ", e), e.v === t || e.w === t ? !1 : n ? n.includes(e.v) || O(e.v, t) || O(e.w, t) || n.includes(e.w) : (i.debug("Tilt, ", t, ",not in descendants"), !1);
+}, "edgeInCluster"), G = /* @__PURE__ */ X((e, t, n, o) => {
+  i.warn(
+    "Copying children of ",
+    e,
+    "root",
+    o,
+    "data",
+    t.node(e),
+    o
+  );
+  const c = t.children(e) || [];
+  e !== o && c.push(e), i.warn("Copying (nodes) clusterId", e, "nodes", c), c.forEach((a) => {
+    if (t.children(a).length > 0)
+      G(a, t, n, o);
+    else {
+      const r = t.node(a);
+      i.info("cp ", a, " to ", o, " with parent ", e), n.setNode(a, r), o !== t.parent(a) && (i.warn("Setting parent", a, t.parent(a)), n.setParent(a, t.parent(a))), e !== o && a !== e ? (i.debug("Setting parent", a, e), n.setParent(a, e)) : (i.info("In copy ", e, "root", o, "data", t.node(e), o), i.debug(
+        "Not Setting parent for node=",
+        a,
+        "cluster!==rootId",
+        e !== o,
+        "node!==clusterId",
+        a !== e
+      ));
+      const u = t.edges(a);
+      i.debug("Copying Edges", u), u.forEach((l) => {
+        i.info("Edge", l);
+        const v = t.edge(l.v, l.w, l.name);
+        i.info("Edge data", v, o);
+        try {
+          se(l, o) ? (i.info("Copying as ", l.v, l.w, v, l.name), n.setEdge(l.v, l.w, v, l.name), i.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]))) : i.info(
+            "Skipping copy of edge ",
+            l.v,
+            "-->",
+            l.w,
+            " rootId: ",
+            o,
+            " clusterId:",
+            e
+          );
+        } catch (C) {
+          i.error(C);
+        }
+      });
+    }
+    i.debug("Removing node", a), t.removeNode(a);
+  });
+}, "copy"), R = /* @__PURE__ */ X((e, t) => {
+  const n = t.children(e);
+  let o = [...n];
+  for (const c of n)
+    J.set(c, e), o = [...o, ...R(c, t)];
+  return o;
+}, "extractDescendants"), ie = /* @__PURE__ */ X((e, t, n) => {
+  const o = e.edges().filter((l) => l.v === t || l.w === t), c = e.edges().filter((l) => l.v === n || l.w === n), a = o.map((l) => ({ v: l.v === t ? n : l.v, w: l.w === t ? t : l.w })), r = c.map((l) => ({ v: l.v, w: l.w }));
+  return a.filter((l) => r.some((v) => l.v === v.v && l.w === v.w));
+}, "findCommonEdges"), D = /* @__PURE__ */ X((e, t, n) => {
+  const o = t.children(e);
+  if (i.trace("Searching children of id ", e, o), o.length < 1)
+    return e;
+  let c;
+  for (const a of o) {
+    const r = D(a, t, n), u = ie(t, n, r);
+    if (r)
+      if (u.length > 0)
+        c = r;
+      else
+        return r;
+  }
+  return c;
+}, "findNonClusterChild"), k = /* @__PURE__ */ X((e) => !f.has(e) || !f.get(e).externalConnections ? e : f.has(e) ? f.get(e).id : e, "getAnchorId"), re = /* @__PURE__ */ X((e, t) => {
+  if (!e || t > 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: ",
+      D(n, e, n)
+    ), b.set(n, R(n, e)), f.set(n, { id: D(n, e, n), clusterData: e.node(n) }));
+  }), e.nodes().forEach(function(n) {
+    const o = e.children(n), c = e.edges();
+    o.length > 0 ? (i.debug("Cluster identified", n, b), c.forEach((a) => {
+      const r = O(a.v, n), u = O(a.w, n);
+      r ^ u && (i.warn("Edge: ", a, " leaves cluster ", n), i.warn("Descendants of XXX ", n, ": ", b.get(n)), f.get(n).externalConnections = !0);
+    })) : i.debug("Not a cluster ", n, b);
+  });
+  for (let n of f.keys()) {
+    const o = f.get(n).id, c = e.parent(o);
+    c !== n && f.has(c) && !f.get(c).externalConnections && (f.get(n).id = c);
+  }
+  e.edges().forEach(function(n) {
+    const o = 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 c = n.v, a = n.w;
+    if (i.warn(
+      "Fix XXX",
+      f,
+      "ids:",
+      n.v,
+      n.w,
+      "Translating: ",
+      f.get(n.v),
+      " --- ",
+      f.get(n.w)
+    ), f.get(n.v) || f.get(n.w)) {
+      if (i.warn("Fixing and trying - removing XXX", n.v, n.w, n.name), c = k(n.v), a = k(n.w), e.removeEdge(n.v, n.w, n.name), c !== n.v) {
+        const r = e.parent(c);
+        f.get(r).externalConnections = !0, o.fromCluster = n.v;
+      }
+      if (a !== n.w) {
+        const r = e.parent(a);
+        f.get(r).externalConnections = !0, o.toCluster = n.w;
+      }
+      i.warn("Fix Replacing with XXX", c, a, n.name), e.setEdge(c, a, o, n.name);
+    }
+  }), i.warn("Adjusted Graph", p(e)), T(e, 0), i.trace(f);
+}, "adjustClustersAndEdges"), T = /* @__PURE__ */ X((e, t) => {
+  var c, a;
+  if (i.warn("extractor - ", t, p(e), e.children("D")), t > 10) {
+    i.error("Bailing out");
+    return;
+  }
+  let n = e.nodes(), o = !1;
+  for (const r of n) {
+    const u = e.children(r);
+    o = o || u.length > 0;
+  }
+  if (!o) {
+    i.debug("Done, no node has children", e.nodes());
+    return;
+  }
+  i.debug("Nodes = ", n, t);
+  for (const r of n)
+    if (i.debug(
+      "Extracting node",
+      r,
+      f,
+      f.has(r) && !f.get(r).externalConnections,
+      !e.parent(r),
+      e.node(r),
+      e.children("D"),
+      " Depth ",
+      t
+    ), !f.has(r))
+      i.debug("Not a cluster", r, t);
+    else if (!f.get(r).externalConnections && e.children(r) && e.children(r).length > 0) {
+      i.warn(
+        "Cluster without external connections, without a parent and with children",
+        r,
+        t
+      );
+      let l = e.graph().rankdir === "TB" ? "LR" : "TB";
+      (a = (c = f.get(r)) == null ? void 0 : c.clusterData) != null && a.dir && (l = f.get(r).clusterData.dir, i.warn("Fixing dir", f.get(r).clusterData.dir, l));
+      const v = new B({
+        multigraph: !0,
+        compound: !0
+      }).setGraph({
+        rankdir: l,
+        nodesep: 50,
+        ranksep: 50,
+        marginx: 8,
+        marginy: 8
+      }).setDefaultEdgeLabel(function() {
+        return {};
+      });
+      i.warn("Old graph before copy", p(e)), G(r, e, v, r), e.setNode(r, {
+        clusterNode: !0,
+        id: r,
+        clusterData: f.get(r).clusterData,
+        label: f.get(r).label,
+        graph: v
+      }), i.warn("New graph after copy node: (", r, ")", p(v)), i.debug("Old graph after copy", p(e));
+    } else
+      i.warn(
+        "Cluster ** ",
+        r,
+        " **not meeting the criteria !externalConnections:",
+        !f.get(r).externalConnections,
+        " no parent: ",
+        !e.parent(r),
+        " children ",
+        e.children(r) && e.children(r).length > 0,
+        e.children("D"),
+        t
+      ), i.debug(f);
+  n = e.nodes(), i.warn("New list of nodes", n);
+  for (const r of n) {
+    const u = e.node(r);
+    i.warn(" Now next level", r, u), u != null && u.clusterNode && T(u.graph, t + 1);
+  }
+}, "extractor"), M = /* @__PURE__ */ X((e, t) => {
+  if (t.length === 0)
+    return [];
+  let n = Object.assign([], t);
+  return t.forEach((o) => {
+    const c = e.children(o), a = M(e, c);
+    n = [...n, ...a];
+  }), n;
+}, "sorter"), oe = /* @__PURE__ */ X((e) => M(e, e.children()), "sortNodesByHierarchy"), j = /* @__PURE__ */ X(async (e, t, n, o, c, a) => {
+  i.warn("Graph in recursive render:XAX", p(t), c);
+  const r = t.graph().rankdir;
+  i.trace("Dir in recursive render - dir:", r);
+  const u = e.insert("g").attr("class", "root");
+  t.nodes() ? i.info("Recursive render XXX", t.nodes()) : i.info("No nodes found for", t), t.edges().length > 0 && i.info("Recursive edges", t.edge(t.edges()[0]));
+  const l = u.insert("g").attr("class", "clusters"), v = u.insert("g").attr("class", "edgePaths"), C = u.insert("g").attr("class", "edgeLabels"), g = u.insert("g").attr("class", "nodes");
+  await Promise.all(
+    t.nodes().map(async function(d) {
+      const s = t.node(d);
+      if (c !== void 0) {
+        const w = JSON.parse(JSON.stringify(c.clusterData));
+        i.trace(
+          `Setting data for parent cluster XXX
+ Node.id = `,
+          d,
+          `
+ data=`,
+          w.height,
+          `
+Parent cluster`,
+          c.height
+        ), t.setNode(c.id, w), t.parent(d) || (i.trace("Setting parent", d, c.id), t.setParent(d, c.id, w));
+      }
+      if (i.info("(Insert) Node XXX" + d + ": " + JSON.stringify(t.node(d))), s != null && s.clusterNode) {
+        i.info("Cluster identified XBX", d, s.width, t.node(d));
+        const { ranksep: w, nodesep: m } = t.graph();
+        s.graph.setGraph({
+          ...s.graph.graph(),
+          ranksep: w + 25,
+          nodesep: m
+        });
+        const N = await j(
+          g,
+          s.graph,
+          n,
+          o,
+          t.node(d),
+          a
+        ), S = N.elem;
+        z(s, S), s.diff = N.diff || 0, i.info(
+          "New compound node after recursive render XAX",
+          d,
+          "width",
+          // node,
+          s.width,
+          "height",
+          s.height
+          // node.x,
+          // node.y
+        ), U(S, s);
+      } else
+        t.children(d).length > 0 ? (i.trace(
+          "Cluster - the non recursive path XBX",
+          d,
+          s.id,
+          s,
+          s.width,
+          "Graph:",
+          t
+        ), i.trace(D(s.id, t)), f.set(s.id, { id: D(s.id, t), node: s })) : (i.trace("Node - the non recursive path XAX", d, g, t.node(d), r), await $(g, t.node(d), { config: a, dir: r }));
+    })
+  ), await (/* @__PURE__ */ X(async () => {
+    const d = t.edges().map(async function(s) {
+      const w = t.edge(s.v, s.w, s.name);
+      i.info("Edge " + s.v + " -> " + s.w + ": " + JSON.stringify(s)), i.info("Edge " + s.v + " -> " + s.w + ": ", s, " ", JSON.stringify(t.edge(s))), i.info(
+        "Fix",
+        f,
+        "ids:",
+        s.v,
+        s.w,
+        "Translating: ",
+        f.get(s.v),
+        f.get(s.w)
+      ), await Z(C, w);
+    });
+    await Promise.all(d);
+  }, "processEdges"))(), i.info("Graph before layout:", JSON.stringify(p(t))), i.info("############################################# XXX"), i.info("###                Layout                 ### XXX"), i.info("############################################# XXX"), I(t), i.info("Graph after layout:", JSON.stringify(p(t)));
+  let E = 0, { subGraphTitleTotalMargin: y } = q(a);
+  return await Promise.all(
+    oe(t).map(async function(d) {
+      var w;
+      const s = t.node(d);
+      if (i.info(
+        "Position XBX => " + d + ": (" + s.x,
+        "," + s.y,
+        ") width: ",
+        s.width,
+        " height: ",
+        s.height
+      ), s != null && s.clusterNode)
+        s.y += y, i.info(
+          "A tainted cluster node XBX1",
+          d,
+          s.id,
+          s.width,
+          s.height,
+          s.x,
+          s.y,
+          t.parent(d)
+        ), f.get(s.id).node = s, P(s);
+      else if (t.children(d).length > 0) {
+        i.info(
+          "A pure cluster node XBX1",
+          d,
+          s.id,
+          s.x,
+          s.y,
+          s.width,
+          s.height,
+          t.parent(d)
+        ), s.height += y, t.node(s.parentId);
+        const m = (s == null ? void 0 : s.padding) / 2 || 0, N = ((w = s == null ? void 0 : s.labelBBox) == null ? void 0 : w.height) || 0, S = N - m || 0;
+        i.debug("OffsetY", S, "labelHeight", N, "halfPadding", m), await K(l, s), f.get(s.id).node = s;
+      } else {
+        const m = t.node(s.parentId);
+        s.y += y / 2, i.info(
+          "A regular node XBX1 - using the padding",
+          s.id,
+          "parent",
+          s.parentId,
+          s.width,
+          s.height,
+          s.x,
+          s.y,
+          "offsetY",
+          s.offsetY,
+          "parent",
+          m,
+          m == null ? void 0 : m.offsetY,
+          s
+        ), P(s);
+      }
+    })
+  ), t.edges().forEach(function(d) {
+    const s = t.edge(d);
+    i.info("Edge " + d.v + " -> " + d.w + ": " + JSON.stringify(s), s), s.points.forEach((S) => S.y += y / 2);
+    const w = t.node(d.v);
+    var m = t.node(d.w);
+    const N = Q(v, s, f, n, w, m, o);
+    W(s, N);
+  }), t.nodes().forEach(function(d) {
+    const s = t.node(d);
+    i.info(d, s.type, s.diff), s.isGroup && (E = s.diff);
+  }), i.warn("Returning from recursive render XAX", u, E), { elem: u, diff: E };
+}, "recursiveRender"), ge = /* @__PURE__ */ X(async (e, t) => {
+  var a, r, u, l, v, C;
+  const n = new B({
+    multigraph: !0,
+    compound: !0
+  }).setGraph({
+    rankdir: e.direction,
+    nodesep: ((a = e.config) == null ? void 0 : a.nodeSpacing) || ((u = (r = e.config) == null ? void 0 : r.flowchart) == null ? void 0 : u.nodeSpacing) || e.nodeSpacing,
+    ranksep: ((l = e.config) == null ? void 0 : l.rankSpacing) || ((C = (v = e.config) == null ? void 0 : v.flowchart) == null ? void 0 : C.rankSpacing) || e.rankSpacing,
+    marginx: 8,
+    marginy: 8
+  }).setDefaultEdgeLabel(function() {
+    return {};
+  }), o = t.select("g");
+  F(o, e.markers, e.type, e.diagramId), Y(), _(), H(), te(), e.nodes.forEach((g) => {
+    n.setNode(g.id, { ...g }), g.parentId && n.setParent(g.id, g.parentId);
+  }), i.debug("Edges:", e.edges), e.edges.forEach((g) => {
+    if (g.start === g.end) {
+      const h = g.start, E = h + "---" + h + "---1", y = h + "---" + h + "---2", d = n.node(h);
+      n.setNode(E, {
+        domId: E,
+        id: E,
+        parentId: d.parentId,
+        labelStyle: "",
+        label: "",
+        padding: 0,
+        shape: "labelRect",
+        // shape: 'rect',
+        style: "",
+        width: 10,
+        height: 10
+      }), n.setParent(E, d.parentId), n.setNode(y, {
+        domId: y,
+        id: y,
+        parentId: d.parentId,
+        labelStyle: "",
+        padding: 0,
+        // shape: 'rect',
+        shape: "labelRect",
+        label: "",
+        style: "",
+        width: 10,
+        height: 10
+      }), n.setParent(y, d.parentId);
+      const s = structuredClone(g), w = structuredClone(g), m = structuredClone(g);
+      s.label = "", s.arrowTypeEnd = "none", s.id = h + "-cyclic-special-1", w.arrowTypeStart = "none", w.arrowTypeEnd = "none", w.id = h + "-cyclic-special-mid", m.label = "", d.isGroup && (s.fromCluster = h, m.toCluster = h), m.id = h + "-cyclic-special-2", m.arrowTypeStart = "none", n.setEdge(h, E, s, h + "-cyclic-special-0"), n.setEdge(E, y, w, h + "-cyclic-special-1"), n.setEdge(y, h, m, h + "-cyc<lic-special-2");
+    } else
+      n.setEdge(g.start, g.end, { ...g }, g.id);
+  }), i.warn("Graph at first:", JSON.stringify(p(n))), re(n), i.warn("Graph after XAX:", JSON.stringify(p(n)));
+  const c = V();
+  await j(
+    o,
+    n,
+    e.type,
+    e.diagramId,
+    void 0,
+    c
+  );
+}, "render");
+export {
+  ge as render
+};
+//# sourceMappingURL=dagre-6UL2VRFP-BN-tqdJt.js.map

package/dist-lib/chunks/dagre-6UL2VRFP-BN-tqdJt.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dagre-6UL2VRFP-BN-tqdJt.js","sources":["../../node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/graphlib/json.js","../../node_modules/.pnpm/mermaid@11.12.3/node_modules/mermaid/dist/chunks/mermaid.core/dagre-6UL2VRFP.mjs"],"sourcesContent":["import * as _ from 'lodash-es';\nimport { Graph } from './graph.js';\n\nexport { write, read };\n\nfunction write(g) {\n  var json = {\n    options: {\n      directed: g.isDirected(),\n      multigraph: g.isMultigraph(),\n      compound: g.isCompound(),\n    },\n    nodes: writeNodes(g),\n    edges: writeEdges(g),\n  };\n  if (!_.isUndefined(g.graph())) {\n    json.value = _.clone(g.graph());\n  }\n  return json;\n}\n\nfunction writeNodes(g) {\n  return _.map(g.nodes(), function (v) {\n    var nodeValue = g.node(v);\n    var parent = g.parent(v);\n    var node = { v: v };\n    if (!_.isUndefined(nodeValue)) {\n      node.value = nodeValue;\n    }\n    if (!_.isUndefined(parent)) {\n      node.parent = parent;\n    }\n    return node;\n  });\n}\n\nfunction writeEdges(g) {\n  return _.map(g.edges(), function (e) {\n    var edgeValue = g.edge(e);\n    var edge = { v: e.v, w: e.w };\n    if (!_.isUndefined(e.name)) {\n      edge.name = e.name;\n    }\n    if (!_.isUndefined(edgeValue)) {\n      edge.value = edgeValue;\n    }\n    return edge;\n  });\n}\n\nfunction read(json) {\n  var g = new Graph(json.options).setGraph(json.value);\n  _.each(json.nodes, function (entry) {\n    g.setNode(entry.v, entry.value);\n    if (entry.parent) {\n      g.setParent(entry.v, entry.parent);\n    }\n  });\n  _.each(json.edges, function (entry) {\n    g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);\n  });\n  return g;\n}\n","import {\n  clear as clear2,\n  insertEdge,\n  insertEdgeLabel,\n  markers_default,\n  positionEdgeLabel\n} from \"./chunk-QXUST7PY.mjs\";\nimport \"./chunk-HN2XXSSU.mjs\";\nimport {\n  clear,\n  clear2 as clear3,\n  insertCluster,\n  insertNode,\n  positionNode,\n  setNodeElem,\n  updateNodeBounds\n} from \"./chunk-JZLCHNYA.mjs\";\nimport {\n  getSubGraphTitleMargins\n} from \"./chunk-CVBHYZKI.mjs\";\nimport \"./chunk-ATLVNIR6.mjs\";\nimport \"./chunk-JA3XYJ7Z.mjs\";\nimport \"./chunk-S3R3BYOJ.mjs\";\nimport {\n  getConfig2 as getConfig\n} from \"./chunk-ABZYJK2D.mjs\";\nimport {\n  __name,\n  log\n} from \"./chunk-AGHRB4JF.mjs\";\n\n// src/rendering-util/layout-algorithms/dagre/index.js\nimport { layout as dagreLayout } from \"dagre-d3-es/src/dagre/index.js\";\nimport * as graphlibJson2 from \"dagre-d3-es/src/graphlib/json.js\";\nimport * as graphlib2 from \"dagre-d3-es/src/graphlib/index.js\";\n\n// src/rendering-util/layout-algorithms/dagre/mermaid-graphlib.js\nimport * as graphlib from \"dagre-d3-es/src/graphlib/index.js\";\nimport * as graphlibJson from \"dagre-d3-es/src/graphlib/json.js\";\nvar clusterDb = /* @__PURE__ */ new Map();\nvar descendants = /* @__PURE__ */ new Map();\nvar parents = /* @__PURE__ */ new Map();\nvar clear4 = /* @__PURE__ */ __name(() => {\n  descendants.clear();\n  parents.clear();\n  clusterDb.clear();\n}, \"clear\");\nvar isDescendant = /* @__PURE__ */ __name((id, ancestorId) => {\n  const ancestorDescendants = descendants.get(ancestorId) || [];\n  log.trace(\"In isDescendant\", ancestorId, \" \", id, \" = \", ancestorDescendants.includes(id));\n  return ancestorDescendants.includes(id);\n}, \"isDescendant\");\nvar edgeInCluster = /* @__PURE__ */ __name((edge, clusterId) => {\n  const clusterDescendants = descendants.get(clusterId) || [];\n  log.info(\"Descendants of \", clusterId, \" is \", clusterDescendants);\n  log.info(\"Edge is \", edge);\n  if (edge.v === clusterId || edge.w === clusterId) {\n    return false;\n  }\n  if (!clusterDescendants) {\n    log.debug(\"Tilt, \", clusterId, \",not in descendants\");\n    return false;\n  }\n  return clusterDescendants.includes(edge.v) || isDescendant(edge.v, clusterId) || isDescendant(edge.w, clusterId) || clusterDescendants.includes(edge.w);\n}, \"edgeInCluster\");\nvar copy = /* @__PURE__ */ __name((clusterId, graph, newGraph, rootId) => {\n  log.warn(\n    \"Copying children of \",\n    clusterId,\n    \"root\",\n    rootId,\n    \"data\",\n    graph.node(clusterId),\n    rootId\n  );\n  const nodes = graph.children(clusterId) || [];\n  if (clusterId !== rootId) {\n    nodes.push(clusterId);\n  }\n  log.warn(\"Copying (nodes) clusterId\", clusterId, \"nodes\", nodes);\n  nodes.forEach((node) => {\n    if (graph.children(node).length > 0) {\n      copy(node, graph, newGraph, rootId);\n    } else {\n      const data = graph.node(node);\n      log.info(\"cp \", node, \" to \", rootId, \" with parent \", clusterId);\n      newGraph.setNode(node, data);\n      if (rootId !== graph.parent(node)) {\n        log.warn(\"Setting parent\", node, graph.parent(node));\n        newGraph.setParent(node, graph.parent(node));\n      }\n      if (clusterId !== rootId && node !== clusterId) {\n        log.debug(\"Setting parent\", node, clusterId);\n        newGraph.setParent(node, clusterId);\n      } else {\n        log.info(\"In copy \", clusterId, \"root\", rootId, \"data\", graph.node(clusterId), rootId);\n        log.debug(\n          \"Not Setting parent for node=\",\n          node,\n          \"cluster!==rootId\",\n          clusterId !== rootId,\n          \"node!==clusterId\",\n          node !== clusterId\n        );\n      }\n      const edges = graph.edges(node);\n      log.debug(\"Copying Edges\", edges);\n      edges.forEach((edge) => {\n        log.info(\"Edge\", edge);\n        const data2 = graph.edge(edge.v, edge.w, edge.name);\n        log.info(\"Edge data\", data2, rootId);\n        try {\n          if (edgeInCluster(edge, rootId)) {\n            log.info(\"Copying as \", edge.v, edge.w, data2, edge.name);\n            newGraph.setEdge(edge.v, edge.w, data2, edge.name);\n            log.info(\"newGraph edges \", newGraph.edges(), newGraph.edge(newGraph.edges()[0]));\n          } else {\n            log.info(\n              \"Skipping copy of edge \",\n              edge.v,\n              \"-->\",\n              edge.w,\n              \" rootId: \",\n              rootId,\n              \" clusterId:\",\n              clusterId\n            );\n          }\n        } catch (e) {\n          log.error(e);\n        }\n      });\n    }\n    log.debug(\"Removing node\", node);\n    graph.removeNode(node);\n  });\n}, \"copy\");\nvar extractDescendants = /* @__PURE__ */ __name((id, graph) => {\n  const children = graph.children(id);\n  let res = [...children];\n  for (const child of children) {\n    parents.set(child, id);\n    res = [...res, ...extractDescendants(child, graph)];\n  }\n  return res;\n}, \"extractDescendants\");\nvar findCommonEdges = /* @__PURE__ */ __name((graph, id1, id2) => {\n  const edges1 = graph.edges().filter((edge) => edge.v === id1 || edge.w === id1);\n  const edges2 = graph.edges().filter((edge) => edge.v === id2 || edge.w === id2);\n  const edges1Prim = edges1.map((edge) => {\n    return { v: edge.v === id1 ? id2 : edge.v, w: edge.w === id1 ? id1 : edge.w };\n  });\n  const edges2Prim = edges2.map((edge) => {\n    return { v: edge.v, w: edge.w };\n  });\n  const result = edges1Prim.filter((edgeIn1) => {\n    return edges2Prim.some((edge) => edgeIn1.v === edge.v && edgeIn1.w === edge.w);\n  });\n  return result;\n}, \"findCommonEdges\");\nvar findNonClusterChild = /* @__PURE__ */ __name((id, graph, clusterId) => {\n  const children = graph.children(id);\n  log.trace(\"Searching children of id \", id, children);\n  if (children.length < 1) {\n    return id;\n  }\n  let reserve;\n  for (const child of children) {\n    const _id = findNonClusterChild(child, graph, clusterId);\n    const commonEdges = findCommonEdges(graph, clusterId, _id);\n    if (_id) {\n      if (commonEdges.length > 0) {\n        reserve = _id;\n      } else {\n        return _id;\n      }\n    }\n  }\n  return reserve;\n}, \"findNonClusterChild\");\nvar getAnchorId = /* @__PURE__ */ __name((id) => {\n  if (!clusterDb.has(id)) {\n    return id;\n  }\n  if (!clusterDb.get(id).externalConnections) {\n    return id;\n  }\n  if (clusterDb.has(id)) {\n    return clusterDb.get(id).id;\n  }\n  return id;\n}, \"getAnchorId\");\nvar adjustClustersAndEdges = /* @__PURE__ */ __name((graph, depth) => {\n  if (!graph || depth > 10) {\n    log.debug(\"Opting out, no graph \");\n    return;\n  } else {\n    log.debug(\"Opting in, graph \");\n  }\n  graph.nodes().forEach(function(id) {\n    const children = graph.children(id);\n    if (children.length > 0) {\n      log.warn(\n        \"Cluster identified\",\n        id,\n        \" Replacement id in edges: \",\n        findNonClusterChild(id, graph, id)\n      );\n      descendants.set(id, extractDescendants(id, graph));\n      clusterDb.set(id, { id: findNonClusterChild(id, graph, id), clusterData: graph.node(id) });\n    }\n  });\n  graph.nodes().forEach(function(id) {\n    const children = graph.children(id);\n    const edges = graph.edges();\n    if (children.length > 0) {\n      log.debug(\"Cluster identified\", id, descendants);\n      edges.forEach((edge) => {\n        const d1 = isDescendant(edge.v, id);\n        const d2 = isDescendant(edge.w, id);\n        if (d1 ^ d2) {\n          log.warn(\"Edge: \", edge, \" leaves cluster \", id);\n          log.warn(\"Descendants of XXX \", id, \": \", descendants.get(id));\n          clusterDb.get(id).externalConnections = true;\n        }\n      });\n    } else {\n      log.debug(\"Not a cluster \", id, descendants);\n    }\n  });\n  for (let id of clusterDb.keys()) {\n    const nonClusterChild = clusterDb.get(id).id;\n    const parent = graph.parent(nonClusterChild);\n    if (parent !== id && clusterDb.has(parent) && !clusterDb.get(parent).externalConnections) {\n      clusterDb.get(id).id = parent;\n    }\n  }\n  graph.edges().forEach(function(e) {\n    const edge = graph.edge(e);\n    log.warn(\"Edge \" + e.v + \" -> \" + e.w + \": \" + JSON.stringify(e));\n    log.warn(\"Edge \" + e.v + \" -> \" + e.w + \": \" + JSON.stringify(graph.edge(e)));\n    let v = e.v;\n    let w = e.w;\n    log.warn(\n      \"Fix XXX\",\n      clusterDb,\n      \"ids:\",\n      e.v,\n      e.w,\n      \"Translating: \",\n      clusterDb.get(e.v),\n      \" --- \",\n      clusterDb.get(e.w)\n    );\n    if (clusterDb.get(e.v) || clusterDb.get(e.w)) {\n      log.warn(\"Fixing and trying - removing XXX\", e.v, e.w, e.name);\n      v = getAnchorId(e.v);\n      w = getAnchorId(e.w);\n      graph.removeEdge(e.v, e.w, e.name);\n      if (v !== e.v) {\n        const parent = graph.parent(v);\n        clusterDb.get(parent).externalConnections = true;\n        edge.fromCluster = e.v;\n      }\n      if (w !== e.w) {\n        const parent = graph.parent(w);\n        clusterDb.get(parent).externalConnections = true;\n        edge.toCluster = e.w;\n      }\n      log.warn(\"Fix Replacing with XXX\", v, w, e.name);\n      graph.setEdge(v, w, edge, e.name);\n    }\n  });\n  log.warn(\"Adjusted Graph\", graphlibJson.write(graph));\n  extractor(graph, 0);\n  log.trace(clusterDb);\n}, \"adjustClustersAndEdges\");\nvar extractor = /* @__PURE__ */ __name((graph, depth) => {\n  log.warn(\"extractor - \", depth, graphlibJson.write(graph), graph.children(\"D\"));\n  if (depth > 10) {\n    log.error(\"Bailing out\");\n    return;\n  }\n  let nodes = graph.nodes();\n  let hasChildren = false;\n  for (const node of nodes) {\n    const children = graph.children(node);\n    hasChildren = hasChildren || children.length > 0;\n  }\n  if (!hasChildren) {\n    log.debug(\"Done, no node has children\", graph.nodes());\n    return;\n  }\n  log.debug(\"Nodes = \", nodes, depth);\n  for (const node of nodes) {\n    log.debug(\n      \"Extracting node\",\n      node,\n      clusterDb,\n      clusterDb.has(node) && !clusterDb.get(node).externalConnections,\n      !graph.parent(node),\n      graph.node(node),\n      graph.children(\"D\"),\n      \" Depth \",\n      depth\n    );\n    if (!clusterDb.has(node)) {\n      log.debug(\"Not a cluster\", node, depth);\n    } else if (!clusterDb.get(node).externalConnections && graph.children(node) && graph.children(node).length > 0) {\n      log.warn(\n        \"Cluster without external connections, without a parent and with children\",\n        node,\n        depth\n      );\n      const graphSettings = graph.graph();\n      let dir = graphSettings.rankdir === \"TB\" ? \"LR\" : \"TB\";\n      if (clusterDb.get(node)?.clusterData?.dir) {\n        dir = clusterDb.get(node).clusterData.dir;\n        log.warn(\"Fixing dir\", clusterDb.get(node).clusterData.dir, dir);\n      }\n      const clusterGraph = new graphlib.Graph({\n        multigraph: true,\n        compound: true\n      }).setGraph({\n        rankdir: dir,\n        nodesep: 50,\n        ranksep: 50,\n        marginx: 8,\n        marginy: 8\n      }).setDefaultEdgeLabel(function() {\n        return {};\n      });\n      log.warn(\"Old graph before copy\", graphlibJson.write(graph));\n      copy(node, graph, clusterGraph, node);\n      graph.setNode(node, {\n        clusterNode: true,\n        id: node,\n        clusterData: clusterDb.get(node).clusterData,\n        label: clusterDb.get(node).label,\n        graph: clusterGraph\n      });\n      log.warn(\"New graph after copy node: (\", node, \")\", graphlibJson.write(clusterGraph));\n      log.debug(\"Old graph after copy\", graphlibJson.write(graph));\n    } else {\n      log.warn(\n        \"Cluster ** \",\n        node,\n        \" **not meeting the criteria !externalConnections:\",\n        !clusterDb.get(node).externalConnections,\n        \" no parent: \",\n        !graph.parent(node),\n        \" children \",\n        graph.children(node) && graph.children(node).length > 0,\n        graph.children(\"D\"),\n        depth\n      );\n      log.debug(clusterDb);\n    }\n  }\n  nodes = graph.nodes();\n  log.warn(\"New list of nodes\", nodes);\n  for (const node of nodes) {\n    const data = graph.node(node);\n    log.warn(\" Now next level\", node, data);\n    if (data?.clusterNode) {\n      extractor(data.graph, depth + 1);\n    }\n  }\n}, \"extractor\");\nvar sorter = /* @__PURE__ */ __name((graph, nodes) => {\n  if (nodes.length === 0) {\n    return [];\n  }\n  let result = Object.assign([], nodes);\n  nodes.forEach((node) => {\n    const children = graph.children(node);\n    const sorted = sorter(graph, children);\n    result = [...result, ...sorted];\n  });\n  return result;\n}, \"sorter\");\nvar sortNodesByHierarchy = /* @__PURE__ */ __name((graph) => sorter(graph, graph.children()), \"sortNodesByHierarchy\");\n\n// src/rendering-util/layout-algorithms/dagre/index.js\nvar recursiveRender = /* @__PURE__ */ __name(async (_elem, graph, diagramType, id, parentCluster, siteConfig) => {\n  log.warn(\"Graph in recursive render:XAX\", graphlibJson2.write(graph), parentCluster);\n  const dir = graph.graph().rankdir;\n  log.trace(\"Dir in recursive render - dir:\", dir);\n  const elem = _elem.insert(\"g\").attr(\"class\", \"root\");\n  if (!graph.nodes()) {\n    log.info(\"No nodes found for\", graph);\n  } else {\n    log.info(\"Recursive render XXX\", graph.nodes());\n  }\n  if (graph.edges().length > 0) {\n    log.info(\"Recursive edges\", graph.edge(graph.edges()[0]));\n  }\n  const clusters = elem.insert(\"g\").attr(\"class\", \"clusters\");\n  const edgePaths = elem.insert(\"g\").attr(\"class\", \"edgePaths\");\n  const edgeLabels = elem.insert(\"g\").attr(\"class\", \"edgeLabels\");\n  const nodes = elem.insert(\"g\").attr(\"class\", \"nodes\");\n  await Promise.all(\n    graph.nodes().map(async function(v) {\n      const node = graph.node(v);\n      if (parentCluster !== void 0) {\n        const data = JSON.parse(JSON.stringify(parentCluster.clusterData));\n        log.trace(\n          \"Setting data for parent cluster XXX\\n Node.id = \",\n          v,\n          \"\\n data=\",\n          data.height,\n          \"\\nParent cluster\",\n          parentCluster.height\n        );\n        graph.setNode(parentCluster.id, data);\n        if (!graph.parent(v)) {\n          log.trace(\"Setting parent\", v, parentCluster.id);\n          graph.setParent(v, parentCluster.id, data);\n        }\n      }\n      log.info(\"(Insert) Node XXX\" + v + \": \" + JSON.stringify(graph.node(v)));\n      if (node?.clusterNode) {\n        log.info(\"Cluster identified XBX\", v, node.width, graph.node(v));\n        const { ranksep, nodesep } = graph.graph();\n        node.graph.setGraph({\n          ...node.graph.graph(),\n          ranksep: ranksep + 25,\n          nodesep\n        });\n        const o = await recursiveRender(\n          nodes,\n          node.graph,\n          diagramType,\n          id,\n          graph.node(v),\n          siteConfig\n        );\n        const newEl = o.elem;\n        updateNodeBounds(node, newEl);\n        node.diff = o.diff || 0;\n        log.info(\n          \"New compound node after recursive render XAX\",\n          v,\n          \"width\",\n          // node,\n          node.width,\n          \"height\",\n          node.height\n          // node.x,\n          // node.y\n        );\n        setNodeElem(newEl, node);\n      } else {\n        if (graph.children(v).length > 0) {\n          log.trace(\n            \"Cluster - the non recursive path XBX\",\n            v,\n            node.id,\n            node,\n            node.width,\n            \"Graph:\",\n            graph\n          );\n          log.trace(findNonClusterChild(node.id, graph));\n          clusterDb.set(node.id, { id: findNonClusterChild(node.id, graph), node });\n        } else {\n          log.trace(\"Node - the non recursive path XAX\", v, nodes, graph.node(v), dir);\n          await insertNode(nodes, graph.node(v), { config: siteConfig, dir });\n        }\n      }\n    })\n  );\n  const processEdges = /* @__PURE__ */ __name(async () => {\n    const edgePromises = graph.edges().map(async function(e) {\n      const edge = graph.edge(e.v, e.w, e.name);\n      log.info(\"Edge \" + e.v + \" -> \" + e.w + \": \" + JSON.stringify(e));\n      log.info(\"Edge \" + e.v + \" -> \" + e.w + \": \", e, \" \", JSON.stringify(graph.edge(e)));\n      log.info(\n        \"Fix\",\n        clusterDb,\n        \"ids:\",\n        e.v,\n        e.w,\n        \"Translating: \",\n        clusterDb.get(e.v),\n        clusterDb.get(e.w)\n      );\n      await insertEdgeLabel(edgeLabels, edge);\n    });\n    await Promise.all(edgePromises);\n  }, \"processEdges\");\n  await processEdges();\n  log.info(\"Graph before layout:\", JSON.stringify(graphlibJson2.write(graph)));\n  log.info(\"############################################# XXX\");\n  log.info(\"###                Layout                 ### XXX\");\n  log.info(\"############################################# XXX\");\n  dagreLayout(graph);\n  log.info(\"Graph after layout:\", JSON.stringify(graphlibJson2.write(graph)));\n  let diff = 0;\n  let { subGraphTitleTotalMargin } = getSubGraphTitleMargins(siteConfig);\n  await Promise.all(\n    sortNodesByHierarchy(graph).map(async function(v) {\n      const node = graph.node(v);\n      log.info(\n        \"Position XBX => \" + v + \": (\" + node.x,\n        \",\" + node.y,\n        \") width: \",\n        node.width,\n        \" height: \",\n        node.height\n      );\n      if (node?.clusterNode) {\n        node.y += subGraphTitleTotalMargin;\n        log.info(\n          \"A tainted cluster node XBX1\",\n          v,\n          node.id,\n          node.width,\n          node.height,\n          node.x,\n          node.y,\n          graph.parent(v)\n        );\n        clusterDb.get(node.id).node = node;\n        positionNode(node);\n      } else {\n        if (graph.children(v).length > 0) {\n          log.info(\n            \"A pure cluster node XBX1\",\n            v,\n            node.id,\n            node.x,\n            node.y,\n            node.width,\n            node.height,\n            graph.parent(v)\n          );\n          node.height += subGraphTitleTotalMargin;\n          graph.node(node.parentId);\n          const halfPadding = node?.padding / 2 || 0;\n          const labelHeight = node?.labelBBox?.height || 0;\n          const offsetY = labelHeight - halfPadding || 0;\n          log.debug(\"OffsetY\", offsetY, \"labelHeight\", labelHeight, \"halfPadding\", halfPadding);\n          await insertCluster(clusters, node);\n          clusterDb.get(node.id).node = node;\n        } else {\n          const parent = graph.node(node.parentId);\n          node.y += subGraphTitleTotalMargin / 2;\n          log.info(\n            \"A regular node XBX1 - using the padding\",\n            node.id,\n            \"parent\",\n            node.parentId,\n            node.width,\n            node.height,\n            node.x,\n            node.y,\n            \"offsetY\",\n            node.offsetY,\n            \"parent\",\n            parent,\n            parent?.offsetY,\n            node\n          );\n          positionNode(node);\n        }\n      }\n    })\n  );\n  graph.edges().forEach(function(e) {\n    const edge = graph.edge(e);\n    log.info(\"Edge \" + e.v + \" -> \" + e.w + \": \" + JSON.stringify(edge), edge);\n    edge.points.forEach((point) => point.y += subGraphTitleTotalMargin / 2);\n    const startNode = graph.node(e.v);\n    var endNode = graph.node(e.w);\n    const paths = insertEdge(edgePaths, edge, clusterDb, diagramType, startNode, endNode, id);\n    positionEdgeLabel(edge, paths);\n  });\n  graph.nodes().forEach(function(v) {\n    const n = graph.node(v);\n    log.info(v, n.type, n.diff);\n    if (n.isGroup) {\n      diff = n.diff;\n    }\n  });\n  log.warn(\"Returning from recursive render XAX\", elem, diff);\n  return { elem, diff };\n}, \"recursiveRender\");\nvar render = /* @__PURE__ */ __name(async (data4Layout, svg) => {\n  const graph = new graphlib2.Graph({\n    multigraph: true,\n    compound: true\n  }).setGraph({\n    rankdir: data4Layout.direction,\n    nodesep: data4Layout.config?.nodeSpacing || data4Layout.config?.flowchart?.nodeSpacing || data4Layout.nodeSpacing,\n    ranksep: data4Layout.config?.rankSpacing || data4Layout.config?.flowchart?.rankSpacing || data4Layout.rankSpacing,\n    marginx: 8,\n    marginy: 8\n  }).setDefaultEdgeLabel(function() {\n    return {};\n  });\n  const element = svg.select(\"g\");\n  markers_default(element, data4Layout.markers, data4Layout.type, data4Layout.diagramId);\n  clear3();\n  clear2();\n  clear();\n  clear4();\n  data4Layout.nodes.forEach((node) => {\n    graph.setNode(node.id, { ...node });\n    if (node.parentId) {\n      graph.setParent(node.id, node.parentId);\n    }\n  });\n  log.debug(\"Edges:\", data4Layout.edges);\n  data4Layout.edges.forEach((edge) => {\n    if (edge.start === edge.end) {\n      const nodeId = edge.start;\n      const specialId1 = nodeId + \"---\" + nodeId + \"---1\";\n      const specialId2 = nodeId + \"---\" + nodeId + \"---2\";\n      const node = graph.node(nodeId);\n      graph.setNode(specialId1, {\n        domId: specialId1,\n        id: specialId1,\n        parentId: node.parentId,\n        labelStyle: \"\",\n        label: \"\",\n        padding: 0,\n        shape: \"labelRect\",\n        // shape: 'rect',\n        style: \"\",\n        width: 10,\n        height: 10\n      });\n      graph.setParent(specialId1, node.parentId);\n      graph.setNode(specialId2, {\n        domId: specialId2,\n        id: specialId2,\n        parentId: node.parentId,\n        labelStyle: \"\",\n        padding: 0,\n        // shape: 'rect',\n        shape: \"labelRect\",\n        label: \"\",\n        style: \"\",\n        width: 10,\n        height: 10\n      });\n      graph.setParent(specialId2, node.parentId);\n      const edge1 = structuredClone(edge);\n      const edgeMid = structuredClone(edge);\n      const edge2 = structuredClone(edge);\n      edge1.label = \"\";\n      edge1.arrowTypeEnd = \"none\";\n      edge1.id = nodeId + \"-cyclic-special-1\";\n      edgeMid.arrowTypeStart = \"none\";\n      edgeMid.arrowTypeEnd = \"none\";\n      edgeMid.id = nodeId + \"-cyclic-special-mid\";\n      edge2.label = \"\";\n      if (node.isGroup) {\n        edge1.fromCluster = nodeId;\n        edge2.toCluster = nodeId;\n      }\n      edge2.id = nodeId + \"-cyclic-special-2\";\n      edge2.arrowTypeStart = \"none\";\n      graph.setEdge(nodeId, specialId1, edge1, nodeId + \"-cyclic-special-0\");\n      graph.setEdge(specialId1, specialId2, edgeMid, nodeId + \"-cyclic-special-1\");\n      graph.setEdge(specialId2, nodeId, edge2, nodeId + \"-cyc<lic-special-2\");\n    } else {\n      graph.setEdge(edge.start, edge.end, { ...edge }, edge.id);\n    }\n  });\n  log.warn(\"Graph at first:\", JSON.stringify(graphlibJson2.write(graph)));\n  adjustClustersAndEdges(graph);\n  log.warn(\"Graph after XAX:\", JSON.stringify(graphlibJson2.write(graph)));\n  const siteConfig = getConfig();\n  await recursiveRender(\n    element,\n    graph,\n    data4Layout.type,\n    data4Layout.diagramId,\n    void 0,\n    siteConfig\n  );\n}, \"render\");\nexport {\n  render\n};\n"],"names":["write","g","json","writeNodes","writeEdges","_.isUndefined","_.clone","_.map","v","nodeValue","parent","node","e","edgeValue","edge","clusterDb","descendants","parents","clear4","__name","isDescendant","id","ancestorId","ancestorDescendants","log","edgeInCluster","clusterId","clusterDescendants","copy","graph","newGraph","rootId","nodes","data","edges","data2","extractDescendants","children","res","child","findCommonEdges","id1","id2","edges1","edges2","edges1Prim","edges2Prim","edgeIn1","findNonClusterChild","reserve","_id","commonEdges","getAnchorId","adjustClustersAndEdges","depth","d1","d2","nonClusterChild","w","graphlibJson.write","extractor","hasChildren","dir","_b","_a","clusterGraph","graphlib.Graph","sorter","result","sorted","sortNodesByHierarchy","recursiveRender","_elem","diagramType","parentCluster","siteConfig","graphlibJson2.write","elem","clusters","edgePaths","edgeLabels","ranksep","nodesep","o","newEl","updateNodeBounds","setNodeElem","insertNode","edgePromises","insertEdgeLabel","dagreLayout","diff","subGraphTitleTotalMargin","getSubGraphTitleMargins","positionNode","halfPadding","labelHeight","offsetY","insertCluster","point","startNode","endNode","paths","insertEdge","positionEdgeLabel","n","render","data4Layout","svg","graphlib2.Graph","_c","_d","_f","_e","element","markers_default","clear3","clear2","clear","nodeId","specialId1","specialId2","edge1","edgeMid","edge2","getConfig"],"mappings":";;;;;;AAKA,SAASA,EAAMC,GAAG;AAChB,MAAIC,IAAO;AAAA,IACT,SAAS;AAAA,MACP,UAAUD,EAAE,WAAU;AAAA,MACtB,YAAYA,EAAE,aAAY;AAAA,MAC1B,UAAUA,EAAE,WAAU;AAAA,IAC5B;AAAA,IACI,OAAOE,GAAWF,CAAC;AAAA,IACnB,OAAOG,GAAWH,CAAC;AAAA,EACvB;AACE,SAAKI,EAAcJ,EAAE,MAAK,CAAE,MAC1BC,EAAK,QAAQI,EAAQL,EAAE,MAAK,CAAE,IAEzBC;AACT;AAEA,SAASC,GAAWF,GAAG;AACrB,SAAOM,EAAMN,EAAE,MAAK,GAAI,SAAUO,GAAG;AACnC,QAAIC,IAAYR,EAAE,KAAKO,CAAC,GACpBE,IAAST,EAAE,OAAOO,CAAC,GACnBG,IAAO,EAAE,GAAGH,EAAC;AACjB,WAAKH,EAAcI,CAAS,MAC1BE,EAAK,QAAQF,IAEVJ,EAAcK,CAAM,MACvBC,EAAK,SAASD,IAETC;AAAA,EACT,CAAC;AACH;AAEA,SAASP,GAAWH,GAAG;AACrB,SAAOM,EAAMN,EAAE,MAAK,GAAI,SAAUW,GAAG;AACnC,QAAIC,IAAYZ,EAAE,KAAKW,CAAC,GACpBE,IAAO,EAAE,GAAGF,EAAE,GAAG,GAAGA,EAAE,EAAC;AAC3B,WAAKP,EAAcO,EAAE,IAAI,MACvBE,EAAK,OAAOF,EAAE,OAEXP,EAAcQ,CAAS,MAC1BC,EAAK,QAAQD,IAERC;AAAA,EACT,CAAC;AACH;ACTA,IAAIC,IAA4B,oBAAI,IAAG,GACnCC,IAA8B,oBAAI,IAAG,GACrCC,IAA0B,oBAAI,IAAG,GACjCC,KAAyB,gBAAAC,EAAO,MAAM;AACxC,EAAAH,EAAY,MAAK,GACjBC,EAAQ,MAAK,GACbF,EAAU,MAAK;AACjB,GAAG,OAAO,GACNK,IAA+B,gBAAAD,EAAO,CAACE,GAAIC,MAAe;AAC5D,QAAMC,IAAsBP,EAAY,IAAIM,CAAU,KAAK,CAAA;AAC3D,SAAAE,EAAI,MAAM,mBAAmBF,GAAY,KAAKD,GAAI,OAAOE,EAAoB,SAASF,CAAE,CAAC,GAClFE,EAAoB,SAASF,CAAE;AACxC,GAAG,cAAc,GACbI,KAAgC,gBAAAN,EAAO,CAACL,GAAMY,MAAc;AAC9D,QAAMC,IAAqBX,EAAY,IAAIU,CAAS,KAAK,CAAA;AAGzD,SAFAF,EAAI,KAAK,mBAAmBE,GAAW,QAAQC,CAAkB,GACjEH,EAAI,KAAK,YAAYV,CAAI,GACrBA,EAAK,MAAMY,KAAaZ,EAAK,MAAMY,IAC9B,KAEJC,IAIEA,EAAmB,SAASb,EAAK,CAAC,KAAKM,EAAaN,EAAK,GAAGY,CAAS,KAAKN,EAAaN,EAAK,GAAGY,CAAS,KAAKC,EAAmB,SAASb,EAAK,CAAC,KAHpJU,EAAI,MAAM,UAAUE,GAAW,qBAAqB,GAC7C;AAGX,GAAG,eAAe,GACdE,IAAuB,gBAAAT,EAAO,CAACO,GAAWG,GAAOC,GAAUC,MAAW;AACxE,EAAAP,EAAI;AAAA,IACF;AAAA,IACAE;AAAA,IACA;AAAA,IACAK;AAAA,IACA;AAAA,IACAF,EAAM,KAAKH,CAAS;AAAA,IACpBK;AAAA,EACJ;AACE,QAAMC,IAAQH,EAAM,SAASH,CAAS,KAAK,CAAA;AAC3C,EAAIA,MAAcK,KAChBC,EAAM,KAAKN,CAAS,GAEtBF,EAAI,KAAK,6BAA6BE,GAAW,SAASM,CAAK,GAC/DA,EAAM,QAAQ,CAACrB,MAAS;AACtB,QAAIkB,EAAM,SAASlB,CAAI,EAAE,SAAS;AAChC,MAAAiB,EAAKjB,GAAMkB,GAAOC,GAAUC,CAAM;AAAA,SAC7B;AACL,YAAME,IAAOJ,EAAM,KAAKlB,CAAI;AAC5B,MAAAa,EAAI,KAAK,OAAOb,GAAM,QAAQoB,GAAQ,iBAAiBL,CAAS,GAChEI,EAAS,QAAQnB,GAAMsB,CAAI,GACvBF,MAAWF,EAAM,OAAOlB,CAAI,MAC9Ba,EAAI,KAAK,kBAAkBb,GAAMkB,EAAM,OAAOlB,CAAI,CAAC,GACnDmB,EAAS,UAAUnB,GAAMkB,EAAM,OAAOlB,CAAI,CAAC,IAEzCe,MAAcK,KAAUpB,MAASe,KACnCF,EAAI,MAAM,kBAAkBb,GAAMe,CAAS,GAC3CI,EAAS,UAAUnB,GAAMe,CAAS,MAElCF,EAAI,KAAK,YAAYE,GAAW,QAAQK,GAAQ,QAAQF,EAAM,KAAKH,CAAS,GAAGK,CAAM,GACrFP,EAAI;AAAA,QACF;AAAA,QACAb;AAAA,QACA;AAAA,QACAe,MAAcK;AAAA,QACd;AAAA,QACApB,MAASe;AAAA,MACnB;AAEM,YAAMQ,IAAQL,EAAM,MAAMlB,CAAI;AAC9B,MAAAa,EAAI,MAAM,iBAAiBU,CAAK,GAChCA,EAAM,QAAQ,CAACpB,MAAS;AACtB,QAAAU,EAAI,KAAK,QAAQV,CAAI;AACrB,cAAMqB,IAAQN,EAAM,KAAKf,EAAK,GAAGA,EAAK,GAAGA,EAAK,IAAI;AAClD,QAAAU,EAAI,KAAK,aAAaW,GAAOJ,CAAM;AACnC,YAAI;AACF,UAAIN,GAAcX,GAAMiB,CAAM,KAC5BP,EAAI,KAAK,eAAeV,EAAK,GAAGA,EAAK,GAAGqB,GAAOrB,EAAK,IAAI,GACxDgB,EAAS,QAAQhB,EAAK,GAAGA,EAAK,GAAGqB,GAAOrB,EAAK,IAAI,GACjDU,EAAI,KAAK,mBAAmBM,EAAS,MAAK,GAAIA,EAAS,KAAKA,EAAS,QAAQ,CAAC,CAAC,CAAC,KAEhFN,EAAI;AAAA,YACF;AAAA,YACAV,EAAK;AAAA,YACL;AAAA,YACAA,EAAK;AAAA,YACL;AAAA,YACAiB;AAAA,YACA;AAAA,YACAL;AAAA,UACd;AAAA,QAEQ,SAASd,GAAG;AACV,UAAAY,EAAI,MAAMZ,CAAC;AAAA,QACb;AAAA,MACF,CAAC;AAAA,IACH;AACA,IAAAY,EAAI,MAAM,iBAAiBb,CAAI,GAC/BkB,EAAM,WAAWlB,CAAI;AAAA,EACvB,CAAC;AACH,GAAG,MAAM,GACLyB,IAAqC,gBAAAjB,EAAO,CAACE,GAAIQ,MAAU;AAC7D,QAAMQ,IAAWR,EAAM,SAASR,CAAE;AAClC,MAAIiB,IAAM,CAAC,GAAGD,CAAQ;AACtB,aAAWE,KAASF;AAClB,IAAApB,EAAQ,IAAIsB,GAAOlB,CAAE,GACrBiB,IAAM,CAAC,GAAGA,GAAK,GAAGF,EAAmBG,GAAOV,CAAK,CAAC;AAEpD,SAAOS;AACT,GAAG,oBAAoB,GACnBE,KAAkC,gBAAArB,EAAO,CAACU,GAAOY,GAAKC,MAAQ;AAChE,QAAMC,IAASd,EAAM,MAAK,EAAG,OAAO,CAACf,MAASA,EAAK,MAAM2B,KAAO3B,EAAK,MAAM2B,CAAG,GACxEG,IAASf,EAAM,MAAK,EAAG,OAAO,CAACf,MAASA,EAAK,MAAM4B,KAAO5B,EAAK,MAAM4B,CAAG,GACxEG,IAAaF,EAAO,IAAI,CAAC7B,OACtB,EAAE,GAAGA,EAAK,MAAM2B,IAAMC,IAAM5B,EAAK,GAAG,GAAGA,EAAK,MAAM2B,IAAMA,IAAM3B,EAAK,EAAC,EAC5E,GACKgC,IAAaF,EAAO,IAAI,CAAC9B,OACtB,EAAE,GAAGA,EAAK,GAAG,GAAGA,EAAK,EAAC,EAC9B;AAID,SAHe+B,EAAW,OAAO,CAACE,MACzBD,EAAW,KAAK,CAAChC,MAASiC,EAAQ,MAAMjC,EAAK,KAAKiC,EAAQ,MAAMjC,EAAK,CAAC,CAC9E;AAEH,GAAG,iBAAiB,GAChBkC,IAAsC,gBAAA7B,EAAO,CAACE,GAAIQ,GAAOH,MAAc;AACzE,QAAMW,IAAWR,EAAM,SAASR,CAAE;AAElC,MADAG,EAAI,MAAM,6BAA6BH,GAAIgB,CAAQ,GAC/CA,EAAS,SAAS;AACpB,WAAOhB;AAET,MAAI4B;AACJ,aAAWV,KAASF,GAAU;AAC5B,UAAMa,IAAMF,EAAoBT,GAAOV,GAAOH,CAAS,GACjDyB,IAAcX,GAAgBX,GAAOH,GAAWwB,CAAG;AACzD,QAAIA;AACF,UAAIC,EAAY,SAAS;AACvB,QAAAF,IAAUC;AAAA;AAEV,eAAOA;AAAA,EAGb;AACA,SAAOD;AACT,GAAG,qBAAqB,GACpBG,IAA8B,gBAAAjC,EAAO,CAACE,MACpC,CAACN,EAAU,IAAIM,CAAE,KAGjB,CAACN,EAAU,IAAIM,CAAE,EAAE,sBACdA,IAELN,EAAU,IAAIM,CAAE,IACXN,EAAU,IAAIM,CAAE,EAAE,KAEpBA,GACN,aAAa,GACZgC,KAAyC,gBAAAlC,EAAO,CAACU,GAAOyB,MAAU;AACpE,MAAI,CAACzB,KAASyB,IAAQ,IAAI;AACxB,IAAA9B,EAAI,MAAM,uBAAuB;AACjC;AAAA,EACF;AACE,IAAAA,EAAI,MAAM,mBAAmB;AAE/B,EAAAK,EAAM,MAAK,EAAG,QAAQ,SAASR,GAAI;AAEjC,IADiBQ,EAAM,SAASR,CAAE,EACrB,SAAS,MACpBG,EAAI;AAAA,MACF;AAAA,MACAH;AAAA,MACA;AAAA,MACA2B,EAAoB3B,GAAIQ,GAAOR,CAAE;AAAA,IACzC,GACML,EAAY,IAAIK,GAAIe,EAAmBf,GAAIQ,CAAK,CAAC,GACjDd,EAAU,IAAIM,GAAI,EAAE,IAAI2B,EAAoB3B,GAAIQ,GAAOR,CAAE,GAAG,aAAaQ,EAAM,KAAKR,CAAE,EAAC,CAAE;AAAA,EAE7F,CAAC,GACDQ,EAAM,MAAK,EAAG,QAAQ,SAASR,GAAI;AACjC,UAAMgB,IAAWR,EAAM,SAASR,CAAE,GAC5Ba,IAAQL,EAAM,MAAK;AACzB,IAAIQ,EAAS,SAAS,KACpBb,EAAI,MAAM,sBAAsBH,GAAIL,CAAW,GAC/CkB,EAAM,QAAQ,CAACpB,MAAS;AACtB,YAAMyC,IAAKnC,EAAaN,EAAK,GAAGO,CAAE,GAC5BmC,IAAKpC,EAAaN,EAAK,GAAGO,CAAE;AAClC,MAAIkC,IAAKC,MACPhC,EAAI,KAAK,UAAUV,GAAM,oBAAoBO,CAAE,GAC/CG,EAAI,KAAK,uBAAuBH,GAAI,MAAML,EAAY,IAAIK,CAAE,CAAC,GAC7DN,EAAU,IAAIM,CAAE,EAAE,sBAAsB;AAAA,IAE5C,CAAC,KAEDG,EAAI,MAAM,kBAAkBH,GAAIL,CAAW;AAAA,EAE/C,CAAC;AACD,WAASK,KAAMN,EAAU,QAAQ;AAC/B,UAAM0C,IAAkB1C,EAAU,IAAIM,CAAE,EAAE,IACpCX,IAASmB,EAAM,OAAO4B,CAAe;AAC3C,IAAI/C,MAAWW,KAAMN,EAAU,IAAIL,CAAM,KAAK,CAACK,EAAU,IAAIL,CAAM,EAAE,wBACnEK,EAAU,IAAIM,CAAE,EAAE,KAAKX;AAAA,EAE3B;AACA,EAAAmB,EAAM,MAAK,EAAG,QAAQ,SAASjB,GAAG;AAChC,UAAME,IAAOe,EAAM,KAAKjB,CAAC;AACzB,IAAAY,EAAI,KAAK,UAAUZ,EAAE,IAAI,SAASA,EAAE,IAAI,OAAO,KAAK,UAAUA,CAAC,CAAC,GAChEY,EAAI,KAAK,UAAUZ,EAAE,IAAI,SAASA,EAAE,IAAI,OAAO,KAAK,UAAUiB,EAAM,KAAKjB,CAAC,CAAC,CAAC;AAC5E,QAAIJ,IAAII,EAAE,GACN8C,IAAI9C,EAAE;AAYV,QAXAY,EAAI;AAAA,MACF;AAAA,MACAT;AAAA,MACA;AAAA,MACAH,EAAE;AAAA,MACFA,EAAE;AAAA,MACF;AAAA,MACAG,EAAU,IAAIH,EAAE,CAAC;AAAA,MACjB;AAAA,MACAG,EAAU,IAAIH,EAAE,CAAC;AAAA,IACvB,GACQG,EAAU,IAAIH,EAAE,CAAC,KAAKG,EAAU,IAAIH,EAAE,CAAC,GAAG;AAK5C,UAJAY,EAAI,KAAK,oCAAoCZ,EAAE,GAAGA,EAAE,GAAGA,EAAE,IAAI,GAC7DJ,IAAI4C,EAAYxC,EAAE,CAAC,GACnB8C,IAAIN,EAAYxC,EAAE,CAAC,GACnBiB,EAAM,WAAWjB,EAAE,GAAGA,EAAE,GAAGA,EAAE,IAAI,GAC7BJ,MAAMI,EAAE,GAAG;AACb,cAAMF,IAASmB,EAAM,OAAOrB,CAAC;AAC7B,QAAAO,EAAU,IAAIL,CAAM,EAAE,sBAAsB,IAC5CI,EAAK,cAAcF,EAAE;AAAA,MACvB;AACA,UAAI8C,MAAM9C,EAAE,GAAG;AACb,cAAMF,IAASmB,EAAM,OAAO6B,CAAC;AAC7B,QAAA3C,EAAU,IAAIL,CAAM,EAAE,sBAAsB,IAC5CI,EAAK,YAAYF,EAAE;AAAA,MACrB;AACA,MAAAY,EAAI,KAAK,0BAA0BhB,GAAGkD,GAAG9C,EAAE,IAAI,GAC/CiB,EAAM,QAAQrB,GAAGkD,GAAG5C,GAAMF,EAAE,IAAI;AAAA,IAClC;AAAA,EACF,CAAC,GACDY,EAAI,KAAK,kBAAkBmC,EAAmB9B,CAAK,CAAC,GACpD+B,EAAU/B,GAAO,CAAC,GAClBL,EAAI,MAAMT,CAAS;AACrB,GAAG,wBAAwB,GACvB6C,IAA4B,gBAAAzC,EAAO,CAACU,GAAOyB,MAAU;;AAEvD,MADA9B,EAAI,KAAK,gBAAgB8B,GAAOK,EAAmB9B,CAAK,GAAGA,EAAM,SAAS,GAAG,CAAC,GAC1EyB,IAAQ,IAAI;AACd,IAAA9B,EAAI,MAAM,aAAa;AACvB;AAAA,EACF;AACA,MAAIQ,IAAQH,EAAM,MAAK,GACnBgC,IAAc;AAClB,aAAWlD,KAAQqB,GAAO;AACxB,UAAMK,IAAWR,EAAM,SAASlB,CAAI;AACpC,IAAAkD,IAAcA,KAAexB,EAAS,SAAS;AAAA,EACjD;AACA,MAAI,CAACwB,GAAa;AAChB,IAAArC,EAAI,MAAM,8BAA8BK,EAAM,MAAK,CAAE;AACrD;AAAA,EACF;AACA,EAAAL,EAAI,MAAM,YAAYQ,GAAOsB,CAAK;AAClC,aAAW3C,KAAQqB;AAYjB,QAXAR,EAAI;AAAA,MACF;AAAA,MACAb;AAAA,MACAI;AAAA,MACAA,EAAU,IAAIJ,CAAI,KAAK,CAACI,EAAU,IAAIJ,CAAI,EAAE;AAAA,MAC5C,CAACkB,EAAM,OAAOlB,CAAI;AAAA,MAClBkB,EAAM,KAAKlB,CAAI;AAAA,MACfkB,EAAM,SAAS,GAAG;AAAA,MAClB;AAAA,MACAyB;AAAA,IACN,GACQ,CAACvC,EAAU,IAAIJ,CAAI;AACrB,MAAAa,EAAI,MAAM,iBAAiBb,GAAM2C,CAAK;AAAA,aAC7B,CAACvC,EAAU,IAAIJ,CAAI,EAAE,uBAAuBkB,EAAM,SAASlB,CAAI,KAAKkB,EAAM,SAASlB,CAAI,EAAE,SAAS,GAAG;AAC9G,MAAAa,EAAI;AAAA,QACF;AAAA,QACAb;AAAA,QACA2C;AAAA,MACR;AAEM,UAAIQ,IADkBjC,EAAM,MAAK,EACT,YAAY,OAAO,OAAO;AAClD,OAAIkC,KAAAC,IAAAjD,EAAU,IAAIJ,CAAI,MAAlB,gBAAAqD,EAAqB,gBAArB,QAAAD,EAAkC,QACpCD,IAAM/C,EAAU,IAAIJ,CAAI,EAAE,YAAY,KACtCa,EAAI,KAAK,cAAcT,EAAU,IAAIJ,CAAI,EAAE,YAAY,KAAKmD,CAAG;AAEjE,YAAMG,IAAe,IAAIC,EAAe;AAAA,QACtC,YAAY;AAAA,QACZ,UAAU;AAAA,MAClB,CAAO,EAAE,SAAS;AAAA,QACV,SAASJ;AAAA,QACT,SAAS;AAAA,QACT,SAAS;AAAA,QACT,SAAS;AAAA,QACT,SAAS;AAAA,MACjB,CAAO,EAAE,oBAAoB,WAAW;AAChC,eAAO,CAAA;AAAA,MACT,CAAC;AACD,MAAAtC,EAAI,KAAK,yBAAyBmC,EAAmB9B,CAAK,CAAC,GAC3DD,EAAKjB,GAAMkB,GAAOoC,GAActD,CAAI,GACpCkB,EAAM,QAAQlB,GAAM;AAAA,QAClB,aAAa;AAAA,QACb,IAAIA;AAAA,QACJ,aAAaI,EAAU,IAAIJ,CAAI,EAAE;AAAA,QACjC,OAAOI,EAAU,IAAIJ,CAAI,EAAE;AAAA,QAC3B,OAAOsD;AAAA,MACf,CAAO,GACDzC,EAAI,KAAK,gCAAgCb,GAAM,KAAKgD,EAAmBM,CAAY,CAAC,GACpFzC,EAAI,MAAM,wBAAwBmC,EAAmB9B,CAAK,CAAC;AAAA,IAC7D;AACE,MAAAL,EAAI;AAAA,QACF;AAAA,QACAb;AAAA,QACA;AAAA,QACA,CAACI,EAAU,IAAIJ,CAAI,EAAE;AAAA,QACrB;AAAA,QACA,CAACkB,EAAM,OAAOlB,CAAI;AAAA,QAClB;AAAA,QACAkB,EAAM,SAASlB,CAAI,KAAKkB,EAAM,SAASlB,CAAI,EAAE,SAAS;AAAA,QACtDkB,EAAM,SAAS,GAAG;AAAA,QAClByB;AAAA,MACR,GACM9B,EAAI,MAAMT,CAAS;AAGvB,EAAAiB,IAAQH,EAAM,MAAK,GACnBL,EAAI,KAAK,qBAAqBQ,CAAK;AACnC,aAAWrB,KAAQqB,GAAO;AACxB,UAAMC,IAAOJ,EAAM,KAAKlB,CAAI;AAC5B,IAAAa,EAAI,KAAK,mBAAmBb,GAAMsB,CAAI,GAClCA,KAAA,QAAAA,EAAM,eACR2B,EAAU3B,EAAK,OAAOqB,IAAQ,CAAC;AAAA,EAEnC;AACF,GAAG,WAAW,GACVa,IAAyB,gBAAAhD,EAAO,CAACU,GAAOG,MAAU;AACpD,MAAIA,EAAM,WAAW;AACnB,WAAO,CAAA;AAET,MAAIoC,IAAS,OAAO,OAAO,CAAA,GAAIpC,CAAK;AACpC,SAAAA,EAAM,QAAQ,CAACrB,MAAS;AACtB,UAAM0B,IAAWR,EAAM,SAASlB,CAAI,GAC9B0D,IAASF,EAAOtC,GAAOQ,CAAQ;AACrC,IAAA+B,IAAS,CAAC,GAAGA,GAAQ,GAAGC,CAAM;AAAA,EAChC,CAAC,GACMD;AACT,GAAG,QAAQ,GACPE,KAAuC,gBAAAnD,EAAO,CAACU,MAAUsC,EAAOtC,GAAOA,EAAM,UAAU,GAAG,sBAAsB,GAGhH0C,IAAkC,gBAAApD,EAAO,OAAOqD,GAAO3C,GAAO4C,GAAapD,GAAIqD,GAAeC,MAAe;AAC/G,EAAAnD,EAAI,KAAK,iCAAiCoD,EAAoB/C,CAAK,GAAG6C,CAAa;AACnF,QAAMZ,IAAMjC,EAAM,MAAK,EAAG;AAC1B,EAAAL,EAAI,MAAM,kCAAkCsC,CAAG;AAC/C,QAAMe,IAAOL,EAAM,OAAO,GAAG,EAAE,KAAK,SAAS,MAAM;AACnD,EAAK3C,EAAM,UAGTL,EAAI,KAAK,wBAAwBK,EAAM,MAAK,CAAE,IAF9CL,EAAI,KAAK,sBAAsBK,CAAK,GAIlCA,EAAM,QAAQ,SAAS,KACzBL,EAAI,KAAK,mBAAmBK,EAAM,KAAKA,EAAM,MAAK,EAAG,CAAC,CAAC,CAAC;AAE1D,QAAMiD,IAAWD,EAAK,OAAO,GAAG,EAAE,KAAK,SAAS,UAAU,GACpDE,IAAYF,EAAK,OAAO,GAAG,EAAE,KAAK,SAAS,WAAW,GACtDG,IAAaH,EAAK,OAAO,GAAG,EAAE,KAAK,SAAS,YAAY,GACxD7C,IAAQ6C,EAAK,OAAO,GAAG,EAAE,KAAK,SAAS,OAAO;AACpD,QAAM,QAAQ;AAAA,IACZhD,EAAM,MAAK,EAAG,IAAI,eAAerB,GAAG;AAClC,YAAMG,IAAOkB,EAAM,KAAKrB,CAAC;AACzB,UAAIkE,MAAkB,QAAQ;AAC5B,cAAMzC,IAAO,KAAK,MAAM,KAAK,UAAUyC,EAAc,WAAW,CAAC;AACjE,QAAAlD,EAAI;AAAA,UACF;AAAA;AAAA,UACAhB;AAAA,UACA;AAAA;AAAA,UACAyB,EAAK;AAAA,UACL;AAAA;AAAA,UACAyC,EAAc;AAAA,QACxB,GACQ7C,EAAM,QAAQ6C,EAAc,IAAIzC,CAAI,GAC/BJ,EAAM,OAAOrB,CAAC,MACjBgB,EAAI,MAAM,kBAAkBhB,GAAGkE,EAAc,EAAE,GAC/C7C,EAAM,UAAUrB,GAAGkE,EAAc,IAAIzC,CAAI;AAAA,MAE7C;AAEA,UADAT,EAAI,KAAK,sBAAsBhB,IAAI,OAAO,KAAK,UAAUqB,EAAM,KAAKrB,CAAC,CAAC,CAAC,GACnEG,KAAA,QAAAA,EAAM,aAAa;AACrB,QAAAa,EAAI,KAAK,0BAA0BhB,GAAGG,EAAK,OAAOkB,EAAM,KAAKrB,CAAC,CAAC;AAC/D,cAAM,EAAE,SAAAyE,GAAS,SAAAC,MAAYrD,EAAM,MAAK;AACxC,QAAAlB,EAAK,MAAM,SAAS;AAAA,UAClB,GAAGA,EAAK,MAAM,MAAK;AAAA,UACnB,SAASsE,IAAU;AAAA,UACnB,SAAAC;AAAA,QACV,CAAS;AACD,cAAMC,IAAI,MAAMZ;AAAA,UACdvC;AAAA,UACArB,EAAK;AAAA,UACL8D;AAAA,UACApD;AAAA,UACAQ,EAAM,KAAKrB,CAAC;AAAA,UACZmE;AAAA,QACV,GACcS,IAAQD,EAAE;AAChB,QAAAE,EAAiB1E,GAAMyE,CAAK,GAC5BzE,EAAK,OAAOwE,EAAE,QAAQ,GACtB3D,EAAI;AAAA,UACF;AAAA,UACAhB;AAAA,UACA;AAAA;AAAA,UAEAG,EAAK;AAAA,UACL;AAAA,UACAA,EAAK;AAAA;AAAA;AAAA,QAGf,GACQ2E,EAAYF,GAAOzE,CAAI;AAAA,MACzB;AACE,QAAIkB,EAAM,SAASrB,CAAC,EAAE,SAAS,KAC7BgB,EAAI;AAAA,UACF;AAAA,UACAhB;AAAA,UACAG,EAAK;AAAA,UACLA;AAAA,UACAA,EAAK;AAAA,UACL;AAAA,UACAkB;AAAA,QACZ,GACUL,EAAI,MAAMwB,EAAoBrC,EAAK,IAAIkB,CAAK,CAAC,GAC7Cd,EAAU,IAAIJ,EAAK,IAAI,EAAE,IAAIqC,EAAoBrC,EAAK,IAAIkB,CAAK,GAAG,MAAAlB,EAAI,CAAE,MAExEa,EAAI,MAAM,qCAAqChB,GAAGwB,GAAOH,EAAM,KAAKrB,CAAC,GAAGsD,CAAG,GAC3E,MAAMyB,EAAWvD,GAAOH,EAAM,KAAKrB,CAAC,GAAG,EAAE,QAAQmE,GAAY,KAAAb,GAAK;AAAA,IAGxE,CAAC;AAAA,EACL,GAoBE,OAnBqC,gBAAA3C,EAAO,YAAY;AACtD,UAAMqE,IAAe3D,EAAM,MAAK,EAAG,IAAI,eAAejB,GAAG;AACvD,YAAME,IAAOe,EAAM,KAAKjB,EAAE,GAAGA,EAAE,GAAGA,EAAE,IAAI;AACxC,MAAAY,EAAI,KAAK,UAAUZ,EAAE,IAAI,SAASA,EAAE,IAAI,OAAO,KAAK,UAAUA,CAAC,CAAC,GAChEY,EAAI,KAAK,UAAUZ,EAAE,IAAI,SAASA,EAAE,IAAI,MAAMA,GAAG,KAAK,KAAK,UAAUiB,EAAM,KAAKjB,CAAC,CAAC,CAAC,GACnFY,EAAI;AAAA,QACF;AAAA,QACAT;AAAA,QACA;AAAA,QACAH,EAAE;AAAA,QACFA,EAAE;AAAA,QACF;AAAA,QACAG,EAAU,IAAIH,EAAE,CAAC;AAAA,QACjBG,EAAU,IAAIH,EAAE,CAAC;AAAA,MACzB,GACM,MAAM6E,EAAgBT,GAAYlE,CAAI;AAAA,IACxC,CAAC;AACD,UAAM,QAAQ,IAAI0E,CAAY;AAAA,EAChC,GAAG,cAAc,GACC,GAClBhE,EAAI,KAAK,wBAAwB,KAAK,UAAUoD,EAAoB/C,CAAK,CAAC,CAAC,GAC3EL,EAAI,KAAK,mDAAmD,GAC5DA,EAAI,KAAK,mDAAmD,GAC5DA,EAAI,KAAK,mDAAmD,GAC5DkE,EAAY7D,CAAK,GACjBL,EAAI,KAAK,uBAAuB,KAAK,UAAUoD,EAAoB/C,CAAK,CAAC,CAAC;AAC1E,MAAI8D,IAAO,GACP,EAAE,0BAAAC,EAAwB,IAAKC,EAAwBlB,CAAU;AACrE,eAAM,QAAQ;AAAA,IACZL,GAAqBzC,CAAK,EAAE,IAAI,eAAerB,GAAG;;AAChD,YAAMG,IAAOkB,EAAM,KAAKrB,CAAC;AASzB,UARAgB,EAAI;AAAA,QACF,qBAAqBhB,IAAI,QAAQG,EAAK;AAAA,QACtC,MAAMA,EAAK;AAAA,QACX;AAAA,QACAA,EAAK;AAAA,QACL;AAAA,QACAA,EAAK;AAAA,MACb,GACUA,KAAA,QAAAA,EAAM;AACR,QAAAA,EAAK,KAAKiF,GACVpE,EAAI;AAAA,UACF;AAAA,UACAhB;AAAA,UACAG,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLkB,EAAM,OAAOrB,CAAC;AAAA,QACxB,GACQO,EAAU,IAAIJ,EAAK,EAAE,EAAE,OAAOA,GAC9BmF,EAAanF,CAAI;AAAA,eAEbkB,EAAM,SAASrB,CAAC,EAAE,SAAS,GAAG;AAChC,QAAAgB,EAAI;AAAA,UACF;AAAA,UACAhB;AAAA,UACAG,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLkB,EAAM,OAAOrB,CAAC;AAAA,QAC1B,GACUG,EAAK,UAAUiF,GACf/D,EAAM,KAAKlB,EAAK,QAAQ;AACxB,cAAMoF,KAAcpF,KAAA,gBAAAA,EAAM,WAAU,KAAK,GACnCqF,MAAchC,IAAArD,KAAA,gBAAAA,EAAM,cAAN,gBAAAqD,EAAiB,WAAU,GACzCiC,IAAUD,IAAcD,KAAe;AAC7C,QAAAvE,EAAI,MAAM,WAAWyE,GAAS,eAAeD,GAAa,eAAeD,CAAW,GACpF,MAAMG,EAAcpB,GAAUnE,CAAI,GAClCI,EAAU,IAAIJ,EAAK,EAAE,EAAE,OAAOA;AAAA,MAChC,OAAO;AACL,cAAMD,IAASmB,EAAM,KAAKlB,EAAK,QAAQ;AACvC,QAAAA,EAAK,KAAKiF,IAA2B,GACrCpE,EAAI;AAAA,UACF;AAAA,UACAb,EAAK;AAAA,UACL;AAAA,UACAA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACL;AAAA,UACAA,EAAK;AAAA,UACL;AAAA,UACAD;AAAA,UACAA,KAAA,gBAAAA,EAAQ;AAAA,UACRC;AAAA,QACZ,GACUmF,EAAanF,CAAI;AAAA,MACnB;AAAA,IAEJ,CAAC;AAAA,EACL,GACEkB,EAAM,MAAK,EAAG,QAAQ,SAASjB,GAAG;AAChC,UAAME,IAAOe,EAAM,KAAKjB,CAAC;AACzB,IAAAY,EAAI,KAAK,UAAUZ,EAAE,IAAI,SAASA,EAAE,IAAI,OAAO,KAAK,UAAUE,CAAI,GAAGA,CAAI,GACzEA,EAAK,OAAO,QAAQ,CAACqF,MAAUA,EAAM,KAAKP,IAA2B,CAAC;AACtE,UAAMQ,IAAYvE,EAAM,KAAKjB,EAAE,CAAC;AAChC,QAAIyF,IAAUxE,EAAM,KAAKjB,EAAE,CAAC;AAC5B,UAAM0F,IAAQC,EAAWxB,GAAWjE,GAAMC,GAAW0D,GAAa2B,GAAWC,GAAShF,CAAE;AACxF,IAAAmF,EAAkB1F,GAAMwF,CAAK;AAAA,EAC/B,CAAC,GACDzE,EAAM,MAAK,EAAG,QAAQ,SAASrB,GAAG;AAChC,UAAMiG,IAAI5E,EAAM,KAAKrB,CAAC;AACtB,IAAAgB,EAAI,KAAKhB,GAAGiG,EAAE,MAAMA,EAAE,IAAI,GACtBA,EAAE,YACJd,IAAOc,EAAE;AAAA,EAEb,CAAC,GACDjF,EAAI,KAAK,uCAAuCqD,GAAMc,CAAI,GACnD,EAAE,MAAAd,GAAM,MAAAc,EAAI;AACrB,GAAG,iBAAiB,GAChBe,KAAyB,gBAAAvF,EAAO,OAAOwF,GAAaC,MAAQ;;AAC9D,QAAM/E,IAAQ,IAAIgF,EAAgB;AAAA,IAChC,YAAY;AAAA,IACZ,UAAU;AAAA,EACd,CAAG,EAAE,SAAS;AAAA,IACV,SAASF,EAAY;AAAA,IACrB,WAAS3C,IAAA2C,EAAY,WAAZ,gBAAA3C,EAAoB,kBAAe8C,KAAA/C,IAAA4C,EAAY,WAAZ,gBAAA5C,EAAoB,cAApB,gBAAA+C,EAA+B,gBAAeH,EAAY;AAAA,IACtG,WAASI,IAAAJ,EAAY,WAAZ,gBAAAI,EAAoB,kBAAeC,KAAAC,IAAAN,EAAY,WAAZ,gBAAAM,EAAoB,cAApB,gBAAAD,EAA+B,gBAAeL,EAAY;AAAA,IACtG,SAAS;AAAA,IACT,SAAS;AAAA,EACb,CAAG,EAAE,oBAAoB,WAAW;AAChC,WAAO,CAAA;AAAA,EACT,CAAC,GACKO,IAAUN,EAAI,OAAO,GAAG;AAC9B,EAAAO,EAAgBD,GAASP,EAAY,SAASA,EAAY,MAAMA,EAAY,SAAS,GACrFS,EAAM,GACNC,EAAM,GACNC,EAAK,GACLpG,GAAM,GACNyF,EAAY,MAAM,QAAQ,CAAChG,MAAS;AAClC,IAAAkB,EAAM,QAAQlB,EAAK,IAAI,EAAE,GAAGA,EAAI,CAAE,GAC9BA,EAAK,YACPkB,EAAM,UAAUlB,EAAK,IAAIA,EAAK,QAAQ;AAAA,EAE1C,CAAC,GACDa,EAAI,MAAM,UAAUmF,EAAY,KAAK,GACrCA,EAAY,MAAM,QAAQ,CAAC7F,MAAS;AAClC,QAAIA,EAAK,UAAUA,EAAK,KAAK;AAC3B,YAAMyG,IAASzG,EAAK,OACd0G,IAAaD,IAAS,QAAQA,IAAS,QACvCE,IAAaF,IAAS,QAAQA,IAAS,QACvC5G,IAAOkB,EAAM,KAAK0F,CAAM;AAC9B,MAAA1F,EAAM,QAAQ2F,GAAY;AAAA,QACxB,OAAOA;AAAA,QACP,IAAIA;AAAA,QACJ,UAAU7G,EAAK;AAAA,QACf,YAAY;AAAA,QACZ,OAAO;AAAA,QACP,SAAS;AAAA,QACT,OAAO;AAAA;AAAA,QAEP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,QAAQ;AAAA,MAChB,CAAO,GACDkB,EAAM,UAAU2F,GAAY7G,EAAK,QAAQ,GACzCkB,EAAM,QAAQ4F,GAAY;AAAA,QACxB,OAAOA;AAAA,QACP,IAAIA;AAAA,QACJ,UAAU9G,EAAK;AAAA,QACf,YAAY;AAAA,QACZ,SAAS;AAAA;AAAA,QAET,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,QAAQ;AAAA,MAChB,CAAO,GACDkB,EAAM,UAAU4F,GAAY9G,EAAK,QAAQ;AACzC,YAAM+G,IAAQ,gBAAgB5G,CAAI,GAC5B6G,IAAU,gBAAgB7G,CAAI,GAC9B8G,IAAQ,gBAAgB9G,CAAI;AAClC,MAAA4G,EAAM,QAAQ,IACdA,EAAM,eAAe,QACrBA,EAAM,KAAKH,IAAS,qBACpBI,EAAQ,iBAAiB,QACzBA,EAAQ,eAAe,QACvBA,EAAQ,KAAKJ,IAAS,uBACtBK,EAAM,QAAQ,IACVjH,EAAK,YACP+G,EAAM,cAAcH,GACpBK,EAAM,YAAYL,IAEpBK,EAAM,KAAKL,IAAS,qBACpBK,EAAM,iBAAiB,QACvB/F,EAAM,QAAQ0F,GAAQC,GAAYE,GAAOH,IAAS,mBAAmB,GACrE1F,EAAM,QAAQ2F,GAAYC,GAAYE,GAASJ,IAAS,mBAAmB,GAC3E1F,EAAM,QAAQ4F,GAAYF,GAAQK,GAAOL,IAAS,oBAAoB;AAAA,IACxE;AACE,MAAA1F,EAAM,QAAQf,EAAK,OAAOA,EAAK,KAAK,EAAE,GAAGA,EAAI,GAAIA,EAAK,EAAE;AAAA,EAE5D,CAAC,GACDU,EAAI,KAAK,mBAAmB,KAAK,UAAUoD,EAAoB/C,CAAK,CAAC,CAAC,GACtEwB,GAAuBxB,CAAK,GAC5BL,EAAI,KAAK,oBAAoB,KAAK,UAAUoD,EAAoB/C,CAAK,CAAC,CAAC;AACvE,QAAM8C,IAAakD,EAAS;AAC5B,QAAMtD;AAAA,IACJ2C;AAAA,IACArF;AAAA,IACA8E,EAAY;AAAA,IACZA,EAAY;AAAA,IACZ;AAAA,IACAhC;AAAA,EACJ;AACA,GAAG,QAAQ;","x_google_ignoreList":[0,1]}