@floegence/floe-webapp-core 0.48.2 → 0.48.4

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

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