@scalar/agent-chat 0.2.2 → 0.2.3

package/dist/node_modules/.pnpm/d3-time@3.1.0/node_modules/d3-time/src/week.js

@@ -1,48 +0,0 @@
-import { timeInterval as o } from "./interval.js";
-import { durationMinute as u, durationWeek as s } from "./duration.js";
-function n(a) {
-  return o((e) => {
-    e.setDate(e.getDate() - (e.getDay() + 7 - a) % 7), e.setHours(0, 0, 0, 0);
-  }, (e, t) => {
-    e.setDate(e.getDate() + t * 7);
-  }, (e, t) => (t - e - (t.getTimezoneOffset() - e.getTimezoneOffset()) * u) / s);
-}
-const c = n(0), g = n(1), i = n(2), y = n(3), m = n(4), T = n(5), d = n(6);
-c.range;
-g.range;
-i.range;
-y.range;
-m.range;
-T.range;
-d.range;
-function r(a) {
-  return o((e) => {
-    e.setUTCDate(e.getUTCDate() - (e.getUTCDay() + 7 - a) % 7), e.setUTCHours(0, 0, 0, 0);
-  }, (e, t) => {
-    e.setUTCDate(e.getUTCDate() + t * 7);
-  }, (e, t) => (t - e) / s);
-}
-const D = r(0), f = r(1), C = r(2), U = r(3), W = r(4), S = r(5), k = r(6);
-D.range;
-f.range;
-C.range;
-U.range;
-W.range;
-S.range;
-k.range;
-export {
-  T as timeFriday,
-  g as timeMonday,
-  d as timeSaturday,
-  c as timeSunday,
-  m as timeThursday,
-  i as timeTuesday,
-  y as timeWednesday,
-  S as utcFriday,
-  f as utcMonday,
-  k as utcSaturday,
-  D as utcSunday,
-  W as utcThursday,
-  C as utcTuesday,
-  U as utcWednesday
-};

package/dist/node_modules/.pnpm/d3-time@3.1.0/node_modules/d3-time/src/year.js

@@ -1,27 +0,0 @@
-import { timeInterval as l } from "./interval.js";
-const u = l((e) => {
-  e.setMonth(0, 1), e.setHours(0, 0, 0, 0);
-}, (e, r) => {
-  e.setFullYear(e.getFullYear() + r);
-}, (e, r) => r.getFullYear() - e.getFullYear(), (e) => e.getFullYear());
-u.every = (e) => !isFinite(e = Math.floor(e)) || !(e > 0) ? null : l((r) => {
-  r.setFullYear(Math.floor(r.getFullYear() / e) * e), r.setMonth(0, 1), r.setHours(0, 0, 0, 0);
-}, (r, t) => {
-  r.setFullYear(r.getFullYear() + t * e);
-});
-u.range;
-const s = l((e) => {
-  e.setUTCMonth(0, 1), e.setUTCHours(0, 0, 0, 0);
-}, (e, r) => {
-  e.setUTCFullYear(e.getUTCFullYear() + r);
-}, (e, r) => r.getUTCFullYear() - e.getUTCFullYear(), (e) => e.getUTCFullYear());
-s.every = (e) => !isFinite(e = Math.floor(e)) || !(e > 0) ? null : l((r) => {
-  r.setUTCFullYear(Math.floor(r.getUTCFullYear() / e) * e), r.setUTCMonth(0, 1), r.setUTCHours(0, 0, 0, 0);
-}, (r, t) => {
-  r.setUTCFullYear(r.getUTCFullYear() + t * e);
-});
-s.range;
-export {
-  u as timeYear,
-  s as utcYear
-};

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/acyclic.js

