@floegence/floe-webapp-core 0.86.13 → 0.86.14

package/dist/components/graph/routing.js

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

package/package.json

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