@floegence/floe-webapp-core 0.84.0 → 0.85.1

package/dist/components/file-browser/DragPreview.js

@@ -1,6 +1,6 @@
 import { createComponent as o, Portal as N, insert as l, effect as u, className as $, memo as B, template as a, setAttribute as A } from "solid-js/web";
 import { createSignal as F, createEffect as V, createMemo as d, Show as m, For as j } from "solid-js";
-import { Presence as U, Motion as X } from "../../node_modules/.pnpm/solid-motionone@1.0.4_solid-js@1.9.15/node_modules/solid-motionone/dist/index.js";
+import { Presence as U, Motion as X } from "../../node_modules/.pnpm/solid-motionone@1.0.4_solid-js@1.9.17/node_modules/solid-motionone/dist/index.js";
 import { cn as f } from "../../utils/cn.js";
 import { useFileBrowserDrag as G } from "../../context/FileBrowserDragContext.js";
 import { FileItemIcon as W } from "./FileIcons.js";

package/dist/components/graph/layout.js

@@ -1,48 +1,48 @@
 import { applyGraphPositions as v } from "./positions.js";
 function $(i) {
-  const n = /* @__PURE__ */ new Set(), p = (e) => {
-    if (!e || n.has(e)) throw new Error(`Duplicate or empty graph ID: ${e}`);
-    n.add(e);
-  }, s = new Map(i.nodes.map((e) => [e.id, e]));
-  for (const e of i.nodes) {
-    if (p(e.id), ![e.width, e.height].every((r) => Number.isFinite(r) && r > 0))
-      throw new Error(`Invalid dimensions for graph node: ${e.id}`);
-    for (const r of e.ports ?? []) p(r.id);
-    const a = /* @__PURE__ */ new Set([e.id]);
-    let d = e.parentId;
+  const n = /* @__PURE__ */ new Set(), p = (t) => {
+    if (!t || n.has(t)) throw new Error(`Duplicate or empty graph ID: ${t}`);
+    n.add(t);
+  }, s = new Map(i.nodes.map((t) => [t.id, t]));
+  for (const t of i.nodes) {
+    if (p(t.id), ![t.width, t.height].every((r) => Number.isFinite(r) && r > 0))
+      throw new Error(`Invalid dimensions for graph node: ${t.id}`);
+    for (const r of t.ports ?? []) p(r.id);
+    const a = /* @__PURE__ */ new Set([t.id]);
+    let d = t.parentId;
     for (; d !== void 0; ) {
       const r = s.get(d);
       if (!r || r.kind !== "group")
-        throw new Error(`Invalid parent for graph node: ${e.id}`);
-      if (a.has(d)) throw new Error(`Cyclic graph containment: ${e.id}`);
+        throw new Error(`Invalid parent for graph node: ${t.id}`);
+      if (a.has(d)) throw new Error(`Cyclic graph containment: ${t.id}`);
       a.add(d), d = r.parentId;
     }
   }
-  for (const e of i.edges) {
-    p(e.id);
+  for (const t of i.edges) {
+    p(t.id);
     for (const [a, d] of [
-      [e.source, e.sourcePort],
-      [e.target, e.targetPort]
+      [t.source, t.sourcePort],
+      [t.target, t.targetPort]
     ]) {
       const r = s.get(a);
       if (!r || d !== void 0 && !r.ports?.some((c) => c.id === d))
-        throw new Error(`Invalid endpoint for graph edge: ${e.id}`);
+        throw new Error(`Invalid endpoint for graph edge: ${t.id}`);
     }
   }
 }
 async function O(i, n, p) {
   $(i);
   const s = n.groupPadding ?? { top: 64, right: 28, bottom: 28, left: 28 };
-  if (![...Object.values(s), n.spacing ?? 64].every((t) => Number.isFinite(t) && t >= 0))
+  if (![...Object.values(s), n.spacing ?? 64].every((e) => Number.isFinite(e) && e >= 0))
     throw new Error("Graph layout spacing must be finite and nonnegative");
-  const e = /* @__PURE__ */ new Map();
-  for (const t of i.nodes)
-    e.set(t.id, {
-      id: t.id,
-      width: t.width,
-      height: t.height,
-      ...t.kind === "group" ? { children: [] } : {},
-      ports: t.ports?.map((o) => ({
+  const t = /* @__PURE__ */ new Map();
+  for (const e of i.nodes)
+    t.set(e.id, {
+      id: e.id,
+      width: e.width,
+      height: e.height,
+      ...e.kind === "group" ? { children: [] } : {},
+      ports: e.ports?.map((o) => ({
         id: o.id,
         width: 1,
         height: 1,
@@ -54,21 +54,21 @@ async function O(i, n, p) {
       }
     });
   const a = [];
-  for (const t of i.nodes)
-    (t.parentId ? e.get(t.parentId).children : a).push(e.get(t.id));
+  for (const e of i.nodes)
+    (e.parentId ? t.get(e.parentId).children : a).push(t.get(e.id));
   const d = /* @__PURE__ */ new Set([
-    ...i.nodes.flatMap((t) => [t.id, ...(t.ports ?? []).map((o) => o.id)]),
-    ...i.edges.map((t) => t.id)
+    ...i.nodes.flatMap((e) => [e.id, ...(e.ports ?? []).map((o) => o.id)]),
+    ...i.edges.map((e) => e.id)
   ]);
   let r = "$graph";
   for (; d.has(r); ) r += "$";
   const c = await p.layout({
     id: r,
     children: a,
-    edges: i.edges.map((t) => ({
-      id: t.id,
-      sources: [t.sourcePort ?? t.source],
-      targets: [t.targetPort ?? t.target]
+    edges: i.edges.map((e) => ({
+      id: e.id,
+      sources: [e.sourcePort ?? e.source],
+      targets: [e.targetPort ?? e.target]
     })),
     layoutOptions: {
       "elk.algorithm": "layered",
@@ -80,9 +80,9 @@ async function O(i, n, p) {
       "elk.layered.considerModelOrder.strategy": "NODES_AND_EDGES",
       "elk.randomSeed": "1"
     }
-  }), f = /* @__PURE__ */ new Map(), x = /* @__PURE__ */ new Map(), I = (t) => {
-    for (const o of t.edges ?? []) {
-      const h = o.container ?? t.id, l = f.get(h) ?? { x: 0, y: 0 };
+  }), f = /* @__PURE__ */ new Map(), x = /* @__PURE__ */ new Map(), I = (e) => {
+    for (const o of e.edges ?? []) {
+      const h = o.container ?? e.id, l = f.get(h) ?? { x: 0, y: 0 };
       x.set(
         o.id,
         (o.sections ?? []).map(
@@ -93,30 +93,31 @@ async function O(i, n, p) {
         )
       );
     }
-    for (const o of t.children ?? []) I(o);
-  }, E = (t, o, h) => {
-    const l = o + (t.x ?? 0), g = h + (t.y ?? 0);
-    f.set(t.id, { x: l, y: g, width: t.width ?? 0, height: t.height ?? 0 });
-    for (const w of t.children ?? []) E(w, l, g);
+    for (const o of e.children ?? []) I(o);
+  }, E = (e, o, h) => {
+    const l = o + (e.x ?? 0), g = h + (e.y ?? 0);
+    f.set(e.id, { x: l, y: g, width: e.width ?? 0, height: e.height ?? 0 });
+    for (const w of e.children ?? []) E(w, l, g);
   };
-  for (const t of c.children ?? []) E(t, 0, 0);
+  for (const e of c.children ?? []) E(e, 0, 0);
   I(c);
-  const y = !n.positions?.length && n.anchor && f.get(n.anchor.nodeId), m = y ? n.anchor.position.x - y.x : 0, u = y ? n.anchor.position.y - y.y : 0, k = i.nodes.map((t) => {
-    const o = f.get(t.id);
-    return { ...t, ...o, x: o.x + m, y: o.y + u };
+  const y = !n.positions?.length && n.anchor && f.get(n.anchor.nodeId), m = y ? n.anchor.position.x - y.x : 0, u = y ? n.anchor.position.y - y.y : 0, k = i.nodes.map((e) => {
+    const o = f.get(e.id);
+    return { ...e, ...o, x: o.x + m, y: o.y + u };
   });
   return v(
     {
       nodes: k,
-      edges: i.edges.map((t) => ({
-        ...t,
-        sections: (x.get(t.id) ?? []).map(
+      edges: i.edges.map((e) => ({
+        ...e,
+        sections: (x.get(e.id) ?? []).map(
           (o) => o.map((h) => ({ x: h.x + m, y: h.y + u }))
         )
       })),
       bounds: { x: m, y: u, width: c.width ?? 0, height: c.height ?? 0 }
     },
-    n
+    n,
+    i.nodes
   );
 }
 export {

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

@@ -1,3 +1,3 @@
-import type { GraphLayout, GraphLayoutOptions } from './types';
-/** Apply optional absolute world positions, retaining unpinned ELK geometry and group containment. */
-export declare function applyGraphPositions(layout: GraphLayout, options: GraphLayoutOptions): GraphLayout;
+import type { GraphLayout, GraphLayoutOptions, GraphNode } from './types';
+/** Apply explicit fixed or preferred positions, then route the resulting geometry once. */
+export declare function applyGraphPositions(layout: GraphLayout, options: GraphLayoutOptions, input: readonly GraphNode[]): GraphLayout;

package/dist/components/graph/positions.js

@@ -1,134 +1,169 @@
-const P = (s, e = 0) => ({
-  left: s.x - e,
-  top: s.y - e,
-  right: s.x + s.width + e,
-  bottom: s.y + s.height + e
-}), b = (s, e) => s.x > e.left && s.x < e.right && s.y > e.top && s.y < e.bottom, N = (s, e, y) => !y.some(
-  (o) => s.x === e.x ? s.x > o.left && s.x < o.right && Math.max(s.y, e.y) > o.top && Math.min(s.y, e.y) < o.bottom : s.y > o.top && s.y < o.bottom && Math.max(s.x, e.x) > o.left && Math.min(s.x, e.x) < o.right
+const H = (e, n = 0) => ({
+  left: e.x - n,
+  top: e.y - n,
+  right: e.x + e.width + n,
+  bottom: e.y + e.height + n
+}), N = (e, n) => e.x > n.left && e.x < n.right && e.y > n.top && e.y < n.bottom, W = (e, n, v) => !v.some(
+  (r) => e.x === n.x ? e.x > r.left && e.x < r.right && Math.max(e.y, n.y) > r.top && Math.min(e.y, n.y) < r.bottom : e.y > r.top && e.y < r.bottom && Math.max(e.x, n.x) > r.left && Math.min(e.x, n.x) < r.right
 );
-function k(s, e, y) {
-  if (y.some((i) => b(s, i) || b(e, i)))
+function A(e, n, v) {
+  if (v.some((h) => N(e, h) || N(n, h)))
     throw new Error("Pinned graph positions obstruct an edge endpoint");
-  const o = [
-    .../* @__PURE__ */ new Set([s.x, e.x, ...y.flatMap((i) => [i.left, i.right])])
-  ].sort((i, r) => i - r), d = [
-    .../* @__PURE__ */ new Set([s.y, e.y, ...y.flatMap((i) => [i.top, i.bottom])])
-  ].sort((i, r) => i - r), u = (i) => ({ x: o[i % o.length], y: d[Math.floor(i / o.length)] }), v = d.indexOf(s.y) * o.length + o.indexOf(s.x), E = d.indexOf(e.y) * o.length + o.indexOf(e.x), w = /* @__PURE__ */ new Map([[v, 0]]), I = /* @__PURE__ */ new Map(), h = [], T = (i) => {
-    let r = h.length;
-    for (h.push(i); r > 0; ) {
-      const c = r - 1 >> 1;
-      if (h[c].score <= i.score) break;
-      h[r] = h[c], r = c;
+  const r = [
+    .../* @__PURE__ */ new Set([e.x, n.x, ...v.flatMap((h) => [h.left, h.right])])
+  ].sort((h, t) => h - t), I = [
+    .../* @__PURE__ */ new Set([e.y, n.y, ...v.flatMap((h) => [h.top, h.bottom])])
+  ].sort((h, t) => h - t), w = (h) => ({ x: r[h % r.length], y: I[Math.floor(h / r.length)] }), M = I.indexOf(e.y) * r.length + r.indexOf(e.x), b = I.indexOf(n.y) * r.length + r.indexOf(n.x), S = /* @__PURE__ */ new Map([[M, 0]]), O = /* @__PURE__ */ new Map(), y = [], E = (h) => {
+    let t = y.length;
+    for (y.push(h); t > 0; ) {
+      const c = t - 1 >> 1;
+      if (y[c].score <= h.score) break;
+      y[t] = y[c], t = c;
     }
-    h[r] = i;
-  }, t = () => {
-    const i = h[0], r = h.pop();
-    if (h.length) {
+    y[t] = h;
+  }, T = () => {
+    const h = y[0], t = y.pop();
+    if (y.length) {
       let c = 0;
-      for (; c * 2 + 1 < h.length; ) {
-        let a = c * 2 + 1;
-        if (a + 1 < h.length && h[a + 1].score < h[a].score && a++, h[a].score >= r.score) break;
-        h[c] = h[a], c = a;
+      for (; c * 2 + 1 < y.length; ) {
+        let p = c * 2 + 1;
+        if (p + 1 < y.length && y[p + 1].score < y[p].score && p++, y[p].score >= t.score) break;
+        y[c] = y[p], c = p;
       }
-      h[c] = r;
+      y[c] = t;
     }
-    return i;
+    return h;
   };
-  T({ id: v, score: 0, cost: 0 });
-  let g = 0;
-  for (; h.length && g++ < 5e4; ) {
-    const i = t();
-    if (i.cost !== w.get(i.id)) continue;
-    if (i.id === E) {
-      const x = [u(E)];
-      let f = E;
-      for (; f !== v; )
-        f = I.get(f), x.push(u(f));
-      return x.reverse(), x.filter((l, p) => {
-        const n = x[p - 1], M = x[p + 1];
-        return !n || !M || !(n.x === l.x && l.x === M.x || n.y === l.y && l.y === M.y);
+  E({ id: M, score: 0, cost: 0 });
+  let P = 0;
+  for (; y.length && P++ < 5e4; ) {
+    const h = T();
+    if (h.cost !== S.get(h.id)) continue;
+    if (h.id === b) {
+      const x = [w(b)];
+      let s = b;
+      for (; s !== M; )
+        s = O.get(s), x.push(w(s));
+      return x.reverse(), x.filter((a, o) => {
+        const f = x[o - 1], m = x[o + 1];
+        return !f || !m || !(f.x === a.x && a.x === m.x || f.y === a.y && a.y === m.y);
       });
     }
-    const r = u(i.id), c = i.id % o.length, a = Math.floor(i.id / o.length), S = [
-      c ? i.id - 1 : -1,
-      c + 1 < o.length ? i.id + 1 : -1,
-      a ? i.id - o.length : -1,
-      a + 1 < d.length ? i.id + o.length : -1
+    const t = w(h.id), c = h.id % r.length, p = Math.floor(h.id / r.length), d = [
+      c ? h.id - 1 : -1,
+      c + 1 < r.length ? h.id + 1 : -1,
+      p ? h.id - r.length : -1,
+      p + 1 < I.length ? h.id + r.length : -1
     ];
-    for (const x of S) {
+    for (const x of d) {
       if (x < 0) continue;
-      const f = u(x), l = i.cost + Math.abs(r.x - f.x) + Math.abs(r.y - f.y);
-      l >= (w.get(x) ?? 1 / 0) || !N(r, f, y) || (w.set(x, l), I.set(x, i.id), T({ id: x, cost: l, score: l + Math.abs(f.x - e.x) + Math.abs(f.y - e.y) }));
+      const s = w(x), a = h.cost + Math.abs(t.x - s.x) + Math.abs(t.y - s.y);
+      a >= (S.get(x) ?? 1 / 0) || !W(t, s, v) || (S.set(x, a), O.set(x, h.id), E({ id: x, cost: a, score: a + Math.abs(s.x - n.x) + Math.abs(s.y - n.y) }));
     }
   }
   throw new Error("Pinned graph positions cannot be routed within the layout budget");
 }
-function H(s, e) {
-  if (!e.positions?.length) return s;
-  const y = new Map(s.nodes.map((t) => [t.id, { ...t }])), o = /* @__PURE__ */ new Map();
-  for (const t of e.positions) {
-    if (!y.has(t.nodeId) || o.has(t.nodeId) || !Number.isFinite(t.x) || !Number.isFinite(t.y))
+function F(e, n, v) {
+  if (!n.positions?.length) return e;
+  const r = new Map(e.nodes.map((t) => [t.id, { ...t }])), I = /* @__PURE__ */ new Map();
+  for (const t of n.positions) {
+    if (!r.has(t.nodeId) || I.has(t.nodeId) || !Number.isFinite(t.x) || !Number.isFinite(t.y))
       throw new Error(`Invalid graph position: ${t.nodeId}`);
-    o.set(t.nodeId, t);
+    I.set(t.nodeId, t);
   }
-  const d = /* @__PURE__ */ new Map();
-  for (const t of y.values())
+  const w = /* @__PURE__ */ new Map();
+  for (const t of r.values())
     if (t.parentId) {
-      const g = d.get(t.parentId) ?? [];
-      g.push(t), d.set(t.parentId, g);
+      const c = w.get(t.parentId) ?? [];
+      c.push(t), w.set(t.parentId, c);
     }
-  const u = e.groupPadding ?? { top: 64, left: 28, right: 28, bottom: 28 }, v = (t, g, i) => {
-    const r = { x: t.x, y: t.y }, c = o.get(t.id);
-    t.x = c?.x ?? t.x + g, t.y = c?.y ?? t.y + i;
-    const a = d.get(t.id) ?? [];
-    for (const p of a) v(p, t.x - r.x, t.y - r.y);
-    if (!a.length) return;
-    const S = Math.min(...a.map((p) => p.x)) - u.left, x = Math.min(...a.map((p) => p.y)) - u.top;
-    if (c && (S < t.x || x < t.y))
+  const M = n.groupPadding ?? { top: 64, left: 28, right: 28, bottom: 28 }, b = n.positionMode === "preferred", S = new Map(v.map((t) => [t.id, t])), O = (t, c, p) => {
+    const d = { x: t.x, y: t.y }, x = I.get(t.id);
+    t.x = x?.x ?? t.x + c, t.y = x?.y ?? t.y + p;
+    const s = w.get(t.id) ?? [];
+    for (const l of s) O(l, t.x - d.x, t.y - d.y);
+    if (!s.length || b) return;
+    const a = Math.min(...s.map((l) => l.x)) - M.left, o = Math.min(...s.map((l) => l.y)) - M.top;
+    if (x && (a < t.x || o < t.y))
       throw new Error(`Pinned child lies outside group content: ${t.id}`);
     const f = Math.max(
       t.x + t.width,
-      ...a.map((p) => p.x + p.width + u.right)
-    ), l = Math.max(
+      ...s.map((l) => l.x + l.width + M.right)
+    ), m = Math.max(
       t.y + t.height,
-      ...a.map((p) => p.y + p.height + u.bottom)
+      ...s.map((l) => l.y + l.height + M.bottom)
     );
-    c || (t.x = Math.min(t.x, S), t.y = Math.min(t.y, x)), t.width = f - t.x, t.height = l - t.y;
+    x || (t.x = Math.min(t.x, a), t.y = Math.min(t.y, o)), t.width = f - t.x, t.height = m - t.y;
   };
-  for (const t of y.values()) t.parentId || v(t, 0, 0);
-  const E = s.edges.map((t) => {
-    const g = y.get(t.source), i = y.get(t.target), r = (n, M, m) => n.ports?.find((O) => O.id === M)?.side ?? m, c = g.x + g.width / 2 <= i.x + i.width / 2, a = (n, M) => {
-      const m = { x: n.x + n.width / 2, y: n.y + n.height / 2 };
-      return M === "NORTH" ? [
-        { x: m.x, y: n.y },
-        { x: m.x, y: n.y - 8 }
-      ] : M === "SOUTH" ? [
-        { x: m.x, y: n.y + n.height },
-        { x: m.x, y: n.y + n.height + 8 }
-      ] : M === "WEST" ? [
-        { x: n.x, y: m.y },
-        { x: n.x - 8, y: m.y }
+  for (const t of r.values()) t.parentId || O(t, 0, 0);
+  if (b) {
+    const t = Math.max(16, n.spacing ?? 64), c = (s, a, o) => {
+      s.x += a, s.y += o;
+      for (const f of w.get(s.id) ?? []) c(f, a, o);
+    }, p = (s) => {
+      const a = [];
+      for (const o of [...s].sort(
+        (f, m) => f.y - m.y || f.x - m.x || f.id.localeCompare(m.id)
+      )) {
+        const f = { x: o.x, y: o.y };
+        for (const i of [...a].sort((g, u) => g.x - u.x))
+          o.y < i.y + i.height + t && o.y + o.height + t > i.y && f.x < i.x + i.width + t && f.x + o.width + t > i.x && (f.x = i.x + i.width + t);
+        const m = { x: o.x, y: o.y };
+        for (const i of [...a].sort((g, u) => g.y - u.y))
+          o.x < i.x + i.width + t && o.x + o.width + t > i.x && m.y < i.y + i.height + t && m.y + o.height + t > i.y && (m.y = i.y + i.height + t);
+        const l = f.x - o.x < m.y - o.y ? f : m;
+        c(o, l.x - o.x, l.y - o.y), a.push(o);
+      }
+    }, d = (s) => {
+      const a = w.get(s.id) ?? [];
+      if (!a.length) return;
+      for (const g of a) d(g);
+      p(a);
+      const o = Math.max(12, M.left), f = Math.max(12, M.top), m = Math.max(12, M.right), l = Math.max(12, M.bottom), i = I.get(s.id);
+      s.x = Math.min(i?.x ?? 1 / 0, Math.min(...a.map((g) => g.x)) - o), s.y = Math.min(i?.y ?? 1 / 0, Math.min(...a.map((g) => g.y)) - f), s.width = Math.max(
+        S.get(s.id).width,
+        Math.max(...a.map((g) => g.x + g.width)) + m - s.x
+      ), s.height = Math.max(
+        S.get(s.id).height,
+        Math.max(...a.map((g) => g.y + g.height)) + l - s.y
+      );
+    }, x = [...r.values()].filter((s) => !s.parentId);
+    for (const s of x) d(s);
+    p(x);
+  }
+  const y = e.edges.map((t) => {
+    const c = r.get(t.source), p = r.get(t.target), d = (i, g, u) => i.ports?.find((k) => k.id === g)?.side ?? u, x = c.x + c.width / 2 <= p.x + p.width / 2, s = (i, g) => {
+      const u = { x: i.x + i.width / 2, y: i.y + i.height / 2 };
+      return g === "NORTH" ? [
+        { x: u.x, y: i.y },
+        { x: u.x, y: i.y - 8 }
+      ] : g === "SOUTH" ? [
+        { x: u.x, y: i.y + i.height },
+        { x: u.x, y: i.y + i.height + 8 }
+      ] : g === "WEST" ? [
+        { x: i.x, y: u.y },
+        { x: i.x - 8, y: u.y }
       ] : [
-        { x: n.x + n.width, y: m.y },
-        { x: n.x + n.width + 8, y: m.y }
+        { x: i.x + i.width, y: u.y },
+        { x: i.x + i.width + 8, y: u.y }
       ];
-    }, [S, x] = a(g, r(g, t.sourcePort, c ? "EAST" : "WEST")), [f, l] = a(
-      i,
-      r(i, t.targetPort, g === i ? "NORTH" : c ? "WEST" : "EAST")
-    ), p = [...y.values()].filter((n) => n.kind !== "group").map((n) => P(n, 4));
-    return { ...t, sections: [[S, ...k(x, l, p), f]] };
-  }), w = [...y.values()], I = E.flatMap((t) => t.sections.flat()), h = Math.min(...w.map((t) => t.x), ...I.map((t) => t.x)), T = Math.min(...w.map((t) => t.y), ...I.map((t) => t.y));
+    }, [a, o] = s(c, d(c, t.sourcePort, x ? "EAST" : "WEST")), [f, m] = s(
+      p,
+      d(p, t.targetPort, c === p ? "NORTH" : x ? "WEST" : "EAST")
+    ), l = [...r.values()].filter((i) => i.kind !== "group").map((i) => H(i, 4));
+    return { ...t, sections: [[a, ...A(o, m, l), f]] };
+  }), E = [...r.values()], T = y.flatMap((t) => t.sections.flat()), P = Math.min(...E.map((t) => t.x), ...T.map((t) => t.x)), h = Math.min(...E.map((t) => t.y), ...T.map((t) => t.y));
   return {
-    nodes: w,
-    edges: E,
+    nodes: E,
+    edges: y,
     bounds: {
-      x: h,
-      y: T,
-      width: Math.max(...w.map((t) => t.x + t.width), ...I.map((t) => t.x)) - h,
-      height: Math.max(...w.map((t) => t.y + t.height), ...I.map((t) => t.y)) - T
+      x: P,
+      y: h,
+      width: Math.max(...E.map((t) => t.x + t.width), ...T.map((t) => t.x)) - P,
+      height: Math.max(...E.map((t) => t.y + t.height), ...T.map((t) => t.y)) - h
     }
   };
 }
 export {
-  H as applyGraphPositions
+  F as applyGraphPositions
 };

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

@@ -46,10 +46,12 @@ export interface GraphLayout {
     bounds: GraphBounds;
 }
 export interface GraphLayoutOptions {
-    /** Absolute world positions. Descendants move with pinned groups; impossible containment or routing fails explicitly. */
+    /** Absolute world positions. Descendants move with their group. Invalid positions always fail. */
     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';
     direction?: 'RIGHT' | 'DOWN' | 'LEFT' | 'UP';
     spacing?: number;
     groupPadding?: {

package/dist/components/notes/NotesOverlay.js

@@ -1,6 +1,6 @@
 import { createComponent as n, insert as l, addEventListener as v, effect as C, setAttribute as F, Portal as d, memo as P, template as c, delegateEvents as L } from "solid-js/web";
 import { createMemo as R, createEffect as f, onCleanup as _, Show as s } from "solid-js";
-import { Motion as w } from "../../node_modules/.pnpm/solid-motionone@1.0.4_solid-js@1.9.15/node_modules/solid-motionone/dist/index.js";
+import { Motion as w } from "../../node_modules/.pnpm/solid-motionone@1.0.4_solid-js@1.9.17/node_modules/solid-motionone/dist/index.js";
 import { easing as B, duration as k } from "../../utils/animations.js";
 import { useOverlayMask as K } from "../../hooks/useOverlayMask.js";
 import { X as Z } from "../icons/index.js";

package/dist/components/workbench/WorkbenchFilterBar.js

@@ -1,6 +1,6 @@
 import { insert as m, createComponent as d, effect as K, setAttribute as I, memo as B, className as He, template as $, Dynamic as Ke, Portal as We, setStyleProperty as Ne, use as Ve, delegateEvents as Ge } from "solid-js/web";
 import { createSignal as de, onCleanup as p, createEffect as ee, createMemo as A, Show as R, For as te, Index as Ue } from "solid-js";
-import { Motion as W } from "../../node_modules/.pnpm/solid-motionone@1.0.4_solid-js@1.9.15/node_modules/solid-motionone/dist/index.js";
+import { Motion as W } from "../../node_modules/.pnpm/solid-motionone@1.0.4_solid-js@1.9.17/node_modules/solid-motionone/dist/index.js";
 import { easing as N, duration as V } from "../../utils/animations.js";
 import { Plus as qe } from "../icons/index.js";
 import { startHotInteraction as ze } from "../../utils/hotInteraction.js";

package/dist/components/workbench/WorkbenchLockButton.js

@@ -1,5 +1,5 @@
 import { insert as n, createComponent as c, memo as s, effect as d, setAttribute as u, template as k, delegateEvents as v } from "solid-js/web";
-import { Motion as m } from "../../node_modules/.pnpm/solid-motionone@1.0.4_solid-js@1.9.15/node_modules/solid-motionone/dist/index.js";
+import { Motion as m } from "../../node_modules/.pnpm/solid-motionone@1.0.4_solid-js@1.9.17/node_modules/solid-motionone/dist/index.js";
 import { easing as f, duration as h } from "../../utils/animations.js";
 import { Lock as g, Unlock as _ } from "../icons/index.js";
 var L = /* @__PURE__ */ k("<button type=button class=workbench-lock-button data-floe-surface=floating data-floe-canvas-interactive=true><span class=workbench-lock-button__icon>"), w = /* @__PURE__ */ k("<span class=workbench-lock-button__kbd>");

package/dist/components/workbench/WorkbenchOverlay.js

@@ -1,6 +1,6 @@
 import { createComponent as r, insert as l, template as s, delegateEvents as y } from "solid-js/web";
 import { Show as f } from "solid-js";
-import { Motion as i } from "../../node_modules/.pnpm/solid-motionone@1.0.4_solid-js@1.9.15/node_modules/solid-motionone/dist/index.js";
+import { Motion as i } from "../../node_modules/.pnpm/solid-motionone@1.0.4_solid-js@1.9.17/node_modules/solid-motionone/dist/index.js";
 import { easing as h, duration as c } from "../../utils/animations.js";
 import { useOverlayMask as b } from "../../hooks/useOverlayMask.js";
 import { X as v } from "../icons/index.js";

package/dist/node_modules/.pnpm/{solid-motionone@1.0.4_solid-js@1.9.15 → solid-motionone@1.0.4_solid-js@1.9.17}/node_modules/solid-motionone/dist/index.js

@@ -1,8 +1,8 @@
 import { createComponent as m, mergeProps as v, Dynamic as x } from "solid-js/web";
 import { createSignal as p, createContext as d, splitProps as P, useContext as l, createEffect as u, onCleanup as S, batch as c } from "solid-js";
-import { resolveFirst as E } from "../../../../@solid-primitives_refs@1.1.4_solid-js@1.9.15/node_modules/@solid-primitives/refs/dist/index.js";
-import { createSwitchTransition as y } from "../../../../@solid-primitives_transition-group@1.1.2_solid-js@1.9.15/node_modules/@solid-primitives/transition-group/dist/index.js";
-import { combineStyle as C } from "../../../../@solid-primitives_props@3.2.4_solid-js@1.9.15/node_modules/@solid-primitives/props/dist/combineProps.js";
+import { resolveFirst as E } from "../../../../@solid-primitives_refs@1.1.4_solid-js@1.9.17/node_modules/@solid-primitives/refs/dist/index.js";
+import { createSwitchTransition as y } from "../../../../@solid-primitives_transition-group@1.1.2_solid-js@1.9.17/node_modules/@solid-primitives/transition-group/dist/index.js";
+import { combineStyle as C } from "../../../../@solid-primitives_props@3.2.4_solid-js@1.9.17/node_modules/@solid-primitives/props/dist/combineProps.js";
 import { createMotionState as h, mountedStates as M } from "../../../../@motionone_dom@10.18.0/node_modules/@motionone/dom/dist/state/index.es.js";
 import { createStyles as T } from "../../../../@motionone_dom@10.18.0/node_modules/@motionone/dom/dist/animate/utils/style-object.es.js";
 var g = d(), D = (t) => {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@floegence/floe-webapp-core",
-  "version": "0.84.0",
+  "version": "0.85.1",
   "license": "MIT",
   "type": "module",
   "main": "./dist/index.js",
@@ -156,7 +156,7 @@
     "clean": "rm -rf dist *.tsbuildinfo"
   },
   "peerDependencies": {
-    "solid-js": "^1.8.0"
+    "solid-js": "^1.9.17"
   },
   "dependencies": {
     "clsx": "^2.1.1",
@@ -173,7 +173,7 @@
   },
   "devDependencies": {
     "@tailwindcss/vite": "^4.3.3",
-    "solid-js": "^1.9.15",
+    "solid-js": "^1.9.17",
     "tailwindcss": "^4.3.3",
     "typescript": "^5.9.3",
     "vite": "^7.3.6",