@synnaxlabs/pluto 0.42.4 → 0.43.1

package/dist/{external-B1YsdhS4.js → external-5nVYtLDI.js}

@@ -1,24 +1,24 @@
-import { C as f, F as me, b as J } from "./css-Cnb9DQMD.js";
-import { A as U } from "./toArray-B7nD2CTw.js";
-import { j as b } from "./jsx-runtime-C5mzlN2N.js";
-import { y as Q, M as pe, e as ge, a as ye, f as xe, d as Ce } from "./Divider-DqEkzRIY.js";
-import { memo as be, useState as Ne, useCallback as N, useMemo as ve } from "react";
-import { B as Te, c as Ie } from "./Toggle-BRuUrO2N.js";
-import { L as je } from "./Link-C9GeoB0w.js";
-import { u as $e } from "./Haul-CEFSvdy9.js";
-import { u as we, a as Ee, C as V, L as Le, S as Se } from "./Text-BR4FW9Hy.js";
+import { C as f, L as me, c as J } from "./css-DjQu2Qyf.js";
+import { t as U } from "./array-CPtP5Oov.js";
+import { j as N } from "./jsx-runtime-C5mzlN2N.js";
+import { y as Q, M as pe, e as ge, a as ye, d as xe, c as Ce } from "./Divider-CDFHLK9U.js";
+import { memo as Ne, useState as be, useCallback as b, useMemo as ve } from "react";
+import { B as Te, c as Ie } from "./Toggle-CbzT5wR_.js";
+import { L as je } from "./Link-DcudTtgT.js";
+import { u as Ae } from "./Haul-D6kpOYBa.js";
+import { u as Le, a as $e, C as V, L as we, S as Ee } from "./Text-wL3te5S6.js";
 import "./Stack-D50qN0Vu.js";
