@floegence/floe-webapp-core 0.35.8 → 0.35.10

package/dist/components/file-browser/FileBrowserContext.js

@@ -1,379 +1,411 @@
-import { createComponent as ot } from "solid-js/web";
-import { createSignal as p, createEffect as I, createMemo as z, useContext as it, createContext as st, untrack as rt } from "solid-js";
-import { useResolvedFloeConfig as ct } from "../../context/FloeConfigContext.js";
-import { deferAfterPaint as at, deferNonBlocking as y } from "../../utils/defer.js";
-const ue = st(), b = {
+import { createComponent as pt } from "solid-js/web";
+import { createSignal as p, createEffect as I, createMemo as z, useContext as St, createContext as gt, untrack as It } from "solid-js";
+import { createStore as ae, produce as le } from "solid-js/store";
+import { useResolvedFloeConfig as wt } from "../../context/FloeConfigContext.js";
+import { deferAfterPaint as yt, deferNonBlocking as y } from "../../utils/defer.js";
+const ye = gt(), E = {
   name: 0.65,
   modifiedAt: 0.2,
   size: 0.15
-}, oe = "fileBrowser:listColumnRatios", ie = 220, lt = "fileBrowser:sidebarWidth", dt = 160, ft = 520, se = "fileBrowser:viewMode", re = "fileBrowser:sortConfig", ce = "fileBrowser:expandedFolders", ae = "fileBrowser:sidebarCollapsed";
-function le(n, r) {
-  const s = typeof n == "number" && Number.isFinite(n) ? n : r;
-  return Math.max(dt, Math.min(ft, Math.round(s)));
+}, de = "fileBrowser:listColumnRatios", fe = 220, xt = "fileBrowser:sidebarWidth", Ct = 160, Pt = 520, ue = "fileBrowser:viewMode", me = "fileBrowser:sortConfig", he = "fileBrowser:expandedFolders", pe = "fileBrowser:sidebarCollapsed";
+function Se(n, i) {
+  const o = typeof n == "number" && Number.isFinite(n) ? n : i;
+  return Math.max(Ct, Math.min(Pt, Math.round(o)));
 }
-function ut(n, r) {
-  return n === "list" || n === "grid" ? n : r;
+function At(n, i) {
+  return n === "list" || n === "grid" ? n : i;
 }
-function mt(n, r) {
-  if (!n || typeof n != "object") return r;
-  const s = n, f = s.field, l = s.direction;
-  return !(f === "name" || f === "size" || f === "modifiedAt" || f === "type") || !(l === "asc" || l === "desc") ? r : {
-    field: f,
+function Et(n, i) {
+  if (!n || typeof n != "object") return i;
+  const o = n, d = o.field, l = o.direction;
+  return !(d === "name" || d === "size" || d === "modifiedAt" || d === "type") || !(l === "asc" || l === "desc") ? i : {
+    field: d,
     direction: l
   };
 }
-function ht(n) {
+function bt(n) {
   if (!Array.isArray(n)) return ["/"];
-  const r = [], s = /* @__PURE__ */ new Set();
-  for (const f of n) {
-    if (typeof f != "string") continue;
-    const l = f.trim();
-    !l || s.has(l) || (s.add(l), r.push(l));
+  const i = [], o = /* @__PURE__ */ new Set();
+  for (const d of n) {
+    if (typeof d != "string") continue;
+    const l = d.trim();
+    !l || o.has(l) || (o.add(l), i.push(l));
   }
-  return s.has("/") || r.unshift("/"), r;
+  return o.has("/") || i.unshift("/"), i;
 }
-function de(n) {
-  const r = Number.isFinite(n.name) ? n.name : b.name, s = Number.isFinite(n.modifiedAt) ? n.modifiedAt : b.modifiedAt, f = Number.isFinite(n.size) ? n.size : b.size, l = Math.max(0, r), m = Math.max(0, s), C = Math.max(0, f), w = l + m + C;
-  return w <= 0 ? b : {
-    name: l / w,
-    modifiedAt: m / w,
-    size: C / w
+function Mt(n) {
+  const i = [], o = /* @__PURE__ */ new Set();
+  for (const d of n) {
+    if (typeof d != "string") continue;
+    const l = d.trim();
+    !l || o.has(l) || (o.add(l), i.push(l));
+  }
+  return i;
+}
+function ge(n) {
+  const i = {};
+  for (const o of n)
+    i[o] = !0;
+  return i;
+}
+function Ft(n, i) {
+  if (n.length !== i.length) return !1;
+  for (let o = 0; o < n.length; o += 1)
+    if (n[o] !== i[o]) return !1;
+  return !0;
+}
+function Ie(n) {
+  const i = Number.isFinite(n.name) ? n.name : E.name, o = Number.isFinite(n.modifiedAt) ? n.modifiedAt : E.modifiedAt, d = Number.isFinite(n.size) ? n.size : E.size, l = Math.max(0, i), u = Math.max(0, o), x = Math.max(0, d), g = l + u + x;
+  return g <= 0 ? E : {
+    name: l / g,
+    modifiedAt: u / g,
+    size: x / g
   };
 }
-function fe(n, r) {
-  if (!r) return [];
-  const s = [];
-  let f = 0;
-  for (const l of r) {
-    const m = n.indexOf(l, f);
-    if (m === -1) return null;
-    s.push(m), f = m + 1;
+function we(n, i) {
+  if (!i) return [];
+  const o = [];
+  let d = 0;
+  for (const l of i) {
+    const u = n.indexOf(l, d);
+    if (u === -1) return null;
+    o.push(u), d = u + 1;
   }
-  return s;
+  return o;
 }
-function Ct(n) {
-  const r = ct(), s = (e) => {
+function zt(n) {
+  const i = wt(), o = (e) => {
     const t = (e ?? "").trim();
     return t === "" ? "/" : t;
-  }, f = (n.persistenceKey ?? "").trim(), l = !!f, m = (e) => f ? `${f}:${e}` : e, C = l ? ut(r.persist.load(m(se), n.initialViewMode ?? "list"), n.initialViewMode ?? "list") : n.initialViewMode ?? "list", w = {
+  }, d = (n.persistenceKey ?? "").trim(), l = !!d, u = (e) => d ? `${d}:${e}` : e, x = l ? At(i.persist.load(u(ue), n.initialViewMode ?? "list"), n.initialViewMode ?? "list") : n.initialViewMode ?? "list", g = {
     field: "name",
     direction: "asc"
-  }, me = l ? mt(r.persist.load(m(re), w), w) : w, he = l ? ht(r.persist.load(m(ce), ["/"])) : ["/"], pe = l ? r.persist.load(m(ae), !1) === !0 : !1, Se = () => typeof n.path == "string" ? s(n.path) : s(n.initialPath ?? "/"), [x, D] = p(Se()), [E, M] = p(/* @__PURE__ */ new Set()), [N, we] = p(C), [F, Ie] = p(me), ge = de(r.persist.load(oe, n.initialListColumnRatios ?? b)), [W, ye] = p(ge), K = (n.sidebarWidthStorageKey ?? "").trim() || lt, Ce = le(r.persist.load(K, n.initialSidebarWidth ?? ie), n.initialSidebarWidth ?? ie), [U, xe] = p(Ce), [v, k] = p(new Set(he)), [V, Ae] = p(pe), [Pe, G] = p(null), [X, Y] = p(""), [_, R] = p(""), [be, q] = p(!1);
-  let L = 0;
+  }, xe = l ? Et(i.persist.load(u(me), g), g) : g, D = l ? bt(i.persist.load(u(he), ["/"])) : ["/"], Ce = l ? i.persist.load(u(pe), !1) === !0 : !1, Pe = () => typeof n.path == "string" ? o(n.path) : o(n.initialPath ?? "/"), [C, N] = p(Pe()), [W, Ae] = ae({}), [b, Ee] = p([]), [k, be] = p(x), [F, Me] = p(xe), Fe = Ie(i.persist.load(de, n.initialListColumnRatios ?? E)), [K, Le] = p(Fe), U = (n.sidebarWidthStorageKey ?? "").trim() || xt, _e = Se(i.persist.load(U, n.initialSidebarWidth ?? fe), n.initialSidebarWidth ?? fe), [V, ve] = p(_e), [L, G] = ae(ge(D)), [q, X] = p(D), [Y, Be] = p(Ce), [Re, j] = p(null), [Q, H] = p(""), [_, v] = p(""), [Oe, $] = p(!1);
+  let B = 0;
   I(() => {
-    const e = X().trim();
-    L += 1;
-    const t = L;
+    const e = Q().trim();
+    B += 1;
+    const t = B;
     if (!e) {
-      R("");
+      v("");
       return;
     }
-    at(() => {
-      t === L && R(e);
+    yt(() => {
+      t === B && v(e);
     });
   }), I(() => {
-    r.persist.debouncedSave(oe, W());
+    i.persist.debouncedSave(de, K());
   }), I(() => {
-    r.persist.debouncedSave(K, U());
+    i.persist.debouncedSave(U, V());
   }), I(() => {
-    l && r.persist.debouncedSave(m(se), N());
+    l && i.persist.debouncedSave(u(ue), k());
   }), I(() => {
-    l && r.persist.debouncedSave(m(re), F());
+    l && i.persist.debouncedSave(u(me), F());
   }), I(() => {
     if (!l) return;
-    const e = [...v()].sort((t, o) => t.localeCompare(o));
-    r.persist.debouncedSave(m(ce), e);
+    const e = [...q()].sort((t, r) => t.localeCompare(r));
+    i.persist.debouncedSave(u(he), e);
   }), I(() => {
-    l && r.persist.debouncedSave(m(ae), V());
+    l && i.persist.debouncedSave(u(pe), Y());
   });
-  const Ee = (e) => we(e), Me = (e) => Ie(e), Fe = () => n.homeLabel ?? "Root", [Q, A] = p([]);
-  let g = null, B = {
+  const Te = (e) => be(e), ze = (e) => Me(e), De = () => n.homeLabel ?? "Root", Ne = () => new Set(b()), We = () => new Set(q()), M = (e) => {
+    const t = Mt(e), r = ge(t);
+    Ae(le((s) => {
+      for (const c of Object.keys(s))
+        c in r || delete s[c];
+      for (const c of t)
+        s[c] = !0;
+    })), Ee((s) => Ft(s, t) ? s : t);
+  }, J = (e) => {
+    L[e] !== !0 && (G(e, !0), X((t) => t.includes(e) ? t : [...t, e]));
+  }, ke = (e) => {
+    if (L[e] === !0) {
+      G(le((t) => {
+        delete t[e];
+      })), X((t) => t.filter((r) => r !== e));
+      return;
+    }
+    J(e);
+  }, [Z, P] = p([]);
+  let w = null, R = {
     top: 0,
     left: 0
   };
-  const j = () => n.files, H = (e) => {
-    const t = s(e);
+  const ee = () => n.files, te = (e) => {
+    const t = o(e);
     if (t === "/") return "/";
-    const o = t.split("/").filter(Boolean);
-    return o.pop(), o.length ? "/" + o.join("/") : "/";
-  }, ve = (e, t) => {
-    const o = Q();
-    if (o.length === 0) return e;
-    let i = [...e];
-    const a = s(t);
-    for (const c of o)
-      switch (c.type) {
+    const r = t.split("/").filter(Boolean);
+    return r.pop(), r.length ? "/" + r.join("/") : "/";
+  }, Ke = (e, t) => {
+    const r = Z();
+    if (r.length === 0) return e;
+    let s = [...e];
+    const c = o(t);
+    for (const a of r)
+      switch (a.type) {
         case "remove": {
-          const u = new Set(c.paths.map(s));
-          i = i.filter((d) => !u.has(s(d.path)));
+          const m = new Set(a.paths.map(o));
+          s = s.filter((f) => !m.has(o(f.path)));
           break;
         }
         case "update": {
-          const u = s(c.oldPath), d = i.findIndex((S) => s(S.path) === u);
-          if (d !== -1) {
-            const S = c.updates.path ?? i[d].path;
-            H(S) === a ? i[d] = {
-              ...i[d],
-              ...c.updates
-            } : i.splice(d, 1);
+          const m = o(a.oldPath), f = s.findIndex((S) => o(S.path) === m);
+          if (f !== -1) {
+            const S = a.updates.path ?? s[f].path;
+            te(S) === c ? s[f] = {
+              ...s[f],
+              ...a.updates
+            } : s.splice(f, 1);
           } else {
-            const S = c.updates.path;
-            S && H(S);
+            const S = a.updates.path;
+            S && te(S);
           }
           break;
         }
         case "insert": {
-          s(c.parentPath) === a && (i.some((d) => s(d.path) === s(c.item.path)) || i.push(c.item));
+          o(a.parentPath) === c && (s.some((f) => o(f.path) === o(a.item.path)) || s.push(a.item));
           break;
         }
       }
-    return i;
-  }, _e = z(() => {
-    const e = /* @__PURE__ */ new Map(), t = (i) => {
-      for (const a of i)
-        a.type === "folder" && (e.set(s(a.path), a.children ?? []), a.children?.length && t(a.children));
-    }, o = j();
-    return e.set("/", o), t(o), e;
-  }), Re = z(() => {
-    const e = s(x());
-    let t = _e().get(e) ?? [];
-    t = ve(t, e);
-    const o = F(), i = [...t].sort((c, u) => {
-      if (c.type !== u.type) return c.type === "folder" ? -1 : 1;
-      let d = 0;
-      switch (o.field) {
+    return s;
+  }, Ue = z(() => {
+    const e = /* @__PURE__ */ new Map(), t = (s) => {
+      for (const c of s)
+        c.type === "folder" && (e.set(o(c.path), c.children ?? []), c.children?.length && t(c.children));
+    }, r = ee();
+    return e.set("/", r), t(r), e;
+  }), Ve = z(() => {
+    const e = o(C());
+    let t = Ue().get(e) ?? [];
+    t = Ke(t, e);
+    const r = F(), s = [...t].sort((a, m) => {
+      if (a.type !== m.type) return a.type === "folder" ? -1 : 1;
+      let f = 0;
+      switch (r.field) {
         case "name":
-          d = c.name.localeCompare(u.name);
+          f = a.name.localeCompare(m.name);
           break;
         case "size":
-          d = (c.size ?? 0) - (u.size ?? 0);
+          f = (a.size ?? 0) - (m.size ?? 0);
           break;
         case "modifiedAt":
-          d = (c.modifiedAt?.getTime() ?? 0) - (u.modifiedAt?.getTime() ?? 0);
+          f = (a.modifiedAt?.getTime() ?? 0) - (m.modifiedAt?.getTime() ?? 0);
           break;
         case "type":
-          d = (c.extension ?? "").localeCompare(u.extension ?? "");
+          f = (a.extension ?? "").localeCompare(m.extension ?? "");
           break;
       }
-      return o.direction === "asc" ? d : -d;
-    }), a = /* @__PURE__ */ new Map();
-    for (const c of i)
-      a.set(c.id, c.name.toLowerCase());
+      return r.direction === "asc" ? f : -f;
+    }), c = /* @__PURE__ */ new Map();
+    for (const a of s)
+      c.set(a.id, a.name.toLowerCase());
     return {
-      items: i,
-      nameLowerById: a
+      items: s,
+      nameLowerById: c
     };
   }), O = z(() => {
     const {
       items: e,
       nameLowerById: t
-    } = Re(), i = _().trim().toLowerCase(), a = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Map(), u = /* @__PURE__ */ new Map();
-    if (!i) {
+    } = Ve(), s = _().trim().toLowerCase(), c = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map(), m = /* @__PURE__ */ new Map();
+    if (!s) {
       for (let h = 0; h < e.length; h++) {
-        const P = e[h];
-        c.set(P.id, P), u.set(P.id, h);
+        const A = e[h];
+        a.set(A.id, A), m.set(A.id, h);
       }
       return {
         items: e,
-        matchById: a,
-        fileById: c,
-        indexById: u
+        matchById: c,
+        fileById: a,
+        indexById: m
       };
     }
-    const d = [];
+    const f = [];
     let S = 0;
     for (const h of e) {
-      const P = t.get(h.id) ?? h.name.toLowerCase(), ne = fe(P, i);
-      ne && (d.push(h), a.set(h.id, {
-        matchedIndices: ne
-      }), c.set(h.id, h), u.set(h.id, S), S += 1);
+      const A = t.get(h.id) ?? h.name.toLowerCase(), ce = we(A, s);
+      ce && (f.push(h), c.set(h.id, {
+        matchedIndices: ce
+      }), a.set(h.id, h), m.set(h.id, S), S += 1);
     }
     return {
-      items: d,
-      matchById: a,
-      fileById: c,
-      indexById: u
+      items: f,
+      matchById: c,
+      fileById: a,
+      indexById: m
     };
-  }), Le = () => O().items, $ = (e) => {
-    const t = O(), o = [];
-    for (const i of e) {
-      const a = t.fileById.get(i);
-      if (!a) continue;
-      const c = t.indexById.get(i);
-      o.push({
-        index: c ?? Number.MAX_SAFE_INTEGER,
-        item: a
+  }), Ge = () => O().items, ne = (e) => {
+    const t = O(), r = [];
+    for (const s of e) {
+      const c = t.fileById.get(s);
+      if (!c) continue;
+      const a = t.indexById.get(s);
+      r.push({
+        index: a ?? Number.MAX_SAFE_INTEGER,
+        item: c
       });
     }
-    return o.sort((i, a) => i.index - a.index), o.map((i) => i.item);
-  }, J = () => {
-    M(/* @__PURE__ */ new Set()), Y(""), R(""), q(!1);
+    return r.sort((s, c) => s.index - c.index), r.map((s) => s.item);
+  }, oe = () => {
+    M([]), H(""), v(""), $(!1);
     const e = n.onSelect;
     y(() => e?.([]));
   };
   I(() => {
     if (typeof n.path != "string") return;
-    const e = s(n.path);
-    e !== x() && (D(e), J());
+    const e = o(n.path);
+    e !== C() && (N(e), oe());
   });
   const T = (e) => {
-    const t = s(e);
-    if (t === x()) return;
-    D(t), J();
-    const o = n.onNavigate;
-    y(() => o?.(t));
-    const i = n.onPathChange;
-    y(() => i?.(t, "user"));
-  }, Be = (e) => {
-    ye(de(e));
-  }, Oe = () => {
-    const e = x();
+    const t = o(e);
+    if (t === C()) return;
+    N(t), oe();
+    const r = n.onNavigate;
+    y(() => r?.(t));
+    const s = n.onPathChange;
+    y(() => s?.(t, "user"));
+  }, qe = (e) => {
+    Le(Ie(e));
+  }, Xe = () => {
+    const e = C();
     if (e === "/" || e === "") return;
     const t = e.split("/").filter(Boolean);
     t.pop(), T(t.length ? "/" + t.join("/") : "/");
-  }, Z = (e) => {
-    e.type === "folder" && (T(e.path), k((t) => {
-      const o = new Set(t);
-      return o.add(e.path), o;
-    }));
-  }, Te = (e, t = !1) => {
-    const o = E(), i = t ? new Set(o) : /* @__PURE__ */ new Set();
-    t ? i.has(e) ? i.delete(e) : i.add(e) : (i.clear(), i.add(e)), M(i);
-    const a = n.onSelect;
-    if (a) {
-      const c = new Set(i);
+  }, ie = (e) => {
+    e.type === "folder" && (T(e.path), J(e.path));
+  }, Ye = (e, t = !1) => {
+    const r = t ? W[e] === !0 ? b().filter((c) => c !== e) : [...b(), e] : [e];
+    M(r);
+    const s = n.onSelect;
+    if (s) {
+      const c = [...r];
       y(() => {
-        const u = rt(() => $(c));
-        a(u);
+        const a = It(() => ne(c));
+        s(a);
       });
     }
-  }, ze = () => {
-    M(/* @__PURE__ */ new Set());
+  }, je = () => {
+    M([]);
     const e = n.onSelect;
     y(() => e?.([]));
-  }, De = (e) => E().has(e), Ne = (e) => {
-    k((t) => {
-      const o = new Set(t);
-      return o.has(e) ? o.delete(e) : o.add(e), o;
-    });
-  }, We = (e) => v().has(e), Ke = () => Ae((e) => !e), Ue = (e) => {
-    xe((t) => le(e, t));
-  }, ke = (e) => G(e), Ve = () => G(null), Ge = (e) => {
-    Y(e);
-  }, Xe = (e) => {
+  }, Qe = (e) => W[e] === !0, He = (e) => ke(e), $e = (e) => L[e] === !0, Je = () => Be((e) => !e), Ze = (e) => {
+    ve((t) => Se(e, t));
+  }, et = (e) => j(e), tt = () => j(null), nt = (e) => {
+    H(e);
+  }, ot = (e) => {
     const t = _().trim();
     if (!t) return null;
-    const o = fe(e.toLowerCase(), t.toLowerCase());
-    return o ? {
-      matchedIndices: o
+    const r = we(e.toLowerCase(), t.toLowerCase());
+    return r ? {
+      matchedIndices: r
     } : null;
-  }, Ye = (e) => O().matchById.get(e) ?? null, qe = () => $(E()), Qe = (e) => {
+  }, it = (e) => O().matchById.get(e) ?? null, st = () => ne(b()), rt = (e) => {
     if (e.type === "folder")
-      Z(e);
+      ie(e);
     else {
       const t = n.onOpen;
       y(() => t?.(e));
     }
-  }, je = (e) => {
-    e.length !== 0 && A((t) => [...t, {
+  }, ct = (e) => {
+    e.length !== 0 && P((t) => [...t, {
       type: "remove",
       paths: e
     }]);
-  }, He = (e, t) => {
-    A((o) => [...o, {
+  }, at = (e, t) => {
+    P((r) => [...r, {
       type: "update",
       oldPath: e,
       updates: t
     }]);
-  }, $e = (e, t) => {
-    A((o) => [...o, {
+  }, lt = (e, t) => {
+    P((r) => [...r, {
       type: "insert",
       parentPath: e,
       item: t
     }]);
-  }, Je = () => {
-    A([]);
-  }, Ze = () => {
-    A([]);
-  }, et = () => Q().length > 0, tt = (e) => {
-    g = e;
-  }, ee = () => g ? {
-    top: g.scrollTop,
-    left: g.scrollLeft
+  }, dt = () => {
+    P([]);
+  }, ft = () => {
+    P([]);
+  }, ut = () => Z().length > 0, mt = (e) => {
+    w = e;
+  }, se = () => w ? {
+    top: w.scrollTop,
+    left: w.scrollLeft
   } : {
     top: 0,
     left: 0
-  }, te = (e) => {
-    g && (g.scrollTop = e.top, g.scrollLeft = e.left);
-  }, nt = {
-    currentPath: x,
+  }, re = (e) => {
+    w && (w.scrollTop = e.top, w.scrollLeft = e.left);
+  }, ht = {
+    currentPath: C,
     setCurrentPath: T,
-    navigateUp: Oe,
-    navigateTo: Z,
-    homeLabel: Fe,
-    selectedItems: () => E(),
-    selectItem: Te,
-    clearSelection: ze,
-    isSelected: De,
-    getSelectedItemsList: qe,
-    viewMode: N,
-    setViewMode: Ee,
+    navigateUp: Xe,
+    navigateTo: ie,
+    homeLabel: De,
+    selectedItems: Ne,
+    selectItem: Ye,
+    clearSelection: je,
+    isSelected: Qe,
+    getSelectedItemsList: st,
+    viewMode: k,
+    setViewMode: Te,
     sortConfig: F,
-    setSortConfig: Me,
-    listColumnRatios: W,
-    setListColumnRatios: Be,
-    expandedFolders: v,
-    toggleFolder: Ne,
-    isExpanded: We,
-    files: j,
-    currentFiles: Le,
-    filterQuery: X,
-    setFilterQuery: Ge,
+    setSortConfig: ze,
+    listColumnRatios: K,
+    setListColumnRatios: qe,
+    expandedFolders: We,
+    toggleFolder: He,
+    isExpanded: $e,
+    files: ee,
+    currentFiles: Ge,
+    filterQuery: Q,
+    setFilterQuery: nt,
     filterQueryApplied: _,
-    isFilterActive: be,
-    setFilterActive: q,
-    getFilterMatch: Xe,
-    getFilterMatchForId: Ye,
-    sidebarCollapsed: V,
-    toggleSidebar: Ke,
-    sidebarWidth: U,
-    setSidebarWidth: Ue,
-    contextMenu: Pe,
-    showContextMenu: ke,
-    hideContextMenu: Ve,
-    openItem: Qe,
+    isFilterActive: Oe,
+    setFilterActive: $,
+    getFilterMatch: ot,
+    getFilterMatchForId: it,
+    sidebarCollapsed: Y,
+    toggleSidebar: Je,
+    sidebarWidth: V,
+    setSidebarWidth: Ze,
+    contextMenu: Re,
+    showContextMenu: et,
+    hideContextMenu: tt,
+    openItem: rt,
     // Optimistic updates
-    optimisticRemove: je,
-    optimisticUpdate: He,
-    optimisticInsert: $e,
-    clearOptimisticUpdates: Je,
-    rollbackOptimisticUpdates: Ze,
-    hasOptimisticUpdates: et,
+    optimisticRemove: ct,
+    optimisticUpdate: at,
+    optimisticInsert: lt,
+    clearOptimisticUpdates: dt,
+    rollbackOptimisticUpdates: ft,
+    hasOptimisticUpdates: ut,
     // Scroll position management
-    setScrollContainer: tt,
-    getScrollPosition: ee,
-    setScrollPosition: te,
-    saveScrollPosition: () => (B = ee(), B),
+    setScrollContainer: mt,
+    getScrollPosition: se,
+    setScrollPosition: re,
+    saveScrollPosition: () => (R = se(), R),
     restoreScrollPosition: () => {
       requestAnimationFrame(() => {
-        te(B);
+        re(R);
       });
     }
   };
-  return ot(ue.Provider, {
-    value: nt,
+  return pt(ye.Provider, {
+    value: ht,
     get children() {
       return n.children;
     }
   });
 }
-function xt() {
-  const n = it(ue);
+function Dt() {
+  const n = St(ye);
   if (!n)
     throw new Error("useFileBrowser must be used within a FileBrowserProvider");
   return n;
 }
 export {
-  Ct as FileBrowserProvider,
-  xt as useFileBrowser
+  zt as FileBrowserProvider,
+  Dt as useFileBrowser
 };