hexagon-editor 0.1.4 → 0.1.6

package/dist/dagre-VZM6K2ZE-0VsGm8Ag.js

@@ -1,340 +0,0 @@
-import { c as O, w as I, a as J, f as P, b as E, s as A } from "./chunk-RYQCIY6F-DmJAYxq8.js";
-import { _ as w, am as v, an as D, ao as H, ap as Y, l, c as _, aq as W, ar as $, ae as j, as as q, af as R, ad as F, at as z, au as K, av as G } from "./mermaid.core-CR0bA2Wa.js";
-import { G as Q } from "./graph-DAHC4kPm.js";
-import { l as U } from "./layout-DBbo_M5I.js";
-var C = /* @__PURE__ */ w((s, t, g) => Math.max(t, Math.min(g, s)), "clamp"), B = /* @__PURE__ */ w((s = "TB") => {
-  switch (s) {
-    case "BT":
-      return "bottom";
-    case "LR":
-      return "right";
-    case "RL":
-      return "left";
-    default:
-      return "top";
-  }
-}, "getDefaultSelfLoopSide"), V = /* @__PURE__ */ w((s) => s === "flowchart" || s === "flowchart-v2" || s === "stateDiagram", "shouldMergeSelfLoopSegments"), Z = /* @__PURE__ */ w((s, t, g, y, c) => {
-  const o = [], r = /* @__PURE__ */ new Set();
-  if (g.forEach(({ start: i, end: n }) => {
-    i !== y && r.add(i), n !== y && r.add(n);
-  }), r.forEach((i) => {
-    const n = s.node(i);
-    typeof n?.x == "number" && typeof n?.y == "number" && o.push(n);
-  }), o.length === 0 && g.forEach(({ edge: i }) => {
-    (i.points ?? []).forEach((n) => {
-      typeof n?.x == "number" && typeof n?.y == "number" && o.push(n);
-    });
-  }), o.length === 0)
-    return B(c);
-  const f = o.reduce(
-    (i, n) => ({
-      x: i.x + n.x / o.length,
-      y: i.y + n.y / o.length
-    }),
-    { x: 0, y: 0 }
-  ), h = f.x - t.x, a = f.y - t.y;
-  return Math.abs(h) > Math.abs(a) ? h > 0 ? "right" : "left" : Math.abs(a) > 0 ? a > 0 ? "bottom" : "top" : B(c);
-}, "getSelfLoopSide"), ee = /* @__PURE__ */ w((s, t = "top", g = 0, y = 0) => {
-  const c = s.x, o = s.y - g, r = s.width / 2, f = s.height / 2, h = Math.max(36, Math.min(100, s.width * 0.8)), a = C(Math.max(y, s.width * 0.35), 36, h), i = C(Math.min(s.width, s.height) * 0.45, 24, 48);
-  switch (t) {
-    case "bottom": {
-      const n = o + f;
-      return [
-        { x: c - a / 2, y: n },
-        { x: c - a / 2, y: n + i },
-        { x: c + a / 2, y: n + i },
-        { x: c + a / 2, y: n }
-      ];
-    }
-    case "right": {
-      const n = c + r;
-      return [
-        { x: n, y: o - a / 2 },
-        { x: n + i, y: o - a / 2 },
-        { x: n + i, y: o + a / 2 },
-        { x: n, y: o + a / 2 }
-      ];
-    }
-    case "left": {
-      const n = c - r;
-      return [
-        { x: n, y: o - a / 2 },
-        { x: n - i, y: o - a / 2 },
-        { x: n - i, y: o + a / 2 },
-        { x: n, y: o + a / 2 }
-      ];
-    }
-    default: {
-      const n = o - f;
-      return [
-        { x: c - a / 2, y: n },
-        { x: c - a / 2, y: n - i },
-        { x: c + a / 2, y: n - i },
-        { x: c + a / 2, y: n }
-      ];
-    }
-  }
-}, "getSelfLoopPoints"), te = /* @__PURE__ */ w((s, t, g = "top", y = 0, c = {}) => {
-  const r = s.x, f = s.y - y, h = c.width ?? 0, a = c.height ?? 0;
-  switch (g) {
-    case "bottom":
-      return { x: r, y: Math.max(...t.map((i) => i.y)) + a / 2 + 4 };
-    case "right":
-      return { x: Math.max(...t.map((i) => i.x)) + h / 2 + 4, y: f };
-    case "left":
-      return { x: Math.min(...t.map((i) => i.x)) - h / 2 - 4, y: f };
-    default:
-      return { x: r, y: Math.min(...t.map((i) => i.y)) - a / 2 - 4 };
-  }
-}, "getSelfLoopLabelPosition"), ne = /* @__PURE__ */ w((s, t = 0, { mergeSelfLoops: g = !0 } = {}) => {
-  const y = /* @__PURE__ */ new Map(), c = [], o = s.graph()?.rankdir;
-  return s.edges().forEach((r) => {
-    const f = s.edge(r);
-    if (g && f.selfLoop) {
-      const h = f.selfLoop.id;
-      y.has(h) || y.set(h, []), y.get(h).push({ edge: f, start: r.v, end: r.w });
-    } else
-      c.push({ edge: f, start: r.v, end: r.w });
-  }), y.forEach((r) => {
-    if (r.length !== 3) {
-      r.forEach((L) => c.push(L));
-      return;
-    }
-    r.sort((L, d) => L.edge.selfLoop.order - d.edge.selfLoop.order);
-    const [f, h, a] = r, i = f.edge.originalEdge ?? h.edge.originalEdge ?? a.edge.originalEdge ?? h.edge, n = s.node(i.start);
-    if (!n) {
-      r.forEach((L) => c.push(L));
-      return;
-    }
-    const p = {
-      width: h.edge.width,
-      height: h.edge.height
-    }, m = Z(s, n, r, i.start, o), X = ee(n, m, t, p.width ?? 0), S = te(n, X, m, t, p), b = {
-      ...h.edge,
-      ...i,
-      id: i.id,
-      points: X,
-      start: i.start,
-      end: i.end,
-      x: S.x,
-      y: S.y,
-      width: p.width,
-      height: p.height,
-      labelStyle: h.edge.labelStyle,
-      fromCluster: f.edge.fromCluster ?? h.edge.fromCluster ?? a.edge.fromCluster,
-      toCluster: f.edge.toCluster ?? h.edge.toCluster ?? a.edge.toCluster
-    };
-    delete b.selfLoop, delete b.originalEdge, c.push({ edge: b, start: b.start, end: b.end });
-  }), c;
-}, "getEdgesToRender"), T = /* @__PURE__ */ w(async (s, t, g, y, c, o) => {
-  l.warn("Graph in recursive render:XAX", I(t), c);
-  const r = t.graph().rankdir;
-  l.trace("Dir in recursive render - dir:", r);
-  const f = s.insert("g").attr("class", "root");
-  t.nodes() ? l.info("Recursive render XXX", t.nodes()) : l.info("No nodes found for", t), t.edges().length > 0 && l.info("Recursive edges", t.edge(t.edges()[0]));
-  const h = f.insert("g").attr("class", "clusters"), a = f.insert("g").attr("class", "edgePaths"), i = f.insert("g").attr("class", "edgeLabels"), n = f.insert("g").attr("class", "nodes"), p = V(g);
-  await Promise.all(
-    t.nodes().map(async function(d) {
-      const e = t.node(d);
-      if (c !== void 0) {
-        const u = JSON.parse(JSON.stringify(c.clusterData));
-        l.trace(
-          `Setting data for parent cluster XXX
- Node.id = `,
-          d,
-          `
- data=`,
-          u.height,
-          `
-Parent cluster`,
-          c.height
-        ), t.setNode(c.id, u), t.parent(d) || (l.trace("Setting parent", d, c.id), t.setParent(d, c.id, u));
-      }
-      if (l.info("(Insert) Node XXX" + d + ": " + JSON.stringify(t.node(d))), e?.clusterNode) {
-        l.info("Cluster identified XBX", d, e.width, t.node(d));
-        const { ranksep: u, nodesep: x } = t.graph();
-        e.graph.setGraph({
-          ...e.graph.graph(),
-          ranksep: u + 25,
-          nodesep: x
-        });
-        const N = await T(
-          n,
-          e.graph,
-          g,
-          y,
-          t.node(d),
-          o
-        ), M = N.elem;
-        W(e, M), e.diff = N.diff || 0, l.info(
-          "New compound node after recursive render XAX",
-          d,
-          "width",
-          // node,
-          e.width,
-          "height",
-          e.height
-          // node.x,
-          // node.y
-        ), $(M, e);
-      } else
-        t.children(d).length > 0 ? (l.trace(
-          "Cluster - the non recursive path XBX",
-          d,
-          e.id,
-          e,
-          e.width,
-          "Graph:",
-          t
-        ), l.trace(P(e.id, t)), E.set(e.id, { id: P(e.id, t), node: e })) : (l.trace("Node - the non recursive path XAX", d, n, t.node(d), r), await j(n, t.node(d), { config: o, dir: r }));
-    })
-  ), await (/* @__PURE__ */ w(async () => {
-    const d = t.edges().map(async function(e) {
-      const u = t.edge(e.v, e.w, e.name);
-      if (l.info("Edge " + e.v + " -> " + e.w + ": " + JSON.stringify(e)), l.info("Edge " + e.v + " -> " + e.w + ": ", e, " ", JSON.stringify(t.edge(e))), l.info(
-        "Fix",
-        E,
-        "ids:",
-        e.v,
-        e.w,
-        "Translating: ",
-        E.get(e.v),
-        E.get(e.w)
-      ), p && u.selfLoop) {
-        if (u.selfLoop.order !== 1)
-          return;
-        const x = u.id;
-        u.id = u.selfLoop.id, await G(i, u), u.id = x;
-        return;
-      }
-      await G(i, u);
-    });
-    await Promise.all(d);
-  }, "processEdges"))(), l.info("Graph before layout:", JSON.stringify(I(t))), l.info("############################################# XXX"), l.info("###                Layout                 ### XXX"), l.info("############################################# XXX"), U(t), l.info("Graph after layout:", JSON.stringify(I(t)));
-  let X = 0, { subGraphTitleTotalMargin: S } = q(o);
-  await Promise.all(
-    A(t).map(async function(d) {
-      const e = t.node(d);
-      if (l.info(
-        "Position XBX => " + d + ": (" + e.x,
-        "," + e.y,
-        ") width: ",
-        e.width,
-        " height: ",
-        e.height
-      ), e?.clusterNode)
-        e.y += S, l.info(
-          "A tainted cluster node XBX1",
-          d,
-          e.id,
-          e.width,
-          e.height,
-          e.x,
-          e.y,
-          t.parent(d)
-        ), E.get(e.id).node = e, R(e);
-      else if (t.children(d).length > 0) {
-        l.info(
-          "A pure cluster node XBX1",
-          d,
-          e.id,
-          e.x,
-          e.y,
-          e.width,
-          e.height,
-          t.parent(d)
-        ), e.height += S, t.node(e.parentId);
-        const u = e?.padding / 2 || 0, x = e?.labelBBox?.height || 0, N = x - u || 0;
-        l.debug("OffsetY", N, "labelHeight", x, "halfPadding", u), await F(h, e), E.get(e.id).node = e;
-      } else {
-        const u = t.node(e.parentId);
-        e.y += S / 2, l.info(
-          "A regular node XBX1 - using the padding",
-          e.id,
-          "parent",
-          e.parentId,
-          e.width,
-          e.height,
-          e.x,
-          e.y,
-          "offsetY",
-          e.offsetY,
-          "parent",
-          u,
-          u?.offsetY,
-          e
-        ), R(e);
-      }
-    })
-  );
-  const b = S / 2;
-  return ne(t, b, { mergeSelfLoops: p }).forEach(function({ edge: d, start: e, end: u }) {
-    l.info("Edge " + e + " -> " + u + ": " + JSON.stringify(d), d), d.points.forEach((k) => k.y += b);
-    const x = t.node(e), N = t.node(u), M = z(a, d, E, g, x, N, y);
-    K(d, M);
-  }), t.nodes().forEach(function(d) {
-    const e = t.node(d);
-    l.info(d, e.type, e.diff), e.isGroup && (X = e.diff);
-  }), l.warn("Returning from recursive render XAX", f, X), { elem: f, diff: X };
-}, "recursiveRender"), de = /* @__PURE__ */ w(async (s, t) => {
-  const g = new Q({
-    multigraph: !0,
-    compound: !0
-  }).setGraph({
-    rankdir: s.direction,
-    nodesep: s.config?.nodeSpacing || s.config?.flowchart?.nodeSpacing || s.nodeSpacing,
-    ranksep: s.config?.rankSpacing || s.config?.flowchart?.rankSpacing || s.rankSpacing,
-    marginx: 8,
-    marginy: 8
-  }).setDefaultEdgeLabel(function() {
-    return {};
-  }), y = t.select("g");
-  v(y, s.markers, s.type, s.diagramId), D(), H(), Y(), O(), s.nodes.forEach((o) => {
-    g.setNode(o.id, { ...o }), o.parentId && g.setParent(o.id, o.parentId);
-  }), l.debug("Edges:", s.edges), s.edges.forEach((o) => {
-    if (o.start === o.end) {
-      const r = o.start, f = r + "---" + r + "---1", h = r + "---" + r + "---2", a = g.node(r);
-      g.setNode(f, {
-        domId: f,
-        id: f,
-        parentId: a.parentId,
-        labelStyle: "",
-        label: "",
-        padding: 0,
-        shape: "labelRect",
-        // shape: 'rect',
-        style: "",
-        width: 10,
-        height: 10
-      }), g.setParent(f, a.parentId), g.setNode(h, {
-        domId: h,
-        id: h,
-        parentId: a.parentId,
-        labelStyle: "",
-        padding: 0,
-        // shape: 'rect',
-        shape: "labelRect",
-        label: "",
-        style: "",
-        width: 10,
-        height: 10
-      }), g.setParent(h, a.parentId);
-      const i = structuredClone(o), n = structuredClone(o), p = structuredClone(o), m = structuredClone(o);
-      n.originalEdge = i, n.selfLoop = { id: i.id, order: 0 }, p.originalEdge = i, p.selfLoop = { id: i.id, order: 1 }, m.originalEdge = i, m.selfLoop = { id: i.id, order: 2 }, n.label = "", n.arrowTypeEnd = "none", n.endLabelLeft = "", n.endLabelRight = "", n.startLabelLeft = "", n.id = r + "-cyclic-special-1", p.startLabelRight = "", p.startLabelLeft = "", p.endLabelLeft = "", p.endLabelRight = "", p.arrowTypeStart = "none", p.arrowTypeEnd = "none", p.id = r + "-cyclic-special-mid", m.label = "", m.startLabelRight = "", m.startLabelLeft = "", m.arrowTypeStart = "none", a.isGroup && (n.fromCluster = r, m.toCluster = r), m.id = r + "-cyclic-special-2", m.arrowTypeStart = "none", g.setEdge(r, f, n, r + "-cyclic-special-0"), g.setEdge(f, h, p, r + "-cyclic-special-1"), g.setEdge(h, r, m, r + "-cyclic-special-2");
-    } else
-      g.setEdge(o.start, o.end, { ...o }, o.id);
-  }), l.warn("Graph at first:", JSON.stringify(I(g))), J(g), l.warn("Graph after XAX:", JSON.stringify(I(g)));
-  const c = _();
-  await T(
-    y,
-    g,
-    s.type,
-    s.diagramId,
-    void 0,
-    c
-  );
-}, "render");
-export {
-  ne as getEdgesToRender,
-  de as render
-};

