@das-fed/upf-ui 6.4.0-dev.214 → 6.4.0-dev.216

package/packages/components/tree/index.js

@@ -1,5 +1,5 @@
 import '@das-fed/upf-ui/packages/components/tree/style.css';
-import { defineComponent as lr, openBlock as T, createBlock as ze, unref as i, createElementBlock as j, createElementVNode as Ne, renderSlot as B, createTextVNode as Se, toDisplayString as $e, ref as G, computed as X, watch as bt, nextTick as _e, onMounted as Sa, onBeforeUnmount as Ln, useAttrs as Kn, normalizeStyle as Ir, normalizeClass as Xe, mergeProps as xr, isRef as Nn, createSlots as Tt, withCtx as ke, createVNode as dt, createCommentVNode as A, withDirectives as ve, withModifiers as Ze, Fragment as Te, vShow as Mn, renderList as ht } from "vue";
+import { defineComponent as lr, openBlock as T, createBlock as ze, unref as i, createElementBlock as j, createElementVNode as Ne, renderSlot as B, createTextVNode as Se, toDisplayString as $e, ref as G, computed as X, watch as bt, nextTick as _e, onMounted as Sa, onBeforeUnmount as Ln, useAttrs as Kn, normalizeStyle as Ir, normalizeClass as Xe, mergeProps as xr, isRef as Nn, createSlots as Tt, withCtx as ke, createVNode as dt, createCommentVNode as A, withDirectives as ve, withModifiers as Ze, Fragment as we, vShow as Mn, renderList as ht } from "vue";
 import { withInstall as Aa } from "@das-fed/upf-utils/with-install/index";
 import { setThemeRule as Dn } from "@das-fed/upf-web/packages/theme/index";
 import { t as me, setI18nRule as Fn } from "@das-fed/upf-web/packages/i18n/index";
