hys-ui 0.1.1 → 0.3.0

package/dist/composables/useUploadRequests.js

@@ -0,0 +1,266 @@
+import { shallowRef as C, computed as p, watch as E } from "vue";
+import { uploadStatus as b, uploadFailure as N } from "./upload.js";
+import { uploadRequest as D } from "./uploadRequest.js";
+function J(t) {
+  const { props: c } = t, s = C([]), l = C(/* @__PURE__ */ new Map()), y = p(() => !!(c.action || c.customRequest)), S = p(
+    () => Number.isFinite(c.concurrency) ? Math.max(1, Math.min(20, Math.floor(c.concurrency))) : 2
+  ), v = p(
+    () => new Map(t.files.value.map((e) => [e.uid, e]))
+  );
+  let g = 0, q = !1;
+  const h = /* @__PURE__ */ new Map();
+  function f(e) {
+    var r;
+    return t.live() && t.available.value && !e.controller.signal.aborted && l.value.get(e.uid) === e && ((r = v.value.get(e.uid)) == null ? void 0 : r.raw) === e.raw;
+  }
+  function P(e) {
+    h.delete(e), !h.size && g && (cancelAnimationFrame(g), g = 0);
+  }
+  function O(e, r) {
+    if (!f(e) || e.phase !== "running" || !Number.isFinite(r))
+      return;
+    const n = Math.max(e.percentage, Math.min(100, Math.max(0, r)));
+    n !== e.percentage && (e.percentage = n, h.set(e.uid, Math.round(n * 10) / 10), !g && (g = requestAnimationFrame(() => {
+      g = 0;
+      const a = /* @__PURE__ */ new Map(), u = /* @__PURE__ */ new Map();
+      for (const [i, d] of h) {
+        const o = l.value.get(i);
+        o && f(o) && o.phase === "running" && (a.set(i, { percentage: d }), u.set(i, o));
+      }
+      h.clear(), a.size && t.patch(
+        a,
+        "progress",
+        (i) => i ? !!u.get(i) && f(u.get(i)) && u.get(i).phase === "running" : [...u.values()].some(
+          (d) => f(d) && d.phase === "running"
+        )
+      ).then(() => {
+        for (const [i, d] of u)
+          if (f(d) && d.phase === "running") {
+            const o = v.value.get(i);
+            o && t.emit("progress", a.get(i).percentage, {
+              ...o,
+              ...a.get(i)
+            });
+          }
+      });
+    })));
+  }
+  function x(e) {
+    if (l.value.get(e.uid) !== e) return;
+    const r = new Map(l.value);
+    r.delete(e.uid), l.value = r, M();
+  }
+  function m(e, r, n) {
+    !f(e) || e.phase === "finishing" || (e.phase = "finishing", P(e.uid), (async () => {
+      const a = r === void 0 ? void 0 : N(r), u = a ? { status: "error", error: a } : { status: "success", percentage: 100, response: n, error: void 0 };
+      if (await t.patch(
+        /* @__PURE__ */ new Map([[e.uid, u]]),
+        a ? "error" : "success",
+        () => f(e)
+      ), !f(e)) return;
+      const i = { ...v.value.get(e.uid), ...u };
+      a ? (t.emit("uploadError", a, i), t.emit("error", a.message)) : t.emit("success", n, i), x(e);
+    })().catch((a) => {
+      f(e) && (t.emit("error", N(a).message), x(e));
+    }));
+  }
+  function j(e, r) {
+    var n, a;
+    if (typeof r == "function") e.stop = r;
+    else if (r && typeof r.then == "function")
+      Promise.resolve(r).then(
+        (u) => m(e, void 0, u),
+        (u) => m(e, u)
+      );
+    else if (r) {
+      const u = r;
+      e.stop = (n = u.abort) == null ? void 0 : n.bind(u), u.promise && u.promise.then(
+        (i) => m(e, void 0, i),
+        (i) => m(e, i)
+      );
+    }
+    e.controller.signal.aborted && ((a = e.stop) == null || a.call(e));
+  }
+  async function K(e) {
+    try {
+      let r = v.value.get(e.uid);
+      if (!r || !f(e)) return;
+      const n = await t.prepare(r, e.controller.signal);
+      if (!f(e)) return;
+      if (!n) {
+        x(e);
+        return;
+      }
+      const a = await t.patch(
+        /* @__PURE__ */ new Map([
+          [
+            e.uid,
+            {
+              status: "uploading",
+              percentage: 0,
+              error: void 0,
+              response: void 0
+            }
+          ]
+        ]),
+        "start",
+        () => f(e)
+      );
+      if (!f(e)) return;
+      if (!a) {
+        F(e.uid, "rejected", !1);
+        return;
+      }
+      if (r = v.value.get(e.uid), e.phase = "running", t.emit("start", r), !f(e)) return;
+      const u = {
+        signal: e.controller.signal,
+        files: t.files.value
+      }, [i, d, o] = await Promise.all([
+        typeof c.action == "function" ? c.action(r, u) : c.action ?? "",
+        typeof c.data == "function" ? c.data(r, u) : c.data ?? {},
+        typeof c.headers == "function" ? c.headers(r, u) : c.headers ?? {}
+      ]);
+      if (!f(e)) return;
+      const A = {
+        ...u,
+        file: v.value.get(e.uid),
+        body: n,
+        action: i,
+        method: c.method ?? "POST",
+        name: c.name ?? "file",
+        headers: o,
+        data: d,
+        withCredentials: !!c.withCredentials,
+        timeout: Number.isFinite(c.timeout) ? Math.max(0, c.timeout) : 0,
+        onProgress: (w) => O(e, w),
+        onSuccess: (w) => m(e, void 0, w),
+        onError: (w) => m(e, w)
+      };
+      if (!c.customRequest && !i)
+        throw Object.assign(new Error("请配置有效的上传地址"), {
+          kind: "configuration"
+        });
+      j(
+        e,
+        c.customRequest ? c.customRequest(A) : D(A)
+      );
+    } catch (r) {
+      m(e, r);
+    }
+  }
+  function M() {
+    q || (q = !0, queueMicrotask(() => {
+      if (q = !1, !(!t.live() || !t.available.value || !y.value))
+        for (; l.value.size < S.value && s.value.length; ) {
+          const e = s.value[0];
+          s.value = s.value.slice(1);
+          const r = v.value.get(e);
+          if (!(r != null && r.raw) || l.value.has(e)) continue;
+          const n = {
+            uid: e,
+            raw: r.raw,
+            controller: new AbortController(),
+            phase: "preparing",
+            percentage: 0
+          };
+          l.value = new Map(l.value).set(e, n), K(n);
+        }
+    }));
+  }
+  async function z(e) {
+    if (!t.live() || !t.available.value || !y.value)
+      return 0;
+    const r = t.files.value.filter(
+      (n) => (e === void 0 || n.uid === e) && n.raw && ["ready", "error"].includes(b(n)) && !l.value.has(n.uid) && !s.value.includes(n.uid)
+    );
+    for (const n of r)
+      b(n) === "error" && t.forget(n.uid);
+    return s.value = [...s.value, ...r.map((n) => n.uid)], M(), r.length;
+  }
+  function F(e, r, n = !0) {
+    var d;
+    const a = l.value.get(e), u = s.value.includes(e);
+    if (!a && !u) return !1;
+    if (s.value = s.value.filter((o) => o !== e), P(e), a) {
+      const o = new Map(l.value);
+      o.delete(e), l.value = o, a.controller.abort();
+      try {
+        (d = a.stop) == null || d.call(a);
+      } catch {
+      }
+    }
+    const i = v.value.get(e);
+    return n && i && (t.patch(
+      /* @__PURE__ */ new Map([
+        [
+          e,
+          { status: "ready", percentage: 0, error: void 0 }
+        ]
+      ]),
+      "abort",
+      () => {
+        var o;
+        return t.live() && ((o = v.value.get(e)) == null ? void 0 : o.raw) === i.raw;
+      }
+    ), t.emit("abort", i, r)), M(), !0;
+  }
+  function R(e, r = "user", n = !0) {
+    const a = e === void 0 ? /* @__PURE__ */ new Set([...s.value, ...l.value.keys()]) : /* @__PURE__ */ new Set([e]);
+    let u = 0;
+    for (const i of a) F(i, r, n) && u++;
+    return u;
+  }
+  async function T(e) {
+    const r = v.value.get(e);
+    return !(r != null && r.raw) || !t.available.value || !t.live() || (R(e, "retry", !1), t.forget(e), !(b(r) === "ready" && !r.percentage && !r.error && r.response === void 0 || await t.patch(
+      /* @__PURE__ */ new Map([
+        [
+          e,
+          {
+            status: "ready",
+            percentage: 0,
+            error: void 0,
+            response: void 0
+          }
+        ]
+      ]),
+      "retry"
+    ))) ? !1 : await z(e) > 0;
+  }
+  function U() {
+    for (const [e, r] of l.value) {
+      const n = v.value.get(e);
+      (!n || n.raw !== r.raw || r.phase === "running" && ["success", "error"].includes(b(n))) && F(e, "model", !1);
+    }
+    s.value = s.value.filter((e) => {
+      var r;
+      return !!((r = v.value.get(e)) != null && r.raw);
+    });
+  }
+  E(
+    () => t.files.value.map((e) => [e.uid, e.raw, e.status]),
+    U,
+    { flush: "sync" }
+  ), E([t.available, S, y], () => {
+    t.available.value && M();
+  });
+  function B() {
+    R(void 0, "cleanup", !1), g && cancelAnimationFrame(g), g = 0, h.clear();
+  }
+  return {
+    configured: y,
+    queue: s,
+    tasks: l,
+    uploading: p(() => l.value.size),
+    queued: p(() => s.value.length),
+    activeKeys: p(() => new Set(l.value.keys())),
+    queuedKeys: p(() => new Set(s.value)),
+    submit: z,
+    retry: T,
+    abort: R,
+    cleanup: B
+  };
+}
+export {
+  J as useUploadRequests
+};

