@floegence/floe-webapp-core 0.86.14 → 0.86.16

package/dist/components/graph/positions.js

@@ -1,76 +0,0 @@
-import { routeGraphGeometry as v } from "./routing.js";
-function C(l, x, G) {
-  if (!x.positions?.length || x.positionMode === "compact")
-    return x.edgeClearance === void 0 ? l : v(l, x);
-  const f = new Map(l.nodes.map((t) => [t.id, { ...t }])), M = /* @__PURE__ */ new Map();
-  for (const t of x.positions) {
-    if (!f.has(t.nodeId) || M.has(t.nodeId) || !Number.isFinite(t.x) || !Number.isFinite(t.y))
-      throw new Error(`Invalid graph position: ${t.nodeId}`);
-    M.set(t.nodeId, t);
-  }
-  const y = /* @__PURE__ */ new Map();
-  for (const t of f.values())
-    if (t.parentId) {
-      const c = y.get(t.parentId) ?? [];
-      c.push(t), y.set(t.parentId, c);
-    }
-  const m = x.groupPadding ?? { top: 64, left: 28, right: 28, bottom: 28 }, u = x.positionMode === "preferred", I = new Map(G.map((t) => [t.id, t])), b = (t, c, d) => {
-    const g = { x: t.x, y: t.y }, p = M.get(t.id);
-    t.x = p?.x ?? t.x + c, t.y = p?.y ?? t.y + d;
-    const i = y.get(t.id) ?? [];
-    for (const o of i) b(o, t.x - g.x, t.y - g.y);
-    if (!i.length || u) return;
-    const a = Math.min(...i.map((o) => o.x)) - m.left, h = Math.min(...i.map((o) => o.y)) - m.top;
-    if (p && (a < t.x || h < t.y))
-      throw new Error(`Pinned child lies outside group content: ${t.id}`);
-    const e = Math.max(
-      t.x + t.width,
-      ...i.map((o) => o.x + o.width + m.right)
-    ), n = Math.max(
-      t.y + t.height,
-      ...i.map((o) => o.y + o.height + m.bottom)
-    );
-    p || (t.x = Math.min(t.x, a), t.y = Math.min(t.y, h)), t.width = e - t.x, t.height = n - t.y;
-  };
-  for (const t of f.values()) t.parentId || b(t, 0, 0);
-  if (u) {
-    const t = Math.max(16, x.spacing ?? 64), c = (i, a, h) => {
-      i.x += a, i.y += h;
-      for (const e of y.get(i.id) ?? []) c(e, a, h);
-    }, d = (i) => {
-      const a = [];
-      for (const h of [...i].sort(
-        (e, n) => e.y - n.y || e.x - n.x || e.id.localeCompare(n.id)
-      )) {
-        const e = { x: h.x, y: h.y };
-        for (const r of [...a].sort((s, w) => s.x - w.x))
-          h.y < r.y + r.height + t && h.y + h.height + t > r.y && e.x < r.x + r.width + t && e.x + h.width + t > r.x && (e.x = r.x + r.width + t);
-        const n = { x: h.x, y: h.y };
-        for (const r of [...a].sort((s, w) => s.y - w.y))
-          h.x < r.x + r.width + t && h.x + h.width + t > r.x && n.y < r.y + r.height + t && n.y + h.height + t > r.y && (n.y = r.y + r.height + t);
-        const o = e.x - h.x < n.y - h.y ? e : n;
-        c(h, o.x - h.x, o.y - h.y), a.push(h);
-      }
-    }, g = (i) => {
-      const a = y.get(i.id) ?? [];
-      if (!a.length) return;
-      for (const s of a) g(s);
-      d(a);
-      const h = Math.max(12, m.left), e = Math.max(12, m.top), n = Math.max(12, m.right), o = Math.max(12, m.bottom), r = M.get(i.id);
-      i.x = Math.min(r?.x ?? 1 / 0, Math.min(...a.map((s) => s.x)) - h), i.y = Math.min(r?.y ?? 1 / 0, Math.min(...a.map((s) => s.y)) - e), i.width = Math.max(
-        I.get(i.id).width,
-        Math.max(...a.map((s) => s.x + s.width)) + n - i.x
-      ), i.height = Math.max(
-        I.get(i.id).height,
-        Math.max(...a.map((s) => s.y + s.height)) + o - i.y
-      );
-    }, p = [...f.values()].filter((i) => !i.parentId);
-    for (const i of p) g(i);
-    d(p);
-  }
-  return v({ ...l, nodes: [...f.values()] }, x);
-}
-export {
-  C as applyGraphPositions,
-  v as routeGraphGeometry
-};