@@ -1,38 +0,0 @@
-import { greedyFAS as u } from "./greedy-fas.js";
-import d from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/forEach.js";
-import i from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/uniqueId.js";
-function p(e) {
-  var o = e.graph().acyclicer === "greedy" ? u(e, t(e)) : c(e);
-  d(o, function(r) {
-    var n = e.edge(r);
-    e.removeEdge(r), n.forwardName = r.name, n.reversed = !0, e.setEdge(r.w, r.v, n, i("rev"));
-  });
-  function t(r) {
-    return function(n) {
-      return r.edge(n).weight;
-    };
-  }
-}
-function c(e) {
-  var o = [], t = {}, r = {};
-  function n(a) {
-    Object.prototype.hasOwnProperty.call(r, a) || (r[a] = !0, t[a] = !0, d(e.outEdges(a), function(f) {
-      Object.prototype.hasOwnProperty.call(t, f.w) ? o.push(f) : n(f.w);
-    }), delete t[a]);
-  }
-  return d(e.nodes(), n), o;
-}
-function v(e) {
-  d(e.edges(), function(o) {
-    var t = e.edge(o);
-    if (t.reversed) {
-      e.removeEdge(o);
-      var r = t.forwardName;
-      delete t.reversed, delete t.forwardName, e.setEdge(o.w, o.v, t, r);
-    }
-  });
-}
-export {
-  p as run,
-  v as undo
-};

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/add-border-segments.js

@@ -1,20 +0,0 @@
-import { addDummyNode as c } from "./util.js";
-import h from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/forEach.js";
-function u(e) {
-  function o(t) {
-    var i = e.children(t), r = e.node(t);
-    if (i.length && h(i, o), Object.prototype.hasOwnProperty.call(r, "minRank")) {
-      r.borderLeft = [], r.borderRight = [];
-      for (var d = r.minRank, n = r.maxRank + 1; d < n; ++d)
-        b(e, "borderLeft", "_bl", t, r, d), b(e, "borderRight", "_br", t, r, d);
-    }
-  }
-  h(e.children(), o);
-}
-function b(e, o, t, i, r, d) {
-  var n = { width: 0, height: 0, rank: d, borderType: o }, f = r[o][d - 1], a = c(e, "border", n, t);
-  r[o][d] = a, e.setParent(a, i), f && e.setEdge(f, a, { weight: 1 });
-}
-export {
-  u as addBorderSegments
-};

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/coordinate-system.js

@@ -1,47 +0,0 @@
-import o from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/forEach.js";
-function u(e) {
-  var n = e.graph().rankdir.toLowerCase();
-  (n === "lr" || n === "rl") && f(e);
-}
-function h(e) {
-  var n = e.graph().rankdir.toLowerCase();
-  (n === "bt" || n === "rl") && c(e), (n === "lr" || n === "rl") && (a(e), f(e));
-}
-function f(e) {
-  o(e.nodes(), function(n) {
-    d(e.node(n));
-  }), o(e.edges(), function(n) {
-    d(e.edge(n));
-  });
-}
-function d(e) {
-  var n = e.width;
-  e.width = e.height, e.height = n;
-}
-function c(e) {
-  o(e.nodes(), function(n) {
-    r(e.node(n));
-  }), o(e.edges(), function(n) {
-    var i = e.edge(n);
-    o(i.points, r), Object.prototype.hasOwnProperty.call(i, "y") && r(i);
-  });
-}
-function r(e) {
-  e.y = -e.y;
-}
-function a(e) {
-  o(e.nodes(), function(n) {
-    t(e.node(n));
-  }), o(e.edges(), function(n) {
-    var i = e.edge(n);
-    o(i.points, t), Object.prototype.hasOwnProperty.call(i, "x") && t(i);
-  });
-}
-function t(e) {
-  var n = e.x;
-  e.x = e.y, e.y = n;
-}
-export {
-  u as adjust,
-  h as undo
-};

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/data/list.js

@@ -1,30 +0,0 @@
-class s {
-  constructor() {
-    var e = {};
-    e._next = e._prev = e, this._sentinel = e;
-  }
-  dequeue() {
-    var e = this._sentinel, n = e._prev;
-    if (n !== e)
-      return i(n), n;
-  }
-  enqueue(e) {
-    var n = this._sentinel;
-    e._prev && e._next && i(e), e._next = n._next, n._next._prev = e, n._next = e, e._prev = n;
-  }
-  toString() {
-    for (var e = [], n = this._sentinel, _ = n._prev; _ !== n; )
-      e.push(JSON.stringify(_, r)), _ = _._prev;
-    return "[" + e.join(", ") + "]";
-  }
-}
-function i(t) {
-  t._prev._next = t._next, t._next._prev = t._prev, delete t._next, delete t._prev;
-}
-function r(t, e) {
-  if (t !== "_next" && t !== "_prev")
-    return e;
-}
-export {
-  s as List
-};

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/greedy-fas.js

