@floegence/floe-webapp-core 0.86.8 → 0.86.10

package/dist/components/graph/routing.js

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

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@floegence/floe-webapp-core",
-  "version": "0.86.8",
+  "version": "0.86.10",
   "license": "MIT",
   "type": "module",
   "main": "./dist/index.js",