package/dist/components/graph/routing.js

@@ -1,280 +0,0 @@
-import { AvoidLib as X } from "../../node_modules/.pnpm/libavoid-js@0.5.0-beta.5/node_modules/libavoid-js/dist/index.js";
-import I from "../../node_modules/.pnpm/libavoid-js@0.5.0-beta.5/node_modules/libavoid-js/dist/libavoid.wasm.js";
-let Y;
-const _ = { NORTH: 1, SOUTH: 2, WEST: 4, EAST: 8 }, v = ["NORTH", "EAST", "SOUTH", "WEST"], T = (i) => i.delete();
-async function st(i, o = {}) {
-  const a = o.edgeClearance ?? 4;
-  if (!Number.isFinite(a) || a < 0)
-    throw new Error("Graph edge clearance must be finite and nonnegative");
-  if (!i.nodes.length) return i;
-  if (!i.edges.length) return L(i);
-  await (Y ??= X.load(I).catch((r) => {
-    throw Y = void 0, r;
-  }));
-  const n = X.getInstance(), c = new Map(i.nodes.map((r) => [r.id, r])), l = (r) => {
-    const h = [];
-    for (let s = c.get(r).parentId; s; s = c.get(s).parentId)
-      h.push(s);
-    return h;
-  }, f = /* @__PURE__ */ new Map();
-  for (const r of i.edges) {
-    const h = /* @__PURE__ */ new Set([...l(r.source), ...l(r.target)]), s = JSON.stringify([...h].sort()), M = f.get(s) ?? { open: h, edges: [] };
-    M.edges.push(r), f.set(s, M);
-  }
-  const P = /* @__PURE__ */ new Map();
-  for (const { open: r, edges: h } of f.values()) {
-    const s = new n.Router(2);
-    try {
-      s.setRoutingParameter(n.RoutingParameter.shapeBufferDistance, a), s.setRoutingParameter(n.RoutingParameter.idealNudgingDistance, 8), s.setRoutingParameter(n.RoutingParameter.crossingPenalty, 80), s.setRoutingParameter(n.RoutingParameter.fixedSharedPathPenalty, 120), s.setRoutingParameter(n.RoutingParameter.portDirectionPenalty, 0), s.setRoutingOption(
-        n.RoutingOption.nudgeOrthogonalSegmentsConnectedToShapes,
-        !h.some((t) => t.sourcePort || t.targetPort || t.source === t.target)
-      ), s.setRoutingOption(n.RoutingOption.nudgeSharedPathsWithCommonEndPoint, !0);
-      const M = new Map(
-        i.nodes.filter((t) => !r.has(t.id) && l(t.id).every((e) => r.has(e))).map((t) => {
-          const e = new n.Point(t.x, t.y), g = new n.Point(t.x + t.width, t.y + t.height), p = new n.Rectangle(e, g), x = new n.ShapeRef(s, p);
-          return T(e), T(g), T(p), [t.id, x];
-        })
-      ), O = /* @__PURE__ */ new Map(), C = /* @__PURE__ */ new Map();
-      for (const t of h) {
-        const e = [t.source, t.target].sort().join("\0"), g = O.get(e) ?? 0;
-        O.set(e, g + 1), C.set(t.id, g % 2 === 0 ? -6 : 6);
-      }
-      let K = v.length + 2;
-      const W = /* @__PURE__ */ new Map(), b = (t, e) => Math.max(0, Math.min(1, t / e));
-      for (const t of i.nodes) {
-        const e = M.get(t.id);
-        if (!e) continue;
-        const g = (p, x, w, y, u) => {
-          const N = new n.ShapeConnectionPin(
-            e,
-            p,
-            b(x, t.width),
-            b(w, t.height),
-            !0,
-            0,
-            y
-          );
-          N.setExclusive(u), N.setConnectionCost(
-            t.width / 2 + t.height / 2 - Math.abs(x - t.width / 2) - Math.abs(w - t.height / 2)
-          );
-        };
-        for (const p of new Set(t.ports?.map((x) => x.side))) {
-          const { x, y: w } = $(t, p), y = v.indexOf(p) + 2;
-          g(y, x - t.x, w - t.y, _[p], !1), W.set(
-            JSON.stringify([
-              t.id,
-              b(x - t.x, t.width),
-              b(w - t.y, t.height),
-              p
-            ]),
-            y
-          );
-        }
-      }
-      const Q = i.nodes.filter((t) => M.has(t.id)), F = (t, e, g, p, x, w = !1) => {
-        const y = M.get(t.id);
-        if (y && g)
-          return new n.ConnEnd(
-            y,
-            v.indexOf(t.ports.find((d) => d.id === g).side) + 2
-          );
-        const u = g ? [
-          {
-            side: t.ports.find((d) => d.id === g).side,
-            position: $(t, t.ports.find((d) => d.id === g).side)
-          }
-        ] : x ? [{ side: "EAST", position: x }] : (w ? [q(t, e).source] : v).flatMap((d) => {
-          const H = tt(t, d, e, p);
-          if (w) return [{ side: d, position: H }];
-          const R = d === "NORTH" || d === "SOUTH", A = R ? t.x : t.y, S = R ? t.width : t.height, E = A + Math.min(8, S / 4), B = A + S - Math.min(8, S / 4);
-          return [
-            R ? H.x : H.y,
-            E,
-            B,
-            ...Q.flatMap((m) => {
-              const k = R ? m.x : m.y, V = k + (R ? m.width : m.height);
-              return [k - a, V + a, k - a - 8, V + a + 8];
-            }).filter((m) => m >= E && m <= B)
-          ].map((m) => ({
-            side: d,
-            position: R ? { x: m, y: H.y } : { x: H.x, y: m }
-          }));
-        });
-        if (y) {
-          const d = (S, E) => JSON.stringify([
-            t.id,
-            b(E.x - t.x, t.width),
-            b(E.y - t.y, t.height),
-            S
-          ]), R = !!(g || x || w) || u.every(
-            (S) => W.has(d(S.side, S.position))
-          ) ? W.get(d(u[0].side, u[0].position)) : void 0;
-          if (R !== void 0) return new n.ConnEnd(y, R);
-          const A = R ?? K++;
-          for (const { side: S, position: E } of u) {
-            const B = d(S, E);
-            if (W.has(B)) continue;
-            W.set(B, A);
-            const D = E.x - t.x, m = E.y - t.y, k = new n.ShapeConnectionPin(
-              y,
-              A,
-              b(D, t.width),
-              b(m, t.height),
-              !0,
-              0,
-              _[S]
-            );
-            k.setExclusive(!1), k.setConnectionCost(
-              t.width / 2 + t.height / 2 - Math.abs(D - t.width / 2) - Math.abs(m - t.height / 2)
-            );
-          }
-          return new n.ConnEnd(y, A);
-        }
-        const N = q(t, e).source, G = u.find((d) => d.side === N)?.position ?? u[0].position, j = new n.Point(G.x, G.y), z = new n.ConnEnd(j);
-        return T(j), z;
-      }, J = (t) => +!!(t.sourcePort || t.targetPort || t.source === t.target || O.get([t.source, t.target].sort().join("\0")) > 1), Z = [...h].sort((t, e) => J(e) - J(t)).map((t) => {
-        const e = c.get(t.source), g = c.get(t.target), p = t.source === t.target, x = O.get([t.source, t.target].sort().join("\0")) > 1, w = F(
-          e,
-          g,
-          t.sourcePort,
-          C.get(t.id),
-          p ? { x: e.x + e.width, y: e.y + e.height / 3 } : void 0,
-          x
-        ), y = F(
-          g,
-          e,
-          t.targetPort,
-          C.get(t.id),
-          p ? {
-            x: g.x + g.width,
-            y: g.y + g.height * 2 / 3
-          } : void 0,
-          x
-        ), u = new n.ConnRef(s, w, y);
-        if (T(w), T(y), p) {
-          const N = new n.CheckpointVector();
-          for (const G of [
-            e.y + e.height / 3,
-            e.y + e.height * 2 / 3
-          ]) {
-            const j = new n.Point(
-              e.x + e.width + Math.max(24, a + 4),
-              G
-            ), z = new n.Checkpoint(j);
-            N.push_back(z), T(j), T(z);
-          }
-          u.setRoutingCheckpoints(N), T(N);
-        }
-        return { edge: t, connection: u };
-      });
-      s.processTransaction();
-      for (const { edge: t, connection: e } of Z) {
-        const g = e.displayRoute(), p = Array.from({ length: g.size() }, (x, w) => {
-          const y = g.at(w), u = { x: y.x, y: y.y };
-          return T(y), u;
-        });
-        if (T(g), !e.hasValidRoute() || p.length < 2 || p.some((x) => !Number.isFinite(x.x) || !Number.isFinite(x.y)) || p.some((x, w) => w > 0 && x.x !== p[w - 1].x && x.y !== p[w - 1].y))
-          throw new Error(`Graph edge cannot be routed: ${t.id}`);
-        P.set(t.id, p);
-      }
-    } finally {
-      s.delete();
-    }
-  }
-  const U = i.edges.map((r) => ({ ...r, sections: [P.get(r.id)] }));
-  return L({
-    nodes: i.nodes,
-    edges: U,
-    bounds: i.bounds
-  });
-}
-function L(i) {
-  const o = [
-    ...i.nodes.flatMap((c) => [
-      { x: c.x, y: c.y },
-      { x: c.x + c.width, y: c.y + c.height }
-    ]),
-    ...i.edges.flatMap((c) => c.sections.flat())
-  ], a = Math.min(...o.map((c) => c.x)), n = Math.min(...o.map((c) => c.y));
-  return {
-    nodes: i.nodes,
-    edges: i.edges,
-    bounds: {
-      x: a,
-      y: n,
-      width: Math.max(...o.map((c) => c.x)) - a,
-      height: Math.max(...o.map((c) => c.y)) - n
-    }
-  };
-}
-function $(i, o) {
-  return {
-    x: o === "WEST" ? i.x : o === "EAST" ? i.x + i.width : i.x + i.width / 2,
-    y: o === "NORTH" ? i.y : o === "SOUTH" ? i.y + i.height : i.y + i.height / 2
-  };
-}
-function q(i, o) {
-  const a = (h, s) => s.x >= h.x && s.y >= h.y && s.x + s.width <= h.x + h.width && s.y + s.height <= h.y + h.height, n = a(i, o) ? i : a(o, i) ? o : void 0;
-  if (n) {
-    const h = n === i ? o : i, s = {
-      NORTH: h.y - n.y,
-      EAST: n.x + n.width - h.x - h.width,
-      SOUTH: n.y + n.height - h.y - h.height,
-      WEST: h.x - n.x
-    }, M = [...v].sort((O, C) => s[O] - s[C])[0];
-    return { source: M, target: M };
-  }
-  const c = o.x + o.width / 2 - (i.x + i.width / 2), l = o.y + o.height / 2 - (i.y + i.height / 2), f = Math.max(i.x - (o.x + o.width), o.x - (i.x + i.width), 0), P = Math.max(
-    i.y - (o.y + o.height),
-    o.y - (i.y + i.height),
-    0
-  ), r = (P === 0 && f > 0 ? !0 : f === 0 && P > 0 ? !1 : f === 0 && P === 0 ? Math.abs(c) >= Math.abs(l) : f <= P) ? c >= 0 ? "EAST" : "WEST" : l >= 0 ? "SOUTH" : "NORTH";
-  return { source: r, target: v[(v.indexOf(r) + 2) % 4] };
-}
-function tt(i, o, a, n = 0) {
-  const c = (r) => Math.min(8, r / 4), l = (r, h, s) => Math.max(h + c(s), Math.min(h + s - c(s), r)), f = (r, h, s, M) => {
-    const O = Math.max(r, s), C = Math.min(r + h, s + M);
-    return O < C ? (O + C) / 2 + n : void 0;
-  }, P = a.x + a.width / 2, U = a.y + a.height / 2;
-  switch (o) {
-    case "NORTH":
-      return {
-        x: l(
-          f(i.x, i.width, a.x, a.width) ?? P + n,
-          i.x,
-          i.width
-        ),
-        y: i.y
-      };
-    case "EAST":
-      return {
-        x: i.x + i.width,
-        y: l(
-          f(i.y, i.height, a.y, a.height) ?? U + n,
-          i.y,
-          i.height
-        )
-      };
-    case "SOUTH":
-      return {
-        x: l(
-          f(i.x, i.width, a.x, a.width) ?? P + n,
-          i.x,
-          i.width
-        ),
-        y: i.y + i.height
-      };
-    case "WEST":
-      return {
-        x: i.x,
-        y: l(
-          f(i.y, i.height, a.y, a.height) ?? U + n,
-          i.y,
-          i.height
-        )
-      };
-  }
-}
-export {
-  st as routeGraphGeometry
-};