@@ -1,65 +0,0 @@
-import { Graph as p } from "../graphlib/graph.js";
-import { List as s } from "./data/list.js";
-import l from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/flatten.js";
-import E from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/map.js";
-import d from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/forEach.js";
-import c from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/range.js";
-import q from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/constant.js";
-var g = q(1);
-function L(r, t) {
-  if (r.nodeCount() <= 1)
-    return [];
-  var n = F(r, t || g), a = x(n.graph, n.buckets, n.zeroIdx);
-  return l(
-    E(a, function(u) {
-      return r.outEdges(u.v, u.w);
-    })
-  );
-}
-function x(r, t, n) {
-  for (var a = [], u = t[t.length - 1], i = t[0], o; r.nodeCount(); ) {
-    for (; o = i.dequeue(); )
-      m(r, t, n, o);
-    for (; o = u.dequeue(); )
-      m(r, t, n, o);
-    if (r.nodeCount()) {
-      for (var e = t.length - 2; e > 0; --e)
-        if (o = t[e].dequeue(), o) {
-          a = a.concat(m(r, t, n, o, !0));
-          break;
-        }
-    }
-  }
-  return a;
-}
-function m(r, t, n, a, u) {
-  var i = u ? [] : void 0;
-  return d(r.inEdges(a.v), function(o) {
-    var e = r.edge(o), v = r.node(o.v);
-    u && i.push({ v: o.v, w: o.w }), v.out -= e, h(t, n, v);
-  }), d(r.outEdges(a.v), function(o) {
-    var e = r.edge(o), v = o.w, f = r.node(v);
-    f.in -= e, h(t, n, f);
-  }), r.removeNode(a.v), i;
-}
-function F(r, t) {
-  var n = new p(), a = 0, u = 0;
-  d(r.nodes(), function(e) {
-    n.setNode(e, { v: e, in: 0, out: 0 });
-  }), d(r.edges(), function(e) {
-    var v = n.edge(e.v, e.w) || 0, f = t(e), w = v + f;
-    n.setEdge(e.v, e.w, w), u = Math.max(u, n.node(e.v).out += f), a = Math.max(a, n.node(e.w).in += f);
-  });
-  var i = c(u + a + 3).map(function() {
-    return new s();
-  }), o = a + 1;
-  return d(n.nodes(), function(e) {
-    h(i, o, n.node(e));
-  }), { graph: n, buckets: i, zeroIdx: o };
-}
-function h(r, t, n) {
-  n.out ? n.in ? r[n.out - n.in + t].enqueue(n) : r[r.length - 1].enqueue(n) : r[0].enqueue(n);
-}
-export {
-  L as greedyFAS
-};

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/layout.js

