@das-fed/ui 6.4.0-test.3.1 → 6.4.0-test.30

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

@@ -1,71 +1,71 @@
 import '@das-fed/ui/packages/components/tree-table/style.css';
-import { defineComponent as fe, mergeModels as x, ref as U, useModel as he, computed as I, watch as ee, openBlock as w, createElementBlock as V, normalizeClass as ae, normalizeStyle as j, createElementVNode as $, toDisplayString as A, renderSlot as L, createCommentVNode as p, Fragment as G, renderList as J, createBlock as Q, unref as N, withCtx as F, createTextVNode as S, withDirectives as M, createVNode as W, vShow as H } from "vue";
-import { withInstall as ce } from "@das-fed/utils/with-install/index";
-import { setThemeRule as ve } from "@das-fed/web/packages/theme/index";
-import { DasTree as ke } from "@das-fed/ui/packages/components/tree/index";
-import { DasVirtualTree as be } from "@das-fed/ui/packages/components/virtual-tree/index";
+import { defineComponent as he, mergeModels as ee, ref as U, useModel as ce, computed as I, watch as le, createElementBlock as V, openBlock as K, normalizeStyle as j, normalizeClass as ie, createElementVNode as $, renderSlot as L, createCommentVNode as w, toDisplayString as A, Fragment as G, renderList as J, createBlock as Q, unref as N, withCtx as F, createTextVNode as S, withDirectives as M, createVNode as W, vShow as H } from "vue";
+import { withInstall as ve } from "@das-fed/utils/with-install/index";
+import { setThemeRule as ke } from "@das-fed/web/packages/theme/index";
+import { DasTree as be } from "@das-fed/ui/packages/components/tree/index";
+import { DasVirtualTree as ye } 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 ye } from "@das-fed/ui/packages/components/empty/index";
-import { DasSpin as ge } from "@das-fed/ui/packages/components/spin/index";
-import { treeFind as me, flatTree as te } from "@das-fed/utils/common-tools";
-const Ce = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
-  let d = null;
-  if (g ? d = (i) => {
+import { vOverlay as ae } from "@das-fed/ui/packages/components/overlay/index";
+import { DasEmpty as ge } from "@das-fed/ui/packages/components/empty/index";
+import { DasSpin as me } from "@das-fed/ui/packages/components/spin/index";
+import { treeFind as Ce, flatTree as te } from "@das-fed/utils/common-tools";
+const we = (d, B, r, t, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
+  let n = null;
+  if (g ? n = (i) => {
     var u, c, h;
     i[(u = r.value) == null ? void 0 : u.children] && i[(c = r.value) == null ? void 0 : c.children].length && i[(h = r.value) == null ? void 0 : h.children].forEach((o) => {
-      d && d(o), o[v + "-targetId"] == T && n.nodeKey && !a(i, K) && !y(i) && (b[i[n.nodeKey]].data[v] = !0, b[i[n.nodeKey]].data[v + "-targetId"] = T);
+      n && n(o), o[v + "-targetId"] == T && d.nodeKey && !t(i, p) && !y(i) && (b[i[d.nodeKey]].data[v] = !0, b[i[d.nodeKey]].data[v + "-targetId"] = T);
     });
-  } : d = (i) => {
+  } : n = (i) => {
     var u, c, h;
     i[(u = r.value) == null ? void 0 : u.children] && i[(c = r.value) == null ? void 0 : c.children].length && i[(h = r.value) == null ? void 0 : h.children].forEach((o) => {
-      i[v + "-targetId"] == o[E.value] && n.nodeKey && !a(o, K) && !y(o) && (b[o[n.nodeKey]].data[v] = !1, b[o[n.nodeKey]].data[v + "-targetId"] = o[n.nodeKey]), d && d(o);
+      i[v + "-targetId"] == o[E.value] && d.nodeKey && !t(o, p) && !y(o) && (b[o[d.nodeKey]].data[v] = !1, b[o[d.nodeKey]].data[v + "-targetId"] = o[d.nodeKey]), n && n(o);
     });
   }, k.value && k.value.length)
     for (let i = 0; i < k.value.length; i++)
-      d && d(k.value[i]);
-} }), pe = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
-  let d = null;
-  if (g ? d = (i) => {
+      n && n(k.value[i]);
+} }), Ke = (d, B, r, t, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
+  let n = null;
+  if (g ? n = (i) => {
     var u, c, h;
     i[(u = r.value) == null ? void 0 : u.children] && i[(c = r.value) == null ? void 0 : c.children].length && i[(h = r.value) == null ? void 0 : h.children].forEach((o) => {
-      i[v + "-targetId"] == o[E.value] && n.nodeKey && (!a(o, K) && !y(o) && (b[o[n.nodeKey]].data[v] = !0), b[o[n.nodeKey]].data[v + "-targetId"] = o.id), d && d(o);
+      i[v + "-targetId"] == o[E.value] && d.nodeKey && (!t(o, p) && !y(o) && (b[o[d.nodeKey]].data[v] = !0), b[o[d.nodeKey]].data[v + "-targetId"] = o[d.nodeKey]), n && n(o);
     });
-  } : d = (i) => {
+  } : n = (i) => {
     var u, c, h;
     i[(u = r.value) == null ? void 0 : u.children] && i[(c = r.value) == null ? void 0 : c.children].length && i[(h = r.value) == null ? void 0 : h.children].forEach((o) => {
-      d && d(o), o[v + "-targetId"] == T && n.nodeKey && (!a(i, K) && !y(i) && (b[i[n.nodeKey]].data[v] = !1), b[i[n.nodeKey]].data[v + "-targetId"] = T);
+      n && n(o), o[v + "-targetId"] == T && d.nodeKey && (!t(i, p) && !y(i) && (b[i[d.nodeKey]].data[v] = !1), b[i[d.nodeKey]].data[v + "-targetId"] = T);
     });
   }, k.value && k.value.length)
     for (let i = 0; i < k.value.length; i++)
-      d && d(k.value[i]);
-} }), we = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
-  let d = null;
-  if (g ? d = (i) => {
+      n && n(k.value[i]);
+} }), Te = (d, B, r, t, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
+  let n = null;
+  if (g ? n = (i) => {
     var u, c, h;
     i[(u = r.value) == null ? void 0 : u.children] && i[(c = r.value) == null ? void 0 : c.children].length && i[(h = r.value) == null ? void 0 : h.children].forEach((o) => {
-      i[v + "-targetId"] == o[E.value] && n.nodeKey && (!a(o, K) && !y(o) && (b[o[n.nodeKey]].data[v] = !0), b[o[n.nodeKey]].data[v + "-targetId"] = o.id), d && d(o);
+      i[v + "-targetId"] == o[E.value] && d.nodeKey && (!t(o, p) && !y(o) && (b[o[d.nodeKey]].data[v] = !0), b[o[d.nodeKey]].data[v + "-targetId"] = o[d.nodeKey]), n && n(o);
     });
-  } : d = (i) => {
+  } : n = (i) => {
     var u, c, h;
-    i[n.nodeKey] === T ? delete b[i[n.nodeKey]].data[v + "-targetId"] : i[(u = r.value) == null ? void 0 : u.children] && i[(c = r.value) == null ? void 0 : c.children].length && i[(h = r.value) == null ? void 0 : h.children].forEach((o) => {
-      o[n.nodeKey] == T ? n.nodeKey && delete b[o[n.nodeKey]].data[v + "-targetId"] : d && d(o);
+    i[d.nodeKey] === T ? delete b[i[d.nodeKey]].data[v + "-targetId"] : i[(u = r.value) == null ? void 0 : u.children] && i[(c = r.value) == null ? void 0 : c.children].length && i[(h = r.value) == null ? void 0 : h.children].forEach((o) => {
+      o[d.nodeKey] == T ? d.nodeKey && delete b[o[d.nodeKey]].data[v + "-targetId"] : n && n(o);
     });
   }, k.value && k.value.length) {
-    const i = me(k.value, (u) => u[n.nodeKey] === T);
-    d && d(i);
+    const i = Ce(k.value, (u) => u[d.nodeKey] === T);
+    n && n(i);
   }
-} }), Te = { class: "table-header" }, Ke = { class: "title table-label" }, Le = {
+} }), pe = { class: "table-header" }, Le = { class: "title table-label" }, Ie = {
   key: 0,
   class: "table-label"
-}, Ie = {
-  class: /* @__PURE__ */ ae(["table-body", "das-tree-box"])
-}, Ve = { class: "tree-node" }, $e = { class: "tree-node" }, Ne = { class: "first-column" }, Ee = { class: "title" }, De = { class: "tree-node" }, Ae = { class: "tree-node" }, Be = { class: "first-column" }, Re = { class: "title" }, Fe = {
+}, Ve = {
+  class: /* @__PURE__ */ ie(["table-body", "das-tree-box"])
+}, $e = { class: "tree-node" }, Ne = { class: "tree-node" }, Ee = { class: "first-column" }, De = { class: "title" }, Ae = { class: "tree-node" }, Be = { class: "tree-node" }, Re = { class: "first-column" }, Fe = { class: "title" }, Me = {
   name: "DasTreeTable",
   inheritAttrs: !1
-}, Me = /* @__PURE__ */ fe({
-  ...Fe,
-  props: /* @__PURE__ */ x({
+}, Oe = /* @__PURE__ */ he({
+  ...Me,
+  props: /* @__PURE__ */ ee({
     virtual: { type: Boolean, default: !0 },
     linkageType: { default: "first" },
     keyword: {},
@@ -91,128 +91,125 @@ const Ce = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
     keyword: { type: String, default: "" },
     keywordModifiers: {}
   }),
-  emits: /* @__PURE__ */ x(["update:data", "update:keyword", "all-check", "item-check"], ["update:keyword"]),
-  setup(n, { expose: B, emit: r }) {
-    const a = n, y = r, E = U(), k = he(n, "keyword"), D = I(() => {
+  emits: /* @__PURE__ */ ee(["update:data", "update:keyword", "all-check", "item-check"], ["update:keyword"]),
+  setup(d, { expose: B, emit: r }) {
+    const t = d, y = r, E = U(), k = ce(d, "keyword"), D = I(() => {
       var e;
-      return a.checkNum ?? ((e = a.checkboxLabels) == null ? void 0 : e.length) ?? 0;
-    }), T = I(() => a != null && a.height ? a.height + "px" : "100%"), v = I(() => {
-      if (a != null && a.height) {
-        if (typeof a.height == "string") {
-          if (a.height.includes("%")) return;
-          if (a.height.includes("px")) return Number(a.height.replace("px", ""));
+      return t.checkNum ?? ((e = t.checkboxLabels) == null ? void 0 : e.length) ?? 0;
+    }), T = I(() => t != null && t.height ? t.height + "px" : "100%"), v = I(() => {
+      if (t != null && t.height) {
+        if (typeof t.height == "string") {
+          if (t.height.includes("%")) return;
+          if (t.height.includes("px")) return Number(t.height.replace("px", ""));
         }
-        return a.height;
+        return t.height;
       }
     }), g = I(() => {
-      const e = { ...a.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 };
+      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, { children: "children", disabled: "disabled", isLeaf: "leaf", ...e, label: t.fistLabel };
     }), b = I(() => {
       var e;
-      return ((e = a.props) == null ? void 0 : e.parentId) ?? "parentId";
-    }), K = I(() => {
-      var t, l, s, f, C, R;
+      return ((e = t.props) == null ? void 0 : e.parentId) ?? "parentId";
+    }), p = I(() => {
+      var a, l, s, f, C, R;
       let e = [];
-      return (t = a.props) != null && t.disabled && ((l = a.props) != null && l.disabled.length) ? ((s = a.props) != null && s.disabled[0] ? e[0] = (f = a.props) == null ? void 0 : f.disabled[0] : e[0] = "disabled1", (C = a.props) != null && C.disabled[1] ? e[1] = (R = a.props) == null ? void 0 : R.disabled[1] : e[1] = "disabled2") : e = ["disabled1", "disabled2"], e;
-    }), d = (e, t) => typeof K.value[t] == "function" ? K.value[t](e, t) : e[K.value[t]], i = I(() => {
+      return (a = t.props) != null && a.disabled && ((l = t.props) != null && l.disabled.length) ? ((s = t.props) != null && s.disabled[0] ? e[0] = (f = t.props) == null ? void 0 : f.disabled[0] : e[0] = "disabled1", (C = t.props) != null && C.disabled[1] ? e[1] = (R = t.props) == null ? void 0 : R.disabled[1] : e[1] = "disabled2") : e = ["disabled1", "disabled2"], e;
+    }), n = (e, a) => typeof p.value[a] == "function" ? p.value[a](e, a) : e[p.value[a]], i = I(() => {
       var e;
-      return ((e = a.props) == null ? void 0 : e.hidden) ?? "hidden";
+      return ((e = t.props) == null ? void 0 : e.hidden) ?? "hidden";
     }), u = (e) => typeof i.value == "function" ? i.value(e) : e[i.value], c = U(), h = U([!1, !1]), o = U([!1, !1]), m = I({
-      get: () => a.data,
+      get: () => t.data,
       set: (e) => y("update:data", e)
     }), Y = (e) => {
-      const t = {};
+      const a = {};
       return Array.isArray(e) && e.forEach((l) => {
         const s = { data: l };
-        t[l.id] = s, Array.isArray(l[g.value.children]) && Object.assign(t, Y(l[g.value.children]));
-      }), t;
-    }, Z = () => Y(m.value), _ = (e, t, l) => {
-      a.allCheckboxDisabled[l] || (e > 0 && t > 0 ? (h.value[l] = !1, o.value[l] = !0) : e == 0 && t >= 0 ? (h.value[l] = !1, o.value[l] = !1) : (h.value[l] = !0, o.value[l] = !1));
-    }, ie = (e) => {
-      const t = g.value.children;
+        a[l[t.nodeKey]] = 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));
+    }, oe = (e) => {
+      const a = g.value.children;
       let l = [];
-      l = te(m.value, t);
+      l = te(m.value, a);
       for (let s = 0; s < D.value; s++) {
         let f = 0, C = 0;
         l.forEach((R) => {
-          d(R, s) || u(R) || (R[a.checkboxLabels[s]] ? f++ : C++);
+          n(R, s) || u(R) || (R[t.checkboxLabels[s]] ? f++ : C++);
         }), _(f, C, s);
       }
-    }, { linkCheck: oe } = Ce(
-      a,
+    }, { linkCheck: se } = we(
+      t,
       y,
       g,
-      d,
+      n,
       u,
       b,
       m
-    ), { linkCheck: se } = pe(a, y, g, d, u, b, m), { linkCheck: de } = we(
-      a,
+    ), { linkCheck: ne } = Ke(t, y, g, n, u, b, m), { linkCheck: de } = Te(
+      t,
       y,
       g,
-      d,
+      n,
       u,
       b,
       m
-    ), ne = (e, t, l, s, f) => a.linkageType === "custom" ? void 0 : {
-      first: oe,
-      two: se,
+    ), ue = (e, a, l, s, f) => t.linkageType === "custom" ? void 0 : {
+      first: se,
+      two: ne,
       three: de
-    }[a.linkageType](e, t, l, s, f), z = (e, t) => {
-      y("all-check", e, t), h.value[t] = e, o.value[t] = !1;
+    }[t.linkageType](e, a, l, s, f), z = (e, a) => {
+      y("all-check", e, a), h.value[a] = e, o.value[a] = !1;
       const l = Z();
       if (l)
         for (let s in l)
-          !d(l[s].data, t) && !u(l[s].data) && (l[s].data[a.checkboxLabels[t]] = e, delete l[s].data[a.checkboxLabels[t] + "-targetId"]);
-      if (a.twoLinkFirstCheck) {
+          !n(l[s].data, a) && !u(l[s].data) && (l[s].data[t.checkboxLabels[a]] = e, delete l[s].data[t.checkboxLabels[a] + "-targetId"]);
+      if (t.twoLinkFirstCheck) {
         if (e) {
-          if (t === 1) {
-            if (a.allCheckboxDisabled[t - 1]) return;
-            z(e, t - 1);
+          if (a === 1) {
+            if (t.allCheckboxDisabled[a - 1]) return;
+            z(e, a - 1);
           }
-        } else if (t === 0) {
-          if (a.allCheckboxDisabled[t + 1]) return;
-          z(e, t + 1);
+        } else if (a === 0) {
+          if (t.allCheckboxDisabled[a + 1]) return;
+          z(e, a + 1);
         }
       }
-    }, ue = I(() => {
+    }, re = I(() => {
       let e = [];
       if (!m.value || !m.value.length) return e;
-      const t = g.value.children;
-      return e = te(m.value, t).filter(
+      const a = g.value.children;
+      return e = te(m.value, a).filter(
         (s) => s[g.value.label].toLowerCase().includes(k.value.toLowerCase())
       ), e;
     }), q = I(() => {
+      var a;
       let e = !1;
-      return m.value.length || (e = !0), k.value && !ue.value.length && (e = !0), e;
-    }), re = () => new Promise((e) => {
-      const t = () => {
+      return (!m.value || !m.value.length) && (e = !0), k.value && !((a = re.value) != null && a.length) && (e = !0), e;
+    }), fe = () => new Promise((e) => {
+      const a = () => {
         var l;
         if ((l = c.value) != null && l.treeRef) return e(!0);
-        setTimeout(() => t(), 50);
+        setTimeout(() => a(), 50);
       };
-      t();
-    }), P = async () => {
-      var e, t;
-      await re(), (t = (e = c.value) == null ? void 0 : e.treeRef) == null || t.filter(k.value);
+      a();
+    });
+    let P = "";
+    const x = async () => {
+      var e, a;
+      P != k.value && (await fe(), (a = (e = c.value) == null ? void 0 : e.treeRef) == null || a.filter(k.value), P = k.value);
     };
-    ee(
+    le(
       () => m.value,
       () => {
-        ie(), P();
+        oe(), x();
       },
       { immediate: !0, deep: !0 }
-    ), ee(
-      () => k.value,
-      () => {
-        P();
-      },
-      { immediate: !0 }
-    );
-    const O = (e, t, l) => {
-      y("item-check", e, t, l);
-      const s = Z(), f = a.checkboxLabels[l];
-      s && (s[t[a.nodeKey]].data[f + "-targetId"] = t[a.nodeKey], s[t[a.nodeKey]].data[f] = e), ne(t[a.nodeKey], f, e, s, l), a.twoLinkFirstCheck && (e ? l === 1 && !d(t, l - 1) && !u(t) && O(e, t, l - 1) : l === 0 && !d(t, l + 1) && !u(t) && O(e, t, l + 1));
+    ), le(() => k.value, x);
+    const O = (e, a, l) => {
+      y("item-check", e, a, l);
+      const s = Z(), f = t.checkboxLabels[l];
+      s && (s[a[t.nodeKey]].data[f + "-targetId"] = a[t.nodeKey], s[a[t.nodeKey]].data[f] = e), ue(a[t.nodeKey], f, e, s, l), t.twoLinkFirstCheck && (e ? l === 1 && !n(a, l - 1) && !u(a) && O(e, a, l - 1) : l === 0 && !n(a, l + 1) && !u(a) && O(e, a, l + 1));
     };
     return B({
       $treeTableBody: c,
@@ -224,28 +221,28 @@ const Ce = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
       setCheck: O,
       /** 手动联动全选;参数trueNum，falseNum，index */
       linkAllCheck: _
-    }), (e, t) => (w(), V(
+    }), (e, a) => (K(), V(
       "div",
       {
         ref_key: "dasTreeTableRef",
         ref: E,
-        class: ae(["das-ui-tree-table", e.border ? "is-border" : ""]),
+        class: ie(["das-ui-tree-table", e.border ? "is-border" : ""]),
         style: j({ height: T.value })
       },
       [
-        $("div", Te, [
+        $("div", pe, [
           $(
             "div",
-            Ke,
+            Le,
             A(e.title),
             1
             /* TEXT */
           ),
-          e.$slots.headerLeft ? L(e.$slots, "headerLeft", { key: 0 }, void 0, !0) : p("v-if", !0),
-          (w(!0), V(
+          e.$slots.headerLeft ? L(e.$slots, "headerLeft", { key: 0 }, void 0, !0) : w("v-if", !0),
+          (K(!0), V(
             G,
             null,
-            J(D.value, (l) => (w(), V(
+            J(D.value, (l) => (K(), V(
               "div",
               {
                 class: "check-item",
@@ -253,13 +250,13 @@ const Ce = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
               },
               [
                 L(e.$slots, e.checkboxLabels[l - 1] + "Header", {}, () => [
-                  e.isView ? (w(), V(
+                  e.isView ? (K(), V(
                     "span",
-                    Le,
+                    Ie,
                     A(e.allCheckboxNames[l - 1] ?? ""),
                     1
                     /* TEXT */
-                  )) : (w(), Q(N(X), {
+                  )) : (K(), Q(N(X), {
                     key: 1,
                     modelValue: h.value[l - 1],
                     "onUpdate:modelValue": (s) => h.value[l - 1] = s,
@@ -289,10 +286,10 @@ const Ce = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
             256
             /* UNKEYED_FRAGMENT */
           )),
-          e.$slots.headerRight ? L(e.$slots, "headerRight", { key: 1 }, void 0, !0) : p("v-if", !0)
+          e.$slots.headerRight ? L(e.$slots, "headerRight", { key: 1 }, void 0, !0) : w("v-if", !0)
         ]),
-        $("div", Ie, [
-          e.virtual ? M((w(), Q(N(be), {
+        $("div", Ve, [
+          e.virtual ? M((K(), Q(N(ye), {
             key: 0,
             ref_key: "$treeTableBody",
             ref: c,
@@ -306,23 +303,23 @@ const Ce = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
             style: { width: "100%" }
           }, {
             default: F(({ data: l, node: s }) => [
-              M((w(), V("div", Ve, [
-                $("div", $e, [
-                  $("div", Ne, [
+              M((K(), V("div", $e, [
+                $("div", Ne, [
+                  $("div", Ee, [
                     e.$slots.icon ? L(e.$slots, "icon", {
                       key: 0,
                       node: s,
                       data: l
                     }, () => [
-                      t[0] || (t[0] = S("icon"))
-                    ], !0) : p("v-if", !0),
+                      a[0] || (a[0] = S("icon"))
+                    ], !0) : w("v-if", !0),
                     L(e.$slots, "title", {
                       node: s,
                       data: l
                     }, () => [
                       $(
                         "span",
-                        Ee,
+                        De,
                         A(l[e.fistLabel]),
                         1
                         /* TEXT */
@@ -333,11 +330,11 @@ const Ce = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
                     key: 0,
                     node: s,
                     data: l
-                  }, void 0, !0) : p("v-if", !0),
-                  u(l) ? p("v-if", !0) : (w(!0), V(
+                  }, void 0, !0) : w("v-if", !0),
+                  u(l) ? w("v-if", !0) : (K(!0), V(
                     G,
                     { key: 1 },
-                    J(D.value, (f) => (w(), V(
+                    J(D.value, (f) => (K(), V(
                       "div",
                       {
                         class: "check-item",
@@ -349,7 +346,7 @@ const Ce = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
                           "onUpdate:modelValue": (C) => l[e.checkboxLabels[f - 1]] = C,
                           checkboxType: "default",
                           isView: e.isView,
-                          disabled: d(l, f - 1),
+                          disabled: n(l, f - 1),
                           onChange: (C) => {
                             O(C, l, f - 1);
                           }
@@ -375,18 +372,18 @@ const Ce = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
                     key: 2,
                     node: s,
                     data: l
-                  }, void 0, !0) : p("v-if", !0)
+                  }, void 0, !0) : w("v-if", !0)
                 ])
               ])), [
-                [N(le), { x: !1, "z-index": "auto" }]
+                [N(ae), { x: !1, "z-index": "auto" }]
               ])
             ]),
             _: 3
             /* FORWARDED */
           }, 8, ["nodeKey", "data", "props", "default-expand-all", "height"])), [
             [H, !q.value && !e.loading]
-          ]) : p("v-if", !0),
-          e.virtual ? p("v-if", !0) : M((w(), Q(N(ke), {
+          ]) : w("v-if", !0),
+          e.virtual ? w("v-if", !0) : M((K(), Q(N(be), {
             key: 1,
             ref_key: "$treeTableBody",
             ref: c,
@@ -400,23 +397,23 @@ const Ce = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
             style: { width: "100%" }
           }, {
             default: F(({ data: l, node: s }) => [
-              M((w(), V("div", De, [
-                $("div", Ae, [
-                  $("div", Be, [
+              M((K(), V("div", Ae, [
+                $("div", Be, [
+                  $("div", Re, [
                     e.$slots.icon ? L(e.$slots, "icon", {
                       key: 0,
                       node: s,
                       data: l
                     }, () => [
-                      t[1] || (t[1] = S("icon"))
-                    ], !0) : p("v-if", !0),
+                      a[1] || (a[1] = S("icon"))
+                    ], !0) : w("v-if", !0),
                     L(e.$slots, "title", {
                       node: s,
                       data: l
                     }, () => [
                       $(
                         "span",
-                        Re,
+                        Fe,
                         A(l[e.fistLabel]),
                         1
                         /* TEXT */
@@ -427,11 +424,11 @@ const Ce = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
                     key: 0,
                     node: s,
                     data: l
-                  }, void 0, !0) : p("v-if", !0),
-                  u(l) ? p("v-if", !0) : (w(!0), V(
+                  }, void 0, !0) : w("v-if", !0),
+                  u(l) ? w("v-if", !0) : (K(!0), V(
                     G,
                     { key: 1 },
-                    J(D.value, (f) => (w(), V(
+                    J(D.value, (f) => (K(), V(
                       "div",
                       {
                         class: "check-item",
@@ -443,7 +440,7 @@ const Ce = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
                           "onUpdate:modelValue": (C) => l[e.checkboxLabels[f - 1]] = C,
                           checkboxType: "default",
                           isView: e.isView,
-                          disabled: d(l, f - 1),
+                          disabled: n(l, f - 1),
                           onChange: (C) => {
                             O(C, l, f - 1);
                           }
@@ -469,10 +466,10 @@ const Ce = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
                     key: 2,
                     node: s,
                     data: l
-                  }, void 0, !0) : p("v-if", !0)
+                  }, void 0, !0) : w("v-if", !0)
                 ])
               ])), [
-                [N(le), { x: !1, "z-index": "auto" }]
+                [N(ae), { x: !1, "z-index": "auto" }]
               ])
             ]),
             _: 3
@@ -480,9 +477,9 @@ const Ce = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
           }, 8, ["nodeKey", "data", "props", "default-expand-all", "height"])), [
             [H, !q.value && !e.loading]
           ]),
-          p(" 空状态 "),
+          w(" 空状态 "),
           M(W(
-            N(ye),
+            N(ge),
             null,
             null,
             512
@@ -490,12 +487,12 @@ const Ce = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
           ), [
             [H, q.value && !e.loading]
           ]),
-          p(" 加载状态 "),
-          M(W(N(ge), {
+          w(" 加载状态 "),
+          M(W(N(me), {
             size: "small",
             spinning: e.loading
           }, {
-            default: F(() => t[2] || (t[2] = [
+            default: F(() => a[2] || (a[2] = [
               $(
                 "div",
                 { style: { width: "100%", height: "100%" } },
@@ -515,21 +512,21 @@ const Ce = (n, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, K) => {
       /* CLASS, STYLE */
     ));
   }
-}), Oe = (n, B) => {
-  const r = n.__vccOpts || n;
-  for (const [a, y] of B)
-    r[a] = y;
+}), Se = (d, B) => {
+  const r = d.__vccOpts || d;
+  for (const [t, y] of B)
+    r[t] = y;
   return r;
-}, Se = /* @__PURE__ */ Oe(Me, [["__scopeId", "data-v-dcc8bd7a"]]), Ue = {
+}, Ue = /* @__PURE__ */ Se(Oe, [["__scopeId", "data-v-5e8ac73d"]]), 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(Ue);
-const Ye = ce(Se), _e = () => U(null), Pe = { name: "tree-table 表格树" };
+ke(ze);
+const _e = ve(Ue), Pe = () => U(null), xe = { name: "tree-table 表格树" };
 export {
-  Ye as DasTreeTable,
-  _e as DasTreeTableRef,
-  Pe as default
+  _e as DasTreeTable,
+  Pe as DasTreeTableRef,
+  xe as default
 };