hys-ui 0.6.0 → 0.8.0

package/dist/composables/useTable.js

@@ -1,192 +1,198 @@
-import { ref as R, computed as s, shallowRef as ce, watch as p, nextTick as ee, onActivated as Be, onDeactivated as He, onBeforeUnmount as Ue } from "vue";
-import { tableValue as se, tableToken as b, tableFilterPredicate as Je, tableCompare as Le } from "./table.js";
-function Ze(l, m, fe, i) {
-  const f = R(!0), g = s(() => !!l.loading || !!l.disabled), z = s(
+import { ref as R, computed as s, shallowRef as de, watch as U, nextTick as te, onActivated as Je, onDeactivated as Le, onBeforeUnmount as Qe } from "vue";
+import { tableValue as ve, tableToken as b, tableFilterPredicate as Ye, tableCompare as Ze } from "./table.js";
+import { tableSearchPredicate as $e } from "../components/HysTable/tableSearch.js";
+function at(l, x, fe, i) {
+  const d = R(!0), g = s(() => !!l.loading || !!l.disabled), O = s(
     () => typeof l.pagination == "object" ? l.pagination : {}
-  ), de = R(
-    Array.isArray(l.defaultSort) ? [...l.defaultSort] : l.defaultSort ? [l.defaultSort] : l.defaultSort === void 0 ? m().filter((e) => e.defaultSortOrder).map((e) => ({ key: e.key, direction: e.defaultSortOrder })) : []
-  ), te = R({
+  ), he = R(
+    Array.isArray(l.defaultSort) ? [...l.defaultSort] : l.defaultSort ? [l.defaultSort] : l.defaultSort === void 0 ? x().filter((e) => e.defaultSortOrder).map((e) => ({ key: e.key, direction: e.defaultSortOrder })) : []
+  ), ae = R({
     ...Object.fromEntries(
-      m().filter((e) => e.defaultFilterValue).map((e) => [e.key, [...e.defaultFilterValue]])
+      x().filter((e) => e.defaultFilterValue).map((e) => [e.key, [...e.defaultFilterValue]])
     ),
     ...l.defaultFilters
-  }), q = R(z.value.defaultPage ?? 1), _ = R(z.value.defaultPageSize ?? 10), ve = R([
+  }), K = R(O.value.defaultPage ?? 1), _ = R(O.value.defaultPageSize ?? 10), ge = R([
     ...l.defaultSelectedRowKeys ?? []
-  ]), he = R([...l.defaultExpandedRowKeys ?? []]), ae = R(
+  ]), we = R([...l.defaultExpandedRowKeys ?? []]), ne = R(
     l.defaultCurrentRowKey ?? null
-  ), x = ce(
+  ), m = de(
     /* @__PURE__ */ new Map()
-  ), h = ce(
+  ), h = de(
     /* @__PURE__ */ new Map()
-  ), A = ce(/* @__PURE__ */ new Map());
+  ), E = de(/* @__PURE__ */ new Map());
   let W = /* @__PURE__ */ new WeakSet();
-  const ne = /* @__PURE__ */ new WeakMap();
-  let Oe = 0;
-  function le(e) {
-    const a = typeof l.rowKey == "function" ? l.rowKey(e) : se(e, l.rowKey ?? "id");
-    return typeof a == "string" || typeof a == "number" && Number.isFinite(a) ? a : (ne.has(e) || ne.set(e, "@hys-table-row:" + ++Oe), ne.get(e));
+  const le = /* @__PURE__ */ new WeakMap();
+  let Fe = 0;
+  function oe(e) {
+    const a = typeof l.rowKey == "function" ? l.rowKey(e) : ve(e, l.rowKey ?? "id");
+    return typeof a == "string" || typeof a == "number" && Number.isFinite(a) ? a : (le.has(e) || le.set(e, "@hys-table-row:" + ++Fe), le.get(e));
   }
-  const d = s(() => {
+  const v = s(() => {
     const e = [], a = [], t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new WeakSet(), o = [...l.rows].reverse().map((r) => ({
       row: r,
       parent: void 0,
       depth: 0
     }));
     for (; o.length; ) {
-      const { row: r, parent: u, depth: c } = o.pop();
+      const { row: r, parent: c, depth: u } = o.pop();
       if (!r || typeof r != "object" || n.has(r)) continue;
       n.add(r);
-      const y = le(r), M = b(y);
-      if (t.has(M)) continue;
-      const F = l.treeMode ? se(r, l.childrenKey ?? "children") : void 0, w = x.value.get(M), D = (w == null ? void 0 : w.row) === r && w.override ? w.rows : Array.isArray(F) ? F : (w == null ? void 0 : w.row) === r ? w.rows : [], T = {
+      const y = oe(r), w = b(y);
+      if (t.has(w)) continue;
+      const A = l.treeMode ? ve(r, l.childrenKey ?? "children") : void 0, k = m.value.get(w), H = (k == null ? void 0 : k.row) === r && k.override ? k.rows : Array.isArray(A) ? A : (k == null ? void 0 : k.row) === r ? k.rows : [], N = {
         row: r,
         key: y,
-        token: M,
+        token: w,
         index: a.length,
-        depth: c,
-        rootToken: (u == null ? void 0 : u.rootToken) ?? M,
-        parent: u,
+        depth: u,
+        rootToken: (c == null ? void 0 : c.rootToken) ?? w,
+        parent: c,
         children: [],
-        lazy: !!l.treeMode && !!l.loadChildren && !Array.isArray(F) && (w == null ? void 0 : w.row) !== r && !!se(r, l.hasChildrenKey ?? "hasChildren")
+        lazy: !!l.treeMode && !!l.loadChildren && !Array.isArray(A) && (k == null ? void 0 : k.row) !== r && !!ve(r, l.hasChildrenKey ?? "hasChildren")
       };
-      if (t.set(M, T), a.push(T), ((u == null ? void 0 : u.children) ?? e).push(T), l.treeMode)
-        for (let v = D.length - 1; v >= 0; v--)
-          o.push({ row: D[v], parent: T, depth: c + 1 });
+      if (t.set(w, N), a.push(N), ((c == null ? void 0 : c.children) ?? e).push(N), l.treeMode)
+        for (let f = H.length - 1; f >= 0; f--)
+          o.push({ row: H[f], parent: N, depth: u + 1 });
     }
     return { roots: e, all: a, map: t };
-  }), S = s(() => [
-    ...new Set(l.selectedRowKeys ?? ve.value)
-  ]), k = s(
-    () => new Set(S.value.map(b))
-  ), G = s(() => [
+  }), re = R(), G = s(() => l.search ?? re.value ?? l.defaultSearch ?? ""), M = s(() => [
+    ...new Set(l.selectedRowKeys ?? ge.value)
+  ]), S = s(
+    () => new Set(M.value.map(b))
+  ), V = s(() => [
     ...new Set(
-      l.expandedRowKeys ?? (l.defaultExpandAll && !ge.value ? d.value.all.filter((e) => e.children.length || e.lazy || fe()).map((e) => e.key) : he.value)
+      l.expandedRowKeys ?? (l.defaultExpandAll && !ke.value ? v.value.all.filter((e) => e.children.length || e.lazy || fe()).map((e) => e.key) : we.value)
     )
-  ]), ge = R(!1), V = s(() => new Set(G.value.map(b))), B = /* @__PURE__ */ new Map();
-  p(
-    [S, () => d.value.all, () => l.reserveSelection],
+  ]), ke = R(!1), X = s(() => new Set(V.value.map(b))), J = /* @__PURE__ */ new Map();
+  U(
+    [M, () => v.value.all, () => l.reserveSelection],
     () => {
       var a, t;
-      for (const n of B.keys())
-        k.value.has(n) || B.delete(n);
-      for (const n of S.value) {
-        const o = d.value.map.get(b(n));
-        o && B.set(o.token, o.row);
+      for (const n of J.keys())
+        S.value.has(n) || J.delete(n);
+      for (const n of M.value) {
+        const o = v.value.map.get(b(n));
+        o && J.set(o.token, o.row);
       }
       if (!l.reserveSelection) {
-        const n = S.value.filter(
-          (o) => d.value.map.has(b(o))
+        const n = M.value.filter(
+          (o) => v.value.map.has(b(o))
         );
-        n.length !== S.value.length && Z(n);
+        n.length !== M.value.length && p(n);
       }
       let e;
-      for (const [n, o] of x.value)
-        ((a = d.value.map.get(n)) == null ? void 0 : a.row) !== o.row && (e ?? (e = new Map(x.value)), e.delete(n));
-      e && (x.value = e);
+      for (const [n, o] of m.value)
+        ((a = v.value.map.get(n)) == null ? void 0 : a.row) !== o.row && (e ?? (e = new Map(m.value)), e.delete(n));
+      e && (m.value = e);
       for (const [n, o] of h.value)
-        ((t = d.value.map.get(n)) == null ? void 0 : t.row) !== o.row && I(n);
+        ((t = v.value.map.get(n)) == null ? void 0 : t.row) !== o.row && q(n);
     },
     { immediate: !0 }
   );
-  function H(e) {
-    const a = new Map(m().filter((n) => n.sortable).map((n) => [n.key, n])), t = /* @__PURE__ */ new Set();
+  function L(e) {
+    const a = new Map(x().filter((n) => n.sortable).map((n) => [n.key, n])), t = /* @__PURE__ */ new Set();
     return e.filter(
       (n) => ["asc", "desc"].includes(n.direction) && a.has(n.key) && !t.has(n.key) && (t.add(n.key), !0)
     ).slice(0, l.multiSort ? void 0 : 1).sort(
       (n, o) => {
-        var r, u;
-        return (((r = a.get(o.key)) == null ? void 0 : r.sortPriority) ?? 0) - (((u = a.get(n.key)) == null ? void 0 : u.sortPriority) ?? 0);
+        var r, c;
+        return (((r = a.get(o.key)) == null ? void 0 : r.sortPriority) ?? 0) - (((c = a.get(n.key)) == null ? void 0 : c.sortPriority) ?? 0);
       }
     );
   }
-  const oe = s(() => new Map(
-    m().filter((e) => e.sortable && e.sortOrder !== void 0).map((e) => [e.key, e.sortOrder])
-  )), N = s(() => {
-    if (l.sorts !== void 0) return H(l.sorts);
-    if (l.sort !== void 0) return H(l.sort ? [l.sort] : []);
-    const e = de.value.filter((t) => !oe.value.has(t.key)), a = m().flatMap(({ key: t }) => {
-      const n = oe.value.get(t);
+  const ue = s(() => new Map(
+    x().filter((e) => e.sortable && e.sortOrder !== void 0).map((e) => [e.key, e.sortOrder])
+  )), j = s(() => {
+    if (l.sorts !== void 0) return L(l.sorts);
+    if (l.sort !== void 0) return L(l.sort ? [l.sort] : []);
+    const e = he.value.filter((t) => !ue.value.has(t.key)), a = x().flatMap(({ key: t }) => {
+      const n = ue.value.get(t);
       return n ? [{ key: t, direction: n }] : [];
     });
-    return H([...a, ...e]);
-  }), j = s(() => {
+    return L([...a, ...e]);
+  }), P = s(() => {
     if (l.filters !== void 0) return l.filters;
-    const e = m().flatMap(
+    const e = x().flatMap(
       ({ key: a, filteredValue: t }) => t === void 0 ? [] : [[a, t]]
     );
-    return e.length ? { ...te.value, ...Object.fromEntries(e) } : te.value;
-  }), E = s(() => {
-    const e = d.value, a = /* @__PURE__ */ new Set(), t = /* @__PURE__ */ new Map(), n = Je(j.value, m());
+    return e.length ? { ...ae.value, ...Object.fromEntries(e) } : ae.value;
+  }), z = s(() => {
+    const e = v.value, a = /* @__PURE__ */ new Set(), t = /* @__PURE__ */ new Map(), n = Ye(P.value, x()), o = l.serverMode ? void 0 : $e(
+      G.value,
+      x(),
+      l.searchColumns,
+      l.searchMethod
+    );
     if (!l.serverMode)
       for (let u = e.all.length - 1; u >= 0; u--) {
-        const c = e.all[u];
-        (n(c.row) || c.children.some((y) => a.has(y.token))) && a.add(c.token);
+        const y = e.all[u];
+        (n(y.row) && (!o || o(y.row)) || y.children.some((w) => a.has(w.token))) && a.add(y.token);
       }
-    const o = Le(N.value, m());
-    function r(u) {
-      const c = l.serverMode ? [...u] : u.filter((y) => a.has(y.token));
-      return l.serverMode || !N.value.length ? c : c.sort((y, M) => o(y.row, M.row) || y.index - M.index);
+    const r = Ze(j.value, x());
+    function c(u) {
+      const y = l.serverMode ? [...u] : u.filter((w) => a.has(w.token));
+      return l.serverMode || !j.value.length ? y : y.sort((w, A) => r(w.row, A.row) || w.index - A.index);
     }
     for (const u of e.all)
-      u.children.length && t.set(u.token, r(u.children));
-    return { roots: r(e.roots), children: t };
-  }), X = s(() => {
-    const e = l.pageSize ?? z.value.pageSize ?? _.value;
+      u.children.length && t.set(u.token, c(u.children));
+    return { roots: c(e.roots), children: t };
+  }), D = s(() => {
+    const e = l.pageSize ?? O.value.pageSize ?? _.value;
     return Number.isFinite(e) && e > 0 ? Math.min(Number.MAX_SAFE_INTEGER, Math.max(1, Math.floor(e))) : 10;
-  }), we = s(() => {
-    const e = z.value.pageCount;
+  }), ye = s(() => {
+    const e = O.value.pageCount;
     return l.serverMode && e !== void 0 && Number.isFinite(e) && e > 0 ? Math.min(Number.MAX_SAFE_INTEGER, Math.max(1, Math.floor(e))) : void 0;
-  }), ke = s(() => {
-    if (!l.serverMode) return E.value.roots.length;
-    const e = l.total ?? z.value.total;
-    return e === void 0 ? we.value === void 0 ? l.rows.length : void 0 : Number.isFinite(e) ? Math.min(Number.MAX_SAFE_INTEGER, Math.max(0, Math.floor(e))) : 0;
-  }), re = s(
-    () => we.value ?? Math.max(1, Math.ceil((ke.value ?? 0) / X.value))
-  ), U = s(() => {
-    const e = l.page ?? z.value.page ?? q.value;
+  }), Se = s(() => {
+    if (!l.serverMode) return z.value.roots.length;
+    const e = l.total ?? O.value.total;
+    return e === void 0 ? ye.value === void 0 ? l.rows.length : void 0 : Number.isFinite(e) ? Math.min(Number.MAX_SAFE_INTEGER, Math.max(0, Math.floor(e))) : 0;
+  }), ie = s(
+    () => ye.value ?? Math.max(1, Math.ceil((Se.value ?? 0) / D.value))
+  ), Q = s(() => {
+    const e = l.page ?? O.value.page ?? K.value;
     return Math.min(
-      re.value,
+      ie.value,
       Math.max(1, Number.isFinite(e) ? Math.floor(e) : 1)
     );
-  }), ye = s(
-    () => !l.pagination || l.serverMode ? E.value.roots : E.value.roots.slice(
-      (U.value - 1) * X.value,
-      U.value * X.value
+  }), Me = s(
+    () => !l.pagination || l.serverMode ? z.value.roots : z.value.roots.slice(
+      (Q.value - 1) * D.value,
+      Q.value * D.value
     )
-  ), J = s(() => {
-    const e = [], a = [...ye.value].reverse();
+  ), Y = s(() => {
+    const e = [], a = [...Me.value].reverse();
     for (; a.length; ) {
       const t = a.pop();
-      if (e.push(t), V.value.has(t.token) || !l.serverMode && Object.values(j.value).some((n) => n.length)) {
-        const n = E.value.children.get(t.token) ?? [];
+      if (e.push(t), X.value.has(t.token) || !l.serverMode && (G.value.trim() || Object.values(P.value).some((n) => n.length))) {
+        const n = z.value.children.get(t.token) ?? [];
         for (let o = n.length - 1; o >= 0; o--) a.push(n[o]);
       }
     }
     return e;
-  }), Se = s(() => {
-    const e = [], a = [...E.value.roots].reverse();
+  }), be = s(() => {
+    const e = [], a = [...z.value.roots].reverse();
     for (; a.length; ) {
       const t = a.pop();
       e.push(t.row);
-      const n = E.value.children.get(t.token) ?? [];
+      const n = z.value.children.get(t.token) ?? [];
       for (let o = n.length - 1; o >= 0; o--) a.push(n[o]);
     }
     return e;
-  }), L = s(
-    () => l.currentRowKey !== void 0 ? l.currentRowKey : ae.value
-  ), Q = s(
+  }), Z = s(
+    () => l.currentRowKey !== void 0 ? l.currentRowKey : ne.value
+  ), $ = s(
     () => {
       var e;
-      return L.value == null || (e = d.value.map.get(b(L.value))) == null ? void 0 : e.row;
+      return Z.value == null || (e = v.value.map.get(b(Z.value))) == null ? void 0 : e.row;
     }
-  ), ue = s(() => {
+  ), ce = s(() => {
     const e = /* @__PURE__ */ new Set();
     if (l.checkStrictly !== !1) return e;
-    for (let a = d.value.all.length - 1; a >= 0; a--) {
-      const t = d.value.all[a];
+    for (let a = v.value.all.length - 1; a >= 0; a--) {
+      const t = v.value.all[a];
       t.children.some(
-        (n) => e.has(n.token) || k.value.has(n.token)
-      ) && !t.children.filter(C).every((n) => k.value.has(n.token)) && e.add(t.token);
+        (n) => e.has(n.token) || S.value.has(n.token)
+      ) && !t.children.filter(C).every((n) => S.value.has(n.token)) && e.add(t.token);
     }
     return e;
   });
@@ -194,313 +200,322 @@ function Ze(l, m, fe, i) {
     var a;
     return l.selectable !== !1 && ((a = l.getSelectionProps) == null ? void 0 : a.call(l, e.row, e.index).disabled) !== !0 && (typeof l.selectable != "function" || l.selectable(e.row, e.index));
   }
-  const O = s(() => {
-    const e = [], a = [...ye.value].reverse();
+  const F = s(() => {
+    const e = [], a = [...Me.value].reverse();
     for (; a.length; ) {
       const t = a.pop();
       C(t) && e.push(t);
-      const n = E.value.children.get(t.token) ?? [];
+      const n = z.value.children.get(t.token) ?? [];
       for (let o = n.length - 1; o >= 0; o--) a.push(n[o]);
     }
     return e;
-  }), ie = s(
-    () => !!O.value.length && O.value.every((e) => k.value.has(e.token))
-  ), Me = s(
-    () => !ie.value && O.value.some(
-      (e) => k.value.has(e.token) || ue.value.has(e.token)
+  }), se = s(
+    () => !!F.value.length && F.value.every((e) => S.value.has(e.token))
+  ), xe = s(
+    () => !se.value && F.value.some(
+      (e) => S.value.has(e.token) || ce.value.has(e.token)
     )
-  ), be = s(() => ({
+  ), me = s(() => ({
     action: "page",
-    page: U.value,
-    pageSize: X.value,
-    sorts: N.value.map((e) => ({ ...e })),
+    page: Q.value,
+    pageSize: D.value,
+    sorts: j.value.map((e) => ({ ...e })),
     filters: Object.fromEntries(
-      Object.entries(j.value).map(([e, a]) => [e, [...a]])
+      Object.entries(P.value).map(([e, a]) => [e, [...a]])
     ),
-    currentData: Se.value
+    ...l.search !== void 0 || l.defaultSearch !== void 0 || re.value !== void 0 ? { search: G.value } : {},
+    currentData: be.value
   }));
-  function Y(e, a = {}) {
-    const t = { ...be.value, ...a, action: e };
+  function B(e, a = {}) {
+    const t = { ...me.value, ...a, action: e };
     i("queryChange", t), i("change", t);
   }
-  function Ke(e, a = "page") {
-    if (g.value || !f.value) return;
-    const t = Math.max(1, Math.min(re.value, Math.floor(e) || 1));
-    q.value = t, i("update:page", t), i("pageChange", t), Y(a, { page: t });
+  function Te(e, a = "page") {
+    if (g.value || !d.value) return;
+    const t = Math.max(1, Math.min(ie.value, Math.floor(e) || 1));
+    K.value = t, i("update:page", t), i("pageChange", t), B(a, { page: t });
   }
-  function Fe(e) {
-    g.value || !f.value || !Number.isFinite(e) || e < 1 || (_.value = Math.floor(e), q.value = 1, i("update:pageSize", _.value), i("pageSizeChange", _.value), i("update:page", 1), i("pageChange", 1), Y("pageSize", { page: 1, pageSize: _.value }));
+  function Ne(e) {
+    l.disabled || !d.value || e === G.value || (l.search === void 0 && (re.value = e), K.value = 1, i("update:search", e), i("update:page", 1), B("search", { search: e, page: 1 }));
   }
-  function xe(e) {
-    if (g.value || !f.value) return;
-    const a = H(
+  U(() => l.search, (e, a) => {
+    e !== a && (K.value = 1);
+  });
+  function je(e) {
+    g.value || !d.value || !Number.isFinite(e) || e < 1 || (_.value = Math.floor(e), K.value = 1, i("update:pageSize", _.value), i("pageSizeChange", _.value), i("update:page", 1), i("pageChange", 1), B("pageSize", { page: 1, pageSize: _.value }));
+  }
+  function Ce(e) {
+    if (g.value || !d.value) return;
+    const a = L(
       Array.isArray(e) ? [...e] : e ? [e] : []
     );
-    de.value = l.sorts !== void 0 || l.sort !== void 0 ? a : a.filter((t) => !oe.value.has(t.key)), q.value = 1, i("update:sort", a[0] ?? null), i("update:sorts", a), i("sortChange", a[0] ?? null, a), i("update:page", 1), Y("sort", { sorts: a, page: 1 });
+    he.value = l.sorts !== void 0 || l.sort !== void 0 ? a : a.filter((t) => !ue.value.has(t.key)), K.value = 1, i("update:sort", a[0] ?? null), i("update:sorts", a), i("sortChange", a[0] ?? null, a), i("update:page", 1), B("sort", { sorts: a, page: 1 });
   }
-  function me(e, a) {
-    var o, r, u;
-    const t = (o = N.value.find((c) => c.key === e.key)) == null ? void 0 : o.direction, n = (r = e.sortOrders) != null && r.length ? e.sortOrders : (u = l.sortOrders) != null && u.length ? l.sortOrders : ["asc", "desc", null];
+  function Ae(e, a) {
+    var o, r, c;
+    const t = (o = j.value.find((u) => u.key === e.key)) == null ? void 0 : o.direction, n = (r = e.sortOrders) != null && r.length ? e.sortOrders : (c = l.sortOrders) != null && c.length ? l.sortOrders : ["asc", "desc", null];
     return a ? t === a ? null : a : n[(n.indexOf(t ?? null) + 1) % n.length];
   }
-  function Te(e, a) {
+  function Pe(e, a) {
     if (!e.sortable) return;
-    const t = me(e, a), n = l.multiSort ? N.value.filter((o) => o.key !== e.key) : [];
-    t && n.push({ key: e.key, direction: t }), xe(n);
+    const t = Ae(e, a), n = l.multiSort ? j.value.filter((o) => o.key !== e.key) : [];
+    t && n.push({ key: e.key, direction: t }), Ce(n);
   }
-  function Ce(e) {
-    if (g.value || !f.value) return;
-    const a = new Set(m().filter((t) => t.filteredValue !== void 0).map((t) => t.key));
-    te.value = l.filters !== void 0 || !a.size ? e : Object.fromEntries(Object.entries(e).filter(([t]) => !a.has(t))), q.value = 1, i("update:filters", e), i("filterChange", e), i("update:page", 1), Y("filter", { filters: e, page: 1 });
+  function Re(e) {
+    if (g.value || !d.value) return;
+    const a = new Set(x().filter((t) => t.filteredValue !== void 0).map((t) => t.key));
+    ae.value = l.filters !== void 0 || !a.size ? e : Object.fromEntries(Object.entries(e).filter(([t]) => !a.has(t))), K.value = 1, i("update:filters", e), i("filterChange", e), i("update:page", 1), B("filter", { filters: e, page: 1 });
   }
-  function Ne(e, a) {
-    m().some((t) => t.key === e) && Ce({ ...j.value, [e]: [...a] });
+  function Ie(e, a) {
+    x().some((t) => t.key === e) && Re({ ...P.value, [e]: [...a] });
   }
-  function je(e) {
-    Ce(
+  function qe(e) {
+    Re(
       e ? Object.fromEntries(
-        Object.entries(j.value).filter(
+        Object.entries(P.value).filter(
           ([a]) => !e.includes(a)
         )
       ) : {}
     );
   }
-  function P(e) {
-    return d.value.map.get(
-      b(typeof e == "object" ? le(e) : e)
+  function I(e) {
+    return v.value.map.get(
+      b(typeof e == "object" ? oe(e) : e)
     );
   }
-  function K() {
-    return S.value.flatMap((e) => {
+  function T() {
+    return M.value.flatMap((e) => {
       var n;
-      const a = b(e), t = ((n = d.value.map.get(a)) == null ? void 0 : n.row) ?? (l.reserveSelection ? B.get(a) : void 0);
+      const a = b(e), t = ((n = v.value.map.get(a)) == null ? void 0 : n.row) ?? (l.reserveSelection ? J.get(a) : void 0);
       return t ? [t] : [];
     });
   }
-  async function Z(e) {
-    if (g.value || !f.value) return !1;
+  async function p(e) {
+    if (g.value || !d.value) return !1;
     const a = [...new Set(e)];
-    ve.value = a, i("update:selectedRowKeys", a), await ee();
-    const t = f.value && a.length === S.value.length && a.every((n) => k.value.has(b(n)));
-    return t && i("selectionChange", K(), S.value), t;
+    ge.value = a, i("update:selectedRowKeys", a), await te();
+    const t = d.value && a.length === M.value.length && a.every((n) => S.value.has(b(n)));
+    return t && i("selectionChange", T(), M.value), t;
   }
-  function Pe(e) {
+  function _e(e) {
     if (!(l.checkStrictly !== !1 || l.selectionType === "radio"))
-      for (let a = d.value.all.length - 1; a >= 0; a--) {
-        const t = d.value.all[a], n = t.children.filter(C);
+      for (let a = v.value.all.length - 1; a >= 0; a--) {
+        const t = v.value.all[a], n = t.children.filter(C);
         !n.length || !C(t) || (n.every((o) => e.has(o.token)) ? e.add(t.token) : e.delete(t.token));
       }
   }
-  function $(e) {
-    Pe(e);
-    const a = S.value.filter((t) => e.has(b(t)));
-    for (const t of d.value.all)
-      e.has(t.token) && !k.value.has(t.token) && a.push(t.key);
-    return Z(a);
+  function ee(e) {
+    _e(e);
+    const a = M.value.filter((t) => e.has(b(t)));
+    for (const t of v.value.all)
+      e.has(t.token) && !S.value.has(t.token) && a.push(t.key);
+    return p(a);
   }
-  let Ae;
-  async function Ie(e, a, t = !1) {
-    const n = P(e), o = typeof t == "boolean" ? t : t.range, r = typeof t == "object" && t.ignoreSelectable;
-    if (!n || !r && !C(n) || g.value || !f.value)
+  let Ee;
+  async function We(e, a, t = !1) {
+    const n = I(e), o = typeof t == "boolean" ? t : t.range, r = typeof t == "object" && t.ignoreSelectable;
+    if (!n || !r && !C(n) || g.value || !d.value)
       return !1;
-    const u = a ?? !k.value.has(n.token);
+    const c = a ?? !S.value.has(n.token);
     if (l.selectionType === "radio") {
-      const v = await Z(u ? [n.key] : []);
-      return v && i("select", K(), n.row, u), v;
+      const f = await p(c ? [n.key] : []);
+      return f && i("select", T(), n.row, c), f;
     }
-    const c = o && l.rangeSelection ? J.value.findIndex((v) => v.token === Ae) : -1, y = J.value.findIndex((v) => v.token === n.token), M = c >= 0 && y >= 0 ? J.value.slice(Math.min(c, y), Math.max(c, y) + 1) : [n], F = new Set(k.value), w = [...M], D = /* @__PURE__ */ new Set();
-    for (; w.length; ) {
-      const v = w.pop();
-      D.has(v.token) || (D.add(v.token), (r && v === n || C(v)) && (u ? F.add(v.token) : F.delete(v.token)), l.checkStrictly === !1 && w.push(...v.children));
+    const u = o && l.rangeSelection ? Y.value.findIndex((f) => f.token === Ee) : -1, y = Y.value.findIndex((f) => f.token === n.token), w = u >= 0 && y >= 0 ? Y.value.slice(Math.min(u, y), Math.max(u, y) + 1) : [n], A = new Set(S.value), k = [...w], H = /* @__PURE__ */ new Set();
+    for (; k.length; ) {
+      const f = k.pop();
+      H.has(f.token) || (H.add(f.token), (r && f === n || C(f)) && (c ? A.add(f.token) : A.delete(f.token)), l.checkStrictly === !1 && k.push(...f.children));
     }
-    const T = await $(F);
-    return T && (Ae = n.token, i("select", K(), n.row, u), M.length > 1 && i(
+    const N = await ee(A);
+    return N && (Ee = n.token, i("select", T(), n.row, c), w.length > 1 && i(
       "selectRange",
-      K(),
-      M.filter(C).map((v) => v.row),
-      u
-    )), T;
+      T(),
+      w.filter(C).map((f) => f.row),
+      c
+    )), N;
   }
-  async function qe(e) {
+  async function Ge(e) {
     if (l.selectionType === "radio") return !1;
-    const a = e ?? (Me.value && l.selectOnIndeterminate === !1 ? !1 : !ie.value), t = k.value, n = new Set(t), o = O.value;
-    for (const u of o)
-      a ? n.add(u.token) : n.delete(u.token);
-    const r = await $(n);
+    const a = e ?? (xe.value && l.selectOnIndeterminate === !1 ? !1 : !se.value), t = S.value, n = new Set(t), o = F.value;
+    for (const c of o)
+      a ? n.add(c.token) : n.delete(c.token);
+    const r = await ee(n);
     if (r) {
-      const u = o.filter(({ token: c }) => t.has(c) !== n.has(c));
-      i("selectAll", K(), a, u.map(({ row: c }) => c));
+      const c = o.filter(({ token: u }) => t.has(u) !== n.has(u));
+      i("selectAll", T(), a, c.map(({ row: u }) => u));
     }
     return r;
   }
-  async function _e() {
-    if (l.selectionType === "radio" || g.value || !f.value)
+  async function Ve() {
+    if (l.selectionType === "radio" || g.value || !d.value)
       return !1;
-    const e = new Set(k.value);
-    for (const t of O.value)
+    const e = new Set(S.value);
+    for (const t of F.value)
       (l.checkStrictly !== !1 || !t.children.some(C)) && (e.has(t.token) ? e.delete(t.token) : e.add(t.token));
-    const a = await $(e);
-    return a && i("selectInvert", K(), S.value), a;
+    const a = await ee(e);
+    return a && i("selectInvert", T(), M.value), a;
   }
-  async function We(e, a = O.value) {
-    if (l.selectionType === "radio" || g.value || !f.value) return !1;
-    const t = new Set(e.map(b)), n = new Set(k.value);
+  async function Xe(e, a = F.value) {
+    if (l.selectionType === "radio" || g.value || !d.value) return !1;
+    const t = new Set(e.map(b)), n = new Set(S.value);
     for (const o of a) {
-      const r = d.value.map.get(o.token);
+      const r = v.value.map.get(o.token);
       (r == null ? void 0 : r.row) !== o.row || !C(r) || (t.has(o.token) ? n.add(o.token) : n.delete(o.token));
     }
-    return $(n);
+    return ee(n);
   }
-  async function Ge() {
-    const e = S.value.length > 0, a = await Z([]);
+  async function De() {
+    const e = M.value.length > 0, a = await p([]);
     return e && a && i("selectNone"), a;
   }
-  async function Ve(e) {
-    if (g.value || !f.value) return !1;
-    const a = e == null ? void 0 : P(e);
+  async function Be(e) {
+    if (g.value || !d.value) return !1;
+    const a = e == null ? void 0 : I(e);
     if (e != null && !a) return !1;
-    const t = Q.value;
-    ae.value = (a == null ? void 0 : a.key) ?? null, i("update:currentRowKey", ae.value), await ee();
-    const n = f.value && L.value === ((a == null ? void 0 : a.key) ?? null);
-    return n && Q.value !== t && i("currentChange", Q.value, t), n;
+    const t = $.value;
+    ne.value = (a == null ? void 0 : a.key) ?? null, i("update:currentRowKey", ne.value), await te();
+    const n = d.value && Z.value === ((a == null ? void 0 : a.key) ?? null);
+    return n && $.value !== t && i("currentChange", $.value, t), n;
   }
-  function I(e) {
+  function q(e) {
     const a = h.value.get(e);
     if (!a) return;
     a.controller.abort(), W.delete(a.row);
     const t = new Map(h.value);
     t.delete(e), h.value = t;
   }
-  async function Re(e, a = !1) {
-    var u;
-    const t = P(e), n = l.loadChildren;
-    if (!t || !n || !l.treeMode || g.value || !f.value || h.value.has(t.token))
+  async function ze(e, a = !1) {
+    var c;
+    const t = I(e), n = l.loadChildren;
+    if (!t || !n || !l.treeMode || g.value || !d.value || h.value.has(t.token))
       return !1;
-    if (!a && !t.lazy && x.value.has(t.token)) return !0;
+    if (!a && !t.lazy && m.value.has(t.token)) return !0;
     W.add(t.row);
     const o = { row: t.row, controller: new AbortController() };
     h.value = new Map(h.value).set(t.token, o);
-    const r = new Map(A.value);
-    r.delete(t.token), A.value = r;
+    const r = new Map(E.value);
+    r.delete(t.token), E.value = r;
     try {
-      const c = await n(t.row, {
+      const u = await n(t.row, {
         signal: o.controller.signal,
         key: t.key,
         depth: t.depth
       });
-      if (!f.value || o.controller.signal.aborted || h.value.get(t.token) !== o || ((u = d.value.map.get(t.token)) == null ? void 0 : u.row) !== t.row || l.loadChildren !== n)
+      if (!d.value || o.controller.signal.aborted || h.value.get(t.token) !== o || ((c = v.value.map.get(t.token)) == null ? void 0 : c.row) !== t.row || l.loadChildren !== n)
         return !1;
-      if (!Array.isArray(c))
+      if (!Array.isArray(u))
         throw new TypeError("loadChildren must return an array");
-      return x.value = new Map(x.value).set(t.token, {
+      return m.value = new Map(m.value).set(t.token, {
         row: t.row,
-        rows: c
-      }), i("load", t.row, c), !0;
-    } catch (c) {
-      return f.value && !o.controller.signal.aborted && h.value.get(t.token) === o && (A.value = new Map(A.value).set(t.token, c), i("loadError", t.row, c)), !1;
+        rows: u
+      }), i("load", t.row, u), !0;
+    } catch (u) {
+      return d.value && !o.controller.signal.aborted && h.value.get(t.token) === o && (E.value = new Map(E.value).set(t.token, u), i("loadError", t.row, u)), !1;
     } finally {
       if (h.value.get(t.token) === o) {
-        const c = new Map(h.value);
-        c.delete(t.token), h.value = c;
+        const u = new Map(h.value);
+        u.delete(t.token), h.value = u;
       }
     }
   }
-  function Ee(e) {
+  function Oe(e) {
     var a;
     return ((a = l.rowExpandable) == null ? void 0 : a.call(l, e.row)) !== !1 && (e.children.length > 0 || e.lazy || !!l.expandable || fe());
   }
-  async function Xe(e, a) {
+  async function He(e, a) {
     var r;
-    const t = P(e);
-    if (!t || !l.treeMode || g.value || !f.value || !Array.isArray(a))
+    const t = I(e);
+    if (!t || !l.treeMode || g.value || !d.value || !Array.isArray(a))
       return !1;
-    I(t.token), W.add(t.row);
+    q(t.token), W.add(t.row);
     const n = { row: t.row, rows: [...a], override: !0 };
-    x.value = new Map(x.value).set(t.token, n);
-    const o = new Map(A.value);
-    return o.delete(t.token), A.value = o, await ee(), !f.value || x.value.get(t.token) !== n || ((r = d.value.map.get(t.token)) == null ? void 0 : r.row) !== t.row ? !1 : (i("childrenChange", t.row, n.rows), !0);
+    m.value = new Map(m.value).set(t.token, n);
+    const o = new Map(E.value);
+    return o.delete(t.token), E.value = o, await te(), !d.value || m.value.get(t.token) !== n || ((r = v.value.map.get(t.token)) == null ? void 0 : r.row) !== t.row ? !1 : (i("childrenChange", t.row, n.rows), !0);
   }
-  async function De(e, a) {
-    const t = P(e);
-    if (!t || !Ee(t) || g.value || !f.value) return !1;
-    const n = a ?? !V.value.has(t.token), o = G.value.filter((u) => b(u) !== t.token);
-    return n && o.push(t.key), ge.value = !0, he.value = o, i("update:expandedRowKeys", o), await ee(), f.value && V.value.has(t.token) === n ? (i("expandChange", t.row, n, G.value), n || I(t.token), !0) : !1;
+  async function Ue(e, a) {
+    const t = I(e);
+    if (!t || !Oe(t) || g.value || !d.value) return !1;
+    const n = a ?? !X.value.has(t.token), o = V.value.filter((c) => b(c) !== t.token);
+    return n && o.push(t.key), ke.value = !0, we.value = o, i("update:expandedRowKeys", o), await te(), d.value && X.value.has(t.token) === n ? (i("expandChange", t.row, n, V.value), n || q(t.token), !0) : !1;
   }
-  function ze() {
-    f.value = !1;
-    for (const e of [...h.value.keys()]) I(e);
+  function Ke() {
+    d.value = !1;
+    for (const e of [...h.value.keys()]) q(e);
   }
-  return p(
+  return U(
     () => l.loadChildren,
     () => {
-      for (const e of [...h.value.keys()]) I(e);
-      x.value = /* @__PURE__ */ new Map(), A.value = /* @__PURE__ */ new Map(), W = /* @__PURE__ */ new WeakSet();
+      for (const e of [...h.value.keys()]) q(e);
+      m.value = /* @__PURE__ */ new Map(), E.value = /* @__PURE__ */ new Map(), W = /* @__PURE__ */ new WeakSet();
     }
-  ), p(g, (e) => {
-    if (e) for (const a of [...h.value.keys()]) I(a);
-  }), p(
-    [G, () => d.value.all, () => h.value.size, f, g],
+  ), U(g, (e) => {
+    if (e) for (const a of [...h.value.keys()]) q(a);
+  }), U(
+    [V, () => v.value.all, () => h.value.size, d, g],
     () => {
       var a;
-      if (!f.value || g.value) return;
+      if (!d.value || g.value) return;
       let e = Math.max(0, 4 - h.value.size);
-      for (const t of d.value.all) {
+      for (const t of v.value.all) {
         if (!e) break;
-        t.lazy && V.value.has(t.token) && !W.has(t.row) && !A.value.has(t.token) && ((a = l.rowExpandable) == null ? void 0 : a.call(l, t.row)) !== !1 && (e--, Re(t.key));
+        t.lazy && X.value.has(t.token) && !W.has(t.row) && !E.value.has(t.token) && ((a = l.rowExpandable) == null ? void 0 : a.call(l, t.row)) !== !1 && (e--, ze(t.key));
       }
     },
     { immediate: !0, flush: "post" }
-  ), Be(() => f.value = !0), He(ze), Ue(ze), {
-    live: f,
+  ), Je(() => d.value = !0), Le(Ke), Qe(Ke), {
+    live: d,
     busy: g,
-    graph: d,
-    rowId: le,
-    selectedKeys: S,
-    selectedSet: k,
-    expandedKeys: G,
-    expandedSet: V,
-    halfSet: ue,
+    graph: v,
+    rowId: oe,
+    selectedKeys: M,
+    selectedSet: S,
+    expandedKeys: V,
+    expandedSet: X,
+    halfSet: ce,
     eligible: C,
-    allSelected: ie,
-    someSelected: Me,
-    selectionPage: O,
-    sorts: N,
-    filters: j,
-    processed: E,
-    filteredRows: Se,
-    display: J,
-    page: U,
-    pageSize: X,
-    pageCount: re,
-    paginationTotal: ke,
-    pagination: z,
-    currentKey: L,
-    currentRow: Q,
-    query: be,
+    allSelected: se,
+    someSelected: xe,
+    selectionPage: F,
+    sorts: j,
+    filters: P,
+    search: G,
+    processed: z,
+    filteredRows: be,
+    display: Y,
+    page: Q,
+    pageSize: D,
+    pageCount: ie,
+    paginationTotal: Se,
+    pagination: O,
+    currentKey: Z,
+    currentRow: $,
+    query: me,
     pending: h,
-    loadErrors: A,
-    canExpand: Ee,
-    nextSortOrder: me,
-    toggleSort: Te,
-    setSort: xe,
-    setFilter: Ne,
-    clearFilter: je,
-    requestPage: Ke,
-    changeSize: Fe,
-    toggleRowSelection: Ie,
-    toggleAllSelection: qe,
-    invertSelection: _e,
-    clearSelection: Ge,
-    selectPage: We,
-    getSelectionRows: K,
-    getHalfSelectionRows: () => d.value.all.filter((e) => ue.value.has(e.token)).map((e) => e.row),
-    setCurrentRow: Ve,
-    toggleRowExpansion: De,
-    loadRow: Re,
-    updateKeyChildren: Xe,
-    find: P
+    loadErrors: E,
+    canExpand: Oe,
+    nextSortOrder: Ae,
+    toggleSort: Pe,
+    setSort: Ce,
+    setFilter: Ie,
+    clearFilter: qe,
+    setSearch: Ne,
+    requestPage: Te,
+    changeSize: je,
+    toggleRowSelection: We,
+    toggleAllSelection: Ge,
+    invertSelection: Ve,
+    clearSelection: De,
+    selectPage: Xe,
+    getSelectionRows: T,
+    getHalfSelectionRows: () => v.value.all.filter((e) => ce.value.has(e.token)).map((e) => e.row),
+    setCurrentRow: Be,
+    toggleRowExpansion: Ue,
+    loadRow: ze,
+    updateKeyChildren: He,
+    find: I
   };
 }
 export {
-  Ze as useTable
+  at as useTable
 };