@@ -1,205 +0,0 @@
-import { Graph as w } from "../graphlib/graph.js";
-import { addBorderSegments as E } from "./add-border-segments.js";
-import { adjust as L, undo as N } from "./coordinate-system.js";
-import { run as R, undo as S } from "./acyclic.js";
-import { run as I, undo as P } from "./normalize.js";
-import { rank as O } from "./rank/index.js";
-import { run as M, cleanup as j } from "./nesting-graph.js";
-import { order as C } from "./order/index.js";
-import { parentDummyChains as T } from "./parent-dummy-chains.js";
-import { position as B } from "./position/index.js";
-import { notime as A, asNonCompoundGraph as D, removeEmptyRanks as z, normalizeRanks as F, addDummyNode as k, intersectRect as y, buildLayerMatrix as Y } from "./util.js";
-import t from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/forEach.js";
-import g from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/merge.js";
-import m from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/pick.js";
-import V from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/defaults.js";
-import _ from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/max.js";
-import x from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/last.js";
-import $ from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/mapValues.js";
-function Me(e, r) {
-  var n = A;
-  n("layout", () => {
-    var o = n("  buildLayoutGraph", () => ee(e));
-    n("  runLayout", () => X(o, n)), n("  updateInputGraph", () => W(e, o));
-  });
-}
-function X(e, r) {
-  r("    makeSpaceForEdgeLabels", () => re(e)), r("    removeSelfEdges", () => fe(e)), r("    acyclic", () => R(e)), r("    nestingGraph.run", () => M(e)), r("    rank", () => O(D(e))), r("    injectEdgeLabelProxies", () => ne(e)), r("    removeEmptyRanks", () => z(e)), r("    nestingGraph.cleanup", () => j(e)), r("    normalizeRanks", () => F(e)), r("    assignRankMinMax", () => oe(e)), r("    removeEdgeLabelProxies", () => ae(e)), r("    normalize.run", () => I(e)), r("    parentDummyChains", () => T(e)), r("    addBorderSegments", () => E(e)), r("    order", () => C(e)), r("    insertSelfEdges", () => ue(e)), r("    adjustCoordinateSystem", () => L(e)), r("    position", () => B(e)), r("    positionSelfEdges", () => pe(e)), r("    removeBorderNodes", () => le(e)), r("    normalize.undo", () => P(e)), r("    fixupEdgeLabelCoords", () => de(e)), r("    undoCoordinateSystem", () => N(e)), r("    translateGraph", () => te(e)), r("    assignNodeIntersects", () => ie(e)), r("    reversePoints", () => se(e)), r("    acyclic.undo", () => S(e));
-}
-function W(e, r) {
-  t(e.nodes(), function(n) {
-    var o = e.node(n), a = r.node(n);
-    o && (o.x = a.x, o.y = a.y, r.children(n).length && (o.width = a.width, o.height = a.height));
-  }), t(e.edges(), function(n) {
-    var o = e.edge(n), a = r.edge(n);
-    o.points = a.points, Object.prototype.hasOwnProperty.call(a, "x") && (o.x = a.x, o.y = a.y);
-  }), e.graph().width = r.graph().width, e.graph().height = r.graph().height;
-}
-var q = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], H = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, J = ["acyclicer", "ranker", "rankdir", "align"], K = ["width", "height"], Q = { width: 0, height: 0 }, U = ["minlen", "weight", "width", "height", "labeloffset"], Z = {
-  minlen: 1,
-  weight: 1,
-  width: 0,
-  height: 0,
-  labeloffset: 10,
-  labelpos: "r"
-}, G = ["labelpos"];
-function ee(e) {
-  var r = new w({ multigraph: !0, compound: !0 }), n = h(e.graph());
-  return r.setGraph(
-    g({}, H, p(n, q), m(n, J))
-  ), t(e.nodes(), function(o) {
-    var a = h(e.node(o));
-    r.setNode(o, V(p(a, K), Q)), r.setParent(o, e.parent(o));
-  }), t(e.edges(), function(o) {
-    var a = h(e.edge(o));
-    r.setEdge(
-      o,
-      g({}, Z, p(a, U), m(a, G))
-    );
-  }), r;
-}
-function re(e) {
-  var r = e.graph();
-  r.ranksep /= 2, t(e.edges(), function(n) {
-    var o = e.edge(n);
-    o.minlen *= 2, o.labelpos.toLowerCase() !== "c" && (r.rankdir === "TB" || r.rankdir === "BT" ? o.width += o.labeloffset : o.height += o.labeloffset);
-  });
-}
-function ne(e) {
-  t(e.edges(), function(r) {
-    var n = e.edge(r);
-    if (n.width && n.height) {
-      var o = e.node(r.v), a = e.node(r.w), i = { rank: (a.rank - o.rank) / 2 + o.rank, e: r };
-      k(e, "edge-proxy", i, "_ep");
-    }
-  });
-}
-function oe(e) {
-  var r = 0;
-  t(e.nodes(), function(n) {
-    var o = e.node(n);
-    o.borderTop && (o.minRank = e.node(o.borderTop).rank, o.maxRank = e.node(o.borderBottom).rank, r = _(r, o.maxRank));
-  }), e.graph().maxRank = r;
-}
-function ae(e) {
-  t(e.nodes(), function(r) {
-    var n = e.node(r);
-    n.dummy === "edge-proxy" && (e.edge(n.e).labelRank = n.rank, e.removeNode(r));
-  });
-}
-function te(e) {
-  var r = Number.POSITIVE_INFINITY, n = 0, o = Number.POSITIVE_INFINITY, a = 0, i = e.graph(), d = i.marginx || 0, l = i.marginy || 0;
-  function c(f) {
-    var s = f.x, u = f.y, v = f.width, b = f.height;
-    r = Math.min(r, s - v / 2), n = Math.max(n, s + v / 2), o = Math.min(o, u - b / 2), a = Math.max(a, u + b / 2);
-  }
-  t(e.nodes(), function(f) {
-    c(e.node(f));
-  }), t(e.edges(), function(f) {
-    var s = e.edge(f);
-    Object.prototype.hasOwnProperty.call(s, "x") && c(s);
-  }), r -= d, o -= l, t(e.nodes(), function(f) {
-    var s = e.node(f);
-    s.x -= r, s.y -= o;
-  }), t(e.edges(), function(f) {
-    var s = e.edge(f);
-    t(s.points, function(u) {
-      u.x -= r, u.y -= o;
-    }), Object.prototype.hasOwnProperty.call(s, "x") && (s.x -= r), Object.prototype.hasOwnProperty.call(s, "y") && (s.y -= o);
-  }), i.width = n - r + d, i.height = a - o + l;
-}
-function ie(e) {
-  t(e.edges(), function(r) {
-    var n = e.edge(r), o = e.node(r.v), a = e.node(r.w), i, d;
-    n.points ? (i = n.points[0], d = n.points[n.points.length - 1]) : (n.points = [], i = a, d = o), n.points.unshift(y(o, i)), n.points.push(y(a, d));
-  });
-}
-function de(e) {
-  t(e.edges(), function(r) {
-    var n = e.edge(r);
-    if (Object.prototype.hasOwnProperty.call(n, "x"))
-      switch ((n.labelpos === "l" || n.labelpos === "r") && (n.width -= n.labeloffset), n.labelpos) {
-        case "l":
-          n.x -= n.width / 2 + n.labeloffset;
-          break;
-        case "r":
-          n.x += n.width / 2 + n.labeloffset;
-          break;
-      }
-  });
-}
-function se(e) {
-  t(e.edges(), function(r) {
-    var n = e.edge(r);
-    n.reversed && n.points.reverse();
-  });
-}
-function le(e) {
-  t(e.nodes(), function(r) {
-    if (e.children(r).length) {
-      var n = e.node(r), o = e.node(n.borderTop), a = e.node(n.borderBottom), i = e.node(x(n.borderLeft)), d = e.node(x(n.borderRight));
-      n.width = Math.abs(d.x - i.x), n.height = Math.abs(a.y - o.y), n.x = i.x + n.width / 2, n.y = o.y + n.height / 2;
-    }
-  }), t(e.nodes(), function(r) {
-    e.node(r).dummy === "border" && e.removeNode(r);
-  });
-}
-function fe(e) {
-  t(e.edges(), function(r) {
-    if (r.v === r.w) {
-      var n = e.node(r.v);
-      n.selfEdges || (n.selfEdges = []), n.selfEdges.push({ e: r, label: e.edge(r) }), e.removeEdge(r);
-    }
-  });
-}
-function ue(e) {
-  var r = Y(e);
-  t(r, function(n) {
-    var o = 0;
-    t(n, function(a, i) {
-      var d = e.node(a);
-      d.order = i + o, t(d.selfEdges, function(l) {
-        k(
-          e,
-          "selfedge",
-          {
-            width: l.label.width,
-            height: l.label.height,
-            rank: d.rank,
-            order: i + ++o,
-            e: l.e,
-            label: l.label
-          },
-          "_se"
-        );
-      }), delete d.selfEdges;
-    });
-  });
-}
-function pe(e) {
-  t(e.nodes(), function(r) {
-    var n = e.node(r);
-    if (n.dummy === "selfedge") {
-      var o = e.node(n.e.v), a = o.x + o.width / 2, i = o.y, d = n.x - a, l = o.height / 2;
-      e.setEdge(n.e, n.label), e.removeNode(r), n.label.points = [
-        { x: a + 2 * d / 3, y: i - l },
-        { x: a + 5 * d / 6, y: i - l },
-        { x: a + d, y: i },
-        { x: a + 5 * d / 6, y: i + l },
-        { x: a + 2 * d / 3, y: i + l }
-      ], n.label.x = n.x, n.label.y = n.y;
-    }
-  });
-}
-function p(e, r) {
-  return $(m(e, r), Number);
-}
-function h(e) {
-  var r = {};
-  return t(e, function(n, o) {
-    r[o.toLowerCase()] = n;
-  }), r;
-}
-export {
-  Me as layout
-};

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/nesting-graph.js