package/dist/defaultLocale-BgPVtth8.js

@@ -1,171 +0,0 @@
-function J(n) {
-  return Math.abs(n = Math.round(n)) >= 1e21 ? n.toLocaleString("en").replace(/,/g, "") : n.toString(10);
-}
-function j(n, t) {
-  if (!isFinite(n) || n === 0) return null;
-  var e = (n = t ? n.toExponential(t - 1) : n.toExponential()).indexOf("e"), i = n.slice(0, e);
-  return [
-    i.length > 1 ? i[0] + i.slice(2) : i,
-    +n.slice(e + 1)
-  ];
-}
-function K(n) {
-  return n = j(Math.abs(n)), n ? n[1] : NaN;
-}
-function Q(n, t) {
-  return function(e, i) {
-    for (var o = e.length, a = [], c = 0, h = n[0], M = 0; o > 0 && h > 0 && (M + h + 1 > i && (h = Math.max(1, i - M)), a.push(e.substring(o -= h, o + h)), !((M += h + 1) > i)); )
-      h = n[c = (c + 1) % n.length];
-    return a.reverse().join(t);
-  };
-}
-function V(n) {
-  return function(t) {
-    return t.replace(/[0-9]/g, function(e) {
-      return n[+e];
-    });
-  };
-}
-var W = /^(?:(.)?([<>=^]))?([+\-( ])?([$#])?(0)?(\d+)?(,)?(\.\d+)?(~)?([a-z%])?$/i;
-function $(n) {
-  if (!(t = W.exec(n))) throw new Error("invalid format: " + n);
-  var t;
-  return new L({
-    fill: t[1],
-    align: t[2],
-    sign: t[3],
-    symbol: t[4],
-    zero: t[5],
-    width: t[6],
-    comma: t[7],
-    precision: t[8] && t[8].slice(1),
-    trim: t[9],
-    type: t[10]
-  });
-}
-$.prototype = L.prototype;
-function L(n) {
-  this.fill = n.fill === void 0 ? " " : n.fill + "", this.align = n.align === void 0 ? ">" : n.align + "", this.sign = n.sign === void 0 ? "-" : n.sign + "", this.symbol = n.symbol === void 0 ? "" : n.symbol + "", this.zero = !!n.zero, this.width = n.width === void 0 ? void 0 : +n.width, this.comma = !!n.comma, this.precision = n.precision === void 0 ? void 0 : +n.precision, this.trim = !!n.trim, this.type = n.type === void 0 ? "" : n.type + "";
-}
-L.prototype.toString = function() {
-  return this.fill + this.align + this.sign + this.symbol + (this.zero ? "0" : "") + (this.width === void 0 ? "" : Math.max(1, this.width | 0)) + (this.comma ? "," : "") + (this.precision === void 0 ? "" : "." + Math.max(0, this.precision | 0)) + (this.trim ? "~" : "") + this.type;
-};
-function _(n) {
-  n: for (var t = n.length, e = 1, i = -1, o; e < t; ++e)
-    switch (n[e]) {
-      case ".":
-        i = o = e;
-        break;
-      case "0":
-        i === 0 && (i = e), o = e;
-        break;
-      default:
-        if (!+n[e]) break n;
-        i > 0 && (i = 0);
-        break;
-    }
-  return i > 0 ? n.slice(0, i) + n.slice(o + 1) : n;
-}
-var N;
-function v(n, t) {
-  var e = j(n, t);
-  if (!e) return N = void 0, n.toPrecision(t);
-  var i = e[0], o = e[1], a = o - (N = Math.max(-8, Math.min(8, Math.floor(o / 3))) * 3) + 1, c = i.length;
-  return a === c ? i : a > c ? i + new Array(a - c + 1).join("0") : a > 0 ? i.slice(0, a) + "." + i.slice(a) : "0." + new Array(1 - a).join("0") + j(n, Math.max(0, t + a - 1))[0];
-}
-function X(n, t) {
-  var e = j(n, t);
-  if (!e) return n + "";
-  var i = e[0], o = e[1];
-  return o < 0 ? "0." + new Array(-o).join("0") + i : i.length > o + 1 ? i.slice(0, o + 1) + "." + i.slice(o + 1) : i + new Array(o - i.length + 2).join("0");
-}
-const O = {
-  "%": (n, t) => (n * 100).toFixed(t),
-  b: (n) => Math.round(n).toString(2),
-  c: (n) => n + "",
-  d: J,
-  e: (n, t) => n.toExponential(t),
-  f: (n, t) => n.toFixed(t),
-  g: (n, t) => n.toPrecision(t),
-  o: (n) => Math.round(n).toString(8),
-  p: (n, t) => X(n * 100, t),
-  r: X,
-  s: v,
-  X: (n) => Math.round(n).toString(16).toUpperCase(),
-  x: (n) => Math.round(n).toString(16)
-};
-function R(n) {
-  return n;
-}
-var U = Array.prototype.map, Y = ["y", "z", "a", "f", "p", "n", "µ", "m", "", "k", "M", "G", "T", "P", "E", "Z", "Y"];
-function nn(n) {
-  var t = n.grouping === void 0 || n.thousands === void 0 ? R : Q(U.call(n.grouping, Number), n.thousands + ""), e = n.currency === void 0 ? "" : n.currency[0] + "", i = n.currency === void 0 ? "" : n.currency[1] + "", o = n.decimal === void 0 ? "." : n.decimal + "", a = n.numerals === void 0 ? R : V(U.call(n.numerals, String)), c = n.percent === void 0 ? "%" : n.percent + "", h = n.minus === void 0 ? "−" : n.minus + "", M = n.nan === void 0 ? "NaN" : n.nan + "";
-  function T(f, g) {
-    f = $(f);
-    var b = f.fill, p = f.align, m = f.sign, w = f.symbol, S = f.zero, E = f.width, F = f.comma, y = f.precision, C = f.trim, d = f.type;
-    d === "n" ? (F = !0, d = "g") : O[d] || (y === void 0 && (y = 12), C = !0, d = "g"), (S || b === "0" && p === "=") && (S = !0, b = "0", p = "=");
-    var q = (g && g.prefix !== void 0 ? g.prefix : "") + (w === "$" ? e : w === "#" && /[boxX]/.test(d) ? "0" + d.toLowerCase() : ""), B = (w === "$" ? i : /[%p]/.test(d) ? c : "") + (g && g.suffix !== void 0 ? g.suffix : ""), D = O[d], H = /[defgprs%]/.test(d);
-    y = y === void 0 ? 6 : /[gprs]/.test(d) ? Math.max(1, Math.min(21, y)) : Math.max(0, Math.min(20, y));
-    function G(r) {
-      var l = q, u = B, x, I, k;
-      if (d === "c")
-        u = D(r) + u, r = "";
-      else {
-        r = +r;
-        var P = r < 0 || 1 / r < 0;
-        if (r = isNaN(r) ? M : D(Math.abs(r), y), C && (r = _(r)), P && +r == 0 && m !== "+" && (P = !1), l = (P ? m === "(" ? m : h : m === "-" || m === "(" ? "" : m) + l, u = (d === "s" && !isNaN(r) && N !== void 0 ? Y[8 + N / 3] : "") + u + (P && m === "(" ? ")" : ""), H) {
-          for (x = -1, I = r.length; ++x < I; )
-            if (k = r.charCodeAt(x), 48 > k || k > 57) {
-              u = (k === 46 ? o + r.slice(x + 1) : r.slice(x)) + u, r = r.slice(0, x);
-              break;
-            }
-        }
-      }
-      F && !S && (r = t(r, 1 / 0));
-      var z = l.length + r.length + u.length, s = z < E ? new Array(E - z + 1).join(b) : "";
-      switch (F && S && (r = t(s + r, s.length ? E - u.length : 1 / 0), s = ""), p) {
-        case "<":
-          r = l + r + u + s;
-          break;
-        case "=":
-          r = l + s + r + u;
-          break;
-        case "^":
-          r = s.slice(0, z = s.length >> 1) + l + r + u + s.slice(z);
-          break;
-        default:
-          r = s + l + r + u;
-          break;
-      }
-      return a(r);
-    }
-    return G.toString = function() {
-      return f + "";
-    }, G;
-  }
-  function Z(f, g) {
-    var b = Math.max(-8, Math.min(8, Math.floor(K(g) / 3))) * 3, p = Math.pow(10, -b), m = T((f = $(f), f.type = "f", f), { suffix: Y[8 + b / 3] });
-    return function(w) {
-      return m(p * w);
-    };
-  }
-  return {
-    format: T,
-    formatPrefix: Z
-  };
-}
-var A, tn, rn;
-en({
-  thousands: ",",
-  grouping: [3],
-  currency: ["$", ""]
-});
-function en(n) {
-  return A = nn(n), tn = A.format, rn = A.formatPrefix, A;
-}
-export {
-  rn as a,
-  tn as b,
-  K as e,
-  $ as f
-};