@@ -101,7 +101,7 @@ function lo(e) {
 function co(e) {
   return this.__data__.has(e);
 }
-var Pa = typeof global == "object" && global && global.Object === Object && global, uo = typeof self == "object" && self && self.Object === Object && self, we = Pa || uo || Function("return this")(), et = we.Symbol, Ea = Object.prototype, fo = Ea.hasOwnProperty, ho = Ea.toString, yt = et ? et.toStringTag : void 0;
+var Pa = typeof global == "object" && global && global.Object === Object && global, uo = typeof self == "object" && self && self.Object === Object && self, Oe = Pa || uo || Function("return this")(), et = Oe.Symbol, Ea = Object.prototype, fo = Ea.hasOwnProperty, ho = Ea.toString, yt = et ? et.toStringTag : void 0;
 function vo(e) {
   var t = fo.call(e, yt), r = e[yt];
   try {
@@ -131,7 +131,7 @@ function La(e) {
   var t = rt(e);
   return t == mo || t == Co || t == _o || t == To;
 }
-var Wt = we["__core-js_shared__"], Lr = function() {
+var Wt = Oe["__core-js_shared__"], Lr = function() {
   var e = /[^.]+$/.exec(Wt && Wt.keys && Wt.keys.IE_PROTO || "");
   return e ? "Symbol(src)_1." + e : "";
 }();
@@ -168,7 +168,7 @@ function He(e, t) {
   var r = Ko(e, t);
   return Lo(r) ? r : void 0;
 }
-var $t = He(we, "Map"), _t = He(Object, "create");
+var $t = He(Oe, "Map"), _t = He(Object, "create");
 function No() {
   this.__data__ = _t ? _t(null) : {}, this.size = 0;
 }
@@ -322,7 +322,7 @@ var Ma = Object.prototype, ss = Ma.hasOwnProperty, is = Ma.propertyIsEnumerable,
 function cs() {
   return !1;
 }
-var Da = typeof exports == "object" && exports && !exports.nodeType && exports, Mr = Da && typeof module == "object" && module && !module.nodeType && module, us = Mr && Mr.exports === Da, Dr = us ? we.Buffer : void 0, fs = Dr ? Dr.isBuffer : void 0, Fa = fs || cs, ds = 9007199254740991, hs = /^(?:0|[1-9]\d*)$/;
+var Da = typeof exports == "object" && exports && !exports.nodeType && exports, Mr = Da && typeof module == "object" && module && !module.nodeType && module, us = Mr && Mr.exports === Da, Dr = us ? Oe.Buffer : void 0, fs = Dr ? Dr.isBuffer : void 0, Fa = fs || cs, ds = 9007199254740991, hs = /^(?:0|[1-9]\d*)$/;
 function vs(e, t) {
   var r = typeof e;
   return t = t ?? ds, !!t && (r == "number" || r != "symbol" && hs.test(e)) && e > -1 && e % 1 == 0 && e < t;
@@ -409,7 +409,7 @@ function hr(e) {
 function ti(e, t) {
   return e && Et(t, hr(t), e);
 }
-var Va = typeof exports == "object" && exports && !exports.nodeType && exports, Br = Va && typeof module == "object" && module && !module.nodeType && module, ri = Br && Br.exports === Va, zr = ri ? we.Buffer : void 0, Ur = zr ? zr.allocUnsafe : void 0;
+var Va = typeof exports == "object" && exports && !exports.nodeType && exports, Br = Va && typeof module == "object" && module && !module.nodeType && module, ri = Br && Br.exports === Va, zr = ri ? Oe.Buffer : void 0, Ur = zr ? zr.allocUnsafe : void 0;
 function ai(e, t) {
   if (t)
     return e.slice();
@@ -463,7 +463,7 @@ function fi(e) {
 function di(e) {
   return Ya(e, hr, Ja);
 }
-var Qt = He(we, "DataView"), er = He(we, "Promise"), tr = He(we, "Set"), rr = He(we, "WeakMap"), Rr = "[object Map]", hi = "[object Object]", Vr = "[object Promise]", Hr = "[object Set]", Wr = "[object WeakMap]", qr = "[object DataView]", vi = Ve(Qt), yi = Ve($t), pi = Ve(er), gi = Ve(tr), bi = Ve(rr), Ee = rt;
+var Qt = He(Oe, "DataView"), er = He(Oe, "Promise"), tr = He(Oe, "Set"), rr = He(Oe, "WeakMap"), Rr = "[object Map]", hi = "[object Object]", Vr = "[object Promise]", Hr = "[object Set]", Wr = "[object WeakMap]", qr = "[object DataView]", vi = Ve(Qt), yi = Ve($t), pi = Ve(er), gi = Ve(tr), bi = Ve(rr), Ee = rt;
 (Qt && Ee(new Qt(new ArrayBuffer(1))) != qr || $t && Ee(new $t()) != Rr || er && Ee(er.resolve()) != Vr || tr && Ee(new tr()) != Hr || rr && Ee(new rr()) != Wr) && (Ee = function(e) {
   var t = rt(e), r = t == hi ? e.constructor : void 0, a = r ? Ve(r) : "";
   if (a)
@@ -486,7 +486,7 @@ function mi(e) {
   var t = e.length, r = new e.constructor(t);
   return t && typeof e[0] == "string" && _i.call(e, "index") && (r.index = e.index, r.input = e.input), r;
 }
-var Jr = we.Uint8Array;
+var Jr = Oe.Uint8Array;
 function yr(e) {
   var t = new e.constructor(e.byteLength);
   return new Jr(t).set(new Jr(e)), t;
@@ -580,11 +580,11 @@ function jt(e, t, r, a, c, d) {
     if (s = mi(e), !g)
       return ni(e, s);
   } else {
-    var C = Ee(e), L = C == Za || C == ll;
+    var C = Ee(e), K = C == Za || C == ll;
     if (Fa(e))
       return ai(e, g);
-    if (C == Qa || C == Xa || L && !c) {
-      if (s = b || L ? {} : qi(e), !g)
+    if (C == Qa || C == Xa || K && !c) {
+      if (s = b || K ? {} : qi(e), !g)
         return b ? ui(e, ti(s, e)) : li(e, Ys(s, e));
     } else {
       if (!z[C])
@@ -598,12 +598,12 @@ function jt(e, t, r, a, c, d) {
     return w;
   d.set(e, s), el(e) ? e.forEach(function(x) {
     s.add(jt(x, t, r, x, e, d));
-  }) : Xi(e) && e.forEach(function(x, K) {
-    s.set(K, jt(x, t, r, K, e, d));
+  }) : Xi(e) && e.forEach(function(x, N) {
+    s.set(N, jt(x, t, r, N, e, d));
   });
   var ce = h ? b ? di : fi : b ? hr : dr, O = M ? void 0 : ce(e);
-  return ts(O || e, function(x, K) {
-    O && (K = x, x = e[K]), Na(s, K, jt(x, t, r, K, e, d));
+  return ts(O || e, function(x, N) {
+    O && (N = x, x = e[N]), Na(s, N, jt(x, t, r, N, e, d));
   }), s;
 }
 var kl = 1, Sl = 4;
@@ -611,7 +611,7 @@ function Ue(e) {
   return jt(e, kl | Sl);
 }
 var Jt = function() {
-  return we.Date.now();
+  return Oe.Date.now();
 }, Al = /\s/;
 function Il(e) {
   for (var t = e.length; t-- && Al.test(e.charAt(t)); )
@@ -644,16 +644,16 @@ function ra(e) {
 }
 var Fl = "Expected a function", Bl = Math.max, zl = Math.min;
 function Ul(e, t, r) {
-  var a, c, d, s, g, b, h = 0, M = !1, C = !1, L = !0;
+  var a, c, d, s, g, b, h = 0, M = !1, C = !1, K = !0;
   if (typeof e != "function")
     throw new TypeError(Fl);
-  t = ra(t) || 0, Me(r) && (M = !!r.leading, C = "maxWait" in r, d = C ? Bl(ra(r.maxWait) || 0, t) : d, L = "trailing" in r ? !!r.trailing : L);
+  t = ra(t) || 0, Me(r) && (M = !!r.leading, C = "maxWait" in r, d = C ? Bl(ra(r.maxWait) || 0, t) : d, K = "trailing" in r ? !!r.trailing : K);
   function w(I) {
     var re = a, Z = c;
     return a = c = void 0, h = I, s = e.apply(Z, re), s;
   }
   function ce(I) {
-    return h = I, g = setTimeout(K, t), M ? w(I) : s;
+    return h = I, g = setTimeout(N, t), M ? w(I) : s;
   }
   function O(I) {
     var re = I - b, Z = I - h, te = t - re;
@@ -663,19 +663,19 @@ function Ul(e, t, r) {
     var re = I - b, Z = I - h;
     return b === void 0 || re >= t || re < 0 || C && Z >= d;
   }
-  function K() {
+  function N() {
     var I = Jt();
     if (x(I))
       return Ie(I);
-    g = setTimeout(K, O(I));
+    g = setTimeout(N, O(I));
   }
   function Ie(I) {
-    return g = void 0, L && a ? w(I) : (a = c = void 0, s);
+    return g = void 0, K && a ? w(I) : (a = c = void 0, s);
   }
   function Ce() {
     g !== void 0 && clearTimeout(g), h = 0, a = b = c = g = void 0;
   }
-  function oe() {
+  function se() {
     return g === void 0 ? s : Ie(Jt());
   }
   function ue() {
@@ -684,14 +684,14 @@ function Ul(e, t, r) {
       if (g === void 0)
         return ce(b);
       if (C)
-        return clearTimeout(g), g = setTimeout(K, t), w(b);
+        return clearTimeout(g), g = setTimeout(N, t), w(b);
     }
-    return g === void 0 && (g = setTimeout(K, t)), s;
+    return g === void 0 && (g = setTimeout(N, t)), s;
   }
-  return ue.cancel = Ce, ue.flush = oe, ue;
+  return ue.cancel = Ce, ue.flush = se, ue;
 }
 const Gl = (e, t, r, a, c, d, s, g, b, h) => {
-  const M = G(null), C = G([]), L = G(!1), w = X(() => ({
+  const M = G(null), C = G([]), K = G(!1), w = X(() => ({
     label: "name",
     children: "children",
     parentId: "parentId",
@@ -708,10 +708,10 @@ const Gl = (e, t, r, a, c, d, s, g, b, h) => {
     const y = e.operationsLabel[o];
     if (y)
       return typeof y == "function" ? y(u, l) : y;
-  }, x = G({}), K = (o, u) => {
+  }, x = G({}), N = (o, u) => {
     o && (x.value[u] = o);
-  }, Ie = G(null), Ce = G(null), oe = G({ node: null, data: null }), ue = (o, u) => {
-    Ce.value = x.value[u[e.nodeKey]], oe.value = {
+  }, Ie = G(null), Ce = G(null), se = G({ node: null, data: null }), ue = (o, u) => {
+    Ce.value = x.value[u[e.nodeKey]], se.value = {
       node: o,
       data: u
     };
@@ -719,7 +719,7 @@ const Gl = (e, t, r, a, c, d, s, g, b, h) => {
     var o;
     (o = Ie.value) == null || o.hide();
   }, re = G(""), Z = (o) => {
-    re.value = o ? oe.value.data[e.nodeKey] : "";
+    re.value = o ? se.value.data[e.nodeKey] : "";
   }, te = (o, u) => {
     var p, Y, D, je;
     let l = {};
@@ -774,14 +774,14 @@ const Gl = (e, t, r, a, c, d, s, g, b, h) => {
   }, De = (o, u) => {
     var l;
     return o ? u[(l = w.value) == null ? void 0 : l.label].includes(o) : !0;
-  }, se = (o, u) => {
+  }, ie = (o, u) => {
     let l = !1;
     return typeof w.value.disabled == "string" ? l = o[w.value.disabled] ?? !1 : typeof w.value.disabled == "function" && (l = w.value.disabled(o, u) ?? !1), l;
   }, Fe = (o, u = "parentId") => {
     var D;
     const l = o[u], y = (D = r.value) == null ? void 0 : D.store.nodesMap, p = (y == null ? void 0 : y[l]) ?? null;
     if (!p) return [null, null];
-    if (!se(p.data, p)) return [p.data, p];
+    if (!ie(p.data, p)) return [p.data, p];
     const Y = Fe(p.data, u);
     if (Y) return Y;
   }, Be = (o, u) => {
@@ -802,31 +802,31 @@ const Gl = (e, t, r, a, c, d, s, g, b, h) => {
     return o || u;
   }), k = async (o, u) => {
     var y;
-    if ((y = M.value) == null || y.click(), se(o, u)) return;
+    if ((y = M.value) == null || y.click(), ie(o, u)) return;
     let l = !0;
     if (e.changeNodeConfirm && (l = await e.changeNodeConfirm(o)), !!l) {
       if (!P.value) {
-        Oe(o, u);
+        Te(o, u);
         return;
       }
-      _++, N(o, u);
+      _++, E(o, u);
     }
-  }, N = Ul((...o) => {
+  }, E = Ul((...o) => {
     const [u, l] = o;
-    _ > 1 ? J(u, l) : Oe(u, l), _ = 0;
-  }, 500), J = (o, u) => {
+    _ > 1 ? q(u, l) : Te(u, l), _ = 0;
+  }, 500), q = (o, u) => {
     e.showCheckbox ? t("check-node-db-click", o, u) : t("node-db-click", o, u);
-  }, Oe = (o, u) => {
+  }, Te = (o, u) => {
     var l;
-    e.showCheckbox ? t("check-node-click", o, u) : (L.value = !0, c.value = o[e.nodeKey], (l = r.value) == null || l.setCurrentKey(c.value), o.path && (a.value = o.path), t("change", o[e.nodeKey], o), t("node-click", o, u), t("node-change", o));
-  }, ie = async (o, u) => {
+    e.showCheckbox ? t("check-node-click", o, u) : (K.value = !0, c.value = o[e.nodeKey], (l = r.value) == null || l.setCurrentKey(c.value), o.path && (a.value = o.path), t("change", o[e.nodeKey], o), t("node-click", o, u), t("node-change", o));
+  }, ae = async (o, u) => {
     await _e(), !(d.value && !e.showCheckbox && c.value && o[e.nodeKey] !== c.value) && t("current-change", o, u);
   }, Q = (o, u = !1) => {
     let l = !1;
     return e != null && e.nodeKey && (e.showCheckbox ? u && (l = !!c.value.includes(o[e.nodeKey])) : l = c.value === o[e.nodeKey]), l;
   }, ee = async (o) => {
     var u, l, y;
-    if (!se(o, null)) {
+    if (!ie(o, null)) {
       if (!e.showCheckbox)
         k(o);
       else {
@@ -847,7 +847,7 @@ const Gl = (e, t, r, a, c, d, s, g, b, h) => {
     return w.value.class && (typeof w.value.class == "string" ? y = w.value.class : y = w.value.class(o, u)), y && (l = `${l} ${y}`), Q(o) && (l = `${l} is-active`), Ke(u) && (l = `${l} show-draggable-icon`), l;
   }, be = async () => {
     var o;
-    return await _e(), L.value ? L.value = !1 : (e.showCheckbox || (o = r.value) == null || o.setCurrentKey(c.value, !0), !0);
+    return await _e(), K.value ? K.value = !1 : (e.showCheckbox || (o = r.value) == null || o.setCurrentKey(c.value, !0), !0);
   };
   return bt(
     () => e.data,
@@ -891,19 +891,19 @@ const Gl = (e, t, r, a, c, d, s, g, b, h) => {
     filterClear: ft,
     isActive: Q,
     expandParent: be,
-    disabledFlag: se,
+    disabledFlag: ie,
     currentOprationKey: re,
     getMergeOperations: te,
-    setOprationsMoreBtnRefs: K,
+    setOprationsMoreBtnRefs: N,
     oprationsPopoverRef: Ie,
     currentMoreBtnRef: Ce,
     moreBtnEnter: ue,
-    currentOprationItem: oe,
+    currentOprationItem: se,
     isLeafFlag: Be,
     filterCustomClass: Je,
     allowUnSelectFlag: ge,
     findSelectableParentNode: Fe,
-    currentChange: ie
+    currentChange: ae
   };
 };
 var wt = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
@@ -1329,8 +1329,8 @@ It.exports;
   function b(h, M) {
     if (M)
       return h.slice();
-    var C = h.length, L = g ? g(C) : new h.constructor(C);
-    return h.copy(L), L;
+    var C = h.length, K = g ? g(C) : new h.constructor(C);
+    return h.copy(K), K;
   }
   e.exports = b;
 })(It, It.exports);
@@ -1507,11 +1507,11 @@ function kt(e, t, r, a, c, d) {
     if (s = Lp(e), !g)
       return Sp(e, s);
   } else {
-    var C = Ep(e), L = C == mn || C == Xp;
+    var C = Ep(e), K = C == mn || C == Xp;
     if (Dp(e))
       return kp(e, g);
-    if (C == Cn || C == _n || L && !c) {
-      if (s = b || L ? {} : Np(e), !g)
+    if (C == Cn || C == _n || K && !c) {
+      if (s = b || K ? {} : Np(e), !g)
         return b ? Ip(e, jp(s, e)) : Ap(e, Op(s, e));
     } else {
       if (!U[C])
@@ -1525,12 +1525,12 @@ function kt(e, t, r, a, c, d) {
     return w;
   d.set(e, s), zp(e) ? e.forEach(function(x) {
     s.add(kt(x, t, r, x, e, d));
-  }) : Fp(e) && e.forEach(function(x, K) {
-    s.set(K, kt(x, t, r, K, e, d));
+  }) : Fp(e) && e.forEach(function(x, N) {
+    s.set(N, kt(x, t, r, N, e, d));
   });
   var ce = h ? b ? Pp : xp : b ? Gp : Up, O = M ? void 0 : ce(e);
-  return Tp(O || e, function(x, K) {
-    O && (K = x, x = e[K]), wp(s, K, kt(x, t, r, K, e, d));
+  return Tp(O || e, function(x, N) {
+    O && (N = x, x = e[N]), wp(s, N, kt(x, t, r, N, e, d));
   }), s;
 }
 var pg = kt, gg = pg, bg = 1, $g = 4;
@@ -1538,10 +1538,10 @@ function _g(e) {
   return gg(e, bg | $g);
 }
 var mg = _g;
-const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L, w, ce, O, x, K, Ie) => {
-  const Ce = G([]), oe = G(!1), ue = G(null), I = G(null);
+const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, K, w, ce, O, x, N, Ie) => {
+  const Ce = G([]), se = G(!1), ue = G(null), I = G(null);
   bt(
-    () => oe.value,
+    () => se.value,
     (_) => {
       if (!_) {
         I.value && I.value.close();
@@ -1564,36 +1564,44 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
       try {
         await M(), await _e();
         const k = (P = (_ = r.value) == null ? void 0 : _.store) == null ? void 0 : P.nodesMap;
-        if (!k)
+        if (!k) {
+          console.warn("[Tree] nodesMap 未准备好，批量加载取消");
           return;
-        const N = te.value.map((ie) => ie[e.nodeKey]), J = await e.batchLoad(N);
-        await _e();
-        let Oe = 0;
-        for (const ie of N) {
-          const Q = k[ie];
-          if (!Q)
+        }
+        const E = te.value.map((ae) => ae[e.nodeKey]);
+        console.log("[Tree] 开始批量加载", E.length, "个节点");
+        const q = await e.batchLoad(E);
+        console.log("[Tree] 批量加载返回:", Object.keys(q).length, "个节点的数据"), await _e();
+        let Te = 0;
+        for (const ae of E) {
+          const Q = k[ae];
+          if (!Q) {
+            console.warn("[Tree] 节点不存在，跳过:", ae);
             continue;
-          const ee = J[ie] || [];
-          Q.loaded = !0, Q.loading = !1, ee.length > 0 && (Q.childNodes = [], Q.doCreateChildren(ee), ce.value = Xt([...ce.value, ...ee], e.nodeKey), Oe++);
+          }
+          const ee = q[ae] || [];
+          Q.loaded = !0, Q.loading = !1, ee.length > 0 && (Q.childNodes = [], Q.doCreateChildren(ee), ce.value = Xt([...ce.value, ...ee], e.nodeKey), Te++);
         }
-      } catch {
+        console.log("[Tree] 批量加载完成，成功设置", Te, "个节点");
+      } catch (k) {
+        console.error("[Tree] 批量加载失败:", k);
       }
   }, de = async (_, P, k = !1) => {
     var Q, ee;
     await _e(), !ue.value && a.value && (fe.value = !0, ue.value = Pr.service({
       target: a.value
     }));
-    let N = {};
-    w(_.data, _) ? N = { data: [] } : N = await re(_.data, _.level), ue.value && (ue.value.close(), fe.value = !1);
-    let { data: J } = N;
-    J || (J = []);
-    let Oe = [];
-    const ie = ((Q = _ == null ? void 0 : _.childNodes) == null ? void 0 : Q.map((he) => he.data)) || [];
-    if (J && ie.length && J.length && ie.length === J.length) {
-      const he = Object.keys(J[0]), be = ie.map((l) => {
+    let E = {};
+    w(_.data, _) ? E = { data: [] } : E = await re(_.data, _.level), ue.value && (ue.value.close(), fe.value = !1);
+    let { data: q } = E;
+    q || (q = []);
+    let Te = [];
+    const ae = ((Q = _ == null ? void 0 : _.childNodes) == null ? void 0 : Q.map((he) => he.data)) || [];
+    if (q && ae.length && q.length && ae.length === q.length) {
+      const he = Object.keys(q[0]), be = ae.map((l) => {
         let y = {};
         return he.forEach((p) => y[p] = l[p]), y;
-      }), o = J.map((l) => {
+      }), o = q.map((l) => {
         let y = {};
         return he.forEach((p) => y[p] = l[p]), y;
       });
@@ -1601,7 +1609,7 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
         return _.loaded = !0, _.loading = !1, [];
     }
     if (_.level === 0) {
-      if (te.value = J, e.defaultExpandRoot) {
+      if (te.value = q, e.defaultExpandRoot) {
         const he = (ee = te.value) == null ? void 0 : ee.map((be) => be[e.nodeKey]);
         e.batchLoad && te.value.length > 0 ? setTimeout(async () => {
           await pe(), await _e(), x.value = Qe(he);
@@ -1609,21 +1617,21 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
       }
       k || (ye.value.push(_), qe.value.push(P));
     }
-    return ce.value = Xt([...ce.value, ...J, ...Oe], e.nodeKey), P && P(J), J;
+    return ce.value = Xt([...ce.value, ...q, ...Te], e.nodeKey), P && P(q), q;
   }, xe = G(!1), ft = async () => {
     xe.value = !0;
     const _ = await Z() || [];
     (!_ || !(_ != null && _.length)) && _.push({ [g.value.label]: me("暂无数据"), id: "nodata" }), Ce.value = _, xe.value = !1;
   }, De = () => {
     Ce.value = [];
-  }, se = async (_, P = !1) => {
-    var ie, Q, ee, he, be, o, u;
+  }, ie = async (_, P = !1) => {
+    var ae, Q, ee, he, be, o, u;
     let k = _ ?? {};
-    if (Ce.value = [], d.value = "", oe.value || P && C(k, null) || (k.path || (k.path = k[e.nodeKey] ?? ""), !k.path)) return;
-    const N = k.path.split(/[\/,]/);
-    N[0] !== e.rootNodeId && N.unshift(e.rootNodeId + "");
-    const J = (ie = r.value) == null ? void 0 : ie.store.nodesMap;
-    if (k[e.nodeKey] ? J[k[e.nodeKey]] : null) {
+    if (Ce.value = [], d.value = "", se.value || P && C(k, null) || (k.path || (k.path = k[e.nodeKey] ?? ""), !k.path)) return;
+    const E = k.path.split(/[\/,]/);
+    E[0] !== e.rootNodeId && E.unshift(e.rootNodeId + "");
+    const q = (ae = r.value) == null ? void 0 : ae.store.nodesMap;
+    if (k[e.nodeKey] ? q[k[e.nodeKey]] : null) {
       if (!e.showCheckbox)
         h(k);
       else if (P) {
@@ -1637,8 +1645,8 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
       t("filter-node-click", k);
     } else {
       let l = "", y = {};
-      oe.value = !0;
-      for (const p of N) {
+      se.value = !0;
+      for (const p of E) {
         await _e();
         const Y = (Q = r.value) == null ? void 0 : Q.store.nodesMap, D = Y == null ? void 0 : Y[p];
         if (!D) continue;
@@ -1660,13 +1668,13 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
         t("filter-node-click", y);
       }
     }
-    return oe.value = !1, !0;
+    return se.value = !1, !0;
   }, Fe = async () => {
     let _ = e.defaultExpandedPaths || [];
     if (e.showCheckbox ? b.value && b.value.length && (_ = [..._, ...b.value]) : b.value && (_ = _ == null ? void 0 : _.concat(b.value)), _.length) {
       _ = Array.from(new Set(_));
       for (const P of _)
-        await se({ path: P });
+        await ie({ path: P });
     }
     return !0;
   }, Be = () => new Promise((_) => {
@@ -1705,15 +1713,15 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
     search: Z,
     handleSearch: ft,
     handleSearchClear: De,
-    handleSearchResultItemClick: se,
+    handleSearchResultItemClick: ie,
     resetLazyLoad: Je
   };
 }, Tg = (e, t, r) => {
   let a = 0, c = "";
   const d = (b = "visible", h) => {
-    var L;
+    var K;
     if (!r.isEllipsis) return;
-    const M = (L = t.value) == null ? void 0 : L.$el.querySelectorAll(".el-tree-node__children"), C = (M == null ? void 0 : M.length) ?? 0;
+    const M = (K = t.value) == null ? void 0 : K.$el.querySelectorAll(".el-tree-node__children"), C = (M == null ? void 0 : M.length) ?? 0;
     !h && c === b && a === C || (a = C, c = b, M && M.length && M.forEach((w) => {
       w.classList.remove(c === "visible" ? "overflow-hide" : "overflow-visible"), w.classList.add(c === "visible" ? "overflow-visible" : "overflow-hide");
     }));
@@ -1834,7 +1842,7 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
       preview: import("@das-fed/upf-ui/packages/icons/preview"),
       view: import("@das-fed/upf-ui/packages/icons/view")
     });
-    const d = Kn(), s = G(), g = X(() => a.emptyText || me("暂无数据")), b = X(() => a.searchEmptyText || me("noDataTryAnotherKeyword")), h = X(() => d.lazy ?? !!M.value), M = X(() => a.load ?? void 0), C = G([]), L = X(() => a.search ?? void 0), w = X(() => a.showCheckbox ? O.value : []), ce = X(() => a.showCheckbox ? a.currentNodeKey : O.value), O = X({
+    const d = Kn(), s = G(), g = X(() => a.emptyText || me("暂无数据")), b = X(() => a.searchEmptyText || me("noDataTryAnotherKeyword")), h = X(() => d.lazy ?? !!M.value), M = X(() => a.load ?? void 0), C = G([]), K = X(() => a.search ?? void 0), w = X(() => a.showCheckbox ? O.value : []), ce = X(() => a.showCheckbox ? a.currentNodeKey : O.value), O = X({
       get() {
         return a.showCheckbox && !a.modelValue ? [] : a.modelValue;
       },
@@ -1846,26 +1854,26 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
       set: (n) => {
         c("update:path", n);
       }
-    }), K = G([]), Ie = X(() => {
-      let n = [...K.value, ...a.defaultExpandedKeys];
+    }), N = G([]), Ie = X(() => {
+      let n = [...N.value, ...a.defaultExpandedKeys];
       return Array.from(new Set(n));
     }), Ce = () => new Promise((n) => {
       const f = () => {
-        var S, v, $, E;
-        if ((v = (S = s.value) == null ? void 0 : S.store) != null && v.nodesMap && ((E = Object.keys(($ = s.value) == null ? void 0 : $.store.nodesMap)) == null ? void 0 : E.length) > 0)
+        var S, v, $, L;
+        if ((v = (S = s.value) == null ? void 0 : S.store) != null && v.nodesMap && ((L = Object.keys(($ = s.value) == null ? void 0 : $.store.nodesMap)) == null ? void 0 : L.length) > 0)
           return n(!0);
         setTimeout(() => f(), 50);
       };
       f();
-    }), oe = (n) => new Promise((f) => {
+    }), se = (n) => new Promise((f) => {
       let S = 0;
       const v = () => {
         if (!(!C.value || !C.value.length)) {
           if (Array.isArray(n)) {
-            const $ = C.value.filter((E) => n.includes(E[a.nodeKey]));
+            const $ = C.value.filter((L) => n.includes(L[a.nodeKey]));
             if ($.length === n.length) return f($);
           } else {
-            const $ = C.value.find((E) => E[a.nodeKey] === n);
+            const $ = C.value.find((L) => L[a.nodeKey] === n);
             if ($) return f($);
           }
           if (setTimeout(() => {
@@ -1877,44 +1885,45 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
       v();
     }), ue = async (n) => a.getGrandChildren ? await a.getGrandChildren(n) : [], I = (n, f) => {
       var v;
+      console.log(n, f);
       let S = n.childNodes.length;
       if (S > 0)
         for (let $ = 0; $ < S; $++) {
-          const E = f, q = n.childNodes[$];
-          if (ee(q.data, q)) {
-            I({ ...q, checked: E }, f);
+          const L = f, J = n.childNodes[$];
+          if (ee(J.data, J)) {
+            I({ ...J, checked: L }, f);
             continue;
           }
-          q.checked !== E && (q.checked = E), I(q, f);
+          J.checked !== L && (J.checked = L), I(J, f);
         }
       s.value && (O.value = (v = s.value) == null ? void 0 : v.getCheckedKeys());
     }, re = async (n, f) => {
-      var E, q, ae;
+      var L, J, ne;
       if (Y(n, null)) {
         if (f)
           O.value.includes(n[a.nodeKey]) || O.value.push(n[a.nodeKey]);
         else {
-          const ne = O.value.findIndex((H) => H === n[a.nodeKey]);
-          ne > -1 && O.value.splice(ne, 1);
+          const oe = O.value.findIndex((H) => H === n[a.nodeKey]);
+          oe > -1 && O.value.splice(oe, 1);
         }
-        return (E = s.value) == null || E.setCheckedKeys(O.value), pe.value = !0, [];
+        return (L = s.value) == null || L.setCheckedKeys(O.value), pe.value = !0, [];
       }
       let S = await ue(n);
       C.value = Xt([...C.value, ...S], a.nodeKey);
-      const v = S.concat(n), $ = Array.from(new Set(v.map((ne) => ne[a.nodeKey])));
+      const v = S.concat(n), $ = Array.from(new Set(v.map((oe) => oe[a.nodeKey])));
       if (f) {
-        const ne = O.value ?? [], H = Ue([...ne, ...$]);
-        O.value = Array.from(new Set(H)), (q = s.value) == null || q.setCheckedKeys(H);
+        const oe = O.value ?? [], H = Ue([...oe, ...$]);
+        O.value = Array.from(new Set(H)), (J = s.value) == null || J.setCheckedKeys(H);
       } else {
         const H = (O.value ?? []).filter((W) => !$.includes(W));
-        O.value = Array.from(new Set(H)), (ae = s.value) == null || ae.setCheckedKeys(H);
+        O.value = Array.from(new Set(H)), (ne = s.value) == null || ne.setCheckedKeys(H);
       }
       return S;
     }, Z = G([]), te = async (n, f) => {
       var v;
       if (h.value) {
         const $ = await re(n, f);
-        return c("check-node-change", O.value, n, f), Z.value = $.map((E) => E[a.nodeKey]), $;
+        return c("check-node-change", O.value, n, f), Z.value = $.map((L) => L[a.nodeKey]), $;
       }
       await _e();
       const S = (v = s.value) == null ? void 0 : v.getNode(n[a.nodeKey]);
@@ -1936,19 +1945,19 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
     }, fe = G(!1), pe = G(!1), de = async (n, f, S = !1) => {
       var H, W;
       pe.value = !0;
-      const { checkedKeys: v } = f, $ = v.includes(n[a.nodeKey]), E = O.value.includes(n[a.nodeKey]), q = a.keepSelected && !je(n) && E && !$;
+      const { checkedKeys: v } = f, $ = v.includes(n[a.nodeKey]), L = O.value.includes(n[a.nodeKey]), J = a.keepSelected && !je(n) && L && !$;
       await _e();
-      let ae = ((H = s.value) == null ? void 0 : H.getCheckedKeys()) || [];
-      if (q && (ae = Ue([...ae, n[a.nodeKey]]), a.showCheckbox && ((W = s.value) == null || W.setCheckedKeys(ae))), a.parentLinkChildrenStrictly || (O.value = ae), $ && a.childLinkParentStrictly && !fe.value) {
+      let ne = ((H = s.value) == null ? void 0 : H.getCheckedKeys()) || [];
+      if (J && (ne = Ue([...ne, n[a.nodeKey]]), a.showCheckbox && ((W = s.value) == null || W.setCheckedKeys(ne))), a.parentLinkChildrenStrictly || (O.value = ne), $ && a.childLinkParentStrictly && !fe.value) {
         const F = O.value ?? [];
         await qe(n, $), O.value = Array.from(/* @__PURE__ */ new Set([...F, ...O.value]));
       }
-      let ne = [];
-      a.parentLinkChildrenStrictly && !fe.value && (ne = await te(n, $)), a.parentLinkChildrenStrictly && h.value || (await _e(), c("check-node-change", O.value, n, $)), S && c("change", O.value, n, $, ne);
+      let oe = [];
+      a.parentLinkChildrenStrictly && !fe.value && (oe = await te(n, $)), a.parentLinkChildrenStrictly && h.value || (await _e(), c("check-node-change", O.value, n, $)), S && c("change", O.value, n, $, oe);
     }, xe = G(!1), {
       realHeight: ft,
       dasTree: De,
-      getMergeOperations: se,
+      getMergeOperations: ie,
       getOperations: Fe,
       handleOperation: Be,
       filterInnerValue: ge,
@@ -1957,10 +1966,10 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
       nodeClass: _,
       nodeClick: P,
       isActive: k,
-      defaultProps: N,
-      filterNodeMethodFn: J,
-      filterSeach: Oe,
-      filterClear: ie,
+      defaultProps: E,
+      filterNodeMethodFn: q,
+      filterSeach: Te,
+      filterClear: ae,
       expandParent: Q,
       disabledFlag: ee,
       currentOprationKey: he,
@@ -1975,7 +1984,7 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
       allowUnSelectFlag: je,
       findSelectableParentNode: Bt,
       currentChange: Tn
-    } = Gl(a, c, s, x, O, h, K, de, xe, d), {
+    } = Gl(a, c, s, x, O, h, N, de, xe, d), {
       rootLevelData: wn,
       searchLoading: zt,
       searchData: Ut,
@@ -1993,7 +2002,7 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
       h,
       ge,
       O,
-      N,
+      E,
       x,
       P,
       Ce,
@@ -2002,11 +2011,11 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
       Y,
       C,
       de,
-      K,
+      N,
       ue,
       xe
     ), An = () => {
-      L.value ? kr() : Oe();
+      K.value ? kr() : Te();
     };
     bt(
       () => ge.value,
@@ -2018,7 +2027,7 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
     bt(
       () => O.value,
       (n) => {
-        var v, $, E, q, ae, ne;
+        var v, $, L, J, ne, oe;
         const f = a.showCheckbox ? n ?? [] : n ?? void 0, S = a.showCheckbox ? Ye.value ?? [] : Ye.value ?? void 0;
         if (JSON.stringify(f) !== JSON.stringify(S)) {
           if (a.showCheckbox) {
@@ -2035,19 +2044,19 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
             return;
           }
           if (!h.value)
-            a.showCheckbox ? (E = s.value) == null || E.setCheckedKeys(f) : Q();
+            a.showCheckbox ? (L = s.value) == null || L.setCheckedKeys(f) : Q();
           else if (a.showCheckbox)
             if (!a.parentLinkChildrenStrictly || !a.dataLinkView) {
               const H = C.value.map((F) => F[a.nodeKey]), W = f.filter((F) => !H.includes(F));
               W && W.length ? Gt().then(() => {
                 var F;
                 s.value && ((F = s.value) == null || F.setCheckedKeys(f));
-              }) : s.value && ((ae = s.value) == null || ae.setCheckedKeys(f));
+              }) : s.value && ((ne = s.value) == null || ne.setCheckedKeys(f));
             } else {
-              if (s.value && ((ne = s.value) == null || ne.setCheckedKeys([])), f.length && S.length === 0)
+              if (s.value && ((oe = s.value) == null || oe.setCheckedKeys([])), f.length && S.length === 0)
                 for (let H of f) {
                   const W = Z.value.findIndex((F) => F === H);
-                  W !== -1 && Z.value.splice(W, 1), oe(H).then((F) => {
+                  W !== -1 && Z.value.splice(W, 1), se(H).then((F) => {
                     F && (fe.value = !0, de(F, { checkedKeys: [...f] }).then(() => {
                       pe.value = !1, fe.value = !1;
                     }));
@@ -2058,7 +2067,7 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
                 if (H && H.length)
                   for (let F of H) {
                     const m = Z.value.findIndex((le) => le === F);
-                    m !== -1 && Z.value.splice(m, 1), oe(F).then(async (le) => {
+                    m !== -1 && Z.value.splice(m, 1), se(F).then(async (le) => {
                       le && (fe.value = !0, de(le, { checkedKeys: [...f] }).then(() => {
                         pe.value = !1, fe.value = !1;
                       }));
@@ -2067,7 +2076,7 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
                 if (W && W.length)
                   for (let F of W) {
                     const m = Z.value.findIndex((le) => le === F);
-                    m !== -1 && Z.value.splice(m, 1), oe(F).then((le) => {
+                    m !== -1 && Z.value.splice(m, 1), se(F).then((le) => {
                       le && (fe.value = !0, de(le, { checkedKeys: [...f] }).then(() => {
                         pe.value = !1, fe.value = !1;
                       }));
@@ -2076,7 +2085,7 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
               }
             }
           else if (C.value.find((W) => W[a.nodeKey] === f))
-            (q = s.value) == null || q.setCurrentKey(f);
+            (J = s.value) == null || J.setCurrentKey(f);
           else {
             if (a.notAutoresetLazyLoad) return;
             Gt().then(() => {
@@ -2090,16 +2099,16 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
       { immediate: !0, deep: !0 }
     );
     const Rt = () => {
-      L.value ? kn() : ie();
+      K.value ? kn() : ae();
     }, In = X(() => a.parentLinkChildrenStrictly || a.childLinkParentStrictly ? !0 : !!(a.checkStrictly ?? h.value)), xn = X(() => h.value ? !!jn.value : a.loading), Vt = X(() => {
       var n, f;
       return h.value ? !((n = wn.value) != null && n.length) : !((f = a.data) != null && f.length);
     }), Sr = X(() => {
       var n;
-      if (L.value)
-        return !zt.value && ((n = Ut.value) == null ? void 0 : n.length) === 1 && Ut.value[0][N.value.label] === me("暂无数据");
+      if (K.value)
+        return !zt.value && ((n = Ut.value) == null ? void 0 : n.length) === 1 && Ut.value[0][E.value.label] === me("暂无数据");
       if (a.isFilter)
-        return Ke.value.length === 1 && Ke.value[0][N.value.label] === me("暂无数据");
+        return Ke.value.length === 1 && Ke.value[0][E.value.label] === me("暂无数据");
     }), { setTreeNodeChildrenOverflow: Pn } = Tg(De, s, a), En = () => {
       a.isEllipsis && Pn("hidden");
     };
@@ -2115,7 +2124,7 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
       /** 非懒加载：父级联动子级 */
       parentLinkChild: I,
       /** 清空搜索框并重新加载整棵树方法(用于懒加载重新请求整颗树的数据) */
-      resetLazyLoad: async () => ((L.value || a.isFilter) && (ge.value = "", Rt()), await Gt(), !0),
+      resetLazyLoad: async () => ((K.value || a.isFilter) && (ge.value = "", Rt()), await Gt(), !0),
       /** 自动展开父节点方法 */
       autoExpand: Q,
       /** 清空搜索值，回到tree面板 */
@@ -2123,9 +2132,9 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
       /** 懒加载获取到的所有平铺数据 */
       lazyData: C,
       /** 判断懒加载指定节点、节点集合是否全部加载完成 */
-      lazyDataNextTick: oe,
+      lazyDataNextTick: se,
       /** 非懒加载模式触发搜索 */
-      filterSeach: Oe,
+      filterSeach: Te,
       /** 懒加载模式触发搜索 */
       handleSearch: kr,
       /** 根据父级获取所有子孙节点(提供给tree-select组件使用) */
@@ -2145,7 +2154,7 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
           "root-checkbox_hide": n.hideRootCheckbox
         })
       }, [
-        (n.isFilter || L.value) && n.showFilterInput ? (T(), ze(i(zn), xr({
+        (n.isFilter || K.value) && n.showFilterInput ? (T(), ze(i(zn), xr({
           key: 0,
           class: "das-tree-filter-input",
           modelValue: i(ge),
@@ -2211,10 +2220,10 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
                 "current-node-key": ce.value,
                 "default-checked-keys": w.value,
                 "default-expanded-keys": Ie.value,
-                props: { ...i(N), class: i(_) },
+                props: { ...i(E), class: i(_) },
                 "show-checkbox": n.showCheckbox,
                 "expand-on-click-node": n.expandOnClickNode ?? n.showCheckbox,
-                "filter-node-method": i(J),
+                "filter-node-method": i(q),
                 draggable: n.draggable,
                 "allow-drag": n.allowDrag
               }, { ...i(d), onCurrentChange: void 0 }, {
@@ -2230,7 +2239,7 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
                     node: v,
                     data: $
                   }, () => {
-                    var E, q;
+                    var L, J;
                     return [
                       f[5] || (f[5] = Ne("div", null, null, -1)),
                       n.showOperations ? (T(), j("div", kg, [
@@ -2239,20 +2248,20 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
                           data: $
                         }, () => [
                           n.isEllipsis ? ve((T(), j("div", Sg, [
-                            Se($e($[i(N).label]), 1)
+                            Se($e($[i(E).label]), 1)
                           ])), [
                             [i(Pe)]
                           ]) : A("", !0),
-                          n.isEllipsis ? A("", !0) : (T(), j("div", Ag, $e($[i(N).label]), 1))
+                          n.isEllipsis ? A("", !0) : (T(), j("div", Ag, $e($[i(E).label]), 1))
                         ]),
-                        !i(ee)($, v) && ((q = (E = i(se)(v, $)) == null ? void 0 : E.list) != null && q.length || i(Fe)(v, $).length) ? (T(), j("div", {
+                        !i(ee)($, v) && ((J = (L = i(ie)(v, $)) == null ? void 0 : L.list) != null && J.length || i(Fe)(v, $).length) ? (T(), j("div", {
                           key: 0,
                           class: "oprations-box",
-                          onMouseenter: (ae) => i(l)(v, $)
+                          onMouseenter: (ne) => i(l)(v, $)
                         }, [
                           Ne("div", {
                             class: "more-icon",
-                            ref: (ae) => i(o)(ae, $[n.nodeKey]),
+                            ref: (ne) => i(o)(ne, $[n.nodeKey]),
                             style: Ir(i(he) === $[n.nodeKey] ? "opacity: 1" : ""),
                             onClick: f[1] || (f[1] = Ze(() => {
                             }, ["stop"]))
@@ -2265,12 +2274,12 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
                           ], 4)
                         ], 40, Ig)) : A("", !0)
                       ])) : A("", !0),
-                      n.showOperations ? A("", !0) : (T(), j(Te, { key: 1 }, [
+                      n.showOperations ? A("", !0) : (T(), j(we, { key: 1 }, [
                         n.isEllipsis ? ve((T(), j("div", xg, [
-                          Se($e($[i(N).label]), 1)
+                          Se($e($[i(E).label]), 1)
                         ])), [
                           [i(Pe)]
-                        ]) : (T(), j("div", Pg, $e($[i(N).label]), 1))
+                        ]) : (T(), j("div", Pg, $e($[i(E).label]), 1))
                       ], 64))
                     ];
                   })
@@ -2296,7 +2305,7 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
             ]), 1032, ["empty-text"]),
             n.$slots.bottom ? B(n.$slots, "bottom", { key: 1 }) : A("", !0)
           ])) : A("", !0),
-          i(ge) && !i(zt) && L.value ? (T(), j(Te, { key: 1 }, [
+          i(ge) && !i(zt) && K.value ? (T(), j(we, { key: 1 }, [
             Sr.value ? (T(), j("div", Dg, [
               n.$slots.top ? B(n.$slots, "top", { key: 0 }) : A("", !0),
               dt(Ot, { "empty-text": b.value }, Tt({ _: 2 }, [
@@ -2311,7 +2320,7 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
               n.$slots.bottom ? B(n.$slots, "bottom", { key: 1 }) : A("", !0)
             ])) : ve((T(), j("ul", Lg, [
               n.$slots.top ? B(n.$slots, "top", { key: 0 }) : A("", !0),
-              (T(!0), j(Te, null, ht(i(Ut), (v, $) => (T(), j("li", {
+              (T(!0), j(we, null, ht(i(Ut), (v, $) => (T(), j("li", {
                 key: v[n.nodeKey],
                 class: Xe([
                   "search-result-item",
@@ -2319,19 +2328,19 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
                   i(ee)(v, null) ? "is-disabled" : "",
                   i(D)(v, $)
                 ]),
-                onMousedown: Ze((E) => i(Sn)(v, !0), ["stop"])
+                onMousedown: Ze((L) => i(Sn)(v, !0), ["stop"])
               }, [
                 B(n.$slots, "search-result-item", {
                   item: v,
                   index: $
                 }, () => [
                   ve((T(), j("div", Ng, [
-                    Se($e(v[i(N).label]), 1)
+                    Se($e(v[i(E).label]), 1)
                   ])), [
                     [i(Pe)]
                   ]),
-                  v[i(N).pathName] ? ve((T(), j("div", Mg, [
-                    Se($e(v[i(N).pathName]), 1)
+                  v[i(E).pathName] ? ve((T(), j("div", Mg, [
+                    Se($e(v[i(E).pathName]), 1)
                   ])), [
                     [i(Pe)]
                   ]) : A("", !0)
@@ -2341,7 +2350,7 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
             ])), [
               [i(Ht)]
             ])
-          ], 64)) : i(ge) && n.isFilter ? (T(), j(Te, { key: 2 }, [
+          ], 64)) : i(ge) && n.isFilter ? (T(), j(we, { key: 2 }, [
             Sr.value ? (T(), j("div", Gg, [
               n.$slots.top ? B(n.$slots, "top", { key: 0 }) : A("", !0),
               dt(Ot, { "empty-text": b.value }, Tt({ _: 2 }, [
@@ -2356,7 +2365,7 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
               n.$slots.bottom ? B(n.$slots, "bottom", { key: 1 }) : A("", !0)
             ])) : ve((T(), j("ul", Fg, [
               n.$slots.top ? B(n.$slots, "top", { key: 0 }) : A("", !0),
-              (T(!0), j(Te, null, ht(i(Ke), (v, $) => (T(), j("li", {
+              (T(!0), j(we, null, ht(i(Ke), (v, $) => (T(), j("li", {
                 key: v[n.nodeKey],
                 class: Xe([
                   "search-result-item",
@@ -2364,19 +2373,19 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
                   i(ee)(v, null) ? "is-disabled" : "",
                   i(D)(v, $)
                 ]),
-                onMousedown: Ze((E) => i(Je)(v), ["stop"])
+                onMousedown: Ze((L) => i(Je)(v), ["stop"])
               }, [
                 B(n.$slots, "search-result-item", {
                   item: v,
                   index: $
                 }, () => [
                   ve((T(), j("div", zg, [
-                    Se($e(v[i(N).label]), 1)
+                    Se($e(v[i(E).label]), 1)
                   ])), [
                     [i(Pe)]
                   ]),
-                  v[i(N).pathName] ? ve((T(), j("div", Ug, [
-                    Se($e(v[i(N).pathName]), 1)
+                  v[i(E).pathName] ? ve((T(), j("div", Ug, [
+                    Se($e(v[i(E).pathName]), 1)
                   ])), [
                     [i(Pe)]
                   ]) : A("", !0)
@@ -2408,10 +2417,10 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
             Ne("span", { class: "virtual-ref-placeholder" }, " ", -1)
           ])),
           default: ke(() => {
-            var v, $, E, q, ae, ne, H, W, F;
+            var v, $, L, J, ne, oe, H, W, F;
             return [
               (v = i(p)) != null && v.node ? (T(), j("ul", Rg, [
-                (E = ($ = i(se)(i(p).node, i(p).data)) == null ? void 0 : $.list) != null && E.length && ((q = i(se)(i(p).node, i(p).data)) == null ? void 0 : q.position) === "top" ? (T(!0), j(Te, { key: 0 }, ht((ae = i(se)(i(p).node, i(p).data)) == null ? void 0 : ae.list, (m, le) => (T(), j(Te, {
+                (L = ($ = i(ie)(i(p).node, i(p).data)) == null ? void 0 : $.list) != null && L.length && ((J = i(ie)(i(p).node, i(p).data)) == null ? void 0 : J.position) === "top" ? (T(!0), j(we, { key: 0 }, ht((ne = i(ie)(i(p).node, i(p).data)) == null ? void 0 : ne.list, (m, le) => (T(), j(we, {
                   key: m.value
                 }, [
                   m.hidden ? A("", !0) : (T(), j("li", {
@@ -2435,7 +2444,7 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
                     ])
                   ], 10, Vg))
                 ], 64))), 128)) : A("", !0),
-                (T(!0), j(Te, null, ht(i(Fe)(i(p).node, i(p).data), (m, le) => (T(), j(Te, {
+                (T(!0), j(we, null, ht(i(Fe)(i(p).node, i(p).data), (m, le) => (T(), j(we, {
                   key: m.value
                 }, [
                   m.hidden ? A("", !0) : (T(), j("li", {
@@ -2459,7 +2468,7 @@ const Qe = /* @__PURE__ */ Rl(mg), Cg = (e, t, r, a, c, d, s, g, b, h, M, C, L,
                     ])
                   ], 10, qg))
                 ], 64))), 128)),
-                (H = (ne = i(se)(i(p).node, i(p).data)) == null ? void 0 : ne.list) != null && H.length && ((W = i(se)(i(p).node, i(p).data)) == null ? void 0 : W.position) === "bottom" ? (T(!0), j(Te, { key: 1 }, ht((F = i(se)(i(p).node, i(p).data)) == null ? void 0 : F.list, (m, le) => (T(), j(Te, {
+                (H = (oe = i(ie)(i(p).node, i(p).data)) == null ? void 0 : oe.list) != null && H.length && ((W = i(ie)(i(p).node, i(p).data)) == null ? void 0 : W.position) === "bottom" ? (T(!0), j(we, { key: 1 }, ht((F = i(ie)(i(p).node, i(p).data)) == null ? void 0 : F.list, (m, le) => (T(), j(we, {
                   key: m.value
                 }, [
                   m.hidden ? A("", !0) : (T(), j("li", {