hys-ui 0.1.0 → 0.2.0

package/dist/composables/useTreeSelect.js

@@ -0,0 +1,361 @@
+import { ref as G, shallowRef as R, computed as f, watch as J, nextTick as Me, toRaw as de, onDeactivated as Se, onBeforeUnmount as we, onActivated as Ce } from "vue";
+import { useTree as Ae } from "./useTree.js";
+import { treeLocale as Ne, treeKeys as j, treeKey as W, treeField as Te } from "./tree.js";
+import { treeSelectFields as Ee, treeSelectForest as Pe, selectTreeIndex as De } from "./treeSelect.js";
+const ie = (l, s) => l.length === s.length && l.every((x, i) => x === s[i]), re = (l) => j(
+  (Array.isArray(l) ? l : l == null ? [] : [l]).flatMap(
+    (s) => W(s) ? s === "" ? [] : [s] : s && typeof s == "object" && W(s.value) ? [s.value] : []
+  )
+);
+function Oe(l, s, x, i, oe) {
+  const k = G(!0), X = R(l.defaultValue ?? null), Y = G(l.defaultSearchValue ?? ""), O = R(), V = G(!1), T = R(), Z = R(/* @__PURE__ */ new Map()), E = f(
+    () => l.modelValue === void 0 ? X.value : l.modelValue
+  ), h = f(() => re(E.value)), K = f(
+    () => !!l.multiple || !!l.checkable || Array.isArray(E.value)
+  ), P = f(() => l.searchValue ?? Y.value), y = f(
+    () => !k.value || s.value || !!l.readonly || !!l.loading
+  ), _ = f(() => Ee(l)), $ = f(
+    () => Pe(O.value ?? l.nodes, l)
+  ), L = f(() => {
+    var e, t, a, n;
+    return {
+      ...Ne,
+      ...l.locale,
+      search: l.searchPlaceholder ?? ((e = l.locale) == null ? void 0 : e.search) ?? "搜索节点",
+      empty: l.emptyText ?? ((t = l.locale) == null ? void 0 : t.empty) ?? "暂无节点",
+      noMatch: l.noMatchText ?? ((a = l.locale) == null ? void 0 : a.noMatch) ?? "无匹配节点",
+      loading: l.loadingText ?? ((n = l.locale) == null ? void 0 : n.loading) ?? "加载中"
+    };
+  }), q = (e) => typeof l.nodeKey == "function" ? l.nodeKey(e) : Te(
+    e,
+    typeof l.nodeKey == "string" ? l.nodeKey : _.value.id
+  ), v = (e) => $.value.raw.get(q(e)) ?? e, fe = f(() => {
+    const e = l.loadChildren;
+    return e ? (t, a) => e(v(t), a) : void 0;
+  }), he = {
+    get nodes() {
+      return $.value.nodes;
+    },
+    get modelValue() {
+      return K.value ? h.value : h.value[0] ?? null;
+    },
+    get checkedKeys() {
+      return l.checkable ? h.value : [];
+    },
+    get multiple() {
+      return K.value;
+    },
+    get checkable() {
+      return l.checkable;
+    },
+    get checkStrictly() {
+      return l.checkStrictly;
+    },
+    get fieldNames() {
+      return _.value;
+    },
+    get nodeKey() {
+      return l.nodeKey;
+    },
+    inheritDisabled: !0,
+    get searchValue() {
+      return P.value;
+    },
+    get filterNode() {
+      return l.remote ? () => !0 : l.filterNode ? (e, t) => l.filterNode(e, v(t)) : void 0;
+    },
+    get filterMode() {
+      return l.filterMode;
+    },
+    get showMatchedChildren() {
+      return l.showMatchedChildren;
+    },
+    get expandedKeys() {
+      return l.expandedKeys;
+    },
+    get defaultExpandedKeys() {
+      return l.defaultExpandedKeys;
+    },
+    get defaultExpandAll() {
+      return l.defaultExpandAll ?? !0;
+    },
+    get autoExpandParent() {
+      return l.autoExpandParent;
+    },
+    get accordion() {
+      return l.accordion;
+    },
+    get loadedKeys() {
+      return l.loadedKeys;
+    },
+    get loadChildren() {
+      return fe.value;
+    },
+    get locale() {
+      return L.value;
+    }
+  }, se = f(() => y.value || V.value), d = Ae(
+    he,
+    se,
+    (e, ...t) => {
+      if (e === "select") {
+        const [a, n] = t;
+        M(
+          n.selectedKeys,
+          "select",
+          v(a),
+          n.event
+        ).then((u) => {
+          u && i(
+            n.selected ? "select" : "deselect",
+            q(a),
+            v(a),
+            n
+          );
+        });
+      } else if (e === "check") {
+        const [a, n] = t;
+        M(
+          D(a),
+          "check",
+          n.node ? v(n.node) : void 0,
+          n.event,
+          void 0,
+          n.halfCheckedKeys
+        );
+      } else e === "check-change" ? i("check", {
+        ...t[0],
+        node: t[0].node ? v(t[0].node) : void 0,
+        checkedNodes: t[0].checkedNodes.map(v),
+        halfCheckedNodes: t[0].halfCheckedNodes.map(v)
+      }) : e === "update:searchValue" ? ne(t[0]) : [
+        "update:expandedKeys",
+        "update:loadedKeys",
+        "node-expand",
+        "node-collapse",
+        "load-error",
+        "children-loaded",
+        "load"
+      ].includes(e) && (e === "load-error" || e === "children-loaded" || e === "load" ? i(e, { ...t[0], node: v(t[0].node) }) : e === "node-expand" || e === "node-collapse" ? i(e, v(t[0]), t[1]) : i(e, ...t));
+    },
+    () => {
+    },
+    { loadActive: x }
+  ), p = f(
+    () => De(l.cacheData ?? [], l)
+  );
+  function H(e) {
+    const t = /* @__PURE__ */ new Map();
+    for (const a of Array.isArray(e) ? e : [e])
+      a && typeof a == "object" && !Array.isArray(a) && W(a.value) && t.set(a.value, a);
+    return t;
+  }
+  const ee = f(() => H(E.value)), B = (e) => ee.value.get(e);
+  function m(e) {
+    const t = d.index.value.map.get(e) ?? p.value.map.get(e), a = Z.value.get(e), n = B(e);
+    return {
+      value: e,
+      label: (n == null ? void 0 : n.label) ?? (t == null ? void 0 : t.label) ?? (a == null ? void 0 : a.label) ?? String(e),
+      node: t ? v(t.node) : a == null ? void 0 : a.node,
+      disabled: !!(t != null && t.disabled || l.checkable && t && (t.checkboxDisabled || !t.checkable) || n != null && n.disabled || (n == null ? void 0 : n.disabled) === void 0 && (a != null && a.disabled) && !t),
+      missing: !d.index.value.map.has(e)
+    };
+  }
+  J(
+    [h, d.index, p],
+    () => {
+      const e = /* @__PURE__ */ new Map();
+      for (const t of h.value) e.set(t, m(t));
+      Z.value = e;
+    },
+    { immediate: !0 }
+  );
+  function D(e) {
+    if (!l.checkable) return j(e);
+    const t = new Set(e), a = l.leafOnly ? "child" : l.checkStrictly ? "all" : l.showCheckedStrategy ?? "child";
+    return j(e).filter((n) => {
+      const u = d.index.value.map.get(n);
+      if (!u || m(n).disabled) return !0;
+      if (a === "child") return !u.children.length;
+      if (a === "parent") {
+        let r = u.parent;
+        for (; r !== void 0; ) {
+          const c = d.index.value.map.get(r);
+          if (!c || c.checkboxDisabled || !c.checkable) break;
+          if (t.has(r)) return !1;
+          r = c.parent;
+        }
+      }
+      return !0;
+    });
+  }
+  const le = f(
+    () => l.checkable ? D([...d.checked.value]) : h.value
+  ), ve = f(() => le.value.map(m)), te = f(() => y.value || V.value);
+  let ae = 0, Q = 0;
+  function me(e, t) {
+    const a = t === void 0 ? ee.value : H(t), n = e.map(
+      (u) => {
+        var r;
+        return l.labelInValue ? {
+          value: u,
+          label: ((r = a.get(u)) == null ? void 0 : r.label) ?? m(u).label
+        } : u;
+      }
+    );
+    return K.value ? n : n[0] ?? (l.clearValue !== void 0 ? l.clearValue : l.labelInValue ? null : "");
+  }
+  async function M(e, t, a, n, u, r) {
+    if (y.value) return !1;
+    let c = j(e);
+    K.value || (c = c.slice(0, 1));
+    const g = new Set(c), xe = new Set(h.value);
+    for (const o of K.value ? h.value : [])
+      m(o).disabled && !g.has(o) && (c.push(o), g.add(o));
+    const z = Number.isFinite(l.multipleLimit) ? Math.max(0, Math.floor(l.multipleLimit)) : 0;
+    if (K.value && z && c.length > z && c.some((o) => !xe.has(o)))
+      return i("limit", z), !1;
+    const C = me(c, u), b = l.labelInValue ? H(C) : void 0, ke = !!l.labelInValue && c.some(
+      (o) => {
+        var A, N;
+        return ((A = b == null ? void 0 : b.get(o)) == null ? void 0 : A.label) !== ((N = B(o)) == null ? void 0 : N.label);
+      }
+    );
+    if (ie(c, h.value) && !ke) return !1;
+    const Ke = ++ae, Ve = Q;
+    l.modelValue === void 0 && (X.value = C);
+    const ue = {
+      reason: t,
+      node: a,
+      values: c,
+      items: c.map((o) => ({
+        ...m(o),
+        ...b != null && b.has(o) ? { label: b.get(o).label } : {}
+      })),
+      halfCheckedKeys: r ?? d.getHalfCheckedKeys(),
+      event: n
+    };
+    return i("update:modelValue", C), i("change", C, ue), await Me(), !k.value || y.value || Ve !== Q || Ke !== ae || !ie(c, h.value) || l.labelInValue && c.some(
+      (o) => {
+        var A, N;
+        return de((A = b == null ? void 0 : b.get(o)) == null ? void 0 : A.label) !== de((N = B(o)) == null ? void 0 : N.label);
+      }
+    ) ? !1 : (i("value-change", C, {
+      ...ue,
+      items: c.map(m),
+      halfCheckedKeys: d.getHalfCheckedKeys()
+    }), l.validateEvent !== !1 && oe(), !0);
+  }
+  function be() {
+    return M(
+      h.value.filter((e) => m(e).disabled),
+      "clear"
+    ).then((e) => (e && i("clear"), e));
+  }
+  function ye(e) {
+    if (y.value || l.removable === !1 || m(e).disabled)
+      return Promise.resolve(!1);
+    let t = h.value.filter((a) => a !== e);
+    if (l.checkable && !l.checkStrictly && d.index.value.map.has(e)) {
+      const a = new Set(d.checked.value), n = [e];
+      for (; n.length; ) {
+        const u = n.pop(), r = d.index.value.map.get(u);
+        if (!(!r || r.checkboxDisabled || !r.checkable)) {
+          a.delete(u);
+          for (const c of r.children) n.push(c);
+        }
+      }
+      for (const u of d.ancestors(e)) a.delete(u);
+      t = D([...a]);
+    }
+    return M(t, "remove", m(e).node).then((a) => (a && i("remove-tag", e, m(e).node), a));
+  }
+  function ge(e, t) {
+    return te.value || e.disabled ? Promise.resolve(!1) : l.checkable ? !e.checkable || e.checkboxDisabled ? Promise.resolve(!1) : d.setChecked(
+      e.key,
+      !d.checked.value.has(e.key),
+      !l.checkStrictly,
+      t
+    ) : !e.selectable || l.leafOnly && e.hasChildren ? (e.hasChildren && d.expandNode(e.key, !d.expanded.value.has(e.key)), Promise.resolve(!1)) : d.selectNode(e, t);
+  }
+  function ne(e) {
+    y.value || (l.searchValue === void 0 && (Y.value = e), i("update:searchValue", e), i("search", e));
+  }
+  let S, I, w = 0;
+  function F() {
+    w++, clearTimeout(I), I = void 0, S == null || S.abort(), S = void 0, V.value = !1;
+  }
+  async function U(e = !1) {
+    if (F(), !x.value || y.value || !l.remote || !l.remoteMethod)
+      return;
+    const t = w, a = new AbortController(), n = l.remoteMethod, u = P.value;
+    S = a, T.value = void 0, V.value = !0;
+    const r = async () => {
+      I = void 0;
+      try {
+        const g = await n(u, { signal: a.signal });
+        if (a.signal.aborted || !k.value || t !== w || n !== l.remoteMethod || !x.value)
+          return;
+        if (g !== void 0) {
+          if (!Array.isArray(g))
+            throw new TypeError(
+              "remoteMethod must return an array or undefined"
+            );
+          O.value = g;
+        }
+        i("search-complete", u);
+      } catch (g) {
+        if (a.signal.aborted || !k.value || t !== w)
+          return;
+        T.value = g, i("search-error", g, u);
+      } finally {
+        t === w && (V.value = !1, S = void 0);
+      }
+    }, c = e ? 0 : Number.isFinite(l.debounce) ? Math.min(5e3, Math.max(0, l.debounce)) : 250;
+    c ? I = setTimeout(r, c) : await r();
+  }
+  J([P, () => l.remoteMethod, () => l.remote, x], () => {
+    l.remote ? U() : (F(), O.value = void 0, T.value = void 0);
+  }), J(
+    y,
+    (e) => {
+      e && F();
+    },
+    { flush: "sync" }
+  );
+  function ce() {
+    k.value = !1, Q++, F();
+  }
+  return Se(ce), we(ce), Ce(() => {
+    k.value = !0, x.value && U();
+  }), {
+    tree: d,
+    live: k,
+    current: E,
+    values: h,
+    multiple: K,
+    query: P,
+    items: ve,
+    displayKeys: le,
+    busy: te,
+    blocked: y,
+    words: L,
+    remotePending: V,
+    remoteError: T,
+    rawNode: v,
+    keyOf: q,
+    item: m,
+    pick: ge,
+    filter: ne,
+    clear: be,
+    removeTag: ye,
+    request: M,
+    project: D,
+    retrySearch: () => U(!0),
+    setValue: (e) => M(re(e), "api", void 0, void 0, e)
+  };
+}
+export {
+  re as treeSelectValueKeys,
+  Oe as useTreeSelect
+};