@@ -1,68 +0,0 @@
-import { addDummyNode as B, addBorderNode as E } from "./util.js";
-import T from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/max.js";
-import w from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/values.js";
-import a from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/forEach.js";
-import N from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/reduce.js";
-function y(e) {
-  var r = B(e, "root", {}, "_root"), t = R(e), o = T(w(t)) - 1, i = 2 * o + 1;
-  e.graph().nestingRoot = r, a(e.edges(), function(n) {
-    e.edge(n).minlen *= i;
-  });
-  var d = _(e) + 1;
-  a(e.children(), function(n) {
-    g(e, r, i, d, o, t, n);
-  }), e.graph().nodeRankFactor = i;
-}
-function g(e, r, t, o, i, d, n) {
-  var s = e.children(n);
-  if (!s.length) {
-    n !== r && e.setEdge(r, n, { weight: 0, minlen: t });
-    return;
-  }
-  var f = E(e, "_bt"), c = E(e, "_bb"), l = e.node(n);
-  e.setParent(f, n), l.borderTop = f, e.setParent(c, n), l.borderBottom = c, a(s, function(u) {
-    g(e, r, t, o, i, d, u);
-    var m = e.node(u), h = m.borderTop ? m.borderTop : u, p = m.borderBottom ? m.borderBottom : u, b = m.borderTop ? o : 2 * o, v = h !== p ? 1 : i - d[n] + 1;
-    e.setEdge(f, h, {
-      weight: b,
-      minlen: v,
-      nestingEdge: !0
-    }), e.setEdge(p, c, {
-      weight: b,
-      minlen: v,
-      nestingEdge: !0
-    });
-  }), e.parent(n) || e.setEdge(r, f, { weight: 0, minlen: i + d[n] });
-}
-function R(e) {
-  var r = {};
-  function t(o, i) {
-    var d = e.children(o);
-    d && d.length && a(d, function(n) {
-      t(n, i + 1);
-    }), r[o] = i;
-  }
-  return a(e.children(), function(o) {
-    t(o, 1);
-  }), r;
-}
-function _(e) {
-  return N(
-    e.edges(),
-    function(r, t) {
-      return r + e.edge(t).weight;
-    },
-    0
-  );
-}
-function F(e) {
-  var r = e.graph();
-  e.removeNode(r.nestingRoot), delete r.nestingRoot, a(e.edges(), function(t) {
-    var o = e.edge(t);
-    o.nestingEdge && e.removeEdge(t);
-  });
-}
-export {
-  F as cleanup,
-  y as run
-};

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/normalize.js

