@floegence/floe-webapp-core 0.86.7 → 0.86.10

package/dist/components/graph/routing.js

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

package/dist/components/graph/types.d.ts

@@ -52,8 +52,10 @@ export interface GraphLayoutOptions {
     positions?: readonly (GraphPoint & {
         nodeId: string;
     })[];
-    /** Fixed (default) rejects impossible geometry. Preferred retains clear positions and separates colliding siblings, resizing groups around their content before routing. */
-    positionMode?: 'fixed' | 'preferred';
+    /** Root-level ranks. Unassigned roots are placed deterministically near their closest ranked neighbors. */
+    layers?: readonly (readonly string[])[];
+    /** Fixed (default) rejects impossible geometry. Preferred retains positions; compact uses them only as stable ordering hints. */
+    positionMode?: 'fixed' | 'preferred' | 'compact';
     direction?: 'RIGHT' | 'DOWN' | 'LEFT' | 'UP';
     spacing?: number;
     groupPadding?: {