package/dist/config.js

@@ -1,21 +1,24 @@
-import { computed as s, toValue as i, inject as u, provide as r } from "vue";
-const n = Symbol("hys-ui-config");
-function f(e) {
-  const t = u(n, {});
-  r(n, { theme: e.theme ?? t.theme, motion: e.motion ?? t.motion });
+import { computed as a, toValue as s, provide as m, getCurrentInstance as i, inject as f } from "vue";
+const u = Symbol("hys-ui-config"), r = /* @__PURE__ */ new WeakMap();
+function h(t) {
+  const e = c(), n = { theme: t.theme ?? e.theme, motion: t.motion ?? e.motion };
+  m(u, n);
+  const o = i();
+  o && r.set(o, n);
 }
-function m() {
-  return u(n, {});
+function c() {
+  const t = i();
+  return t && r.get(t) || f(u, {});
 }
-function l() {
-  const e = m();
-  return s(() => {
-    const t = i(e.theme), o = i(e.motion);
-    return { "data-hys-ui": "", "data-hys-theme": t && ["blue", "dark", "green", "purple", "orange", "forest"].includes(t) ? t : "blue", "data-hys-motion": o && ["full", "subtle", "off"].includes(o) ? o : "subtle" };
+function d() {
+  const t = c();
+  return a(() => {
+    const e = s(t.theme), n = s(t.motion);
+    return { "data-hys-ui": "", "data-hys-theme": e && ["blue", "dark", "green", "purple", "orange", "forest"].includes(e) ? e : "blue", "data-hys-motion": n && ["full", "subtle", "off"].includes(n) ? n : "subtle" };
   });
 }
 export {
-  f as provideHysConfig,
-  m as useHysConfig,
-  l as useHysRootAttrs
+  h as provideHysConfig,
+  c as useHysConfig,
+  d as useHysRootAttrs
 };