@notmrabhi/flowforge 0.1.14 → 0.1.16

package/dist/templateSkeletons-CCXJ0W5L.js

@@ -1,2804 +0,0 @@
-import { jsxs as w, jsx as f, Fragment as Lt } from "react/jsx-runtime";
-import P, { useRef as pt, useEffect as ie, useState as j, useMemo as W, useCallback as Y } from "react";
-import _r, { useStore as Tr, useReactFlow as Nr, Background as Cr, Controls as Sr, MiniMap as Ir } from "reactflow";
-import "reactflow/dist/style.css";
-import { e as Or, G as Mr, E as jr, P as Fr, L as zr, d as Rr, f as Dr } from "./GatewayBranchEdge-DH-aHDPm.js";
-import { Dialog as Lr, Box as te, Drawer as Ar, IconButton as bt, Button as yt } from "@mui/material";
-import { MdClose as Pr, MdCalendarToday as Br, MdBolt as Wr, MdArrowBack as Gr, MdChevronRight as At, MdAddCircleOutline as $r, MdApps as Yr, MdErrorOutline as Kr, MdAccountTree as Ur, MdAdd as Vr, MdSearch as Hr, MdCategory as qr, MdCancel as Pt, MdError as Bt, MdCheckCircle as Wt, MdPlayArrow as Gt, MdHourglassEmpty as Xr, MdSchedule as mt, MdPerson as Jr, MdExpandLess as Zr, MdExpandMore as Qr } from "react-icons/md";
-import { GrTrigger as en } from "react-icons/gr";
-import { BiCollapse as tn, BiExpand as rn } from "react-icons/bi";
-import { b as nn } from "./index-CxVqPygT.js";
-import { m as on } from "./messages-CO299wPN.js";
-import { T as sn, E as J } from "./canvasTokens-CAD6G24b.js";
-var $t = Object.defineProperty, ln = (e, t, r) => t in e ? $t(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r, an = (e, t) => {
-  for (var r in t) $t(e, r, { get: t[r], enumerable: !0 });
-}, dn = (e, t, r) => ln(e, t + "", r), Yt = {};
-an(Yt, { Graph: () => G, alg: () => Ve, json: () => Ut, version: () => fn });
-var cn = Object.defineProperty, Kt = (e, t) => {
-  for (var r in t) cn(e, r, { get: t[r], enumerable: !0 });
-}, G = class {
-  constructor(e) {
-    this._isDirected = !0, this._isMultigraph = !1, this._isCompound = !1, this._nodes = {}, this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {}, this._nodeCount = 0, this._edgeCount = 0, this._defaultNodeLabelFn = () => {
-    }, this._defaultEdgeLabelFn = () => {
-    }, e && (this._isDirected = "directed" in e ? e.directed : !0, this._isMultigraph = "multigraph" in e ? e.multigraph : !1, this._isCompound = "compound" in e ? e.compound : !1), this._isCompound && (this._parent = {}, this._children = {}, this._children["\0"] = {});
-  }
-  isDirected() {
-    return this._isDirected;
-  }
-  isMultigraph() {
-    return this._isMultigraph;
-  }
-  isCompound() {
-    return this._isCompound;
-  }
-  setGraph(e) {
-    return this._label = e, this;
-  }
-  graph() {
-    return this._label;
-  }
-  setDefaultNodeLabel(e) {
-    return typeof e != "function" ? this._defaultNodeLabelFn = () => e : this._defaultNodeLabelFn = e, this;
-  }
-  nodeCount() {
-    return this._nodeCount;
-  }
-  nodes() {
-    return Object.keys(this._nodes);
-  }
-  sources() {
-    return this.nodes().filter((e) => Object.keys(this._in[e]).length === 0);
-  }
-  sinks() {
-    return this.nodes().filter((e) => Object.keys(this._out[e]).length === 0);
-  }
-  setNodes(e, t) {
-    return e.forEach((r) => {
-      t !== void 0 ? this.setNode(r, t) : this.setNode(r);
-    }), this;
-  }
-  setNode(e, t) {
-    return e in this._nodes ? (arguments.length > 1 && (this._nodes[e] = t), this) : (this._nodes[e] = arguments.length > 1 ? t : this._defaultNodeLabelFn(e), this._isCompound && (this._parent[e] = "\0", this._children[e] = {}, this._children["\0"][e] = !0), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this);
-  }
-  node(e) {
-    return this._nodes[e];
-  }
-  hasNode(e) {
-    return e in this._nodes;
-  }
-  removeNode(e) {
-    if (e in this._nodes) {
-      let t = (r) => this.removeEdge(this._edgeObjs[r]);
-      delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], this.children(e).forEach((r) => {
-        this.setParent(r);
-      }), delete this._children[e]), Object.keys(this._in[e]).forEach(t), delete this._in[e], delete this._preds[e], Object.keys(this._out[e]).forEach(t), delete this._out[e], delete this._sucs[e], --this._nodeCount;
-    }
-    return this;
-  }
-  setParent(e, t) {
-    if (!this._isCompound) throw new Error("Cannot set parent in a non-compound graph");
-    if (t === void 0) t = "\0";
-    else {
-      t += "";
-      for (let r = t; r !== void 0; r = this.parent(r)) if (r === e) throw new Error("Setting " + t + " as parent of " + e + " would create a cycle");
-      this.setNode(t);
-    }
-    return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = t, this._children[t][e] = !0, this;
-  }
-  parent(e) {
-    if (this._isCompound) {
-      let t = this._parent[e];
-      if (t !== "\0") return t;
-    }
-  }
-  children(e = "\0") {
-    if (this._isCompound) {
-      let t = this._children[e];
-      if (t) return Object.keys(t);
-    } else {
-      if (e === "\0") return this.nodes();
-      if (this.hasNode(e)) return [];
-    }
-    return [];
-  }
-  predecessors(e) {
-    let t = this._preds[e];
-    if (t) return Object.keys(t);
-  }
-  successors(e) {
-    let t = this._sucs[e];
-    if (t) return Object.keys(t);
-  }
-  neighbors(e) {
-    let t = this.predecessors(e);
-    if (t) {
-      let r = new Set(t);
-      for (let n of this.successors(e)) r.add(n);
-      return Array.from(r.values());
-    }
-  }
-  isLeaf(e) {
-    let t;
-    return this.isDirected() ? t = this.successors(e) : t = this.neighbors(e), t.length === 0;
-  }
-  filterNodes(e) {
-    let t = new this.constructor({ directed: this._isDirected, multigraph: this._isMultigraph, compound: this._isCompound });
-    t.setGraph(this.graph()), Object.entries(this._nodes).forEach(([o, i]) => {
-      e(o) && t.setNode(o, i);
-    }), Object.values(this._edgeObjs).forEach((o) => {
-      t.hasNode(o.v) && t.hasNode(o.w) && t.setEdge(o, this.edge(o));
-    });
-    let r = {}, n = (o) => {
-      let i = this.parent(o);
-      return !i || t.hasNode(i) ? (r[o] = i ?? void 0, i ?? void 0) : i in r ? r[i] : n(i);
-    };
-    return this._isCompound && t.nodes().forEach((o) => t.setParent(o, n(o))), t;
-  }
-  setDefaultEdgeLabel(e) {
-    return typeof e != "function" ? this._defaultEdgeLabelFn = () => e : this._defaultEdgeLabelFn = e, this;
-  }
-  edgeCount() {
-    return this._edgeCount;
-  }
-  edges() {
-    return Object.values(this._edgeObjs);
-  }
-  setPath(e, t) {
-    return e.reduce((r, n) => (t !== void 0 ? this.setEdge(r, n, t) : this.setEdge(r, n), n)), this;
-  }
-  setEdge(e, t, r, n) {
-    let o, i, s, l, d = !1;
-    typeof e == "object" && e !== null && "v" in e ? (o = e.v, i = e.w, s = e.name, arguments.length === 2 && (l = t, d = !0)) : (o = e, i = t, s = n, arguments.length > 2 && (l = r, d = !0)), o = "" + o, i = "" + i, s !== void 0 && (s = "" + s);
-    let a = ge(this._isDirected, o, i, s);
-    if (a in this._edgeLabels) return d && (this._edgeLabels[a] = l), this;
-    if (s !== void 0 && !this._isMultigraph) throw new Error("Cannot set a named edge when isMultigraph = false");
-    this.setNode(o), this.setNode(i), this._edgeLabels[a] = d ? l : this._defaultEdgeLabelFn(o, i, s);
-    let c = un(this._isDirected, o, i, s);
-    return o = c.v, i = c.w, Object.freeze(c), this._edgeObjs[a] = c, wt(this._preds[i], o), wt(this._sucs[o], i), this._in[i][a] = c, this._out[o][a] = c, this._edgeCount++, this;
-  }
-  edge(e, t, r) {
-    let n = arguments.length === 1 ? Fe(this._isDirected, e) : ge(this._isDirected, e, t, r);
-    return this._edgeLabels[n];
-  }
-  edgeAsObj(e, t, r) {
-    let n = arguments.length === 1 ? this.edge(e) : this.edge(e, t, r);
-    return typeof n != "object" ? { label: n } : n;
-  }
-  hasEdge(e, t, r) {
-    return (arguments.length === 1 ? Fe(this._isDirected, e) : ge(this._isDirected, e, t, r)) in this._edgeLabels;
-  }
-  removeEdge(e, t, r) {
-    let n = arguments.length === 1 ? Fe(this._isDirected, e) : ge(this._isDirected, e, t, r), o = this._edgeObjs[n];
-    if (o) {
-      let i = o.v, s = o.w;
-      delete this._edgeLabels[n], delete this._edgeObjs[n], vt(this._preds[s], i), vt(this._sucs[i], s), delete this._in[s][n], delete this._out[i][n], this._edgeCount--;
-    }
-    return this;
-  }
-  inEdges(e, t) {
-    return this.isDirected() ? this.filterEdges(this._in[e], e, t) : this.nodeEdges(e, t);
-  }
-  outEdges(e, t) {
-    return this.isDirected() ? this.filterEdges(this._out[e], e, t) : this.nodeEdges(e, t);
-  }
-  nodeEdges(e, t) {
-    if (e in this._nodes) return this.filterEdges({ ...this._in[e], ...this._out[e] }, e, t);
-  }
-  _removeFromParentsChildList(e) {
-    delete this._children[this._parent[e]][e];
-  }
-  filterEdges(e, t, r) {
-    if (!e) return;
-    let n = Object.values(e);
-    return r ? n.filter((o) => o.v === t && o.w === r || o.v === r && o.w === t) : n;
-  }
-};
-function wt(e, t) {
-  e[t] ? e[t]++ : e[t] = 1;
-}
-function vt(e, t) {
-  e[t] !== void 0 && !--e[t] && delete e[t];
-}
-function ge(e, t, r, n) {
-  let o = "" + t, i = "" + r;
-  if (!e && o > i) {
-    let s = o;
-    o = i, i = s;
-  }
-  return o + "
" + i + "
" + (n === void 0 ? "\0" : n);
-}
-function un(e, t, r, n) {
-  let o = "" + t, i = "" + r;
-  if (!e && o > i) {
-    let l = o;
-    o = i, i = l;
-  }
-  let s = { v: o, w: i };
-  return n && (s.name = n), s;
-}
-function Fe(e, t) {
-  return ge(e, t.v, t.w, t.name);
-}
-var fn = "4.0.1", Ut = {};
-Kt(Ut, { read: () => bn, write: () => hn });
-function hn(e) {
-  let t = { options: { directed: e.isDirected(), multigraph: e.isMultigraph(), compound: e.isCompound() }, nodes: gn(e), edges: pn(e) }, r = e.graph();
-  return r !== void 0 && (t.value = structuredClone(r)), t;
-}
-function gn(e) {
-  return e.nodes().map((t) => {
-    let r = e.node(t), n = e.parent(t), o = { v: t };
-    return r !== void 0 && (o.value = r), n !== void 0 && (o.parent = n), o;
-  });
-}
-function pn(e) {
-  return e.edges().map((t) => {
-    let r = e.edge(t), n = { v: t.v, w: t.w };
-    return t.name !== void 0 && (n.name = t.name), r !== void 0 && (n.value = r), n;
-  });
-}
-function bn(e) {
-  let t = new G(e.options);
-  return e.value !== void 0 && t.setGraph(e.value), e.nodes.forEach((r) => {
-    t.setNode(r.v, r.value), r.parent && t.setParent(r.v, r.parent);
-  }), e.edges.forEach((r) => {
-    t.setEdge({ v: r.v, w: r.w, name: r.name }, r.value);
-  }), t;
-}
-var Ve = {};
-Kt(Ve, { CycleException: () => _e, bellmanFord: () => Vt, components: () => wn, dijkstra: () => xe, dijkstraAll: () => kn, findCycles: () => xn, floydWarshall: () => Tn, isAcyclic: () => Cn, postorder: () => In, preorder: () => On, prim: () => Mn, shortestPaths: () => jn, tarjan: () => qt, topsort: () => Xt });
-var yn = () => 1;
-function Vt(e, t, r, n) {
-  return mn(e, String(t), r || yn, n || function(o) {
-    return e.outEdges(o);
-  });
-}
-function mn(e, t, r, n) {
-  let o = {}, i, s = 0, l = e.nodes(), d = function(u) {
-    let h = r(u);
-    o[u.v].distance + h < o[u.w].distance && (o[u.w] = { distance: o[u.v].distance + h, predecessor: u.v }, i = !0);
-  }, a = function() {
-    l.forEach(function(u) {
-      n(u).forEach(function(h) {
-        let g = h.v === u ? h.v : h.w, b = g === h.v ? h.w : h.v;
-        d({ v: g, w: b });
-      });
-    });
-  };
-  l.forEach(function(u) {
-    let h = u === t ? 0 : Number.POSITIVE_INFINITY;
-    o[u] = { distance: h, predecessor: "" };
-  });
-  let c = l.length;
-  for (let u = 1; u < c && (i = !1, s++, a(), !!i); u++) ;
-  if (s === c - 1 && (i = !1, a(), i)) throw new Error("The graph contains a negative weight cycle");
-  return o;
-}
-function wn(e) {
-  let t = {}, r = [], n;
-  function o(i) {
-    i in t || (t[i] = !0, n.push(i), e.successors(i).forEach(o), e.predecessors(i).forEach(o));
-  }
-  return e.nodes().forEach(function(i) {
-    n = [], o(i), n.length && r.push(n);
-  }), r;
-}
-var Ht = class {
-  constructor() {
-    this._arr = [], this._keyIndices = {};
-  }
-  size() {
-    return this._arr.length;
-  }
-  keys() {
-    return this._arr.map((e) => e.key);
-  }
-  has(e) {
-    return e in this._keyIndices;
-  }
-  priority(e) {
-    let t = this._keyIndices[e];
-    if (t !== void 0) return this._arr[t].priority;
-  }
-  min() {
-    if (this.size() === 0) throw new Error("Queue underflow");
-    return this._arr[0].key;
-  }
-  add(e, t) {
-    let r = this._keyIndices, n = String(e);
-    if (!(n in r)) {
-      let o = this._arr, i = o.length;
-      return r[n] = i, o.push({ key: n, priority: t }), this._decrease(i), !0;
-    }
-    return !1;
-  }
-  removeMin() {
-    this._swap(0, this._arr.length - 1);
-    let e = this._arr.pop();
-    return delete this._keyIndices[e.key], this._heapify(0), e.key;
-  }
-  decrease(e, t) {
-    let r = this._keyIndices[e];
-    if (r === void 0) throw new Error(`Key not found: ${e}`);
-    let n = this._arr[r].priority;
-    if (t > n) throw new Error(`New priority is greater than current priority. Key: ${e} Old: ${n} New: ${t}`);
-    this._arr[r].priority = t, this._decrease(r);
-  }
-  _heapify(e) {
-    let t = this._arr, r = 2 * e, n = r + 1, o = e;
-    r < t.length && (o = t[r].priority < t[o].priority ? r : o, n < t.length && (o = t[n].priority < t[o].priority ? n : o), o !== e && (this._swap(e, o), this._heapify(o)));
-  }
-  _decrease(e) {
-    let t = this._arr, r = t[e].priority, n;
-    for (; e !== 0 && (n = e >> 1, !(t[n].priority < r)); ) this._swap(e, n), e = n;
-  }
-  _swap(e, t) {
-    let r = this._arr, n = this._keyIndices, o = r[e], i = r[t];
-    r[e] = i, r[t] = o, n[i.key] = e, n[o.key] = t;
-  }
-}, vn = () => 1;
-function xe(e, t, r, n) {
-  let o = function(i) {
-    return e.outEdges(i);
-  };
-  return En(e, String(t), r || vn, n || o);
-}
-function En(e, t, r, n) {
-  let o = {}, i = new Ht(), s, l, d = function(a) {
-    let c = a.v !== s ? a.v : a.w, u = o[c], h = r(a), g = l.distance + h;
-    if (h < 0) throw new Error("dijkstra does not allow negative edge weights. Bad edge: " + a + " Weight: " + h);
-    g < u.distance && (u.distance = g, u.predecessor = s, i.decrease(c, g));
-  };
-  for (e.nodes().forEach(function(a) {
-    let c = a === t ? 0 : Number.POSITIVE_INFINITY;
-    o[a] = { distance: c, predecessor: "" }, i.add(a, c);
-  }); i.size() > 0 && (s = i.removeMin(), l = o[s], l.distance !== Number.POSITIVE_INFINITY); ) n(s).forEach(d);
-  return o;
-}
-function kn(e, t, r) {
-  return e.nodes().reduce(function(n, o) {
-    return n[o] = xe(e, o, t, r), n;
-  }, {});
-}
-function qt(e) {
-  let t = 0, r = [], n = {}, o = [];
-  function i(s) {
-    let l = n[s] = { onStack: !0, lowlink: t, index: t++ };
-    if (r.push(s), e.successors(s).forEach(function(d) {
-      d in n ? n[d].onStack && (l.lowlink = Math.min(l.lowlink, n[d].index)) : (i(d), l.lowlink = Math.min(l.lowlink, n[d].lowlink));
-    }), l.lowlink === l.index) {
-      let d = [], a;
-      do
-        a = r.pop(), n[a].onStack = !1, d.push(a);
-      while (s !== a);
-      o.push(d);
-    }
-  }
-  return e.nodes().forEach(function(s) {
-    s in n || i(s);
-  }), o;
-}
-function xn(e) {
-  return qt(e).filter(function(t) {
-    return t.length > 1 || t.length === 1 && e.hasEdge(t[0], t[0]);
-  });
-}
-var _n = () => 1;
-function Tn(e, t, r) {
-  return Nn(e, t || _n, r || function(n) {
-    return e.outEdges(n);
-  });
-}
-function Nn(e, t, r) {
-  let n = {}, o = e.nodes();
-  return o.forEach(function(i) {
-    n[i] = {}, n[i][i] = { distance: 0, predecessor: "" }, o.forEach(function(s) {
-      i !== s && (n[i][s] = { distance: Number.POSITIVE_INFINITY, predecessor: "" });
-    }), r(i).forEach(function(s) {
-      let l = s.v === i ? s.w : s.v, d = t(s);
-      n[i][l] = { distance: d, predecessor: i };
-    });
-  }), o.forEach(function(i) {
-    let s = n[i];
-    o.forEach(function(l) {
-      let d = n[l];
-      o.forEach(function(a) {
-        let c = d[i], u = s[a], h = d[a], g = c.distance + u.distance;
-        g < h.distance && (h.distance = g, h.predecessor = u.predecessor);
-      });
-    });
-  }), n;
-}
-var _e = class extends Error {
-  constructor(...e) {
-    super(...e);
-  }
-};
-function Xt(e) {
-  let t = {}, r = {}, n = [];
-  function o(i) {
-    if (i in r) throw new _e();
-    i in t || (r[i] = !0, t[i] = !0, e.predecessors(i).forEach(o), delete r[i], n.push(i));
-  }
-  if (e.sinks().forEach(o), Object.keys(t).length !== e.nodeCount()) throw new _e();
-  return n;
-}
-function Cn(e) {
-  try {
-    Xt(e);
-  } catch (t) {
-    if (t instanceof _e) return !1;
-    throw t;
-  }
-  return !0;
-}
-function Sn(e, t, r, n, o) {
-  Array.isArray(t) || (t = [t]);
-  let i = (l) => {
-    var d;
-    return (d = e.isDirected() ? e.successors(l) : e.neighbors(l)) != null ? d : [];
-  }, s = {};
-  return t.forEach(function(l) {
-    if (!e.hasNode(l)) throw new Error("Graph does not have node: " + l);
-    o = Jt(e, l, r === "post", s, i, n, o);
-  }), o;
-}
-function Jt(e, t, r, n, o, i, s) {
-  return t in n || (n[t] = !0, r || (s = i(s, t)), o(t).forEach(function(l) {
-    s = Jt(e, l, r, n, o, i, s);
-  }), r && (s = i(s, t))), s;
-}
-function Zt(e, t, r) {
-  return Sn(e, t, r, function(n, o) {
-    return n.push(o), n;
-  }, []);
-}
-function In(e, t) {
-  return Zt(e, t, "post");
-}
-function On(e, t) {
-  return Zt(e, t, "pre");
-}
-function Mn(e, t) {
-  let r = new G(), n = {}, o = new Ht(), i;
-  function s(d) {
-    let a = d.v === i ? d.w : d.v, c = o.priority(a);
-    if (c !== void 0) {
-      let u = t(d);
-      u < c && (n[a] = i, o.decrease(a, u));
-    }
-  }
-  if (e.nodeCount() === 0) return r;
-  e.nodes().forEach(function(d) {
-    o.add(d, Number.POSITIVE_INFINITY), r.setNode(d);
-  }), o.decrease(e.nodes()[0], 0);
-  let l = !1;
-  for (; o.size() > 0; ) {
-    if (i = o.removeMin(), i in n) r.setEdge(i, n[i]);
-    else {
-      if (l) throw new Error("Input graph is not connected: " + e);
-      l = !0;
-    }
-    e.nodeEdges(i).forEach(s);
-  }
-  return r;
-}
-function jn(e, t, r, n) {
-  return Fn(e, t, r, n ?? ((o) => {
-    let i = e.outEdges(o);
-    return i ?? [];
-  }));
-}
-function Fn(e, t, r, n) {
-  if (r === void 0) return xe(e, t, r, n);
-  let o = !1, i = e.nodes();
-  for (let s = 0; s < i.length; s++) {
-    let l = n(i[s]);
-    for (let d = 0; d < l.length; d++) {
-      let a = l[d], c = a.v === i[s] ? a.v : a.w, u = c === a.v ? a.w : a.v;
-      r({ v: c, w: u }) < 0 && (o = !0);
-    }
-    if (o) return Vt(e, t, r, n);
-  }
-  return xe(e, t, r, n);
-}
-function fe(e, t, r, n) {
-  let o = n;
-  for (; e.hasNode(o); ) o = He(n);
-  return r.dummy = t, e.setNode(o, r), o;
-}
-function zn(e) {
-  let t = new G().setGraph(e.graph());
-  return e.nodes().forEach((r) => t.setNode(r, e.node(r))), e.edges().forEach((r) => {
-    let n = t.edge(r.v, r.w) || { weight: 0, minlen: 1 }, o = e.edge(r);
-    t.setEdge(r.v, r.w, { weight: n.weight + o.weight, minlen: Math.max(n.minlen, o.minlen) });
-  }), t;
-}
-function Qt(e) {
-  let t = new G({ multigraph: e.isMultigraph() }).setGraph(e.graph());
-  return e.nodes().forEach((r) => {
-    e.children(r).length || t.setNode(r, e.node(r));
-  }), e.edges().forEach((r) => {
-    t.setEdge(r, e.edge(r));
-  }), t;
-}
-function Et(e, t) {
-  let r = e.x, n = e.y, o = t.x - r, i = t.y - n, s = e.width / 2, l = e.height / 2;
-  if (!o && !i) throw new Error("Not possible to find intersection inside of the rectangle");
-  let d, a;
-  return Math.abs(i) * s > Math.abs(o) * l ? (i < 0 && (l = -l), d = l * o / i, a = l) : (o < 0 && (s = -s), d = s, a = s * i / o), { x: r + d, y: n + a };
-}
-function ye(e) {
-  let t = pe(tr(e) + 1).map(() => []);
-  return e.nodes().forEach((r) => {
-    let n = e.node(r), o = n.rank;
-    o !== void 0 && (t[o] || (t[o] = []), t[o][n.order] = r);
-  }), t;
-}
-function Rn(e) {
-  let t = e.nodes().map((n) => {
-    let o = e.node(n).rank;
-    return o === void 0 ? Number.MAX_VALUE : o;
-  }), r = K(Math.min, t);
-  e.nodes().forEach((n) => {
-    let o = e.node(n);
-    Object.hasOwn(o, "rank") && (o.rank -= r);
-  });
-}
-function Dn(e) {
-  let t = e.nodes().map((s) => e.node(s).rank).filter((s) => s !== void 0), r = K(Math.min, t), n = [];
-  e.nodes().forEach((s) => {
-    let l = e.node(s).rank - r;
-    n[l] || (n[l] = []), n[l].push(s);
-  });
-  let o = 0, i = e.graph().nodeRankFactor;
-  Array.from(n).forEach((s, l) => {
-    s === void 0 && l % i !== 0 ? --o : s !== void 0 && o && s.forEach((d) => e.node(d).rank += o);
-  });
-}
-function kt(e, t, r, n) {
-  let o = { width: 0, height: 0 };
-  return arguments.length >= 4 && (o.rank = r, o.order = n), fe(e, "border", o, t);
-}
-function Ln(e, t = er) {
-  let r = [];
-  for (let n = 0; n < e.length; n += t) {
-    let o = e.slice(n, n + t);
-    r.push(o);
-  }
-  return r;
-}
-var er = 65535;
-function K(e, t) {
-  if (t.length > er) {
-    let r = Ln(t);
-    return e(...r.map((n) => e(...n)));
-  } else return e(...t);
-}
-function tr(e) {
-  let t = e.nodes().map((r) => {
-    let n = e.node(r).rank;
-    return n === void 0 ? Number.MIN_VALUE : n;
-  });
-  return K(Math.max, t);
-}
-function An(e, t) {
-  let r = { lhs: [], rhs: [] };
-  return e.forEach((n) => {
-    t(n) ? r.lhs.push(n) : r.rhs.push(n);
-  }), r;
-}
-function rr(e, t) {
-  let r = Date.now();
-  try {
-    return t();
-  } finally {
-    console.log(e + " time: " + (Date.now() - r) + "ms");
-  }
-}
-function nr(e, t) {
-  return t();
-}
-var Pn = 0;
-function He(e) {
-  let t = ++Pn;
-  return e + ("" + t);
-}
-function pe(e, t, r = 1) {
-  t == null && (t = e, e = 0);
-  let n = (i) => i < t;
-  r < 0 && (n = (i) => t < i);
-  let o = [];
-  for (let i = e; n(i); i += r) o.push(i);
-  return o;
-}
-function Te(e, t) {
-  let r = {};
-  for (let n of t) e[n] !== void 0 && (r[n] = e[n]);
-  return r;
-}
-function Ne(e, t) {
-  let r;
-  return typeof t == "string" ? r = (n) => n[t] : r = t, Object.entries(e).reduce((n, [o, i]) => (n[o] = r(i, o), n), {});
-}
-function Bn(e, t) {
-  return e.reduce((r, n, o) => (r[n] = t[o], r), {});
-}
-var Ce = "\0", Wn = "3.0.0", Gn = class {
-  constructor() {
-    dn(this, "_sentinel");
-    let e = {};
-    e._next = e._prev = e, this._sentinel = e;
-  }
-  dequeue() {
-    let e = this._sentinel, t = e._prev;
-    if (t !== e) return xt(t), t;
-  }
-  enqueue(e) {
-    let t = this._sentinel;
-    e._prev && e._next && xt(e), e._next = t._next, t._next._prev = e, t._next = e, e._prev = t;
-  }
-  toString() {
-    let e = [], t = this._sentinel, r = t._prev;
-    for (; r !== t; ) e.push(JSON.stringify(r, $n)), r = r._prev;
-    return "[" + e.join(", ") + "]";
-  }
-};
-function xt(e) {
-  e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
-}
-function $n(e, t) {
-  if (e !== "_next" && e !== "_prev") return t;
-}
-var Yn = Gn, Kn = () => 1;
-function Un(e, t) {
-  if (e.nodeCount() <= 1) return [];
-  let r = Hn(e, t || Kn);
-  return Vn(r.graph, r.buckets, r.zeroIdx).flatMap((n) => e.outEdges(n.v, n.w) || []);
-}
-function Vn(e, t, r) {
-  var n;
-  let o = [], i = t[t.length - 1], s = t[0], l;
-  for (; e.nodeCount(); ) {
-    for (; l = s.dequeue(); ) ze(e, t, r, l);
-    for (; l = i.dequeue(); ) ze(e, t, r, l);
-    if (e.nodeCount()) {
-      for (let d = t.length - 2; d > 0; --d) if (l = (n = t[d]) == null ? void 0 : n.dequeue(), l) {
-        o = o.concat(ze(e, t, r, l, !0) || []);
-        break;
-      }
-    }
-  }
-  return o;
-}
-function ze(e, t, r, n, o) {
-  let i = [], s = o ? i : void 0;
-  return (e.inEdges(n.v) || []).forEach((l) => {
-    let d = e.edge(l), a = e.node(l.v);
-    o && i.push({ v: l.v, w: l.w }), a.out -= d, Ge(t, r, a);
-  }), (e.outEdges(n.v) || []).forEach((l) => {
-    let d = e.edge(l), a = l.w, c = e.node(a);
-    c.in -= d, Ge(t, r, c);
-  }), e.removeNode(n.v), s;
-}
-function Hn(e, t) {
-  let r = new G(), n = 0, o = 0;
-  e.nodes().forEach((l) => {
-    r.setNode(l, { v: l, in: 0, out: 0 });
-  }), e.edges().forEach((l) => {
-    let d = r.edge(l.v, l.w) || 0, a = t(l), c = d + a;
-    r.setEdge(l.v, l.w, c);
-    let u = r.node(l.v), h = r.node(l.w);
-    o = Math.max(o, u.out += a), n = Math.max(n, h.in += a);
-  });
-  let i = qn(o + n + 3).map(() => new Yn()), s = n + 1;
-  return r.nodes().forEach((l) => {
-    Ge(i, s, r.node(l));
-  }), { graph: r, buckets: i, zeroIdx: s };
-}
-function Ge(e, t, r) {
-  var n, o, i;
-  r.out ? r.in ? (i = e[r.out - r.in + t]) == null || i.enqueue(r) : (o = e[e.length - 1]) == null || o.enqueue(r) : (n = e[0]) == null || n.enqueue(r);
-}
-function qn(e) {
-  let t = [];
-  for (let r = 0; r < e; r++) t.push(r);
-  return t;
-}
-function Xn(e) {
-  (e.graph().acyclicer === "greedy" ? Un(e, t(e)) : Jn(e)).forEach((r) => {
-    let n = e.edge(r);
-    e.removeEdge(r), n.forwardName = r.name, n.reversed = !0, e.setEdge(r.w, r.v, n, He("rev"));
-  });
-  function t(r) {
-    return (n) => r.edge(n).weight;
-  }
-}
-function Jn(e) {
-  let t = [], r = {}, n = {};
-  function o(i) {
-    Object.hasOwn(n, i) || (n[i] = !0, r[i] = !0, e.outEdges(i).forEach((s) => {
-      Object.hasOwn(r, s.w) ? t.push(s) : o(s.w);
-    }), delete r[i]);
-  }
-  return e.nodes().forEach(o), t;
-}
-function Zn(e) {
-  e.edges().forEach((t) => {
-    let r = e.edge(t);
-    if (r.reversed) {
-      e.removeEdge(t);
-      let n = r.forwardName;
-      delete r.reversed, delete r.forwardName, e.setEdge(t.w, t.v, r, n);
-    }
-  });
-}
-function Qn(e) {
-  e.graph().dummyChains = [], e.edges().forEach((t) => eo(e, t));
-}
-function eo(e, t) {
-  let r = t.v, n = e.node(r).rank, o = t.w, i = e.node(o).rank, s = t.name, l = e.edge(t), d = l.labelRank;
-  if (i === n + 1) return;
-  e.removeEdge(t);
-  let a, c, u;
-  for (u = 0, ++n; n < i; ++u, ++n) l.points = [], c = { width: 0, height: 0, edgeLabel: l, edgeObj: t, rank: n }, a = fe(e, "edge", c, "_d"), n === d && (c.width = l.width, c.height = l.height, c.dummy = "edge-label", c.labelpos = l.labelpos), e.setEdge(r, a, { weight: l.weight }, s), u === 0 && e.graph().dummyChains.push(a), r = a;
-  e.setEdge(r, o, { weight: l.weight }, s);
-}
-function to(e) {
-  e.graph().dummyChains.forEach((t) => {
-    let r = e.node(t), n = r.edgeLabel, o;
-    for (e.setEdge(r.edgeObj, n); r.dummy; ) o = e.successors(t)[0], e.removeNode(t), n.points.push({ x: r.x, y: r.y }), r.dummy === "edge-label" && (n.x = r.x, n.y = r.y, n.width = r.width, n.height = r.height), t = o, r = e.node(t);
-  });
-}
-function qe(e) {
-  let t = {};
-  function r(n) {
-    let o = e.node(n);
-    if (Object.hasOwn(t, n)) return o.rank;
-    t[n] = !0;
-    let i = e.outEdges(n), s = i ? i.map((d) => d == null ? Number.POSITIVE_INFINITY : r(d.w) - e.edge(d).minlen) : [], l = K(Math.min, s);
-    return l === Number.POSITIVE_INFINITY && (l = 0), o.rank = l;
-  }
-  e.sources().forEach(r);
-}
-function ue(e, t) {
-  return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
-}
-var or = ro;
-function ro(e) {
-  let t = new G({ directed: !1 }), r = e.nodes();
-  if (r.length === 0) throw new Error("Graph must have at least one node");
-  let n = r[0], o = e.nodeCount();
-  t.setNode(n, {});
-  let i, s;
-  for (; no(t, e) < o && (i = oo(t, e), !!i); ) s = t.hasNode(i.v) ? ue(e, i) : -ue(e, i), io(t, e, s);
-  return t;
-}
-function no(e, t) {
-  function r(n) {
-    let o = t.nodeEdges(n);
-    o && o.forEach((i) => {
-      let s = i.v, l = n === s ? i.w : s;
-      !e.hasNode(l) && !ue(t, i) && (e.setNode(l, {}), e.setEdge(n, l, {}), r(l));
-    });
-  }
-  return e.nodes().forEach(r), e.nodeCount();
-}
-function oo(e, t) {
-  return t.edges().reduce((r, n) => {
-    let o = Number.POSITIVE_INFINITY;
-    return e.hasNode(n.v) !== e.hasNode(n.w) && (o = ue(t, n)), o < r[0] ? [o, n] : r;
-  }, [Number.POSITIVE_INFINITY, null])[1];
-}
-function io(e, t, r) {
-  e.nodes().forEach((n) => t.node(n).rank += r);
-}
-var { preorder: so, postorder: lo } = Ve, ao = se;
-se.initLowLimValues = Je;
-se.initCutValues = Xe;
-se.calcCutValue = ir;
-se.leaveEdge = lr;
-se.enterEdge = ar;
-se.exchangeEdges = dr;
-function se(e) {
-  e = zn(e), qe(e);
-  let t = or(e);
-  Je(t), Xe(t, e);
-  let r, n;
-  for (; r = lr(t); ) n = ar(t, e, r), dr(t, e, r, n);
-}
-function Xe(e, t) {
-  let r = lo(e, e.nodes());
-  r = r.slice(0, r.length - 1), r.forEach((n) => co(e, t, n));
-}
-function co(e, t, r) {
-  let n = e.node(r).parent, o = e.edge(r, n);
-  o.cutvalue = ir(e, t, r);
-}
-function ir(e, t, r) {
-  let n = e.node(r).parent, o = !0, i = t.edge(r, n), s = 0;
-  i || (o = !1, i = t.edge(n, r)), s = i.weight;
-  let l = t.nodeEdges(r);
-  return l && l.forEach((d) => {
-    let a = d.v === r, c = a ? d.w : d.v;
-    if (c !== n) {
-      let u = a === o, h = t.edge(d).weight;
-      if (s += u ? h : -h, fo(e, r, c)) {
-        let g = e.edge(r, c).cutvalue;
-        s += u ? -g : g;
-      }
-    }
-  }), s;
-}
-function Je(e, t) {
-  arguments.length < 2 && (t = e.nodes()[0]), sr(e, {}, 1, t);
-}
-function sr(e, t, r, n, o) {
-  let i = r, s = e.node(n);
-  t[n] = !0;
-  let l = e.neighbors(n);
-  return l && l.forEach((d) => {
-    Object.hasOwn(t, d) || (r = sr(e, t, r, d, n));
-  }), s.low = i, s.lim = r++, o ? s.parent = o : delete s.parent, r;
-}
-function lr(e) {
-  return e.edges().find((t) => e.edge(t).cutvalue < 0);
-}
-function ar(e, t, r) {
-  let n = r.v, o = r.w;
-  t.hasEdge(n, o) || (n = r.w, o = r.v);
-  let i = e.node(n), s = e.node(o), l = i, d = !1;
-  return i.lim > s.lim && (l = s, d = !0), t.edges().filter((a) => d === _t(e, e.node(a.v), l) && d !== _t(e, e.node(a.w), l)).reduce((a, c) => ue(t, c) < ue(t, a) ? c : a);
-}
-function dr(e, t, r, n) {
-  let o = r.v, i = r.w;
-  e.removeEdge(o, i), e.setEdge(n.v, n.w, {}), Je(e), Xe(e, t), uo(e, t);
-}
-function uo(e, t) {
-  let r = e.nodes().find((o) => !e.node(o).parent);
-  if (!r) return;
-  let n = so(e, [r]);
-  n = n.slice(1), n.forEach((o) => {
-    let i = e.node(o).parent, s = t.edge(o, i), l = !1;
-    s || (s = t.edge(i, o), l = !0), t.node(o).rank = t.node(i).rank + (l ? s.minlen : -s.minlen);
-  });
-}
-function fo(e, t, r) {
-  return e.hasEdge(t, r);
-}
-function _t(e, t, r) {
-  return r.low <= t.lim && t.lim <= r.lim;
-}
-var ho = go;
-function go(e) {
-  let t = e.graph().ranker;
-  if (typeof t == "function") return t(e);
-  switch (t) {
-    case "network-simplex":
-      Tt(e);
-      break;
-    case "tight-tree":
-      bo(e);
-      break;
-    case "longest-path":
-      po(e);
-      break;
-    case "none":
-      break;
-    default:
-      Tt(e);
-  }
-}
-var po = qe;
-function bo(e) {
-  qe(e), or(e);
-}
-function Tt(e) {
-  ao(e);
-}
-var yo = mo;
-function mo(e) {
-  let t = vo(e);
-  e.graph().dummyChains.forEach((r) => {
-    let n = e.node(r), o = n.edgeObj, i = wo(e, t, o.v, o.w), s = i.path, l = i.lca, d = 0, a = s[d], c = !0;
-    for (; r !== o.w; ) {
-      if (n = e.node(r), c) {
-        for (; (a = s[d]) !== l && e.node(a).maxRank < n.rank; ) d++;
-        a === l && (c = !1);
-      }
-      if (!c) {
-        for (; d < s.length - 1 && e.node(s[d + 1]).minRank <= n.rank; ) d++;
-        a = s[d];
-      }
-      a !== void 0 && e.setParent(r, a), r = e.successors(r)[0];
-    }
-  });
-}
-function wo(e, t, r, n) {
-  let o = [], i = [], s = Math.min(t[r].low, t[n].low), l = Math.max(t[r].lim, t[n].lim), d;
-  d = r;
-  do
-    d = e.parent(d), o.push(d);
-  while (d && (t[d].low > s || l > t[d].lim));
-  let a = d, c = n;
-  for (; (c = e.parent(c)) !== a; ) i.push(c);
-  return { path: o.concat(i.reverse()), lca: a };
-}
-function vo(e) {
-  let t = {}, r = 0;
-  function n(o) {
-    let i = r;
-    e.children(o).forEach(n), t[o] = { low: i, lim: r++ };
-  }
-  return e.children(Ce).forEach(n), t;
-}
-function Eo(e) {
-  let t = fe(e, "root", {}, "_root"), r = ko(e), n = Object.values(r), o = K(Math.max, n) - 1, i = 2 * o + 1;
-  e.graph().nestingRoot = t, e.edges().forEach((l) => e.edge(l).minlen *= i);
-  let s = xo(e) + 1;
-  e.children(Ce).forEach((l) => cr(e, t, i, s, o, r, l)), e.graph().nodeRankFactor = i;
-}
-function cr(e, t, r, n, o, i, s) {
-  var l;
-  let d = e.children(s);
-  if (!d.length) {
-    s !== t && e.setEdge(t, s, { weight: 0, minlen: r });
-    return;
-  }
-  let a = kt(e, "_bt"), c = kt(e, "_bb"), u = e.node(s);
-  e.setParent(a, s), u.borderTop = a, e.setParent(c, s), u.borderBottom = c, d.forEach((h) => {
-    var g;
-    cr(e, t, r, n, o, i, h);
-    let b = e.node(h), y = b.borderTop ? b.borderTop : h, p = b.borderBottom ? b.borderBottom : h, v = b.borderTop ? n : 2 * n, N = y !== p ? 1 : o - ((g = i[s]) != null ? g : 0) + 1;
-    e.setEdge(a, y, { weight: v, minlen: N, nestingEdge: !0 }), e.setEdge(p, c, { weight: v, minlen: N, nestingEdge: !0 });
-  }), e.parent(s) || e.setEdge(t, a, { weight: 0, minlen: o + ((l = i[s]) != null ? l : 0) });
-}
-function ko(e) {
-  let t = {};
-  function r(n, o) {
-    let i = e.children(n);
-    i && i.length && i.forEach((s) => r(s, o + 1)), t[n] = o;
-  }
-  return e.children(Ce).forEach((n) => r(n, 1)), t;
-}
-function xo(e) {
-  return e.edges().reduce((t, r) => t + e.edge(r).weight, 0);
-}
-function _o(e) {
-  let t = e.graph();
-  e.removeNode(t.nestingRoot), delete t.nestingRoot, e.edges().forEach((r) => {
-    e.edge(r).nestingEdge && e.removeEdge(r);
-  });
-}
-var To = No;
-function No(e) {
-  function t(r) {
-    let n = e.children(r), o = e.node(r);
-    if (n.length && n.forEach(t), Object.hasOwn(o, "minRank")) {
-      o.borderLeft = [], o.borderRight = [];
-      for (let i = o.minRank, s = o.maxRank + 1; i < s; ++i) Nt(e, "borderLeft", "_bl", r, o, i), Nt(e, "borderRight", "_br", r, o, i);
-    }
-  }
-  e.children(Ce).forEach(t);
-}
-function Nt(e, t, r, n, o, i) {
-  let s = { width: 0, height: 0, rank: i, borderType: t }, l = o[t][i - 1], d = fe(e, "border", s, r);
-  o[t][i] = d, e.setParent(d, n), l && e.setEdge(l, d, { weight: 1 });
-}
-function Co(e) {
-  var t;
-  let r = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase();
-  (r === "lr" || r === "rl") && ur(e);
-}
-function So(e) {
-  var t;
-  let r = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase();
-  (r === "bt" || r === "rl") && Io(e), (r === "lr" || r === "rl") && (Oo(e), ur(e));
-}
-function ur(e) {
-  e.nodes().forEach((t) => Ct(e.node(t))), e.edges().forEach((t) => Ct(e.edge(t)));
-}
-function Ct(e) {
-  let t = e.width;
-  e.width = e.height, e.height = t;
-}
-function Io(e) {
-  e.nodes().forEach((t) => Re(e.node(t))), e.edges().forEach((t) => {
-    var r;
-    let n = e.edge(t);
-    (r = n.points) == null || r.forEach(Re), Object.hasOwn(n, "y") && Re(n);
-  });
-}
-function Re(e) {
-  e.y = -e.y;
-}
-function Oo(e) {
-  e.nodes().forEach((t) => De(e.node(t))), e.edges().forEach((t) => {
-    var r;
-    let n = e.edge(t);
-    (r = n.points) == null || r.forEach(De), Object.hasOwn(n, "x") && De(n);
-  });
-}
-function De(e) {
-  let t = e.x;
-  e.x = e.y, e.y = t;
-}
-function Mo(e) {
-  let t = {}, r = e.nodes().filter((l) => !e.children(l).length), n = r.map((l) => e.node(l).rank), o = K(Math.max, n), i = pe(o + 1).map(() => []);
-  function s(l) {
-    if (t[l]) return;
-    t[l] = !0;
-    let d = e.node(l);
-    i[d.rank].push(l);
-    let a = e.successors(l);
-    a && a.forEach(s);
-  }
-  return r.sort((l, d) => e.node(l).rank - e.node(d).rank).forEach(s), i;
-}
-function jo(e, t) {
-  let r = 0;
-  for (let n = 1; n < t.length; ++n) r += Fo(e, t[n - 1], t[n]);
-  return r;
-}
-function Fo(e, t, r) {
-  let n = Bn(r, r.map((a, c) => c)), o = t.flatMap((a) => {
-    let c = e.outEdges(a);
-    return c ? c.map((u) => ({ pos: n[u.w], weight: e.edge(u).weight })).sort((u, h) => u.pos - h.pos) : [];
-  }), i = 1;
-  for (; i < r.length; ) i <<= 1;
-  let s = 2 * i - 1;
-  i -= 1;
-  let l = new Array(s).fill(0), d = 0;
-  return o.forEach((a) => {
-    let c = a.pos + i;
-    l[c] += a.weight;
-    let u = 0;
-    for (; c > 0; ) c % 2 && (u += l[c + 1]), c = c - 1 >> 1, l[c] += a.weight;
-    d += a.weight * u;
-  }), d;
-}
-function zo(e, t = []) {
-  return t.map((r) => {
-    let n = e.inEdges(r);
-    if (!n || !n.length) return { v: r };
-    {
-      let o = n.reduce((i, s) => {
-        let l = e.edge(s), d = e.node(s.v);
-        return { sum: i.sum + l.weight * d.order, weight: i.weight + l.weight };
-      }, { sum: 0, weight: 0 });
-      return { v: r, barycenter: o.sum / o.weight, weight: o.weight };
-    }
-  });
-}
-function Ro(e, t) {
-  let r = {};
-  e.forEach((o, i) => {
-    let s = { indegree: 0, in: [], out: [], vs: [o.v], i };
-    o.barycenter !== void 0 && (s.barycenter = o.barycenter, s.weight = o.weight), r[o.v] = s;
-  }), t.edges().forEach((o) => {
-    let i = r[o.v], s = r[o.w];
-    i !== void 0 && s !== void 0 && (s.indegree++, i.out.push(s));
-  });
-  let n = Object.values(r).filter((o) => !o.indegree);
-  return Do(n);
-}
-function Do(e) {
-  let t = [];
-  function r(o) {
-    return (i) => {
-      i.merged || (i.barycenter === void 0 || o.barycenter === void 0 || i.barycenter >= o.barycenter) && Lo(o, i);
-    };
-  }
-  function n(o) {
-    return (i) => {
-      i.in.push(o), --i.indegree === 0 && e.push(i);
-    };
-  }
-  for (; e.length; ) {
-    let o = e.pop();
-    t.push(o), o.in.reverse().forEach(r(o)), o.out.forEach(n(o));
-  }
-  return t.filter((o) => !o.merged).map((o) => Te(o, ["vs", "i", "barycenter", "weight"]));
-}
-function Lo(e, t) {
-  let r = 0, n = 0;
-  e.weight && (r += e.barycenter * e.weight, n += e.weight), t.weight && (r += t.barycenter * t.weight, n += t.weight), e.vs = t.vs.concat(e.vs), e.barycenter = r / n, e.weight = n, e.i = Math.min(t.i, e.i), t.merged = !0;
-}
-function Ao(e, t) {
-  let r = An(e, (c) => Object.hasOwn(c, "barycenter")), n = r.lhs, o = r.rhs.sort((c, u) => u.i - c.i), i = [], s = 0, l = 0, d = 0;
-  n.sort(Po(!!t)), d = St(i, o, d), n.forEach((c) => {
-    d += c.vs.length, i.push(c.vs), s += c.barycenter * c.weight, l += c.weight, d = St(i, o, d);
-  });
-  let a = { vs: i.flat(1) };
-  return l && (a.barycenter = s / l, a.weight = l), a;
-}
-function St(e, t, r) {
-  let n;
-  for (; t.length && (n = t[t.length - 1]).i <= r; ) t.pop(), e.push(n.vs), r++;
-  return r;
-}
-function Po(e) {
-  return (t, r) => t.barycenter < r.barycenter ? -1 : t.barycenter > r.barycenter ? 1 : e ? r.i - t.i : t.i - r.i;
-}
-function fr(e, t, r, n) {
-  let o = e.children(t), i = e.node(t), s = i ? i.borderLeft : void 0, l = i ? i.borderRight : void 0, d = {};
-  s && (o = o.filter((h) => h !== s && h !== l));
-  let a = zo(e, o);
-  a.forEach((h) => {
-    if (e.children(h.v).length) {
-      let g = fr(e, h.v, r, n);
-      d[h.v] = g, Object.hasOwn(g, "barycenter") && Wo(h, g);
-    }
-  });
-  let c = Ro(a, r);
-  Bo(c, d);
-  let u = Ao(c, n);
-  if (s && l) {
-    u.vs = [s, u.vs, l].flat(1);
-    let h = e.predecessors(s);
-    if (h && h.length) {
-      let g = e.node(h[0]), b = e.predecessors(l), y = e.node(b[0]);
-      Object.hasOwn(u, "barycenter") || (u.barycenter = 0, u.weight = 0), u.barycenter = (u.barycenter * u.weight + g.order + y.order) / (u.weight + 2), u.weight += 2;
-    }
-  }
-  return u;
-}
-function Bo(e, t) {
-  e.forEach((r) => {
-    r.vs = r.vs.flatMap((n) => t[n] ? t[n].vs : n);
-  });
-}
-function Wo(e, t) {
-  e.barycenter !== void 0 ? (e.barycenter = (e.barycenter * e.weight + t.barycenter * t.weight) / (e.weight + t.weight), e.weight += t.weight) : (e.barycenter = t.barycenter, e.weight = t.weight);
-}
-function Go(e, t, r, n) {
-  n || (n = e.nodes());
-  let o = $o(e), i = new G({ compound: !0 }).setGraph({ root: o }).setDefaultNodeLabel((s) => e.node(s));
-  return n.forEach((s) => {
-    let l = e.node(s), d = e.parent(s);
-    if (l.rank === t || l.minRank <= t && t <= l.maxRank) {
-      i.setNode(s), i.setParent(s, d || o);
-      let a = e[r](s);
-      a && a.forEach((c) => {
-        let u = c.v === s ? c.w : c.v, h = i.edge(u, s), g = h !== void 0 ? h.weight : 0;
-        i.setEdge(u, s, { weight: e.edge(c).weight + g });
-      }), Object.hasOwn(l, "minRank") && i.setNode(s, { borderLeft: l.borderLeft[t], borderRight: l.borderRight[t] });
-    }
-  }), i;
-}
-function $o(e) {
-  let t;
-  for (; e.hasNode(t = He("_root")); ) ;
-  return t;
-}
-function Yo(e, t, r) {
-  let n = {}, o;
-  r.forEach((i) => {
-    let s = e.parent(i), l, d;
-    for (; s; ) {
-      if (l = e.parent(s), l ? (d = n[l], n[l] = s) : (d = o, o = s), d && d !== s) {
-        t.setEdge(d, s);
-        return;
-      }
-      s = l;
-    }
-  });
-}
-function hr(e, t = {}) {
-  if (typeof t.customOrder == "function") {
-    t.customOrder(e, hr);
-    return;
-  }
-  let r = tr(e), n = It(e, pe(1, r + 1), "inEdges"), o = It(e, pe(r - 1, -1, -1), "outEdges"), i = Mo(e);
-  if (Ot(e, i), t.disableOptimalOrderHeuristic) return;
-  let s = Number.POSITIVE_INFINITY, l, d = t.constraints || [];
-  for (let a = 0, c = 0; c < 4; ++a, ++c) {
-    Ko(a % 2 ? n : o, a % 4 >= 2, d), i = ye(e);
-    let u = jo(e, i);
-    u < s ? (c = 0, l = Object.assign({}, i), s = u) : u === s && (l = structuredClone(i));
-  }
-  Ot(e, l);
-}
-function It(e, t, r) {
-  let n = /* @__PURE__ */ new Map(), o = (i, s) => {
-    n.has(i) || n.set(i, []), n.get(i).push(s);
-  };
-  for (let i of e.nodes()) {
-    let s = e.node(i);
-    if (typeof s.rank == "number" && o(s.rank, i), typeof s.minRank == "number" && typeof s.maxRank == "number") for (let l = s.minRank; l <= s.maxRank; l++) l !== s.rank && o(l, i);
-  }
-  return t.map(function(i) {
-    return Go(e, i, r, n.get(i) || []);
-  });
-}
-function Ko(e, t, r) {
-  let n = new G();
-  e.forEach(function(o) {
-    r.forEach((l) => n.setEdge(l.left, l.right));
-    let i = o.graph().root, s = fr(o, i, n, t);
-    s.vs.forEach((l, d) => o.node(l).order = d), Yo(o, n, s.vs);
-  });
-}
-function Ot(e, t) {
-  Object.values(t).forEach((r) => r.forEach((n, o) => e.node(n).order = o));
-}
-function Uo(e, t) {
-  let r = {};
-  function n(o, i) {
-    let s = 0, l = 0, d = o.length, a = i[i.length - 1];
-    return i.forEach((c, u) => {
-      let h = Ho(e, c), g = h ? e.node(h).order : d;
-      (h || c === a) && (i.slice(l, u + 1).forEach((b) => {
-        let y = e.predecessors(b);
-        y && y.forEach((p) => {
-          let v = e.node(p), N = v.order;
-          (N < s || g < N) && !(v.dummy && e.node(b).dummy) && gr(r, p, b);
-        });
-      }), l = u + 1, s = g);
-    }), i;
-  }
-  return t.length && t.reduce(n), r;
-}
-function Vo(e, t) {
-  let r = {};
-  function n(i, s, l, d, a) {
-    pe(s, l).forEach((c) => {
-      let u = i[c];
-      if (u !== void 0 && e.node(u).dummy) {
-        let h = e.predecessors(u);
-        h && h.forEach((g) => {
-          if (g === void 0) return;
-          let b = e.node(g);
-          b.dummy && (b.order < d || b.order > a) && gr(r, g, u);
-        });
-      }
-    });
-  }
-  function o(i, s) {
-    let l = -1, d = -1, a = 0;
-    return s.forEach((c, u) => {
-      if (e.node(c).dummy === "border") {
-        let h = e.predecessors(c);
-        if (h && h.length) {
-          let g = h[0];
-          if (g === void 0) return;
-          d = e.node(g).order, n(s, a, u, l, d), a = u, l = d;
-        }
-      }
-      n(s, a, s.length, d, i.length);
-    }), s;
-  }
-  return t.length && t.reduce(o), r;
-}
-function Ho(e, t) {
-  if (e.node(t).dummy) {
-    let r = e.predecessors(t);
-    if (r) return r.find((n) => e.node(n).dummy);
-  }
-}
-function gr(e, t, r) {
-  if (t > r) {
-    let o = t;
-    t = r, r = o;
-  }
-  let n = e[t];
-  n || (e[t] = n = {}), n[r] = !0;
-}
-function qo(e, t, r) {
-  if (t > r) {
-    let o = t;
-    t = r, r = o;
-  }
-  let n = e[t];
-  return n !== void 0 && Object.hasOwn(n, r);
-}
-function Xo(e, t, r, n) {
-  let o = {}, i = {}, s = {};
-  return t.forEach((l) => {
-    l.forEach((d, a) => {
-      o[d] = d, i[d] = d, s[d] = a;
-    });
-  }), t.forEach((l) => {
-    let d = -1;
-    l.forEach((a) => {
-      let c = n(a);
-      if (c && c.length) {
-        let u = c.sort((g, b) => {
-          let y = s[g], p = s[b];
-          return (y !== void 0 ? y : 0) - (p !== void 0 ? p : 0);
-        }), h = (u.length - 1) / 2;
-        for (let g = Math.floor(h), b = Math.ceil(h); g <= b; ++g) {
-          let y = u[g];
-          if (y === void 0) continue;
-          let p = s[y];
-          if (p !== void 0 && i[a] === a && d < p && !qo(r, a, y)) {
-            let v = o[y];
-            v !== void 0 && (i[y] = a, i[a] = o[a] = v, d = p);
-          }
-        }
-      }
-    });
-  }), { root: o, align: i };
-}
-function Jo(e, t, r, n, o = !1) {
-  let i = {}, s = Zo(e, t, r, o), l = o ? "borderLeft" : "borderRight";
-  function d(g, b) {
-    let y = s.nodes().slice(), p = {}, v = y.pop();
-    for (; v; ) {
-      if (p[v]) g(v);
-      else {
-        p[v] = !0, y.push(v);
-        for (let N of b(v)) y.push(N);
-      }
-      v = y.pop();
-    }
-  }
-  function a(g) {
-    let b = s.inEdges(g);
-    b ? i[g] = b.reduce((y, p) => {
-      var v;
-      let N = (v = i[p.v]) != null ? v : 0, O = s.edge(p);
-      return Math.max(y, N + (O !== void 0 ? O : 0));
-    }, 0) : i[g] = 0;
-  }
-  function c(g) {
-    let b = s.outEdges(g), y = Number.POSITIVE_INFINITY;
-    b && (y = b.reduce((v, N) => {
-      let O = i[N.w], M = s.edge(N);
-      return Math.min(v, (O !== void 0 ? O : 0) - (M !== void 0 ? M : 0));
-    }, Number.POSITIVE_INFINITY));
-    let p = e.node(g);
-    y !== Number.POSITIVE_INFINITY && p.borderType !== l && (i[g] = Math.max(i[g] !== void 0 ? i[g] : 0, y));
-  }
-  function u(g) {
-    return s.predecessors(g) || [];
-  }
-  function h(g) {
-    return s.successors(g) || [];
-  }
-  return d(a, u), d(c, h), Object.keys(n).forEach((g) => {
-    var b;
-    let y = r[g];
-    y !== void 0 && (i[g] = (b = i[y]) != null ? b : 0);
-  }), i;
-}
-function Zo(e, t, r, n) {
-  let o = new G(), i = e.graph(), s = ni(i.nodesep, i.edgesep, n);
-  return t.forEach((l) => {
-    let d;
-    l.forEach((a) => {
-      let c = r[a];
-      if (c !== void 0) {
-        if (o.setNode(c), d !== void 0) {
-          let u = r[d];
-          if (u !== void 0) {
-            let h = o.edge(u, c);
-            o.setEdge(u, c, Math.max(s(e, a, d), h || 0));
-          }
-        }
-        d = a;
-      }
-    });
-  }), o;
-}
-function Qo(e, t) {
-  return Object.values(t).reduce((r, n) => {
-    let o = Number.NEGATIVE_INFINITY, i = Number.POSITIVE_INFINITY;
-    Object.entries(n).forEach(([l, d]) => {
-      let a = oi(e, l) / 2;
-      o = Math.max(d + a, o), i = Math.min(d - a, i);
-    });
-    let s = o - i;
-    return s < r[0] && (r = [s, n]), r;
-  }, [Number.POSITIVE_INFINITY, null])[1];
-}
-function ei(e, t) {
-  let r = Object.values(t), n = K(Math.min, r), o = K(Math.max, r);
-  ["u", "d"].forEach((i) => {
-    ["l", "r"].forEach((s) => {
-      let l = i + s, d = e[l];
-      if (!d || d === t) return;
-      let a = Object.values(d), c = n - K(Math.min, a);
-      s !== "l" && (c = o - K(Math.max, a)), c && (e[l] = Ne(d, (u) => u + c));
-    });
-  });
-}
-function ti(e, t = void 0) {
-  let r = e.ul;
-  return r ? Ne(r, (n, o) => {
-    var i, s;
-    if (t) {
-      let d = t.toLowerCase(), a = e[d];
-      if (a && a[o] !== void 0) return a[o];
-    }
-    let l = Object.values(e).map((d) => {
-      let a = d[o];
-      return a !== void 0 ? a : 0;
-    }).sort((d, a) => d - a);
-    return (((i = l[1]) != null ? i : 0) + ((s = l[2]) != null ? s : 0)) / 2;
-  }) : {};
-}
-function ri(e) {
-  let t = ye(e), r = Object.assign(Uo(e, t), Vo(e, t)), n = {}, o;
-  ["u", "d"].forEach((s) => {
-    o = s === "u" ? t : Object.values(t).reverse(), ["l", "r"].forEach((l) => {
-      l === "r" && (o = o.map((c) => Object.values(c).reverse()));
-      let d = Xo(e, o, r, (c) => (s === "u" ? e.predecessors(c) : e.successors(c)) || []), a = Jo(e, o, d.root, d.align, l === "r");
-      l === "r" && (a = Ne(a, (c) => -c)), n[s + l] = a;
-    });
-  });
-  let i = Qo(e, n);
-  return ei(n, i), ti(n, e.graph().align);
-}
-function ni(e, t, r) {
-  return (n, o, i) => {
-    let s = n.node(o), l = n.node(i), d = 0, a;
-    if (d += s.width / 2, Object.hasOwn(s, "labelpos")) switch (s.labelpos.toLowerCase()) {
-      case "l":
-        a = -s.width / 2;
-        break;
-      case "r":
-        a = s.width / 2;
-        break;
-    }
-    if (a && (d += r ? a : -a), a = void 0, d += (s.dummy ? t : e) / 2, d += (l.dummy ? t : e) / 2, d += l.width / 2, Object.hasOwn(l, "labelpos")) switch (l.labelpos.toLowerCase()) {
-      case "l":
-        a = l.width / 2;
-        break;
-      case "r":
-        a = -l.width / 2;
-        break;
-    }
-    return a && (d += r ? a : -a), d;
-  };
-}
-function oi(e, t) {
-  return e.node(t).width;
-}
-function ii(e) {
-  e = Qt(e), si(e), Object.entries(ri(e)).forEach(([t, r]) => e.node(t).x = r);
-}
-function si(e) {
-  let t = ye(e), r = e.graph(), n = r.ranksep, o = r.rankalign, i = 0;
-  t.forEach((s) => {
-    let l = s.reduce((d, a) => {
-      var c;
-      let u = (c = e.node(a).height) != null ? c : 0;
-      return d > u ? d : u;
-    }, 0);
-    s.forEach((d) => {
-      let a = e.node(d);
-      o === "top" ? a.y = i + a.height / 2 : o === "bottom" ? a.y = i + l - a.height / 2 : a.y = i + l / 2;
-    }), i += l + n;
-  });
-}
-function li(e, t = {}) {
-  let r = t.debugTiming ? rr : nr;
-  return r("layout", () => {
-    let n = r("  buildLayoutGraph", () => yi(e));
-    return r("  runLayout", () => ai(n, r, t)), r("  updateInputGraph", () => di(e, n)), n;
-  });
-}
-function ai(e, t, r) {
-  t("    makeSpaceForEdgeLabels", () => mi(e)), t("    removeSelfEdges", () => Ci(e)), t("    acyclic", () => Xn(e)), t("    nestingGraph.run", () => Eo(e)), t("    rank", () => ho(Qt(e))), t("    injectEdgeLabelProxies", () => wi(e)), t("    removeEmptyRanks", () => Dn(e)), t("    nestingGraph.cleanup", () => _o(e)), t("    normalizeRanks", () => Rn(e)), t("    assignRankMinMax", () => vi(e)), t("    removeEdgeLabelProxies", () => Ei(e)), t("    normalize.run", () => Qn(e)), t("    parentDummyChains", () => yo(e)), t("    addBorderSegments", () => To(e)), t("    order", () => hr(e, r)), t("    insertSelfEdges", () => Si(e)), t("    adjustCoordinateSystem", () => Co(e)), t("    position", () => ii(e)), t("    positionSelfEdges", () => Ii(e)), t("    removeBorderNodes", () => Ni(e)), t("    normalize.undo", () => to(e)), t("    fixupEdgeLabelCoords", () => _i(e)), t("    undoCoordinateSystem", () => So(e)), t("    translateGraph", () => ki(e)), t("    assignNodeIntersects", () => xi(e)), t("    reversePoints", () => Ti(e)), t("    acyclic.undo", () => Zn(e));
-}
-function di(e, t) {
-  e.nodes().forEach((r) => {
-    let n = e.node(r), o = t.node(r);
-    n && (n.x = o.x, n.y = o.y, n.order = o.order, n.rank = o.rank, t.children(r).length && (n.width = o.width, n.height = o.height));
-  }), e.edges().forEach((r) => {
-    let n = e.edge(r), o = t.edge(r);
-    n.points = o.points, Object.hasOwn(o, "x") && (n.x = o.x, n.y = o.y);
-  }), e.graph().width = t.graph().width, e.graph().height = t.graph().height;
-}
-var ci = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], ui = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "TB", rankalign: "center" }, fi = ["acyclicer", "ranker", "rankdir", "align", "rankalign"], hi = ["width", "height", "rank"], Mt = { width: 0, height: 0 }, gi = ["minlen", "weight", "width", "height", "labeloffset"], pi = { minlen: 1, weight: 1, width: 0, height: 0, labeloffset: 10, labelpos: "r" }, bi = ["labelpos"];
-function yi(e) {
-  let t = new G({ multigraph: !0, compound: !0 }), r = Ae(e.graph());
-  return t.setGraph(Object.assign({}, ui, Le(r, ci), Te(r, fi))), e.nodes().forEach((n) => {
-    let o = Ae(e.node(n)), i = Le(o, hi);
-    Object.keys(Mt).forEach((l) => {
-      i[l] === void 0 && (i[l] = Mt[l]);
-    }), t.setNode(n, i);
-    let s = e.parent(n);
-    s !== void 0 && t.setParent(n, s);
-  }), e.edges().forEach((n) => {
-    let o = Ae(e.edge(n));
-    t.setEdge(n, Object.assign({}, pi, Le(o, gi), Te(o, bi)));
-  }), t;
-}
-function mi(e) {
-  let t = e.graph();
-  t.ranksep /= 2, e.edges().forEach((r) => {
-    let n = e.edge(r);
-    n.minlen *= 2, n.labelpos.toLowerCase() !== "c" && (t.rankdir === "TB" || t.rankdir === "BT" ? n.width += n.labeloffset : n.height += n.labeloffset);
-  });
-}
-function wi(e) {
-  e.edges().forEach((t) => {
-    let r = e.edge(t);
-    if (r.width && r.height) {
-      let n = e.node(t.v), o = { rank: (e.node(t.w).rank - n.rank) / 2 + n.rank, e: t };
-      fe(e, "edge-proxy", o, "_ep");
-    }
-  });
-}
-function vi(e) {
-  let t = 0;
-  e.nodes().forEach((r) => {
-    let n = e.node(r);
-    n.borderTop && (n.minRank = e.node(n.borderTop).rank, n.maxRank = e.node(n.borderBottom).rank, t = Math.max(t, n.maxRank));
-  }), e.graph().maxRank = t;
-}
-function Ei(e) {
-  e.nodes().forEach((t) => {
-    let r = e.node(t);
-    if (r.dummy === "edge-proxy") {
-      let n = r;
-      e.edge(n.e).labelRank = r.rank, e.removeNode(t);
-    }
-  });
-}
-function ki(e) {
-  let t = Number.POSITIVE_INFINITY, r = 0, n = Number.POSITIVE_INFINITY, o = 0, i = e.graph(), s = i.marginx || 0, l = i.marginy || 0;
-  function d(a) {
-    let c = a.x, u = a.y, h = a.width, g = a.height;
-    t = Math.min(t, c - h / 2), r = Math.max(r, c + h / 2), n = Math.min(n, u - g / 2), o = Math.max(o, u + g / 2);
-  }
-  e.nodes().forEach((a) => d(e.node(a))), e.edges().forEach((a) => {
-    let c = e.edge(a);
-    Object.hasOwn(c, "x") && d(c);
-  }), t -= s, n -= l, e.nodes().forEach((a) => {
-    let c = e.node(a);
-    c.x -= t, c.y -= n;
-  }), e.edges().forEach((a) => {
-    let c = e.edge(a);
-    c.points.forEach((u) => {
-      u.x -= t, u.y -= n;
-    }), Object.hasOwn(c, "x") && (c.x -= t), Object.hasOwn(c, "y") && (c.y -= n);
-  }), i.width = r - t + s, i.height = o - n + l;
-}
-function xi(e) {
-  e.edges().forEach((t) => {
-    let r = e.edge(t), n = e.node(t.v), o = e.node(t.w), i, s;
-    r.points ? (i = r.points[0], s = r.points[r.points.length - 1]) : (r.points = [], i = o, s = n), r.points.unshift(Et(n, i)), r.points.push(Et(o, s));
-  });
-}
-function _i(e) {
-  e.edges().forEach((t) => {
-    let r = e.edge(t);
-    if (Object.hasOwn(r, "x")) switch ((r.labelpos === "l" || r.labelpos === "r") && (r.width -= r.labeloffset), r.labelpos) {
-      case "l":
-        r.x -= r.width / 2 + r.labeloffset;
-        break;
-      case "r":
-        r.x += r.width / 2 + r.labeloffset;
-        break;
-    }
-  });
-}
-function Ti(e) {
-  e.edges().forEach((t) => {
-    let r = e.edge(t);
-    r.reversed && r.points.reverse();
-  });
-}
-function Ni(e) {
-  e.nodes().forEach((t) => {
-    if (e.children(t).length) {
-      let r = e.node(t), n = e.node(r.borderTop), o = e.node(r.borderBottom), i = e.node(r.borderLeft[r.borderLeft.length - 1]), s = e.node(r.borderRight[r.borderRight.length - 1]);
-      r.width = Math.abs(s.x - i.x), r.height = Math.abs(o.y - n.y), r.x = i.x + r.width / 2, r.y = n.y + r.height / 2;
-    }
-  }), e.nodes().forEach((t) => {
-    e.node(t).dummy === "border" && e.removeNode(t);
-  });
-}
-function Ci(e) {
-  e.edges().forEach((t) => {
-    if (t.v === t.w) {
-      let r = e.node(t.v);
-      r.selfEdges || (r.selfEdges = []), r.selfEdges.push({ e: t, label: e.edge(t) }), e.removeEdge(t);
-    }
-  });
-}
-function Si(e) {
-  ye(e).forEach((t) => {
-    let r = 0;
-    t.forEach((n, o) => {
-      let i = e.node(n);
-      i.order = o + r, (i.selfEdges || []).forEach((s) => {
-        fe(e, "selfedge", { width: s.label.width, height: s.label.height, rank: i.rank, order: o + ++r, e: s.e, label: s.label }, "_se");
-      }), delete i.selfEdges;
-    });
-  });
-}
-function Ii(e) {
-  e.nodes().forEach((t) => {
-    let r = e.node(t);
-    if (r.dummy === "selfedge") {
-      let n = r, o = e.node(n.e.v), i = o.x + o.width / 2, s = o.y, l = r.x - i, d = o.height / 2;
-      e.setEdge(n.e, n.label), e.removeNode(t), n.label.points = [{ x: i + 2 * l / 3, y: s - d }, { x: i + 5 * l / 6, y: s - d }, { x: i + l, y: s }, { x: i + 5 * l / 6, y: s + d }, { x: i + 2 * l / 3, y: s + d }], n.label.x = r.x, n.label.y = r.y;
-    }
-  });
-}
-function Le(e, t) {
-  return Ne(Te(e, t), Number);
-}
-function Ae(e) {
-  let t = {};
-  return e && Object.entries(e).forEach(([r, n]) => {
-    typeof r == "string" && (r = r.toLowerCase()), t[r] = n;
-  }), t;
-}
-function Oi(e) {
-  let t = ye(e), r = new G({ compound: !0, multigraph: !0 }).setGraph({});
-  return e.nodes().forEach((n) => {
-    r.setNode(n, { label: n }), r.setParent(n, "layer" + e.node(n).rank);
-  }), e.edges().forEach((n) => r.setEdge(n.v, n.w, {}, n.name)), t.forEach((n, o) => {
-    let i = "layer" + o;
-    r.setNode(i, { rank: "same" }), n.reduce((s, l) => (r.setEdge(s, l, { style: "invis" }), l));
-  }), r;
-}
-var Mi = { graphlib: Yt, version: Wn, layout: li, debug: Oi, util: { time: rr, notime: nr } }, jt = Mi;
-/*! For license information please see dagre.esm.js.LEGAL.txt */
-const ji = (e) => {
-  const t = [];
-  return e.nodeInternals.forEach((r, n) => t.push(`${n}:${r.height ?? 0}`)), t.join(",");
-}, Fi = ({ onHeightsReady: e, nodeCount: t }) => {
-  const r = Tr(ji), n = pt("");
-  pt(0);
-  const { fitView: o } = Nr();
-  return ie(() => {
-    if (!r || r === n.current) return;
-    const i = {};
-    for (const s of r.split(",")) {
-      const [l, d] = s.split(":"), a = Number(d);
-      l && a > 0 && (i[l] = a);
-    }
-    Object.keys(i).length !== 0 && (n.current = r, e(i));
-  }, [r]), null;
-}, Se = ({ isOpen: e, onClose: t, title: r, icon: n, children: o, footer: i, width: s = 600 }) => {
-  const [l, d] = j(!1), a = () => d((h) => !h), c = () => /* @__PURE__ */ w(te, { sx: { display: "flex", alignItems: "center", p: 2, pt: 3, borderBottom: "1px solid #e0e0e0", mb: 0, flexShrink: 0 }, children: [
-    n && /* @__PURE__ */ f(te, { sx: { mr: 1.5, display: "flex", alignItems: "center", fontSize: "1.25rem", color: "#1DBF60" }, children: n }),
-    /* @__PURE__ */ f("span", { style: { flexGrow: 1, fontSize: 14, fontWeight: 500, color: "#212121" }, children: r }),
-    /* @__PURE__ */ f(bt, { onClick: a, size: "small", sx: { mr: 1 }, title: l ? "Collapse" : "Expand", "data-testid": "expand-collapse-base-drawer-btn", children: l ? /* @__PURE__ */ f(tn, {}) : /* @__PURE__ */ f(rn, {}) }),
-    /* @__PURE__ */ f(bt, { onClick: t, size: "small", "data-testid": "close-drawer-button", children: /* @__PURE__ */ f(Pr, {}) })
-  ] }), u = () => i ? /* @__PURE__ */ f(te, { sx: { flexShrink: 0, p: 2, borderTop: "1px solid #e0e0e0", display: "flex", justifyContent: "flex-end", gap: 2 }, children: i }) : null;
-  return l ? /* @__PURE__ */ w(Lr, { open: e, onClose: t, maxWidth: !1, fullWidth: !0, PaperProps: { sx: { display: "flex", flexDirection: "column", height: "80vh", boxShadow: 24, width: "750px", maxWidth: "100%" } }, children: [
-    /* @__PURE__ */ f(c, {}),
-    /* @__PURE__ */ f(te, { sx: { flexGrow: 1, overflowY: "auto", p: 0 }, children: o }),
-    /* @__PURE__ */ f(u, {})
-  ] }) : /* @__PURE__ */ w(
-    Ar,
-    {
-      anchor: "right",
-      open: e,
-      onClose: t,
-      variant: "persistent",
-      sx: { zIndex: 900 },
-      ModalProps: { keepMounted: !1 },
-      PaperProps: {
-        sx: {
-          width: s,
-          position: "fixed",
-          top: "64px",
-          height: "calc(100% - 74px)",
-          right: "10px",
-          borderRadius: "8px",
-          border: "1px solid #bdbdbd",
-          boxShadow: "none",
-          zIndex: 900,
-          display: "flex",
-          flexDirection: "column"
-        }
-      },
-      children: [
-        /* @__PURE__ */ f(c, {}),
-        /* @__PURE__ */ f(te, { sx: { flexGrow: 1, overflowY: "auto", p: 0 }, children: o }),
-        /* @__PURE__ */ f(u, {})
-      ]
-    }
-  );
-}, zi = ({ open: e, templates: t, messages: r, onSelect: n, onClose: o }) => /* @__PURE__ */ f(Se, { isOpen: e, onClose: o, title: r.addTriggerTitle, icon: /* @__PURE__ */ f(en, {}), width: 500, children: /* @__PURE__ */ w(te, { sx: { p: 2 }, children: [
-  /* @__PURE__ */ f("p", { className: "ff-text-muted ff-mb-3", style: { fontSize: 13 }, children: r.chooseTrigger }),
-  /* @__PURE__ */ w("div", { className: "ff-d-flex ff-flex-column ff-gap-2", children: [
-    t.map((i) => /* @__PURE__ */ w(
-      "div",
-      {
-        className: "ff-p-3 ff-rounded ff-border ff-d-flex ff-align-items-start ff-gap-3",
-        style: { cursor: "pointer", transition: "background 0.15s" },
-        onClick: () => n(i),
-        role: "button",
-        tabIndex: 0,
-        onKeyDown: (s) => {
-          s.key === "Enter" && n(i);
-        },
-        onMouseEnter: (s) => {
-          s.currentTarget.style.background = "#f5f5f5";
-        },
-        onMouseLeave: (s) => {
-          s.currentTarget.style.background = "";
-        },
-        children: [
-          /* @__PURE__ */ f("div", { style: { color: i.triggerCategory === "scheduler" ? "#1976d2" : "#f57c00", marginTop: 2, flexShrink: 0 }, children: i.triggerCategory === "scheduler" ? /* @__PURE__ */ f(Br, { size: 18 }) : /* @__PURE__ */ f(Wr, { size: 18 }) }),
-          /* @__PURE__ */ w("div", { children: [
-            /* @__PURE__ */ f("div", { style: { fontSize: 14, fontWeight: 500, color: "#212121" }, children: i.label }),
-            i.description && /* @__PURE__ */ f("div", { style: { fontSize: 12, color: "#757575", marginTop: 2 }, children: i.description })
-          ] })
-        ]
-      },
-      i.triggerKey
-    )),
-    t.length === 0 && /* @__PURE__ */ f("p", { className: "ff-text-muted ff-text-center", style: { fontSize: 13 }, children: r.noTriggers })
-  ] })
-] }) }), Pe = {
-  cursor: "pointer",
-  transition: "background 0.15s"
-}, Be = "ff-p-3 ff-rounded ff-border ff-d-flex ff-align-items-center ff-gap-3", Ri = ({ open: e, availableDescriptors: t, messages: r, onSelect: n, onClose: o }) => {
-  const { apps: i, ungrouped: s } = W(() => {
-    const u = /* @__PURE__ */ new Map(), h = [];
-    for (const g of t)
-      if (g.app) {
-        const b = u.get(g.app.key);
-        b ? b.descriptors.push(g) : u.set(g.app.key, {
-          key: g.app.key,
-          label: g.app.label,
-          icon: g.app.icon,
-          description: g.app.description,
-          descriptors: [g]
-        });
-      } else
-        h.push(g);
-    return { apps: [...u.values()], ungrouped: h };
-  }, [t]), [l, d] = j(null), a = l ? i.find((u) => u.key === l) ?? null : null;
-  ie(() => {
-    e || d(null);
-  }, [e]), ie(() => {
-    d(null);
-  }, [t]);
-  const c = !a;
-  return /* @__PURE__ */ f(
-    Se,
-    {
-      isOpen: e,
-      onClose: o,
-      title: c ? r.addStepTitle : a.label,
-      icon: c ? /* @__PURE__ */ f($r, {}) : a.icon ?? /* @__PURE__ */ f(Yr, {}),
-      width: 500,
-      children: /* @__PURE__ */ w(te, { sx: { p: 2 }, children: [
-        !c && /* @__PURE__ */ w(
-          "div",
-          {
-            role: "button",
-            tabIndex: 0,
-            onClick: () => d(null),
-            onKeyDown: (u) => {
-              u.key === "Enter" && d(null);
-            },
-            className: "ff-d-flex ff-align-items-center ff-gap-1 ff-mb-3",
-            style: { cursor: "pointer", color: "#0066cc", fontSize: 13, fontWeight: 500, width: "fit-content" },
-            children: [
-              /* @__PURE__ */ f(Gr, { size: 16 }),
-              /* @__PURE__ */ f("span", { children: r.addStepTitle })
-            ]
-          }
-        ),
-        /* @__PURE__ */ f("p", { className: "ff-text-muted ff-mb-3", style: { fontSize: 13 }, children: c ? r.chooseAction : `Pick an action from ${a.label}` }),
-        /* @__PURE__ */ f("div", { className: "ff-d-flex ff-flex-column ff-gap-2", children: c ? /* @__PURE__ */ w(Lt, { children: [
-          i.map((u) => /* @__PURE__ */ w(
-            "div",
-            {
-              className: Be,
-              style: Pe,
-              onClick: () => d(u.key),
-              role: "button",
-              tabIndex: 0,
-              onKeyDown: (h) => {
-                h.key === "Enter" && d(u.key);
-              },
-              onMouseEnter: (h) => {
-                h.currentTarget.style.background = "#f5f5f5";
-              },
-              onMouseLeave: (h) => {
-                h.currentTarget.style.background = "";
-              },
-              children: [
-                u.icon && /* @__PURE__ */ f("div", { style: { flexShrink: 0 }, children: u.icon }),
-                /* @__PURE__ */ w("div", { style: { flex: 1, minWidth: 0 }, children: [
-                  /* @__PURE__ */ f("div", { style: { fontSize: 14, fontWeight: 500, color: "#212121" }, children: u.label }),
-                  /* @__PURE__ */ f("div", { style: { fontSize: 12, color: "#757575", marginTop: 2 }, children: u.description ?? `${u.descriptors.length} action${u.descriptors.length === 1 ? "" : "s"}` })
-                ] }),
-                /* @__PURE__ */ f(At, { size: 18, color: "#9e9e9e" })
-              ]
-            },
-            `app-${u.key}`
-          )),
-          s.map((u) => /* @__PURE__ */ w(
-            "div",
-            {
-              className: Be,
-              style: Pe,
-              onClick: () => n(u),
-              role: "button",
-              tabIndex: 0,
-              onKeyDown: (h) => {
-                h.key === "Enter" && n(u);
-              },
-              onMouseEnter: (h) => {
-                h.currentTarget.style.background = "#f5f5f5";
-              },
-              onMouseLeave: (h) => {
-                h.currentTarget.style.background = "";
-              },
-              children: [
-                u.icon && /* @__PURE__ */ f("div", { style: { flexShrink: 0 }, children: u.icon }),
-                /* @__PURE__ */ f("span", { style: { fontSize: 14, fontWeight: 500, color: "#212121" }, children: u.label })
-              ]
-            },
-            u.type
-          )),
-          i.length === 0 && s.length === 0 && /* @__PURE__ */ f("p", { className: "ff-text-muted ff-text-center", style: { fontSize: 13 }, children: r.noActions })
-        ] }) : (
-          /* Stage 2 — actions for the selected app */
-          a.descriptors.map((u) => /* @__PURE__ */ w(
-            "div",
-            {
-              className: Be,
-              style: Pe,
-              onClick: () => n(u),
-              role: "button",
-              tabIndex: 0,
-              onKeyDown: (h) => {
-                h.key === "Enter" && n(u);
-              },
-              onMouseEnter: (h) => {
-                h.currentTarget.style.background = "#f5f5f5";
-              },
-              onMouseLeave: (h) => {
-                h.currentTarget.style.background = "";
-              },
-              children: [
-                u.icon && /* @__PURE__ */ f("div", { style: { flexShrink: 0 }, children: u.icon }),
-                /* @__PURE__ */ f("span", { style: { fontSize: 14, fontWeight: 500, color: "#212121" }, children: u.label })
-              ]
-            },
-            u.type
-          ))
-        ) })
-      ] })
-    }
-  );
-}, Ft = "_conditionConfig", Di = ({ open: e, nodeId: t, descriptor: r, initialValues: n, messages: o, onSave: i, onClose: s }) => {
-  const [l, d] = j([]), [a, c] = j(!1), [u, h] = j(null), [g, b] = j({});
-  ie(() => {
-    b((n == null ? void 0 : n[Ft]) ?? {});
-  }, [n, t]), ie(() => {
-    let N = !1;
-    if (h(null), !r || !t) {
-      d([]), c(!1);
-      return;
-    }
-    const O = r.formSchema;
-    return typeof O == "function" ? (c(!0), O(t).then((M) => {
-      N || (d(M), c(!1));
-    }).catch((M) => {
-      N || (d([]), h(M instanceof Error ? M.message : "Unable to load configuration."), c(!1));
-    })) : (d(O), c(!1)), () => {
-      N = !0;
-    };
-  }, [r, t]);
-  const y = t ? `node-config-form-${t}` : "node-config-form", p = !a && !u && l.length > 0, v = p ? /* @__PURE__ */ w(Lt, { children: [
-    /* @__PURE__ */ f(yt, { type: "button", variant: "outlined", size: "small", onClick: s, children: o.cancel }),
-    /* @__PURE__ */ f(yt, { type: "submit", form: y, variant: "contained", size: "small", children: o.save })
-  ] }) : null;
-  return /* @__PURE__ */ f(
-    Se,
-    {
-      isOpen: e,
-      onClose: s,
-      title: (r == null ? void 0 : r.label) ?? o.configureStep,
-      icon: r == null ? void 0 : r.icon,
-      width: 500,
-      footer: v,
-      children: /* @__PURE__ */ w(te, { sx: { p: 2 }, children: [
-        a && /* @__PURE__ */ f("p", { className: "ff-text-muted", style: { fontSize: 13 }, children: o.loadingConfiguration }),
-        !a && u && /* @__PURE__ */ f("p", { style: { fontSize: 13, color: "#d32f2f" }, children: u }),
-        !a && !u && l.length === 0 && /* @__PURE__ */ f("p", { className: "ff-text-muted", style: { fontSize: 13 }, children: o.noConfigurationNeeded }),
-        p && /* @__PURE__ */ f(
-          nn,
-          {
-            schema: { layout: "flat", fields: l },
-            initialValues: n ?? {},
-            formId: y,
-            conditionConfig: g,
-            onConditionConfigChange: b,
-            onSubmit: (N) => {
-              if (!t) return;
-              const O = Object.keys(g).length > 0;
-              i(t, { ...N, [Ft]: O ? g : void 0 }), s();
-            }
-          }
-        )
-      ] })
-    }
-  );
-}, Li = ({
-  isOpen: e,
-  onClose: t,
-  workflowId: r,
-  workflowLabel: n,
-  onFetchWorkflow: o
-}) => {
-  const [i, s] = j({ status: "idle" });
-  return ie(() => {
-    if (!e || !r) {
-      s({ status: "idle" });
-      return;
-    }
-    s({ status: "loading" }), o(r).then((l) => s({ status: "loaded", state: l })).catch((l) => s({ status: "error", message: (l == null ? void 0 : l.message) ?? "Failed to load workflow" }));
-  }, [e, r, o]), /* @__PURE__ */ f(
-    Se,
-    {
-      isOpen: e,
-      onClose: t,
-      title: n ? `Preview: ${n}` : "Sub-Workflow Preview",
-      icon: /* @__PURE__ */ f(Ur, { size: 18, color: "#00695c" }),
-      width: 700,
-      children: /* @__PURE__ */ w("div", { style: { height: "100%", display: "flex", flexDirection: "column", alignItems: "center", justifyContent: "center", padding: 24 }, children: [
-        i.status === "idle" && /* @__PURE__ */ f("span", { style: { color: "#9e9e9e", fontSize: 14 }, children: "Select a workflow to preview" }),
-        i.status === "loading" && /* @__PURE__ */ w("div", { style: { textAlign: "center", color: "#9e9e9e" }, children: [
-          /* @__PURE__ */ f("div", { style: { width: 32, height: 32, borderRadius: "50%", border: "3px solid #e0e0e0", borderTopColor: "#00897b", animation: "spin 0.8s linear infinite", margin: "0 auto 12px" } }),
-          /* @__PURE__ */ f("span", { style: { fontSize: 14 }, children: "Loading workflow…" }),
-          /* @__PURE__ */ f("style", { children: "@keyframes spin { to { transform: rotate(360deg); } }" })
-        ] }),
-        i.status === "error" && /* @__PURE__ */ w("div", { style: { textAlign: "center", color: "#c62828" }, children: [
-          /* @__PURE__ */ f(Kr, { size: 32, style: { marginBottom: 8 } }),
-          /* @__PURE__ */ f("p", { style: { margin: 0, fontSize: 14 }, children: i.message })
-        ] }),
-        i.status === "loaded" && /* @__PURE__ */ f("div", { style: { width: "100%", flex: 1 }, children: /* @__PURE__ */ f(Ai, { state: i.state }) })
-      ] })
-    }
-  );
-}, Ai = ({ state: e }) => {
-  const [t, r] = j(null), [n, o] = j(null);
-  return ie(() => {
-    Promise.all([
-      Promise.resolve().then(() => Yi).then((i) => i.default),
-      import("./nodeRegistry.js").then((i) => i.nodeTypeRegistry),
-      import("./templateRegistry.js").then((i) => i.templateRegistry)
-    ]).then(([i, s, l]) => {
-      r(() => i), o({ nodeTypeRegistry: s, templateRegistry: l });
-    });
-  }, []), !t || !n ? /* @__PURE__ */ f("div", { style: { color: "#9e9e9e", fontSize: 13, textAlign: "center" }, children: "Loading canvas…" }) : /* @__PURE__ */ f("div", { style: { width: "100%", height: 480, border: "1px solid #e0e0e0", borderRadius: 8, overflow: "hidden" }, children: /* @__PURE__ */ f(
-    t,
-    {
-      nodeRegistry: n.nodeTypeRegistry,
-      templateRegistry: n.templateRegistry,
-      initialValue: e,
-      readOnly: !0
-    }
-  ) });
-}, be = 350, $e = 70, Ye = 60, Ke = {
-  startNode: 40,
-  endNode: 40,
-  addTriggerNode: 56,
-  triggerNode: 110,
-  actionNode: 90,
-  filterNode: 90,
-  approvalNode: 90,
-  delayNode: 80,
-  notificationNode: 80
-}, Pi = {
-  plusEdge: Rr,
-  labelPlusEdge: zr,
-  plainEdge: Fr,
-  edgeWithPlusLabel: jr,
-  gatewayBranchEdge: Mr
-};
-function zt() {
-  return [
-    { id: "start", kind: "start", reactFlowType: "startNode" },
-    { id: "addTrigger", kind: "addTrigger", reactFlowType: "addTriggerNode" },
-    { id: "end", kind: "end", reactFlowType: "endNode" }
-  ];
-}
-function Bi(e, t, r, n = "TB") {
-  const o = new jt.graphlib.Graph();
-  return o.setGraph({ rankdir: n, ranksep: 70, nodesep: 50 }), o.setDefaultEdgeLabel(() => ({})), e.forEach((i) => {
-    const s = r[i.id] ?? { width: be, height: Ke[i.type ?? ""] ?? 80 };
-    o.setNode(i.id, { width: s.width, height: s.height });
-  }), t.forEach((i) => o.setEdge(i.source, i.target)), jt.layout(o), e.map((i) => {
-    var a, c;
-    const s = o.node(i.id), l = ((a = r[i.id]) == null ? void 0 : a.width) ?? be, d = ((c = r[i.id]) == null ? void 0 : c.height) ?? Ke[i.type ?? ""] ?? 80;
-    return { ...i, position: { x: s.x - l / 2, y: s.y - d / 2 } };
-  });
-}
-const oe = (e) => e === "filter" || e === "approval";
-function Wi(e, t, r, n) {
-  const s = $e, l = 30, d = 30, a = {}, c = {}, u = /* @__PURE__ */ new Map();
-  for (const p of e) u.set(p.id, p);
-  for (const p of Object.values(t))
-    for (const v of Object.values(p))
-      for (const N of v) u.set(N.id, N);
-  const h = (p, v, N) => {
-    const O = n[p] ?? { width: be, height: 80 };
-    return a[p] = { x: v - O.width / 2, y: N }, N + O.height;
-  }, g = (p, v, N) => {
-    let O = N;
-    for (const M of p)
-      O = h(M.id, v, O) + s, oe(M.kind) && t[M.id] && (O = b(M.id, v, O));
-    return O;
-  }, b = (p, v, N) => {
-    const O = v + 180, M = t[p], F = Object.keys(M), B = u.get(p), re = (B == null ? void 0 : B.branchLabels) ?? { pass: "Pass", fail: "Fail" }, he = a[p], z = n[p] ?? { height: 80 }, me = he.y + z.height, we = [];
-    let U = N;
-    return F.forEach((le, Z) => {
-      const R = M[le], V = U;
-      we.push({
-        y: V - me,
-        label: re[le] ?? le,
-        isPass: Z === 0
-      }), U = g(R, O, U + d), Z < F.length - 1 && (U += l);
-    }), c[p] = {
-      branches: we,
-      height: U - me,
-      indent: 180
-    }, U;
-  };
-  let y = Ye;
-  for (const p of e)
-    y = h(p.id, 400, y) + s, oe(p.kind) && t[p.id] && (y = b(p.id, 400, y));
-  return {
-    nodes: r.map((p) => a[p.id] ? { ...p, position: a[p.id] } : p),
-    railSpecs: c
-  };
-}
-function Rt(e) {
-  return {
-    id: e.id,
-    type: e.reactFlowType,
-    position: { x: 0, y: 0 },
-    data: { ...e.nodeData, ...e.formData, descriptorType: e.descriptorType },
-    draggable: !1,
-    selectable: !1
-  };
-}
-function Gi(e, t, r, n, o) {
-  return {
-    id: `e-${e.id}-${t.id}`,
-    source: e.id,
-    target: t.id,
-    type: "plusEdge",
-    style: { stroke: r },
-    data: {
-      onAddStepClick: n,
-      referenceNodeType: e.reactFlowType,
-      ...o ?? {}
-    }
-  };
-}
-function $i(e, t, r, n, o = {}, i = "TB", s = "horizontal") {
-  const l = o.edgeColor ?? "#b0bec5", d = [], a = [], c = (b, y) => {
-    const p = t[b];
-    if (!p) return;
-    const N = y ?? { pass: "Pass", fail: "Fail" }, O = Object.keys(p), M = (F, B, re, he) => {
-      if (F.length !== 0) {
-        F.forEach((z) => d.push(Rt(z))), a.push({
-          id: `e-${b}-${B}-start`,
-          source: b,
-          target: F[0].id,
-          type: "gatewayBranchEdge",
-          style: { stroke: l },
-          data: { branch: B, filterId: b, label: re, isFirst: he === 0, onAddStepClick: r, verticalRouting: s === "vertical" }
-        });
-        for (let z = 1; z < F.length; z++)
-          oe(F[z - 1].kind) || a.push(Gi(F[z - 1], F[z], l, r, { filterId: b, branch: B }));
-        for (const z of F)
-          oe(z.kind) && t[z.id] && c(z.id, z.branchLabels);
-      }
-    };
-    O.forEach((F, B) => {
-      M(p[F], F, N[F] ?? F, B);
-    });
-  };
-  for (let b = 0; b < e.length; b++) {
-    const y = e[b];
-    if (d.push(Rt(y)), b > 0) {
-      const p = e[b - 1], v = p.kind === "start" || p.kind === "addTrigger";
-      if (p.kind === "filter" || p.kind === "approval") continue;
-      a.push({
-        id: `e-${p.id}-${y.id}`,
-        source: p.id,
-        target: y.id,
-        type: v ? "plainEdge" : "plusEdge",
-        style: { stroke: l },
-        data: v ? {} : {
-          onAddStepClick: r,
-          referenceNodeType: p.reactFlowType
-        }
-      });
-    }
-    (y.kind === "filter" || y.kind === "approval") && t[y.id] && c(y.id, y.branchLabels);
-  }
-  const u = {};
-  if (d.forEach((b) => {
-    u[b.id] = {
-      width: be,
-      height: n[b.id] ?? Ke[b.type ?? ""] ?? 80
-    };
-  }), !(Object.keys(t).length > 0)) {
-    if (i === "LR") {
-      let N = Ye;
-      return { nodes: d.map((M) => {
-        const F = u[M.id].width, B = u[M.id].height, re = { ...M, position: { x: N, y: 300 - B / 2 } };
-        return N += F + $e, re;
-      }), edges: a };
-    }
-    const b = 400;
-    let y = Ye;
-    return { nodes: d.map((v) => {
-      const N = u[v.id].height, O = { ...v, position: { x: b - be / 2, y } };
-      return y += N + $e, O;
-    }), edges: a };
-  }
-  if (s === "vertical") {
-    const { nodes: b, railSpecs: y } = Wi(e, t, d, u);
-    return { nodes: b.map(
-      (v) => y[v.id] ? { ...v, data: { ...v.data, _branchRail: y[v.id] } } : v
-    ), edges: a };
-  }
-  return { nodes: Bi(d, a, u, i), edges: a };
-}
-const Dt = ({
-  nodeRegistry: e,
-  templateRegistry: t,
-  initialValue: r,
-  nodeTypes: n,
-  edgeTypes: o,
-  onSave: i,
-  readOnly: s = !1,
-  theme: l = {},
-  messages: d,
-  canvasOptions: a = {},
-  renderTriggerSelector: c,
-  renderNodePicker: u,
-  renderNodeConfig: h,
-  onNodeClick: g,
-  maxNodes: b,
-  layoutDirection: y = "TB",
-  executionRecord: p,
-  onFetchWorkflow: v
-}) => {
-  const {
-    fitView: N = !0,
-    fitViewPadding: O = 0.3,
-    showControls: M = !0,
-    showMiniMap: F = !1,
-    panOnScroll: B = !0,
-    zoomOnScroll: re = !1,
-    minZoom: he = 0.25,
-    maxZoom: z = 2,
-    snapToGrid: me = !1,
-    snapGrid: we = [15, 15],
-    branchLayout: U = "horizontal",
-    nodeBody: le = "full"
-  } = a, Z = W(() => on(d), [d]), [R, V] = j(() => (r == null ? void 0 : r.slots) ?? zt()), [H, q] = j(() => (r == null ? void 0 : r.branches) ?? {}), [ae, $] = j(null), [Ie, Ze] = j(null), [de, ve] = j(null), [Oe, Qe] = j(null), [Ee, et] = j(null), [Q, tt] = j(() => {
-    const m = r == null ? void 0 : r.slots.find((k) => k.kind === "triggerFixed"), E = m != null && m.id.startsWith("trigger-") ? m.id.slice(8) : void 0;
-    return E ? t.lookup(E) ?? null : null;
-  }), [rt, br] = j({}), yr = Y((m) => {
-    br(m);
-  }, []), mr = W(() => ({ ...Or, ...n }), [n]), wr = W(() => ({ ...Pi, ...o }), [o]), vr = W(() => {
-    const m = R.filter((k) => k.kind === "userTask").length, E = Object.values(H).flatMap((k) => Object.values(k).flat()).filter((k) => k.kind === "userTask").length;
-    return m + E;
-  }, [R, H]), nt = b ?? (Q == null ? void 0 : Q.maxTasks), ot = nt !== void 0 && vr >= nt, ne = Y((m) => {
-    const E = R.find((k) => k.id === m);
-    if (E) return E;
-    for (const k of Object.values(H)) {
-      const C = Object.values(k).flat().find((x) => x.id === m);
-      if (C) return C;
-    }
-    return null;
-  }, [R, H]), Me = Y((m) => {
-    s || (Ze(m), $("nodeConfig"));
-  }, [s]), it = Y((m) => {
-    if (!s) {
-      if (R.some((E) => E.id === m)) {
-        const E = R.find((k) => k.id === m);
-        if ((E == null ? void 0 : E.kind) === "triggerFixed") {
-          V(zt()), q({}), tt(null);
-          return;
-        }
-        V((k) => {
-          const C = k.filter((x) => x.id !== m);
-          return oe((E == null ? void 0 : E.kind) ?? "") && !C.some((x) => x.kind === "end") ? [...C, { id: "end", kind: "end", reactFlowType: "endNode" }] : C;
-        }), q((k) => {
-          const C = { ...k }, x = (_) => {
-            C[_] && (Object.values(C[_]).flat().filter((T) => oe(T.kind)).forEach((T) => x(T.id)), delete C[_]);
-          };
-          return x(m), C;
-        });
-        return;
-      }
-      q((E) => {
-        const k = (x, _) => {
-          const T = [];
-          for (const S of x)
-            oe(S.kind) && _[S.id] && (T.push(S.id), Object.values(_[S.id]).forEach((I) => T.push(...k(I, _))));
-          return T;
-        }, C = { ...E };
-        for (const x of Object.keys(C))
-          for (const _ of Object.keys(C[x])) {
-            const T = C[x][_], S = T.findIndex((A) => A.id === m);
-            if (S === -1 || T[S].kind === "end") continue;
-            const I = T[S];
-            let D = T.filter((A) => A.id !== m);
-            return I.kind === "filter" && ((I.id in C ? k([I], C) : []).forEach((L) => delete C[L]), delete C[I.id], D.some((L) => L.kind === "end") || (D = [...D, { id: `end-${x}-${_}`, kind: "end", reactFlowType: "endNode" }])), C[x] = { ...C[x], [_]: D }, C;
-          }
-        return C;
-      });
-    }
-  }, [s, R]), je = Y(() => {
-    s || $("triggerSelect");
-  }, [s]), st = Y((m, E) => {
-    s || ot || (ve(m), Qe(E.filterId && E.branch ? { filterId: E.filterId, branch: E.branch } : null), $("nodePicker"));
-  }, [s, ot]), lt = Y((m) => {
-    if (tt(m), $(null), m.skeletonState) {
-      q(m.skeletonState.branches ?? {}), V(m.skeletonState.slots ?? []);
-      return;
-    }
-    q({}), V([
-      { id: "start", kind: "start", reactFlowType: "startNode" },
-      {
-        id: `trigger-${m.triggerKey}`,
-        kind: "triggerFixed",
-        reactFlowType: "triggerNode",
-        nodeData: { label: m.label, source: m.source },
-        deletable: !1
-      },
-      { id: "end", kind: "end", reactFlowType: "endNode" }
-    ]);
-  }, []), at = Y(() => {
-    const m = e.list();
-    return (Q != null && Q.availableTasks ? m.filter((k) => Q.availableTasks.includes(k.type)) : m).filter((k) => k.maxPerWorkflow === void 0 ? !0 : R.filter((x) => x.descriptorType === k.type).length + Object.values(H).flatMap((x) => Object.values(x).flat()).filter((x) => x.descriptorType === k.type).length < k.maxPerWorkflow);
-  }, [e, Q, R, H]), dt = Y((m) => {
-    if (!de) return;
-    const E = `${m.type}-${Date.now()}`, k = m.reactFlowType === "filterNode" || m.reactFlowType === "approvalNode" || m.reactFlowType === "conditionBranchNode", C = m.branchLabels ?? { pass: "Pass", fail: "Fail" }, x = {
-      id: E,
-      kind: k ? m.reactFlowType === "approvalNode" ? "approval" : "filter" : "userTask",
-      reactFlowType: m.reactFlowType,
-      descriptorType: m.type,
-      formData: {},
-      nodeData: { title: m.label },
-      deletable: !0,
-      branchLabels: C
-    };
-    if (Oe) {
-      const { filterId: _, branch: T } = Oe;
-      q((S) => {
-        const I = [...S[_][T]];
-        if (k) {
-          const ee = I.filter((ce) => ce.kind !== "end"), gt = ee.findIndex((ce) => ce.id === de), xr = gt === -1 ? ee.length : gt + 1;
-          return ee.splice(xr, 0, x), {
-            ...S,
-            [_]: { ...S[_], [T]: ee },
-            [E]: Object.fromEntries(
-              Object.keys(C).map((ce) => [ce, [{ id: `end-${E}-${ce}`, kind: "end", reactFlowType: "endNode" }]])
-            )
-          };
-        }
-        const D = I.findIndex((ee) => ee.id === de), A = I.findIndex((ee) => ee.kind === "end"), L = D === -1 ? A === -1 ? I.length : A : D + 1;
-        return I.splice(L, 0, x), { ...S, [_]: { ...S[_], [T]: I } };
-      });
-    } else
-      k ? (V((_) => {
-        const T = _.findIndex((I) => I.id === de);
-        return [..._.filter((I) => I.kind !== "end").slice(0, T + 1), x];
-      }), q((_) => ({
-        ..._,
-        [E]: Object.fromEntries(
-          Object.keys(C).map((T) => [T, [{ id: `end-${E}-${T}`, kind: "end", reactFlowType: "endNode" }]])
-        )
-      }))) : V((_) => {
-        const T = _.findIndex((S) => S.id === de);
-        return T === -1 ? _ : [..._.slice(0, T + 1), x, ..._.slice(T + 1)];
-      });
-    ve(null), Qe(null), Ze(E), $("nodeConfig");
-  }, [de, Oe]), ct = Y((m, E) => {
-    const k = (x) => {
-      const _ = ne(m);
-      if ((_ == null ? void 0 : _.descriptorType) !== "conditionBranch") return x;
-      const T = E.branchConfigs ?? [], S = T.map((L) => L.key).filter(Boolean);
-      if (S.length === 0) return x;
-      const I = x[m] ?? {}, D = {};
-      S.forEach((L) => {
-        D[L] = I[L] ?? [{ id: `end-${m}-${L}`, kind: "end", reactFlowType: "endNode" }];
-      });
-      const A = {};
-      return T.forEach((L) => {
-        L.key && (A[L.key] = L.label || L.key);
-      }), { ...x, [m]: D };
-    }, C = (x, _) => {
-      if (x.descriptorType !== "conditionBranch") return { ...x, formData: _ };
-      const T = _.branchConfigs ?? [], S = {};
-      return T.forEach((I) => {
-        I.key && (S[I.key] = I.label || I.key);
-      }), { ...x, formData: _, branchLabels: S };
-    };
-    if (R.some((x) => x.id === m)) {
-      q((x) => {
-        const _ = k(x);
-        return V((T) => {
-          const S = T.map((I) => I.id === m ? C(I, E) : I);
-          return i == null || i({ slots: S, branches: _ }), S;
-        }), _;
-      });
-      return;
-    }
-    q((x) => {
-      const T = { ...k(x) };
-      for (const S of Object.keys(T)) {
-        const I = (D) => D.map((A) => A.id === m ? C(A, E) : A);
-        for (const D of Object.keys(T[S]))
-          if (T[S][D].some((A) => A.id === m))
-            return T[S] = { ...T[S], [D]: I(T[S][D]) }, i == null || i({ slots: R, branches: T }), T;
-      }
-      return T;
-    });
-  }, [R, H, ne, i]), X = W(() => ne(Ie ?? ""), [ne, Ie]), ut = W(() => X != null && X.descriptorType ? e.forType(X.descriptorType) ?? null : null, [X, e]), { nodes: ft, edges: Er } = W(
-    () => $i(R, H, s ? null : st, rt, l, y, U),
-    [R, H, s, st, rt, l, y, U]
-  ), ht = W(() => {
-    const m = p ? new Map(p.steps.map((E) => [E.nodeId, E])) : null;
-    return ft.map((E) => {
-      let k = {};
-      if (m) {
-        const C = m.get(E.id);
-        C && (k = { _executionStatus: C.status, _executionError: C.error });
-      }
-      return E.type === "subWorkflowNode" && v && (k.onPreview = (C) => {
-        var _;
-        const x = ne(E.id);
-        et({ workflowId: C, workflowLabel: ((_ = x == null ? void 0 : x.formData) == null ? void 0 : _.workflowLabel) ?? void 0 });
-      }), Object.keys(k).length > 0 ? { ...E, data: { ...E.data, ...k } } : E;
-    });
-  }, [ft, p, v, ne]), kr = W(() => ({ onEditNode: Me, onDeleteNode: it, onAddStep: () => {
-  }, onClickAddTrigger: je, messages: Z, nodeRegistry: e, nodeBody: le }), [Me, it, je, Z, e, le]);
-  return /* @__PURE__ */ f(Dr.Provider, { value: kr, children: /* @__PURE__ */ w(
-    "div",
-    {
-      className: "flowforge-canvas",
-      style: {
-        width: "100%",
-        height: "100%",
-        position: "relative",
-        // CSS variable consumed by edge SCSS for primary/hover color
-        "--ff-primary": l.primaryColor ?? "#1dbf60",
-        "--ff-edge-color": l.edgeColor ?? "#b0bec5",
-        "--ff-text": l.textColor ?? "#212121",
-        "--ff-muted": l.mutedTextColor ?? "#9ca3af",
-        "--ff-surface": l.surfaceColor ?? "#fff",
-        "--ff-border": l.borderColor ?? "#dee2e6",
-        "--ff-danger": l.dangerColor ?? "#d32f2f",
-        "--ff-radius": `${l.borderRadius ?? 6}px`,
-        "--ff-font-family": l.fontFamily
-      },
-      children: [
-        /* @__PURE__ */ w(
-          _r,
-          {
-            nodes: ht,
-            edges: Er,
-            nodeTypes: mr,
-            edgeTypes: wr,
-            fitView: N,
-            fitViewOptions: { padding: O },
-            nodesDraggable: !1,
-            nodesConnectable: !1,
-            panOnScroll: B,
-            zoomOnScroll: re,
-            minZoom: he,
-            maxZoom: z,
-            snapToGrid: me,
-            snapGrid: we,
-            proOptions: { hideAttribution: !0 },
-            onNodeClick: (m, E) => {
-              const k = ne(E.id);
-              k && (g != null && g(k) || (k.kind === "addTrigger" || k.kind === "triggerFixed" ? je() : (k.kind === "userTask" || k.kind === "filter" || k.kind === "approval") && Me(E.id)));
-            },
-            children: [
-              l.background !== "none" && /* @__PURE__ */ f(
-                Cr,
-                {
-                  variant: l.background,
-                  color: l.backgroundColor ?? "#e0e0e0",
-                  gap: 20
-                }
-              ),
-              M && /* @__PURE__ */ f(Sr, { showInteractive: !1 }),
-              F && /* @__PURE__ */ f(Ir, { zoomable: !0, pannable: !0 }),
-              /* @__PURE__ */ f(Fi, { onHeightsReady: yr, nodeCount: ht.length })
-            ]
-          }
-        ),
-        c ? ae === "triggerSelect" && c(t.list(), lt, () => $(null)) : /* @__PURE__ */ f(zi, { open: ae === "triggerSelect", templates: t.list(), messages: Z, onSelect: lt, onClose: () => $(null) }),
-        u ? ae === "nodePicker" && u(at(), dt, () => {
-          $(null), ve(null);
-        }) : /* @__PURE__ */ f(Ri, { open: ae === "nodePicker", availableDescriptors: at(), messages: Z, onSelect: dt, onClose: () => {
-          $(null), ve(null);
-        } }),
-        h ? ae === "nodeConfig" && h(ut ?? void 0, X, ct, () => $(null)) : /* @__PURE__ */ f(Di, { open: ae === "nodeConfig", nodeId: Ie, descriptor: ut, initialValues: X == null ? void 0 : X.formData, messages: Z, onSave: ct, onClose: () => $(null) }),
-        v && Ee && /* @__PURE__ */ f(
-          Li,
-          {
-            isOpen: !!Ee,
-            onClose: () => et(null),
-            workflowId: Ee.workflowId,
-            workflowLabel: Ee.workflowLabel,
-            onFetchWorkflow: v
-          }
-        )
-      ]
-    }
-  ) });
-}, Yi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  WorkflowCanvas: Dt,
-  default: Dt
-}, Symbol.toStringTag, { value: "Module" })), We = "All";
-function Ki({ template: e, onSelect: t }) {
-  var o, i;
-  const r = e.triggerCategory ? sn[e.triggerCategory] : null, n = ((o = e.skeletonState) == null ? void 0 : o.slots.filter((s) => s.kind === "userTask").length) ?? 0;
-  return /* @__PURE__ */ w(
-    "div",
-    {
-      role: "button",
-      tabIndex: 0,
-      onClick: t,
-      onKeyDown: (s) => {
-        (s.key === "Enter" || s.key === " ") && t();
-      },
-      style: {
-        border: "1.5px solid #e0e0e0",
-        borderRadius: 10,
-        padding: "16px",
-        background: "#fff",
-        cursor: "pointer",
-        transition: "border-color 0.15s, box-shadow 0.15s",
-        display: "flex",
-        flexDirection: "column",
-        gap: 8,
-        outline: "none"
-      },
-      onMouseEnter: (s) => {
-        s.currentTarget.style.borderColor = "#1976d2", s.currentTarget.style.boxShadow = "0 2px 8px rgba(25,118,210,0.12)";
-      },
-      onMouseLeave: (s) => {
-        s.currentTarget.style.borderColor = "#e0e0e0", s.currentTarget.style.boxShadow = "none";
-      },
-      children: [
-        /* @__PURE__ */ w("div", { style: { display: "flex", alignItems: "flex-start", gap: 10 }, children: [
-          e.icon && /* @__PURE__ */ f("div", { style: { flexShrink: 0, width: 36, height: 36, borderRadius: 8, background: "#f5f5f5", display: "flex", alignItems: "center", justifyContent: "center" }, children: e.icon }),
-          /* @__PURE__ */ w("div", { style: { flex: 1, minWidth: 0 }, children: [
-            /* @__PURE__ */ f("div", { style: { fontWeight: 600, fontSize: 14, color: "#212121", marginBottom: 2 }, children: e.label }),
-            e.description && /* @__PURE__ */ f("div", { style: { fontSize: 12, color: "#757575", lineHeight: 1.4, display: "-webkit-box", WebkitLineClamp: 2, WebkitBoxOrient: "vertical", overflow: "hidden" }, children: e.description })
-          ] })
-        ] }),
-        /* @__PURE__ */ w("div", { style: { display: "flex", alignItems: "center", flexWrap: "wrap", gap: 4 }, children: [
-          r && /* @__PURE__ */ f("span", { style: { fontSize: 10, fontWeight: 600, padding: "2px 7px", borderRadius: 10, background: r.bg, color: r.color }, children: r.label }),
-          (i = e.tags) == null ? void 0 : i.map((s) => /* @__PURE__ */ f("span", { style: { fontSize: 10, padding: "2px 7px", borderRadius: 10, background: "#f5f5f5", color: "#616161" }, children: s }, s)),
-          n > 0 && /* @__PURE__ */ w("span", { style: { fontSize: 10, color: "#9e9e9e", marginLeft: "auto" }, children: [
-            n,
-            " step",
-            n !== 1 ? "s" : ""
-          ] })
-        ] }),
-        e.author && /* @__PURE__ */ w("div", { style: { fontSize: 11, color: "#bdbdbd" }, children: [
-          "by ",
-          e.author
-        ] })
-      ]
-    }
-  );
-}
-const ls = ({
-  templates: e,
-  onSelectTemplate: t,
-  onStartFromScratch: r
-}) => {
-  const [n, o] = j(""), [i, s] = j(We), l = W(() => {
-    const a = /* @__PURE__ */ new Set();
-    return e.forEach((c) => {
-      c.category && a.add(c.category);
-    }), [We, ...Array.from(a)];
-  }, [e]), d = W(() => {
-    let a = e;
-    if (i !== We && (a = a.filter((c) => c.category === i)), n.trim()) {
-      const c = n.toLowerCase();
-      a = a.filter(
-        (u) => {
-          var h, g;
-          return u.label.toLowerCase().includes(c) || ((h = u.description) == null ? void 0 : h.toLowerCase().includes(c)) || ((g = u.tags) == null ? void 0 : g.some((b) => b.toLowerCase().includes(c)));
-        }
-      );
-    }
-    return [...a].sort((c, u) => (u.popularity ?? 0) - (c.popularity ?? 0));
-  }, [e, i, n]);
-  return /* @__PURE__ */ w("div", { style: { display: "flex", flexDirection: "column", height: "100%", fontFamily: "inherit" }, children: [
-    /* @__PURE__ */ w("div", { style: { padding: "24px 24px 0", borderBottom: "1px solid #f0f0f0", paddingBottom: 16 }, children: [
-      /* @__PURE__ */ w("div", { style: { display: "flex", alignItems: "center", justifyContent: "space-between", marginBottom: 16 }, children: [
-        /* @__PURE__ */ w("div", { children: [
-          /* @__PURE__ */ f("h2", { style: { margin: 0, fontSize: 20, fontWeight: 700, color: "#212121" }, children: "Workflow Templates" }),
-          /* @__PURE__ */ f("p", { style: { margin: "4px 0 0", fontSize: 13, color: "#757575" }, children: "Choose a pre-built template or start from scratch" })
-        ] }),
-        r && /* @__PURE__ */ w(
-          "button",
-          {
-            onClick: r,
-            style: { display: "flex", alignItems: "center", gap: 6, padding: "8px 16px", border: "1.5px solid #1976d2", borderRadius: 6, background: "#fff", color: "#1976d2", fontSize: 13, fontWeight: 600, cursor: "pointer" },
-            children: [
-              /* @__PURE__ */ f(Vr, { size: 16 }),
-              "Start from Scratch"
-            ]
-          }
-        )
-      ] }),
-      /* @__PURE__ */ w("div", { style: { display: "flex", alignItems: "center", gap: 8, background: "#f5f5f5", borderRadius: 8, padding: "8px 12px", marginBottom: 12 }, children: [
-        /* @__PURE__ */ f(Hr, { size: 18, color: "#9e9e9e" }),
-        /* @__PURE__ */ f(
-          "input",
-          {
-            value: n,
-            onChange: (a) => o(a.target.value),
-            placeholder: "Search templates...",
-            style: { border: "none", background: "transparent", outline: "none", fontSize: 14, color: "#212121", flex: 1 }
-          }
-        )
-      ] }),
-      l.length > 1 && /* @__PURE__ */ f("div", { style: { display: "flex", gap: 4, flexWrap: "wrap" }, children: l.map((a) => /* @__PURE__ */ f(
-        "button",
-        {
-          onClick: () => s(a),
-          style: {
-            padding: "4px 12px",
-            borderRadius: 20,
-            border: "1.5px solid",
-            borderColor: i === a ? "#1976d2" : "#e0e0e0",
-            background: i === a ? "#e3f2fd" : "#fff",
-            color: i === a ? "#1565c0" : "#616161",
-            fontSize: 12,
-            fontWeight: i === a ? 600 : 400,
-            cursor: "pointer"
-          },
-          children: a
-        },
-        a
-      )) })
-    ] }),
-    /* @__PURE__ */ f("div", { style: { flex: 1, overflowY: "auto", padding: 24 }, children: d.length === 0 ? /* @__PURE__ */ w("div", { style: { textAlign: "center", padding: "40px 0", color: "#9e9e9e" }, children: [
-      /* @__PURE__ */ f(qr, { size: 36, style: { marginBottom: 8 } }),
-      /* @__PURE__ */ f("p", { style: { margin: 0, fontSize: 14 }, children: "No templates found" })
-    ] }) : /* @__PURE__ */ f("div", { style: { display: "grid", gridTemplateColumns: "repeat(auto-fill, minmax(280px, 1fr))", gap: 16 }, children: d.map((a) => /* @__PURE__ */ f(Ki, { template: a, onSelect: () => t(a) }, a.triggerKey)) }) })
-  ] });
-}, ke = {
-  running: { label: "Running", color: J.running, icon: P.createElement(Gt, { size: 14 }) },
-  success: { label: "Success", color: J.success, icon: P.createElement(Wt, { size: 14 }) },
-  failed: { label: "Failed", color: J.failed, icon: P.createElement(Bt, { size: 14 }) },
-  cancelled: { label: "Cancelled", color: J.cancelled, icon: P.createElement(Pt, { size: 14 }) }
-}, Ui = {
-  pending: { color: J.pending, icon: P.createElement(Xr, { size: 14 }) },
-  running: { color: J.running, icon: P.createElement(Gt, { size: 14 }) },
-  success: { color: J.success, icon: P.createElement(Wt, { size: 14 }) },
-  failed: { color: J.failed, icon: P.createElement(Bt, { size: 14 }) },
-  skipped: { color: J.skipped, icon: P.createElement(Pt, { size: 14 }) }
-};
-function Ue(e) {
-  try {
-    return new Date(e).toLocaleString();
-  } catch {
-    return e;
-  }
-}
-function pr(e, t) {
-  try {
-    const r = new Date(t ?? (/* @__PURE__ */ new Date()).toISOString()).getTime() - new Date(e).getTime();
-    return r < 1e3 ? `${r}ms` : r < 6e4 ? `${(r / 1e3).toFixed(1)}s` : `${Math.floor(r / 6e4)}m ${Math.floor(r % 6e4 / 1e3)}s`;
-  } catch {
-    return "—";
-  }
-}
-function Vi({ step: e }) {
-  const [t, r] = j(!1), n = Ui[e.status], o = !!(e.inputs || e.outputs || e.error);
-  return /* @__PURE__ */ w("div", { style: { borderBottom: "1px solid #f5f5f5" }, children: [
-    /* @__PURE__ */ w(
-      "div",
-      {
-        style: { display: "flex", alignItems: "center", gap: 8, padding: "8px 12px", cursor: o ? "pointer" : "default" },
-        onClick: () => {
-          o && r((i) => !i);
-        },
-        role: o ? "button" : void 0,
-        tabIndex: o ? 0 : void 0,
-        onKeyDown: (i) => {
-          o && (i.key === "Enter" || i.key === " ") && r((s) => !s);
-        },
-        children: [
-          /* @__PURE__ */ f("span", { style: { color: n.color, flexShrink: 0 }, children: P.cloneElement(n.icon, { color: n.color }) }),
-          /* @__PURE__ */ f("span", { style: { flex: 1, fontSize: 13, color: "#212121" }, children: e.label || e.nodeId }),
-          e.branchTaken && /* @__PURE__ */ f("span", { style: { fontSize: 10, padding: "1px 6px", borderRadius: 10, background: "#e3f2fd", color: "#1565c0", fontWeight: 600 }, children: e.branchTaken }),
-          /* @__PURE__ */ f("span", { style: { fontSize: 11, color: "#9e9e9e", flexShrink: 0 }, children: e.startedAt ? pr(e.startedAt, e.completedAt) : "—" }),
-          o && /* @__PURE__ */ f("span", { style: { color: "#9e9e9e", flexShrink: 0 }, children: t ? P.createElement(Zr, { size: 16 }) : P.createElement(Qr, { size: 16 }) })
-        ]
-      }
-    ),
-    t && o && /* @__PURE__ */ w("div", { style: { padding: "0 12px 10px 32px", fontSize: 12 }, children: [
-      e.error && /* @__PURE__ */ f("div", { style: { padding: "6px 10px", borderRadius: 6, background: "#ffebee", color: "#c62828", marginBottom: 6 }, children: e.error }),
-      e.inputs && Object.keys(e.inputs).length > 0 && /* @__PURE__ */ w("details", { style: { marginBottom: 4 }, children: [
-        /* @__PURE__ */ f("summary", { style: { cursor: "pointer", color: "#616161", marginBottom: 4 }, children: "Inputs" }),
-        /* @__PURE__ */ f("pre", { style: { margin: 0, fontSize: 11, background: "#f5f5f5", padding: 8, borderRadius: 4, overflowX: "auto" }, children: JSON.stringify(e.inputs, null, 2) })
-      ] }),
-      e.outputs && Object.keys(e.outputs).length > 0 && /* @__PURE__ */ w("details", { children: [
-        /* @__PURE__ */ f("summary", { style: { cursor: "pointer", color: "#616161", marginBottom: 4 }, children: "Outputs" }),
-        /* @__PURE__ */ f("pre", { style: { margin: 0, fontSize: 11, background: "#f5f5f5", padding: 8, borderRadius: 4, overflowX: "auto" }, children: JSON.stringify(e.outputs, null, 2) })
-      ] })
-    ] })
-  ] });
-}
-function Hi({ record: e, selected: t, onSelect: r }) {
-  const n = ke[e.status];
-  return /* @__PURE__ */ w(
-    "div",
-    {
-      role: "button",
-      tabIndex: 0,
-      onClick: r,
-      onKeyDown: (o) => {
-        (o.key === "Enter" || o.key === " ") && r();
-      },
-      style: {
-        padding: "10px 14px",
-        borderBottom: "1px solid #f0f0f0",
-        cursor: "pointer",
-        background: t ? "#e3f2fd" : "#fff",
-        display: "flex",
-        alignItems: "center",
-        gap: 10,
-        outline: "none"
-      },
-      children: [
-        /* @__PURE__ */ f("span", { style: { color: n.color, flexShrink: 0 }, children: P.cloneElement(n.icon, { color: n.color, size: 16 }) }),
-        /* @__PURE__ */ w("div", { style: { flex: 1, minWidth: 0 }, children: [
-          /* @__PURE__ */ f("div", { style: { fontSize: 12, color: "#212121", fontWeight: t ? 600 : 400, whiteSpace: "nowrap", overflow: "hidden", textOverflow: "ellipsis" }, children: Ue(e.triggeredAt) }),
-          /* @__PURE__ */ w("div", { style: { fontSize: 11, color: "#9e9e9e" }, children: [
-            e.triggeredBy ? `by ${e.triggeredBy}` : "System",
-            " · ",
-            e.steps.length,
-            " step",
-            e.steps.length !== 1 ? "s" : ""
-          ] })
-        ] }),
-        /* @__PURE__ */ f("span", { style: { fontSize: 11, fontWeight: 600, color: n.color, flexShrink: 0 }, children: n.label }),
-        /* @__PURE__ */ f(At, { size: 14, color: "#bdbdbd" })
-      ]
-    }
-  );
-}
-const as = ({ records: e, onViewOnCanvas: t }) => {
-  var s;
-  const [r, n] = j(((s = e[0]) == null ? void 0 : s.id) ?? null), o = e.find((l) => l.id === r) ?? null, i = [...e].sort((l, d) => new Date(d.triggeredAt).getTime() - new Date(l.triggeredAt).getTime());
-  return e.length === 0 ? /* @__PURE__ */ w("div", { style: { display: "flex", flexDirection: "column", alignItems: "center", justifyContent: "center", height: 300, color: "#9e9e9e", gap: 8 }, children: [
-    /* @__PURE__ */ f(mt, { size: 36 }),
-    /* @__PURE__ */ f("p", { style: { margin: 0, fontSize: 14 }, children: "No executions yet" }),
-    /* @__PURE__ */ f("p", { style: { margin: 0, fontSize: 12 }, children: "Run history will appear here" })
-  ] }) : /* @__PURE__ */ w("div", { style: { display: "flex", height: "100%", fontFamily: "inherit", border: "1px solid #e0e0e0", borderRadius: 8, overflow: "hidden" }, children: [
-    /* @__PURE__ */ w("div", { style: { width: 260, flexShrink: 0, borderRight: "1px solid #e0e0e0", overflowY: "auto", background: "#fafafa" }, children: [
-      /* @__PURE__ */ w("div", { style: { padding: "12px 14px", borderBottom: "1px solid #e0e0e0", fontWeight: 600, fontSize: 13, color: "#212121" }, children: [
-        "Run History (",
-        e.length,
-        ")"
-      ] }),
-      i.map((l) => /* @__PURE__ */ f(Hi, { record: l, selected: l.id === r, onSelect: () => n(l.id) }, l.id))
-    ] }),
-    /* @__PURE__ */ f("div", { style: { flex: 1, overflowY: "auto" }, children: o ? /* @__PURE__ */ w("div", { children: [
-      /* @__PURE__ */ w("div", { style: { padding: "16px 20px", borderBottom: "1px solid #f0f0f0", display: "flex", alignItems: "flex-start", justifyContent: "space-between", gap: 12 }, children: [
-        /* @__PURE__ */ w("div", { children: [
-          /* @__PURE__ */ w("div", { style: { display: "flex", alignItems: "center", gap: 8, marginBottom: 4 }, children: [
-            P.cloneElement(ke[o.status].icon, { color: ke[o.status].color, size: 18 }),
-            /* @__PURE__ */ f("span", { style: { fontWeight: 700, fontSize: 15, color: "#212121" }, children: ke[o.status].label })
-          ] }),
-          /* @__PURE__ */ w("div", { style: { fontSize: 12, color: "#757575", display: "flex", flexDirection: "column", gap: 2 }, children: [
-            /* @__PURE__ */ w("span", { style: { display: "flex", alignItems: "center", gap: 4 }, children: [
-              /* @__PURE__ */ f(mt, { size: 13 }),
-              " ",
-              Ue(o.triggeredAt),
-              o.completedAt && ` → ${Ue(o.completedAt)} (${pr(o.triggeredAt, o.completedAt)})`
-            ] }),
-            o.triggeredBy && /* @__PURE__ */ w("span", { style: { display: "flex", alignItems: "center", gap: 4 }, children: [
-              /* @__PURE__ */ f(Jr, { size: 13 }),
-              " ",
-              o.triggeredBy
-            ] })
-          ] })
-        ] }),
-        t && /* @__PURE__ */ f(
-          "button",
-          {
-            onClick: () => t(o),
-            style: { padding: "6px 12px", border: "1.5px solid #1976d2", borderRadius: 6, background: "#fff", color: "#1976d2", fontSize: 12, fontWeight: 600, cursor: "pointer", flexShrink: 0 },
-            children: "View on Canvas"
-          }
-        )
-      ] }),
-      o.error && /* @__PURE__ */ f("div", { style: { margin: "12px 16px", padding: "10px 14px", borderRadius: 6, background: "#ffebee", color: "#c62828", fontSize: 13 }, children: o.error }),
-      /* @__PURE__ */ w("div", { children: [
-        /* @__PURE__ */ w("div", { style: { padding: "10px 12px", fontSize: 12, fontWeight: 600, color: "#757575", borderBottom: "1px solid #f0f0f0" }, children: [
-          "STEPS (",
-          o.steps.length,
-          ")"
-        ] }),
-        o.steps.map((l, d) => /* @__PURE__ */ f(Vi, { step: l }, `${l.nodeId}-${d}`))
-      ] }),
-      o.inputs && Object.keys(o.inputs).length > 0 && /* @__PURE__ */ f("div", { style: { padding: "10px 16px" }, children: /* @__PURE__ */ w("details", { children: [
-        /* @__PURE__ */ f("summary", { style: { cursor: "pointer", fontSize: 12, fontWeight: 600, color: "#757575", marginBottom: 6 }, children: "TRIGGER INPUTS" }),
-        /* @__PURE__ */ f("pre", { style: { margin: 0, fontSize: 11, background: "#f5f5f5", padding: 10, borderRadius: 4, overflowX: "auto" }, children: JSON.stringify(o.inputs, null, 2) })
-      ] }) })
-    ] }) : /* @__PURE__ */ f("div", { style: { display: "flex", alignItems: "center", justifyContent: "center", height: "100%", color: "#9e9e9e", fontSize: 14 }, children: "Select a run to see details" }) })
-  ] });
-}, ds = {
-  slots: [
-    { id: "start", kind: "start", reactFlowType: "startNode", deletable: !1 },
-    { id: "trigger-END_USER_CREATION", kind: "triggerFixed", reactFlowType: "triggerNode", deletable: !0, label: "New User Registration", nodeData: { label: "New User Registration" } },
-    { id: "notification-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Welcome Email", nodeData: { title: "Welcome Email" } },
-    { id: "approval-1", kind: "approval", reactFlowType: "approvalNode", descriptorType: "approval", deletable: !0, label: "Manager Approval", branchLabels: { pass: "Approved", fail: "Rejected" } },
-    { id: "end", kind: "end", reactFlowType: "endNode", deletable: !1 }
-  ],
-  branches: {
-    "approval-1": {
-      pass: [{ id: "notification-pass-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Approval Confirmed", nodeData: { title: "Approval Confirmed" } }],
-      fail: [{ id: "notification-fail-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Rejection Notice", nodeData: { title: "Rejection Notice" } }]
-    }
-  }
-}, cs = {
-  slots: [
-    { id: "start", kind: "start", reactFlowType: "startNode", deletable: !1 },
-    { id: "trigger-ACCESS_REQUEST", kind: "triggerFixed", reactFlowType: "triggerNode", deletable: !0, label: "Access Request Submitted", nodeData: { label: "Access Request Submitted" } },
-    { id: "approval-1", kind: "approval", reactFlowType: "approvalNode", descriptorType: "approval", deletable: !0, label: "Access Approval", branchLabels: { pass: "Approved", fail: "Denied" } },
-    { id: "end", kind: "end", reactFlowType: "endNode", deletable: !1 }
-  ],
-  branches: {
-    "approval-1": {
-      pass: [
-        { id: "restApi-1", kind: "userTask", reactFlowType: "restApiNode", descriptorType: "restApi", deletable: !0, label: "Provision Access", nodeData: { title: "Provision Access" } },
-        { id: "notification-pass-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Access Granted Email", nodeData: { title: "Access Granted Email" } }
-      ],
-      fail: [
-        { id: "notification-fail-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Access Denied Email", nodeData: { title: "Access Denied Email" } }
-      ]
-    }
-  }
-}, us = {
-  slots: [
-    { id: "start", kind: "start", reactFlowType: "startNode", deletable: !1 },
-    { id: "trigger-USER_DEACTIVATION", kind: "triggerFixed", reactFlowType: "triggerNode", deletable: !0, label: "User Deactivation", nodeData: { label: "User Deactivation" } },
-    { id: "delay-1", kind: "userTask", reactFlowType: "delayNode", descriptorType: "delay", deletable: !0, label: "Grace Period", nodeData: { title: "Grace Period", duration: 7, unit: "days" }, formData: { duration: 7, unit: "days" } },
-    { id: "notification-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Notify IT Team", nodeData: { title: "Notify IT Team" } },
-    { id: "end", kind: "end", reactFlowType: "endNode", deletable: !1 }
-  ],
-  branches: {}
-}, fs = {
-  slots: [
-    { id: "start", kind: "start", reactFlowType: "startNode", deletable: !1 },
-    { id: "trigger-WEBHOOK_TRIGGER", kind: "triggerFixed", reactFlowType: "webhookTriggerNode", deletable: !0, label: "Incoming Webhook", nodeData: { label: "Incoming Webhook" } },
-    { id: "restApi-1", kind: "userTask", reactFlowType: "restApiNode", descriptorType: "restApi", deletable: !0, label: "Call External API", nodeData: { title: "Call External API" } },
-    { id: "notification-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Notify on Completion", nodeData: { title: "Notify on Completion" } },
-    { id: "end", kind: "end", reactFlowType: "endNode", deletable: !1 }
-  ],
-  branches: {}
-};
-export {
-  Dt as F,
-  Li as S,
-  as as W,
-  ls as a,
-  cs as b,
-  us as o,
-  ds as u,
-  fs as w
-};