hys-ui 0.1.0 → 0.2.0

package/dist/composables/formValidation.js

@@ -0,0 +1,240 @@
+import P from "async-validator";
+import { toRaw as w, unref as k } from "vue";
+import { formValue as R, formPath as _ } from "./formContext.js";
+const D = P.default ?? P;
+function A(e, t = /* @__PURE__ */ new WeakMap()) {
+  const r = w(k(e));
+  if (!r || typeof r != "object") return r;
+  if (r instanceof Date) return new Date(r);
+  if (r instanceof RegExp) return new RegExp(r.source, r.flags);
+  if (t.has(r)) return t.get(r);
+  if (!Array.isArray(r) && Object.getPrototypeOf(r) !== Object.prototype && Object.getPrototypeOf(r) !== null)
+    return r;
+  const s = Array.isArray(r) ? [] : {};
+  t.set(r, s);
+  for (const [o, d] of Object.entries(r))
+    Object.defineProperty(s, o, {
+      value: A(d, t),
+      writable: !0,
+      enumerable: !0,
+      configurable: !0
+    });
+  return s;
+}
+function S(e, t, r = /* @__PURE__ */ new WeakMap()) {
+  if (e = w(e), t = w(t), Object.is(e, t)) return !0;
+  if (e instanceof Date && t instanceof Date)
+    return e.getTime() === t.getTime();
+  if (e instanceof RegExp && t instanceof RegExp)
+    return e.source === t.source && e.flags === t.flags;
+  if (!e || !t || typeof e != "object" || typeof t != "object") return !1;
+  if (r.get(e) === t) return !0;
+  if (r.set(e, t), Array.isArray(e) !== Array.isArray(t) || Object.getPrototypeOf(e) !== Object.getPrototypeOf(t) || !Array.isArray(e) && ![Object.prototype, null].includes(Object.getPrototypeOf(e)))
+    return !1;
+  const s = Object.keys(e);
+  return s.length === Object.keys(t).length && s.every(
+    (o) => Object.prototype.hasOwnProperty.call(t, o) && S(
+      e[o],
+      t[o],
+      r
+    )
+  );
+}
+function V(e) {
+  return e instanceof Date ? "date" : Array.isArray(e) ? "array" : e && typeof e == "object" ? "object" : typeof e == "number" ? "number" : typeof e == "boolean" ? "boolean" : "string";
+}
+function E(e, t, r, s) {
+  return e.flatMap((o) => {
+    const {
+      validator: d,
+      asyncValidator: y,
+      trigger: h,
+      level: f,
+      fields: n,
+      defaultField: i,
+      ...a
+    } = o, u = [], m = {
+      ...a,
+      type: a.type ?? (a.enum ? "enum" : V(t))
+    };
+    return m.transform = function(l) {
+      const c = o.transform ? o.transform(l) : l;
+      if (this.type = a.type ?? (a.enum ? "enum" : V(c)), n) {
+        const p = {};
+        for (const [j, O] of Object.entries(n))
+          p[j] = E(
+            [O].flat(),
+            c == null ? void 0 : c[j],
+            r,
+            s
+          );
+        this.fields = p;
+      }
+      return i && (this.defaultField = E(
+        [i].flat(),
+        void 0,
+        r,
+        s
+      )), c;
+    }, (Object.keys(a).some((l) => l !== "message") || n || i || !d && !y) && u.push(m), d && u.push({
+      asyncValidator: async (l, c) => {
+        if (s.signal.aborted) return;
+        const p = await d(c, r, {
+          ...s,
+          path: l.fullField ?? s.path
+        });
+        if (!s.signal.aborted) {
+          if (p === !1)
+            throw Error(
+              typeof o.message == "function" ? o.message(l.fullField) : o.message || "校验未通过"
+            );
+          if (typeof p == "string") throw Error(p);
+          if (p instanceof Error) throw p;
+        }
+      }
+    }), y && u.push({
+      asyncValidator: (l, c) => new Promise((p, j) => {
+        if (s.signal.aborted) {
+          p();
+          return;
+        }
+        let O = !1;
+        const b = (g) => {
+          O || (O = !0, s.signal.removeEventListener("abort", F), g && !s.signal.aborted ? j(typeof g == "string" ? Error(g) : g) : p());
+        }, F = () => b();
+        s.signal.addEventListener("abort", F, { once: !0 });
+        try {
+          const g = y(c, b, r, {
+            ...s,
+            path: l.fullField ?? s.path
+          });
+          g && typeof g.then == "function" && g.then(
+            () => b(),
+            (v) => b(v instanceof Error ? v : String(v))
+          );
+        } catch (g) {
+          b(g instanceof Error ? g : String(g));
+        }
+      })
+    }), u;
+  });
+}
+const M = {
+  default: "校验未通过",
+  required: "此项不能为空",
+  enum: "请选择允许的值",
+  whitespace: "不能只输入空白字符",
+  types: {
+    string: "请输入文本",
+    number: "请输入数字",
+    boolean: "请输入布尔值",
+    method: "应为函数",
+    regexp: "正则表达式无效",
+    integer: "请输入整数",
+    float: "请输入有效数值",
+    array: "应为数组",
+    object: "应为对象",
+    date: "日期无效",
+    email: "邮箱格式不正确",
+    url: "链接格式不正确",
+    hex: "颜色格式不正确"
+  },
+  string: {
+    len: (e, t) => "长度应为 " + t + " 个字符",
+    min: (e, t) => "长度至少为 " + t + " 个字符",
+    max: (e, t) => "长度最多为 " + t + " 个字符",
+    range: (e, t, r) => "长度应为 " + t + "–" + r + " 个字符"
+  },
+  number: {
+    len: "数值不符合要求",
+    min: "数值过小",
+    max: "数值过大",
+    range: "超出允许范围"
+  },
+  array: {
+    len: "项目数量不符合要求",
+    min: "项目数量过少",
+    max: "项目数量过多",
+    range: "项目数量超出允许范围"
+  },
+  pattern: { mismatch: "格式不正确" },
+  date: {
+    format: "日期格式不正确",
+    parse: "日期无法解析",
+    invalid: "日期无效"
+  }
+};
+function q(e, t, r, s, o, d, y = !0) {
+  if (!r.length) return { messages: [], fields: {} };
+  const h = (f) => {
+    const n = {};
+    for (const i of f ?? []) {
+      const a = _(i.field ?? e), u = String(i.message ?? "校验失败");
+      (n[a] ?? (n[a] = [])).includes(u) || n[a].push(u);
+    }
+    return { messages: [...new Set(Object.values(n).flat())], fields: n };
+  };
+  try {
+    const f = new D({
+      [e]: E(r, t, s, d)
+    });
+    f.messages(M), o && f.messages(o);
+    let n = !1, i = { messages: [], fields: {} }, a;
+    const u = new Promise((l) => {
+      a = l;
+    });
+    return f.validate(
+      { [e]: A(t) },
+      {
+        firstFields: y,
+        suppressWarning: !0,
+        suppressValidatorError: !0
+      },
+      (l) => {
+        i = h(l), n = !0, a(i);
+      }
+    ).catch(() => {
+    }), n ? i : u;
+  } catch (f) {
+    const n = f == null ? void 0 : f.errors;
+    return n ? h(n) : {
+      messages: [f instanceof Error ? f.message : "校验失败"],
+      fields: {
+        [e]: [f instanceof Error ? f.message : "校验失败"]
+      }
+    };
+  }
+}
+function z(e, t, r) {
+  var d;
+  const s = [t[e] ?? []].flat();
+  let o = R(r, e);
+  for (const [y, h] of Object.entries(t))
+    if (e.startsWith(y + ".")) {
+      const f = e.slice(y.length + 1).split(".");
+      let n = [h].flat(), i = R(r, y);
+      for (const a of f) {
+        const u = [];
+        for (const m of n) {
+          r !== void 0 && m.transform && (i = m.transform(A(i)));
+          const l = ((d = m.fields) == null ? void 0 : d[a]) ?? m.defaultField;
+          l && u.push(
+            ...[l].flat().map((c) => ({
+              ...c,
+              level: c.level ?? m.level,
+              trigger: c.trigger ?? m.trigger
+            }))
+          );
+        }
+        i = i && typeof i == "object" ? i[a] : void 0, n = u;
+      }
+      s.push(...n), n.length && (o = i);
+    }
+  return { rules: s, value: o };
+}
+export {
+  z as nestedFormRules,
+  q as runFormRules,
+  S as sameFormValue,
+  A as snapshotForm
+};

