@das-fed/ui 6.4.0-dev.9 → 6.4.0-dev.90

package/packages/components/tree-table/index.js

@@ -1,71 +1,71 @@
 import '@das-fed/ui/packages/components/tree-table/style.css';
-import { defineComponent as ce, mergeModels as x, ref as U, useModel as he, computed as I, watch as ee, openBlock as C, createElementBlock as V, normalizeClass as te, normalizeStyle as j, createElementVNode as $, toDisplayString as A, renderSlot as L, createCommentVNode as w, Fragment as G, renderList as J, createBlock as Q, unref as N, withCtx as F, createTextVNode as O, withDirectives as S, createVNode as W, vShow as H, pushScopeId as fe, popScopeId as ke } from "vue";
+import { defineComponent as he, mergeModels as ee, ref as U, useModel as fe, computed as I, watch as le, openBlock as C, createElementBlock as V, normalizeClass as oe, normalizeStyle as j, createElementVNode as $, toDisplayString as A, renderSlot as L, createCommentVNode as w, Fragment as G, renderList as J, createBlock as Q, unref as N, withCtx as F, createTextVNode as O, withDirectives as S, createVNode as W, vShow as H, pushScopeId as ke, popScopeId as ve } from "vue";
 import { withInstall as be } from "@das-fed/utils/with-install/index";
-import { setThemeRule as ve } from "@das-fed/web/packages/theme/index";
-import { DasTree as ye } from "@das-fed/ui/packages/components/tree/index";
-import { DasVirtualTree as ge } from "@das-fed/ui/packages/components/virtual-tree/index";
+import { setThemeRule as ye } from "@das-fed/web/packages/theme/index";
+import { DasTree as ge } from "@das-fed/ui/packages/components/tree/index";
+import { DasVirtualTree as me } from "@das-fed/ui/packages/components/virtual-tree/index";
 import { DasCheckbox as X } from "@das-fed/ui/packages/components/checkbox/index";