-import { b as _e } from "./state-CjGemC7S.js";
-import { a as Ae, C as Oe } from "./ContextMenu-BiNr7Gxv.js";
-import "./provider-r5Ly36FI.js";
-import { v as Pe } from "./hooks-DjznxGgm.js";
+import { e as Se } from "./state-DAFH2z9y.js";
+import { a as _e, C as Oe } from "./ContextMenu-DLM5eLLG.js";
+import "./provider-gW90qzEG.js";
+import { v as Pe } from "./hooks-u_TgL0Xi.js";
 const Z = ({
   className: e,
   enabledLoc: t,
   disabledLoc: n,
   enabled: r,
   ...s
-}) => /* @__PURE__ */ b.jsx(
+}) => /* @__PURE__ */ N.jsx(
   Q.Caret.Up,
   {
     className: f(
@@ -28,7 +28,7 @@ const Z = ({
     ),
     ...s
   }
-), lt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+), at = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   Animated: Z
 }, Symbol.toStringTag, { value: "Module" })), D = (e, t) => t.includes(e.key), ee = (e, t) => me.stringsWithNumbers(e.name, t.name), G = (e, t = ee) => {
@@ -46,44 +46,44 @@ const Z = ({
   sort: r,
   path: s = ""
 }) => {
-  n === 0 && r != !1 && (e = e.sort((a, i) => a.name.localeCompare(i.name)));
-  const l = [];
-  return e.forEach((a, i) => {
-    const d = `${s}${a.key}/`, u = D(a, t);
-    l.push({ ...a, depth: n, expanded: u, index: i, path: d }), u && a.children != null && (a.children = G(a.children, r), l.push(
+  n === 0 && r != !1 && (e = e.sort((l, i) => l.name.localeCompare(i.name)));
+  const a = [];
+  return e.forEach((l, i) => {
+    const d = `${s}${l.key}/`, u = D(l, t);
+    a.push({ ...l, depth: n, expanded: u, index: i, path: d }), u && l.children != null && (l.children = G(l.children, r), a.push(
       ...K({
-        nodes: a.children,
+        nodes: l.children,
         expanded: t,
         depth: n + 1,
         sort: r,
         path: d
       })
     ));
-  }), l;
-}, Me = ({ tree: e, destination: t, keys: n }) => (n = U(n), t == null ? [...re({ tree: e, keys: n }), ...e.filter((s) => !n.includes(s.key))] : (n.forEach((r) => {
+  }), a;
+}, Me = ({ tree: e, destination: t, keys: n }) => (n = U.toArray(n), t == null ? [...re({ tree: e, keys: n }), ...e.filter((s) => !n.includes(s.key))] : (n.forEach((r) => {
   const s = T({ tree: e, key: r });
   s != null && (te({ tree: e, keys: r }), ne({ tree: e, destination: t, additions: s }));
-}), e)), te = ({ tree: e, keys: t }) => (t = U(t), t.forEach((n) => {
+}), e)), te = ({ tree: e, keys: t }) => (t = U.toArray(t), t.forEach((n) => {
   var s;
-  const r = e.findIndex((l) => l.key === n);
+  const r = e.findIndex((a) => a.key === n);
   if (r !== -1) e.splice(r, 1);
   else {
-    const l = A({ tree: e, key: n });
-    l != null && (l.children = (s = l.children) == null ? void 0 : s.filter((a) => a.key !== n));
+    const a = _({ tree: e, key: n });
+    a != null && (a.children = (s = a.children) == null ? void 0 : s.filter((l) => l.key !== n));
   }
 }), e), ne = ({ tree: e, destination: t, additions: n }) => {
-  n = U(n);
-  const r = J.by(n, (a) => a.key, !1), s = r.map((a) => a.key);
+  n = U.toArray(n);
+  const r = J.by(n, (l) => l.key, !1), s = r.map((l) => l.key);
   if (t == null)
     return [
       ...r,
-      ...e.filter((a) => !s.includes(a.key))
+      ...e.filter((l) => !s.includes(l.key))
     ];
-  const l = T({ tree: e, key: t });
-  if (l == null) throw new Error(`Could not find node with key ${t}`);
-  return l.children ?? (l.children = []), l.children = [
+  const a = T({ tree: e, key: t });
+  if (a == null) throw new Error(`Could not find node with key ${t}`);
+  return a.children ?? (a.children = []), a.children = [
     ...r,
-    ...l.children.filter((a) => !s.includes(a.key))
+    ...a.children.filter((l) => !s.includes(l.key))
   ], e;
 }, Be = ({
   tree: e,
@@ -91,16 +91,16 @@ const Z = ({
   updater: n,
   throwOnMissing: r = !0
 }) => {
-  var a, i;
+  var l, i;
   const s = T({ tree: e, key: t });
   if (s == null) {
     if (r) throw new Error(`Could not find node with key ${t}`);
     return e;
   }
-  const l = A({ tree: e, key: t });
-  if (l != null) {
-    const d = (a = l.children) == null ? void 0 : a.findIndex((u) => u.key === t);
-    d != null && d !== -1 && ((i = l.children) == null || i.splice(d, 1, n(s)));
+  const a = _({ tree: e, key: t });
+  if (a != null) {
+    const d = (l = a.children) == null ? void 0 : l.findIndex((u) => u.key === t);
+    d != null && d !== -1 && ((i = a.children) == null || i.splice(d, 1, n(s)));
   } else
     e.splice(
       e.findIndex((d) => d.key === t),
@@ -128,12 +128,12 @@ const Z = ({
   for (let r = 0; r < e.length; r++) {
     const s = e[r];
     if (s.key === t) {
-      const l = s;
-      return l.depth = n, l.position = r, l;
+      const a = s;
+      return a.depth = n, a.position = r, a;
     }
     if (s.children != null) {
-      const l = T({ tree: s.children, key: t, depth: n + 1 });
-      if (l != null) return l;
+      const a = T({ tree: s.children, key: t, depth: n + 1 });
+      if (a != null) return a;
     }
   }
   return null;
@@ -144,18 +144,18 @@ const Z = ({
     s != null && n.push(s);
   }
   return n;
-}, A = ({ tree: e, key: t }) => {
+}, _ = ({ tree: e, key: t }) => {
   for (const n of e)
     if (n.children != null) {
       if (n.children.some((s) => s.key === t)) return n;
-      const r = A({ tree: n.children, key: t });
+      const r = _({ tree: n.children, key: t });
       if (r != null) return r;
     }
   return null;
-}, se = (e) => e.map((t) => ({ ...t, children: se(t.children ?? []) })), le = (...e) => {
+}, se = (e) => e.map((t) => ({ ...t, children: se(t.children ?? []) })), ae = (...e) => {
   const t = [];
   return e.forEach((n) => {
-    t.push(n), n.children != null && t.push(...le(...n.children));
+    t.push(n), n.children != null && t.push(...ae(...n.children));
   }), t;
 }, ke = (e) => {
   if (e.length === 0) return [];
@@ -168,122 +168,122 @@ const Z = ({
   initialExpanded: n = [],
   sort: r,
   selected: s,
-  onSelectedChange: l
+  onSelectedChange: a
 }) => {
-  const [a, i, d] = xe(n), [u, v] = _e({
+  const [l, i, d] = xe(n), [u, v] = Se({
     initial: [],
     value: s,
-    onChange: l
+    onChange: a
   }), I = ve(
-    () => K({ nodes: t, expanded: a, sort: r }),
-    [t, a, r]
-  ), j = Ce(I), L = Pe({ triggers: He }), S = N(
+    () => K({ nodes: t, expanded: l, sort: r }),
+    [t, l, r]
+  ), j = Ce(I), w = Pe({ triggers: He }), E = b(
     (h, { clicked: c }) => {
       v(h);
       const m = j.current.find((C) => C.key === c);
-      if ((m == null ? void 0 : m.hasChildren) === !1 || c == null || L.current.held) return;
+      if ((m == null ? void 0 : m.hasChildren) === !1 || c == null || w.current.held) return;
       const x = d.current, y = x.some((C) => C === c) ? "contract" : "expand";
-      let w;
-      y === "contract" ? w = x.filter((C) => C !== c) : w = [...x, c], i(w), e == null || e({ current: w, action: y, clicked: c });
+      let L;
+      y === "contract" ? L = x.filter((C) => C !== c) : L = [...x, c], i(L), e == null || e({ current: L, action: y, clicked: c });
     },
     [e, j, i, v]
-  ), _ = N(
+  ), S = b(
     (h) => {
-      i((c) => J.unique([...c, h])), e == null || e({ current: a, action: "expand", clicked: h });
+      i((c) => J.unique([...c, h])), e == null || e({ current: l, action: "expand", clicked: h });
     },
     [i]
-  ), o = N(
+  ), o = b(
     (...h) => {
       i((c) => c.filter((m) => !h.includes(m))), h.forEach((c) => {
-        e == null || e({ current: a, action: "contract", clicked: c });
+        e == null || e({ current: l, action: "contract", clicked: c });
       });
     },
     [i]
-  ), $ = N(() => i([]), [i]);
+  ), A = b(() => i([]), [i]);
   return {
-    onSelect: S,
+    onSelect: E,
     selected: u,
-    expanded: a,
+    expanded: l,
     contract: o,
-    expand: _,
+    expand: S,
     nodes: I,
-    clearExpanded: $
+    clearExpanded: A
   };
-}, q = be(
+}, q = Ne(
   ({
     entry: e,
     selected: t,
     onSelect: n,
     onDrop: r,
     onRename: s,
-    onSuccessfulDrop: l,
-    onDoubleClick: a,
+    onSuccessfulDrop: a,
+    onDoubleClick: l,
     loading: i = !1,
     useMargin: d = !0,
     translate: u,
     children: v,
     index: I,
     sourceIndex: j,
-    className: L,
-    hovered: S,
-    ..._
+    className: w,
+    hovered: E,
+    ...S
   }) => {
     const {
       key: o,
-      hasChildren: $ = !1,
+      hasChildren: A = !1,
       allowRename: h = !1,
       children: c,
       icon: m,
       name: x,
       depth: y,
-      expanded: w,
+      expanded: L,
       href: C,
       haulItems: z = []
-    } = e, { getSelected: ae } = we(), { getSourceData: ie } = Ee(), O = $ || c != null && c.length > 0, P = [];
+    } = e, { getSelected: le } = Le(), { getSourceData: ie } = $e(), O = A || c != null && c.length > 0, P = [];
     O && P.push(
-      /* @__PURE__ */ b.jsx(
+      /* @__PURE__ */ N.jsx(
         Z,
         {
-          enabled: w,
+          enabled: L,
           enabledLoc: "bottom",
           disabledLoc: "right"
         },
         "caret"
       )
     ), m != null && P.push(m);
-    const F = [];
-    i && F.push(
-      /* @__PURE__ */ b.jsx(Q.Loading, { className: f.B("loading-indicator") }, "loading-indicator")
+    const W = [];
+    i && W.push(
+      /* @__PURE__ */ N.jsx(Q.Loading, { className: f.B("loading-indicator") }, "loading-indicator")
     );
-    const [oe, M] = Ne(!1), { startDrag: W, ...ce } = $e({
+    const [oe, M] = be(!1), { startDrag: X, ...ce } = Ae({
       type: "Tree.Item",
       key: o,
-      canDrop: N(({ items: p, source: R }) => {
-        const g = p.map((E) => E.key);
+      canDrop: b(({ items: p, source: R }) => {
+        const g = p.map(($) => $.key);
         return M(!1), R.type === "Tree.Item" && !g.includes(o);
       }, []),
-      onDrop: N((p) => (r == null ? void 0 : r(o, p)) ?? [], [o, r]),
-      onDragOver: N(() => M(!0), [])
+      onDrop: b((p) => (r == null ? void 0 : r(o, p)) ?? [], [o, r]),
+      onDragOver: b(() => M(!0), [])
     }), de = () => {
-      const p = ae(), R = ie().filter(
+      const p = le(), R = ie().filter(
         (g) => p.includes(g.key)
       );
       if (p.includes(o)) {
-        const g = R.map(({ key: E, haulItems: k, depth: X }) => [
-          { type: H, key: E, data: { depth: X } },
-          ...(k == null ? void 0 : k.map((Y) => ({
-            ...Y,
-            data: { ...Y.data, depth: X }
+        const g = R.map(({ key: $, haulItems: k, depth: Y }) => [
+          { type: H, key: $, data: { depth: Y } },
+          ...(k == null ? void 0 : k.map((F) => ({
+            ...F,
+            data: { ...F.data, depth: Y }
           }))) ?? []
         ]).flat();
-        return W(g, (E) => l == null ? void 0 : l(o, E));
+        return X(g, ($) => a == null ? void 0 : a(o, $));
       }
-      W(
+      X(
         [
           { type: H, key: o, data: { depth: y } },
           ...z.map((g) => ({ ...g, data: { ...g.data, depth: y } }))
         ],
-        (g) => l == null ? void 0 : l(o, g)
+        (g) => a == null ? void 0 : a(o, g)
       );
     }, fe = d ? "marginLeft" : "paddingLeft";
     let B = y * 2.5 + 1.5;
@@ -294,13 +294,13 @@ const Z = ({
       draggable: z.length > 0,
       className: f(
         f.BE("list", "item"),
-        Ae,
+        _e,
         oe && f.M("dragging-over"),
         t && Oe,
         f.selected(t),
         O && f.M("has-children"),
         f.BM("depth", y.toString()),
-        L
+        w
       ),
       onDragLeave: () => M(!1),
       onDragStart: de,
@@ -310,32 +310,31 @@ const Z = ({
         position: u != null ? "absolute" : "relative",
         transform: `translateY(${u}px)`,
         [fe]: `${B}rem`,
-        // @ts-expect-error - CSS variable
-        "--pluto-tree-indicator-offset": `${B - 1.5}rem`
+        [f.var("tree-indicator-offset")]: `${B - 1.5}rem`
       },
       startIcon: P,
       iconSpacing: "small",
       noWrap: !0,
-      endIcon: F,
-      onDoubleClick: (p) => a == null ? void 0 : a(o, p),
+      endIcon: W,
+      onDoubleClick: (p) => l == null ? void 0 : l(o, p),
       href: C,
       ...ce
     }, he = C != null ? je : Te;
-    return /* @__PURE__ */ b.jsx(he, { ...ue, align: "center", ..._, children: v != null ? v({
+    return /* @__PURE__ */ N.jsx(he, { ...ue, align: "center", ...S, children: v != null ? v({
       key: o,
       loading: i,
       useMargin: d,
       onDrop: r,
       onRename: s,
-      onSuccessfulDrop: l,
-      onDoubleClick: a,
+      onSuccessfulDrop: a,
+      onDoubleClick: l,
       entry: e,
       selected: t,
       onSelect: n,
       index: I,
       sourceIndex: j,
-      hovered: S
-    }) : /* @__PURE__ */ b.jsx(
+      hovered: E
+    }) : /* @__PURE__ */ N.jsx(
       pe,
       {
         id: `text-${o}`,
@@ -355,42 +354,42 @@ const Ge = Ie(q), Ke = ({
   onSelect: n,
   onDrop: r,
   onRename: s,
-  onSuccessfulDrop: l,
-  onDoubleClick: a,
+  onSuccessfulDrop: a,
+  onDoubleClick: l,
   className: i,
   children: d = Ge,
   itemHeight: u = 27,
   useMargin: v = !1,
   showRules: I = !1,
   virtual: j = !0,
-  clearExpanded: L,
-  expand: S,
-  contract: _,
+  clearExpanded: w,
+  expand: E,
+  contract: S,
   emptyContent: o,
-  loading: $,
+  loading: A,
   ...h
 }) => {
-  const c = j ? V.Virtual : V, m = N(
+  const c = j ? V.Virtual : V, m = b(
     ({ key: x, ...y }) => d({
       ...y,
       key: x,
-      loading: $ === x,
+      loading: A === x,
       useMargin: v,
       onDrop: r,
       onRename: s,
-      onSuccessfulDrop: l,
-      onDoubleClick: a
+      onSuccessfulDrop: a,
+      onDoubleClick: l
     }),
-    [d, $, r, a, s, l]
+    [d, A, r, l, s, a]
   );
-  return /* @__PURE__ */ b.jsx(Le, { data: e, emptyContent: o, children: /* @__PURE__ */ b.jsx(
-    Se,
+  return /* @__PURE__ */ N.jsx(we, { data: e, emptyContent: o, children: /* @__PURE__ */ N.jsx(
+    Ee,
     {
       value: t,
       onChange: n,
       allowMultiple: !0,
       replaceOnSingle: !0,
-      children: /* @__PURE__ */ b.jsx(
+      children: /* @__PURE__ */ N.jsx(
         c,
         {
           itemHeight: u,
@@ -401,7 +400,7 @@ const Ge = Ie(q), Ke = ({
       )
     }
   ) });
-}, qe = (e, t) => ge(`text-${e}`, t), ze = (e) => ye(`text-${e}`), at = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, qe = (e, t) => ge(`text-${e}`, t), ze = (e) => ye(`text-${e}`), lt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   DefaultItem: q,
   HAUL_TYPE: H,
@@ -410,11 +409,11 @@ const Ge = Ie(q), Ke = ({
   deepCopy: se,
   defaultSort: ee,
   findNode: T,
-  findNodeParent: A,
+  findNodeParent: _,
   findNodes: re,
   flatten: K,
   getAllNodesOfMinDepth: ke,
-  getDescendants: le,
+  getDescendants: ae,
   moveNode: Me,
   removeNode: te,
   setNode: ne,
@@ -427,6 +426,6 @@ const Ge = Ie(q), Ke = ({
 }, Symbol.toStringTag, { value: "Module" }));
 export {
   Z as A,
-  lt as a,
-  at as e
+  at as a,
+  lt as e
 };