@floegence/floe-webapp-core 0.35.47 → 0.35.49

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

@@ -1,428 +1,490 @@
-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 = {
+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 { 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 = {
   name: 0.65,
   modifiedAt: 0.2,
   size: 0.15
-}, 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)));
+}, 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)));
 }
-function Et(n, r) {
-  return n === "list" || n === "grid" ? n : r;
+function Vt(o, c) {
+  return o === "list" || o === "grid" ? o : c;
 }
-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: a
+function kt(o, c) {
+  if (!o || typeof o != "object") return c;
+  const i = o, f = i.field, l = i.direction;
+  return !(f === "name" || f === "size" || f === "modifiedAt" || f === "type") || !(l === "asc" || l === "desc") ? c : {
+    field: f,
+    direction: l
   };
 }
-function Mt(n) {
-  if (!Array.isArray(n)) return ["/"];
-  const r = [], o = /* @__PURE__ */ new Set();
-  for (const d of n) {
-    if (typeof d != "string") continue;
-    const a = d.trim();
-    !a || o.has(a) || (o.add(a), r.push(a));
+function Kt(o) {
+  if (!Array.isArray(o)) return ["/"];
+  const c = [], i = /* @__PURE__ */ new Set();
+  for (const f of o) {
+    if (typeof f != "string") continue;
+    const l = f.trim();
+    !l || i.has(l) || (i.add(l), c.push(l));
   }
-  return o.has("/") || r.unshift("/"), r;
+  return i.has("/") || c.unshift("/"), c;
 }
-function Bt(n) {
-  const r = [], o = /* @__PURE__ */ new Set();
-  for (const d of n) {
-    if (typeof d != "string") continue;
-    const a = d.trim();
-    !a || o.has(a) || (o.add(a), r.push(a));
+function Ae(o) {
+  const c = [], i = /* @__PURE__ */ new Set();
+  for (const f of o) {
+    if (typeof f != "string") continue;
+    const l = f.trim();
+    !l || i.has(l) || (i.add(l), c.push(l));
   }
-  return r;
+  return c;
 }
-function we(n) {
-  const r = {};
-  for (const o of n)
-    r[o] = !0;
-  return r;
+function Re(o) {
+  const c = {};
+  for (const i of o)
+    c[i] = !0;
+  return c;
 }
-function Lt(n, r) {
-  if (n.length !== r.length) return !1;
-  for (let o = 0; o < n.length; o += 1)
-    if (n[o] !== r[o]) return !1;
+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;
   return !0;
 }
-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 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 Ce(n, r) {
-  if (!r) return [];
-  const o = [];
-  let d = 0;
-  for (const a of r) {
-    const f = n.indexOf(a, d);
-    if (f === -1) return null;
-    o.push(f), d = f + 1;
+function be(o, c) {
+  if (!c) return [];
+  const i = [];
+  let f = 0;
+  for (const l of c) {
+    const m = o.indexOf(l, f);
+    if (m === -1) return null;
+    i.push(m), f = m + 1;
   }
-  return o;
+  return i;
 }
-function qt(n) {
-  const r = Pt(), o = (e) => {
+function $t(o) {
+  const c = zt(), i = (e) => {
     const t = (e ?? "").trim();
     return t === "" ? "/" : t;
-  }, 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 = {
+  }, 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 = {
     field: "name",
     direction: "asc"
-  }, 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;
+  }, 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;
   S(() => {
-    const e = Z().trim();
-    D += 1;
-    const t = D;
+    const e = se().trim();
+    q += 1;
+    const t = q;
     if (!e) {
-      b("");
+      B("");
       return;
     }
-    Rt(() => {
-      t === D && b(e);
+    Dt(() => {
+      t === q && B(e);
     });
   }), S(() => {
-    r.persist.debouncedSave(he, X());
+    c.persist.debouncedSave(ge, $());
   }), S(() => {
-    r.persist.debouncedSave(Y, B());
+    c.persist.debouncedSave(J, O());
   }), S(() => {
-    a && r.persist.debouncedSave(f(Se), G());
+    l && c.persist.debouncedSave(m(ye), H());
   }), S(() => {
-    a && r.persist.debouncedSave(f(ge), M());
+    l && c.persist.debouncedSave(m(we), _());
   }), S(() => {
-    if (!a) return;
-    const e = [...Q()].sort((t, i) => t.localeCompare(i));
-    r.persist.debouncedSave(f(Ie), e);
+    if (!l) return;
+    const e = [...ee()].sort((t, n) => t.localeCompare(n));
+    c.persist.debouncedSave(m(Ce), e);
   }), S(() => {
-    a && r.persist.debouncedSave(f(ye), $());
+    l && c.persist.debouncedSave(m(ve), ne());
   }), S(() => {
-    const e = n.revealRequest ?? null;
-    ee(e);
+    const e = o.revealRequest ?? null;
+    re(e);
   });
-  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 i || delete s[c];
-      for (const c of t)
-        s[c] = !0;
-    })), Ee((s) => Lt(s, t) ? s : 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) => {
+  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) {
+      Z(Se((t) => {
         delete t[e];
-      })), H((t) => t.filter((i) => i !== e));
+      })), te((t) => t.filter((n) => n !== e));
       return;
     }
-    te(e);
-  }, [ne, P] = h([]);
-  let y = null, N = {
+    ie(e);
+  }, [ce, P] = h([]);
+  let w = null, V = {
     top: 0,
     left: 0
   };
-  const oe = () => n.files, ie = (e) => {
-    const t = o(e);
+  const ae = () => o.files, le = (e) => {
+    const t = i(e);
     if (t === "/") return "/";
-    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;
+    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;
     let s = [...e];
-    const c = o(t);
-    for (const l of i)
-      switch (l.type) {
+    const r = i(t);
+    for (const a of n)
+      switch (a.type) {
         case "remove": {
-          const m = new Set(l.paths.map(o));
-          s = s.filter((u) => !m.has(o(u.path)));
+          const u = new Set(a.paths.map(i));
+          s = s.filter((d) => !u.has(i(d.path)));
           break;
         }
         case "update": {
-          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);
+          const u = i(a.oldPath), d = s.findIndex((p) => i(p.path) === u);
+          if (d !== -1) {
+            const p = a.updates.path ?? s[d].path;
+            le(p) === r ? s[d] = {
+              ...s[d],
+              ...a.updates
+            } : s.splice(d, 1);
           } else {
-            const g = l.updates.path;
-            g && ie(g);
+            const p = a.updates.path;
+            p && le(p);
           }
           break;
         }
         case "insert": {
-          o(l.parentPath) === c && (s.some((u) => o(u.path) === o(l.item.path)) || s.push(l.item));
+          i(a.parentPath) === r && (s.some((d) => i(d.path) === i(a.item.path)) || s.push(a.item));
           break;
         }
       }
     return s;
-  }, Xe = q(() => {
+  }, Ze = U(() => {
     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));
-    }, i = oe();
-    return e.set("/", i), t(i), e;
-  }), se = q(() => {
-    const e = o(C());
-    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) {
+      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) => {
+      if (a.type !== u.type) return a.type === "folder" ? -1 : 1;
+      let d = 0;
+      switch (n.field) {
         case "name":
-          u = l.name.localeCompare(m.name);
+          d = a.name.localeCompare(u.name);
           break;
         case "size":
-          u = (l.size ?? 0) - (m.size ?? 0);
+          d = (a.size ?? 0) - (u.size ?? 0);
           break;
         case "modifiedAt":
-          u = (l.modifiedAt?.getTime() ?? 0) - (m.modifiedAt?.getTime() ?? 0);
+          d = (a.modifiedAt?.getTime() ?? 0) - (u.modifiedAt?.getTime() ?? 0);
           break;
         case "type":
-          u = (l.extension ?? "").localeCompare(m.extension ?? "");
+          d = (a.extension ?? "").localeCompare(u.extension ?? "");
           break;
       }
-      return i.direction === "asc" ? u : -u;
-    }), c = /* @__PURE__ */ new Map();
-    for (const l of s)
-      c.set(l.id, l.name.toLowerCase());
+      return n.direction === "asc" ? d : -d;
+    }), r = /* @__PURE__ */ new Map();
+    for (const a of s)
+      r.set(a.id, a.name.toLowerCase());
     return {
       items: s,
-      nameLowerById: c
+      nameLowerById: r
     };
-  }), F = q(() => {
+  }), C = U(() => {
     const {
       items: e,
       nameLowerById: t
-    } = se(), s = O().trim().toLowerCase(), c = /* @__PURE__ */ new Map(), l = /* @__PURE__ */ new Map(), m = /* @__PURE__ */ new Map();
+    } = k(), s = D().trim().toLowerCase(), r = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map(), u = /* @__PURE__ */ new Map();
     if (!s) {
-      for (let p = 0; p < e.length; p++) {
-        const R = e[p];
-        l.set(R.id, R), m.set(R.id, p);
+      for (let I = 0; I < e.length; I++) {
+        const b = e[I];
+        a.set(b.id, b), u.set(b.id, I);
       }
       return {
         items: e,
-        matchById: c,
-        fileById: l,
-        indexById: m
+        matchById: r,
+        fileById: a,
+        indexById: u
       };
     }
-    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);
+    const d = [];
+    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, {
+        matchedIndices: Ie
+      }), a.set(I.id, I), u.set(I.id, p), p += 1);
     }
     return {
-      items: u,
-      matchById: c,
-      fileById: l,
-      indexById: m
+      items: d,
+      matchById: r,
+      fileById: a,
+      indexById: u
     };
