@code0-tech/pictor 0.0.0-mvp.29 → 0.0.0-mvp.30

package/dist/components/d-flow/DFlow.js

@@ -1,133 +1,132 @@
-import { jsx as V, jsxs as U } from "react/jsx-runtime";
-import { c as $ } from "../../_virtual/compiler-runtime.js";
+import { jsx as z, jsxs as Q } from "react/jsx-runtime";
+import { c as Z } from "../../_virtual/compiler-runtime.js";
 import "../../utils/contextStore.js";
-import K from "react";
-import { mergeCode0Props as J } from "../../utils/utils.js";
-import { ReactFlowProvider as Q, useNodesState as Z, useEdgesState as tt, useUpdateNodeInternals as et, ReactFlow as ot, Background as st, BackgroundVariant as nt } from "@xyflow/react";
+import W from "react";
+import { mergeCode0Props as tt } from "../../utils/utils.js";
+import { ReactFlowProvider as et, useNodesState as ot, useEdgesState as st, useUpdateNodeInternals as nt, ReactFlow as it, Background as rt, BackgroundVariant as at } from "@xyflow/react";
 import '../../assets/components/d-flow-panel/DFlowMiniMap.style.css';import '../../assets/components/d-flow/DFlow.style.css';import '../../assets/node_modules/@xyflow/react/dist/style.css';/* empty css                                              */
 /* empty css                 */
-import { DFlowFunctionDefaultCard as it } from "../d-flow-function/DFlowFunctionDefaultCard.js";
-import { DFlowFunctionGroupCard as rt } from "../d-flow-function/DFlowFunctionGroupCard.js";
-import { DFlowFunctionSuggestionCard as at } from "../d-flow-function/DFlowFunctionSuggestionCard.js";
-import { DFlowFunctionTriggerCard as dt } from "../d-flow-function/DFlowFunctionTriggerCard.js";
-import { DFlowEdge as ct } from "./DFlowEdge.js";
-import { DFlowPanelSize as ht } from "../d-flow-panel/DFlowPanelSize.js";
-import { DFlowPanelControl as lt } from "../d-flow-panel/DFlowPanelControl.js";
-import { useFlowEdges as pt } from "./DFlow.edges.hook.js";
-import { useFlowNodes as gt } from "./DFlow.nodes.hook.js";
+import { DFlowFunctionDefaultCard as ct } from "../d-flow-function/DFlowFunctionDefaultCard.js";
+import { DFlowFunctionGroupCard as dt } from "../d-flow-function/DFlowFunctionGroupCard.js";
+import { DFlowFunctionSuggestionCard as ht } from "../d-flow-function/DFlowFunctionSuggestionCard.js";
+import { DFlowFunctionTriggerCard as lt } from "../d-flow-function/DFlowFunctionTriggerCard.js";
+import { DFlowEdge as gt } from "./DFlowEdge.js";
+import { DFlowPanelSize as pt } from "../d-flow-panel/DFlowPanelSize.js";
+import { DFlowPanelControl as mt } from "../d-flow-panel/DFlowPanelControl.js";
+import { useFlowEdges as ft } from "./DFlow.edges.hook.js";
+import { useFlowNodes as ut } from "./DFlow.nodes.hook.js";
 import "../button/Button.js";
 /* empty css                                      */
