@altimateai/ui-components 0.0.72-beta1 → 0.0.72-beta3

package/dist/layout.js

@@ -1,16 +1,16 @@
 import { G as g } from "./graph.js";
-import { b as Te, p as ce, q as le, g as z, e as ee, l as j, o as Ie, s as Me, c as Se, u as Fe, d as f, i as m, f as _, v as x, r as M } from "./_baseUniq.js";
-import { f as O, b as he, a as je, c as Ve, d as Ae, t as V, m as w, e as P, h as ve, g as X, l as T, i as Be } from "./_basePickBy.js";
-import { bN as Ge, bO as Ye, bP as De, bD as qe, bQ as $e, bH as pe, bG as we, bR as We, bC as q, bq as ze, bJ as Xe, bs as Ue, bS as $ } from "./CoachForm.js";
+import { b as Te, p as ce, q as le, g as z, e as ee, l as j, o as Me, s as Ie, c as Se, u as Fe, d as f, i as m, f as _, v as x, r as I } from "./_baseUniq.js";
+import { f as O, b as he, a as je, c as Ve, d as Be, t as V, m as w, e as P, h as ve, g as X, l as T, i as Ae } from "./_basePickBy.js";
+import { aW as Ge, aX as Ye, aY as De, aM as $e, aZ as qe, aQ as pe, aP as we, a_ as We, aL as $, az as ze, aS as Xe, aB as Ue, a$ as q } from "./CoachForm.js";
 function He(e) {
   return Ge(Ye(e, void 0, O), e + "");
 }
