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

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

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

package/dist/components/d-flow/DFlow.nodes.hook.d.ts

@@ -1,7 +1,7 @@
 import { Node } from '@xyflow/react';
-import { Flow } from '@code0-tech/sagittarius-graphql-types';
+import { Flow, Namespace, NamespaceProject } from '@code0-tech/sagittarius-graphql-types';
 import { DFlowFunctionDefaultCardDataProps } from '../d-flow-function/DFlowFunctionDefaultCard';
 import { DFlowFunctionSuggestionCardDataProps } from '../d-flow-function/DFlowFunctionSuggestionCard';
 import { DFlowFunctionTriggerCardDataProps } from '../d-flow-function/DFlowFunctionTriggerCard';
 import { DFlowFunctionGroupCardDataProps } from '../d-flow-function/DFlowFunctionGroupCard';
-export declare const useFlowNodes: (flowId: Flow["id"]) => Node<DFlowFunctionDefaultCardDataProps | DFlowFunctionSuggestionCardDataProps | DFlowFunctionTriggerCardDataProps | DFlowFunctionGroupCardDataProps>[];
+export declare const useFlowNodes: (flowId: Flow["id"], namespaceId?: Namespace["id"], projectId?: NamespaceProject["id"]) => Node<DFlowFunctionDefaultCardDataProps | DFlowFunctionSuggestionCardDataProps | DFlowFunctionTriggerCardDataProps | DFlowFunctionGroupCardDataProps>[];