package/dist/composables/useVirtualTableLayout.js

@@ -0,0 +1,277 @@
+import { ref as E, computed as s, onMounted as ge, onActivated as we, nextTick as xe, onDeactivated as ye, onBeforeUnmount as Me, watch as X } from "vue";
+import { virtualFinite as f, virtualAligned as ue } from "./virtualTable.js";
+const fe = (l, y) => ({ token: l, width: y, index: -1, offset: 0, gap: !0 });
+function Le(l, y, se, U) {
+  const M = E(), c = E(!0), b = s(
+    () => f(l.rowHeight, 42, 1, 1e4)
+  ), Y = s(
+    () => l.showHeader ? f(l.headerHeight, 42, 24, 200) : 0
+  ), F = s(
+    () => {
+      var e;
+      return Y.value + (((e = l.fixedRows) == null ? void 0 : e.length) ?? 0) * b.value;
+    }
+  ), Z = E(0), V = E(0), v = E(0), x = E(0), q = s(
+    () => Math.max(
+      1,
+      V.value ? V.value - F.value : f(l.height, 280, 1)
+    )
+  ), S = s(
+    () => Z.value || f(l.width, 600, 1)
+  ), ce = s(() => ({
+    height: typeof l.height == "string" ? "calc(" + l.height + " + " + F.value + "px)" : f(l.height, 280, 1) + F.value + "px"
+  })), he = s(() => ({
+    width: typeof l.width == "number" ? f(l.width, 600, 1) + "px" : l.width
+  })), L = s(() => {
+    const e = /* @__PURE__ */ new Set(), a = [], n = [], i = [], h = l.columns.filter(
+      (t) => !t.hidden && typeof t.key == "string" && !e.has(t.key) && !!e.add(t.key)
+    ), m = [
+      ...h.filter((t) => t.fixed === !0 || t.fixed === "left"),
+      ...h.filter((t) => !t.fixed),
+      ...h.filter((t) => t.fixed === "right")
+    ], w = m.map((t) => {
+      const o = f(t.minWidth, 1, 1, 1e4);
+      return { min: o, max: f(t.maxWidth, 1e4, o, 1e4) };
+    }), d = m.map(
+      (t, o) => f(t.width, 160, w[o].min, w[o].max)
+    ), r = l.selectable ? f(l.selectionWidth, 44, 32, 150) : 0;
+    let T = l.fit ? S.value - d.reduce((t, o) => t + o, r) : 0;
+    if (T > 0) {
+      const t = m.flatMap(
+        (o, u) => o.fixed ? [] : [{ index: u, capacity: w[u].max - d[u] }]
+      ).sort((o, u) => o.capacity - u.capacity);
+      t.forEach(({ index: o, capacity: u }, g) => {
+        const C = Math.min(
+          u,
+          T / (t.length - g)
+        );
+        d[o] += C, T -= C;
+      });
+    }
+    let k = r;
+    r && a.push({
+      token: "selection",
+      index: -1,
+      width: r,
+      offset: 0,
+      left: 0,
+      selection: !0
+    }), m.forEach((t, o) => {
+      const u = d[o], g = {
+        token: "column:" + t.key,
+        column: t,
+        index: o,
+        width: u,
+        offset: k
+      };
+      t.fixed === "right" ? i.push(g) : t.fixed ? (g.left = k, a.push(g)) : n.push(g), k += u;
+    });
+    let H = 0;
+    for (let t = i.length - 1; t >= 0; t--)
+      i[t].right = H, H += i[t].width;
+    return {
+      left: a,
+      center: n,
+      right: i,
+      total: k,
+      leftWidth: a.reduce((t, o) => t + o.width, 0),
+      rightWidth: H
+    };
+  }), _ = s(() => [
+    ...L.value.left,
+    ...L.value.center,
+    ...L.value.right
+  ]), $ = s(
+    () => new Map(
+      _.value.flatMap(
+        (e) => e.column ? [[e.column.key, e]] : []
+      )
+    )
+  ), ee = s(
+    () => Math.max(L.value.total, S.value)
+  ), te = s((e) => {
+    var o;
+    const { left: a, center: n, right: i, total: h, leftWidth: m, rightWidth: w } = L.value;
+    let d = 0, r = n.length;
+    if (l.virtualColumns) {
+      const u = x.value + m, g = x.value + S.value - w, C = Math.floor(f(l.columnOverscan, 1, 0, 20));
+      let O = 0, Q = n.length;
+      for (; O < Q; ) {
+        const N = O + Q >>> 1;
+        n[N].offset + n[N].width <= u ? O = N + 1 : Q = N;
+      }
+      for (d = Math.max(0, O - C), r = O; r < n.length && n[r].offset < g; ) r++;
+      r = Math.min(n.length, r + C);
+    }
+    const T = d ? (((o = n[d]) == null ? void 0 : o.offset) ?? h - w) - m : 0, k = r < n.length ? h - w - n[r].offset : 0, H = ee.value - h, t = [
+      ...a,
+      ...T > 0 ? [fe("gap:before", T)] : [],
+      ...n.slice(d, r),
+      ...k + H > 0 ? [fe("gap:after", k + H)] : [],
+      ...i
+    ];
+    return (e == null ? void 0 : e.length) === t.length && t.every(
+      (u, g) => u === e[g] || u.gap && e[g].token === u.token && e[g].width === u.width
+    ) ? e : t;
+  }), le = s((e) => {
+    const a = y(), n = Math.floor(f(l.overscan, 5, 0, 100)), i = Math.min(
+      Math.max(0, a - 1),
+      Math.floor(v.value / b.value)
+    ), h = Math.min(
+      a - 1,
+      Math.ceil((v.value + q.value) / b.value) - 1
+    ), m = Math.max(0, i - n), w = Math.min(a - 1, h + n), d = te.value.flatMap(
+      (r) => r.column ? [r.column.key] : []
+    );
+    return e && m === e.start && w === e.end && i === e.visibleStart && h === e.visibleEnd && d.length === e.columnKeys.length && d.every((r, T) => r === e.columnKeys[T]) ? e : { start: m, end: w, visibleStart: i, visibleEnd: h, columnKeys: d };
+  }), A = s(
+    () => Math.max(0, y() * b.value - q.value)
+  ), j = s(() => Math.max(0, L.value.total - S.value));
+  let R = 0, z = 0, W, G = !1, p = 0, B = 0, ne = 0, ae = 0, I = "";
+  function ie() {
+    if (!c.value) return;
+    const e = v.value, a = x.value;
+    v.value = f(p, 0, 0, A.value), x.value = f(B, 0, 0, j.value), (e !== v.value || a !== x.value) && U.scroll({
+      scrollTop: v.value,
+      scrollLeft: x.value,
+      direction: e !== v.value ? v.value > e ? "down" : "up" : x.value > a ? "right" : "left"
+    });
+  }
+  function de() {
+    const e = M.value;
+    !c.value || !e || (p = e.scrollTop, B = e.scrollLeft, R || (R = requestAnimationFrame(() => {
+      R = 0, ie();
+    })));
+  }
+  function K(e) {
+    const a = M.value;
+    if (!c.value || !a) return;
+    const n = f(e.top, a.scrollTop, 0, A.value), i = f(e.left, a.scrollLeft, 0, j.value);
+    if (e.behavior === "smooth" && a.scrollTo) {
+      a.scrollTo({ top: n, left: i, behavior: "smooth" });
+      return;
+    }
+    a.scrollTop !== n && (a.scrollTop = n), a.scrollLeft !== i && (a.scrollLeft = i), p = n, B = i, ie();
+  }
+  function ve(e, a = "nearest") {
+    var i;
+    if (!y() || !Number.isFinite(e)) return;
+    const n = Math.min(y() - 1, Math.max(0, Math.floor(e))) * b.value;
+    K({
+      top: ue(
+        n,
+        b.value,
+        ((i = M.value) == null ? void 0 : i.scrollTop) ?? v.value,
+        q.value,
+        a
+      )
+    });
+  }
+  function me(e, a = "nearest") {
+    var i;
+    if (!c.value) return !1;
+    const n = $.value.get(e);
+    if (!n) return !1;
+    if (n.left === void 0 && n.right === void 0) {
+      const { leftWidth: h, rightWidth: m } = L.value;
+      K({
+        left: ue(
+          n.offset - h,
+          n.width,
+          ((i = M.value) == null ? void 0 : i.scrollLeft) ?? x.value,
+          Math.max(1, S.value - h - m),
+          a
+        )
+      });
+    }
+    return !0;
+  }
+  function J() {
+    const e = M.value;
+    !c.value || !e || (e.clientWidth && (Z.value = e.clientWidth), e.clientHeight && (V.value = e.clientHeight), K({ top: e.scrollTop, left: e.scrollLeft }));
+  }
+  function D() {
+    c.value && !z && (z = requestAnimationFrame(() => {
+      z = 0, J();
+    }));
+  }
+  function oe() {
+    G || !c.value || !M.value || (G = !0, typeof ResizeObserver < "u" ? (W = new ResizeObserver(D), W.observe(M.value)) : window.addEventListener("resize", D), J());
+  }
+  function re() {
+    W == null || W.disconnect(), W = void 0, G = !1, window.removeEventListener("resize", D), cancelAnimationFrame(R), cancelAnimationFrame(z), R = z = 0;
+  }
+  function P() {
+    const e = y();
+    if (!c.value || !e || l.loading) return;
+    const a = Math.max(0, A.value - v.value);
+    if (a > f(l.endReachedThreshold, 42, 0, 1e4)) {
+      I = "";
+      return;
+    }
+    const n = e + ":" + se();
+    n !== I && (I = n, U.end({ distance: a, total: e }));
+  }
+  return ge(() => {
+    oe(), P();
+  }), we(() => {
+    const e = !c.value;
+    c.value = !0, oe(), e && xe(() => {
+      K({ top: ne, left: ae }), P();
+    });
+  }), ye(() => {
+    ne = p, ae = B, c.value = !1, re();
+  }), Me(() => {
+    c.value = !1, re();
+  }), X([A, j, F, () => l.height], D, {
+    flush: "post"
+  }), X(
+    le,
+    (e) => {
+      c.value && U.range({ ...e, columnKeys: [...e.columnKeys] });
+    },
+    { flush: "post", immediate: !0 }
+  ), X(
+    [
+      v,
+      A,
+      y,
+      () => l.loading,
+      () => l.endReachedThreshold
+    ],
+    P,
+    { flush: "post" }
+  ), {
+    viewport: M,
+    live: c,
+    rowHeight: b,
+    headerHeight: Y,
+    topHeight: F,
+    bodyHeight: q,
+    rootStyle: he,
+    viewportStyle: ce,
+    columns: _,
+    columnMap: $,
+    renderColumns: te,
+    contentWidth: ee,
+    scrollTop: v,
+    scrollLeft: x,
+    range: le,
+    scrollTo: K,
+    scrollToRow: ve,
+    scrollToColumn: me,
+    onScroll: de,
+    remeasure: J
+  };
+}
+function ke(l) {
+  return {
+    width: l.width + "px",
+    flex: "0 0 " + l.width + "px",
+    ...l.left !== void 0 ? { position: "sticky", left: l.left + "px" } : l.right !== void 0 ? { position: "sticky", right: l.right + "px" } : {}
+  };
+}
+export {
+  Le as useVirtualTableLayout,
+  ke as virtualColumnStyle
+};