package/dist/composables/ganttConflicts.js

@@ -0,0 +1,143 @@
+function x(i) {
+  if (!/^\d{4}-\d{2}-\d{2}$/.test(i)) return null;
+  const [n, c, l] = i.split("-").map(Number), o = /* @__PURE__ */ new Date(0);
+  return o.setUTCHours(0, 0, 0, 0), o.setUTCFullYear(n, c - 1, l), o.getUTCFullYear() === n && o.getUTCMonth() === c - 1 && o.getUTCDate() === l ? o.getTime() / 864e5 : null;
+}
+const C = (i, n) => JSON.stringify([i, n]), h = (i) => new Date(i * 864e5).toISOString().split("T")[0];
+function $(i, n) {
+  if (!(i.s === null || i.e === null || n.s === null || n.e === null || i.e < i.s || n.e < n.s || n.s > i.e))
+    return {
+      id: JSON.stringify(["dependency-order", i.id, n.id]),
+      type: "dependency-order",
+      taskId: n.id,
+      taskTitle: n.title,
+      sourceId: i.id,
+      sourceTitle: i.title,
+      expectedStart: h(i.e + 1),
+      days: i.e - n.s + 1,
+      message: `${i.title} 于 ${h(i.e)} 结束，${n.title} 最早应在 ${h(i.e + 1)} 开始；当前提前 ${i.e - n.s + 1} 天`
+    };
+}
+function D(i) {
+  const n = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Map(), l = /* @__PURE__ */ new Map(), o = [], r = [], a = /* @__PURE__ */ new Map(), u = /* @__PURE__ */ new Map(), y = (e) => (u.has(e) || u.set(e, x(e)), u.get(e));
+  for (const e of i) {
+    const t = {
+      id: e.id,
+      title: e.title,
+      start: e.start,
+      end: e.end,
+      dependencies: e.dependencies,
+      s: y(e.start),
+      e: y(e.end)
+    };
+    n.set(e.id, t), c.set(e.id, []), l.set(e.id, []), (t.s === null || t.e === null || t.e < t.s) && r.push({
+      id: JSON.stringify(["invalid-date", e.id]),
+      type: "invalid-date",
+      taskId: e.id,
+      taskTitle: e.title,
+      message: `${e.title} 的日期无效，需使用有效的 YYYY-MM-DD 且结束日期不早于开始日期`
+    });
+  }
+  for (const e of n.values())
+    for (const t of new Set(e.dependencies ?? [])) {
+      if (!n.get(t)) {
+        r.push({
+          id: JSON.stringify(["missing-dependency", t, e.id]),
+          type: "missing-dependency",
+          taskId: e.id,
+          taskTitle: e.title,
+          sourceId: t,
+          message: `${e.title} 引用了不存在的前置任务 ${t}`
+        });
+        continue;
+      }
+      c.get(t).push(e.id), l.get(e.id).push(t);
+      const d = {
+        sourceId: t,
+        targetId: e.id,
+        id: C(t, e.id)
+      };
+      o.push(d);
+      for (const g of /* @__PURE__ */ new Set([t, e.id])) {
+        const I = a.get(g);
+        I ? I.push(d) : a.set(g, [d]);
+      }
+    }
+  const f = /* @__PURE__ */ new Set(), k = [];
+  for (const e of n.keys()) {
+    if (f.has(e)) continue;
+    const t = [{ id: e, exit: !1 }];
+    for (; t.length; ) {
+      const s = t.pop();
+      if (s.exit) {
+        k.push(s.id);
+        continue;
+      }
+      if (!f.has(s.id)) {
+        f.add(s.id), t.push({ id: s.id, exit: !0 });
+        for (const d of c.get(s.id))
+          f.has(d) || t.push({ id: d, exit: !1 });
+      }
+    }
+  }
+  const p = /* @__PURE__ */ new Map(), w = [];
+  for (let e = k.length - 1; e >= 0; e--) {
+    const t = k[e];
+    if (p.has(t)) continue;
+    const s = w.length, d = [t];
+    let g = 0;
+    for (p.set(t, s); d.length; ) {
+      const I = d.pop();
+      g++;
+      for (const S of l.get(I))
+        p.has(S) || (p.set(S, s), d.push(S));
+    }
+    w.push(g);
+  }
+  const T = /* @__PURE__ */ new Set(), M = /* @__PURE__ */ new Map();
+  for (const e of o) {
+    const t = n.get(e.sourceId), s = n.get(e.targetId);
+    let d;
+    p.get(t.id) === p.get(s.id) && (t.id === s.id || w[p.get(t.id)] > 1) ? (T.add(e.id), d = {
+      id: JSON.stringify(["dependency-cycle", t.id, s.id]),
+      type: "dependency-cycle",
+      sourceId: t.id,
+      sourceTitle: t.title,
+      taskId: s.id,
+      taskTitle: s.title,
+      message: `${t.title} → ${s.title} 属于循环依赖，需先移除环内关系`
+    }) : d = $(t, s), d && (r.push(d), M.set(e.id, d));
+  }
+  const m = /* @__PURE__ */ new Map();
+  for (const e of r)
+    for (const t of /* @__PURE__ */ new Set([
+      e.taskId,
+      ...e.sourceId !== void 0 && n.has(e.sourceId) ? [e.sourceId] : []
+    ])) {
+      const s = m.get(t);
+      s ? s.push(e) : m.set(t, [e]);
+    }
+  return { conflicts: r, byTask: m, byEdge: M, tasks: n, incident: a, cyclic: T };
+}
+function N(i, n, c, l) {
+  const o = i.tasks.get(n);
+  if (!o) return [];
+  const r = {
+    ...o,
+    s: c,
+    e: l,
+    start: h(c),
+    end: h(l)
+  };
+  return (i.incident.get(n) ?? []).flatMap((a) => {
+    if (i.cyclic.has(a.id)) return [];
+    const u = a.sourceId === n ? r : i.tasks.get(a.sourceId), y = a.targetId === n ? r : i.tasks.get(a.targetId), f = $(u, y);
+    return f ? [f] : [];
+  });
+}
+export {
+  D as analyzeGanttSchedule,
+  C as ganttEdgeKey,
+  x as parseGanttDay,
+  N as previewGanttConflicts
+};