package/dist/node_modules/.pnpm/elkjs@0.12.0/node_modules/elkjs/lib/elk-api.js

@@ -1,186 +0,0 @@
-import { commonjsRequire as k } from "../../../../../../_virtual/_commonjs-dynamic-modules.js";
-import { __module as _ } from "../../../../../../_virtual/elk-api2.js";
-var E;
-function S() {
-  return E ? _.exports : (E = 1, (function(O, L) {
-    (function(p) {
-      O.exports = p();
-    })(function() {
-      return (/* @__PURE__ */ (function() {
-        function p(l, u, i) {
-          function y(a, w) {
-            if (!u[a]) {
-              if (!l[a]) {
-                var g = typeof k == "function" && k;
-                if (!w && g) return g(a, !0);
-                if (v) return v(a, !0);
-                var o = new Error("Cannot find module '" + a + "'");
-                throw o.code = "MODULE_NOT_FOUND", o;
-              }
-              var e = u[a] = { exports: {} };
-              l[a][0].call(e.exports, function(r) {
-                var t = l[a][1][r];
-                return y(t || r);
-              }, e, e.exports, p, l, u, i);
-            }
-            return u[a].exports;
-          }
-          for (var v = typeof k == "function" && k, d = 0; d < i.length; d++) y(i[d]);
-          return y;
-        }
-        return p;
-      })())({ 1: [function(p, l, u) {
-        Object.defineProperty(u, "__esModule", {
-          value: !0
-        }), u.default = void 0;
-        function i(o) {
-          "@babel/helpers - typeof";
-          return i = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(e) {
-            return typeof e;
-          } : function(e) {
-            return e && typeof Symbol == "function" && e.constructor === Symbol && e !== Symbol.prototype ? "symbol" : typeof e;
-          }, i(o);
-        }
-        function y(o, e) {
-          if (!(o instanceof e)) throw new TypeError("Cannot call a class as a function");
-        }
-        function v(o, e) {
-          for (var r = 0; r < e.length; r++) {
-            var t = e[r];
-            t.enumerable = t.enumerable || !1, t.configurable = !0, "value" in t && (t.writable = !0), Object.defineProperty(o, a(t.key), t);
-          }
-        }
-        function d(o, e, r) {
-          return e && v(o.prototype, e), Object.defineProperty(o, "prototype", { writable: !1 }), o;
-        }
-        function a(o) {
-          var e = w(o, "string");
-          return i(e) == "symbol" ? e : e + "";
-        }
-        function w(o, e) {
-          if (i(o) != "object" || !o) return o;
-          var r = o[Symbol.toPrimitive];
-          if (r !== void 0) {
-            var t = r.call(o, e);
-            if (i(t) != "object") return t;
-            throw new TypeError("@@toPrimitive must return a primitive value.");
-          }
-          return String(o);
-        }
-        u.default = /* @__PURE__ */ (function() {
-          function o() {
-            var e = this, r = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : {}, t = r.defaultLayoutOptions, n = t === void 0 ? {} : t, s = r.algorithms, m = s === void 0 ? ["layered", "stress", "mrtree", "radial", "force", "disco", "sporeOverlap", "sporeCompaction", "rectpacking"] : s, f = r.workerFactory, c = r.workerUrl;
-            if (y(this, o), this.defaultLayoutOptions = n, this.initialized = !1, typeof c > "u" && typeof f > "u")
-              throw new Error("Cannot construct an ELK without both 'workerUrl' and 'workerFactory'.");
-            var h = f;
-            typeof c < "u" && typeof f > "u" && (h = function(j) {
-              return new Worker(j);
-            });
-            var b = h(c);
-            if (typeof b.postMessage != "function")
-              throw new TypeError("Created worker does not provide the required 'postMessage' function.");
-            this.worker = new g(b), this.worker.postMessage({
-              cmd: "register",
-              algorithms: m
-            }).then(function(x) {
-              return e.initialized = !0;
-            }).catch(console.err);
-          }
-          return d(o, [{
-            key: "layout",
-            value: function(r) {
-              var t = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, n = t.layoutOptions, s = n === void 0 ? this.defaultLayoutOptions : n, m = t.logging, f = m === void 0 ? !1 : m, c = t.measureExecutionTime, h = c === void 0 ? !1 : c;
-              return r ? this.worker.postMessage({
-                cmd: "layout",
-                graph: r,
-                layoutOptions: s,
-                options: {
-                  logging: f,
-                  measureExecutionTime: h
-                }
-              }) : Promise.reject(new Error("Missing mandatory parameter 'graph'."));
-            }
-          }, {
-            key: "knownLayoutAlgorithms",
-            value: function() {
-              return this.worker.postMessage({
-                cmd: "algorithms"
-              });
-            }
-          }, {
-            key: "knownLayoutOptions",
-            value: function() {
-              return this.worker.postMessage({
-                cmd: "options"
-              });
-            }
-          }, {
-            key: "knownLayoutCategories",
-            value: function() {
-              return this.worker.postMessage({
-                cmd: "categories"
-              });
-            }
-          }, {
-            key: "terminateWorker",
-            value: function() {
-              this.worker && this.worker.terminate();
-            }
-          }]);
-        })();
-        var g = /* @__PURE__ */ (function() {
-          function o(e) {
-            var r = this;
-            if (y(this, o), e === void 0)
-              throw new Error("Missing mandatory parameter 'worker'.");
-            this.resolvers = {}, this.worker = e, this.worker.onmessage = function(t) {
-              setTimeout(function() {
-                r.receive(r, t);
-              }, 0);
-            };
-          }
-          return d(o, [{
-            key: "postMessage",
-            value: function(r) {
-              var t = this.id || 0;
-              this.id = t + 1, r.id = t;
-              var n = this;
-              return new Promise(function(s, m) {
-                n.resolvers[t] = function(f, c) {
-                  f ? (n.convertGwtStyleError(f), m(f)) : s(c);
-                }, n.worker.postMessage(r);
-              });
-            }
-          }, {
-            key: "receive",
-            value: function(r, t) {
-              var n = t.data, s = r.resolvers[n.id];
-              s && (delete r.resolvers[n.id], n.error ? s(n.error) : s(null, n.data));
-            }
-          }, {
-            key: "terminate",
-            value: function() {
-              this.worker && this.worker.terminate();
-            }
-          }, {
-            key: "convertGwtStyleError",
-            value: function(r) {
-              if (r) {
-                var t = r.__java$exception;
-                t && (t.cause && t.cause.backingJsObject && (r.cause = t.cause.backingJsObject, this.convertGwtStyleError(r.cause)), delete r.__java$exception);
-              }
-            }
-          }]);
-        })();
-      }, {}], 2: [function(p, l, u) {
-        var i = p("./elk-api.js").default;
-        Object.defineProperty(l.exports, "__esModule", {
-          value: !0
-        }), l.exports = i, i.default = i;
-      }, { "./elk-api.js": 1 }] }, {}, [2])(2);
-    });
-  })(_), _.exports);
-}
-export {
-  S as __require
-};