package/dist/composables/virtualTable.js

@@ -0,0 +1,43 @@
+const y = (t, e, r = 0, n = 1e7) => Math.max(
+  r,
+  Math.min(
+    n,
+    typeof t == "number" && Number.isFinite(t) ? t : e
+  )
+), o = (t) => typeof t == "string" || typeof t == "number" && Number.isFinite(t), c = (t) => typeof t + ":" + String(t);
+function a(t, e, r) {
+  if (e.valueGetter) return e.valueGetter(t, r);
+  const n = e.dataIndex ?? e.key;
+  return typeof n == "string" && Object.prototype.hasOwnProperty.call(t, n) ? t[n] : (typeof n == "string" ? n.split(".") : n).reduce(
+    (i, u) => i !== null && typeof i == "object" ? i[u] : void 0,
+    t
+  );
+}
+function b(t, e) {
+  const r = t.map(
+    (i, u) => typeof e == "function" ? e(i, u) : i[e || "id"]
+  ), n = /* @__PURE__ */ new Map();
+  for (const i of r)
+    o(i) && n.set(i, (n.get(i) ?? 0) + 1);
+  return t.map((i, u) => {
+    const f = r[u], p = o(f) && n.get(f) === 1;
+    return {
+      row: i,
+      key: p ? f : u,
+      token: p ? c(f) : "fallback:" + u,
+      sourceIndex: u,
+      valid: p
+    };
+  });
+}
+function d(t, e, r, n, i) {
+  return i === "center" ? t - (n - e) / 2 : i === "end" ? t + e - n : i === "nearest" ? e > n && t <= r && t + e >= r + n ? r : t < r ? t : t + e > r + n ? e > n ? t : t + e - n : r : t;
+}
+export {
+  d as virtualAligned,
+  b as virtualEntries,
+  y as virtualFinite,
+  o as virtualKey,
+  c as virtualToken,
+  a as virtualValue
+};