@floegence/floe-webapp-core 0.86.15 → 0.86.16

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
-};

package/dist/components/graph/positions.js

@@ -1,76 +0,0 @@
-import { routeGraphGeometry as v } from "./routing.js";
-function C(l, x, G) {
-  if (!x.positions?.length || x.positionMode === "compact")
-    return x.edgeClearance === void 0 ? l : v(l, x);
-  const f = new Map(l.nodes.map((t) => [t.id, { ...t }])), M = /* @__PURE__ */ new Map();
-  for (const t of x.positions) {
-    if (!f.has(t.nodeId) || M.has(t.nodeId) || !Number.isFinite(t.x) || !Number.isFinite(t.y))
-      throw new Error(`Invalid graph position: ${t.nodeId}`);
-    M.set(t.nodeId, t);
-  }
-  const y = /* @__PURE__ */ new Map();
-  for (const t of f.values())
-    if (t.parentId) {
-      const c = y.get(t.parentId) ?? [];
-      c.push(t), y.set(t.parentId, c);
-    }
-  const m = x.groupPadding ?? { top: 64, left: 28, right: 28, bottom: 28 }, u = x.positionMode === "preferred", I = new Map(G.map((t) => [t.id, t])), b = (t, c, d) => {
-    const g = { x: t.x, y: t.y }, p = M.get(t.id);
-    t.x = p?.x ?? t.x + c, t.y = p?.y ?? t.y + d;
-    const i = y.get(t.id) ?? [];
-    for (const o of i) b(o, t.x - g.x, t.y - g.y);
-    if (!i.length || u) return;
-    const a = Math.min(...i.map((o) => o.x)) - m.left, h = Math.min(...i.map((o) => o.y)) - m.top;
-    if (p && (a < t.x || h < t.y))
-      throw new Error(`Pinned child lies outside group content: ${t.id}`);
-    const e = Math.max(
-      t.x + t.width,
-      ...i.map((o) => o.x + o.width + m.right)
-    ), n = Math.max(
-      t.y + t.height,
-      ...i.map((o) => o.y + o.height + m.bottom)
-    );
-    p || (t.x = Math.min(t.x, a), t.y = Math.min(t.y, h)), t.width = e - t.x, t.height = n - t.y;
-  };
-  for (const t of f.values()) t.parentId || b(t, 0, 0);
-  if (u) {
-    const t = Math.max(16, x.spacing ?? 64), c = (i, a, h) => {
-      i.x += a, i.y += h;
-      for (const e of y.get(i.id) ?? []) c(e, a, h);
-    }, d = (i) => {
-      const a = [];
-      for (const h of [...i].sort(
-        (e, n) => e.y - n.y || e.x - n.x || e.id.localeCompare(n.id)
-      )) {
-        const e = { x: h.x, y: h.y };
-        for (const r of [...a].sort((s, w) => s.x - w.x))
-          h.y < r.y + r.height + t && h.y + h.height + t > r.y && e.x < r.x + r.width + t && e.x + h.width + t > r.x && (e.x = r.x + r.width + t);
-        const n = { x: h.x, y: h.y };
-        for (const r of [...a].sort((s, w) => s.y - w.y))
-          h.x < r.x + r.width + t && h.x + h.width + t > r.x && n.y < r.y + r.height + t && n.y + h.height + t > r.y && (n.y = r.y + r.height + t);
-        const o = e.x - h.x < n.y - h.y ? e : n;
-        c(h, o.x - h.x, o.y - h.y), a.push(h);
-      }
-    }, g = (i) => {
-      const a = y.get(i.id) ?? [];
-      if (!a.length) return;
-      for (const s of a) g(s);
-      d(a);
-      const h = Math.max(12, m.left), e = Math.max(12, m.top), n = Math.max(12, m.right), o = Math.max(12, m.bottom), r = M.get(i.id);
-      i.x = Math.min(r?.x ?? 1 / 0, Math.min(...a.map((s) => s.x)) - h), i.y = Math.min(r?.y ?? 1 / 0, Math.min(...a.map((s) => s.y)) - e), i.width = Math.max(
-        I.get(i.id).width,
-        Math.max(...a.map((s) => s.x + s.width)) + n - i.x
-      ), i.height = Math.max(
-        I.get(i.id).height,
-        Math.max(...a.map((s) => s.y + s.height)) + o - i.y
-      );
-    }, p = [...f.values()].filter((i) => !i.parentId);
-    for (const i of p) g(i);
-    d(p);
-  }
-  return v({ ...l, nodes: [...f.values()] }, x);
-}
-export {
-  C as applyGraphPositions,
-  v as routeGraphGeometry
-};