hys-ui 0.3.0 → 0.5.0

package/dist/composables/useTable.js

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