package/dist/composables/numberInput.js

@@ -0,0 +1,91 @@
+const a = (n) => 10n ** BigInt(n);
+function B(n) {
+  if (typeof n != "string" && typeof n != "number" || typeof n == "number" && !Number.isFinite(n)) return;
+  const i = String(n).trim();
+  if (i.length > 2048) return;
+  const t = /^([+-]?)(?:(\d+)(?:\.(\d*))?|\.(\d+))(?:e([+-]?\d+))?$/i.exec(
+    i
+  );
+  if (!t) return;
+  const r = Number(t[5] ?? 0);
+  if (!Number.isInteger(r) || Math.abs(r) > 1e3) return;
+  const s = t[3] ?? t[4] ?? "", e = (t[2] ?? "0") + s;
+  let c = s.length - r, o = BigInt(e) * (t[1] === "-" ? -1n : 1n);
+  if (c < 0 && (o *= a(-c), c = 0), !(c > 1e3)) {
+    for (; c > 0 && o % 10n === 0n; )
+      o /= 10n, c--;
+    return { units: o, scale: c };
+  }
+}
+function b(n, i) {
+  const t = Math.max(n.scale, i.scale);
+  return {
+    a: n.units * a(t - n.scale),
+    b: i.units * a(t - i.scale),
+    scale: t
+  };
+}
+function h(n, i) {
+  const t = b(n, i);
+  return t.a === t.b ? 0 : t.a < t.b ? -1 : 1;
+}
+function D(n, i, t = 1) {
+  const r = b(n, i);
+  return {
+    units: r.a + r.b * BigInt(Math.trunc(t)),
+    scale: r.scale
+  };
+}
+function w(n, i) {
+  const t = Math.max(0, Math.min(100, Math.floor(i)));
+  if (n.scale <= t) return n;
+  const r = a(n.scale - t), s = n.units < 0n, e = s ? -n.units : n.units;
+  return {
+    units: (e / r + (e % r * 2n >= r ? 1n : 0n)) * (s ? -1n : 1n),
+    scale: t
+  };
+}
+function N(n, i) {
+  const t = n.units < 0n, r = t ? -n.units : n.units;
+  let s = r.toString().padStart(n.scale + 1, "0"), e = n.scale ? s.slice(0, -n.scale) + "." + s.slice(-n.scale) : s;
+  if (e.includes(".") && (e = e.replace(/\.?0+$/, "")), i !== void 0 && i > 0) {
+    const c = e.split(".");
+    e = c[0] + "." + (c[1] ?? "").padEnd(Math.min(100, i), "0");
+  }
+  return (t && r !== 0n ? "-" : "") + e;
+}
+function M(n, i) {
+  const t = n / i;
+  return n < 0n && n % i !== 0n ? t - 1n : t;
+}
+function y(n, i) {
+  return -M(-n, i);
+}
+function S(n, i) {
+  const { step: t, base: r, min: s, max: e } = i;
+  if (s && e && h(s, e) > 0) return;
+  let c = i.precision === void 0 ? n : w(n, i.precision);
+  if (i.strict) {
+    const o = Math.max(
+      c.scale,
+      t.scale,
+      r.scale,
+      (s == null ? void 0 : s.scale) ?? 0,
+      (e == null ? void 0 : e.scale) ?? 0
+    ), I = c.units * a(o - c.scale), u = t.units * a(o - t.scale), m = r.units * a(o - r.scale), g = I - m, p = g < 0n, x = p ? -g : g;
+    let l = (x / u + (x % u * 2n >= u ? 1n : 0n)) * (p ? -1n : 1n);
+    const f = s ? y(s.units * a(o - s.scale) - m, u) : void 0, d = e ? M(e.units * a(o - e.scale) - m, u) : void 0;
+    if (f !== void 0 && d !== void 0 && f > d) return;
+    f !== void 0 && l < f && (l = f), d !== void 0 && l > d && (l = d), c = { units: m + l * u, scale: o };
+  } else
+    s && h(c, s) < 0 && (c = s), e && h(c, e) > 0 && (c = e);
+  return c;
+}
+export {
+  B as decimal,
+  D as decimalAdd,
+  h as decimalCompare,
+  w as decimalRound,
+  N as decimalText,
+  S as normalizeDecimal
+};

