@yqg/permission 1.3.0 → 1.3.1-1.bate.1

package/dist/{category-selector-BnUMBDty.js → category-selector-3bIJ-OEr.js}

@@ -1,7 +1,7 @@
-import { a as ht, p as pt, d as Ve, r as fe, c as y, w as be, q as mt, s as M, E as ae, e as U, b as Ge, y as oe, $ as gt, G as yt, K as ie, L as Ze, M as Me, N as Be, R as ye, u as W, P as we, F as bt, Y as Ct, f as St, U as et, z as wt } from "./index-XvlOgi6s.js";
-import { a as X, _ as b, W as xt, X as Vt, ae as ut, aX as tt, Y as Ie, P as ve, N as It, R as it, V as kt, aN as $e, $ as Nt, ar as Tt, as as Lt, aY as Et, c as at, b as _t, ak as je, aj as Pt, a0 as Dt, ai as At, am as We, aU as Kt, aP as xe, aS as Ft } from "./yqg-permission-BrOMv4sA.js";
-import { u as Ot, a as Ht, b as Rt, c as Mt, d as Bt, t as lt, B as $t, e as jt, f as Wt, g as Ut } from "./index-CAVNFmBo.js";
-import { K as de, T as zt, c as Xt, a as Xe, u as Yt, g as qt, b as Gt, d as Jt, F as Qt, e as Zt, f as ea, r as ta, h as aa, i as la } from "./apply-modal-Ct9rKeUf.js";
+import { a as ht, p as pt, d as Ve, r as fe, c as y, w as be, q as mt, s as R, E as ae, e as U, b as Ge, y as oe, a0 as gt, G as yt, K as Ze, R as et, L as ie, M as Re, P as je, N as we, S as ye, u as W, F as bt, Y as Ct, j as St, z as wt } from "./index-Cnz2SLUX.js";
+import { a as X, _ as b, W as xt, X as Vt, ae as ut, aX as tt, Y as Ie, P as ve, N as It, Q as it, V as kt, aN as Be, a0 as Nt, ar as Tt, as as Lt, aY as Et, c as at, b as _t, ai as $e, ak as We, am as Pt, $ as Dt, aj as At, aV as Kt, aP as xe, aS as Ft } from "./yqg-permission-BPhYJ3ps.js";
+import { u as Ot, a as Ht, b as Mt, c as Rt, d as jt, t as lt, B as Bt, e as $t, f as Wt, g as Ut } from "./index-qdB6FW1K.js";
+import { K as de, T as zt, c as Xt, a as Xe, u as Yt, g as qt, b as Gt, d as Qt, F as Jt, e as Zt, f as ea, r as ta, h as aa, i as la } from "./apply-modal-BFzYTq8s.js";
 function na(e) {
   return Array.isArray(e) ? e : e !== void 0 ? [e] : [];
 }