@@ -1,34 +0,0 @@
-import { addDummyNode as f } from "./util.js";
-import l from "../../../../../lodash-es@4.17.21/node_modules/lodash-es/forEach.js";
-function b(e) {
-  e.graph().dummyChains = [], l(e.edges(), function(d) {
-    g(e, d);
-  });
-}
-function g(e, d) {
-  var a = d.v, i = e.node(a).rank, t = d.w, m = e.node(t).rank, u = d.name, n = e.edge(d), s = n.labelRank;
-  if (m !== i + 1) {
-    e.removeEdge(d);
-    var r = void 0, h, o;
-    for (o = 0, ++i; i < m; ++o, ++i)
-      n.points = [], r = {
-        width: 0,
-        height: 0,
-        edgeLabel: n,
-        edgeObj: d,
-        rank: i
-      }, h = f(e, "edge", r, "_d"), i === s && (r.width = n.width, r.height = n.height, r.dummy = "edge-label", r.labelpos = n.labelpos), e.setEdge(a, h, { weight: n.weight }, u), o === 0 && e.graph().dummyChains.push(h), a = h;
-    e.setEdge(a, t, { weight: n.weight }, u);
-  }
-}
-function p(e) {
-  l(e.graph().dummyChains, function(d) {
-    var a = e.node(d), i = a.edgeLabel, t;
-    for (e.setEdge(a.edgeObj, i); a.dummy; )
-      t = e.successors(d)[0], e.removeNode(d), i.points.push({ x: a.x, y: a.y }), a.dummy === "edge-label" && (i.x = a.x, i.y = a.y, i.width = a.width, i.height = a.height), d = t, a = e.node(d);
-  });
-}
-export {
-  b as run,
-  p as undo
-};

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js