package/dist/composables/rating.js

@@ -0,0 +1,16 @@
+function N(e, i, c, m, n) {
+  if (Array.isArray(e))
+    return e[i <= c ? 0 : i >= m ? 2 : 1] ?? e.at(-1) ?? n;
+  if (!e || typeof e != "object") return n;
+  const y = Object.entries(e).filter(([t]) => Number.isFinite(Number(t))).sort((t, r) => Number(t[0]) - Number(r[0]));
+  let u = n;
+  for (const [t, r] of y) {
+    const o = r && typeof r == "object" && "value" in r && ("excluded" in r || Object.keys(r).every((f) => f === "value")), b = o ? r.value : r;
+    if (u = b, i < Number(t) || i === Number(t) && !(o && r.excluded))
+      return b;
+  }
+  return u;
+}
+export {
+  N as ratingLevel
+};

package/dist/composables/selectOptions.js

@@ -0,0 +1,54 @@
+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
+      );
+      return o != null && typeof o != "object" ? "object:" + typeof o + ":" + String(o) : (s.has(n) || s.set(n, ++r), "reference:" + s.get(n));
+    }
+    return typeof e + ":" + String(e);
+  };
+}
+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] ?? "");
+      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 + ".");
+        return;
+      }
+      const c = t[u];
+      if (c == null || !["string", "number", "boolean", "object"].includes(typeof c))
+        return;
+      const y = s(c);
+      n.has(y) || (n.add(y), e.push({
+        key: y,
+        option: {
+          ...t,
+          value: c,
+          label: f,
+          disabled: j
+        },
+        group: d,
+        index: l++
+      }));
+    });
+  }
+  return p(a), e;
+}
+export {
+  z as normalizeSelectOptions,
+  W as selectKeyFactory
+};

