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

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

@@ -1,122 +1,132 @@
-import { jsx as K } from "react/jsx-runtime";
-import { c as U } from "../../compiler-runtime-BNHg76kC.js";
-import { ReactFlowProvider as $, useNodesState as J, useEdgesState as Q, useUpdateNodeInternals as Z, ReactFlow as tt } from "@xyflow/react";
-import G from "react";
-import { mergeCode0Props as et } from "../../utils/utils.js";
-import { DFlowFunctionDefaultCard as ot } from "./function/DFlowFunctionDefaultCard.js";
-import { DFlowFunctionGroupCard as st } from "./function/DFlowFunctionGroupCard.js";
-import { DFlowFunctionSuggestionCard as nt } from "./function/DFlowFunctionSuggestionCard.js";
-import { DFlowFunctionTriggerCard as it } from "./function/DFlowFunctionTriggerCard.js";
-import { DFlowEdge as rt } from "./edge/DFlowEdge.js";
-import '../../assets/DFlow.css';const at = (y, C) => {
-  if (!C || C.size === 0)
-    return {
-      nodes: y
-    };
-  const m = 75, Y = 75, N = 16, z = 0.25;
-  let _ = 0, F = !1;
-  const f = y.map((o) => ({
-    ...o
-  })), L = /* @__PURE__ */ new Map(), W = /* @__PURE__ */ new Map();
-  for (const o of f) {
-    const c = o.data?.linkingId;
-    if (c) {
-      let l = W.get(c);
-      l || (l = [], W.set(c, l)), l.push(o.id);
+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 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 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 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 && !c) {
-      let l = L.get(o.parentId);
-      l || (l = [], L.set(o.parentId, l)), l.push(o.id);
+    if (e.parentId && !a) {
+      const l = K.get(e.parentId) ?? [];
+      l.push(e.id), K.set(e.parentId, l);
     }
   }
-  const M = /* @__PURE__ */ new Map(), E = /* @__PURE__ */ new Map(), w = new Map(f.map((o) => [o.id, o]));
-  for (const [o, c] of L) {
-    const l = new Array(c.length);
-    for (let b = 0; b < c.length; b++) l[b] = w.get(c[b]);
-    M.set(o, l);
+  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, c] of W) {
-    const l = new Array(c.length);
-    for (let b = 0; b < c.length; b++) l[b] = w.get(c[b]);
-    E.set(o, l);
+  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 g = /* @__PURE__ */ new Map();
-  for (const o of f) {
-    const c = typeof o.style?.width == "number" ? o.style.width : void 0, l = typeof o.style?.height == "number" ? o.style.height : void 0, b = o.measured?.width && o.measured.width > 0 ? o.measured.width : void 0, P = o.measured?.height && o.measured.height > 0 ? o.measured.height : void 0;
-    g.set(o.id, {
-      w: c ?? b ?? 200,
-      h: l ?? P ?? 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 B = /* @__PURE__ */ new Map(), x = (o) => {
-    if (B.has(o.id)) return B.get(o.id);
-    if (o.type !== "group") {
-      const T = g.get(o.id);
-      return B.set(o.id, T), T;
+  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 c = typeof o.style?.width == "number" ? o.style.width : void 0, l = typeof o.style?.height == "number" ? o.style.height : void 0;
-    if (c !== void 0 && l !== void 0) {
-      const T = {
-        w: c,
-        h: l
+    const l = E(e), p = y(e);
+    if (l !== void 0 && p !== void 0) {
+      const S = {
+        w: l,
+        h: p
       };
-      return B.set(o.id, T), T;
+      return f.set(e.id, S), S;
     }
-    const b = M.get(o.id) ?? [];
-    let P = 0, H = 0, v = 0;
-    for (const T of b) {
-      const V = x(T);
-      P += V.h, V.w > H && (H = V.w), v++;
+    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), _++;
     }
-    P += m * Math.max(0, v - 1);
-    const D = {
-      w: H + 2 * N,
-      h: (v ? P : 0) + 2 * N
+    k += w * Math.max(0, _ - 1);
+    const q = {
+      w: V + 2 * N,
+      h: (_ ? k : 0) + 2 * N
     };
-    return B.set(o.id, D), D;
+    return f.set(e.id, q), q;
   };
   do {
-    F = !1, _++, B.clear();
-    for (const e of f) x(e);
-    const o = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Map(), l = (e) => Math.round(e / 10), b = (e, h, p) => {
-      const d = [{
-        node: e,
+    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: p,
+        cy: g,
         phase: 0
       }];
-      let I = 0;
-      for (; d.length; ) {
-        const t = d[d.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: s,
-              h: n
-            } = x(t.node);
-            t.w = s, t.h = n;
-            const i = E.get(t.node.id) ?? [], r = [], u = [];
-            for (const k of i)
-              k.type === "group" ? u.push(k) : r.push(k);
-            r.sort((k, a) => +k.data?.paramIndex - +a.data?.paramIndex), u.sort((k, a) => +k.data?.paramIndex - +a.data?.paramIndex), t.right = r, t.gParams = u;
-            let S = 0;
-            for (const k of r) S += x(k).h;
-            S += m * Math.max(0, r.length - 1), t.py = t.cy - S / 2, t.rightBottom = t.cy + n / 2, t.rightIndex = 0, t.phase = 1;
+              w: n,
+              h: r
+            } = 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 s = t.right[t.rightIndex], n = x(s), i = t.cx + t.w / 2 + Y + n.w / 2;
-              let r = t.py + n.h / 2;
-              const u = l(i), k = (c.get(u) ?? Number.NEGATIVE_INFINITY) + m;
-              r - n.h / 2 < k && (r = k + n.h / 2, t.py = r - n.h / 2), t.childKey = u, t.childPs = n, d.push({
-                node: s,
-                cx: i,
-                cy: r,
+              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
@@ -124,250 +134,295 @@ import '../../assets/DFlow.css';const at = (y, C) => {
             break;
           }
           case 10: {
-            const s = t.lastChildBottom;
-            c.set(t.childKey, Math.max(c.get(t.childKey) ?? Number.NEGATIVE_INFINITY, s)), t.rightBottom = Math.max(t.rightBottom, s), t.py = Math.max(t.py + t.childPs.h + m, s + 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 s = [];
-              let n = 0;
-              for (const i of t.gParams) {
-                const r = x(i);
-                s.push(r), n += r.w;
+              const n = [];
+              let r = 0;
+              for (const s of t.gParams) {
+                const c = I(s);
+                n.push(c), r += c.w;
               }
-              n += Y * (t.gParams.length - 1), t.gSizes = s, t.gx = t.cx - n / 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 s = t.gParams[t.gIndex], n = t.gSizes[t.gIndex], i = t.gx + n.w / 2, r = t.gy + n.h / 2;
-              t.gx += n.w + Y, d.push({
-                node: s,
-                cx: i,
-                cy: r,
+              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 = n, t.phase = 30;
+              }), t.childPs = r, t.phase = 30;
             } else
               t.bottom = t.rowBottom, t.phase = 4;
             break;
           }
           case 30: {
-            const s = t.lastChildBottom;
-            t.rowBottom = Math.max(t.rowBottom, s), 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 s = M.get(t.node.id) ?? [], n = [];
-              for (const i of s)
-                i.data?.linkingId || n.push(i);
-              t.kids = n, t.kidIndex = 0, t.curY = t.cy - t.h / 2 + N, 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 s = t.kids[t.kidIndex], n = x(s), i = t.curY + n.h / 2;
-              d.push({
-                node: s,
+              const n = t.kids[t.kidIndex], r = I(n), s = t.curY + r.h / 2;
+              i.push({
+                node: n,
                 cx: t.cx,
-                cy: i,
+                cy: s,
                 phase: 0
-              }), t.childPs = n, t.phase = 50;
+              }), t.childPs = r, t.phase = 50;
             } else {
-              const s = t.curY - m;
-              t.bottom = Math.max(t.bottom, s + N), t.phase = 6;
+              const n = t.curY - w;
+              t.bottom = Math.max(t.bottom, n + N), t.phase = 6;
             }
             break;
           }
           case 50: {
-            const s = t.lastChildBottom;
-            t.curY = s + m, t.kidIndex++, t.phase = 5;
+            const n = t.lastChildBottom;
+            t.curY = n + w, t.kidIndex++, t.phase = 5;
             break;
           }
           case 6: {
-            const s = d.pop();
-            d.length ? d[d.length - 1].lastChildBottom = s.bottom : I = s.bottom;
+            const n = i.pop();
+            i.length ? i[i.length - 1].lastChildBottom = n.bottom : M = n.bottom;
             break;
           }
         }
       }
-      return I;
+      return M;
     };
-    let P = 0;
-    for (const e of f)
-      !e.data?.linkingId && !e.parentId && (P = b(e, 0, P + x(e).h / 2) + m);
-    const H = /* @__PURE__ */ new Map();
-    for (const e of f) H.set(e.id, o.get(e.id));
-    const v = /* @__PURE__ */ new Map();
-    for (const e of f) {
+    let T = 0;
+    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: h,
-        h: p
-      } = x(e), {
-        x: d,
-        y: I
-      } = H.get(e.id);
-      v.set(e.id, {
-        x: d - h / 2,
-        y: I - p / 2
+        h: g
+      } = 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 h = v.get(e.id);
-      let p = h.x, d = h.y;
-      if (e.parentId) {
-        const I = v.get(e.parentId);
-        p -= I.x, d -= I.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 = {
-        x: p,
-        y: d
-      };
+      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: i
+      }), A = !0);
     }
-    const D = /* @__PURE__ */ new Map();
-    for (const e of f) D.set(e.id, e);
-    const T = (e) => {
-      let h = 0, p = e;
-      for (; p?.parentId && (h++, p = D.get(p.parentId), !!p); )
+    const V = (o) => {
+      let h = 0, g = o;
+      for (; g?.parentId && (h++, g = R.get(g.parentId), !!g); )
         ;
       return h;
-    }, V = [];
-    for (const e of f)
-      e.type === "group" && V.push(e);
-    V.sort((e, h) => T(h) - T(e));
-    for (const e of V) {
+    }, _ = [];
+    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
+      };
+    };
+    for (const o of _) {
       const h = [];
-      for (const a of f)
-        a.parentId === e.id && h.push(a);
+      for (const d of m)
+        d.parentId === o.id && h.push(d);
       if (!h.length) {
-        const a = typeof e.style?.width == "number" ? e.style.width : 2 * N, A = typeof e.style?.height == "number" ? e.style.height : 2 * N;
-        e.style = {
-          ...e.style,
-          width: a,
-          height: A
-        };
+        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 p = (a) => {
-        const A = typeof a.style?.width == "number" ? a.style.width : void 0, j = typeof a.style?.height == "number" ? a.style.height : void 0, X = g.get(a.id);
-        return {
-          w: A ?? X.w,
-          h: j ?? X.h
-        };
-      };
-      let d = Number.POSITIVE_INFINITY, I = Number.POSITIVE_INFINITY, t = Number.NEGATIVE_INFINITY, s = Number.NEGATIVE_INFINITY;
-      for (const a of h) {
-        const A = p(a);
-        a.position.x < d && (d = a.position.x), a.position.y < I && (I = a.position.y), a.position.x + A.w > t && (t = a.position.x + A.w), a.position.y + A.h > s && (s = a.position.y + A.h);
-      }
-      const n = d - N, i = I - N;
-      if (Math.abs(n) > z || Math.abs(i) > z) {
-        for (const a of h)
-          a.position.x -= n, a.position.y -= i;
-        F = !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 r = t - d + 2 * N, u = s - I + 2 * N, S = typeof e.style?.width == "number" ? e.style.width : x(e).w, k = typeof e.style?.height == "number" ? e.style.height : x(e).h;
-      (Math.abs(r - S) > z || Math.abs(u - k) > z) && (F = !0), e.measured = {
-        width: r,
-        height: u
-      }, e.style = {
-        ...e.style,
-        width: r,
-        height: u
-      }, g.set(e.id, {
-        w: r,
-        h: u
+      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
       });
     }
-    B.clear();
-    for (const e of f) x(e);
-    const R = /* @__PURE__ */ new Map(), O = /* @__PURE__ */ new Map();
-    for (const e of f) {
-      const h = x(e), p = o.get(e.id);
-      O.set(e.id, p), R.set(e.id, {
-        x: p.x - h.w / 2,
-        y: p.y - h.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 h = [], p = E.get(e.id) ?? [];
-      for (const i of p)
-        i.type === "group" && h.push(i);
+    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 d = h.slice().sort((i, r) => (+i.data?.paramIndex || 0) - (+r.data?.paramIndex || 0)), I = [];
-      for (const i of d) {
-        const r = D.get(i.id), u = typeof r.style?.width == "number" ? r.style.width : void 0;
-        I.push(u ?? x(r).w);
+      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 i of I) t += i;
-      t += Y * (d.length - 1);
-      let n = O.get(e.id).x - t / 2;
-      for (let i = 0; i < d.length; i++) {
-        const r = d[i], u = D.get(r.id), S = u.parentId ? R.get(u.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
-        };
-        u.position.x = n - S.x, n += I[i] + Y;
+        }, 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 (F && _ < 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;
+    })
   };
-}, q = G.cache(at), It = (y) => {
-  const C = U.c(2);
-  let m;
-  return C[0] !== y ? (m = /* @__PURE__ */ K($, { children: /* @__PURE__ */ K(dt, { ...y }) }), C[0] = y, C[1] = m) : m = C[1], m;
-}, dt = (y) => {
-  const [C, m] = J(y.nodes), [Y, N, z] = Q(y.edges), _ = Z(), F = G.useCallback((M) => {
+}, $ = 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: 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(() => {
-      M.forEach((E) => _(E));
+      b.forEach((E) => C(E));
     });
-  }, [_]), f = {
-    default: ot,
-    group: st,
-    suggestion: nt,
-    trigger: it,
-    ...y.nodeTypes
-  }, L = {
-    default: rt,
-    ...y.edgeTypes
-  }, W = G.useCallback((M) => {
-    const E = Array.from(new Set(M.filter((g) => g.type === "dimensions" || g.type === "position").map((g) => g.id))), w = /* @__PURE__ */ new Map();
-    M.filter((g) => g.type === "dimensions").forEach((g) => w.set(g.id, g.dimensions)), m((g) => {
-      const B = g.map((o) => {
-        if (!w.has(o.id)) return o;
-        const c = w.get(o.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 {
-          ...o,
+          ...e,
           measured: {
-            width: c.width ?? o.measured?.width ?? 0,
-            height: c.height ?? o.measured?.height ?? 0
+            width: a.width ?? e.measured?.width ?? 0,
+            height: a.height ?? e.measured?.height ?? 0
           }
         };
       });
-      return q(B, new Set(E)).nodes;
-    }), F(E);
-  }, [F]);
-  return G.useEffect(() => {
-    const M = y.nodes.map((w) => {
-      const g = w.measured ? [] : document.querySelectorAll("[data-id='" + w.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 {
-        ...w,
+        ...y,
         measured: {
-          width: w.measured?.width ?? g[0]?.clientWidth ?? 0,
-          height: w.measured?.height ?? g[0]?.clientHeight ?? 0
+          width: y.measured?.width ?? f[0]?.clientWidth ?? 0,
+          height: y.measured?.height ?? f[0]?.clientHeight ?? 0
         }
       };
-    }), E = q(M, new Set(M.map((w) => w.id)));
-    m(E.nodes), N(y.edges), F(E.nodes.map((w) => w.id));
-  }, [y.nodes, y.edges, F]), /* @__PURE__ */ K(tt, { onlyRenderVisibleElements: !0, panOnScroll: !1, nodeTypes: f, edgeTypes: L, onInit: (M) => M.fitView(), onNodesChange: W, onEdgesChange: z, ...et("flow", y), nodes: C, edges: Y });
+    }), 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 {
-  It as DFlow
+  Gt as DFlow
 };