@@ -1,16 +0,0 @@
-import d from "../../../../../../lodash-es@4.17.21/node_modules/lodash-es/forEach.js";
-function v(n, o, p) {
-  var a = {}, i;
-  d(p, function(f) {
-    for (var r = n.parent(f), e, t; r; ) {
-      if (e = n.parent(r), e ? (t = a[e], a[e] = r) : (t = i, i = r), t && t !== r) {
-        o.setEdge(t, r);
-        return;
-      }
-      r = e;
-    }
-  });
-}
-export {
-  v as addSubgraphConstraints
-};

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/order/barycenter.js

@@ -1,29 +0,0 @@
-import m from "../../../../../../lodash-es@4.17.21/node_modules/lodash-es/map.js";
-import w from "../../../../../../lodash-es@4.17.21/node_modules/lodash-es/reduce.js";
-function a(e, u) {
-  return m(u, function(r) {
-    var n = e.inEdges(r);
-    if (n.length) {
-      var t = w(
-        n,
-        function(i, o) {
-          var g = e.edge(o), h = e.node(o.v);
-          return {
-            sum: i.sum + g.weight * h.order,
-            weight: i.weight + g.weight
-          };
-        },
-        { sum: 0, weight: 0 }
-      );
-      return {
-        v: r,
-        barycenter: t.sum / t.weight,
-        weight: t.weight
-      };
-    } else
-      return { v: r };
-  });
-}
-export {
-  a as barycenter
-};

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js

@@ -1,26 +0,0 @@
-import { Graph as s } from "../../graphlib/graph.js";
-import u from "../../../../../../lodash-es@4.17.21/node_modules/lodash-es/forEach.js";
-import c from "../../../../../../lodash-es@4.17.21/node_modules/lodash-es/isUndefined.js";
-import w from "../../../../../../lodash-es@4.17.21/node_modules/lodash-es/uniqueId.js";
-function L(t, o, p) {
-  var d = b(t), r = new s({ compound: !0 }).setGraph({ root: d }).setDefaultNodeLabel(function(e) {
-    return t.node(e);
-  });
-  return u(t.nodes(), function(e) {
-    var n = t.node(e), h = t.parent(e);
-    (n.rank === o || n.minRank <= o && o <= n.maxRank) && (r.setNode(e), r.setParent(e, h || d), u(t[p](e), function(i) {
-      var a = i.v === e ? i.w : i.v, f = r.edge(a, e), m = c(f) ? 0 : f.weight;
-      r.setEdge(a, e, { weight: t.edge(i).weight + m });
-    }), Object.prototype.hasOwnProperty.call(n, "minRank") && r.setNode(e, {
-      borderLeft: n.borderLeft[o],
-      borderRight: n.borderRight[o]
-    }));
-  }), r;
-}
-function b(t) {
-  for (var o; t.hasNode(o = w("_root")); ) ;
-  return o;
-}
-export {
-  L as buildLayerGraph
-};