@yqg/permission 1.3.0-alpha.1 → 1.3.0-alpha.10

package/dist/{category-selector-BQ0-kg3o.js → category-selector-BnUMBDty.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 ue, 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-wLkVeDMW.js";
-import { a as X, _ as b, W as xt, X as Vt, ae as it, aX as tt, Y as Ie, P as ve, N as It, R as ut, 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, aQ as Ft } from "./yqg-permission-BjVCs5lN.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-D_0ZQip-.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-CpmDDWWV.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 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";
 function na(e) {
   return Array.isArray(e) ? e : e !== void 0 ? [e] : [];
 }
@@ -42,7 +42,7 @@ function sa(e) {
 function ca() {
   return ht(dt, {});
 }
-const ia = {
+const ua = {
   width: 0,
   height: 0,
   display: "flex",
@@ -51,7 +51,7 @@ const ia = {
   border: 0,
   padding: 0,
   margin: 0
-}, ua = Ve({
+}, ia = Ve({
   compatConfig: {
     MODE: 3
   },
@@ -84,15 +84,15 @@ const ia = {
       immediate: !0,
       flush: "post"
     });
-    const i = y(() => String(a.searchValue).toLowerCase()), f = (v) => i.value ? String(v[n.treeNodeFilterProp]).toLowerCase().includes(i.value) : !1, m = M(n.treeDefaultExpandedKeys), w = M(null);
+    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);
     be(() => a.searchValue, () => {
       a.searchValue && (w.value = ra(ae(o.treeData), ae(o.fieldNames)));
     }, {
       immediate: !0
     });
-    const x = y(() => n.treeExpandedKeys ? n.treeExpandedKeys.slice() : a.searchValue ? w.value : m.value), S = (v) => {
+    const x = y(() => n.treeExpandedKeys ? n.treeExpandedKeys.slice() : a.searchValue ? w.value : p.value), S = (v) => {
       var V;
-      m.value = v, w.value = v, (V = n.onTreeExpand) === null || V === void 0 || V.call(n, v);
+      p.value = v, w.value = v, (V = n.onTreeExpand) === null || V === void 0 || V.call(n, v);
     }, g = (v) => {
       v.preventDefault();
     }, F = (v, V) => {
@@ -171,7 +171,7 @@ const ia = {
         switcherIcon: pe,
         treeLine: me,
         loadData: ge,
-        treeLoadedKeys: ie,
+        treeLoadedKeys: ue,
         treeMotion: C,
         onTreeLoad: _,
         checkedKeys: H
@@ -182,13 +182,13 @@ const ia = {
           class: `${V}-empty`,
           onMousedown: g
         }, [z]);
-      const Q = {
+      const J = {
         fieldNames: o.fieldNames
       };
-      return ie && (Q.loadedKeys = ie), x.value && (Q.expandedKeys = x.value), U("div", {
+      return ue && (J.loadedKeys = ue), x.value && (J.expandedKeys = x.value), U("div", {
         onMousedown: g
       }, [K.value && T && U("span", {
-        style: ia,
+        style: ua,
         "aria-live": "assertive"
       }, [K.value.node.value]), U(zt, X(X({
         ref: r,
@@ -211,7 +211,7 @@ const ia = {
         checkedKeys: c.value,
         selectedKeys: se ? [] : H,
         defaultExpandAll: ce
-      }, Q), {}, {
+      }, J), {}, {
         onActiveChange: O,
         onSelect: F,
         onCheck: F,
@@ -224,10 +224,10 @@ const ia = {
       }))]);
     };
   }
-}), da = "SHOW_ALL", vt = "SHOW_PARENT", Qe = "SHOW_CHILD";
+}), da = "SHOW_ALL", vt = "SHOW_PARENT", Je = "SHOW_CHILD";
 function ot(e, s, l, t) {
   const a = new Set(e);
-  return s === Qe ? e.filter((n) => {
+  return s === Je ? e.filter((n) => {
     const o = l[n];
     return !(o && o.children && o.children.some((r) => {
       let {
@@ -270,15 +270,15 @@ function ha(e) {
       for (const [E, D] of Object.entries(t.props))
         c[Vt(E)] = D;
       const {
-        isLeaf: i,
+        isLeaf: u,
         checkable: f,
-        selectable: m,
+        selectable: p,
         disabled: w,
         disableCheckbox: x
       } = c, S = {
-        isLeaf: i || i === "" || void 0,
+        isLeaf: u || u === "" || void 0,
         checkable: f || f === "" || void 0,
-        selectable: m || m === "" || void 0,
+        selectable: p || p === "" || void 0,
         disabled: w || w === "" || void 0,
         disableCheckbox: x || x === "" || void 0
       }, g = b(b({}, c), S), {
@@ -288,7 +288,7 @@ function ha(e) {
         title: F,
         switcherIcon: A,
         key: d,
-        isLeaf: i
+        isLeaf: u
       }), S), V = s(O);
       return V.length && (v.children = V), v;
     });
@@ -308,9 +308,9 @@ function qe(e) {
 function pa(e, s, l, t, a, n) {
   let o = null, r = null;
   function d() {
-    function c(i) {
-      let f = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : "0", m = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : !1;
-      return i.map((w, x) => {
+    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, {
           default: () => [A.map((O) => O.node)]
         });
@@ -320,26 +320,26 @@ function pa(e, s, l, t, a, n) {
             node: K,
             children: A
           };
-          return m || r.push(O), O;
+          return p || r.push(O), O;
         }
         return null;
       }).filter((w) => w);
     }
-    r || (r = [], c(t), r.sort((i, f) => {
+    r || (r = [], c(t), r.sort((u, f) => {
       let {
         node: {
           props: {
-            value: m
+            value: p
           }
         }
-      } = i, {
+      } = u, {
         node: {
           props: {
             value: w
           }
         }
       } = f;
-      const x = l.indexOf(m), S = l.indexOf(w);
+      const x = l.indexOf(p), S = l.indexOf(w);
       return x - S;
     }));
   }
@@ -351,9 +351,9 @@ function pa(e, s, l, t, a, n) {
     get() {
       return d(), a ? r : r.map((c) => {
         let {
-          node: i
+          node: u
         } = c;
-        return i;
+        return u;
       });
     }
   });
@@ -366,11 +366,11 @@ function ma(e, s) {
   } = s;
   const n = {}, o = [];
   return e.map((d) => {
-    const c = b({}, d), i = c[l];
-    return n[i] = c, c.key = c.key || i, c;
+    const c = b({}, d), u = c[l];
+    return n[u] = c, c.key = c.key || u, c;
   }).forEach((d) => {
-    const c = d[t], i = n[c];
-    i && (i.children = i.children || [], i.children.push(d)), (c === a || !i && a === null) && o.push(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;
 }
 function ga(e, s, l) {
@@ -402,9 +402,9 @@ const ya = (e) => {
       var d;
       const {
         value: c
-      } = r, i = (d = r.label) !== null && d !== void 0 ? d : a.get(c);
-      return n.set(c, i), b(b({}, r), {
-        label: i
+      } = r, u = (d = r.label) !== null && d !== void 0 ? d : a.get(c);
+      return n.set(c, u), b(b({}, r), {
+        label: u
       });
     });
     return s.value.valueLabels = n, o;
@@ -432,20 +432,20 @@ const ya = (e) => {
   return Ge(() => {
     let d = e.value.map((f) => {
       let {
-        value: m
+        value: p
       } = f;
-      return m;
+      return p;
     }), c = s.value.map((f) => {
       let {
-        value: m
+        value: p
       } = f;
-      return m;
+      return p;
     });
-    const i = d.filter((f) => !t.value[f]);
+    const u = d.filter((f) => !t.value[f]);
     l.value && ({
       checkedKeys: d,
       halfCheckedKeys: c
-    } = Xe(d, !0, t.value, a.value, n.value)), o.value = Array.from(/* @__PURE__ */ new Set([...i, ...d])), r.value = c;
+    } = Xe(d, !0, t.value, a.value, n.value)), o.value = Array.from(/* @__PURE__ */ new Set([...u, ...d])), r.value = c;
   }), [o, r];
 }, Sa = (e, s, l) => {
   let {
@@ -464,23 +464,23 @@ const ya = (e) => {
       c = a.value;
     else {
       const f = r.toUpperCase();
-      c = (m, w) => {
+      c = (p, w) => {
         const x = w[d];
         return String(x).toUpperCase().includes(f);
       };
     }
-    function i(f) {
-      let m = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : !1;
+    function u(f) {
+      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 = m || c(r, qe(g)), K = i(F || [], A);
+        const g = f[x], F = g[o], A = p || c(r, qe(g)), K = u(F || [], A);
         (A || K.length) && w.push(b(b({}, g), {
           [o]: K
         }));
       }
       return w;
     }
-    return i(e.value);
+    return u(e.value);
   });
 };
 function ft() {
@@ -630,10 +630,10 @@ const xa = Ve({
   },
   name: "TreeSelect",
   inheritAttrs: !1,
-  props: it(ft(), {
+  props: ut(ft(), {
     treeNodeFilterProp: "value",
     autoClearSearchValue: !0,
-    showCheckedStrategy: Qe,
+    showCheckedStrategy: Je,
     listHeight: 200,
     listItemHeight: 20,
     prefixCls: "vc-tree-select"
@@ -644,50 +644,50 @@ 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), i = y(() => oa(e.fieldNames)), [f, m] = tt("", {
+    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("", {
       value: y(() => e.searchValue !== void 0 ? e.searchValue : e.inputValue),
-      postState: (u) => u || ""
-    }), w = (u) => {
+      postState: (i) => i || ""
+    }), w = (i) => {
       var h;
-      m(u), (h = e.onSearch) === null || h === void 0 || h.call(e, u);
+      p(i), (h = e.onSearch) === null || h === void 0 || h.call(e, i);
     }, x = ga(oe(e, "treeData"), oe(e, "children"), oe(e, "treeDataSimpleMode")), {
       keyEntities: S,
       valueEntities: g
-    } = ba(x, i), F = (u) => {
-      const h = [], p = [];
-      return u.forEach((k) => {
-        g.value.has(k) ? p.push(k) : h.push(k);
+    } = ba(x, u), F = (i) => {
+      const h = [], m = [];
+      return i.forEach((k) => {
+        g.value.has(k) ? m.push(k) : h.push(k);
       }), {
         missingRawValues: h,
-        existRawValues: p
+        existRawValues: m
       };
     }, A = Sa(x, f, {
-      fieldNames: i,
+      fieldNames: u,
       treeNodeFilterProp: oe(e, "treeNodeFilterProp"),
       filterTreeNode: oe(e, "filterTreeNode")
-    }), K = (u) => {
-      if (u) {
+    }), K = (i) => {
+      if (i) {
         if (e.treeNodeLabelProp)
-          return u[e.treeNodeLabelProp];
+          return i[e.treeNodeLabelProp];
         const {
           _title: h
-        } = i.value;
-        for (let p = 0; p < h.length; p += 1) {
-          const k = u[h[p]];
+        } = u.value;
+        for (let m = 0; m < h.length; m += 1) {
+          const k = i[h[m]];
           if (k !== void 0)
             return k;
         }
       }
-    }, O = (u) => na(u).map((p) => wa(p) ? {
-      value: p
-    } : p), v = (u) => O(u).map((p) => {
+    }, O = (i) => na(i).map((m) => wa(m) ? {
+      value: m
+    } : m), v = (i) => O(i).map((m) => {
       let {
         label: k
-      } = p;
+      } = m;
       const {
         value: P,
         halfChecked: L
-      } = p;
+      } = m;
       let I;
       const N = g.value.get(P);
       return N && (k = k ?? K(N.node), I = N.node.disabled), {
@@ -700,38 +700,38 @@ const xa = Ve({
       value: oe(e, "value")
     }), D = y(() => O(V.value)), T = M([]), z = M([]);
     Ge(() => {
-      const u = [], h = [];
-      D.value.forEach((p) => {
-        p.halfChecked ? h.push(p) : u.push(p);
-      }), T.value = u, z.value = h;
+      const i = [], h = [];
+      D.value.forEach((m) => {
+        m.halfChecked ? h.push(m) : i.push(m);
+      }), T.value = i, z.value = h;
     });
-    const Y = y(() => T.value.map((u) => u.value)), {
+    const Y = y(() => T.value.map((i) => i.value)), {
       maxLevel: B,
       levelEntities: le
     } = Yt(S), [q, re] = Ca(T, z, o, S, B, le), se = y(() => {
-      const p = ot(q.value, e.showCheckedStrategy, S.value, i.value).map((L) => {
+      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[i.value.value]) !== null && R !== void 0 ? R : L;
+        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;
       }).map((L) => {
         const I = T.value.find((N) => N.value === L);
         return {
           value: L,
           label: I == null ? void 0 : I.label
         };
-      }), k = v(p), P = k[0];
+      }), k = v(m), P = k[0];
       return !c.value && P && nt(P.value) && nt(P.label) ? [] : k.map((L) => {
         var I;
         return b(b({}, L), {
           label: (I = L.label) !== null && I !== void 0 ? I : L.value
         });
       });
-    }), [ce] = ya(se), ne = (u, h, p) => {
-      const k = v(u);
-      if (E(k), e.autoClearSearchValue && m(""), e.onChange) {
-        let P = u;
-        o.value && (P = ot(u, e.showCheckedStrategy, S.value, i.value).map((te) => {
+    }), [ce] = ya(se), ne = (i, h, m) => {
+      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) => {
           const Se = g.value.get(te);
-          return Se ? Se.node[i.value.value] : te;
+          return Se ? Se.node[u.value.value] : te;
         }));
         const {
           triggerValue: L,
@@ -751,58 +751,58 @@ const xa = Ve({
           triggerValue: L
         };
         let ee = !0;
-        (e.treeCheckStrictly || p === "selection" && !I) && (ee = !1), pa(Z, L, u, x.value, ee, i.value), r.value ? Z.checked = I : Z.selected = I;
+        (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);
       }
-    }, G = (u, h) => {
+    }, G = (i, h) => {
       let {
-        selected: p,
+        selected: m,
         source: k
       } = h;
       var P, L, I;
-      const N = ae(S.value), R = ae(g.value), Z = N[u], ee = Z == null ? void 0 : Z.node, $ = (P = ee == null ? void 0 : ee[i.value.value]) !== null && P !== void 0 ? P : u;
+      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;
       if (!c.value)
         ne([$], {
           selected: !0,
           triggerValue: $
         }, "option");
       else {
-        let j = p ? [...Y.value, $] : q.value.filter((te) => te !== $);
+        let j = m ? [...Y.value, $] : q.value.filter((te) => te !== $);
         if (o.value) {
           const {
             missingRawValues: te,
             existRawValues: Se
-          } = F(j), Je = Se.map((Re) => R.get(Re).key);
+          } = F(j), Qe = Se.map((Re) => R.get(Re).key);
           let He;
-          p ? {
+          m ? {
             checkedKeys: He
-          } = Xe(Je, !0, N, B.value, le.value) : {
+          } = Xe(Qe, !0, N, B.value, le.value) : {
             checkedKeys: He
-          } = Xe(Je, {
+          } = Xe(Qe, {
             checked: !1,
             halfCheckedKeys: re.value
-          }, N, B.value, le.value), j = [...te, ...He.map((Re) => N[Re].node[i.value.value])];
+          }, N, B.value, le.value), j = [...te, ...He.map((Re) => N[Re].node[u.value.value])];
         }
         ne(j, {
-          selected: p,
+          selected: m,
           triggerValue: $
         }, k || "option");
       }
-      p || !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));
-    }, pe = (u) => {
+      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));
+    }, pe = (i) => {
       if (e.onDropdownVisibleChange) {
         const h = {};
         Object.defineProperty(h, "documentClickClose", {
           get() {
             return !1;
           }
-        }), e.onDropdownVisibleChange(u, h);
+        }), e.onDropdownVisibleChange(i, h);
       }
-    }, me = (u, h) => {
-      const p = u.map((k) => k.value);
+    }, me = (i, h) => {
+      const m = i.map((k) => k.value);
       if (h.type === "clear") {
-        ne(p, {}, "selection");
+        ne(m, {}, "selection");
         return;
       }
       h.values.length && G(h.values[0].value, {
@@ -812,12 +812,12 @@ const xa = Ve({
     }, {
       treeNodeFilterProp: ge,
       // Data
-      loadData: ie,
+      loadData: ue,
       treeLoadedKeys: C,
       onTreeLoad: _,
       // Expanded
       treeDefaultExpandAll: H,
-      treeExpandedKeys: Q,
+      treeExpandedKeys: J,
       treeDefaultExpandedKeys: ke,
       onTreeExpand: Ne,
       // Options
@@ -836,13 +836,13 @@ const xa = Ve({
     } = gt(e);
     Bt(lt({
       checkable: r,
-      loadData: ie,
+      loadData: ue,
       treeLoadedKeys: C,
       onTreeLoad: _,
       checkedKeys: q,
       halfCheckedKeys: re,
       treeDefaultExpandAll: H,
-      treeExpandedKeys: Q,
+      treeExpandedKeys: J,
       treeDefaultExpandedKeys: ke,
       onTreeExpand: Ne,
       treeIcon: Ce,
@@ -858,27 +858,27 @@ const xa = Ve({
       listHeight: Le,
       listItemHeight: Ee,
       treeData: A,
-      fieldNames: i,
+      fieldNames: u,
       onSelect: G,
       dropdownMatchSelectWidth: Fe,
       treeExpandAction: Oe
     }));
-    const J = fe();
+    const Q = fe();
     return t({
       focus() {
-        var u;
-        (u = J.value) === null || u === void 0 || u.focus();
+        var i;
+        (i = Q.value) === null || i === void 0 || i.focus();
       },
       blur() {
-        var u;
-        (u = J.value) === null || u === void 0 || u.blur();
+        var i;
+        (i = Q.value) === null || i === void 0 || i.blur();
       },
-      scrollTo(u) {
+      scrollTo(i) {
         var h;
-        (h = J.value) === null || h === void 0 || h.scrollTo(u);
+        (h = Q.value) === null || h === void 0 || h.scrollTo(i);
       }
     }), () => {
-      var u;
+      var i;
       const h = Ie(e, [
         "id",
         "prefixCls",
@@ -931,7 +931,7 @@ const xa = Ve({
         "treeMotion"
       ]);
       return U($t, X(X(X({
-        ref: J
+        ref: Q
       }, l), h), {}, {
         id: n,
         prefixCls: e.prefixCls,
@@ -940,11 +940,11 @@ const xa = Ve({
         onDisplayValuesChange: me,
         searchValue: f.value,
         onSearch: w,
-        OptionList: ua,
+        OptionList: ia,
         emptyOptions: !x.value.length,
         onDropdownVisibleChange: pe,
         tagRender: e.tagRender || a.tagRender,
-        dropdownMatchSelectWidth: (u = e.dropdownMatchSelectWidth) !== null && u !== void 0 ? u : !0
+        dropdownMatchSelectWidth: (i = e.dropdownMatchSelectWidth) !== null && i !== void 0 ? i : !0
       }), a);
     };
   }
@@ -964,7 +964,7 @@ const xa = Ve({
           padding: `${e.paddingXS}px ${e.paddingXS / 2}px`
         },
         // ====================== Tree ======================
-        qt(l, ut(e, {
+        qt(l, it(e, {
           colorBgContainer: t
         })),
         {
@@ -999,7 +999,7 @@ const xa = Ve({
 };
 function Ia(e, s) {
   return It("TreeSelect", (l) => {
-    const t = ut(l, {
+    const t = it(l, {
       treePrefixCls: s.value
     });
     return [Va(t)];
@@ -1029,7 +1029,7 @@ const Ue = Ve({
   },
   name: "ATreeSelect",
   inheritAttrs: !1,
-  props: it(ka(), {
+  props: ut(ka(), {
     choiceTransitionName: "",
     listHeight: 256,
     treeIcon: !1,
@@ -1045,11 +1045,11 @@ const Ue = Ve({
       emit: n
     } = 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 = Qt(), r = Jt.useInject(), d = y(() => Zt(r.status, e.status)), {
+    const o = Jt(), r = Qt.useInject(), d = y(() => Zt(r.status, e.status)), {
       prefixCls: c,
-      renderEmpty: i,
+      renderEmpty: u,
       direction: f,
-      virtual: m,
+      virtual: p,
       dropdownMatchSelectWidth: w,
       size: x,
       getPopupContainer: S,
@@ -1082,13 +1082,13 @@ const Ue = Ve({
       n("update:treeExpandedKeys", C), n("treeExpand", C);
     }, ge = (C) => {
       n("update:searchValue", C), n("search", C);
-    }, ie = (C) => {
+    }, ue = (C) => {
       n("blur", C), o.onFieldBlur();
     };
     return () => {
       var C, _, H;
       const {
-        notFoundContent: Q = (C = t.notFoundContent) === null || C === void 0 ? void 0 : C.call(t),
+        notFoundContent: J = (C = t.notFoundContent) === null || C === void 0 ? void 0 : C.call(t),
         prefixCls: ke,
         bordered: Ne,
         listHeight: Te,
@@ -1103,31 +1103,31 @@ const Ue = Ve({
         placeholder: Fe = (H = t.placeholder) === null || H === void 0 ? void 0 : H.call(t)
       } = e, {
         isFormItemInput: Oe,
-        hasFeedback: J,
-        feedbackIcon: u
+        hasFeedback: Q,
+        feedbackIcon: i
       } = r, {
         suffixIcon: h,
-        removeIcon: p,
+        removeIcon: m,
         clearIcon: k
       } = Ut(b(b({}, e), {
         multiple: ce.value,
         showArrow: ne.value,
-        hasFeedback: J,
-        feedbackIcon: u,
+        hasFeedback: Q,
+        feedbackIcon: i,
         prefixCls: c.value
       }), t);
       let P;
-      Q !== void 0 ? P = Q : P = i("Select");
+      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, {
         [`${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, J), K.value, l.class, q.value), N = {};
+      }, ea(c.value, d.value, Q), 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: m.value,
+        virtual: p.value,
         dropdownMatchSelectWidth: w.value,
         id: Ke,
         fieldNames: Ae,
@@ -1139,7 +1139,7 @@ const Ue = Ve({
         treeLine: !!Ce,
         inputIcon: h,
         multiple: Ee,
-        removeIcon: p,
+        removeIcon: m,
         clearIcon: k,
         switcherIcon: (R) => ta(Y.value, De, R, t.leafIcon, Ce),
         showTreeIcon: _e,
@@ -1149,7 +1149,7 @@ const Ue = Ve({
         dropdownClassName: se.value,
         choiceTransitionName: z.value,
         onChange: pe,
-        onBlur: ie,
+        onBlur: ue,
         onSearch: ge,
         onTreeExpand: me
       }, N), {}, {
@@ -1161,7 +1161,7 @@ const Ue = Ve({
         }),
         maxTagPlaceholder: e.maxTagPlaceholder || t.maxTagPlaceholder,
         placement: D.value,
-        showArrow: J || Pe,
+        showArrow: Q || Pe,
         placeholder: Fe
       }), b(b({}, t), {
         treeCheckable: () => U("span", {
@@ -1174,18 +1174,18 @@ const Ue = Ve({
   TreeNode: he,
   SHOW_ALL: da,
   SHOW_PARENT: vt,
-  SHOW_CHILD: Qe,
+  SHOW_CHILD: Je,
   install: (e) => (e.component(Ue.name, Ue), e.component(st.displayName, st), e)
 }), ze = yt({});
 function Na(e) {
-  return be(() => e, (s) => {
+  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;
       }
     });
-  }, { immediate: !0 }), {
+  }, { immediate: !0, deep: !0 }), {
     categoryValuesMap: ze
   };
 }
@@ -1206,16 +1206,16 @@ 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((i) => i.length > 0)), o = fe(), r = fe(""), { categoryValuesMap: d } = Na(t.categoryList);
+    })), n = y(() => Object.values(d).some((u) => u.length > 0)), o = fe(), r = fe(""), { categoryValuesMap: d } = Na(t);
     return s({
-      validate: () => new Promise((i, f) => {
+      validate: () => new Promise((u, f) => {
         o.value.validate().then(() => {
-          i(!0);
+          u(!0);
         }).catch(() => {
           f(!1);
         });
       })
-    }), (i, f) => n.value ? (ue(), Ze(W(la), {
+    }), (u, f) => n.value ? (ie(), Ze(W(la), {
       key: 0,
       class: "crane-category-wraper",
       model: a.value,
@@ -1226,11 +1226,11 @@ const Ta = { class: "crane-required" }, La = { class: "crane-category-tips" }, E
         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)),
-        (ue(!0), we(bt, null, Ct(a.value.categoryList, (m, w) => {
+        (ie(!0), we(bt, null, Ct(a.value.categoryList, (p, w) => {
           var x;
-          return St((ue(), Ze(W(aa), {
-            key: m.id,
-            label: m.categoryName,
+          return St((ie(), Ze(W(aa), {
+            key: p.id,
+            label: p.categoryName,
             name: ["categoryList", w, "attributeValueIds_view"],
             rules: [{ required: !0, message: W(xe)("pleaseChoose"), trigger: ["change", "blur"] }]
           }, {
@@ -1240,11 +1240,11 @@ const Ta = { class: "crane-required" }, La = { class: "crane-category-tips" }, E
                 U(W(ct), {
                   treeCheckable: "",
                   treeDefaultExpandAll: "",
-                  "tree-data": W(d)[m.id],
+                  "tree-data": W(d)[p.id],
                   showSearch: "",
                   allowClear: "",
-                  value: m.attributeValueIds_view,
-                  "onUpdate:value": (g) => m.attributeValueIds_view = g,
+                  value: p.attributeValueIds_view,
+                  "onUpdate:value": (g) => p.attributeValueIds_view = g,
                   treeNodeFilterProp: "attributeName",
                   searchValue: r.value,
                   "onUpdate:searchValue": f[0] || (f[0] = (g) => r.value = g),
@@ -1253,23 +1253,23 @@ const Ta = { class: "crane-required" }, La = { class: "crane-category-tips" }, E
                   "show-checked-strategy": W(l)
                 }, {
                   title: Me(({ attributeName: g }) => [
-                    r.value.toLowerCase() && g.includes(r.value.toLowerCase()) ? (ue(), we("span", Ea, ye(g), 1)) : (ue(), we("span", _a, ye(g), 1))
+                    r.value.toLowerCase() && g.includes(r.value.toLowerCase()) ? (ie(), we("span", Ea, ye(g), 1)) : (ie(), we("span", _a, ye(g), 1))
                   ]),
                   _: 2
                 }, 1032, ["tree-data", "value", "onUpdate:value", "searchValue", "show-checked-strategy"]),
-                (S = m.attributeValueIds_view) != null && S.includes(-1) ? (ue(), we("span", Pa, ye(W(xe)("categoryChangeTips")), 1)) : et("", !0)
+                (S = p.attributeValueIds_view) != null && S.includes(-1) ? (ie(), we("span", Pa, ye(W(xe)("categoryChangeTips", { category: p.categoryName })), 1)) : et("", !0)
               ];
             }),
             _: 2
           }, 1032, ["label", "name", "rules"])), [
-            [wt, (x = W(d)[m.id]) == null ? void 0 : x.length]
+            [wt, (x = W(d)[p.id]) == null ? void 0 : x.length]
           ]);
         }), 128))
       ]),
       _: 1
     }, 8, ["model"])) : et("", !0);
   }
-}), Ha = /* @__PURE__ */ Ft(Da, [["__scopeId", "data-v-5bc5b7db"]]);
+}), Ha = /* @__PURE__ */ Ft(Da, [["__scopeId", "data-v-1b90e3f1"]]);
 export {
   Ha as default
 };