hys-ui 0.1.1 → 0.3.0

package/dist/composables/useTable.js

@@ -0,0 +1,474 @@
+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({
+    ...Object.fromEntries(
+      b().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(
+    /* @__PURE__ */ new Map()
+  ), h = re(
+    /* @__PURE__ */ new Map()
+  ), C = re(/* @__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 f = v(() => {
+    const e = [], a = [], t = /* @__PURE__ */ new Map(), l = /* @__PURE__ */ new WeakSet(), o = [...n.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 = {
+        row: r,
+        key: w,
+        token: k,
+        index: a.length,
+        depth: c,
+        rootToken: (u == null ? void 0 : u.rootToken) ?? k,
+        parent: u,
+        children: [],
+        lazy: !!n.treeMode && !!n.loadChildren && !Array.isArray(q) && (S == null ? void 0 : S.row) !== r && !!ue(r, n.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 });
+    }
+    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(() => [
+    ...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)
+    )
+  ]), fe = A(!1), D = v(() => new Set(V.value.map(y))), G = /* @__PURE__ */ new Map();
+  _(
+    [M, () => f.value.all, () => n.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);
+      }
+      if (!n.reserveSelection) {
+        const l = M.value.filter(
+          (o) => f.value.map.has(y(o))
+        );
+        l.length !== M.value.length && j(l);
+      }
+      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));
+      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);
+    },
+    { immediate: !0 }
+  );
+  const E = v(() => {
+    const e = n.sorts ?? (n.sort !== void 0 ? n.sort ? [n.sort] : [] : K.value), a = /* @__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);
+      }
+    );
+  }), 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)
+      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);
+      }
+    const o = Be(E.value, b());
+    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);
+    }
+    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;
+    return Math.min(
+      he.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
+    )
+  ), Q = v(() => {
+    const e = [], a = [...we.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]);
+      }
+    }
+    return e;
+  }), ke = v(() => {
+    const e = [], a = [...z.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]);
+    }
+    return e;
+  }), X = v(
+    () => n.currentRowKey !== void 0 ? n.currentRowKey : p.value
+  ), Y = v(
+    () => {
+      var e;
+      return X.value == null || (e = f.value.map.get(y(X.value))) == null ? void 0 : e.row;
+    }
+  ), ae = v(() => {
+    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];
+      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);
+    }
+    return e;
+  });
+  function R(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));
+  }
+  const H = v(() => {
+    const e = [], a = [...we.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]);
+    }
+    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)
+    )
+  ), ge = v(() => ({
+    action: "page",
+    page: L.value,
+    pageSize: B.value,
+    sorts: E.value.map((e) => ({ ...e })),
+    filters: Object.fromEntries(
+      Object.entries(F.value).map(([e, a]) => [e, [...a]])
+    ),
+    currentData: ke.value
+  }));
+  function Z(e, a = {}) {
+    const t = { ...ge.value, ...a, action: e };
+    s("queryChange", t), s("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) {
+    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 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)
+    );
+    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 });
+  }
+  function ze(e, a) {
+    var u, c, w;
+    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);
+  }
+  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 Oe(e, a) {
+    b().some((t) => t.key === e) && Me({ ...F.value, [e]: [...a] });
+  }
+  function Ee(e) {
+    Me(
+      e ? Object.fromEntries(
+        Object.entries(F.value).filter(
+          ([a]) => !e.includes(a)
+        )
+      ) : {}
+    );
+  }
+  function T(e) {
+    return f.value.map.get(
+      y(typeof e == "object" ? te(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);
+      return t ? [t] : [];
+    });
+  }
+  async function j(e) {
+    if (g.value || !d.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;
+  }
+  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));
+      }
+  }
+  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;
+    }
+    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));
+    }
+    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(
+      "selectRange",
+      O(),
+      c.filter(R).map((i) => i.row),
+      o
+    )), U;
+  }
+  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 je() {
+    if (n.selectionType === "radio" || g.value || !d.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;
+  }
+  async function Pe(e) {
+    if (g.value || !d.value) return !1;
+    const a = e == null ? void 0 : T(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;
+  }
+  function P(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) {
+    var u;
+    const t = T(e), l = n.loadChildren;
+    if (!t || !l || !n.treeMode || g.value || !d.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;
+    try {
+      const c = await l(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)
+        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;
+    } 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;
+    } finally {
+      if (h.value.get(t.token) === o) {
+        const c = new Map(h.value);
+        c.delete(t.token), h.value = c;
+      }
+    }
+  }
+  function me(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());
+  }
+  async function qe(e, a) {
+    var r;
+    const t = T(e);
+    if (!t || !n.treeMode || g.value || !d.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);
+  }
+  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;
+  }
+  function Ce() {
+    d.value = !1;
+    for (const e of [...h.value.keys()]) P(e);
+  }
+  return _(
+    () => n.loadChildren,
+    () => {
+      for (const e of [...h.value.keys()]) P(e);
+      x.value = /* @__PURE__ */ new Map(), C.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],
+    () => {
+      var a;
+      if (!d.value || g.value) return;
+      let e = Math.max(0, 4 - h.value.size);
+      for (const t of f.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));
+      }
+    },
+    { immediate: !0, flush: "post" }
+  ), Ne(() => d.value = !0), We(Ce), Ve(Ce), {
+    live: d,
+    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,
+    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
+  };
+}
+export {
+  Ge as useTable
+};