-import { DFlowPanelLayout as mt } from "../d-flow-panel/DFlowPanelLayout.js";
-import { DFlowValidation as ft } from "../d-flow-validation/DFlowValidation.js";
-const ut = (E, k) => {
-  if (!k || k.size === 0)
-    return {
-      nodes: E
-    };
-  const m = 50, B = 50, b = 16, Y = 0.25;
-  let _ = 0, D = !1;
-  const f = E.map((o) => ({
-    ...o
-  })), z = /* @__PURE__ */ new Map(), H = /* @__PURE__ */ new Map();
-  for (const o of f) {
-    const n = o.data?.linkingId;
-    if (n) {
-      let s = H.get(n);
-      s || (s = [], H.set(n, s)), s.push(o.id);
+import { DFlowPanelLayout as wt } from "../d-flow-panel/DFlowPanelLayout.js";
+import { DFlowValidation as yt } from "../d-flow-validation/DFlowValidation.js";
+const xt = (m, F) => {
+  if (!F || F.size === 0) return {
+    nodes: m
+  };
+  const w = 50, Y = 50, N = 16, x = 0.25;
+  let G = 0, A = !1;
+  const K = /* @__PURE__ */ new Map(), H = /* @__PURE__ */ new Map();
+  for (const e of m) {
+    const a = e.data?.linkingId;
+    if (a) {
+      const l = H.get(a) ?? [];
+      l.push(e.id), H.set(a, l);
     }
-    if (o.parentId && !n) {
-      let s = z.get(o.parentId);
-      s || (s = [], z.set(o.parentId, s)), s.push(o.id);
+    if (e.parentId && !a) {
+      const l = K.get(e.parentId) ?? [];
+      l.push(e.id), K.set(e.parentId, l);
     }
   }
-  const L = /* @__PURE__ */ new Map(), W = /* @__PURE__ */ new Map(), G = new Map(f.map((o) => [o.id, o]));
-  for (const [o, n] of z) {
-    const s = new Array(n.length);
-    for (let u = 0; u < n.length; u++) s[u] = G.get(n[u]);
-    L.set(o, s);
+  const R = new Map(m.map((e) => [e.id, e])), O = /* @__PURE__ */ new Map();
+  for (const [e, a] of K) {
+    const l = new Array(a.length);
+    for (let p = 0; p < a.length; p++) l[p] = R.get(a[p]);
+    O.set(e, l);
   }
-  for (const [o, n] of H) {
-    const s = new Array(n.length);
-    for (let u = 0; u < n.length; u++) s[u] = G.get(n[u]);
-    W.set(o, s);
+  const X = /* @__PURE__ */ new Map();
+  for (const [e, a] of H) {
+    const l = new Array(a.length);
+    for (let p = 0; p < a.length; p++) l[p] = R.get(a[p]);
+    X.set(e, l);
   }
-  const F = /* @__PURE__ */ new Map();
-  for (const o of f) {
-    const n = typeof o.style?.width == "number" ? o.style.width : void 0, s = typeof o.style?.height == "number" ? o.style.height : void 0, u = o.measured?.width && o.measured.width > 0 ? o.measured.width : void 0, T = o.measured?.height && o.measured.height > 0 ? o.measured.height : void 0;
-    F.set(o.id, {
-      w: n ?? u ?? 200,
-      h: s ?? T ?? 80
+  const C = /* @__PURE__ */ new Map(), B = /* @__PURE__ */ new Map(), j = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map();
+  for (const e of m) {
+    const a = typeof e.style?.width == "number" ? e.style.width : void 0, l = typeof e.style?.height == "number" ? e.style.height : void 0, p = e.measured?.width && e.measured.width > 0 ? e.measured.width : void 0, T = e.measured?.height && e.measured.height > 0 ? e.measured.height : void 0;
+    b.set(e.id, {
+      w: a ?? p ?? 200,
+      h: l ?? T ?? 80
     });
   }
-  const C = /* @__PURE__ */ new Map(), l = (o) => {
-    if (C.has(o.id)) return C.get(o.id);
-    if (o.type !== "group") {
-      const M = F.get(o.id);
-      return C.set(o.id, M), M;
+  const E = (e) => B.get(e.id)?.width, y = (e) => B.get(e.id)?.height, f = /* @__PURE__ */ new Map(), I = (e) => {
+    const a = f.get(e.id);
+    if (a) return a;
+    if (e.type !== "group") {
+      const S = b.get(e.id);
+      return f.set(e.id, S), S;
     }
-    const n = typeof o.style?.width == "number" ? o.style.width : void 0, s = typeof o.style?.height == "number" ? o.style.height : void 0;
-    if (n !== void 0 && s !== void 0) {
-      const M = {
-        w: n,
-        h: s
+    const l = E(e), p = y(e);
+    if (l !== void 0 && p !== void 0) {
+      const S = {
+        w: l,
+        h: p
       };
-      return C.set(o.id, M), M;
+      return f.set(e.id, S), S;
     }
-    const u = L.get(o.id) ?? [];
-    let T = 0, x = 0, N = 0;
-    for (const M of u) {
-      const A = l(M);
-      T += A.h, A.w > x && (x = A.w), N++;
+    const T = O.get(e.id) ?? [];
+    let k = 0, V = 0, _ = 0;
+    for (const S of T) {
+      const L = I(S);
+      k += L.h, L.w > V && (V = L.w), _++;
     }
-    T += m * Math.max(0, N - 1);
-    const v = {
-      w: x + 2 * b,
-      h: (N ? T : 0) + 2 * b
+    k += w * Math.max(0, _ - 1);
+    const q = {
+      w: V + 2 * N,
+      h: (_ ? k : 0) + 2 * N
     };
-    return C.set(o.id, v), v;
+    return f.set(e.id, q), q;
   };
   do {
-    D = !1, _++, C.clear();
-    for (const e of f) l(e);
-    const o = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), s = (e) => Math.round(e / 10), u = (e, p, g) => {
-      const h = [{
-        node: e,
-        cx: p,
+    A = !1, G++, f.clear();
+    for (const o of m) I(o);
+    const e = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map(), l = (o) => Math.round(o / 10), p = (o, h, g) => {
+      const i = [{
+        node: o,
+        cx: h,
         cy: g,
         phase: 0
       }];
-      let y = 0;
-      for (; h.length; ) {
-        const t = h[h.length - 1];
+      let M = 0;
+      for (; i.length; ) {
+        const t = i[i.length - 1];
         switch (t.phase) {
           case 0: {
-            o.set(t.node.id, {
+            e.set(t.node.id, {
               x: t.cx,
               y: t.cy
             });
             const {
-              w: i,
+              w: n,
               h: r
-            } = l(t.node);
-            t.w = i, t.h = r;
-            const a = W.get(t.node.id) ?? [], d = [], w = [];
-            for (const I of a)
-              I.type === "group" ? w.push(I) : d.push(I);
-            d.sort((I, c) => +I.data?.paramIndex - +c.data?.paramIndex), w.sort((I, c) => +I.data?.paramIndex - +c.data?.paramIndex), t.right = d, t.gParams = w;
-            let P = 0;
-            for (const I of d) P += l(I).h;
-            P += m * Math.max(0, d.length - 1), t.py = t.cy - P / 2, t.rightBottom = t.cy + r / 2, t.rightIndex = 0, t.phase = 1;
+            } = I(t.node);
+            t.w = n, t.h = r;
+            const s = X.get(t.node.id) ?? [], c = [], D = [];
+            for (const d of s)
+              d.type === "group" ? D.push(d) : c.push(d);
+            c.sort((d, u) => +d.data?.paramIndex - +u.data?.paramIndex), D.sort((d, u) => +d.data?.paramIndex - +u.data?.paramIndex), t.right = c, t.gParams = D;
+            let v = 0;
+            for (const d of c) v += I(d).h;
+            v += w * Math.max(0, c.length - 1), t.py = t.cy - v / 2, t.rightBottom = t.cy + r / 2, t.rightIndex = 0, t.phase = 1;
             break;
           }
           case 1: {
             if (t.rightIndex < t.right.length) {
-              const i = t.right[t.rightIndex], r = l(i), a = t.cx + t.w / 2 + B + r.w / 2;
-              let d = t.py + r.h / 2;
-              const w = s(a), I = (n.get(w) ?? Number.NEGATIVE_INFINITY) + m;
-              d - r.h / 2 < I && (d = I + r.h / 2, t.py = d - r.h / 2), t.childKey = w, t.childPs = r, h.push({
-                node: i,
-                cx: a,
-                cy: d,
+              const n = t.right[t.rightIndex], r = I(n), s = t.cx + t.w / 2 + Y + r.w / 2;
+              let c = t.py + r.h / 2;
+              const D = l(s), d = (a.get(D) ?? Number.NEGATIVE_INFINITY) + w;
+              c - r.h / 2 < d && (c = d + r.h / 2, t.py = c - r.h / 2), t.childKey = D, t.childPs = r, i.push({
+                node: n,
+                cx: s,
+                cy: c,
                 phase: 0
               }), t.phase = 10;
             } else
@@ -135,30 +134,30 @@ const ut = (E, k) => {
             break;
           }
           case 10: {
-            const i = t.lastChildBottom;
-            n.set(t.childKey, Math.max(n.get(t.childKey) ?? Number.NEGATIVE_INFINITY, i)), t.rightBottom = Math.max(t.rightBottom, i), t.py = Math.max(t.py + t.childPs.h + m, i + m), t.rightIndex++, t.phase = 1;
+            const n = t.lastChildBottom;
+            a.set(t.childKey, Math.max(a.get(t.childKey) ?? Number.NEGATIVE_INFINITY, n)), t.rightBottom = Math.max(t.rightBottom, n), t.py = Math.max(t.py + t.childPs.h + w, n + w), t.rightIndex++, t.phase = 1;
             break;
           }
           case 2: {
             if (t.gParams && t.gParams.length) {
-              const i = [];
+              const n = [];
               let r = 0;
-              for (const a of t.gParams) {
-                const d = l(a);
-                i.push(d), r += d.w;
+              for (const s of t.gParams) {
+                const c = I(s);
+                n.push(c), r += c.w;
               }
-              r += B * (t.gParams.length - 1), t.gSizes = i, t.gx = t.cx - r / 2, t.gy = t.bottom + m, t.rowBottom = t.bottom, t.gIndex = 0, t.phase = 3;
+              r += Y * (t.gParams.length - 1), t.gSizes = n, t.gx = t.cx - r / 2, t.gy = t.bottom + w, t.rowBottom = t.bottom, t.gIndex = 0, t.phase = 3;
             } else
               t.phase = 4;
             break;
           }
           case 3: {
             if (t.gIndex < t.gParams.length) {
-              const i = t.gParams[t.gIndex], r = t.gSizes[t.gIndex], a = t.gx + r.w / 2, d = t.gy + r.h / 2;
-              t.gx += r.w + B, h.push({
-                node: i,
-                cx: a,
-                cy: d,
+              const n = t.gParams[t.gIndex], r = t.gSizes[t.gIndex], s = t.gx + r.w / 2, c = t.gy + r.h / 2;
+              t.gx += r.w + Y, i.push({
+                node: n,
+                cx: s,
+                cy: c,
                 phase: 0
               }), t.childPs = r, t.phase = 30;
             } else
@@ -166,227 +165,264 @@ const ut = (E, k) => {
             break;
           }
           case 30: {
-            const i = t.lastChildBottom;
-            t.rowBottom = Math.max(t.rowBottom, i), t.gIndex++, t.phase = 3;
+            const n = t.lastChildBottom;
+            t.rowBottom = Math.max(t.rowBottom, n), t.gIndex++, t.phase = 3;
             break;
           }
           case 4: {
             if (t.node.type === "group") {
-              const i = L.get(t.node.id) ?? [], r = [];
-              for (const a of i)
-                a.data?.linkingId || r.push(a);
-              t.kids = r, t.kidIndex = 0, t.curY = t.cy - t.h / 2 + b, t.phase = 5;
+              const n = O.get(t.node.id) ?? [], r = [];
+              for (const s of n)
+                s.data?.linkingId || r.push(s);
+              t.kids = r, t.kidIndex = 0, t.curY = t.cy - t.h / 2 + N, t.phase = 5;
             } else
               t.phase = 6;
             break;
           }
           case 5: {
             if (t.kidIndex < t.kids.length) {
-              const i = t.kids[t.kidIndex], r = l(i), a = t.curY + r.h / 2;
-              h.push({
-                node: i,
+              const n = t.kids[t.kidIndex], r = I(n), s = t.curY + r.h / 2;
+              i.push({
+                node: n,
                 cx: t.cx,
-                cy: a,
+                cy: s,
                 phase: 0
               }), t.childPs = r, t.phase = 50;
             } else {
-              const i = t.curY - m;
-              t.bottom = Math.max(t.bottom, i + b), t.phase = 6;
+              const n = t.curY - w;
+              t.bottom = Math.max(t.bottom, n + N), t.phase = 6;
             }
             break;
           }
           case 50: {
-            const i = t.lastChildBottom;
-            t.curY = i + m, t.kidIndex++, t.phase = 5;
+            const n = t.lastChildBottom;
+            t.curY = n + w, t.kidIndex++, t.phase = 5;
             break;
           }
           case 6: {
-            const i = h.pop();
-            h.length ? h[h.length - 1].lastChildBottom = i.bottom : y = i.bottom;
+            const n = i.pop();
+            i.length ? i[i.length - 1].lastChildBottom = n.bottom : M = n.bottom;
             break;
           }
         }
       }
-      return y;
+      return M;
     };
     let T = 0;
-    for (const e of f)
-      !e.data?.linkingId && !e.parentId && (T = u(e, 0, T + l(e).h / 2) + m);
-    const x = /* @__PURE__ */ new Map();
-    for (const e of f) x.set(e.id, o.get(e.id));
-    const N = /* @__PURE__ */ new Map();
-    for (const e of f) {
+    for (const o of m)
+      !o.data?.linkingId && !o.parentId && (T = p(o, 0, T + I(o).h / 2) + w);
+    const k = /* @__PURE__ */ new Map();
+    for (const o of m) {
       const {
-        w: p,
+        w: h,
         h: g
-      } = l(e), {
-        x: h,
-        y
-      } = x.get(e.id);
-      N.set(e.id, {
-        x: h - p / 2,
-        y: y - g / 2
+      } = I(o), i = e.get(o.id);
+      k.set(o.id, {
+        x: i.x - h / 2,
+        y: i.y - g / 2
       });
     }
-    for (const e of f) {
-      const p = N.get(e.id);
-      let g = p.x, h = p.y;
-      if (e.parentId) {
-        const y = N.get(e.parentId);
-        g -= y.x, h -= y.y;
+    for (const o of m) {
+      const h = k.get(o.id);
+      let g = h.x, i = h.y;
+      if (o.parentId) {
+        const t = k.get(o.parentId);
+        g -= t.x, i -= t.y;
       }
-      e.position = {
+      const M = C.get(o.id);
+      (!M || Math.abs(M.x - g) > x || Math.abs(M.y - i) > x) && (C.set(o.id, {
         x: g,
-        y: h
-      };
+        y: i
+      }), A = !0);
     }
-    const v = /* @__PURE__ */ new Map();
-    for (const e of f) v.set(e.id, e);
-    const M = (e) => {
-      let p = 0, g = e;
-      for (; g?.parentId && (p++, g = v.get(g.parentId), !!g); )
+    const V = (o) => {
+      let h = 0, g = o;
+      for (; g?.parentId && (h++, g = R.get(g.parentId), !!g); )
         ;
-      return p;
-    }, A = [];
-    for (const e of f)
-      e.type === "group" && A.push(e);
-    A.sort((e, p) => M(p) - M(e));
-    for (const e of A) {
-      const p = [];
-      for (const c of f)
-        c.parentId === e.id && p.push(c);
-      if (!p.length) {
-        const c = typeof e.style?.width == "number" ? e.style.width : 2 * b, S = typeof e.style?.height == "number" ? e.style.height : 2 * b;
-        e.style = {
-          ...e.style,
-          width: c,
-          height: S
-        };
-        continue;
-      }
-      const g = (c) => {
-        const S = typeof c.style?.width == "number" ? c.style.width : void 0, q = typeof c.style?.height == "number" ? c.style.height : void 0, X = F.get(c.id);
-        return {
-          w: S ?? X.w,
-          h: q ?? X.h
-        };
+      return h;
+    }, _ = [];
+    for (const o of m) o.type === "group" && _.push(o);
+    _.sort((o, h) => V(h) - V(o));
+    const q = (o) => {
+      const h = typeof o.style?.width == "number" ? o.style.width : void 0, g = typeof o.style?.height == "number" ? o.style.height : void 0, i = b.get(o.id);
+      return {
+        w: h ?? i.w,
+        h: g ?? i.h
       };
-      let h = Number.POSITIVE_INFINITY, y = Number.POSITIVE_INFINITY, t = Number.NEGATIVE_INFINITY, i = Number.NEGATIVE_INFINITY;
-      for (const c of p) {
-        const S = g(c);
-        c.position.x < h && (h = c.position.x), c.position.y < y && (y = c.position.y), c.position.x + S.w > t && (t = c.position.x + S.w), c.position.y + S.h > i && (i = c.position.y + S.h);
+    };
+    for (const o of _) {
+      const h = [];
+      for (const d of m)
+        d.parentId === o.id && h.push(d);
+      if (!h.length) {
+        const d = E(o) ?? (typeof o.style?.width == "number" ? o.style.width : 2 * N), u = y(o) ?? (typeof o.style?.height == "number" ? o.style.height : 2 * N);
+        B.set(o.id, {
+          width: d,
+          height: u
+        }), j.set(o.id, {
+          width: d,
+          height: u
+        }), b.set(o.id, {
+          w: d,
+          h: u
+        });
+        continue;
       }
-      const r = h - b, a = y - b;
-      if (Math.abs(r) > Y || Math.abs(a) > Y) {
-        for (const c of p)
-          c.position.x -= r, c.position.y -= a;
-        D = !0;
+      let g = Number.POSITIVE_INFINITY, i = Number.POSITIVE_INFINITY, M = Number.NEGATIVE_INFINITY, t = Number.NEGATIVE_INFINITY;
+      for (const d of h) {
+        const u = q(d), P = C.get(d.id);
+        P.x < g && (g = P.x), P.y < i && (i = P.y), P.x + u.w > M && (M = P.x + u.w), P.y + u.h > t && (t = P.y + u.h);
       }
-      const d = t - h + 2 * b, w = i - y + 2 * b, P = typeof e.style?.width == "number" ? e.style.width : l(e).w, I = typeof e.style?.height == "number" ? e.style.height : l(e).h;
-      (Math.abs(d - P) > Y || Math.abs(w - I) > Y) && (D = !0), e.measured = {
-        width: d,
-        height: w
-      }, e.style = {
-        ...e.style,
-        width: d,
-        height: w
-      }, F.set(e.id, {
-        w: d,
-        h: w
+      const n = g - N, r = i - N;
+      if (Math.abs(n) > x || Math.abs(r) > x)
+        for (const d of h) {
+          const u = C.get(d.id), P = u.x - n, U = u.y - r;
+          (Math.abs(u.x - P) > x || Math.abs(u.y - U) > x) && (C.set(d.id, {
+            x: P,
+            y: U
+          }), A = !0);
+        }
+      const s = M - g + 2 * N, c = t - i + 2 * N, D = E(o) ?? (typeof o.style?.width == "number" ? o.style.width : I(o).w), v = y(o) ?? (typeof o.style?.height == "number" ? o.style.height : I(o).h);
+      (Math.abs(s - D) > x || Math.abs(c - v) > x) && (A = !0), B.set(o.id, {
+        width: s,
+        height: c
+      }), j.set(o.id, {
+        width: s,
+        height: c
+      }), b.set(o.id, {
+        w: s,
+        h: c
       });
     }
-    C.clear();
-    for (const e of f) l(e);
-    const R = /* @__PURE__ */ new Map(), O = /* @__PURE__ */ new Map();
-    for (const e of f) {
-      const p = l(e), g = o.get(e.id);
-      O.set(e.id, g), R.set(e.id, {
-        x: g.x - p.w / 2,
-        y: g.y - p.h / 2
+    f.clear();
+    for (const o of m) I(o);
+    const S = /* @__PURE__ */ new Map(), L = /* @__PURE__ */ new Map();
+    for (const o of m) {
+      const h = I(o), g = e.get(o.id);
+      L.set(o.id, g), S.set(o.id, {
+        x: g.x - h.w / 2,
+        y: g.y - h.h / 2
       });
     }
-    for (const e of f) {
-      const p = [], g = W.get(e.id) ?? [];
-      for (const a of g)
-        a.type === "group" && p.push(a);
-      if (!p.length) continue;
-      const h = p.slice().sort((a, d) => (+a.data?.paramIndex || 0) - (+d.data?.paramIndex || 0)), y = [];
-      for (const a of h) {
-        const d = v.get(a.id), w = typeof d.style?.width == "number" ? d.style.width : void 0;
-        y.push(w ?? l(d).w);
+    for (const o of m) {
+      const h = [], g = X.get(o.id) ?? [];
+      for (const s of g) s.type === "group" && h.push(s);
+      if (!h.length) continue;
+      const i = h.slice().sort((s, c) => (+s.data?.paramIndex || 0) - (+c.data?.paramIndex || 0)), M = [];
+      for (const s of i) {
+        const c = E(s) ?? (typeof s.style?.width == "number" ? s.style.width : void 0);
+        M.push(c ?? I(s).w);
       }
       let t = 0;
-      for (const a of y) t += a;
-      t += B * (h.length - 1);
-      let r = O.get(e.id).x - t / 2;
-      for (let a = 0; a < h.length; a++) {
-        const d = h[a], w = v.get(d.id), P = w.parentId ? R.get(w.parentId) : {
+      for (const s of M) t += s;
+      t += Y * (i.length - 1);
+      let r = L.get(o.id).x - t / 2;
+      for (let s = 0; s < i.length; s++) {
+        const c = i[s], D = c.parentId ? S.get(c.parentId) : {
           x: 0
-        };
-        w.position.x = r - P.x, r += y[a] + B;
+        }, v = C.get(c.id), d = r - D.x, u = v.y;
+        (Math.abs(v.x - d) > x || Math.abs(v.y - u) > x) && (C.set(c.id, {
+          x: d,
+          y: u
+        }), A = !0), r += M[s] + Y;
       }
     }
-  } while (D && _ < 5);
+  } while (A && G < 5);
   return {
-    nodes: f
+    nodes: m.map((e) => {
+      const a = C.get(e.id), l = j.get(e.id), p = B.get(e.id);
+      let T = !1;
+      if (a) {
+        const k = e.position ?? {
+          x: 0,
+          y: 0
+        };
+        (Math.abs(k.x - a.x) > x || Math.abs(k.y - a.y) > x) && (T = !0);
+      }
+      if (l) {
+        const k = e.measured ?? {
+          width: 0,
+          height: 0
+        };
+        (Math.abs(k.width - l.width) > x || Math.abs(k.height - l.height) > x) && (T = !0);
+      }
+      if (p) {
+        const k = typeof e.style?.width == "number" ? e.style.width : void 0, V = typeof e.style?.height == "number" ? e.style.height : void 0;
+        (k !== p.width || V !== p.height) && (T = !0);
+      }
+      return T ? {
+        ...e,
+        position: a ?? e.position,
+        measured: l ? {
+          ...e.measured,
+          width: l.width,
+          height: l.height
+        } : e.measured,
+        style: p ? {
+          ...e.style,
+          width: p.width,
+          height: p.height
+        } : e.style
+      } : e;
+    })
   };
-}, j = K.cache(ut), Ht = (E) => {
-  const k = $.c(2);
-  let m;
-  return k[0] !== E ? (m = /* @__PURE__ */ V(Q, { children: /* @__PURE__ */ V(wt, { ...E }) }), k[0] = E, k[1] = m) : m = k[1], m;
-}, wt = (E) => {
+}, $ = W.cache(xt), Gt = (m) => {
+  const F = Z.c(2);
+  let w;
+  return F[0] !== m ? (w = /* @__PURE__ */ z(et, { children: /* @__PURE__ */ z(It, { ...m }) }), F[0] = m, F[1] = w) : w = F[1], w;
+}, It = (m) => {
   const {
-    flowId: k,
-    namespaceId: m,
-    projectId: B
-  } = E, b = {
-    default: it,
-    group: rt,
-    suggestion: at,
-    trigger: dt
-  }, Y = {
-    default: ct
-  }, _ = gt(k, m, B), D = pt(k, m, B), [f, z] = Z([]), [H, L, W] = tt([]), G = et(), F = K.useCallback((l) => {
+    flowId: F,
+    namespaceId: w,
+    projectId: Y
+  } = m, N = W.useMemo(() => ({
+    default: ct,
+    group: dt,
+    suggestion: ht,
+    trigger: lt
+  }), []), x = W.useMemo(() => ({
+    default: gt
+  }), []), G = ut(F, w, Y), A = ft(F, w, Y), [K, H] = ot([]), [R, O, X] = st([]), C = nt(), B = W.useCallback((b) => {
     requestAnimationFrame(() => {
-      l.forEach((o) => G(o));
+      b.forEach((E) => C(E));
     });
-  }, [G]), C = K.useCallback((l) => {
-    const o = Array.from(new Set(l.filter((s) => s.type === "dimensions" || s.type === "position").map((s) => s.id))), n = /* @__PURE__ */ new Map();
-    l.filter((s) => s.type === "dimensions").forEach((s) => n.set(s.id, s.dimensions)), z((s) => {
-      const u = s.map((x) => {
-        if (!n.has(x.id)) return x;
-        const N = n.get(x.id) || {};
+  }, [C]), j = W.useCallback((b) => {
+    const E = Array.from(new Set(b.filter((f) => f.type === "dimensions" || f.type === "position").map((f) => f.id))), y = /* @__PURE__ */ new Map();
+    b.filter((f) => f.type === "dimensions").forEach((f) => y.set(f.id, f.dimensions)), H((f) => {
+      const I = f.map((e) => {
+        if (!y.has(e.id)) return e;
+        const a = y.get(e.id) || {};
         return {
-          ...x,
+          ...e,
           measured: {
-            width: N.width ?? x.measured?.width ?? 0,
-            height: N.height ?? x.measured?.height ?? 0
+            width: a.width ?? e.measured?.width ?? 0,
+            height: a.height ?? e.measured?.height ?? 0
           }
         };
       });
-      return j(u, new Set(o)).nodes;
-    }), F(o);
-  }, [F]);
-  return K.useEffect(() => {
-    const l = _.map((n) => {
-      const s = n.measured ? [] : document.querySelectorAll("[data-id='" + n.id + "']");
+      return $(I, new Set(E)).nodes;
+    }), B(E);
+  }, [B]);
+  return W.useEffect(() => {
+    const b = G.map((y) => {
+      const f = y.measured ? [] : document.querySelectorAll("[data-id='" + y.id + "']");
       return {
-        ...n,
+        ...y,
         measured: {
-          width: n.measured?.width ?? s[0]?.clientWidth ?? 0,
-          height: n.measured?.height ?? s[0]?.clientHeight ?? 0
+          width: y.measured?.width ?? f[0]?.clientWidth ?? 0,
+          height: y.measured?.height ?? f[0]?.clientHeight ?? 0
         }
       };
-    }), o = j(l, new Set(l.map((n) => n.id)));
-    z(o.nodes), L(D), F(o.nodes.map((n) => n.id));
-  }, [_, D, F]), /* @__PURE__ */ U(ot, { onlyRenderVisibleElements: !0, panOnScroll: !1, nodeTypes: b, edgeTypes: Y, onInit: (l) => l.fitView(), onNodesChange: C, onEdgesChange: W, fitView: !0, ...J("flow", E), nodes: f, edges: H, children: [
-    /* @__PURE__ */ V(st, { variant: nt.Dots, color: "rgba(255,255,255, .05)", gap: 8, size: 2 }),
-    /* @__PURE__ */ V(ht, {}),
-    /* @__PURE__ */ V(mt, {}),
-    /* @__PURE__ */ V(ft, { flowId: "gid://sagittarius/Flow/1" }),
-    /* @__PURE__ */ V(lt, { flowId: k })
+    }), E = $(b, new Set(b.map((y) => y.id)));
+    H(E.nodes), O(A), B(E.nodes.map((y) => y.id));
+  }, [G, A, B]), /* @__PURE__ */ Q(it, { onlyRenderVisibleElements: !0, panOnScroll: !1, nodeTypes: N, edgeTypes: x, onInit: (b) => b.fitView(), onNodesChange: j, onEdgesChange: X, ...tt("flow", m), nodes: K, edges: R, children: [
+    /* @__PURE__ */ z(rt, { variant: at.Dots, color: "rgba(255,255,255, .05)", gap: 8, size: 2 }),
+    /* @__PURE__ */ z(pt, {}),
+    /* @__PURE__ */ z(wt, {}),
+    /* @__PURE__ */ z(yt, { flowId: "gid://sagittarius/Flow/1" }),
+    /* @__PURE__ */ z(mt, { flowId: F })
   ] });
 };
 export {
-  Ht as DFlow
+  Gt as DFlow
 };