-  }), Ye = () => F().items;
+  }), et = () => C().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 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 re = (e) => {
-    const t = F(), i = [];
+  const de = (e) => {
+    const t = C(), n = [];
     for (const s of e) {
-      const c = t.fileById.get(s);
-      if (!c) continue;
-      const l = t.indexById.get(s);
-      i.push({
-        index: l ?? Number.MAX_SAFE_INTEGER,
-        item: c
+      const r = t.fileById.get(s);
+      if (!r) continue;
+      const a = t.indexById.get(s);
+      n.push({
+        index: a ?? Number.MAX_SAFE_INTEGER,
+        item: r
       });
     }
-    return i.sort((s, c) => s.index - c.index), i.map((s) => s.item);
-  }, ce = () => {
-    E([]), _(""), b(""), T(!1);
-    const e = n.onSelect;
-    w(() => e?.([]));
+    return n.sort((s, r) => s.index - r.index), n.map((s) => s.item);
+  }, tt = (e) => {
+    const t = o.onSelect;
+    if (!t) return;
+    const n = [...e];
+    E(() => {
+      const s = Tt(() => de(n));
+      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;
+  }, ue = () => {
+    g([], {
+      anchorId: null,
+      lastInteractedId: null
+    }), z(""), B(""), N(!1);
   };
   S(() => {
-    if (typeof n.path != "string") return;
-    const e = o(n.path);
-    e !== C() && (U(e), ce());
+    if (typeof o.path != "string") return;
+    const e = i(o.path);
+    e !== A() && (j(e), ue());
   });
-  const W = (e) => {
-    const t = o(e);
-    if (t === C()) return;
-    U(t), ce();
-    const i = n.onNavigate;
-    w(() => i?.(t));
-    const s = n.onPathChange;
-    w(() => s?.(t, "user"));
-  }, je = (e) => {
-    Le(xe(e));
-  }, Qe = () => {
-    const e = C();
+  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();
     if (e === "/" || e === "") return;
     const t = e.split("/").filter(Boolean);
-    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 = [...i];
-      w(() => {
-        const l = Ct(() => re(c));
-        s(l);
+    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, {
+      anchorId: e,
+      lastInteractedId: e
+    });
+  }, ct = (e, t = !1) => {
+    const n = ot();
+    if (!n) {
+      g([e], {
+        anchorId: e,
+        lastInteractedId: e
+      });
+      return;
+    }
+    const s = nt(n, e);
+    if (s.length === 0) {
+      g([e], {
+        anchorId: e,
+        lastInteractedId: e
       });
+      return;
+    }
+    const r = t ? [...y(), ...s] : s;
+    g(r, {
+      anchorId: n,
+      lastInteractedId: e
+    });
+  }, at = (e, t = {}) => {
+    g(e, t);
+  }, lt = (e) => {
+    if (F[e] === !0) {
+      Q(e);
+      return;
     }
-  }, $e = () => {
-    E([]);
-    const e = n.onSelect;
-    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();
+    g([e], {
+      anchorId: e,
+      lastInteractedId: e
+    });
+  }, dt = () => {
+    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();
     if (!t) return null;
-    const i = Ce(e.toLowerCase(), t.toLowerCase());
-    return i ? {
-      matchedIndices: i
+    const n = be(e.toLowerCase(), t.toLowerCase());
+    return n ? {
+      matchedIndices: n
     } : null;
-  }, ct = (e) => F().matchById.get(e) ?? null, lt = () => re(v()), at = (e) => {
-    const t = z();
+  }, yt = (e) => C().matchById.get(e) ?? null, wt = () => de(y());
+  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, {
+      anchorId: a,
+      lastInteractedId: u
+    });
+  });
+  const Ct = (e) => {
+    const t = W();
     if (!t || t.requestId !== e) return;
-    ee(null);
-    const i = n.onRevealRequestConsumed;
-    w(() => i?.(e));
-  }, dt = (e) => {
+    re(null);
+    const n = o.onRevealRequestConsumed;
+    E(() => n?.(e));
+  }, vt = (e) => {
     if (e.type === "folder")
-      le(e);
+      fe(e);
     else {
-      const t = n.onOpen;
-      w(() => t?.(e));
+      const t = o.onOpen;
+      E(() => t?.(e));
     }
-  }, ut = (e) => {
+  }, At = (e) => {
     e.length !== 0 && P((t) => [...t, {
       type: "remove",
       paths: e
     }]);
-  }, ft = (e, t) => {
-    P((i) => [...i, {
+  }, Rt = (e, t) => {
+    P((n) => [...n, {
       type: "update",
       oldPath: e,
       updates: t
     }]);
-  }, mt = (e, t) => {
-    P((i) => [...i, {
+  }, Pt = (e, t) => {
+    P((n) => [...n, {
       type: "insert",
       parentPath: e,
       item: t
     }]);
-  }, ht = () => {
+  }, bt = () => {
     P([]);
-  }, pt = () => {
+  }, Et = () => {
     P([]);
-  }, St = () => ne().length > 0, gt = (e) => {
-    y = e;
-  }, ae = () => y ? {
-    top: y.scrollTop,
-    left: y.scrollLeft
+  }, Mt = () => ce().length > 0, Bt = (e) => {
+    w = e;
+  }, me = () => w ? {
+    top: w.scrollTop,
+    left: w.scrollLeft
   } : {
     top: 0,
     left: 0
-  }, de = (e) => {
-    y && (y.scrollTop = e.top, y.scrollLeft = e.left);
-  }, It = {
-    currentPath: C,
-    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,
+  }, he = (e) => {
+    w && (w.scrollTop = e.top, w.scrollLeft = e.left);
+  }, Ft = {
+    currentPath: A,
+    setCurrentPath: K,
+    navigateUp: rt,
+    navigateTo: fe,
+    homeLabel: Ye,
+    selectedItems: je,
+    selectionAnchorId: R,
+    lastInteractedId: L,
+    selectItem: it,
+    selectRangeTo: ct,
+    replaceSelection: at,
+    ensureContextMenuSelection: lt,
+    clearSelection: dt,
+    isSelected: ut,
+    getSelectedItemsList: wt,
+    viewMode: H,
+    setViewMode: Ue,
+    sortConfig: _,
+    setSortConfig: Ge,
+    listColumnRatios: $,
+    setListColumnRatios: st,
+    expandedFolders: Qe,
+    toggleFolder: ft,
+    isExpanded: mt,
+    files: ae,
+    currentFiles: et,
+    filterQuery: se,
+    setFilterQuery: gt,
+    filterQueryApplied: D,
+    isFilterActive: Ke,
+    setFilterActive: N,
+    getFilterMatch: xt,
+    getFilterMatchForId: yt,
+    sidebarCollapsed: ne,
+    toggleSidebar: ht,
+    sidebarWidth: O,
+    clampSidebarWidth: Xe,
+    setSidebarWidth: It,
+    contextMenu: ke,
+    showContextMenu: pt,
+    hideContextMenu: St,
+    openItem: vt,
+    revealRequest: W,
+    consumeRevealRequest: Ct,
     // Optimistic updates
-    optimisticRemove: ut,
-    optimisticUpdate: ft,
-    optimisticInsert: mt,
-    clearOptimisticUpdates: ht,
-    rollbackOptimisticUpdates: pt,
-    hasOptimisticUpdates: St,
+    optimisticRemove: At,
+    optimisticUpdate: Rt,
+    optimisticInsert: Pt,
+    clearOptimisticUpdates: bt,
+    rollbackOptimisticUpdates: Et,
+    hasOptimisticUpdates: Mt,
     // Scroll position management
-    setScrollContainer: gt,
-    getScrollPosition: ae,
-    setScrollPosition: de,
-    saveScrollPosition: () => (N = ae(), N),
+    setScrollContainer: Bt,
+    getScrollPosition: me,
+    setScrollPosition: he,
+    saveScrollPosition: () => (V = me(), V),
     restoreScrollPosition: () => {
       requestAnimationFrame(() => {
-        de(N);
+        he(V);
       });
     }
   };
-  return yt(Pe.Provider, {
-    value: It,
+  return Lt(Ee.Provider, {
+    value: Ft,
     get children() {
-      return n.children;
+      return o.children;
     }
   });
 }
-function kt() {
-  const n = wt(Pe);
-  if (!n)
+function Jt() {
+  const o = _t(Ee);
+  if (!o)
     throw new Error("useFileBrowser must be used within a FileBrowserProvider");
-  return n;
+  return o;
 }
 export {
-  qt as FileBrowserProvider,
-  kt as useFileBrowser
+  $t as FileBrowserProvider,
+  Jt as useFileBrowser
 };