-import { vOverlay as le } from "@das-fed/ui/packages/components/overlay/index";
-import { DasEmpty as me } from "@das-fed/ui/packages/components/empty/index";
-import { DasSpin as pe } from "@das-fed/ui/packages/components/spin/index";
-import { treeFind as Ce, flatTree as ae } from "@das-fed/utils/common-tools";
-const we = (n, B, r, t, y, E, b) => ({ linkCheck: (T, k, g, v, K) => {
+import { vOverlay as ae } from "@das-fed/ui/packages/components/overlay/index";
+import { DasEmpty as pe } from "@das-fed/ui/packages/components/empty/index";
+import { DasSpin as Ce } from "@das-fed/ui/packages/components/spin/index";
+import { treeFind as we, flatTree as te } from "@das-fed/utils/common-tools";
+const Te = (n, B, r, t, y, E, v) => ({ linkCheck: (T, k, g, b, K) => {
   let d = null;
-  if (g ? d = (i) => {
+  if (g ? d = (o) => {
     var u, f, h;
-    i[(u = r.value) == null ? void 0 : u.children] && i[(f = r.value) == null ? void 0 : f.children].length && i[(h = r.value) == null ? void 0 : h.children].forEach((o) => {
-      d && d(o), o[k + "-targetId"] == T && n.nodeKey && !t(i, K) && !y(i) && (v[i[n.nodeKey]].data[k] = !0, v[i[n.nodeKey]].data[k + "-targetId"] = T);
+    o[(u = r.value) == null ? void 0 : u.children] && o[(f = r.value) == null ? void 0 : f.children].length && o[(h = r.value) == null ? void 0 : h.children].forEach((i) => {
+      d && d(i), i[k + "-targetId"] == T && n.nodeKey && !t(o, K) && !y(o) && (b[o[n.nodeKey]].data[k] = !0, b[o[n.nodeKey]].data[k + "-targetId"] = T);
     });
-  } : d = (i) => {
+  } : d = (o) => {
     var u, f, h;
-    i[(u = r.value) == null ? void 0 : u.children] && i[(f = r.value) == null ? void 0 : f.children].length && i[(h = r.value) == null ? void 0 : h.children].forEach((o) => {
-      i[k + "-targetId"] == o[E.value] && n.nodeKey && !t(o, K) && !y(o) && (v[o[n.nodeKey]].data[k] = !1, v[o[n.nodeKey]].data[k + "-targetId"] = o[n.nodeKey]), d && d(o);
+    o[(u = r.value) == null ? void 0 : u.children] && o[(f = r.value) == null ? void 0 : f.children].length && o[(h = r.value) == null ? void 0 : h.children].forEach((i) => {
+      o[k + "-targetId"] == i[E.value] && n.nodeKey && !t(i, K) && !y(i) && (b[i[n.nodeKey]].data[k] = !1, b[i[n.nodeKey]].data[k + "-targetId"] = i[n.nodeKey]), d && d(i);
     });
-  }, b.value && b.value.length)
-    for (let i = 0; i < b.value.length; i++)
-      d && d(b.value[i]);
-} }), Te = (n, B, r, t, y, E, b) => ({ linkCheck: (T, k, g, v, K) => {
+  }, v.value && v.value.length)
+    for (let o = 0; o < v.value.length; o++)
+      d && d(v.value[o]);
+} }), Ke = (n, B, r, t, y, E, v) => ({ linkCheck: (T, k, g, b, K) => {
   let d = null;
-  if (g ? d = (i) => {
+  if (g ? d = (o) => {
     var u, f, h;
-    i[(u = r.value) == null ? void 0 : u.children] && i[(f = r.value) == null ? void 0 : f.children].length && i[(h = r.value) == null ? void 0 : h.children].forEach((o) => {
-      i[k + "-targetId"] == o[E.value] && n.nodeKey && (!t(o, K) && !y(o) && (v[o[n.nodeKey]].data[k] = !0), v[o[n.nodeKey]].data[k + "-targetId"] = o.id), d && d(o);
+    o[(u = r.value) == null ? void 0 : u.children] && o[(f = r.value) == null ? void 0 : f.children].length && o[(h = r.value) == null ? void 0 : h.children].forEach((i) => {
+      o[k + "-targetId"] == i[E.value] && n.nodeKey && (!t(i, K) && !y(i) && (b[i[n.nodeKey]].data[k] = !0), b[i[n.nodeKey]].data[k + "-targetId"] = i.id), d && d(i);
     });
-  } : d = (i) => {
+  } : d = (o) => {
     var u, f, h;
-    i[(u = r.value) == null ? void 0 : u.children] && i[(f = r.value) == null ? void 0 : f.children].length && i[(h = r.value) == null ? void 0 : h.children].forEach((o) => {
-      d && d(o), o[k + "-targetId"] == T && n.nodeKey && (!t(i, K) && !y(i) && (v[i[n.nodeKey]].data[k] = !1), v[i[n.nodeKey]].data[k + "-targetId"] = T);
+    o[(u = r.value) == null ? void 0 : u.children] && o[(f = r.value) == null ? void 0 : f.children].length && o[(h = r.value) == null ? void 0 : h.children].forEach((i) => {
+      d && d(i), i[k + "-targetId"] == T && n.nodeKey && (!t(o, K) && !y(o) && (b[o[n.nodeKey]].data[k] = !1), b[o[n.nodeKey]].data[k + "-targetId"] = T);
     });
-  }, b.value && b.value.length)
-    for (let i = 0; i < b.value.length; i++)
-      d && d(b.value[i]);
-} }), Ke = (n, B, r, t, y, E, b) => ({ linkCheck: (T, k, g, v, K) => {
+  }, v.value && v.value.length)
+    for (let o = 0; o < v.value.length; o++)
+      d && d(v.value[o]);
+} }), Le = (n, B, r, t, y, E, v) => ({ linkCheck: (T, k, g, b, K) => {
   let d = null;
-  if (g ? d = (i) => {
+  if (g ? d = (o) => {
     var u, f, h;
-    i[(u = r.value) == null ? void 0 : u.children] && i[(f = r.value) == null ? void 0 : f.children].length && i[(h = r.value) == null ? void 0 : h.children].forEach((o) => {
-      i[k + "-targetId"] == o[E.value] && n.nodeKey && (!t(o, K) && !y(o) && (v[o[n.nodeKey]].data[k] = !0), v[o[n.nodeKey]].data[k + "-targetId"] = o.id), d && d(o);
+    o[(u = r.value) == null ? void 0 : u.children] && o[(f = r.value) == null ? void 0 : f.children].length && o[(h = r.value) == null ? void 0 : h.children].forEach((i) => {
+      o[k + "-targetId"] == i[E.value] && n.nodeKey && (!t(i, K) && !y(i) && (b[i[n.nodeKey]].data[k] = !0), b[i[n.nodeKey]].data[k + "-targetId"] = i.id), d && d(i);
     });
-  } : d = (i) => {
+  } : d = (o) => {
     var u, f, h;
-    i[n.nodeKey] === T ? delete v[i[n.nodeKey]].data[k + "-targetId"] : i[(u = r.value) == null ? void 0 : u.children] && i[(f = r.value) == null ? void 0 : f.children].length && i[(h = r.value) == null ? void 0 : h.children].forEach((o) => {
-      o[n.nodeKey] == T ? n.nodeKey && delete v[o[n.nodeKey]].data[k + "-targetId"] : d && d(o);
+    o[n.nodeKey] === T ? delete b[o[n.nodeKey]].data[k + "-targetId"] : o[(u = r.value) == null ? void 0 : u.children] && o[(f = r.value) == null ? void 0 : f.children].length && o[(h = r.value) == null ? void 0 : h.children].forEach((i) => {
+      i[n.nodeKey] == T ? n.nodeKey && delete b[i[n.nodeKey]].data[k + "-targetId"] : d && d(i);
     });
-  }, b.value && b.value.length) {
-    const i = Ce(b.value, (u) => u[n.nodeKey] === T);
-    d && d(i);
+  }, v.value && v.value.length) {
+    const o = we(v.value, (u) => u[n.nodeKey] === T);
+    d && d(o);
   }
-} }), Le = (n) => (fe("data-v-4b30a3e8"), n = n(), ke(), n), Ie = { class: "table-header" }, Ve = { class: "title table-label" }, $e = {
+} }), Ie = (n) => (ke("data-v-57c45da6"), n = n(), ve(), n), Ve = { class: "table-header" }, $e = { class: "title table-label" }, Ne = {
   key: 0,
   class: "table-label"
-}, Ne = {
-  class: /* @__PURE__ */ te(["table-body", "das-tree-box"])
-}, Ee = { class: "tree-node" }, De = { class: "tree-node" }, Ae = { class: "first-column" }, Be = { class: "title" }, Re = { class: "tree-node" }, Fe = { class: "tree-node" }, Se = { class: "first-column" }, Me = { class: "title" }, Oe = /* @__PURE__ */ Le(() => /* @__PURE__ */ $("div", { style: { width: "100%", height: "100%" } }, null, -1)), Ue = {
+}, Ee = {
+  class: /* @__PURE__ */ oe(["table-body", "das-tree-box"])
+}, De = { class: "tree-node" }, Ae = { class: "tree-node" }, Be = { class: "first-column" }, Re = { class: "title" }, Fe = { class: "tree-node" }, Se = { class: "tree-node" }, Me = { class: "first-column" }, Oe = { class: "title" }, Ue = /* @__PURE__ */ Ie(() => /* @__PURE__ */ $("div", { style: { width: "100%", height: "100%" } }, null, -1)), ze = {
   name: "DasTreeTable",
   inheritAttrs: !1
-}, ze = /* @__PURE__ */ ce({
-  ...Ue,
-  props: /* @__PURE__ */ x({
+}, je = /* @__PURE__ */ he({
+  ...ze,
+  props: /* @__PURE__ */ ee({
     virtual: { type: Boolean, default: !0 },
     linkageType: { default: "first" },
     keyword: {},
@@ -91,9 +91,9 @@ const we = (n, B, r, t, y, E, b) => ({ linkCheck: (T, k, g, v, K) => {
     keyword: { type: String, default: "" },
     keywordModifiers: {}
   }),
-  emits: /* @__PURE__ */ x(["update:data", "update:keyword", "all-check", "item-check"], ["update:keyword"]),
+  emits: /* @__PURE__ */ ee(["update:data", "update:keyword", "all-check", "item-check"], ["update:keyword"]),
   setup(n, { expose: B, emit: r }) {
-    const t = n, y = r, E = U(), b = he(n, "keyword"), D = I(() => {
+    const t = n, y = r, E = U(), v = fe(n, "keyword"), D = I(() => {
       var e;
       return t.checkNum ?? ((e = t.checkboxLabels) == null ? void 0 : e.length) ?? 0;
     }), T = I(() => t != null && t.height ? t.height + "px" : "100%"), k = I(() => {
@@ -107,17 +107,17 @@ const we = (n, B, r, t, y, E, b) => ({ linkCheck: (T, k, g, v, K) => {
     }), g = I(() => {
       const e = { ...t.props };
       return e != null && e.disabled && delete e.disabled, e != null && e.hidden && delete e.hidden, e != null && e.parentId && delete e.parentId, { label: "name", children: "children", disabled: "disabled", isLeaf: "leaf", ...e };
-    }), v = I(() => {
+    }), b = I(() => {
       var e;
       return ((e = t.props) == null ? void 0 : e.parentId) ?? "parentId";
     }), K = I(() => {
       var a, l, s, c, p, R;
       let e = [];
       return (a = t.props) != null && a.disabled && ((l = t.props) != null && l.disabled.length) ? ((s = t.props) != null && s.disabled[0] ? e[0] = (c = t.props) == null ? void 0 : c.disabled[0] : e[0] = "disabled1", (p = t.props) != null && p.disabled[1] ? e[1] = (R = t.props) == null ? void 0 : R.disabled[1] : e[1] = "disabled2") : e = ["disabled1", "disabled2"], e;
-    }), d = (e, a) => typeof K.value[a] == "function" ? K.value[a](e, a) : e[K.value[a]], i = I(() => {
+    }), d = (e, a) => typeof K.value[a] == "function" ? K.value[a](e, a) : e[K.value[a]], o = I(() => {
       var e;
       return ((e = t.props) == null ? void 0 : e.hidden) ?? "hidden";
-    }), u = (e) => typeof i.value == "function" ? i.value(e) : e[i.value], f = U(), h = U([!1, !1]), o = U([!1, !1]), m = I({
+    }), u = (e) => typeof o.value == "function" ? o.value(e) : e[o.value], f = U(), h = U([!1, !1]), i = U([!1, !1]), m = I({
       get: () => t.data,
       set: (e) => y("update:data", e)
     }), Y = (e) => {
@@ -127,39 +127,39 @@ const we = (n, B, r, t, y, E, b) => ({ linkCheck: (T, k, g, v, K) => {
         a[l.id] = s, Array.isArray(l[g.value.children]) && Object.assign(a, Y(l[g.value.children]));
       }), a;
     }, Z = () => Y(m.value), _ = (e, a, l) => {
-      t.allCheckboxDisabled[l] || (e > 0 && a > 0 ? (h.value[l] = !1, o.value[l] = !0) : e == 0 && a >= 0 ? (h.value[l] = !1, o.value[l] = !1) : (h.value[l] = !0, o.value[l] = !1));
+      t.allCheckboxDisabled[l] || (e > 0 && a > 0 ? (h.value[l] = !1, i.value[l] = !0) : e == 0 && a >= 0 ? (h.value[l] = !1, i.value[l] = !1) : (h.value[l] = !0, i.value[l] = !1));
     }, ie = (e) => {
       const a = g.value.children;
       let l = [];
-      l = ae(m.value, a);
+      l = te(m.value, a);
       for (let s = 0; s < D.value; s++) {
         let c = 0, p = 0;
         l.forEach((R) => {
           d(R, s) || u(R) || (R[t.checkboxLabels[s]] ? c++ : p++);
         }), _(c, p, s);
       }
-    }, { linkCheck: oe } = we(
+    }, { linkCheck: se } = Te(
       t,
       y,
       g,
       d,
       u,
-      v,
+      b,
       m
-    ), { linkCheck: se } = Te(t, y, g, d, u, v, m), { linkCheck: de } = Ke(
+    ), { linkCheck: de } = Ke(t, y, g, d, u, b, m), { linkCheck: ne } = Le(
       t,
       y,
       g,
       d,
       u,
-      v,
+      b,
       m
-    ), ne = (e, a, l, s, c) => t.linkageType === "custom" ? void 0 : {
-      first: oe,
-      two: se,
-      three: de
+    ), ue = (e, a, l, s, c) => t.linkageType === "custom" ? void 0 : {
+      first: se,
+      two: de,
+      three: ne
     }[t.linkageType](e, a, l, s, c), z = (e, a) => {
-      y("all-check", e, a), h.value[a] = e, o.value[a] = !1;
+      y("all-check", e, a), h.value[a] = e, i.value[a] = !1;
       const l = Z();
       if (l)
         for (let s in l)
@@ -175,44 +175,41 @@ const we = (n, B, r, t, y, E, b) => ({ linkCheck: (T, k, g, v, K) => {
           z(e, a + 1);
         }
       }
-    }, ue = I(() => {
+    }, re = I(() => {
       let e = [];
       if (!m.value || !m.value.length) return e;
       const a = g.value.children;
-      return e = ae(m.value, a).filter(
-        (s) => s[g.value.label].toLowerCase().includes(b.value.toLowerCase())
+      return e = te(m.value, a).filter(
+        (s) => s[g.value.label].toLowerCase().includes(v.value.toLowerCase())
       ), e;
     }), q = I(() => {
+      var a;
       let e = !1;
-      return m.value.length || (e = !0), b.value && !ue.value.length && (e = !0), e;
-    }), re = () => new Promise((e) => {
+      return (!m.value || !m.value.length) && (e = !0), v.value && !((a = re.value) != null && a.length) && (e = !0), e;
+    }), ce = () => new Promise((e) => {
       const a = () => {
         var l;
         if ((l = f.value) != null && l.treeRef) return e(!0);
         setTimeout(() => a(), 50);
       };
       a();
-    }), P = async () => {
+    });
+    let P = "";
+    const x = async () => {
       var e, a;
-      await re(), (a = (e = f.value) == null ? void 0 : e.treeRef) == null || a.filter(b.value);
+      P != v.value && (await ce(), (a = (e = f.value) == null ? void 0 : e.treeRef) == null || a.filter(v.value), P = v.value);
     };
-    ee(
+    le(
       () => m.value,
       () => {
-        ie(), P();
+        ie(), x();
       },
       { immediate: !0, deep: !0 }
-    ), ee(
-      () => b.value,
-      () => {
-        P();
-      },
-      { immediate: !0 }
-    );
+    ), le(() => v.value, x);
     const M = (e, a, l) => {
       y("item-check", e, a, l);
       const s = Z(), c = t.checkboxLabels[l];
-      s && (s[a[t.nodeKey]].data[c + "-targetId"] = a[t.nodeKey], s[a[t.nodeKey]].data[c] = e), ne(a[t.nodeKey], c, e, s, l), t.twoLinkFirstCheck && (e ? l === 1 && !d(a, l - 1) && !u(a) && M(e, a, l - 1) : l === 0 && !d(a, l + 1) && !u(a) && M(e, a, l + 1));
+      s && (s[a[t.nodeKey]].data[c + "-targetId"] = a[t.nodeKey], s[a[t.nodeKey]].data[c] = e), ue(a[t.nodeKey], c, e, s, l), t.twoLinkFirstCheck && (e ? l === 1 && !d(a, l - 1) && !u(a) && M(e, a, l - 1) : l === 0 && !d(a, l + 1) && !u(a) && M(e, a, l + 1));
     };
     return B({
       $treeTableBody: f,
@@ -227,23 +224,23 @@ const we = (n, B, r, t, y, E, b) => ({ linkCheck: (T, k, g, v, K) => {
     }), (e, a) => (C(), V("div", {
       ref_key: "dasTreeTableRef",
       ref: E,
-      class: te(["das-ui-tree-table", e.border ? "is-border" : ""]),
+      class: oe(["das-ui-tree-table", e.border ? "is-border" : ""]),
       style: j({ height: T.value })
     }, [
-      $("div", Ie, [
-        $("div", Ve, A(e.title), 1),
+      $("div", Ve, [
+        $("div", $e, A(e.title), 1),
         e.$slots.headerLeft ? L(e.$slots, "headerLeft", { key: 0 }, void 0, !0) : w("", !0),
         (C(!0), V(G, null, J(D.value, (l) => (C(), V("div", {
           class: "check-item",
           style: j({ width: e.checkboxWidth[0] })
         }, [
           L(e.$slots, e.checkboxLabels[l - 1] + "Header", {}, () => [
-            e.isView ? (C(), V("span", $e, A(e.allCheckboxNames[l - 1] ?? ""), 1)) : (C(), Q(N(X), {
+            e.isView ? (C(), V("span", Ne, A(e.allCheckboxNames[l - 1] ?? ""), 1)) : (C(), Q(N(X), {
               key: 1,
               modelValue: h.value[l - 1],
               "onUpdate:modelValue": (s) => h.value[l - 1] = s,
               checkboxType: "default",
-              indeterminate: o.value[l - 1],
+              indeterminate: i.value[l - 1],
               disabled: e.allCheckboxDisabled[l - 1] || !m.value || !m.value.length,
               isView: e.isView,
               onChange: (s) => {
@@ -259,8 +256,8 @@ const we = (n, B, r, t, y, E, b) => ({ linkCheck: (T, k, g, v, K) => {
         ], 4))), 256)),
         e.$slots.headerRight ? L(e.$slots, "headerRight", { key: 1 }, void 0, !0) : w("", !0)
       ]),
-      $("div", Ne, [
-        e.virtual ? S((C(), Q(N(ge), {
+      $("div", Ee, [
+        e.virtual ? S((C(), Q(N(me), {
           key: 0,
           ref_key: "$treeTableBody",
           ref: f,
@@ -274,9 +271,9 @@ const we = (n, B, r, t, y, E, b) => ({ linkCheck: (T, k, g, v, K) => {
           style: { width: "100%" }
         }, {
           default: F(({ data: l, node: s }) => [
-            S((C(), V("div", Ee, [
-              $("div", De, [
-                $("div", Ae, [
+            S((C(), V("div", De, [
+              $("div", Ae, [
+                $("div", Be, [
                   e.$slots.icon ? L(e.$slots, "icon", {
                     key: 0,
                     node: s,
@@ -288,7 +285,7 @@ const we = (n, B, r, t, y, E, b) => ({ linkCheck: (T, k, g, v, K) => {
                     node: s,
                     data: l
                   }, () => [
-                    $("span", Be, A(l[e.fistLabel]), 1)
+                    $("span", Re, A(l[e.fistLabel]), 1)
                   ], !0)
                 ]),
                 e.$slots.bodyLeft ? L(e.$slots, "bodyLeft", {
@@ -323,14 +320,14 @@ const we = (n, B, r, t, y, E, b) => ({ linkCheck: (T, k, g, v, K) => {
                 }, void 0, !0) : w("", !0)
               ])
             ])), [
-              [N(le), { x: !1, "z-index": "auto" }]
+              [N(ae), { x: !1, "z-index": "auto" }]
             ])
           ]),
           _: 3
         }, 8, ["nodeKey", "data", "props", "default-expand-all", "height"])), [
           [H, !q.value && !e.loading]
         ]) : w("", !0),
-        e.virtual ? w("", !0) : S((C(), Q(N(ye), {
+        e.virtual ? w("", !0) : S((C(), Q(N(ge), {
           key: 1,
           ref_key: "$treeTableBody",
           ref: f,
@@ -344,9 +341,9 @@ const we = (n, B, r, t, y, E, b) => ({ linkCheck: (T, k, g, v, K) => {
           style: { width: "100%" }
         }, {
           default: F(({ data: l, node: s }) => [
-            S((C(), V("div", Re, [
-              $("div", Fe, [
-                $("div", Se, [
+            S((C(), V("div", Fe, [
+              $("div", Se, [
+                $("div", Me, [
                   e.$slots.icon ? L(e.$slots, "icon", {
                     key: 0,
                     node: s,
@@ -358,7 +355,7 @@ const we = (n, B, r, t, y, E, b) => ({ linkCheck: (T, k, g, v, K) => {
                     node: s,
                     data: l
                   }, () => [
-                    $("span", Me, A(l[e.fistLabel]), 1)
+                    $("span", Oe, A(l[e.fistLabel]), 1)
                   ], !0)
                 ]),
                 e.$slots.bodyLeft ? L(e.$slots, "bodyLeft", {
@@ -393,22 +390,22 @@ const we = (n, B, r, t, y, E, b) => ({ linkCheck: (T, k, g, v, K) => {
                 }, void 0, !0) : w("", !0)
               ])
             ])), [
-              [N(le), { x: !1, "z-index": "auto" }]
+              [N(ae), { x: !1, "z-index": "auto" }]
             ])
           ]),
           _: 3
         }, 8, ["nodeKey", "data", "props", "default-expand-all", "height"])), [
           [H, !q.value && !e.loading]
         ]),
-        S(W(N(me), null, null, 512), [
+        S(W(N(pe), null, null, 512), [
           [H, q.value && !e.loading]
         ]),
-        S(W(N(pe), {
+        S(W(N(Ce), {
           size: "small",
           spinning: e.loading
         }, {
           default: F(() => [
-            Oe
+            Ue
           ]),
           _: 1
         }, 8, ["spinning"]), [
@@ -417,21 +414,21 @@ const we = (n, B, r, t, y, E, b) => ({ linkCheck: (T, k, g, v, K) => {
       ])
     ], 6));
   }
-}), je = (n, B) => {
+}), We = (n, B) => {
   const r = n.__vccOpts || n;
   for (const [t, y] of B)
     r[t] = y;
   return r;
-}, We = /* @__PURE__ */ je(ze, [["__scopeId", "data-v-4b30a3e8"]]), He = {
+}, He = /* @__PURE__ */ We(je, [["__scopeId", "data-v-57c45da6"]]), Ze = {
   "--das-ui-tree-table-highlight-color": "#5582f3",
   "--das-ui-tree-table-header-color": "#212121",
   "--das-ui-tree-table-header-bg-color": "#F2F2F2",
   "--das-ui-tree-table-border-color": "#D9D9D9"
 };
-ve(He);
-const el = be(We), ll = () => U(null), al = { name: "tree-table 表格树" };
+ye(Ze);
+const ll = be(He), al = () => U(null), tl = { name: "tree-table 表格树" };
 export {
-  el as DasTreeTable,
-  ll as DasTreeTableRef,
-  al as default
+  ll as DasTreeTable,
+  al as DasTreeTableRef,
+  tl as default
 };