hys-ui 0.1.0 → 0.2.0

package/dist/composables/textInput.js

@@ -0,0 +1,34 @@
+let f;
+function u(t) {
+  const n = Intl.Segmenter;
+  return n && (f ?? (f = new n(void 0, { granularity: "grapheme" })), f) ? Array.from(f.segment(t), (r) => r.segment) : Array.from(t);
+}
+function m(t, n) {
+  if (typeof n == "function")
+    try {
+      const r = n(t);
+      if (Number.isFinite(r) && r >= 0) return r;
+    } catch {
+    }
+  return n ? u(t).length : t.length;
+}
+function h(t, n, r) {
+  if (n === void 0 || m(t, r) <= n) return t;
+  const i = r ? u(t) : Array.from(t);
+  let e = 0, o = i.length;
+  for (; e < o; ) {
+    const c = Math.ceil((e + o) / 2);
+    m(i.slice(0, c).join(""), r) <= n ? e = c : o = c - 1;
+  }
+  return i.slice(0, e).join("");
+}
+function s(t) {
+  if (t === void 0 || t === "") return;
+  const n = Number(t);
+  return Number.isFinite(n) && n >= 0 ? Math.floor(n) : void 0;
+}
+export {
+  m as textCount,
+  s as textLengthLimit,
+  h as textLimit
+};

package/dist/composables/toastEscape.js

@@ -0,0 +1,16 @@
+const e = [];
+function i(t) {
+  if (t.key !== "Escape" || t.defaultPrevented) return;
+  const n = e.at(-1);
+  n && (t.preventDefault(), n.close());
+}
+function o(t) {
+  const n = { close: t };
+  return e.length || document.addEventListener("keydown", i), e.push(n), () => {
+    const s = e.indexOf(n);
+    s >= 0 && e.splice(s, 1), e.length || document.removeEventListener("keydown", i);
+  };
+}
+export {
+  o as registerToastEscape
+};

package/dist/composables/transfer.js

@@ -0,0 +1,63 @@
+const f = (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,
+    e
+  );
+}
+function d(e) {
+  var n, 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))
+      continue;
+    const i = {
+      key: r,
+      label: String(
+        l(o, ((s = e.fieldNames) == null ? void 0 : s.label) ?? "label") ?? r
+      ),
+      disabled: !!l(
+        o,
+        ((c = e.fieldNames) == null ? void 0 : c.disabled) ?? "disabled"
+      ),
+      option: o
+    };
+    a.push(i), t.set(i.key, i);
+  }
+  return { rows: a, map: t };
+}
+const u = (e) => ({
+  leftTitle: "待选择",
+  rightTitle: "已选择",
+  search: "筛选成员",
+  emptyLeft: "暂无待选成员",
+  emptyRight: "暂无已选成员",
+  noMatch: "无匹配成员",
+  loading: "加载中…",
+  selectAll: "全选{title}当前页",
+  invert: "反选当前页",
+  remove: "移除{label}",
+  moveRight: "添加选中项",
+  moveLeft: "移除选中项",
+  dragRight: "拖动到已选择区域",
+  dragLeft: "拖动到待选择区域",
+  dragCount: "正在拖动 {count} 项",
+  moved: "已{direction} {count} 项",
+  added: "移入",
+  removed: "移出",
+  firstPage: "首页",
+  previousPage: "上一页",
+  nextPage: "下一页",
+  lastPage: "末页",
+  perPage: "每页条数",
+  ...e
+}), g = (e, a) => e.replace(/\{(\w+)\}/g, (t, n) => String(a[n] ?? t));
+export {
+  g as transferLabel,
+  d as transferRows,
+  f as transferToken,
+  l as transferValue,
+  u as transferWords
+};

package/dist/composables/tree.js