@@ -24,10 +24,10 @@ function Ye(e) {
 function ra(e, s) {
   const l = [];
   function t(a) {
-    a.forEach((n) => {
-      l.push(n[s.value]);
-      const o = n[s.children];
-      o && t(o);
+    a.forEach((o) => {
+      l.push(o[s.value]);
+      const n = o[s.children];
+      n && t(n);
     });
   }
   return t(e), l;
@@ -62,12 +62,12 @@ const ua = {
       slots: l,
       expose: t
     } = s;
-    const a = Ot(), n = Ht(), o = ca(), r = fe(), d = Rt(() => o.treeData, [() => a.open, () => o.treeData], (v) => v[0]), c = y(() => {
+    const a = Ot(), o = Ht(), n = ca(), r = fe(), d = Mt(() => n.treeData, [() => a.open, () => n.treeData], (v) => v[0]), c = y(() => {
       const {
         checkable: v,
         halfCheckedKeys: V,
         checkedKeys: E
-      } = n;
+      } = o;
       return v ? {
         checked: E,
         halfChecked: V
@@ -76,23 +76,23 @@ const ua = {
     be(() => a.open, () => {
       mt(() => {
         var v;
-        a.open && !a.multiple && n.checkedKeys.length && ((v = r.value) === null || v === void 0 || v.scrollTo({
-          key: n.checkedKeys[0]
+        a.open && !a.multiple && o.checkedKeys.length && ((v = r.value) === null || v === void 0 || v.scrollTo({
+          key: o.checkedKeys[0]
         }));
       });
     }, {
       immediate: !0,
       flush: "post"
     });
-    const u = y(() => String(a.searchValue).toLowerCase()), f = (v) => u.value ? String(v[n.treeNodeFilterProp]).toLowerCase().includes(u.value) : !1, p = M(n.treeDefaultExpandedKeys), w = M(null);
+    const u = y(() => String(a.searchValue).toLowerCase()), f = (v) => u.value ? String(v[o.treeNodeFilterProp]).toLowerCase().includes(u.value) : !1, p = R(o.treeDefaultExpandedKeys), w = R(null);
     be(() => a.searchValue, () => {
-      a.searchValue && (w.value = ra(ae(o.treeData), ae(o.fieldNames)));
+      a.searchValue && (w.value = ra(ae(n.treeData), ae(n.fieldNames)));
     }, {
       immediate: !0
     });
-    const x = y(() => n.treeExpandedKeys ? n.treeExpandedKeys.slice() : a.searchValue ? w.value : p.value), S = (v) => {
+    const x = y(() => o.treeExpandedKeys ? o.treeExpandedKeys.slice() : a.searchValue ? w.value : p.value), S = (v) => {
       var V;
-      p.value = v, w.value = v, (V = n.onTreeExpand) === null || V === void 0 || V.call(n, v);
+      p.value = v, w.value = v, (V = o.onTreeExpand) === null || V === void 0 || V.call(o, v);
     }, g = (v) => {
       v.preventDefault();
     }, F = (v, V) => {
@@ -103,11 +103,11 @@ const ua = {
       const {
         checkable: z,
         checkedKeys: Y
-      } = n;
-      z && Ye(E) || ((D = o.onSelect) === null || D === void 0 || D.call(o, E.key, {
+      } = o;
+      z && Ye(E) || ((D = n.onSelect) === null || D === void 0 || D.call(n, E.key, {
         selected: !Y.includes(E.key)
       }), a.multiple || (T = a.toggleOpen) === null || T === void 0 || T.call(a, !1));
-    }, A = fe(null), K = y(() => n.keyEntities[A.value]), O = (v) => {
+    }, A = fe(null), K = y(() => o.keyEntities[A.value]), O = (v) => {
       A.value = v;
     };
     return t({
@@ -138,7 +138,7 @@ const ua = {
                 node: {
                   key: A.value
                 },
-                selected: !n.checkedKeys.includes(T)
+                selected: !o.checkedKeys.includes(T)
               });
             }
             break;
@@ -159,11 +159,11 @@ const ua = {
         notFoundContent: z = (v = l.notFoundContent) === null || v === void 0 ? void 0 : v.call(l)
       } = a, {
         listHeight: Y,
-        listItemHeight: B,
+        listItemHeight: j,
         virtual: le,
         dropdownMatchSelectWidth: q,
         treeExpandAction: re
-      } = o, {
+      } = n, {
         checkable: se,
         treeDefaultExpandAll: ce,
         treeIcon: ne,
@@ -175,17 +175,17 @@ const ua = {
         treeMotion: C,
         onTreeLoad: _,
         checkedKeys: H
-      } = n;
+      } = o;
       if (d.value.length === 0)
         return U("div", {
           role: "listbox",
           class: `${V}-empty`,
           onMousedown: g
         }, [z]);
-      const J = {
-        fieldNames: o.fieldNames
+      const Q = {
+        fieldNames: n.fieldNames
       };
-      return ue && (J.loadedKeys = ue), x.value && (J.expandedKeys = x.value), U("div", {
+      return ue && (Q.loadedKeys = ue), x.value && (Q.expandedKeys = x.value), U("div", {
         onMousedown: g
       }, [K.value && T && U("span", {
         style: ua,
@@ -196,7 +196,7 @@ const ua = {
         prefixCls: `${V}-tree`,
         treeData: d.value,
         height: Y,
-        itemHeight: B,
+        itemHeight: j,
         virtual: le !== !1 && q !== !1,
         multiple: E,
         icon: ne,
@@ -211,7 +211,7 @@ const ua = {
         checkedKeys: c.value,
         selectedKeys: se ? [] : H,
         defaultExpandAll: ce
-      }, J), {}, {
+      }, Q), {}, {
         onActiveChange: O,
         onSelect: F,
         onCheck: F,
@@ -220,28 +220,28 @@ const ua = {
         filterTreeNode: f,
         expandAction: re
       }), b(b({}, l), {
-        checkable: n.customSlots.treeCheckable
+        checkable: o.customSlots.treeCheckable
       }))]);
     };
   }
-}), da = "SHOW_ALL", vt = "SHOW_PARENT", Je = "SHOW_CHILD";
+}), da = "SHOW_ALL", vt = "SHOW_PARENT", Qe = "SHOW_CHILD";
 function ot(e, s, l, t) {
   const a = new Set(e);
-  return s === Je ? e.filter((n) => {
-    const o = l[n];
-    return !(o && o.children && o.children.some((r) => {
+  return s === Qe ? e.filter((o) => {
+    const n = l[o];
+    return !(n && n.children && n.children.some((r) => {
       let {
         node: d
       } = r;
       return a.has(d[t.value]);
-    }) && o.children.every((r) => {
+    }) && n.children.every((r) => {
       let {
         node: d
       } = r;
       return Ye(d) || a.has(d[t.value]);
     }));
-  }) : s === vt ? e.filter((n) => {
-    const o = l[n], r = o ? o.parent : null;
+  }) : s === vt ? e.filter((o) => {
+    const n = l[o], r = n ? n.parent : null;
     return !(r && !Ye(r.node) && a.has(r.key));
   }) : e;
 }
@@ -263,7 +263,7 @@ function ha(e) {
   function s() {
     let l = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : [];
     return xt(l).map((t) => {
-      var a, n, o;
+      var a, o, n;
       if (!fa(t))
         return null;
       const r = t.children || {}, d = t.key, c = {};
@@ -283,8 +283,8 @@ function ha(e) {
         disableCheckbox: x || x === "" || void 0
       }, g = b(b({}, c), S), {
         title: F = (a = r.title) === null || a === void 0 ? void 0 : a.call(r, g),
-        switcherIcon: A = (n = r.switcherIcon) === null || n === void 0 ? void 0 : n.call(r, g)
-      } = c, K = va(c, ["title", "switcherIcon"]), O = (o = r.default) === null || o === void 0 ? void 0 : o.call(r), v = b(b(b({}, K), {
+        switcherIcon: A = (o = r.switcherIcon) === null || o === void 0 ? void 0 : o.call(r, g)
+      } = c, K = va(c, ["title", "switcherIcon"]), O = (n = r.default) === null || n === void 0 ? void 0 : n.call(r), v = b(b(b({}, K), {
         title: F,
         switcherIcon: A,
         key: d,
@@ -305,16 +305,16 @@ function qe(e) {
     }
   }), s;
 }
-function pa(e, s, l, t, a, n) {
-  let o = null, r = null;
+function pa(e, s, l, t, a, o) {
+  let n = null, r = null;
   function d() {
     function c(u) {
       let f = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : "0", p = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : !1;
       return u.map((w, x) => {
-        const S = `${f}-${x}`, g = w[n.value], F = l.includes(g), A = c(w[n.children] || [], S, F), K = U(he, w, {
+        const S = `${f}-${x}`, g = w[o.value], F = l.includes(g), A = c(w[o.children] || [], S, F), K = U(he, w, {
           default: () => [A.map((O) => O.node)]
         });
-        if (s === g && (o = K), F) {
+        if (s === g && (n = K), F) {
           const O = {
             pos: S,
             node: K,
@@ -345,7 +345,7 @@ function pa(e, s, l, t, a, n) {
   }
   Object.defineProperty(e, "triggerNode", {
     get() {
-      return d(), o;
+      return d(), n;
     }
   }), Object.defineProperty(e, "allCheckedNodes", {
     get() {
@@ -364,17 +364,17 @@ function ma(e, s) {
     pId: t,
     rootPId: a
   } = s;
-  const n = {}, o = [];
+  const o = {}, n = [];
   return e.map((d) => {
     const c = b({}, d), u = c[l];
-    return n[u] = c, c.key = c.key || u, c;
+    return o[u] = c, c.key = c.key || u, c;
   }).forEach((d) => {
-    const c = d[t], u = n[c];
-    u && (u.children = u.children || [], u.children.push(d)), (c === a || !u && a === null) && o.push(d);
-  }), o;
+    const c = d[t], u = o[c];
+    u && (u.children = u.children || [], u.children.push(d)), (c === a || !u && a === null) && n.push(d);
+  }), n;
 }
 function ga(e, s, l) {
-  const t = M();
+  const t = R();
   return be([l, e, s], () => {
     const a = l.value;
     e.value ? t.value = l.value ? ma(ae(e.value), b({
@@ -388,9 +388,9 @@ function ga(e, s, l) {
   }), t;
 }
 const ya = (e) => {
-  const s = M({
+  const s = R({
     valueLabels: /* @__PURE__ */ new Map()
-  }), l = M();
+  }), l = R();
   return be(e, () => {
     l.value = ae(e.value);
   }, {
@@ -398,37 +398,37 @@ const ya = (e) => {
   }), [y(() => {
     const {
       valueLabels: a
-    } = s.value, n = /* @__PURE__ */ new Map(), o = l.value.map((r) => {
+    } = s.value, o = /* @__PURE__ */ new Map(), n = l.value.map((r) => {
       var d;
       const {
         value: c
       } = r, u = (d = r.label) !== null && d !== void 0 ? d : a.get(c);
-      return n.set(c, u), b(b({}, r), {
+      return o.set(c, u), b(b({}, r), {
         label: u
       });
     });
-    return s.value.valueLabels = n, o;
+    return s.value.valueLabels = o, n;
   })];
 }, ba = (e, s) => {
-  const l = M(/* @__PURE__ */ new Map()), t = M({});
+  const l = R(/* @__PURE__ */ new Map()), t = R({});
   return Ge(() => {
-    const a = s.value, n = Xt(e.value, {
+    const a = s.value, o = Xt(e.value, {
       fieldNames: a,
-      initWrapper: (o) => b(b({}, o), {
+      initWrapper: (n) => b(b({}, n), {
         valueEntities: /* @__PURE__ */ new Map()
       }),
-      processEntity: (o, r) => {
-        const d = o.node[a.value];
-        r.valueEntities.set(d, o);
+      processEntity: (n, r) => {
+        const d = n.node[a.value];
+        r.valueEntities.set(d, n);
       }
     });
-    l.value = n.valueEntities, t.value = n.keyEntities;
+    l.value = o.valueEntities, t.value = o.keyEntities;
   }), {
     valueEntities: l,
     keyEntities: t
   };
-}, Ca = (e, s, l, t, a, n) => {
-  const o = M([]), r = M([]);
+}, Ca = (e, s, l, t, a, o) => {
+  const n = R([]), r = R([]);
   return Ge(() => {
     let d = e.value.map((f) => {
       let {
@@ -445,18 +445,18 @@ const ya = (e) => {
     l.value && ({
       checkedKeys: d,
       halfCheckedKeys: c
-    } = Xe(d, !0, t.value, a.value, n.value)), o.value = Array.from(/* @__PURE__ */ new Set([...u, ...d])), r.value = c;
-  }), [o, r];
+    } = Xe(d, !0, t.value, a.value, o.value)), n.value = Array.from(/* @__PURE__ */ new Set([...u, ...d])), r.value = c;
+  }), [n, r];
 }, Sa = (e, s, l) => {
   let {
     treeNodeFilterProp: t,
     filterTreeNode: a,
-    fieldNames: n
+    fieldNames: o
   } = l;
   return y(() => {
     const {
-      children: o
-    } = n.value, r = s.value, d = t == null ? void 0 : t.value;
+      children: n
+    } = o.value, r = s.value, d = t == null ? void 0 : t.value;
     if (!r || a.value === !1)
       return e.value;
     let c;
@@ -473,9 +473,9 @@ const ya = (e) => {
       let p = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : !1;
       const w = [];
       for (let x = 0, S = f.length; x < S; x++) {
-        const g = f[x], F = g[o], A = p || c(r, qe(g)), K = u(F || [], A);
+        const g = f[x], F = g[n], A = p || c(r, qe(g)), K = u(F || [], A);
         (A || K.length) && w.push(b(b({}, g), {
-          [o]: K
+          [n]: K
         }));
       }
       return w;
@@ -484,7 +484,7 @@ const ya = (e) => {
   });
 };
 function ft() {
-  return b(b({}, Ie(jt(), ["mode"])), {
+  return b(b({}, Ie($t(), ["mode"])), {
     prefixCls: String,
     id: String,
     value: {
@@ -633,7 +633,7 @@ const xa = Ve({
   props: ut(ft(), {
     treeNodeFilterProp: "value",
     autoClearSearchValue: !0,
-    showCheckedStrategy: Je,
+    showCheckedStrategy: Qe,
     listHeight: 200,
     listItemHeight: 20,
     prefixCls: "vc-tree-select"
@@ -644,7 +644,7 @@ const xa = Ve({
       expose: t,
       slots: a
     } = s;
-    const n = Mt(oe(e, "id")), o = y(() => e.treeCheckable && !e.treeCheckStrictly), r = y(() => e.treeCheckable || e.treeCheckStrictly), d = y(() => e.treeCheckStrictly || e.labelInValue), c = y(() => r.value || e.multiple), u = y(() => oa(e.fieldNames)), [f, p] = tt("", {
+    const o = Rt(oe(e, "id")), n = y(() => e.treeCheckable && !e.treeCheckStrictly), r = y(() => e.treeCheckable || e.treeCheckStrictly), d = y(() => e.treeCheckStrictly || e.labelInValue), c = y(() => r.value || e.multiple), u = y(() => oa(e.fieldNames)), [f, p] = tt("", {
       value: y(() => e.searchValue !== void 0 ? e.searchValue : e.inputValue),
       postState: (i) => i || ""
     }), w = (i) => {
@@ -698,7 +698,7 @@ const xa = Ve({
       };
     }), [V, E] = tt(e.defaultValue, {
       value: oe(e, "value")
-    }), D = y(() => O(V.value)), T = M([]), z = M([]);
+    }), D = y(() => O(V.value)), T = R([]), z = R([]);
     Ge(() => {
       const i = [], h = [];
       D.value.forEach((m) => {
@@ -706,12 +706,12 @@ const xa = Ve({
       }), T.value = i, z.value = h;
     });
     const Y = y(() => T.value.map((i) => i.value)), {
-      maxLevel: B,
+      maxLevel: j,
       levelEntities: le
-    } = Yt(S), [q, re] = Ca(T, z, o, S, B, le), se = y(() => {
+    } = Yt(S), [q, re] = Ca(T, z, n, S, j, le), se = y(() => {
       const m = ot(q.value, e.showCheckedStrategy, S.value, u.value).map((L) => {
-        var I, N, R;
-        return (R = (N = (I = S.value[L]) === null || I === void 0 ? void 0 : I.node) === null || N === void 0 ? void 0 : N[u.value.value]) !== null && R !== void 0 ? R : L;
+        var I, N, M;
+        return (M = (N = (I = S.value[L]) === null || I === void 0 ? void 0 : I.node) === null || N === void 0 ? void 0 : N[u.value.value]) !== null && M !== void 0 ? M : L;
       }).map((L) => {
         const I = T.value.find((N) => N.value === L);
         return {
@@ -729,7 +729,7 @@ const xa = Ve({
       const k = v(i);
       if (E(k), e.autoClearSearchValue && p(""), e.onChange) {
         let P = i;
-        o.value && (P = ot(i, e.showCheckedStrategy, S.value, u.value).map((te) => {
+        n.value && (P = ot(i, e.showCheckedStrategy, S.value, u.value).map((te) => {
           const Se = g.value.get(te);
           return Se ? Se.node[u.value.value] : te;
         }));
@@ -742,18 +742,18 @@ const xa = Ve({
         };
         let N = P;
         if (e.treeCheckStrictly) {
-          const j = z.value.filter((te) => !P.includes(te.value));
-          N = [...N, ...j];
+          const $ = z.value.filter((te) => !P.includes(te.value));
+          N = [...N, ...$];
         }
-        const R = v(N), Z = {
+        const M = v(N), Z = {
           // [Legacy] Always return as array contains label & value
           preValue: T.value,
           triggerValue: L
         };
         let ee = !0;
         (e.treeCheckStrictly || m === "selection" && !I) && (ee = !1), pa(Z, L, i, x.value, ee, u.value), r.value ? Z.checked = I : Z.selected = I;
-        const $ = d.value ? R : R.map((j) => j.value);
-        e.onChange(c.value ? $ : $[0], d.value ? null : R.map((j) => j.label), Z);
+        const B = d.value ? M : M.map(($) => $.value);
+        e.onChange(c.value ? B : B[0], d.value ? null : M.map(($) => $.label), Z);
       }
     }, G = (i, h) => {
       let {
@@ -761,35 +761,34 @@ const xa = Ve({
         source: k
       } = h;
       var P, L, I;
-      const N = ae(S.value), R = ae(g.value), Z = N[i], ee = Z == null ? void 0 : Z.node, $ = (P = ee == null ? void 0 : ee[u.value.value]) !== null && P !== void 0 ? P : i;
+      const N = ae(S.value), M = ae(g.value), Z = N[i], ee = Z == null ? void 0 : Z.node, B = (P = ee == null ? void 0 : ee[u.value.value]) !== null && P !== void 0 ? P : i;
       if (!c.value)
-        ne([$], {
+        ne([B], {
           selected: !0,
-          triggerValue: $
+          triggerValue: B
         }, "option");
       else {
-        let j = m ? [...Y.value, $] : q.value.filter((te) => te !== $);
-        if (o.value) {
+        let $ = m ? [...Y.value, B] : q.value.filter((te) => te !== B);
+        if (n.value) {
           const {
             missingRawValues: te,
             existRawValues: Se
-          } = F(j), Qe = Se.map((Re) => R.get(Re).key);
+          } = F($), Je = Se.map((Me) => M.get(Me).key);
           let He;
           m ? {
             checkedKeys: He
-          } = Xe(Qe, !0, N, B.value, le.value) : {
+          } = Xe(Je, !0, N, j.value, le.value) : {
             checkedKeys: He
-          } = Xe(Qe, {
-            checked: !1,
+          } = Xe(Je, {
             halfCheckedKeys: re.value
-          }, N, B.value, le.value), j = [...te, ...He.map((Re) => N[Re].node[u.value.value])];
+          }, N, j.value, le.value), $ = [...te, ...He.map((Me) => N[Me].node[u.value.value])];
         }
-        ne(j, {
+        ne($, {
           selected: m,
-          triggerValue: $
+          triggerValue: B
         }, k || "option");
       }
-      m || !c.value ? (L = e.onSelect) === null || L === void 0 || L.call(e, $, qe(ee)) : (I = e.onDeselect) === null || I === void 0 || I.call(e, $, qe(ee));
+      m || !c.value ? (L = e.onSelect) === null || L === void 0 || L.call(e, B, qe(ee)) : (I = e.onDeselect) === null || I === void 0 || I.call(e, B, qe(ee));
     }, pe = (i) => {
       if (e.onDropdownVisibleChange) {
         const h = {};
@@ -817,7 +816,7 @@ const xa = Ve({
       onTreeLoad: _,
       // Expanded
       treeDefaultExpandAll: H,
-      treeExpandedKeys: J,
+      treeExpandedKeys: Q,
       treeDefaultExpandedKeys: ke,
       onTreeExpand: Ne,
       // Options
@@ -834,7 +833,7 @@ const xa = Ve({
       dropdownMatchSelectWidth: Fe,
       treeExpandAction: Oe
     } = gt(e);
-    Bt(lt({
+    jt(lt({
       checkable: r,
       loadData: ue,
       treeLoadedKeys: C,
@@ -842,7 +841,7 @@ const xa = Ve({
       checkedKeys: q,
       halfCheckedKeys: re,
       treeDefaultExpandAll: H,
-      treeExpandedKeys: J,
+      treeExpandedKeys: Q,
       treeDefaultExpandedKeys: ke,
       onTreeExpand: Ne,
       treeIcon: Ce,
@@ -863,19 +862,19 @@ const xa = Ve({
       dropdownMatchSelectWidth: Fe,
       treeExpandAction: Oe
     }));
-    const Q = fe();
+    const J = fe();
     return t({
       focus() {
         var i;
-        (i = Q.value) === null || i === void 0 || i.focus();
+        (i = J.value) === null || i === void 0 || i.focus();
       },
       blur() {
         var i;
-        (i = Q.value) === null || i === void 0 || i.blur();
+        (i = J.value) === null || i === void 0 || i.blur();
       },
       scrollTo(i) {
         var h;
-        (h = Q.value) === null || h === void 0 || h.scrollTo(i);
+        (h = J.value) === null || h === void 0 || h.scrollTo(i);
       }
     }), () => {
       var i;
@@ -930,10 +929,10 @@ const xa = Ve({
         "switcherIcon",
         "treeMotion"
       ]);
-      return U($t, X(X(X({
-        ref: Q
+      return U(Bt, X(X(X({
+        ref: J
       }, l), h), {}, {
-        id: n,
+        id: o,
         prefixCls: e.prefixCls,
         mode: c.value ? "multiple" : void 0,
         displayValues: ce.value,
@@ -1009,18 +1008,18 @@ const rt = (e, s, l) => l !== void 0 ? l : `${e}-${s}`;
 function ka() {
   return b(b({}, Ie(ft(), ["showTreeIcon", "treeMotion", "inputIcon", "getInputElement", "treeLine", "customSlots"])), {
     suffixIcon: ve.any,
-    size: je(),
-    bordered: Pt(),
+    size: We(),
+    bordered: At(),
     treeLine: Dt([Boolean, Object]),
-    replaceFields: At(),
-    placement: je(),
-    status: je(),
+    replaceFields: Pt(),
+    placement: We(),
+    status: We(),
     popupClassName: String,
     /** @deprecated Please use `popupClassName` instead */
     dropdownClassName: String,
-    "onUpdate:value": We(),
-    "onUpdate:treeExpandedKeys": We(),
-    "onUpdate:searchValue": We()
+    "onUpdate:value": $e(),
+    "onUpdate:treeExpandedKeys": $e(),
+    "onUpdate:searchValue": $e()
   });
 }
 const Ue = Ve({
@@ -1042,10 +1041,10 @@ const Ue = Ve({
       attrs: l,
       slots: t,
       expose: a,
-      emit: n
+      emit: o
     } = s;
-    kt(!(e.treeData === void 0 && t.default)), $e(e.multiple !== !1 || !e.treeCheckable, "TreeSelect", "`multiple` will always be `true` when `treeCheckable` is true"), $e(e.replaceFields === void 0, "TreeSelect", "`replaceFields` is deprecated, please use fieldNames instead"), $e(!e.dropdownClassName, "TreeSelect", "`dropdownClassName` is deprecated. Please use `popupClassName` instead.");
-    const o = Jt(), r = Qt.useInject(), d = y(() => Zt(r.status, e.status)), {
+    kt(!(e.treeData === void 0 && t.default)), Be(e.multiple !== !1 || !e.treeCheckable, "TreeSelect", "`multiple` will always be `true` when `treeCheckable` is true"), Be(e.replaceFields === void 0, "TreeSelect", "`replaceFields` is deprecated, please use fieldNames instead"), Be(!e.dropdownClassName, "TreeSelect", "`dropdownClassName` is deprecated. Please use `popupClassName` instead.");
+    const n = Qt(), r = Jt.useInject(), d = y(() => Zt(r.status, e.status)), {
       prefixCls: c,
       renderEmpty: u,
       direction: f,
@@ -1061,8 +1060,8 @@ const Ue = Ve({
     } = Tt(c, f), O = y(() => A.value || x.value), v = Lt(), V = y(() => {
       var C;
       return (C = F.value) !== null && C !== void 0 ? C : v.value;
-    }), E = y(() => g()), D = y(() => e.placement !== void 0 ? e.placement : f.value === "rtl" ? "bottomRight" : "bottomLeft"), T = y(() => rt(E.value, Et(D.value), e.transitionName)), z = y(() => rt(E.value, "", e.choiceTransitionName)), Y = y(() => g("select-tree", e.prefixCls)), B = y(() => g("tree-select", e.prefixCls)), [le, q] = Wt(c), [re] = Ia(B, Y), se = y(() => at(e.popupClassName || e.dropdownClassName, `${B.value}-dropdown`, {
-      [`${B.value}-dropdown-rtl`]: f.value === "rtl"
+    }), E = y(() => g()), D = y(() => e.placement !== void 0 ? e.placement : f.value === "rtl" ? "bottomRight" : "bottomLeft"), T = y(() => rt(E.value, Et(D.value), e.transitionName)), z = y(() => rt(E.value, "", e.choiceTransitionName)), Y = y(() => g("select-tree", e.prefixCls)), j = y(() => g("tree-select", e.prefixCls)), [le, q] = Wt(c), [re] = Ia(j, Y), se = y(() => at(e.popupClassName || e.dropdownClassName, `${j.value}-dropdown`, {
+      [`${j.value}-dropdown-rtl`]: f.value === "rtl"
     }, q.value)), ce = y(() => !!(e.treeCheckable || e.multiple)), ne = y(() => e.showArrow !== void 0 ? e.showArrow : e.loading || !ce.value), G = fe();
     a({
       focus() {
@@ -1077,18 +1076,18 @@ const Ue = Ve({
     const pe = function() {
       for (var C = arguments.length, _ = new Array(C), H = 0; H < C; H++)
         _[H] = arguments[H];
-      n("update:value", _[0]), n("change", ..._), o.onFieldChange();
+      o("update:value", _[0]), o("change", ..._), n.onFieldChange();
     }, me = (C) => {
-      n("update:treeExpandedKeys", C), n("treeExpand", C);
+      o("update:treeExpandedKeys", C), o("treeExpand", C);
     }, ge = (C) => {
-      n("update:searchValue", C), n("search", C);
+      o("update:searchValue", C), o("search", C);
     }, ue = (C) => {
-      n("blur", C), o.onFieldBlur();
+      o("blur", C), n.onFieldBlur();
     };
     return () => {
       var C, _, H;
       const {
-        notFoundContent: J = (C = t.notFoundContent) === null || C === void 0 ? void 0 : C.call(t),
+        notFoundContent: Q = (C = t.notFoundContent) === null || C === void 0 ? void 0 : C.call(t),
         prefixCls: ke,
         bordered: Ne,
         listHeight: Te,
@@ -1099,11 +1098,11 @@ const Ue = Ve({
         showArrow: Pe,
         switcherIcon: De = (_ = t.switcherIcon) === null || _ === void 0 ? void 0 : _.call(t),
         fieldNames: Ae = e.replaceFields,
-        id: Ke = o.id.value,
+        id: Ke = n.id.value,
         placeholder: Fe = (H = t.placeholder) === null || H === void 0 ? void 0 : H.call(t)
       } = e, {
         isFormItemInput: Oe,
-        hasFeedback: Q,
+        hasFeedback: J,
         feedbackIcon: i
       } = r, {
         suffixIcon: h,
@@ -1112,19 +1111,19 @@ const Ue = Ve({
       } = Ut(b(b({}, e), {
         multiple: ce.value,
         showArrow: ne.value,
-        hasFeedback: Q,
+        hasFeedback: J,
         feedbackIcon: i,
         prefixCls: c.value
       }), t);
       let P;
-      J !== void 0 ? P = J : P = u("Select");
-      const L = Ie(e, ["suffixIcon", "itemIcon", "removeIcon", "clearIcon", "switcherIcon", "bordered", "status", "onUpdate:value", "onUpdate:treeExpandedKeys", "onUpdate:searchValue"]), I = at(!ke && B.value, {
+      Q !== void 0 ? P = Q : P = u("Select");
+      const L = Ie(e, ["suffixIcon", "itemIcon", "removeIcon", "clearIcon", "switcherIcon", "bordered", "status", "onUpdate:value", "onUpdate:treeExpandedKeys", "onUpdate:searchValue"]), I = at(!ke && j.value, {
         [`${c.value}-lg`]: O.value === "large",
         [`${c.value}-sm`]: O.value === "small",
         [`${c.value}-rtl`]: f.value === "rtl",
         [`${c.value}-borderless`]: !Ne,
         [`${c.value}-in-form-item`]: Oe
-      }, ea(c.value, d.value, Q), K.value, l.class, q.value), N = {};
+      }, ea(c.value, d.value, J), K.value, l.class, q.value), N = {};
       return e.treeData === void 0 && t.default && (N.children = _t(t.default())), le(re(U(xa, X(X(X(X({}, l), L), {}, {
         disabled: V.value,
         virtual: p.value,
@@ -1141,7 +1140,7 @@ const Ue = Ve({
         multiple: Ee,
         removeIcon: m,
         clearIcon: k,
-        switcherIcon: (R) => ta(Y.value, De, R, t.leafIcon, Ce),
+        switcherIcon: (M) => ta(Y.value, De, M, t.leafIcon, Ce),
         showTreeIcon: _e,
         notFoundContent: P,
         getPopupContainer: S == null ? void 0 : S.value,
@@ -1161,7 +1160,7 @@ const Ue = Ve({
         }),
         maxTagPlaceholder: e.maxTagPlaceholder || t.maxTagPlaceholder,
         placement: D.value,
-        showArrow: Q || Pe,
+        showArrow: J || Pe,
         placeholder: Fe
       }), b(b({}, t), {
         treeCheckable: () => U("span", {
@@ -1174,15 +1173,15 @@ const Ue = Ve({
   TreeNode: he,
   SHOW_ALL: da,
   SHOW_PARENT: vt,
-  SHOW_CHILD: Je,
+  SHOW_CHILD: Qe,
   install: (e) => (e.component(Ue.name, Ue), e.component(st.displayName, st), e)
 }), ze = yt({});
 function Na(e) {
   return be(() => e.categoryList, (s) => {
     s.forEach(async (l) => {
       if (!ze[l.id]) {
-        const t = await Kt.getCategoryValues(l.id), { flatAttributeValue: a, treeAttributeValue: n, showWay: o } = t.body;
-        ze[l.id] = o === "TREE" ? n : a;
+        const t = await Kt.getCategoryValues(l.id), { flatAttributeValue: a, treeAttributeValue: o, showWay: n } = t.body;
+        ze[l.id] = n === "TREE" ? o : a;
       }
     });
   }, { immediate: !0, deep: !0 }), {
@@ -1206,26 +1205,30 @@ const Ta = { class: "crane-required" }, La = { class: "crane-category-tips" }, E
   setup(e, { expose: s }) {
     const l = ct.SHOW_PARENT, t = e, a = y(() => ({
       categoryList: t.categoryList
-    })), n = y(() => Object.values(d).some((u) => u.length > 0)), o = fe(), r = fe(""), { categoryValuesMap: d } = Na(t);
+    })), o = y(() => Object.values(d).some((u) => u.length > 0)), n = fe(), r = fe(""), { categoryValuesMap: d } = Na(t);
     return s({
       validate: () => new Promise((u, f) => {
-        o.value.validate().then(() => {
+        if (!n.value) {
+          u(!0);
+          return;
+        }
+        n.value.validate().then(() => {
           u(!0);
         }).catch(() => {
           f(!1);
         });
       })
-    }), (u, f) => n.value ? (ie(), Ze(W(la), {
+    }), (u, f) => o.value ? (ie(), Ze(W(la), {
       key: 0,
       class: "crane-category-wraper",
       model: a.value,
       ref_key: "formRef",
-      ref: o
+      ref: n
     }, {
-      default: Me(() => [
-        Be("div", Ta, ye(W(xe)("category")), 1),
-        Be("div", La, ye(W(xe)("categotySelectTips")), 1),
-        f[1] || (f[1] = Be("div", { class: "crane-category-line" }, null, -1)),
+      default: Re(() => [
+        je("div", Ta, ye(W(xe)("category")), 1),
+        je("div", La, ye(W(xe)("categotySelectTips")), 1),
+        f[1] || (f[1] = je("div", { class: "crane-category-line" }, null, -1)),
         (ie(!0), we(bt, null, Ct(a.value.categoryList, (p, w) => {
           var x;
           return St((ie(), Ze(W(aa), {
@@ -1234,7 +1237,7 @@ const Ta = { class: "crane-required" }, La = { class: "crane-category-tips" }, E
             name: ["categoryList", w, "attributeValueIds_view"],
             rules: [{ required: !0, message: W(xe)("pleaseChoose"), trigger: ["change", "blur"] }]
           }, {
-            default: Me(() => {
+            default: Re(() => {
               var S;
               return [
                 U(W(ct), {
@@ -1252,7 +1255,7 @@ const Ta = { class: "crane-required" }, La = { class: "crane-category-tips" }, E
                   treeNodeLabelProp: "attributeName",
                   "show-checked-strategy": W(l)
                 }, {
-                  title: Me(({ attributeName: g }) => [
+                  title: Re(({ attributeName: g }) => [
                     r.value.toLowerCase() && g.includes(r.value.toLowerCase()) ? (ie(), we("span", Ea, ye(g), 1)) : (ie(), we("span", _a, ye(g), 1))
                   ]),
                   _: 2
@@ -1266,10 +1269,11 @@ const Ta = { class: "crane-required" }, La = { class: "crane-category-tips" }, E
           ]);
         }), 128))
       ]),
-      _: 1
+      _: 1,
+      __: [1]
     }, 8, ["model"])) : et("", !0);
   }
-}), Ha = /* @__PURE__ */ Ft(Da, [["__scopeId", "data-v-1b90e3f1"]]);
+}), Ha = /* @__PURE__ */ Ft(Da, [["__scopeId", "data-v-5a082038"]]);
 export {
   Ha as default
 };