package/dist/composables/table.js

@@ -0,0 +1,150 @@
+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];
+  }
+  return o;
+}
+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))
+        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
+      ) : void 0;
+      return b && !b.length ? [] : [{ ...d, fixed: v, children: b }];
+    });
+  }
+  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 }] : [];
+      }
+      return i.fixed === u ? [i] : [];
+    });
+  }
+  const f = [
+    ...a(t, "left"),
+    ...a(t),
+    ...a(t, "right")
+  ];
+  function m(y) {
+    return y.flatMap((u) => u.children ? m(u.children) : [u]);
+  }
+  function l(y) {
+    return Math.max(
+      1,
+      ...y.map((u) => u.children ? 1 + l(u.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);
+    }
+  }
+  return x(f, 0), { leaves: m(f), headers: h };
+}
+function F(n, r) {
+  const s = new Intl.Collator("zh-CN", {
+    numeric: !0,
+    sensitivity: "base"
+  }), o = n.flatMap((e) => {
+    const t = r.find((a) => a.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;
+        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 = 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;
+      }
+    }
+    return 0;
+  };
+}
+function w(n, r) {
+  var o;
+  const s = /* @__PURE__ */ new Map();
+  for (const e of r) {
+    const t = n[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);
+    }
+    s.set(e.key, a);
+  }
+  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(
+        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())
+    ) : !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()));
+  }
+  return r;
+}
+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)) : "";
+}
+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
+};