@@ -0,0 +1,118 @@
+const j = {
+  search: "搜索节点…",
+  empty: "暂无数据",
+  noMatch: "无匹配节点",
+  loading: "加载中",
+  retry: "重试",
+  loadError: "加载失败",
+  expand: "展开",
+  collapse: "折叠",
+  check: "勾选",
+  select: "选择节点",
+  clear: "清除选择",
+  close: "关闭",
+  tree: "树形列表"
+}, m = (n) => typeof n == "string" || typeof n == "number" && Number.isFinite(n), L = (n) => [
+  ...new Set(n.filter(m))
+];
+function o(n, i) {
+  return i.split(".").reduce(
+    (a, t) => a != null && Object.prototype.hasOwnProperty.call(Object(a), t) ? a[t] : void 0,
+    n
+  );
+}
+function _(n, i, a) {
+  const t = i.split(".");
+  if (t.some((d) => ["__proto__", "constructor", "prototype"].includes(d)))
+    return n;
+  const b = { ...n };
+  let h = b, f = n;
+  for (const d of t.slice(0, -1)) {
+    const c = f == null ? void 0 : f[d];
+    h[d] = Array.isArray(c) ? [...c] : c && typeof c == "object" ? { ...c } : {}, h = h[d], f = c;
+  }
+  return h[t.at(-1)] = a, b;
+}
+function K(n) {
+  return {
+    id: "id",
+    label: "label",
+    children: "children",
+    disabled: "disabled",
+    disableCheckbox: "disableCheckbox",
+    selectable: "selectable",
+    checkable: "checkable",
+    icon: "icon",
+    hasChildren: "hasChildren",
+    isLeaf: "isLeaf",
+    ...n.fieldNames
+  };
+}
+function F(n, i, a = /* @__PURE__ */ new Map()) {
+  var y, g, k;
+  const t = K(i), b = /* @__PURE__ */ new Map(), h = [], f = [], d = [
+    { nodes: n }
+  ];
+  let c = !1;
+  for (; d.length; ) {
+    const l = d.pop(), s = [];
+    for (const e of l.nodes) {
+      if (!e || typeof e != "object") {
+        c = !0;
+        continue;
+      }
+      const r = typeof i.nodeKey == "function" ? i.nodeKey(e) : o(
+        e,
+        typeof i.nodeKey == "string" ? i.nodeKey : t.id
+      );
+      if (!m(r) || b.has(r)) {
+        c = !0;
+        continue;
+      }
+      const p = a.get(r) ?? o(e, t.children), C = Array.isArray(p) ? p : [], x = !!o(e, t.disabled) || !!(i.inheritDisabled && ((y = l.parent) != null && y.disabled)), w = o(e, t.isLeaf) === !0, A = {
+        key: r,
+        node: e,
+        label: String(o(e, t.label) ?? r),
+        parent: (g = l.parent) == null ? void 0 : g.key,
+        children: [],
+        depth: l.parent ? l.parent.depth + 1 : 0,
+        index: 0,
+        pos: s.length + 1,
+        size: 0,
+        disabled: x,
+        checkboxDisabled: x || !!o(e, t.disableCheckbox),
+        checkable: o(e, t.checkable) !== !1,
+        selectable: o(e, t.selectable) !== !1,
+        leaf: w,
+        hasChildren: !w && !!(C.length || !a.has(r) && o(e, t.hasChildren)),
+        icon: o(e, t.icon)
+      };
+      b.set(r, A), s.push(A), (((k = l.parent) == null ? void 0 : k.children) ?? f).push(r);
+    }
+    for (const e of s) e.size = s.length;
+    for (let e = s.length - 1; e >= 0; e--) {
+      const r = s[e], p = a.get(r.key) ?? o(r.node, t.children);
+      d.push({
+        nodes: r.leaf ? [] : Array.isArray(p) ? p : [],
+        parent: r
+      });
+    }
+  }
+  const u = [...f].reverse();
+  for (; u.length; ) {
+    const l = b.get(u.pop());
+    l.index = h.length, h.push(l);
+    for (let s = l.children.length - 1; s >= 0; s--)
+      u.push(l.children[s]);
+  }
+  return { map: b, rows: h, roots: f, fields: t, invalid: c };
+}
+export {
+  _ as treeAssign,
+  o as treeField,
+  K as treeFields,
+  F as treeIndex,
+  m as treeKey,
+  L as treeKeys,
+  j as treeLocale
+};

package/dist/composables/treeSelect.js

@@ -0,0 +1,71 @@
+import { treeField as y, treeKey as g, treeAssign as I, treeIndex as k } from "./tree.js";
+function v(s) {
+  const { value: i, ...r } = s.fieldNames ?? {};
+  return { id: i ?? "value", ...r };
+}
+function b(s, i) {
+  const r = /* @__PURE__ */ new Map();
+  if (!i.simpleMode) return { nodes: s, raw: r };
+  const c = typeof i.simpleMode == "object" ? i.simpleMode : {}, m = v(i), w = c.id ?? "id", K = c.parentId ?? "parentId", M = m.children ?? "children", d = /* @__PURE__ */ new Map();
+  for (const e of s) {
+    const n = y(e, w);
+    if (!g(n) || d.has(n)) continue;
+    const t = y(e, K), o = typeof i.nodeKey == "function" ? i.nodeKey(e) : y(
+      e,
+      typeof i.nodeKey == "string" ? i.nodeKey : m.id
+    );
+    g(o) && r.set(o, e), d.set(n, {
+      node: e,
+      parent: g(t) && t !== c.rootParentId && t !== n ? t : void 0,
+      children: []
+    });
+  }
+  const a = /* @__PURE__ */ new Set();
+  for (const e of d.keys()) {
+    if (a.has(e)) continue;
+    const n = [], t = /* @__PURE__ */ new Map();
+    let o = e;
+    for (; o !== void 0 && d.has(o) && !a.has(o) && !t.has(o); )
+      t.set(o, n.length), n.push(o), o = d.get(o).parent;
+    if (o !== void 0 && t.has(o))
+      for (const u of n.slice(t.get(o)))
+        d.get(u).parent = void 0;
+    for (const u of n) a.add(u);
+  }
+  const l = [];
+  for (const [e, n] of d) {
+    const t = n.parent === void 0 ? void 0 : d.get(n.parent);
+    t ? t.children.push(e) : l.push(e);
+  }
+  const f = [], h = [...l].reverse();
+  for (; h.length; ) {
+    const e = h.pop();
+    f.push(e);
+    const n = d.get(e).children;
+    for (let t = n.length - 1; t >= 0; t--) h.push(n[t]);
+  }
+  const p = /* @__PURE__ */ new Map();
+  for (let e = f.length - 1; e >= 0; e--) {
+    const n = f[e], t = d.get(n);
+    p.set(
+      n,
+      I(
+        t.node,
+        M,
+        t.children.map((o) => p.get(o))
+      )
+    );
+  }
+  return { nodes: l.map((e) => p.get(e)), raw: r };
+}
+const x = (s, i) => k(s, {
+  nodes: s,
+  fieldNames: v(i),
+  nodeKey: i.nodeKey,
+  inheritDisabled: !0
+});
+export {
+  x as selectTreeIndex,
+  v as treeSelectFields,
+  b as treeSelectForest
+};