@yqg/permission 1.3.14-beta.1 → 1.3.14

package/dist/{category-selector-CeFM3lr8.js → category-selector-9HVsPsVR.js}

@@ -1,7 +1,7 @@
-import { a as ht, p as pt, d as Ie, r as pe, c as y, w as we, q as gt, s as j, E as ae, e as U, b as Qe, y as re, a0 as mt, G as yt, K as et, R as je, L as oe, M as Be, P as $e, N as Ce, S as de, u as H, F as bt, Y as Ct, j as St, z as wt } from "./index-D_ujkA5Y.js";
-import { a as X, _ as b, W as xt, X as Vt, ae as it, aX as tt, Y as Ne, P as he, N as It, Q as ut, V as Nt, aN as We, a0 as kt, ar as Tt, as as Lt, aY as _t, c as at, b as Et, ai as Ue, ak as ze, am as Dt, $ as Pt, aj as At, aV as Kt, aP as Se, aS as Ft } from "./yqg-permission-C8hIbxln.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-D-ZB-Fhd.js";
-import { K as ve, T as zt, c as Xt, a as Ye, 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-CbdSpFHD.js";
+import { a as ht, p as pt, d as Ie, r as pe, c as C, w as we, q as gt, s as j, E as ae, e as U, b as Qe, y as re, a0 as mt, G as yt, K as et, R as je, L as oe, M as Be, P as $e, N as Ce, S as de, u as H, F as bt, Y as Ct, j as St, z as wt } from "./index-CfdXHF81.js";
+import { a as X, _ as S, W as xt, X as Vt, ae as it, aX as tt, Y as Ne, P as he, N as It, Q as ut, V as Nt, aN as We, a0 as kt, ar as Tt, as as Lt, aY as _t, c as at, b as Et, ai as Ue, ak as ze, am as Dt, $ as Pt, aj as At, aV as Kt, aP as Se, aS as Ft } from "./yqg-permission-Btr34HIx.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-BWIdbsw2.js";
+import { K as ve, T as zt, c as Xt, a as Ye, 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-BHiQP1sQ.js";
 function na(e) {
   return Array.isArray(e) ? e : e !== void 0 ? [e] : [];
 }
@@ -24,9 +24,9 @@ function qe(e) {
 function oa(e, i) {
   const c = [];
   function a(t) {
-    t.forEach((l) => {
-      c.push(l[i.value]);
-      const n = l[i.children];
+    t.forEach((r) => {
+      c.push(r[i.value]);
+      const n = r[i.children];
       n && a(n);
     });
   }
@@ -62,83 +62,83 @@ const ia = {
       slots: c,
       expose: a
     } = i;
-    const t = Ot(), l = Ht(), n = ca(), r = pe(), u = Mt(() => n.treeData, [() => t.open, () => n.treeData], (p) => p[0]), s = y(() => {
+    const t = Ot(), r = Ht(), n = ca(), l = pe(), u = Mt(() => n.treeData, [() => t.open, () => n.treeData], (h) => h[0]), s = C(() => {
       const {
-        checkable: p,
-        halfCheckedKeys: w,
-        checkedKeys: E
-      } = l;
-      return p ? {
-        checked: E,
-        halfChecked: w
+        checkable: h,
+        halfCheckedKeys: V,
+        checkedKeys: D
+      } = r;
+      return h ? {
+        checked: D,
+        halfChecked: V
       } : null;
     });
     we(() => t.open, () => {
       gt(() => {
-        var p;
-        t.open && !t.multiple && l.checkedKeys.length && ((p = r.value) === null || p === void 0 || p.scrollTo({
-          key: l.checkedKeys[0]
+        var h;
+        t.open && !t.multiple && r.checkedKeys.length && ((h = l.value) === null || h === void 0 || h.scrollTo({
+          key: r.checkedKeys[0]
         }));
       });
     }, {
       immediate: !0,
       flush: "post"
     });
-    const o = y(() => String(t.searchValue).toLowerCase()), f = (p) => o.value ? String(p[l.treeNodeFilterProp]).toLowerCase().includes(o.value) : !1, v = j(l.treeDefaultExpandedKeys), h = j(null);
+    const o = C(() => String(t.searchValue).toLowerCase()), f = (h) => o.value ? String(h[r.treeNodeFilterProp]).toLowerCase().includes(o.value) : !1, v = j(r.treeDefaultExpandedKeys), p = j(null);
     we(() => t.searchValue, () => {
-      t.searchValue && (h.value = oa(ae(n.treeData), ae(n.fieldNames)));
+      t.searchValue && (p.value = oa(ae(n.treeData), ae(n.fieldNames)));
     }, {
       immediate: !0
     });
-    const x = y(() => l.treeExpandedKeys ? l.treeExpandedKeys.slice() : t.searchValue ? h.value : v.value), S = (p) => {
-      var w;
-      v.value = p, h.value = p, (w = l.onTreeExpand) === null || w === void 0 || w.call(l, p);
-    }, V = (p) => {
-      p.preventDefault();
-    }, k = (p, w) => {
+    const y = C(() => r.treeExpandedKeys ? r.treeExpandedKeys.slice() : t.searchValue ? p.value : v.value), g = (h) => {
+      var V;
+      v.value = h, p.value = h, (V = r.onTreeExpand) === null || V === void 0 || V.call(r, h);
+    }, N = (h) => {
+      h.preventDefault();
+    }, K = (h, V) => {
       let {
-        node: E
-      } = w;
-      var A, L;
+        node: D
+      } = V;
+      var F, L;
       const {
         checkable: z,
         checkedKeys: Y
-      } = l;
-      z && qe(E) || ((A = n.onSelect) === null || A === void 0 || A.call(n, E.key, {
-        selected: !Y.includes(E.key)
+      } = r;
+      z && qe(D) || ((F = n.onSelect) === null || F === void 0 || F.call(n, D.key, {
+        selected: !Y.includes(D.key)
       }), t.multiple || (L = t.toggleOpen) === null || L === void 0 || L.call(t, !1));
-    }, K = pe(null), F = y(() => l.keyEntities[K.value]), O = (p) => {
-      K.value = p;
+    }, E = pe(null), x = C(() => r.keyEntities[E.value]), O = (h) => {
+      E.value = h;
     };
     return a({
       scrollTo: function() {
-        for (var p, w, E = arguments.length, A = new Array(E), L = 0; L < E; L++)
-          A[L] = arguments[L];
-        return (w = (p = r.value) === null || p === void 0 ? void 0 : p.scrollTo) === null || w === void 0 ? void 0 : w.call(p, ...A);
+        for (var h, V, D = arguments.length, F = new Array(D), L = 0; L < D; L++)
+          F[L] = arguments[L];
+        return (V = (h = l.value) === null || h === void 0 ? void 0 : h.scrollTo) === null || V === void 0 ? void 0 : V.call(h, ...F);
       },
-      onKeydown: (p) => {
-        var w;
+      onKeydown: (h) => {
+        var V;
         const {
-          which: E
-        } = p;
-        switch (E) {
+          which: D
+        } = h;
+        switch (D) {
           case ve.UP:
           case ve.DOWN:
           case ve.LEFT:
           case ve.RIGHT:
-            (w = r.value) === null || w === void 0 || w.onKeydown(p);
+            (V = l.value) === null || V === void 0 || V.onKeydown(h);
             break;
           case ve.ENTER: {
-            if (F.value) {
+            if (x.value) {
               const {
-                selectable: A,
+                selectable: F,
                 value: L
-              } = F.value.node || {};
-              A !== !1 && k(null, {
+              } = x.value.node || {};
+              F !== !1 && K(null, {
                 node: {
-                  key: K.value
+                  key: E.value
                 },
-                selected: !l.checkedKeys.includes(L)
+                selected: !r.checkedKeys.includes(L)
               });
             }
             break;
@@ -150,13 +150,13 @@ const ia = {
       onKeyup: () => {
       }
     }), () => {
-      var p;
+      var h;
       const {
-        prefixCls: w,
-        multiple: E,
-        searchValue: A,
+        prefixCls: V,
+        multiple: D,
+        searchValue: F,
         open: L,
-        notFoundContent: z = (p = c.notFoundContent) === null || p === void 0 ? void 0 : p.call(c)
+        notFoundContent: z = (h = c.notFoundContent) === null || h === void 0 ? void 0 : h.call(c)
       } = t, {
         listHeight: Y,
         listItemHeight: B,
@@ -172,40 +172,40 @@ const ia = {
         treeLine: ye,
         loadData: be,
         treeLoadedKeys: ue,
-        treeMotion: C,
-        onTreeLoad: D,
+        treeMotion: w,
+        onTreeLoad: P,
         checkedKeys: M
-      } = l;
+      } = r;
       if (u.value.length === 0)
         return U("div", {
           role: "listbox",
-          class: `${w}-empty`,
-          onMousedown: V
+          class: `${V}-empty`,
+          onMousedown: N
         }, [z]);
       const Q = {
         fieldNames: n.fieldNames
       };
-      return ue && (Q.loadedKeys = ue), x.value && (Q.expandedKeys = x.value), U("div", {
-        onMousedown: V
-      }, [F.value && L && U("span", {
+      return ue && (Q.loadedKeys = ue), y.value && (Q.expandedKeys = y.value), U("div", {
+        onMousedown: N
+      }, [x.value && L && U("span", {
         style: ia,
         "aria-live": "assertive"
-      }, [F.value.node.value]), U(zt, X(X({
-        ref: r,
+      }, [x.value.node.value]), U(zt, X(X({
+        ref: l,
         focusable: !1,
-        prefixCls: `${w}-tree`,
+        prefixCls: `${V}-tree`,
         treeData: u.value,
         height: Y,
         itemHeight: B,
         virtual: le !== !1 && q !== !1,
-        multiple: E,
+        multiple: D,
         icon: ne,
         showIcon: G,
         switcherIcon: me,
         showLine: ye,
-        loadData: A ? null : be,
-        motion: C,
-        activeKey: K.value,
+        loadData: F ? null : be,
+        motion: w,
+        activeKey: E.value,
         checkable: ce,
         checkStrictly: !0,
         checkedKeys: s.value,
@@ -213,36 +213,36 @@ const ia = {
         defaultExpandAll: ie
       }, Q), {}, {
         onActiveChange: O,
-        onSelect: k,
-        onCheck: k,
-        onExpand: S,
-        onLoad: D,
+        onSelect: K,
+        onCheck: K,
+        onExpand: g,
+        onLoad: P,
         filterTreeNode: f,
         expandAction: se
-      }), b(b({}, c), {
-        checkable: l.customSlots.treeCheckable
+      }), S(S({}, c), {
+        checkable: r.customSlots.treeCheckable
       }))]);
     };
   }
 }), da = "SHOW_ALL", vt = "SHOW_PARENT", Je = "SHOW_CHILD";
 function rt(e, i, c, a) {
   const t = new Set(e);
-  return i === Je ? e.filter((l) => {
-    const n = c[l];
-    return !(n && n.children && n.children.some((r) => {
+  return i === Je ? e.filter((r) => {
+    const n = c[r];
+    return !(n && n.children && n.children.some((l) => {
       let {
         node: u
-      } = r;
+      } = l;
       return t.has(u[a.value]);
-    }) && n.children.every((r) => {
+    }) && n.children.every((l) => {
       let {
         node: u
-      } = r;
+      } = l;
       return qe(u) || t.has(u[a.value]);
     }));
-  }) : i === vt ? e.filter((l) => {
-    const n = c[l], r = n ? n.parent : null;
-    return !(r && !qe(r.node) && t.has(r.key));
+  }) : i === vt ? e.filter((r) => {
+    const n = c[r], l = n ? n.parent : null;
+    return !(l && !qe(l.node) && t.has(l.key));
   }) : e;
 }
 const ge = () => null;
@@ -263,34 +263,34 @@ function ha(e) {
   function i() {
     let c = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : [];
     return xt(c).map((a) => {
-      var t, l, n;
+      var t, r, n;
       if (!fa(a))
         return null;
-      const r = a.children || {}, u = a.key, s = {};
-      for (const [E, A] of Object.entries(a.props))
-        s[Vt(E)] = A;
+      const l = a.children || {}, u = a.key, s = {};
+      for (const [D, F] of Object.entries(a.props))
+        s[Vt(D)] = F;
       const {
         isLeaf: o,
         checkable: f,
         selectable: v,
-        disabled: h,
-        disableCheckbox: x
-      } = s, S = {
+        disabled: p,
+        disableCheckbox: y
+      } = s, g = {
         isLeaf: o || o === "" || void 0,
         checkable: f || f === "" || void 0,
         selectable: v || v === "" || void 0,
-        disabled: h || h === "" || void 0,
-        disableCheckbox: x || x === "" || void 0
-      }, V = b(b({}, s), S), {
-        title: k = (t = r.title) === null || t === void 0 ? void 0 : t.call(r, V),
-        switcherIcon: K = (l = r.switcherIcon) === null || l === void 0 ? void 0 : l.call(r, V)
-      } = s, F = va(s, ["title", "switcherIcon"]), O = (n = r.default) === null || n === void 0 ? void 0 : n.call(r), p = b(b(b({}, F), {
-        title: k,
-        switcherIcon: K,
+        disabled: p || p === "" || void 0,
+        disableCheckbox: y || y === "" || void 0
+      }, N = S(S({}, s), g), {
+        title: K = (t = l.title) === null || t === void 0 ? void 0 : t.call(l, N),
+        switcherIcon: E = (r = l.switcherIcon) === null || r === void 0 ? void 0 : r.call(l, N)
+      } = s, x = va(s, ["title", "switcherIcon"]), O = (n = l.default) === null || n === void 0 ? void 0 : n.call(l), h = S(S(S({}, x), {
+        title: K,
+        switcherIcon: E,
         key: u,
         isLeaf: o
-      }), S), w = i(O);
-      return w.length && (p.children = w), p;
+      }), g), V = i(O);
+      return V.length && (h.children = V), h;
     });
   }
   return i(e);
@@ -298,34 +298,34 @@ function ha(e) {
 function Ge(e) {
   if (!e)
     return e;
-  const i = b({}, e);
+  const i = S({}, e);
   return "props" in i || Object.defineProperty(i, "props", {
     get() {
       return i;
     }
   }), i;
 }
-function pa(e, i, c, a, t, l) {
-  let n = null, r = null;
+function pa(e, i, c, a, t, r) {
+  let n = null, l = null;
   function u() {
     function s(o) {
       let f = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : "0", v = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : !1;
-      return o.map((h, x) => {
-        const S = `${f}-${x}`, V = h[l.value], k = c.includes(V), K = s(h[l.children] || [], S, k), F = U(ge, h, {
-          default: () => [K.map((O) => O.node)]
+      return o.map((p, y) => {
+        const g = `${f}-${y}`, N = p[r.value], K = c.includes(N), E = s(p[r.children] || [], g, K), x = U(ge, p, {
+          default: () => [E.map((O) => O.node)]
         });
-        if (i === V && (n = F), k) {
+        if (i === N && (n = x), K) {
           const O = {
-            pos: S,
-            node: F,
-            children: K
+            pos: g,
+            node: x,
+            children: E
           };
-          return v || r.push(O), O;
+          return v || l.push(O), O;
         }
         return null;
-      }).filter((h) => h);
+      }).filter((p) => p);
     }
-    r || (r = [], s(a), r.sort((o, f) => {
+    l || (l = [], s(a), l.sort((o, f) => {
       let {
         node: {
           props: {
@@ -335,12 +335,12 @@ function pa(e, i, c, a, t, l) {
       } = o, {
         node: {
           props: {
-            value: h
+            value: p
           }
         }
       } = f;
-      const x = c.indexOf(v), S = c.indexOf(h);
-      return x - S;
+      const y = c.indexOf(v), g = c.indexOf(p);
+      return y - g;
     }));
   }
   Object.defineProperty(e, "triggerNode", {
@@ -349,7 +349,7 @@ function pa(e, i, c, a, t, l) {
     }
   }), Object.defineProperty(e, "allCheckedNodes", {
     get() {
-      return u(), t ? r : r.map((s) => {
+      return u(), t ? l : l.map((s) => {
         let {
           node: o
         } = s;
@@ -364,12 +364,12 @@ function ga(e, i) {
     pId: a,
     rootPId: t
   } = i;
-  const l = {}, n = [];
+  const r = {}, n = [];
   return e.map((u) => {
-    const s = b({}, u), o = s[c];
-    return l[o] = s, s.key = s.key || o, s;
+    const s = S({}, u), o = s[c];
+    return r[o] = s, s.key = s.key || o, s;
   }).forEach((u) => {
-    const s = u[a], o = l[s];
+    const s = u[a], o = r[s];
     o && (o.children = o.children || [], o.children.push(u)), (s === t || !o && t === null) && n.push(u);
   }), n;
 }
@@ -377,7 +377,7 @@ function ma(e, i, c) {
   const a = j();
   return we([c, e, i], () => {
     const t = c.value;
-    e.value ? a.value = c.value ? ga(ae(e.value), b({
+    e.value ? a.value = c.value ? ga(ae(e.value), S({
       id: "id",
       pId: "pId",
       rootPId: null
@@ -395,40 +395,40 @@ const ya = (e) => {
     c.value = ae(e.value);
   }, {
     immediate: !0
-  }), [y(() => {
+  }), [C(() => {
     const {
       valueLabels: t
-    } = i.value, l = /* @__PURE__ */ new Map(), n = c.value.map((r) => {
+    } = i.value, r = /* @__PURE__ */ new Map(), n = c.value.map((l) => {
       var u;
       const {
         value: s
-      } = r, o = (u = r.label) !== null && u !== void 0 ? u : t.get(s);
-      return l.set(s, o), b(b({}, r), {
+      } = l, o = (u = l.label) !== null && u !== void 0 ? u : t.get(s);
+      return r.set(s, o), S(S({}, l), {
         label: o
       });
     });
-    return i.value.valueLabels = l, n;
+    return i.value.valueLabels = r, n;
   })];
 }, ba = (e, i) => {
   const c = j(/* @__PURE__ */ new Map()), a = j({});
   return Qe(() => {
-    const t = i.value, l = Xt(e.value, {
+    const t = i.value, r = Xt(e.value, {
       fieldNames: t,
-      initWrapper: (n) => b(b({}, n), {
+      initWrapper: (n) => S(S({}, n), {
         valueEntities: /* @__PURE__ */ new Map()
       }),
-      processEntity: (n, r) => {
+      processEntity: (n, l) => {
         const u = n.node[t.value];
-        r.valueEntities.set(u, n);
+        l.valueEntities.set(u, n);
       }
     });
-    c.value = l.valueEntities, a.value = l.keyEntities;
+    c.value = r.valueEntities, a.value = r.keyEntities;
   }), {
     valueEntities: c,
     keyEntities: a
   };
-}, Ca = (e, i, c, a, t, l) => {
-  const n = j([]), r = j([]);
+}, Ca = (e, i, c, a, t, r) => {
+  const n = j([]), l = j([]);
   return Qe(() => {
     let u = e.value.map((f) => {
       let {
@@ -445,46 +445,46 @@ const ya = (e) => {
     c.value && ({
       checkedKeys: u,
       halfCheckedKeys: s
-    } = Ye(u, !0, a.value, t.value, l.value)), n.value = Array.from(/* @__PURE__ */ new Set([...o, ...u])), r.value = s;
-  }), [n, r];
+    } = Ye(u, !0, a.value, t.value, r.value)), n.value = Array.from(/* @__PURE__ */ new Set([...o, ...u])), l.value = s;
+  }), [n, l];
 }, Sa = (e, i, c) => {
   let {
     treeNodeFilterProp: a,
     filterTreeNode: t,
-    fieldNames: l
+    fieldNames: r
   } = c;
-  return y(() => {
+  return C(() => {
     const {
       children: n
-    } = l.value, r = i.value, u = a == null ? void 0 : a.value;
-    if (!r || t.value === !1)
+    } = r.value, l = i.value, u = a == null ? void 0 : a.value;
+    if (!l || t.value === !1)
       return e.value;
     let s;
     if (typeof t.value == "function")
       s = t.value;
     else {
-      const f = r.toUpperCase();
-      s = (v, h) => {
-        const x = h[u];
-        return String(x).toUpperCase().includes(f);
+      const f = l.toUpperCase();
+      s = (v, p) => {
+        const y = p[u];
+        return String(y).toUpperCase().includes(f);
       };
     }
     function o(f) {
       let v = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : !1;
-      const h = [];
-      for (let x = 0, S = f.length; x < S; x++) {
-        const V = f[x], k = V[n], K = v || s(r, Ge(V)), F = o(k || [], K);
-        (K || F.length) && h.push(b(b({}, V), {
-          [n]: F
+      const p = [];
+      for (let y = 0, g = f.length; y < g; y++) {
+        const N = f[y], K = N[n], E = v || s(l, Ge(N)), x = o(K || [], E);
+        (E || x.length) && p.push(S(S({}, N), {
+          [n]: x
         }));
       }
-      return h;
+      return p;
     }
     return o(e.value);
   });
 };
 function ft() {
-  return b(b({}, Ne($t(), ["mode"])), {
+  return S(S({}, Ne($t(), ["mode"])), {
     prefixCls: String,
     id: String,
     value: {
@@ -644,138 +644,138 @@ const xa = Ie({
       expose: a,
       slots: t
     } = i;
-    const l = Rt(re(e, "id")), n = y(() => e.treeCheckable && !e.treeCheckStrictly), r = y(() => e.treeCheckable || e.treeCheckStrictly), u = y(() => e.treeCheckStrictly || e.labelInValue), s = y(() => r.value || e.multiple), o = y(() => ra(e.fieldNames)), [f, v] = tt("", {
-      value: y(() => e.searchValue !== void 0 ? e.searchValue : e.inputValue),
+    const r = Rt(re(e, "id")), n = C(() => e.treeCheckable && !e.treeCheckStrictly), l = C(() => e.treeCheckable || e.treeCheckStrictly), u = C(() => e.treeCheckStrictly || e.labelInValue), s = C(() => l.value || e.multiple), o = C(() => ra(e.fieldNames)), [f, v] = tt("", {
+      value: C(() => e.searchValue !== void 0 ? e.searchValue : e.inputValue),
       postState: (d) => d || ""
-    }), h = (d) => {
-      var g;
-      v(d), (g = e.onSearch) === null || g === void 0 || g.call(e, d);
-    }, x = ma(re(e, "treeData"), re(e, "children"), re(e, "treeDataSimpleMode")), {
-      keyEntities: S,
-      valueEntities: V
-    } = ba(x, o), k = (d) => {
-      const g = [], m = [];
-      return d.forEach((N) => {
-        V.value.has(N) ? m.push(N) : g.push(N);
+    }), p = (d) => {
+      var m;
+      v(d), (m = e.onSearch) === null || m === void 0 || m.call(e, d);
+    }, y = ma(re(e, "treeData"), re(e, "children"), re(e, "treeDataSimpleMode")), {
+      keyEntities: g,
+      valueEntities: N
+    } = ba(y, o), K = (d) => {
+      const m = [], b = [];
+      return d.forEach((k) => {
+        N.value.has(k) ? b.push(k) : m.push(k);
       }), {
-        missingRawValues: g,
-        existRawValues: m
+        missingRawValues: m,
+        existRawValues: b
       };
-    }, K = Sa(x, f, {
+    }, E = Sa(y, f, {
       fieldNames: o,
       treeNodeFilterProp: re(e, "treeNodeFilterProp"),
       filterTreeNode: re(e, "filterTreeNode")
-    }), F = (d) => {
+    }), x = (d) => {
       if (d) {
         if (e.treeNodeLabelProp)
           return d[e.treeNodeLabelProp];
         const {
-          _title: g
+          _title: m
         } = o.value;
-        for (let m = 0; m < g.length; m += 1) {
-          const N = d[g[m]];
-          if (N !== void 0)
-            return N;
+        for (let b = 0; b < m.length; b += 1) {
+          const k = d[m[b]];
+          if (k !== void 0)
+            return k;
         }
       }
-    }, O = (d) => na(d).map((m) => wa(m) ? {
-      value: m
-    } : m), p = (d) => O(d).map((m) => {
+    }, O = (d) => na(d).map((b) => wa(b) ? {
+      value: b
+    } : b), h = (d) => O(d).map((b) => {
       let {
-        label: N
-      } = m;
+        label: k
+      } = b;
       const {
-        value: P,
+        value: A,
         halfChecked: _
-      } = m;
+      } = b;
       let I;
-      const T = V.value.get(P);
-      return T && (N = N ?? F(T.node), I = T.node.disabled), {
-        label: N,
-        value: P,
+      const T = N.value.get(A);
+      return T && (k = k ?? x(T.node), I = T.node.disabled), {
+        label: k,
+        value: A,
         halfChecked: _,
         disabled: I
       };
-    }), [w, E] = tt(e.defaultValue, {
+    }), [V, D] = tt(e.defaultValue, {
       value: re(e, "value")
-    }), A = y(() => O(w.value)), L = j([]), z = j([]);
+    }), F = C(() => O(V.value)), L = j([]), z = j([]);
     Qe(() => {
-      const d = [], g = [];
-      A.value.forEach((m) => {
-        m.halfChecked ? g.push(m) : d.push(m);
-      }), L.value = d, z.value = g;
+      const d = [], m = [];
+      F.value.forEach((b) => {
+        b.halfChecked ? m.push(b) : d.push(b);
+      }), L.value = d, z.value = m;
     });
-    const Y = y(() => L.value.map((d) => d.value)), {
+    const Y = C(() => L.value.map((d) => d.value)), {
       maxLevel: B,
       levelEntities: le
-    } = Yt(S), [q, se] = Ca(L, z, n, S, B, le), ce = y(() => {
-      const m = rt(q.value, e.showCheckedStrategy, S.value, o.value).map((_) => {
+    } = Yt(g), [q, se] = Ca(L, z, n, g, B, le), ce = C(() => {
+      const b = rt(q.value, e.showCheckedStrategy, g.value, o.value).map((_) => {
         var I, T, R;
-        return (R = (T = (I = S.value[_]) === null || I === void 0 ? void 0 : I.node) === null || T === void 0 ? void 0 : T[o.value.value]) !== null && R !== void 0 ? R : _;
+        return (R = (T = (I = g.value[_]) === null || I === void 0 ? void 0 : I.node) === null || T === void 0 ? void 0 : T[o.value.value]) !== null && R !== void 0 ? R : _;
       }).map((_) => {
         const I = L.value.find((T) => T.value === _);
         return {
           value: _,
           label: I == null ? void 0 : I.label
         };
-      }), N = p(m), P = N[0];
-      return !s.value && P && nt(P.value) && nt(P.label) ? [] : N.map((_) => {
+      }), k = h(b), A = k[0];
+      return !s.value && A && nt(A.value) && nt(A.label) ? [] : k.map((_) => {
         var I;
-        return b(b({}, _), {
+        return S(S({}, _), {
           label: (I = _.label) !== null && I !== void 0 ? I : _.value
         });
       });
-    }), [ie] = ya(ce), ne = (d, g, m) => {
-      const N = p(d);
-      if (E(N), e.autoClearSearchValue && v(""), e.onChange) {
-        let P = d;
-        n.value && (P = rt(d, e.showCheckedStrategy, S.value, o.value).map((te) => {
-          const Ve = V.value.get(te);
+    }), [ie] = ya(ce), ne = (d, m, b) => {
+      const k = h(d);
+      if (D(k), e.autoClearSearchValue && v(""), e.onChange) {
+        let A = d;
+        n.value && (A = rt(d, e.showCheckedStrategy, g.value, o.value).map((te) => {
+          const Ve = N.value.get(te);
           return Ve ? Ve.node[o.value.value] : te;
         }));
         const {
           triggerValue: _,
           selected: I
-        } = g || {
+        } = m || {
           triggerValue: void 0,
           selected: void 0
         };
-        let T = P;
+        let T = A;
         if (e.treeCheckStrictly) {
-          const W = z.value.filter((te) => !P.includes(te.value));
+          const W = z.value.filter((te) => !A.includes(te.value));
           T = [...T, ...W];
         }
-        const R = p(T), Z = {
+        const R = h(T), Z = {
           // [Legacy] Always return as array contains label & value
           preValue: L.value,
           triggerValue: _
         };
         let ee = !0;
-        (e.treeCheckStrictly || m === "selection" && !I) && (ee = !1), pa(Z, _, d, x.value, ee, o.value), r.value ? Z.checked = I : Z.selected = I;
+        (e.treeCheckStrictly || b === "selection" && !I) && (ee = !1), pa(Z, _, d, y.value, ee, o.value), l.value ? Z.checked = I : Z.selected = I;
         const $ = u.value ? R : R.map((W) => W.value);
         e.onChange(s.value ? $ : $[0], u.value ? null : R.map((W) => W.label), Z);
       }
-    }, G = (d, g) => {
+    }, G = (d, m) => {
       let {
-        selected: m,
-        source: N
-      } = g;
-      var P, _, I;
-      const T = ae(S.value), R = ae(V.value), Z = T[d], ee = Z == null ? void 0 : Z.node, $ = (P = ee == null ? void 0 : ee[o.value.value]) !== null && P !== void 0 ? P : d;
+        selected: b,
+        source: k
+      } = m;
+      var A, _, I;
+      const T = ae(g.value), R = ae(N.value), Z = T[d], ee = Z == null ? void 0 : Z.node, $ = (A = ee == null ? void 0 : ee[o.value.value]) !== null && A !== void 0 ? A : d;
       if (!s.value)
         ne([$], {
           selected: !0,
           triggerValue: $
         }, "option");
       else {
-        let W = m ? [...Y.value, $] : q.value.filter((te) => te !== $);
+        let W = b ? [...Y.value, $] : q.value.filter((te) => te !== $);
         if (n.value) {
           const {
             missingRawValues: te,
             existRawValues: Ve
-          } = k(W), Ze = Ve.map((Re) => R.get(Re).key);
+          } = K(W), Ze = Ve.map((Re) => R.get(Re).key);
           let Me;
-          m ? {
+          b ? {
             checkedKeys: Me
           } = Ye(Ze, !0, T, B.value, le.value) : {
             checkedKeys: Me
@@ -784,27 +784,27 @@ const xa = Ie({
           }, T, B.value, le.value), W = [...te, ...Me.map((Re) => T[Re].node[o.value.value])];
         }
         ne(W, {
-          selected: m,
+          selected: b,
           triggerValue: $
-        }, N || "option");
+        }, k || "option");
       }
-      m || !s.value ? (_ = e.onSelect) === null || _ === void 0 || _.call(e, $, Ge(ee)) : (I = e.onDeselect) === null || I === void 0 || I.call(e, $, Ge(ee));
+      b || !s.value ? (_ = e.onSelect) === null || _ === void 0 || _.call(e, $, Ge(ee)) : (I = e.onDeselect) === null || I === void 0 || I.call(e, $, Ge(ee));
     }, me = (d) => {
       if (e.onDropdownVisibleChange) {
-        const g = {};
-        Object.defineProperty(g, "documentClickClose", {
+        const m = {};
+        Object.defineProperty(m, "documentClickClose", {
           get() {
             return !1;
           }
-        }), e.onDropdownVisibleChange(d, g);
+        }), e.onDropdownVisibleChange(d, m);
       }
-    }, ye = (d, g) => {
-      const m = d.map((N) => N.value);
-      if (g.type === "clear") {
-        ne(m, {}, "selection");
+    }, ye = (d, m) => {
+      const b = d.map((k) => k.value);
+      if (m.type === "clear") {
+        ne(b, {}, "selection");
         return;
       }
-      g.values.length && G(g.values[0].value, {
+      m.values.length && G(m.values[0].value, {
         selected: !1,
         source: "selection"
       });
@@ -812,8 +812,8 @@ const xa = Ie({
       treeNodeFilterProp: be,
       // Data
       loadData: ue,
-      treeLoadedKeys: C,
-      onTreeLoad: D,
+      treeLoadedKeys: w,
+      onTreeLoad: P,
       // Expanded
       treeDefaultExpandAll: M,
       treeExpandedKeys: Q,
@@ -834,10 +834,10 @@ const xa = Ie({
       treeExpandAction: He
     } = mt(e);
     jt(lt({
-      checkable: r,
+      checkable: l,
       loadData: ue,
-      treeLoadedKeys: C,
-      onTreeLoad: D,
+      treeLoadedKeys: w,
+      onTreeLoad: P,
       checkedKeys: q,
       halfCheckedKeys: se,
       treeDefaultExpandAll: M,
@@ -850,13 +850,13 @@ const xa = Ie({
       switcherIcon: Ae,
       treeLine: De,
       treeNodeFilterProp: be,
-      keyEntities: S,
+      keyEntities: g,
       customSlots: Fe
     })), sa(lt({
       virtual: Le,
       listHeight: _e,
       listItemHeight: Ee,
-      treeData: K,
+      treeData: E,
       fieldNames: o,
       onSelect: G,
       dropdownMatchSelectWidth: Oe,
@@ -873,12 +873,12 @@ const xa = Ie({
         (d = J.value) === null || d === void 0 || d.blur();
       },
       scrollTo(d) {
-        var g;
-        (g = J.value) === null || g === void 0 || g.scrollTo(d);
+        var m;
+        (m = J.value) === null || m === void 0 || m.scrollTo(d);
       }
     }), () => {
       var d;
-      const g = Ne(e, [
+      const m = Ne(e, [
         "id",
         "prefixCls",
         "customSlots",
@@ -931,16 +931,16 @@ const xa = Ie({
       ]);
       return U(Bt, X(X(X({
         ref: J
-      }, c), g), {}, {
-        id: l,
+      }, c), m), {}, {
+        id: r,
         prefixCls: e.prefixCls,
         mode: s.value ? "multiple" : void 0,
         displayValues: ie.value,
         onDisplayValuesChange: ye,
         searchValue: f.value,
-        onSearch: h,
+        onSearch: p,
         OptionList: ua,
-        emptyOptions: !x.value.length,
+        emptyOptions: !y.value.length,
         onDropdownVisibleChange: me,
         tagRender: e.tagRender || t.tagRender,
         dropdownMatchSelectWidth: (d = e.dropdownMatchSelectWidth) !== null && d !== void 0 ? d : !0
@@ -1006,7 +1006,7 @@ function Ia(e, i) {
 }
 const ot = (e, i, c) => c !== void 0 ? c : `${e}-${i}`;
 function Na() {
-  return b(b({}, Ne(ft(), ["showTreeIcon", "treeMotion", "inputIcon", "getInputElement", "treeLine", "customSlots"])), {
+  return S(S({}, Ne(ft(), ["showTreeIcon", "treeMotion", "inputIcon", "getInputElement", "treeLine", "customSlots"])), {
     suffixIcon: he.any,
     size: ze(),
     bordered: At(),
@@ -1041,53 +1041,53 @@ const Xe = Ie({
       attrs: c,
       slots: a,
       expose: t,
-      emit: l
+      emit: r
     } = i;
     Nt(!(e.treeData === void 0 && a.default)), We(e.multiple !== !1 || !e.treeCheckable, "TreeSelect", "`multiple` will always be `true` when `treeCheckable` is true"), We(e.replaceFields === void 0, "TreeSelect", "`replaceFields` is deprecated, please use fieldNames instead"), We(!e.dropdownClassName, "TreeSelect", "`dropdownClassName` is deprecated. Please use `popupClassName` instead.");
-    const n = Qt(), r = Jt.useInject(), u = y(() => Zt(r.status, e.status)), {
+    const n = Qt(), l = Jt.useInject(), u = C(() => Zt(l.status, e.status)), {
       prefixCls: s,
       renderEmpty: o,
       direction: f,
       virtual: v,
-      dropdownMatchSelectWidth: h,
-      size: x,
-      getPopupContainer: S,
-      getPrefixCls: V,
-      disabled: k
+      dropdownMatchSelectWidth: p,
+      size: y,
+      getPopupContainer: g,
+      getPrefixCls: N,
+      disabled: K
     } = kt("select", e), {
-      compactSize: K,
-      compactItemClassnames: F
-    } = Tt(s, f), O = y(() => K.value || x.value), p = Lt(), w = y(() => {
-      var C;
-      return (C = k.value) !== null && C !== void 0 ? C : p.value;
-    }), E = y(() => V()), A = y(() => e.placement !== void 0 ? e.placement : f.value === "rtl" ? "bottomRight" : "bottomLeft"), L = y(() => ot(E.value, _t(A.value), e.transitionName)), z = y(() => ot(E.value, "", e.choiceTransitionName)), Y = y(() => V("select-tree", e.prefixCls)), B = y(() => V("tree-select", e.prefixCls)), [le, q] = Wt(s), [se] = Ia(B, Y), ce = y(() => at(e.popupClassName || e.dropdownClassName, `${B.value}-dropdown`, {
+      compactSize: E,
+      compactItemClassnames: x
+    } = Tt(s, f), O = C(() => E.value || y.value), h = Lt(), V = C(() => {
+      var w;
+      return (w = K.value) !== null && w !== void 0 ? w : h.value;
+    }), D = C(() => N()), F = C(() => e.placement !== void 0 ? e.placement : f.value === "rtl" ? "bottomRight" : "bottomLeft"), L = C(() => ot(D.value, _t(F.value), e.transitionName)), z = C(() => ot(D.value, "", e.choiceTransitionName)), Y = C(() => N("select-tree", e.prefixCls)), B = C(() => N("tree-select", e.prefixCls)), [le, q] = Wt(s), [se] = Ia(B, Y), ce = C(() => at(e.popupClassName || e.dropdownClassName, `${B.value}-dropdown`, {
       [`${B.value}-dropdown-rtl`]: f.value === "rtl"
-    }, q.value)), ie = y(() => !!(e.treeCheckable || e.multiple)), ne = y(() => e.showArrow !== void 0 ? e.showArrow : e.loading || !ie.value), G = pe();
+    }, q.value)), ie = C(() => !!(e.treeCheckable || e.multiple)), ne = C(() => e.showArrow !== void 0 ? e.showArrow : e.loading || !ie.value), G = pe();
     t({
       focus() {
-        var C, D;
-        (D = (C = G.value).focus) === null || D === void 0 || D.call(C);
+        var w, P;
+        (P = (w = G.value).focus) === null || P === void 0 || P.call(w);
       },
       blur() {
-        var C, D;
-        (D = (C = G.value).blur) === null || D === void 0 || D.call(C);
+        var w, P;
+        (P = (w = G.value).blur) === null || P === void 0 || P.call(w);
       }
     });
     const me = function() {
-      for (var C = arguments.length, D = new Array(C), M = 0; M < C; M++)
-        D[M] = arguments[M];
-      l("update:value", D[0]), l("change", ...D), n.onFieldChange();
-    }, ye = (C) => {
-      l("update:treeExpandedKeys", C), l("treeExpand", C);
-    }, be = (C) => {
-      l("update:searchValue", C), l("search", C);
-    }, ue = (C) => {
-      l("blur", C), n.onFieldBlur();
+      for (var w = arguments.length, P = new Array(w), M = 0; M < w; M++)
+        P[M] = arguments[M];
+      r("update:value", P[0]), r("change", ...P), n.onFieldChange();
+    }, ye = (w) => {
+      r("update:treeExpandedKeys", w), r("treeExpand", w);
+    }, be = (w) => {
+      r("update:searchValue", w), r("search", w);
+    }, ue = (w) => {
+      r("blur", w), n.onFieldBlur();
     };
     return () => {
-      var C, D, M;
+      var w, P, M;
       const {
-        notFoundContent: Q = (C = a.notFoundContent) === null || C === void 0 ? void 0 : C.call(a),
+        notFoundContent: Q = (w = a.notFoundContent) === null || w === void 0 ? void 0 : w.call(a),
         prefixCls: ke,
         bordered: Te,
         listHeight: Le,
@@ -1096,7 +1096,7 @@ const Xe = Ie({
         treeIcon: De,
         treeLine: xe,
         showArrow: Pe,
-        switcherIcon: Ae = (D = a.switcherIcon) === null || D === void 0 ? void 0 : D.call(a),
+        switcherIcon: Ae = (P = a.switcherIcon) === null || P === void 0 ? void 0 : P.call(a),
         fieldNames: Ke = e.replaceFields,
         id: Fe = n.id.value,
         placeholder: Oe = (M = a.placeholder) === null || M === void 0 ? void 0 : M.call(a)
@@ -1104,30 +1104,30 @@ const Xe = Ie({
         isFormItemInput: He,
         hasFeedback: J,
         feedbackIcon: d
-      } = r, {
-        suffixIcon: g,
-        removeIcon: m,
-        clearIcon: N
-      } = Ut(b(b({}, e), {
+      } = l, {
+        suffixIcon: m,
+        removeIcon: b,
+        clearIcon: k
+      } = Ut(S(S({}, e), {
         multiple: ie.value,
         showArrow: ne.value,
         hasFeedback: J,
         feedbackIcon: d,
         prefixCls: s.value
       }), a);
-      let P;
-      Q !== void 0 ? P = Q : P = o("Select");
+      let A;
+      Q !== void 0 ? A = Q : A = o("Select");
       const _ = Ne(e, ["suffixIcon", "itemIcon", "removeIcon", "clearIcon", "switcherIcon", "bordered", "status", "onUpdate:value", "onUpdate:treeExpandedKeys", "onUpdate:searchValue"]), I = at(!ke && B.value, {
         [`${s.value}-lg`]: O.value === "large",
         [`${s.value}-sm`]: O.value === "small",
         [`${s.value}-rtl`]: f.value === "rtl",
         [`${s.value}-borderless`]: !Te,
         [`${s.value}-in-form-item`]: He
-      }, ea(s.value, u.value, J), F.value, c.class, q.value), T = {};
+      }, ea(s.value, u.value, J), x.value, c.class, q.value), T = {};
       return e.treeData === void 0 && a.default && (T.children = Et(a.default())), le(se(U(xa, X(X(X(X({}, c), _), {}, {
-        disabled: w.value,
+        disabled: V.value,
         virtual: v.value,
-        dropdownMatchSelectWidth: h.value,
+        dropdownMatchSelectWidth: p.value,
         id: Fe,
         fieldNames: Ke,
         ref: G,
@@ -1136,14 +1136,14 @@ const Xe = Ie({
         listHeight: Le,
         listItemHeight: _e,
         treeLine: !!xe,
-        inputIcon: g,
+        inputIcon: m,
         multiple: Ee,
-        removeIcon: m,
-        clearIcon: N,
+        removeIcon: b,
+        clearIcon: k,
         switcherIcon: (R) => ta(Y.value, Ae, R, a.leafIcon, xe),
         showTreeIcon: De,
-        notFoundContent: P,
-        getPopupContainer: S == null ? void 0 : S.value,
+        notFoundContent: A,
+        getPopupContainer: g == null ? void 0 : g.value,
         treeMotion: null,
         dropdownClassName: ce.value,
         choiceTransitionName: z.value,
@@ -1153,23 +1153,23 @@ const Xe = Ie({
         onTreeExpand: ye
       }, T), {}, {
         transitionName: L.value,
-        customSlots: b(b({}, a), {
+        customSlots: S(S({}, a), {
           treeCheckable: () => U("span", {
             class: `${s.value}-tree-checkbox-inner`
           }, null)
         }),
         maxTagPlaceholder: e.maxTagPlaceholder || a.maxTagPlaceholder,
-        placement: A.value,
+        placement: F.value,
         showArrow: J || Pe,
         placeholder: Oe
-      }), b(b({}, a), {
+      }), S(S({}, a), {
         treeCheckable: () => U("span", {
           class: `${s.value}-tree-checkbox-inner`
         }, null)
       }))));
     };
   }
-}), st = ge, ct = b(Xe, {
+}), st = ge, ct = S(Xe, {
   TreeNode: ge,
   SHOW_ALL: da,
   SHOW_PARENT: vt,
@@ -1178,54 +1178,54 @@ const Xe = Ie({
 }), fe = yt({});
 function ka(e) {
   we(() => e.categoryList, (t) => {
-    t.forEach(async (l) => {
-      if (!fe[l.id]) {
-        const n = await Kt.getCategoryValues(l.id), { flatAttributeValue: r, treeAttributeValue: u, showWay: s } = n.body;
-        fe[l.id] = s === "TREE" ? u : r;
+    t.forEach(async (r) => {
+      if (!fe[r.id]) {
+        const n = await Kt.getCategoryValues(r.id), { flatAttributeValue: l, treeAttributeValue: u, showWay: s } = n.body;
+        fe[r.id] = s === "TREE" ? u : l;
       }
     });
   }, { immediate: !0, deep: !0 });
-  const i = (t, l) => {
-    for (let n = 0; n < l.length; n++) {
-      const r = l[n];
-      if (r.id === t)
-        return r.attributeName;
-      if (r.children && r.children.length) {
-        const u = i(t, r.children);
+  const i = (t, r) => {
+    for (let n = 0; n < r.length; n++) {
+      const l = r[n];
+      if (l.id === t)
+        return l.attributeName;
+      if (l.children && l.children.length) {
+        const u = i(t, l.children);
         if (u)
           return u;
       }
     }
     return "";
-  }, c = (t, l) => {
-    const n = [], r = /* @__PURE__ */ new Set(), u = (o) => {
-      if (r.has(o.id) || (r.add(o.id), n.push(o)), o.children && o.children.length)
+  }, c = (t, r) => {
+    const n = [], l = /* @__PURE__ */ new Set(), u = (o) => {
+      if (l.has(o.id) || (l.add(o.id), n.push(o)), o.children && o.children.length)
         for (let f = 0; f < o.children.length; f++)
           u(o.children[f]);
     }, s = (o, f) => {
       for (let v = 0; v < f.length; v++) {
-        const h = f[v];
-        if (h.id === o)
-          return u(h), !0;
-        if (h.children && h.children.length && s(o, h.children))
+        const p = f[v];
+        if (p.id === o)
+          return u(p), !0;
+        if (p.children && p.children.length && s(o, p.children))
           return !0;
       }
       return !1;
     };
     for (let o = 0; o < t.length; o++)
-      s(t[o], l);
+      s(t[o], r);
     return n;
   };
   return {
     categoryValuesMap: fe,
     getDeleteAttributesNames: (t) => {
       var o, f;
-      const l = c(t.attributeValueIds_view || [], fe[t.id] || []), n = /* @__PURE__ */ new Set();
-      for (let v = 0; v < l.length; v++)
-        n.add(l[v].id);
-      const r = c(t.defaultValueIds || [], fe[t.id] || []), u = /* @__PURE__ */ new Map();
+      const r = c(t.attributeValueIds_view || [], fe[t.id] || []), n = /* @__PURE__ */ new Set();
       for (let v = 0; v < r.length; v++)
-        u.set(r[v].id, r[v].attributeName);
+        n.add(r[v].id);
+      const l = c(t.defaultValueIds || [], fe[t.id] || []), u = /* @__PURE__ */ new Map();
+      for (let v = 0; v < l.length; v++)
+        u.set(l[v].id, l[v].attributeName);
       return (f = (o = t.defaultValueIds) == null ? void 0 : o.filter((v) => !n.has(v))) == null ? void 0 : f.map((v) => u.get(v) || i(v, fe[t.id] || [])).filter(Boolean).join("、");
     }
   };
@@ -1247,83 +1247,85 @@ const Ta = { class: "crane-required" }, La = { class: "crane-category-tips" }, _
       default: () => []
     }
   },
-  setup(e, { expose: i }) {
-    const c = ct.SHOW_PARENT, a = e, t = pe(), l = pe(""), {
-      categoryValuesMap: n,
-      getDeleteAttributesNames: r
-    } = ka(a), u = y(() => ({
-      categoryList: a.categoryList
-    })), s = y(() => Object.values(n).some((f) => f.length > 0));
+  emits: ["onChange"],
+  setup(e, { expose: i, emit: c }) {
+    const a = ct.SHOW_PARENT, t = e, r = c, n = pe(), l = pe(""), {
+      categoryValuesMap: u,
+      getDeleteAttributesNames: s
+    } = ka(t), o = C(() => ({
+      categoryList: t.categoryList
+    })), f = C(() => Object.values(u).some((p) => p.length > 0));
     return i({
-      validate: () => new Promise((f, v) => {
-        if (!t.value) {
-          f(!0);
+      validate: () => new Promise((p, y) => {
+        if (!n.value) {
+          p(!0);
           return;
         }
-        t.value.validate().then(() => {
-          f(!0);
+        n.value.validate().then(() => {
+          p(!0);
         }).catch(() => {
-          v(!1);
+          y(!1);
         });
       })
-    }), (f, v) => s.value ? (oe(), et(H(la), {
+    }), (p, y) => f.value ? (oe(), et(H(la), {
       key: 0,
       class: "crane-category-wraper",
-      model: u.value,
+      model: o.value,
       ref_key: "formRef",
-      ref: t
+      ref: n
     }, {
       default: Be(() => [
         $e("div", Ta, de(H(Se)("category")), 1),
         $e("div", La, de(H(Se)("categotySelectTips")), 1),
-        v[1] || (v[1] = $e("div", { class: "crane-category-line" }, null, -1)),
-        (oe(!0), Ce(bt, null, Ct(u.value.categoryList, (h, x) => {
-          var S;
+        y[2] || (y[2] = $e("div", { class: "crane-category-line" }, null, -1)),
+        (oe(!0), Ce(bt, null, Ct(o.value.categoryList, (g, N) => {
+          var K;
           return St((oe(), et(H(aa), {
-            key: h.id,
-            label: h.categoryName,
-            name: ["categoryList", x, "attributeValueIds_view"],
+            key: g.id,
+            label: g.categoryName,
+            name: ["categoryList", N, "attributeValueIds_view"],
             rules: [{ required: !0, message: H(Se)("pleaseChoose"), trigger: ["change", "blur"] }]
           }, {
             default: Be(() => {
-              var V;
+              var E;
               return [
                 U(H(ct), {
                   treeCheckable: "",
                   treeDefaultExpandAll: "",
-                  "tree-data": H(n)[h.id],
+                  "tree-data": H(u)[g.id],
                   showSearch: "",
                   allowClear: "",
-                  value: h.attributeValueIds_view,
-                  "onUpdate:value": (k) => h.attributeValueIds_view = k,
+                  value: g.attributeValueIds_view,
+                  "onUpdate:value": (x) => g.attributeValueIds_view = x,
                   treeNodeFilterProp: "attributeName",
                   searchValue: l.value,
-                  "onUpdate:searchValue": v[0] || (v[0] = (k) => l.value = k),
+                  "onUpdate:searchValue": y[0] || (y[0] = (x) => l.value = x),
                   fieldNames: { label: "attributeName", value: "id" },
                   treeNodeLabelProp: "attributeName",
-                  "show-checked-strategy": H(c),
-                  virtual: !0
+                  "show-checked-strategy": H(a),
+                  virtual: !0,
+                  onChange: y[1] || (y[1] = (x) => r("onChange"))
                 }, {
-                  title: Be(({ attributeName: k }) => [
-                    l.value.toLowerCase() && k.includes(l.value.toLowerCase()) ? (oe(), Ce("span", _a, de(k), 1)) : (oe(), Ce("span", Ea, de(k), 1))
+                  title: Be(({ attributeName: x }) => [
+                    l.value.toLowerCase() && x.includes(l.value.toLowerCase()) ? (oe(), Ce("span", _a, de(x), 1)) : (oe(), Ce("span", Ea, de(x), 1))
                   ]),
                   _: 2
                 }, 1032, ["tree-data", "value", "onUpdate:value", "searchValue", "show-checked-strategy"]),
-                (V = h.attributeValueIds_view) != null && V.includes(-1) ? (oe(), Ce("span", Da, de(H(Se)("categoryChangeTips", { category: h.categoryName })), 1)) : je("", !0),
-                H(r)(h) ? (oe(), Ce("span", Pa, de(H(Se)("deleteCategoryTips", { categorys: H(r)(h) })), 1)) : je("", !0)
+                (E = g.attributeValueIds_view) != null && E.includes(-1) ? (oe(), Ce("span", Da, de(H(Se)("categoryChangeTips", { category: g.categoryName })), 1)) : je("", !0),
+                H(s)(g) ? (oe(), Ce("span", Pa, de(H(Se)("deleteCategoryTips", { categorys: H(s)(g) })), 1)) : je("", !0)
               ];
             }),
             _: 2
           }, 1032, ["label", "name", "rules"])), [
-            [wt, (S = H(n)[h.id]) == null ? void 0 : S.length]
+            [wt, (K = H(u)[g.id]) == null ? void 0 : K.length]
           ]);
         }), 128))
       ]),
       _: 1,
-      __: [1]
+      __: [2]
     }, 8, ["model"])) : je("", !0);
   }
-}), Ma = /* @__PURE__ */ Ft(Aa, [["__scopeId", "data-v-b0210ff6"]]);
+}), Ma = /* @__PURE__ */ Ft(Aa, [["__scopeId", "data-v-db9afb32"]]);
 export {
   Ma as default
 };