@floegence/floe-webapp-core 0.86.14 → 0.86.16

package/dist/remote-input.js

@@ -1,20 +1,20 @@
-function W(n) {
-  const { surface: E } = n, K = E.ownerDocument, u = K.defaultView;
-  if (!u) throw new Error("Remote input requires an attached document");
-  const t = K.createElement("textarea");
-  t.className = "floe-remote-input", t.setAttribute("aria-label", n.label), t.setAttribute("autocorrect", "off"), t.autocomplete = "off", t.autocapitalize = "off", t.spellcheck = !1, t.wrap = "off", t.disabled = !0, t.tabIndex = -1, K.body.append(t);
-  let l = null, g = 0, c = !1, S = !1, o = null, m = !1, s = null, h = "physical";
-  const w = /* @__PURE__ */ new Map(), f = /* @__PURE__ */ new Set(), M = /* @__PURE__ */ new Set();
-  let T = null;
-  const z = [];
-  function a(e, i, r) {
-    const k = r;
-    e.addEventListener(i, k), z.push(() => e.removeEventListener(i, k));
+function j(n) {
+  const { surface: A } = n, x = A.ownerDocument, c = x.defaultView;
+  if (!c) throw new Error("Remote input requires an attached document");
+  const i = x.createElement("textarea");
+  i.className = "floe-remote-input", i.setAttribute("aria-label", n.label), i.setAttribute("autocorrect", "off"), i.autocomplete = "off", i.autocapitalize = "off", i.spellcheck = !1, i.wrap = "off", i.disabled = !0, i.tabIndex = -1, x.body.append(i);
+  let l = null, K = 0, f = !1, R = !1, o = null, h = !1, a = null, w = "physical";
+  const k = /* @__PURE__ */ new Map(), u = /* @__PURE__ */ new Set(), C = /* @__PURE__ */ new Set(), L = /* @__PURE__ */ new Set();
+  let $ = null;
+  const V = [];
+  function s(e, t, r) {
+    const d = r;
+    e.addEventListener(t, d), V.push(() => e.removeEventListener(t, d));
   }
-  const b = (e) => e.code || e.key, x = (e, i) => ({
+  const b = (e) => e.code || e.key, M = (e, t) => ({
     key: e.key,
     code: e.code,
-    pressed: i,
+    pressed: t,
     repeat: e.repeat,
     location: e.location,
     shiftKey: e.shiftKey,
@@ -22,139 +22,147 @@ function W(n) {
     altKey: e.altKey,
     metaKey: e.metaKey
   });
-  function C(e) {
-    S !== e && (S = e, n.onKeyboardVisibilityChange?.(e));
-  }
-  function d() {
-    const e = E.getBoundingClientRect(), i = u.visualViewport, r = Math.max(e.left, i?.offsetLeft ?? 0), k = Math.max(e.top, i?.offsetTop ?? 0), B = Math.min(e.right, (i?.offsetLeft ?? 0) + (i?.width ?? u.innerWidth)), P = Math.min(e.bottom, (i?.offsetTop ?? 0) + (i?.height ?? u.innerHeight)), R = Math.max(1, Math.min(320, B - r - 8));
-    t.style.maxWidth = `${R}px`;
-    const D = t.getBoundingClientRect(), $ = T?.x ?? r + 12, N = T?.y ?? k + 12;
-    t.style.left = `${Math.max(r, Math.min($, B - D.width - 4))}px`, t.style.top = `${Math.max(k, Math.min(N, P - D.height - 4))}px`;
+  function T(e) {
+    R !== e && (R = e, n.onKeyboardVisibilityChange?.(e));
   }
   function p() {
-    t.value = "", delete t.dataset.composing, s = null;
+    const e = A.getBoundingClientRect(), t = c.visualViewport, r = Math.max(e.left, t?.offsetLeft ?? 0), d = Math.max(e.top, t?.offsetTop ?? 0), y = Math.min(e.right, (t?.offsetLeft ?? 0) + (t?.width ?? c.innerWidth)), I = Math.min(e.bottom, (t?.offsetTop ?? 0) + (t?.height ?? c.innerHeight)), P = Math.max(1, Math.min(320, y - r - 8));
+    i.style.maxWidth = `${P}px`;
+    const B = i.getBoundingClientRect(), N = $?.x ?? r + 12, W = $?.y ?? d + 12;
+    i.style.left = `${Math.max(r, Math.min(N, y - B.width - 4))}px`, i.style.top = `${Math.max(d, Math.min(W, I - B.height - 4))}px`;
+  }
+  function m() {
+    i.value = "", delete i.dataset.composing, a = null;
   }
-  function A() {
-    const e = l, i = f.size > 0;
-    f.clear(), w.clear(), e !== null && i && n.release(e);
+  function E() {
+    const e = l, t = u.size > 0;
+    u.clear(), k.clear(), C.clear(), e !== null && t && n.release(e);
   }
-  function y() {
-    g++, o && (o.cancelled = !0), m = !0, p(), A(), o && K.activeElement === t && t.blur();
+  function g() {
+    K++, o && (o.cancelled = !0), h = !0, m(), E(), o && x.activeElement === i && i.blur();
   }
-  function V(e) {
-    !e || l === null || c || (h === "text" && f.size && (f.clear(), n.release(l)), n.commitText(e, l));
+  function S(e) {
+    !e || l === null || f || (w === "text" && u.size && (u.clear(), C.clear(), n.release(l)), n.commitText(e, l));
   }
-  function L(e) {
+  function z(e) {
     if (l !== null) {
-      if (h === "text")
-        for (const [i, r] of w)
-          f.has(i) || (f.add(i), n.sendKey(r, l));
-      f.add(e.code || e.key), n.sendKey(e, l);
+      if (!/^(Shift|Control|Alt|Meta)(Left|Right)$/.test(e.code))
+        for (const [t, r] of [
+          ["Shift", e.shiftKey],
+          ["Control", e.ctrlKey],
+          ["Alt", e.altKey],
+          ["Meta", e.metaKey]
+        ]) {
+          if (!r || [...u].some((y) => y === `${t}Left` || y === `${t}Right`)) continue;
+          const d = [...k.values()].find((y) => y.code === `${t}Left` || y.code === `${t}Right`) ?? { ...e, key: t, code: `${t}Left`, pressed: !0, repeat: !1, location: 1 };
+          u.add(d.code), k.has(d.code) || C.add(d.code), n.sendKey(d, l);
+        }
+      u.add(e.code || e.key), n.sendKey(e, l);
     }
   }
-  function F(e) {
+  function D(e) {
     if (l === null) return;
-    const i = { key: e, code: e, pressed: !0, repeat: !1, shiftKey: !1, ctrlKey: !1, altKey: !1, metaKey: !1, location: 0 }, r = l;
-    n.sendKey(i, r), l === r && n.sendKey({ ...i, pressed: !1 }, r);
+    const t = { key: e, code: e, pressed: !0, repeat: !1, shiftKey: !1, ctrlKey: !1, altKey: !1, metaKey: !1, location: 0 }, r = l;
+    n.sendKey(t, r), l === r && n.sendKey({ ...t, pressed: !1 }, r);
   }
-  function I(e) {
-    if (l === null || c) {
-      p();
+  function F(e) {
+    if (l === null || f) {
+      m();
       return;
     }
-    if (o?.cancelled || o && o.epoch !== g) {
-      p();
+    if (o?.cancelled || o && o.epoch !== K) {
+      m();
       return;
     }
     if (e.isComposing) {
-      o ??= { epoch: g, committed: !1, cancelled: !1 }, t.dataset.composing = "true", d();
+      o ??= { epoch: K, committed: !1, cancelled: !1 }, i.dataset.composing = "true", p();
       return;
     }
     if (o) {
-      !o.committed && t.value && (o.committed = !0, V(t.value)), p();
+      !o.committed && i.value && (o.committed = !0, S(i.value)), m();
       return;
     }
-    if (m || e.inputType === "insertFromComposition") {
-      m = !1, p();
+    if (h || e.inputType === "insertFromComposition") {
+      h = !1, m();
       return;
     }
-    const i = t.value;
-    if (h === "physical" && s && i === s.key && !s.altKey && i.length === 1) {
-      const r = s;
-      f.add(r.code || r.key), n.sendKey(r, l);
-    } else V(i);
-    p();
+    const t = i.value;
+    w === "physical" && a && t === a.key && !a.altKey && t.length === 1 ? z(a) : S(t), m();
   }
-  return a(t, "keydown", (e) => {
-    if (!(l === null || c)) {
+  return s(i, "keydown", (e) => {
+    if (!(l === null || f)) {
       if (e.stopPropagation(), o?.cancelled && !e.isComposing && e.key !== "Process" && e.keyCode !== 229 && (o = null), e.isComposing || o || e.key === "Process" || e.keyCode === 229) {
-        M.add(b(e)), s = null;
+        L.add(b(e)), a = null;
         return;
       }
-      if (M.delete(b(e)), m = !1, n.clipboard?.(e, l)) {
-        s = null;
+      if (L.delete(b(e)), h = !1, n.clipboard?.(e, l)) {
+        a = null;
         return;
       }
-      if (h === "text" && /^(Shift|Control|Alt|Meta)(Left|Right)$/.test(e.code)) {
-        w.set(b(e), x(e, !0));
+      if (w === "text" && /^(Shift|Control|Alt|Meta)(Left|Right)$/.test(e.code)) {
+        k.set(b(e), M(e, !0));
         return;
       }
       if (e.key === "Dead" || e.key === "Unidentified") {
-        s = null;
+        a = null;
         return;
       }
       if (Array.from(e.key).length === 1 && !e.metaKey && (!e.ctrlKey || e.getModifierState("AltGraph"))) {
-        s = x(e, !0);
+        a = M(e, !0);
         return;
       }
-      e.preventDefault(), L(x(e, !0));
+      e.preventDefault(), z(M(e, !0));
+    }
+  }), s(i, "keyup", (e) => {
+    if (e.stopPropagation(), a = null, k.delete(b(e)), !L.delete(b(e)) && (l !== null && u.delete(b(e)) && n.sendKey(M(e, !1), l), l !== null && ![...u].some((t) => !/^(Shift|Control|Alt|Meta)(Left|Right)$/.test(t)))) {
+      for (const t of C)
+        u.delete(t), n.sendKey({ ...M(e, !1), code: t, key: t.replace(/Left$/, ""), location: 1 }, l);
+      C.clear();
     }
-  }), a(t, "keyup", (e) => {
-    e.stopPropagation(), s = null, w.delete(b(e)), !M.delete(b(e)) && l !== null && f.delete(b(e)) && n.sendKey(x(e, !1), l);
-  }), a(t, "beforeinput", (e) => {
-    if (l === null || c) {
+  }), s(i, "beforeinput", (e) => {
+    if (l === null || f) {
       e.preventDefault();
       return;
     }
     if (e.isComposing || o || e.inputType === "insertCompositionText" || e.inputType === "deleteCompositionText" || e.inputType === "insertFromComposition") return;
-    m = !1;
+    h = !1;
     const r = { deleteContentBackward: "Backspace", deleteContentForward: "Delete", insertLineBreak: "Enter", insertParagraph: "Enter" }[e.inputType];
-    r && (e.preventDefault(), p(), F(r));
-  }), a(t, "input", I), a(t, "compositionstart", () => {
-    o = { epoch: g, committed: !1, cancelled: l === null }, m = !1, s = null, t.dataset.composing = "true", d();
-  }), a(t, "compositionend", (e) => {
-    const i = o;
-    o = null, m = !0, p(), i && !i.cancelled && !i.committed && i.epoch === g && V(e.data);
-  }), a(t, "blur", () => {
-    y(), C(!1);
-  }), a(u, "blur", y), a(u, "pagehide", y), a(u, "resize", d), u.visualViewport && (a(u.visualViewport, "resize", d), a(u.visualViewport, "scroll", d)), d(), {
-    element: t,
+    r && (e.preventDefault(), m(), D(r));
+  }), s(i, "input", F), s(i, "compositionstart", () => {
+    o = { epoch: K, committed: !1, cancelled: l === null }, h = !1, a = null, i.dataset.composing = "true", p();
+  }), s(i, "compositionend", (e) => {
+    const t = o;
+    o = null, h = !0, m(), t && !t.cancelled && !t.committed && t.epoch === K && S(e.data);
+  }), s(i, "blur", () => {
+    g(), T(!1);
+  }), s(c, "blur", g), s(c, "pagehide", g), s(c, "resize", p), c.visualViewport && (s(c.visualViewport, "resize", p), s(c.visualViewport, "scroll", p)), p(), {
+    element: i,
     bindTarget(e) {
-      c || Object.is(l, e) || (y(), l = e, t.disabled = e === null);
+      f || Object.is(l, e) || (g(), l = e, i.disabled = e === null);
     },
     setTextInputMode(e) {
-      c || e === h || (y(), h = e);
+      f || e === w || (g(), w = e);
     },
-    setAnchor(e, i) {
-      !Number.isFinite(e) || !Number.isFinite(i) || (T = { x: e, y: i }, d());
+    setAnchor(e, t) {
+      !Number.isFinite(e) || !Number.isFinite(t) || ($ = { x: e, y: t }, p());
     },
     focus() {
-      l === null || c || (t.focus({ preventScroll: !0 }), d());
+      l === null || f || (i.focus({ preventScroll: !0 }), p());
     },
     setKeyboardVisible(e) {
-      e && l !== null && !c ? (t.focus({ preventScroll: !0 }), C(!0), d()) : (t.blur(), C(!1));
+      e && l !== null && !f ? (i.focus({ preventScroll: !0 }), T(!0), p()) : (i.blur(), T(!1));
     },
-    release: A,
-    reset: y,
+    release: E,
+    reset: g,
     dispose() {
-      if (!c) {
-        y(), c = !0, l = null;
-        for (const e of z) e();
-        t.remove(), C(!1);
+      if (!f) {
+        g(), f = !0, l = null;
+        for (const e of V) e();
+        i.remove(), T(!1);
       }
     }
   };
 }
 export {
-  W as createRemoteInput
+  j as createRemoteInput
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@floegence/floe-webapp-core",
-  "version": "0.86.14",
+  "version": "0.86.16",
   "license": "MIT",
   "type": "module",
   "main": "./dist/index.js",

package/dist/_virtual/_commonjs-dynamic-modules.js

@@ -1,6 +0,0 @@
-function r(o) {
-  throw new Error('Could not dynamically require "' + o + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
-}
-export {
-  r as commonjsRequire
-};

package/dist/_virtual/_commonjsHelpers.js

@@ -1,6 +0,0 @@
-function e(t) {
-  return t && t.__esModule && Object.prototype.hasOwnProperty.call(t, "default") ? t.default : t;
-}
-export {
-  e as getDefaultExportFromCjs
-};

package/dist/_virtual/elk-api.js

@@ -1,7 +0,0 @@
-import { getDefaultExportFromCjs as r } from "./_commonjsHelpers.js";
-import { __require as e } from "../node_modules/.pnpm/elkjs@0.12.0/node_modules/elkjs/lib/elk-api.js";
-var o = e();
-const i = /* @__PURE__ */ r(o);
-export {
-  i as default
-};

package/dist/_virtual/elk-api2.js

@@ -1,4 +0,0 @@
-var e = { exports: {} };
-export {
-  e as __module
-};

package/dist/components/graph/layout.js

@@ -1,160 +0,0 @@
-import { applyGraphPositions as G } from "./positions.js";
-import { computePackedGraphLayout as k } from "./packing.js";
-function $(d) {
-  const r = /* @__PURE__ */ new Set(), c = (t) => {
-    if (!t || r.has(t)) throw new Error(`Duplicate or empty graph ID: ${t}`);
-    r.add(t);
-  }, i = new Map(d.nodes.map((t) => [t.id, t]));
-  for (const t of d.nodes) {
-    if (c(t.id), ![t.width, t.height].every((n) => Number.isFinite(n) && n > 0))
-      throw new Error(`Invalid dimensions for graph node: ${t.id}`);
-    for (const n of t.ports ?? []) c(n.id);
-    const s = /* @__PURE__ */ new Set([t.id]);
-    let o = t.parentId;
-    for (; o !== void 0; ) {
-      const n = i.get(o);
-      if (!n || n.kind !== "group")
-        throw new Error(`Invalid parent for graph node: ${t.id}`);
-      if (s.has(o)) throw new Error(`Cyclic graph containment: ${t.id}`);
-      s.add(o), o = n.parentId;
-    }
-  }
-  for (const t of d.edges) {
-    c(t.id);
-    for (const [s, o] of [
-      [t.source, t.sourcePort],
-      [t.target, t.targetPort]
-    ]) {
-      const n = i.get(s);
-      if (!n || o !== void 0 && !n.ports?.some((h) => h.id === o))
-        throw new Error(`Invalid endpoint for graph edge: ${t.id}`);
-    }
-  }
-}
-async function P(d, r, c) {
-  if ($(d), r.edgeClearance !== void 0 && (!Number.isFinite(r.edgeClearance) || r.edgeClearance < 0))
-    throw new Error("Graph edge clearance must be finite and nonnegative");
-  const i = N(d, r);
-  if (r.aspectRatio !== void 0 && (!Number.isFinite(r.aspectRatio) || r.aspectRatio <= 0))
-    throw new Error("Graph layout aspect ratio must be finite and positive");
-  const t = r.groupPadding ?? { top: 64, right: 28, bottom: 28, left: 28 };
-  if (![...Object.values(t), r.spacing ?? 64].every((e) => Number.isFinite(e) && e >= 0))
-    throw new Error("Graph layout spacing must be finite and nonnegative");
-  if (r.layers && (O(d, r.layers), r.positionMode === "fixed" && r.positions?.length))
-    throw new Error("Fixed positions cannot be combined with graph layers");
-  if (r.aspectRatio !== void 0 || r.layers)
-    return k(i, r, c);
-  const s = /* @__PURE__ */ new Map();
-  for (const e of i.nodes)
-    s.set(e.id, {
-      id: e.id,
-      width: e.width,
-      height: e.height,
-      ...e.kind === "group" ? { children: [] } : {},
-      ports: e.ports?.map((a) => ({
-        id: a.id,
-        width: 1,
-        height: 1,
-        layoutOptions: { "elk.port.side": a.side }
-      })),
-      layoutOptions: {
-        "elk.portConstraints": "FIXED_ORDER",
-        "elk.padding": `[top=${t.top},left=${t.left},bottom=${t.bottom},right=${t.right}]`
-      }
-    });
-  const o = [];
-  for (const e of i.nodes)
-    (e.parentId ? s.get(e.parentId).children : o).push(s.get(e.id));
-  const n = /* @__PURE__ */ new Set([
-    ...i.nodes.flatMap((e) => [e.id, ...(e.ports ?? []).map((a) => a.id)]),
-    ...i.edges.map((e) => e.id)
-  ]);
-  let h = "$graph";
-  for (; n.has(h); ) h += "$";
-  const p = await c.layout({
-    id: h,
-    children: o,
-    edges: i.edges.map((e) => ({
-      id: e.id,
-      sources: [e.sourcePort ?? e.source],
-      targets: [e.targetPort ?? e.target]
-    })),
-    layoutOptions: {
-      "elk.algorithm": "layered",
-      "elk.direction": r.direction ?? "RIGHT",
-      "elk.edgeRouting": "ORTHOGONAL",
-      "elk.hierarchyHandling": "INCLUDE_CHILDREN",
-      "elk.spacing.nodeNode": String(r.spacing ?? 64),
-      "elk.layered.spacing.nodeNodeBetweenLayers": String(r.spacing ?? 64),
-      "elk.layered.considerModelOrder.strategy": "NODES_AND_EDGES",
-      "elk.randomSeed": "1"
-    }
-  }), y = /* @__PURE__ */ new Map(), E = /* @__PURE__ */ new Map(), x = (e) => {
-    for (const a of e.edges ?? []) {
-      const g = a.container ?? e.id, f = y.get(g) ?? { x: 0, y: 0 };
-      E.set(
-        a.id,
-        (a.sections ?? []).map(
-          (l) => [l.startPoint, ...l.bendPoints ?? [], l.endPoint].map((m) => ({
-            x: m.x + f.x,
-            y: m.y + f.y
-          }))
-        )
-      );
-    }
-    for (const a of e.children ?? []) x(a);
-  }, v = (e, a, g) => {
-    const f = a + (e.x ?? 0), l = g + (e.y ?? 0);
-    y.set(e.id, { x: f, y: l, width: e.width ?? 0, height: e.height ?? 0 });
-    for (const m of e.children ?? []) v(m, f, l);
-  };
-  for (const e of p.children ?? []) v(e, 0, 0);
-  x(p);
-  const w = (!r.positions?.length || r.positionMode === "compact") && r.anchor && y.get(r.anchor.nodeId), u = w ? r.anchor.position.x - w.x : 0, I = w ? r.anchor.position.y - w.y : 0, b = i.nodes.map((e) => {
-    const a = y.get(e.id);
-    return { ...e, ...a, x: a.x + u, y: a.y + I };
-  });
-  return G(
-    {
-      nodes: b,
-      edges: i.edges.map((e) => ({
-        ...e,
-        sections: (E.get(e.id) ?? []).map(
-          (a) => a.map((g) => ({ x: g.x + u, y: g.y + I }))
-        )
-      })),
-      bounds: { x: u, y: I, width: p.width ?? 0, height: p.height ?? 0 }
-    },
-    r,
-    i.nodes
-  );
-}
-function N(d, r) {
-  if (r.positionMode !== "compact" || !r.positions?.length) return d;
-  const c = r.direction ?? "RIGHT", i = new Map(
-    r.positions.map((o) => [
-      o.nodeId,
-      c === "RIGHT" || c === "LEFT" ? o.y : o.x
-    ])
-  ), t = new Map(d.nodes.map((o, n) => [o.id, n]));
-  return { nodes: [...d.nodes].sort((o, n) => {
-    const h = (o.parentId ?? "").localeCompare(n.parentId ?? ""), p = r.layers && !o.parentId && !n.parentId ? 0 : (i.get(o.id) ?? 1 / 0) - (i.get(n.id) ?? 1 / 0);
-    return h || p || t.get(o.id) - t.get(n.id);
-  }), edges: d.edges };
-}
-function O(d, r) {
-  const c = new Map(d.nodes.map((t) => [t.id, t])), i = /* @__PURE__ */ new Set();
-  for (const [t, s] of r.entries()) {
-    if (!s.length) throw new Error(`Graph layer must not be empty: ${t}`);
-    for (const o of s) {
-      const n = c.get(o);
-      if (!n || n.parentId) throw new Error(`Graph layer object must be a root node: ${o}`);
-      if (i.has(o)) throw new Error(`Graph object appears in multiple layers: ${o}`);
-      i.add(o);
-    }
-  }
-}
-export {
-  P as computeGraphLayout,
-  $ as validateGraphInput
-};

package/dist/components/graph/packing.js

@@ -1,158 +0,0 @@
-import { applyGraphPositions as $ } from "./positions.js";
-import { routeGraphGeometry as P } from "./routing.js";
-async function j(f, s, S) {
-  const y = new Map(f.nodes.map((e) => [e.id, { ...e, x: 0, y: 0 }])), O = new Map(f.nodes.map((e, d) => [e.id, d])), m = /* @__PURE__ */ new Map();
-  for (const e of y.values()) {
-    const d = m.get(e.parentId) ?? [];
-    d.push(e), m.set(e.parentId, d);
-  }
-  const p = /* @__PURE__ */ new Set([
-    ...f.nodes.flatMap((e) => [e.id, ...(e.ports ?? []).map((d) => d.id)]),
-    ...f.edges.map((e) => e.id)
-  ]);
-  let T = "$packed";
-  for (; p.has(T); ) T += "$";
-  const k = s.groupPadding ?? { top: 64, right: 28, bottom: 28, left: 28 }, E = s.direction ?? "RIGHT", w = new Map(
-    (s.positions ?? []).map((e) => [
-      e.nodeId,
-      E === "RIGHT" || E === "LEFT" ? e.y : e.x
-    ])
-  ), I = (e, d, i) => {
-    e.x += d, e.y += i;
-    for (const v of m.get(e.id) ?? []) I(v, d, i);
-  }, x = (e, d) => {
-    let i = y.get(e);
-    for (; i && i.parentId !== d; )
-      i = i.parentId ? y.get(i.parentId) : void 0;
-    return i;
-  }, G = async (e) => {
-    const d = [...m.get(e) ?? []];
-    (e !== void 0 || !s.layers) && d.sort(
-      (o, a) => (w.get(o.id) ?? 1 / 0) - (w.get(a.id) ?? 1 / 0) || O.get(o.id) - O.get(a.id)
-    );
-    for (const o of d) {
-      if (!m.has(o.id)) continue;
-      const a = await G(o.id);
-      o.width = Math.max(o.width, a.width), o.height = Math.max(o.height, a.height);
-    }
-    if (!d.length) return { width: 0, height: 0 };
-    if (e === void 0 && s.layers)
-      return z(d, f, s, x, I);
-    const i = /* @__PURE__ */ new Map();
-    for (const o of f.edges) {
-      const a = x(o.source, e), M = x(o.target, e);
-      if (!a || !M || a.id === M.id) continue;
-      const H = JSON.stringify([a.id, M.id]);
-      i.has(H) || i.set(H, { id: o.id, sources: [a.id], targets: [M.id] });
-    }
-    const v = await S.layout({
-      id: e ?? T,
-      children: d.map((o) => ({ id: o.id, width: o.width, height: o.height })),
-      edges: [...i.values()],
-      layoutOptions: {
-        "elk.algorithm": i.size ? "layered" : "rectpacking",
-        "elk.direction": E,
-        "elk.edgeRouting": "ORTHOGONAL",
-        "elk.separateConnectedComponents": "true",
-        ...s.aspectRatio !== void 0 ? { "elk.aspectRatio": String(s.aspectRatio) } : {},
-        "elk.spacing.componentComponent": String(s.spacing ?? 64),
-        "elk.spacing.nodeNode": String(s.spacing ?? 64),
-        "elk.layered.spacing.nodeNodeBetweenLayers": String(s.spacing ?? 64),
-        "elk.layered.considerModelOrder.strategy": "NODES_AND_EDGES",
-        "elk.padding": e ? `[top=${k.top},left=${k.left},bottom=${k.bottom},right=${k.right}]` : "[top=12,left=12,bottom=12,right=12]",
-        "elk.randomSeed": "1"
-      }
-    });
-    for (const o of v.children ?? []) {
-      const a = y.get(o.id);
-      I(a, (o.x ?? 0) - a.x, (o.y ?? 0) - a.y);
-    }
-    return { width: v.width ?? 0, height: v.height ?? 0 };
-  }, u = await G(), R = (!s.positions?.length || s.positionMode === "compact" || s.layers) && s.anchor && y.get(s.anchor.nodeId);
-  if (R) {
-    const e = s.anchor.position.x - R.x, d = s.anchor.position.y - R.y;
-    for (const i of m.get(void 0) ?? []) I(i, e, d);
-  }
-  const C = {
-    nodes: [...y.values()],
-    edges: f.edges.map((e) => ({ ...e, sections: [] })),
-    bounds: { x: 0, y: 0, ...u }
-  };
-  return s.positions?.length && s.positionMode !== "compact" && !s.layers ? $(C, s, f.nodes) : P(C, s);
-}
-function z(f, s, S, y, O) {
-  const m = S.direction ?? "RIGHT", p = m === "RIGHT" || m === "LEFT", T = m === "RIGHT" || m === "DOWN", k = new Map(f.map((t, n) => [t.id, n])), E = new Map(
-    (S.positions ?? []).filter((t) => k.has(t.nodeId)).map((t) => [t.nodeId, p ? t.y : t.x])
-  ), w = (t, n) => k.get(t) - k.get(n) || t.localeCompare(n), I = (t, n) => (E.get(t) ?? 1 / 0) - (E.get(n) ?? 1 / 0) || w(t, n), x = new Map(f.map((t) => [t.id, /* @__PURE__ */ new Set()]));
-  for (const t of s.edges) {
-    const n = y(t.source, void 0)?.id, r = y(t.target, void 0)?.id;
-    n && r && n !== r && (x.get(n)?.add(r), x.get(r)?.add(n));
-  }
-  const G = S.layers ?? [], u = /* @__PURE__ */ new Map();
-  G.forEach((t, n) => t.forEach((r) => u.set(r, n)));
-  const R = new Set(f.map((t) => t.id)), C = [];
-  for (const t of [...R].sort(w)) {
-    if (!R.has(t)) continue;
-    const n = [], r = [t];
-    R.delete(t);
-    for (let c = 0; c < r.length; c++) {
-      const g = r[c];
-      n.push(g);
-      for (const h of [...x.get(g)].sort(w))
-        R.delete(h) && r.push(h);
-    }
-    C.push(n);
-  }
-  let e = G.length;
-  for (const t of C) {
-    const n = t.filter((g) => u.has(g));
-    if (!n.length) {
-      t.sort(w).forEach((g) => u.set(g, e)), e++;
-      continue;
-    }
-    const r = /* @__PURE__ */ new Map(), c = [...n].sort((g, h) => u.get(g) - u.get(h) || w(g, h));
-    for (const g of c) r.set(g, 0);
-    for (let g = 0; g < c.length; g++) {
-      const h = c[g];
-      for (const l of [...x.get(h)].sort(w))
-        r.has(l) || (r.set(l, r.get(h) + 1), u.set(l, u.get(h)), c.push(l));
-    }
-  }
-  const d = Math.max(G.length, e), i = Array.from({ length: d }, () => []);
-  for (const t of f) i[u.get(t.id)].push(t);
-  for (const t of i) t.sort((n, r) => I(n.id, r.id));
-  const v = (t, n) => {
-    const r = new Map(i[n].map((h, l) => [h.id, l])), c = new Map(i[t].map((h, l) => [h.id, l])), g = (h) => {
-      const l = [...x.get(h) ?? []].flatMap((N) => {
-        const b = r.get(N);
-        return u.get(N) === n && b !== void 0 ? [b] : [];
-      });
-      return l.length ? l.reduce((N, b) => N + b, 0) / l.length : c.get(h);
-    };
-    i[t].sort((h, l) => g(h.id) - g(l.id) || I(h.id, l.id));
-  };
-  for (let t = 1; t < i.length; t++) v(t, t - 1);
-  for (let t = i.length - 2; t >= 0; t--) v(t, t + 1);
-  const o = S.spacing ?? 64;
-  let a = 0, M = 0;
-  const H = [], L = [];
-  for (const t of i) {
-    let n = 0;
-    const r = Math.max(0, ...t.map((c) => p ? c.width : c.height));
-    H.push(a), L.push(r);
-    for (const c of t) {
-      const g = a + (r - (p ? c.width : c.height)) / 2, h = p ? g : n, l = p ? n : g;
-      O(c, h - c.x, l - c.y), n += (p ? c.height : c.width) + o;
-    }
-    M = Math.max(M, Math.max(0, n - o)), a += r + o;
-  }
-  if (a = Math.max(0, a - o), !T)
-    for (const t of f) {
-      const n = u.get(t.id), c = a - H[n] - L[n] + (L[n] - (p ? t.width : t.height)) / 2;
-      O(t, p ? c - t.x : 0, p ? 0 : c - t.y);
-    }
-  return p ? { width: a, height: M } : { width: M, height: a };
-}
-export {
-  j as computePackedGraphLayout
-};