@floegence/floe-webapp-core 0.35.34 → 0.35.36

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

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