hys-ui 0.2.0 → 0.4.0

package/dist/composables/selectOptions.js

@@ -1,54 +1,60 @@
-import { toRaw as g } from "vue";
-function W(a) {
-  let r = 0;
-  const s = /* @__PURE__ */ new WeakMap();
-  return (e) => {
-    if (e && typeof e == "object") {
-      const n = g(e), o = a().split(".").reduce(
-        (l, i) => l && typeof l == "object" && Object.prototype.hasOwnProperty.call(l, i) ? l[i] : void 0,
-        n
+import { toRaw as S } from "vue";
+function W(n) {
+  if (typeof n != "object" || typeof n.label != "string" || !Object.hasOwn(n, "value")) return !1;
+  const e = n.value;
+  return typeof e == "string" || typeof e == "number" || typeof e == "boolean" || e !== null && typeof e == "object" && !Array.isArray(e);
+}
+function z(n) {
+  let e = 0;
+  const c = /* @__PURE__ */ new WeakMap();
+  return (t) => {
+    if (t && typeof t == "object") {
+      const l = S(t), r = n().split(".").reduce(
+        (s, a) => s && typeof s == "object" && Object.prototype.hasOwnProperty.call(s, a) ? s[a] : void 0,
+        l
       );
-      return o != null && typeof o != "object" ? "object:" + typeof o + ":" + String(o) : (s.has(n) || s.set(n, ++r), "reference:" + s.get(n));
+      return r != null && typeof r != "object" ? "object:" + typeof r + ":" + String(r) : (c.has(l) || c.set(l, ++e), "reference:" + c.get(l));
     }
-    return typeof e + ":" + String(e);
+    return typeof t + ":" + String(t);
   };
 }
-function z(a, r, s) {
-  const e = [], n = /* @__PURE__ */ new Set(), o = /* @__PURE__ */ new WeakSet();
-  let l = 0;
-  const i = r.label ?? "label", u = r.value ?? "value", K = r.options ?? "options", v = r.disabled ?? "disabled";
-  function p(x, d, O = !1, b = "") {
-    x.forEach((t, h) => {
-      if (!t || typeof t != "object") return;
-      const w = t[K], j = O || !!t[v], f = String(t[i] ?? t[u] ?? "");
+function E(n, e, c) {
+  const t = [], l = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new WeakSet();
+  let s = 0;
+  const a = e.label ?? "label", p = e.value ?? "value", K = e.options ?? "options", O = e.disabled ?? "disabled";
+  function u(x, f, A = !1, d = "") {
+    x.forEach((o, j) => {
+      if (!o || typeof o != "object") return;
+      const w = o[K], h = A || !!o[O], y = String(o[a] ?? o[p] ?? "");
       if (Array.isArray(w)) {
-        const k = g(t);
-        if (o.has(k)) return;
-        o.add(k);
-        const S = d ? d + " / " + f : f;
-        e.push({ key: "group:" + b + h, group: S, index: -1 }), p(w, S, j, b + h + ".");
+        const g = S(o);
+        if (r.has(g)) return;
+        r.add(g);
+        const k = f ? f + " / " + y : y;
+        t.push({ key: "group:" + d + j, group: k, index: -1 }), u(w, k, h, d + j + ".");
         return;
       }
-      const c = t[u];
-      if (c == null || !["string", "number", "boolean", "object"].includes(typeof c))
+      const i = o[p];
+      if (i == null || !["string", "number", "boolean", "object"].includes(typeof i))
         return;
-      const y = s(c);
-      n.has(y) || (n.add(y), e.push({
-        key: y,
+      const b = c(i);
+      l.has(b) || (l.add(b), t.push({
+        key: b,
         option: {
-          ...t,
-          value: c,
-          label: f,
-          disabled: j
+          ...o,
+          value: i,
+          label: y,
+          disabled: h
         },
-        group: d,
-        index: l++
+        group: f,
+        index: s++
       }));
     });
   }
-  return p(a), e;
+  return u(n), t;
 }
 export {
-  z as normalizeSelectOptions,
-  W as selectKeyFactory
+  W as isSelectLabeledValue,
+  E as normalizeSelectOptions,
+  z as selectKeyFactory
 };

package/dist/composables/splitPaneSizes.js

@@ -0,0 +1,58 @@
+const E = 1e-7;
+function b(e, i) {
+  if (e === void 0) return;
+  const a = typeof e == "number" ? e : Number.parseFloat(e);
+  if (Number.isFinite(a)) {
+    if (a <= 0) return 0;
+    if (typeof e == "string" && e.endsWith("%")) return a;
+    if (i > 0) return a / i * 100;
+  }
+}
+function x(e) {
+  const i = e.map(({ min: t, max: n, preferred: o }) => Math.min(n, Math.max(t, o ?? t))), a = i.reduce((t, n) => t + n, 0), u = e.flatMap((t, n) => t.relative ? [n] : []);
+  if (a > 100 + 1e-7) {
+    let t = function(r) {
+      const c = r.reduce((s, M) => s + i[M] - e[M].min, 0);
+      if (c <= 1e-7 || o <= 1e-7) return;
+      const p = Math.min(o, c);
+      for (const s of r) i[s] -= (i[s] - e[s].min) * p / c;
+      o -= p;
+    };
+    const n = e.reduce((r, c) => r + c.min, 0);
+    if (n >= 100) return e.map((r) => r.min / n * 100);
+    let o = a - 100;
+    return t(u), t(e.map((r, c) => c)), i;
+  }
+  let f = 100 - a;
+  const h = e.flatMap((t, n) => t.preferred === void 0 ? [n] : []), g = h.flatMap((t) => [
+    { size: e[t].min, change: 1 },
+    { size: e[t].max, change: -1 }
+  ]).sort((t, n) => t.size - n.size);
+  let m = 0, l = 0;
+  for (const t of g) {
+    const n = (t.size - m) * l;
+    if (f < n) {
+      m += f / l, f = 0;
+      break;
+    }
+    m = t.size, f -= n, l += t.change;
+  }
+  for (const t of h)
+    i[t] = Math.min(e[t].max, Math.max(i[t], m));
+  function z(t) {
+    let n = t.filter((o) => e[o].max > i[o]);
+    for (; f > 1e-7 && n.length; ) {
+      const o = f / n.length;
+      n = n.filter((r) => {
+        const c = Math.min(o, e[r].max - i[r]);
+        return i[r] += c, f -= c, i[r] + 1e-7 < e[r].max;
+      });
+    }
+  }
+  return z(u), i;
+}
+export {
+  x as fitPaneSizes,
+  E as paneEpsilon,
+  b as paneRatio
+};

package/dist/composables/table.js

@@ -1,150 +1,173 @@
-const N = (n) => typeof n + ":" + n;
-function g(n, r) {
-  const s = typeof r == "string" ? r.split(".") : r;
-  let o = n;
-  for (const e of s) {
-    if (o == null || typeof o != "object") return;
-    o = o[e];
+const C = (i) => typeof i + ":" + i;
+function v(i, o) {
+  const a = typeof o == "string" ? o.split(".") : o;
+  let s = i;
+  for (const e of a) {
+    if (s == null || typeof s != "object") return;
+    s = s[e];
   }
-  return o;
+  return s;
 }
-const M = (n) => n < 576 ? "xs" : n < 768 ? "sm" : n < 992 ? "md" : n < 1200 ? "lg" : n < 1600 ? "xl" : "xxl";
-function S(n, r, s = !0) {
-  const o = /* @__PURE__ */ new Set();
-  function e(y, u, i = /* @__PURE__ */ new Set(), p = 0) {
-    return p > 32 ? [] : y.flatMap((d) => {
-      if (i.has(d) || d.hidden || !s && d.type === "expand" || d.responsive && !d.responsive.includes(r) || o.has(d.key))
+const F = (i) => i < 576 ? "xs" : i < 768 ? "sm" : i < 992 ? "md" : i < 1200 ? "lg" : i < 1600 ? "xl" : "xxl";
+function I(i, o, a = !0) {
+  const s = /* @__PURE__ */ new Set();
+  function e(h, r, n = /* @__PURE__ */ new Set(), c = 0) {
+    return c > 32 ? [] : h.flatMap((l) => {
+      if (n.has(l) || l.hidden || !a && l.type === "expand" || l.responsive && !l.responsive.includes(o) || s.has(l.key))
         return [];
-      o.add(d.key);
-      const v = d.fixed === !1 ? void 0 : d.fixed === !0 ? "left" : d.fixed ?? u, b = d.children ? e(
-        d.children,
-        v,
-        /* @__PURE__ */ new Set([...i, d]),
-        p + 1
+      s.add(l.key);
+      const m = l.fixed === !1 ? void 0 : l.fixed === !0 ? "left" : l.fixed ?? r, k = l.children ? e(
+        l.children,
+        m,
+        /* @__PURE__ */ new Set([...n, l]),
+        c + 1
       ) : void 0;
-      return b && !b.length ? [] : [{ ...d, fixed: v, children: b }];
+      return k && !k.length ? [] : [{ ...l, fixed: m, children: k }];
     });
   }
-  const t = e(n);
-  function a(y, u) {
-    return y.flatMap((i) => {
-      if (i.children) {
-        const p = a(i.children, u);
-        return p.length ? [{ ...i, children: p, fixed: u }] : [];
+  const t = e(i);
+  function u(h, r) {
+    return h.flatMap((n) => {
+      if (n.children) {
+        const c = u(n.children, r);
+        return c.length ? [{ ...n, children: c, fixed: r }] : [];
       }
-      return i.fixed === u ? [i] : [];
+      return n.fixed === r ? [n] : [];
     });
   }
-  const f = [
-    ...a(t, "left"),
-    ...a(t),
-    ...a(t, "right")
+  const d = [
+    ...u(t, "left"),
+    ...u(t),
+    ...u(t, "right")
   ];
-  function m(y) {
-    return y.flatMap((u) => u.children ? m(u.children) : [u]);
+  function x(h) {
+    return h.flatMap((r) => r.children ? x(r.children) : [r]);
   }
-  function l(y) {
+  function f(h) {
     return Math.max(
       1,
-      ...y.map((u) => u.children ? 1 + l(u.children) : 1)
+      ...h.map((r) => r.children ? 1 + f(r.children) : 1)
     );
   }
-  const c = l(f), h = Array.from({ length: c }, () => []);
-  function x(y, u) {
-    for (const i of y) {
-      const p = i.children ? m(i.children) : [i];
-      h[u].push({
-        column: i,
-        key: i.key + ":" + (i.fixed || "center"),
-        leaves: p,
-        colspan: p.length,
-        rowspan: i.children ? 1 : c - u,
-        fixed: i.fixed === "left" || i.fixed === "right" ? i.fixed : void 0
-      }), i.children && x(i.children, u + 1);
+  const p = f(d), y = Array.from({ length: p }, () => []);
+  function b(h, r) {
+    for (const n of h) {
+      const c = n.children ? x(n.children) : [n];
+      y[r].push({
+        column: n,
+        key: n.key + ":" + (n.fixed || "center"),
+        leaves: c,
+        colspan: c.length,
+        rowspan: n.children ? 1 : p - r,
+        fixed: n.fixed === "left" || n.fixed === "right" ? n.fixed : void 0
+      }), n.children && b(n.children, r + 1);
     }
   }
-  return x(f, 0), { leaves: m(f), headers: h };
+  b(d, 0);
+  const N = x(d), M = new Map(N.map((h, r) => [h.key, r])), w = y.map((h) => {
+    const r = [];
+    for (let n = 0; n < h.length; n++) {
+      const c = h[n], l = c.column.headerColSpan;
+      if (l === 0) {
+        r.push({ ...c, blank: !0 });
+        continue;
+      }
+      if (l === void 0 || !Number.isSafeInteger(l) || l <= 1 || c.column.children) {
+        r.push(c);
+        continue;
+      }
+      const m = [...c.leaves], k = M.get(m[0].key);
+      for (; m.length < l; ) {
+        const g = h[n + 1];
+        if (!g || g.column.children || g.column.type && g.column.type !== "default" || g.fixed !== c.fixed || g.rowspan !== c.rowspan || M.get(g.column.key) !== k + m.length) break;
+        m.push(g.column), n++;
+      }
+      r.push({ ...c, leaves: m, colspan: m.length });
+    }
+    return r;
+  });
+  return { leaves: N, headers: w };
 }
-function F(n, r) {
-  const s = new Intl.Collator("zh-CN", {
+function B(i, o) {
+  const a = new Intl.Collator("zh-CN", {
     numeric: !0,
     sensitivity: "base"
-  }), o = n.flatMap((e) => {
-    const t = r.find((a) => a.key === e.key);
+  }), s = i.flatMap((e) => {
+    const t = o.find((u) => u.key === e.key);
     return t && t.sortable !== "custom" ? [{ ...e, column: t }] : [];
   });
   return (e, t) => {
-    for (const { direction: a, column: f } of o) {
-      if (f.sorter) {
-        const l = f.sorter(e, t);
-        if (Number.isFinite(l) && l !== 0)
-          return (a === "asc" ? 1 : -1) * l;
+    for (const { direction: u, column: d } of s) {
+      if (d.sorter) {
+        const f = d.sorter(e, t);
+        if (Number.isFinite(f) && f !== 0)
+          return (u === "asc" ? 1 : -1) * f;
         continue;
       }
-      const m = Array.isArray(f.sortBy) ? f.sortBy : [f.sortBy ?? f.dataIndex ?? f.key];
-      for (const l of m) {
-        const c = typeof l == "function" ? l(e) : g(e, l), h = typeof l == "function" ? l(t) : g(t, l);
-        if (c == null || h == null) {
-          if (c == null && h == null) continue;
-          return c == null ? 1 : -1;
+      const x = Array.isArray(d.sortBy) ? d.sortBy : [d.sortBy ?? d.dataIndex ?? d.key];
+      for (const f of x) {
+        const p = typeof f == "function" ? f(e) : v(e, f), y = typeof f == "function" ? f(t) : v(t, f);
+        if (p == null || y == null) {
+          if (p == null && y == null) continue;
+          return p == null ? 1 : -1;
         }
-        const x = typeof c == "number" && typeof h == "number" ? Number.isNaN(c) ? Number.isNaN(h) ? 0 : 1 : Number.isNaN(h) ? -1 : c - h : s.compare(String(c), String(h));
-        if (Number.isFinite(x) && x !== 0)
-          return (a === "asc" ? 1 : -1) * x;
+        const b = typeof p == "number" && typeof y == "number" ? Number.isNaN(p) ? Number.isNaN(y) ? 0 : 1 : Number.isNaN(y) ? -1 : p - y : a.compare(String(p), String(y));
+        if (Number.isFinite(b) && b !== 0)
+          return (u === "asc" ? 1 : -1) * b;
       }
     }
     return 0;
   };
 }
-function w(n, r) {
-  var o;
-  const s = /* @__PURE__ */ new Map();
-  for (const e of r) {
-    const t = n[e.key];
+function L(i, o) {
+  var s;
+  const a = /* @__PURE__ */ new Map();
+  for (const e of o) {
+    const t = i[e.key];
     if (!(t != null && t.length) || !e.filters || e.filterMethod) continue;
-    const a = new Set(t), f = k(e.filters), m = new Map(f.map((l) => [l.value, l]));
-    for (const l of t) {
-      const c = (o = m.get(l)) == null ? void 0 : o.children;
-      if (c)
-        for (const h of k(c))
-          a.add(h.value);
+    const u = new Set(t), d = S(e.filters), x = new Map(d.map((f) => [f.value, f]));
+    for (const f of t) {
+      const p = (s = x.get(f)) == null ? void 0 : s.children;
+      if (p)
+        for (const y of S(p))
+          u.add(y.value);
     }
-    s.set(e.key, a);
+    a.set(e.key, u);
   }
-  return (e) => r.every((t) => {
-    const a = n[t.key];
-    return a != null && a.length ? s.has(t.key) ? s.get(t.key).has(
-      g(
+  return (e) => o.every((t) => {
+    const u = i[t.key];
+    return u != null && u.length ? a.has(t.key) ? a.get(t.key).has(
+      v(
         e,
         t.dataIndex ?? t.key
       )
-    ) : a.some(
-      (f) => t.filterMethod ? t.filterMethod(f, e, t) : String(g(e, t.dataIndex ?? t.key) ?? "").toLocaleLowerCase().includes(String(f).toLocaleLowerCase())
+    ) : u.some(
+      (d) => t.filterMethod ? t.filterMethod(d, e, t) : String(v(e, t.dataIndex ?? t.key) ?? "").toLocaleLowerCase().includes(String(d).toLocaleLowerCase())
     ) : !0;
   });
 }
-function k(n) {
-  const r = [], s = /* @__PURE__ */ new Set(), o = [...n].reverse();
-  for (; o.length; ) {
-    const e = o.pop();
-    s.has(e) || (s.add(e), r.push(e), e.children && o.push(...[...e.children].reverse()));
+function S(i) {
+  const o = [], a = /* @__PURE__ */ new Set(), s = [...i].reverse();
+  for (; s.length; ) {
+    const e = s.pop();
+    a.has(e) || (a.add(e), o.push(e), e.children && s.push(...[...e.children].reverse()));
   }
-  return r;
+  return o;
 }
-function C(n, r) {
-  if (r.summary === "count") return n.length;
-  const s = n.map((e) => g(e, r.dataIndex ?? r.key)).filter((e) => typeof e == "number" && Number.isFinite(e));
-  if (!s.length) return "—";
-  const o = s.reduce((e, t) => e + t, 0);
-  return r.summary === "sum" ? +o.toFixed(12) : r.summary === "avg" ? +(o / s.length).toFixed(12) : r.summary === "min" ? s.reduce((e, t) => Math.min(e, t)) : r.summary === "max" ? s.reduce((e, t) => Math.max(e, t)) : "";
+function A(i, o) {
+  if (o.summary === "count") return i.length;
+  const a = i.map((e) => v(e, o.dataIndex ?? o.key)).filter((e) => typeof e == "number" && Number.isFinite(e));
+  if (!a.length) return "—";
+  const s = a.reduce((e, t) => e + t, 0);
+  return o.summary === "sum" ? +s.toFixed(12) : o.summary === "avg" ? +(s / a.length).toFixed(12) : o.summary === "min" ? a.reduce((e, t) => Math.min(e, t)) : o.summary === "max" ? a.reduce((e, t) => Math.max(e, t)) : "";
 }
 export {
-  M as tableBreakpoint,
-  S as tableColumns,
-  F as tableCompare,
-  k as tableFilterOptions,
-  w as tableFilterPredicate,
-  C as tableSummary,
-  N as tableToken,
-  g as tableValue
+  F as tableBreakpoint,
+  I as tableColumns,
+  B as tableCompare,
+  S as tableFilterOptions,
+  L as tableFilterPredicate,
+  A as tableSummary,
+  C as tableToken,
+  v as tableValue
 };

package/dist/composables/tagInput.js

@@ -0,0 +1,16 @@
+function f(t, n) {
+  if (!n || typeof n == "string" && !n.length)
+    return [t];
+  if (n instanceof RegExp)
+    return t.split(new RegExp(n.source, n.flags.replace(/[gy]/g, ""))).filter((e) => e !== void 0);
+  const g = (typeof n == "string" ? [n] : [...n]).filter(Boolean).sort((e, i) => i.length - e.length);
+  return g.length ? t.split(
+    new RegExp(
+      g.map((e) => e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&")).join("|"),
+      "u"
+    )
+  ) : [t];
+}
+export {
+  f as splitTags
+};

package/dist/composables/timeline.js

@@ -0,0 +1,19 @@
+function n(e, i) {
+  return i.split(".").reduce(
+    (r, t) => r != null && typeof r == "object" ? r[t] : void 0,
+    e
+  );
+}
+const s = (e) => typeof e == "string" || typeof e == "number" ? String(e) : "", u = (e) => ({
+  primary: "var(--hys-ui-primary,var(--hys-ui-theme-primary))",
+  success: "var(--hys-ui-success,#16a46e)",
+  warning: "var(--hys-ui-warning,#d9860c)",
+  danger: "var(--hys-ui-red,var(--hys-ui-theme-red,#ed4556))",
+  info: "var(--hys-ui-info,#3867f5)",
+  neutral: "var(--hys-ui-muted,var(--hys-ui-theme-muted))"
+})[e] || "var(--hys-ui-muted,var(--hys-ui-theme-muted))";
+export {
+  n as timelineRead,
+  s as timelineText,
+  u as timelineTone
+};

package/dist/composables/transfer.js

@@ -1,30 +1,30 @@
-const f = (e) => typeof e + ":" + e;
+const d = (e) => typeof e + ":" + e;
 function l(e, a) {
   return a.split(".").reduce(
-    (t, n) => t != null && Object.prototype.hasOwnProperty.call(Object(t), n) ? t[n] : void 0,
+    (t, o) => t != null && Object.prototype.hasOwnProperty.call(Object(t), o) ? t[o] : void 0,
     e
   );
 }
-function d(e) {
-  var n, s, c;
+function f(e) {
+  var o, s, c;
   const a = [], t = /* @__PURE__ */ new Map();
-  for (const o of e.options) {
-    if (!o || typeof o != "object") continue;
-    const r = e.rowKey ? e.rowKey(o) : l(o, ((n = e.fieldNames) == null ? void 0 : n.value) ?? "value");
-    if (typeof r != "string" && (typeof r != "number" || !Number.isFinite(r)) || t.has(r))
+  for (const n of e.options) {
+    if (!n || typeof n != "object") continue;
+    const i = e.rowKey ? e.rowKey(n) : l(n, ((o = e.fieldNames) == null ? void 0 : o.value) ?? "value");
+    if (typeof i != "string" && (typeof i != "number" || !Number.isFinite(i)) || t.has(i))
       continue;
-    const i = {
-      key: r,
+    const r = {
+      key: i,
       label: String(
-        l(o, ((s = e.fieldNames) == null ? void 0 : s.label) ?? "label") ?? r
+        l(n, ((s = e.fieldNames) == null ? void 0 : s.label) ?? "label") ?? i
       ),
       disabled: !!l(
-        o,
+        n,
         ((c = e.fieldNames) == null ? void 0 : c.disabled) ?? "disabled"
       ),
-      option: o
+      option: n
     };
-    a.push(i), t.set(i.key, i);
+    a.push(r), t.set(r.key, r);
   }
   return { rows: a, map: t };
 }
@@ -43,6 +43,8 @@ const u = (e) => ({
   moveLeft: "移除选中项",
   dragRight: "拖动到已选择区域",
   dragLeft: "拖动到待选择区域",
+  doubleClickRight: "双击移入已选择区域，也可拖拽移动",
+  doubleClickLeft: "双击移回待选择区域，也可拖拽移动",
   dragCount: "正在拖动 {count} 项",
   moved: "已{direction} {count} 项",
   added: "移入",
@@ -53,11 +55,11 @@ const u = (e) => ({
   lastPage: "末页",
   perPage: "每页条数",
   ...e
-}), g = (e, a) => e.replace(/\{(\w+)\}/g, (t, n) => String(a[n] ?? t));
+}), g = (e, a) => e.replace(/\{(\w+)\}/g, (t, o) => String(a[o] ?? t));
 export {
   g as transferLabel,
-  d as transferRows,
-  f as transferToken,
+  f as transferRows,
+  d as transferToken,
   l as transferValue,
   u as transferWords
 };

package/dist/composables/upload.js

@@ -0,0 +1,55 @@
+const r = {
+  choose: "选择文件",
+  drag: "点击选择或拖入文件",
+  checking: "正在检查文件…",
+  localHint: "文件通过事件交给业务层上传",
+  uploadHint: "支持选择、拖入和上传进度管理",
+  files: "文件列表",
+  ready: "待上传",
+  uploading: "上传中",
+  success: "已完成",
+  error: "上传失败",
+  queued: "等待上传",
+  removing: "正在移除",
+  submit: "开始上传",
+  abort: "取消上传",
+  retry: "重试",
+  clear: "清空",
+  remove: "移除",
+  preview: "预览",
+  download: "下载",
+  empty: "暂无文件"
+}, n = (t) => ["ready", "uploading", "success", "error"].includes(t.status ?? "") ? t.status : t.raw ? "ready" : "success", a = (t) => n(t) === "success" ? 100 : Number.isFinite(t.percentage) ? Math.max(0, Math.min(100, t.percentage)) : 0, o = (t) => {
+  var e, s;
+  return !!((s = t.type ?? ((e = t.raw) == null ? void 0 : e.type)) != null && s.startsWith("image/")) || /\.(png|jpe?g|gif|webp|avif|bmp|svg)(?:[?#]|$)/i.test(
+    t.name || t.url || ""
+  );
+};
+function c(t) {
+  return !Number.isFinite(t) || t < 0 ? "" : t < 1024 ? t + " B" : t < 1048576 ? (t / 1024).toFixed(1) + " KB" : (t / 1048576).toFixed(1) + " MB";
+}
+function i(t, e = "custom") {
+  return t instanceof Error ? Object.assign(new Error(t.message, { cause: t }), t, {
+    kind: t.kind ?? e
+  }) : Object.assign(new Error(typeof t == "string" ? t : "上传失败"), {
+    kind: e
+  });
+}
+function u(t, e = !1) {
+  if (t)
+    try {
+      const s = new URL(t, document.baseURI);
+      if (["http:", "https:", "blob:"].includes(s.protocol) || e && /^data:image\//i.test(t))
+        return s.href;
+    } catch {
+    }
+}
+export {
+  i as uploadFailure,
+  o as uploadImage,
+  r as uploadLocale,
+  a as uploadPercent,
+  c as uploadSize,
+  n as uploadStatus,
+  u as uploadUrl
+};