-var Je = 1, Qe = 4;
-function Ze(e) {
-  return Te(e, Je | Qe);
+var Ze = 1, Je = 4;
+function Qe(e) {
+  return Te(e, Ze | Je);
 }
 function Ke(e, n) {
-  return e == null ? e : De(e, ce(n), qe);
+  return e == null ? e : De(e, ce(n), $e);
 }
 function en(e, n) {
   return e && le(e, ce(n));
@@ -21,7 +21,7 @@ function nn(e, n) {
 function S(e, n) {
   var r = {};
   return n = z(n), le(e, function(t, a, i) {
-    $e(r, a, n(t, a, i));
+    qe(r, a, n(t, a, i));
   }), r;
 }
 function y(e) {
@@ -61,7 +61,7 @@ function an(e, n, r) {
 function on(e, n, r) {
   n.length ? n = j(n, function(i) {
     return we(i) ? function(o) {
-      return Ie(o, i.length === 1 ? i[0] : i);
+      return Me(o, i.length === 1 ? i[0] : i);
     } : i;
   }) : n = [pe];
   var t = -1;
@@ -77,11 +77,11 @@ function on(e, n, r) {
   });
 }
 function un(e, n) {
-  return Ae(e, n, function(r, t) {
-    return Me(e, t);
+  return Be(e, n, function(r, t) {
+    return Ie(e, t);
   });
 }
-var I = He(function(e, n) {
+var M = He(function(e, n) {
   return e == null ? {} : un(e, n);
 }), dn = Math.ceil, sn = Math.max;
 function fn(e, n, r, t) {
@@ -91,14 +91,14 @@ function fn(e, n, r, t) {
 }
 function cn(e) {
   return function(n, r, t) {
-    return t && typeof t != "number" && q(n, r, t) && (r = t = void 0), n = V(n), r === void 0 ? (r = n, n = 0) : r = V(r), t = t === void 0 ? n < r ? 1 : -1 : V(t), fn(n, r, t);
+    return t && typeof t != "number" && $(n, r, t) && (r = t = void 0), n = V(n), r === void 0 ? (r = n, n = 0) : r = V(r), t = t === void 0 ? n < r ? 1 : -1 : V(t), fn(n, r, t);
   };
 }
 var E = cn(), R = ze(function(e, n) {
   if (e == null)
     return [];
   var r = n.length;
-  return r > 1 && q(e, n[0], n[1]) ? n = [] : r > 2 && q(n[0], n[1], n[2]) && (n = [n[0]]), on(e, Se(n), []);
+  return r > 1 && $(e, n[0], n[1]) ? n = [] : r > 2 && $(n[0], n[1], n[2]) && (n = [n[0]]), on(e, Se(n), []);
 }), ln = 0;
 function H(e) {
   var n = ++ln;
@@ -155,20 +155,20 @@ function mn(e, n) {
 function gn(e, n, r) {
   for (var t = [], a = n[n.length - 1], i = n[0], o; e.nodeCount(); ) {
     for (; o = i.dequeue(); )
-      A(e, n, r, o);
+      B(e, n, r, o);
     for (; o = a.dequeue(); )
-      A(e, n, r, o);
+      B(e, n, r, o);
     if (e.nodeCount()) {
       for (var u = n.length - 2; u > 0; --u)
         if (o = n[u].dequeue(), o) {
-          t = t.concat(A(e, n, r, o, !0));
+          t = t.concat(B(e, n, r, o, !0));
           break;
         }
     }
   }
   return t;
 }
-function A(e, n, r, t, a) {
+function B(e, n, r, t, a) {
   var i = a ? [] : void 0;
   return f(e.inEdges(t.v), function(o) {
     var u = e.edge(o), d = e.node(o.v);
@@ -344,7 +344,7 @@ function Rn(e) {
 }
 function Tn(e) {
   var n = e.graph().rankdir.toLowerCase();
-  (n === "bt" || n === "rl") && In(e), (n === "lr" || n === "rl") && (Mn(e), ge(e));
+  (n === "bt" || n === "rl") && Mn(e), (n === "lr" || n === "rl") && (In(e), ge(e));
 }
 function ge(e) {
   f(e.nodes(), function(n) {
@@ -357,18 +357,18 @@ function ie(e) {
   var n = e.width;
   e.width = e.height, e.height = n;
 }
-function In(e) {
+function Mn(e) {
   f(e.nodes(), function(n) {
-    B(e.node(n));
+    A(e.node(n));
   }), f(e.edges(), function(n) {
     var r = e.edge(n);
-    f(r.points, B), Object.prototype.hasOwnProperty.call(r, "y") && B(r);
+    f(r.points, A), Object.prototype.hasOwnProperty.call(r, "y") && A(r);
   });
 }
-function B(e) {
+function A(e) {
   e.y = -e.y;
 }
-function Mn(e) {
+function In(e) {
   f(e.nodes(), function(n) {
     G(e.node(n));
   }), f(e.edges(), function(n) {
@@ -408,7 +408,7 @@ function jn(e) {
       a = e.successors(n)[0], e.removeNode(n), t.points.push({ x: r.x, y: r.y }), r.dummy === "edge-label" && (t.x = r.x, t.y = r.y, t.width = r.width, t.height = r.height), n = a, r = e.node(n);
   });
 }
-function J(e) {
+function Z(e) {
   var n = {};
   function r(t) {
     var a = e.node(t);
@@ -433,7 +433,7 @@ function ye(e) {
   var n = new g({ directed: !1 }), r = e.nodes()[0], t = e.nodeCount();
   n.setNode(r, {});
   for (var a, i; Vn(n, e) < t; )
-    a = An(n, e), i = n.hasNode(a.v) ? C(e, a) : -C(e, a), Bn(n, e, i);
+    a = Bn(n, e), i = n.hasNode(a.v) ? C(e, a) : -C(e, a), An(n, e, i);
   return n;
 }
 function Vn(e, n) {
@@ -445,13 +445,13 @@ function Vn(e, n) {
   }
   return f(e.nodes(), r), e.nodeCount();
 }
-function An(e, n) {
+function Bn(e, n) {
   return U(n.edges(), function(r) {
     if (e.hasNode(r.v) !== e.hasNode(r.w))
       return C(n, r);
   });
 }
-function Bn(e, n, r) {
+function An(e, n, r) {
   f(e.nodes(), function(t) {
     n.node(t).rank += r;
   });
@@ -479,26 +479,26 @@ function Yn(e, n) {
 function Dn(e, n) {
   return ke(e, n, "pre");
 }
-k.initLowLimValues = Z;
-k.initCutValues = Q;
+k.initLowLimValues = Q;
+k.initCutValues = J;
 k.calcCutValue = Ee;
 k.leaveEdge = Le;
 k.enterEdge = Ne;
 k.exchangeEdges = Pe;
 function k(e) {
-  e = On(e), J(e);
+  e = On(e), Z(e);
   var n = ye(e);
-  Z(n), Q(n, e);
+  Q(n), J(n, e);
   for (var r, t; r = Le(n); )
     t = Ne(n, e, r), Pe(n, e, r, t);
 }
-function Q(e, n) {
+function J(e, n) {
   var r = Yn(e, e.nodes());
   r = r.slice(0, r.length - 1), f(r, function(t) {
-    qn(e, n, t);
+    $n(e, n, t);
   });
 }
-function qn(e, n, r) {
+function $n(e, n, r) {
   var t = e.node(r), a = t.parent;
   e.edge(r, a).cutvalue = Ee(e, n, r);
 }
@@ -515,7 +515,7 @@ function Ee(e, n, r) {
     }
   }), u;
 }
-function Z(e, n) {
+function Q(e, n) {
   arguments.length < 2 && (n = e.nodes()[0]), Oe(e, {}, 1, n);
 }
 function Oe(e, n, r, t, a) {
@@ -543,9 +543,9 @@ function Ne(e, n, r) {
 }
 function Pe(e, n, r, t) {
   var a = r.v, i = r.w;
-  e.removeEdge(a, i), e.setEdge(t.v, t.w, {}), Z(e), Q(e, n), $n(e, n);
+  e.removeEdge(a, i), e.setEdge(t.v, t.w, {}), Q(e), J(e, n), qn(e, n);
 }
-function $n(e, n) {
+function qn(e, n) {
   var r = X(e.nodes(), function(a) {
     return !n.node(a).parent;
   }), t = Dn(e, r);
@@ -575,19 +575,19 @@ function zn(e) {
       ue(e);
   }
 }
-var Xn = J;
+var Xn = Z;
 function Un(e) {
-  J(e), ye(e);
+  Z(e), ye(e);
 }
 function ue(e) {
   k(e);
 }
 function Hn(e) {
-  var n = L(e, "root", {}, "_root"), r = Jn(e), t = y(x(r)) - 1, a = 2 * t + 1;
+  var n = L(e, "root", {}, "_root"), r = Zn(e), t = y(x(r)) - 1, a = 2 * t + 1;
   e.graph().nestingRoot = n, f(e.edges(), function(o) {
     e.edge(o).minlen *= a;
   });
-  var i = Qn(e) + 1;
+  var i = Jn(e) + 1;
   f(e.children(), function(o) {
     Ce(e, n, a, i, t, r, o);
   }), e.graph().nodeRankFactor = a;
@@ -613,7 +613,7 @@ function Ce(e, n, r, t, a, i, o) {
     });
   }), e.parent(o) || e.setEdge(n, d, { weight: 0, minlen: a + i[o] });
 }
-function Jn(e) {
+function Zn(e) {
   var n = {};
   function r(t, a) {
     var i = e.children(t);
@@ -625,8 +625,8 @@ function Jn(e) {
     r(t, 1);
   }), n;
 }
-function Qn(e) {
-  return M(
+function Jn(e) {
+  return I(
     e.edges(),
     function(n, r) {
       return n + e.edge(r).weight;
@@ -634,7 +634,7 @@ function Qn(e) {
     0
   );
 }
-function Zn(e) {
+function Qn(e) {
   var n = e.graph();
   e.removeNode(n.nestingRoot), delete n.nestingRoot, f(e.edges(), function(r) {
     var t = e.edge(r);
@@ -735,7 +735,7 @@ function ir(e, n) {
   return w(n, function(r) {
     var t = e.inEdges(r);
     if (t.length) {
-      var a = M(
+      var a = I(
         t,
         function(i, o) {
           var u = e.edge(o), d = e.node(o.v);
@@ -796,7 +796,7 @@ function ur(e) {
       return !i.merged;
     }),
     function(i) {
-      return I(i, ["vs", "i", "barycenter", "weight"]);
+      return M(i, ["vs", "i", "barycenter", "weight"]);
     }
   );
 }
@@ -865,7 +865,7 @@ function hr(e) {
   for (var i = Number.POSITIVE_INFINITY, o, u = 0, d = 0; d < 4; ++u, ++d) {
     vr(u % 2 ? r : t, u % 4 >= 2), a = F(e);
     var s = rr(e, a);
-    s < i && (d = 0, o = Ze(a), i = s);
+    s < i && (d = 0, o = Qe(a), i = s);
   }
   fe(e, o);
 }
@@ -940,7 +940,7 @@ function mr(e, n) {
       }), u = l + 1, o = v);
     }), i;
   }
-  return M(n, t), r;
+  return I(n, t), r;
 }
 function gr(e, n) {
   var r = {};
@@ -963,7 +963,7 @@ function gr(e, n) {
       t(o, s, o.length, d, i.length);
     }), o;
   }
-  return M(n, a), r;
+  return I(n, a), r;
 }
 function yr(e, n) {
   if (e.node(n).dummy)
@@ -1075,7 +1075,7 @@ function Pr(e, n) {
   });
 }
 function Cr(e) {
-  var n = F(e), r = $(mr(e, n), gr(e, n)), t = {}, a;
+  var n = F(e), r = q(mr(e, n), gr(e, n)), t = {}, a;
   f(["u", "d"], function(o) {
     a = o === "u" ? n : x(n).reverse(), f(["l", "r"], function(u) {
       u === "r" && (a = w(a, function(l) {
@@ -1118,11 +1118,11 @@ function Rr(e, n) {
   return e.node(n).width;
 }
 function Tr(e) {
-  e = be(e), Ir(e), en(Cr(e), function(n, r) {
+  e = be(e), Mr(e), en(Cr(e), function(n, r) {
     e.node(r).x = n;
   });
 }
-function Ir(e) {
+function Mr(e) {
   var n = F(e), r = e.graph().ranksep, t = 0;
   f(n, function(a) {
     var i = y(
@@ -1138,12 +1138,12 @@ function Ir(e) {
 function ot(e, n) {
   var r = Cn;
   r("layout", () => {
-    var t = r("  buildLayoutGraph", () => qr(e));
-    r("  runLayout", () => Mr(t, r)), r("  updateInputGraph", () => Sr(e, t));
+    var t = r("  buildLayoutGraph", () => $r(e));
+    r("  runLayout", () => Ir(t, r)), r("  updateInputGraph", () => Sr(e, t));
   });
 }
-function Mr(e, n) {
-  n("    makeSpaceForEdgeLabels", () => $r(e)), n("    removeSelfEdges", () => Kr(e)), n("    acyclic", () => kn(e)), n("    nestingGraph.run", () => Hn(e)), n("    rank", () => zn(be(e))), n("    injectEdgeLabelProxies", () => Wr(e)), n("    removeEmptyRanks", () => Nn(e)), n("    nestingGraph.cleanup", () => Zn(e)), n("    normalizeRanks", () => Ln(e)), n("    assignRankMinMax", () => zr(e)), n("    removeEdgeLabelProxies", () => Xr(e)), n("    normalize.run", () => Sn(e)), n("    parentDummyChains", () => pr(e)), n("    addBorderSegments", () => _n(e)), n("    order", () => hr(e)), n("    insertSelfEdges", () => et(e)), n("    adjustCoordinateSystem", () => Rn(e)), n("    position", () => Tr(e)), n("    positionSelfEdges", () => nt(e)), n("    removeBorderNodes", () => Zr(e)), n("    normalize.undo", () => jn(e)), n("    fixupEdgeLabelCoords", () => Jr(e)), n("    undoCoordinateSystem", () => Tn(e)), n("    translateGraph", () => Ur(e)), n("    assignNodeIntersects", () => Hr(e)), n("    reversePoints", () => Qr(e)), n("    acyclic.undo", () => En(e));
+function Ir(e, n) {
+  n("    makeSpaceForEdgeLabels", () => qr(e)), n("    removeSelfEdges", () => Kr(e)), n("    acyclic", () => kn(e)), n("    nestingGraph.run", () => Hn(e)), n("    rank", () => zn(be(e))), n("    injectEdgeLabelProxies", () => Wr(e)), n("    removeEmptyRanks", () => Nn(e)), n("    nestingGraph.cleanup", () => Qn(e)), n("    normalizeRanks", () => Ln(e)), n("    assignRankMinMax", () => zr(e)), n("    removeEdgeLabelProxies", () => Xr(e)), n("    normalize.run", () => Sn(e)), n("    parentDummyChains", () => pr(e)), n("    addBorderSegments", () => _n(e)), n("    order", () => hr(e)), n("    insertSelfEdges", () => et(e)), n("    adjustCoordinateSystem", () => Rn(e)), n("    position", () => Tr(e)), n("    positionSelfEdges", () => nt(e)), n("    removeBorderNodes", () => Qr(e)), n("    normalize.undo", () => jn(e)), n("    fixupEdgeLabelCoords", () => Zr(e)), n("    undoCoordinateSystem", () => Tn(e)), n("    translateGraph", () => Ur(e)), n("    assignNodeIntersects", () => Hr(e)), n("    reversePoints", () => Jr(e)), n("    acyclic.undo", () => En(e));
 }
 function Sr(e, n) {
   f(e.nodes(), function(r) {
@@ -1154,7 +1154,7 @@ function Sr(e, n) {
     t.points = a.points, Object.prototype.hasOwnProperty.call(a, "x") && (t.x = a.x, t.y = a.y);
   }), e.graph().width = n.graph().width, e.graph().height = n.graph().height;
 }
-var Fr = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], jr = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, Vr = ["acyclicer", "ranker", "rankdir", "align"], Ar = ["width", "height"], Br = { width: 0, height: 0 }, Gr = ["minlen", "weight", "width", "height", "labeloffset"], Yr = {
+var Fr = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], jr = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, Vr = ["acyclicer", "ranker", "rankdir", "align"], Br = ["width", "height"], Ar = { width: 0, height: 0 }, Gr = ["minlen", "weight", "width", "height", "labeloffset"], Yr = {
   minlen: 1,
   weight: 1,
   width: 0,
@@ -1162,22 +1162,22 @@ var Fr = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], jr = { ranksep
   labeloffset: 10,
   labelpos: "r"
 }, Dr = ["labelpos"];
-function qr(e) {
+function $r(e) {
   var n = new g({ multigraph: !0, compound: !0 }), r = D(e.graph());
   return n.setGraph(
-    $({}, jr, Y(r, Fr), I(r, Vr))
+    q({}, jr, Y(r, Fr), M(r, Vr))
   ), f(e.nodes(), function(t) {
     var a = D(e.node(t));
-    n.setNode(t, Be(Y(a, Ar), Br)), n.setParent(t, e.parent(t));
+    n.setNode(t, Ae(Y(a, Br), Ar)), n.setParent(t, e.parent(t));
   }), f(e.edges(), function(t) {
     var a = D(e.edge(t));
     n.setEdge(
       t,
-      $({}, Yr, Y(a, Gr), I(a, Dr))
+      q({}, Yr, Y(a, Gr), M(a, Dr))
     );
   }), n;
 }
-function $r(e) {
+function qr(e) {
   var n = e.graph();
   n.ranksep /= 2, f(e.edges(), function(r) {
     var t = e.edge(r);
@@ -1233,7 +1233,7 @@ function Hr(e) {
     r.points ? (i = r.points[0], o = r.points[r.points.length - 1]) : (r.points = [], i = a, o = t), r.points.unshift(re(t, i)), r.points.push(re(a, o));
   });
 }
-function Jr(e) {
+function Zr(e) {
   f(e.edges(), function(n) {
     var r = e.edge(n);
     if (Object.prototype.hasOwnProperty.call(r, "x"))
@@ -1247,13 +1247,13 @@ function Jr(e) {
       }
   });
 }
-function Qr(e) {
+function Jr(e) {
   f(e.edges(), function(n) {
     var r = e.edge(n);
     r.reversed && r.points.reverse();
   });
 }
-function Zr(e) {
+function Qr(e) {
   f(e.nodes(), function(n) {
     if (e.children(n).length) {
       var r = e.node(n), t = e.node(r.borderTop), a = e.node(r.borderBottom), i = e.node(T(r.borderLeft)), o = e.node(T(r.borderRight));
@@ -1311,7 +1311,7 @@ function nt(e) {
   });
 }
 function Y(e, n) {
-  return S(I(e, n), Number);
+  return S(M(e, n), Number);
 }
 function D(e) {
   var n = {};

package/dist/main.js

@@ -1,5 +1,5 @@
 import { d as dt, C as Yn } from "./dayjs.min.js";
-import { ce as un, cf as Wn, cg as Xn, ch as Kn, ci as Gn, cj as Zn, ck as rt, cl as Qn, cm as Jn } from "./CoachForm.js";
+import { bn as un, bo as Wn, bp as Xn, bq as Kn, br as Gn, bs as Zn, bt as rt, bu as Qn, bv as Jn } from "./CoachForm.js";
 import { g as yt, k as ln, A as ve, l as er, I as Ie, u as cn, m as tr } from "./redux-toolkit.modern.js";
 import { B as ye, a4 as $e, a5 as He, a6 as nr, X as oe, a7 as rr, T as or, a0 as ft, Y as ir } from "./Stack.js";
 import { j as h, A as dn, e as sr, f as ar, a as ur, d as lr, D as cr, E as dr, c as fr, b as pr } from "./index2.js";