@das-fed/upf-ui 6.4.0-dev.131 → 6.4.0-dev.133

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

@@ -1,55 +1,55 @@
 import '@das-fed/upf-ui/packages/components/tree-table/style.css';
-import { defineComponent as he, mergeModels as ee, ref as z, useModel as ce, computed as I, watch as le, createElementBlock as V, openBlock as K, normalizeStyle as W, 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 U, withDirectives as M, createVNode as j, vShow as H } from "vue";
+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/upf-utils/with-install/index";
 import { setThemeRule as ke } from "@das-fed/upf-web/packages/theme/index";
-import { DasTree as ye } from "@das-fed/upf-ui/packages/components/tree/index";
-import { DasVirtualTree as be } from "@das-fed/upf-ui/packages/components/virtual-tree/index";
+import { DasTree as be } from "@das-fed/upf-ui/packages/components/tree/index";
+import { DasVirtualTree as ye } from "@das-fed/upf-ui/packages/components/virtual-tree/index";
 import { DasCheckbox as X } from "@das-fed/upf-ui/packages/components/checkbox/index";
-import { vOverlay as ae } from "@das-fed/upf-ui/packages/components/overlay/index";
+import { vOverlay as te } from "@das-fed/upf-ui/packages/components/overlay/index";
 import { DasEmpty as ge } from "@das-fed/upf-ui/packages/components/empty/index";
 import { DasSpin as me } from "@das-fed/upf-ui/packages/components/spin/index";
-import { treeFind as Ce, flatTree as te } from "@das-fed/upf-utils/common-tools";
-const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
+import { treeFind as Ce, flatTree as ae } from "@das-fed/upf-utils/common-tools";
+const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
   let n = null;
   if (g ? n = (i) => {
     var u, c, h;
-    i[(u = f.value) == null ? void 0 : u.children] && i[(c = f.value) == null ? void 0 : c.children].length && i[(h = f.value) == null ? void 0 : h.children].forEach((s) => {
-      n && n(s), s[v + "-targetId"] == T && d.nodeKey && !t(i, p) && !b(i) && (y[i[d.nodeKey]].data[v] = !0, y[i[d.nodeKey]].data[v + "-targetId"] = T);
+    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) => {
+      n && n(o), o[v + "-targetId"] == T && d.nodeKey && !a(i, p) && !y(i) && (b[i[d.nodeKey]].data[v] = !0, b[i[d.nodeKey]].data[v + "-targetId"] = T);
     });
   } : n = (i) => {
     var u, c, h;
-    i[(u = f.value) == null ? void 0 : u.children] && i[(c = f.value) == null ? void 0 : c.children].length && i[(h = f.value) == null ? void 0 : h.children].forEach((s) => {
-      i[v + "-targetId"] == s[E.value] && d.nodeKey && !t(s, p) && !b(s) && (y[s[d.nodeKey]].data[v] = !1, y[s[d.nodeKey]].data[v + "-targetId"] = s[d.nodeKey]), n && n(s);
+    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] && d.nodeKey && !a(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++)
       n && n(k.value[i]);
-} }), Ke = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
+} }), Ke = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
   let n = null;
   if (g ? n = (i) => {
     var u, c, h;
-    i[(u = f.value) == null ? void 0 : u.children] && i[(c = f.value) == null ? void 0 : c.children].length && i[(h = f.value) == null ? void 0 : h.children].forEach((s) => {
-      i[v + "-targetId"] == s[E.value] && d.nodeKey && (!t(s, p) && !b(s) && (y[s[d.nodeKey]].data[v] = !0), y[s[d.nodeKey]].data[v + "-targetId"] = s[d.nodeKey]), n && n(s);
+    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] && d.nodeKey && (!a(o, p) && !y(o) && (b[o[d.nodeKey]].data[v] = !0), b[o[d.nodeKey]].data[v + "-targetId"] = o[d.nodeKey]), n && n(o);
     });
   } : n = (i) => {
     var u, c, h;
-    i[(u = f.value) == null ? void 0 : u.children] && i[(c = f.value) == null ? void 0 : c.children].length && i[(h = f.value) == null ? void 0 : h.children].forEach((s) => {
-      n && n(s), s[v + "-targetId"] == T && d.nodeKey && (!t(i, p) && !b(i) && (y[i[d.nodeKey]].data[v] = !1), y[i[d.nodeKey]].data[v + "-targetId"] = T);
+    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) => {
+      n && n(o), o[v + "-targetId"] == T && d.nodeKey && (!a(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++)
       n && n(k.value[i]);
-} }), Te = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
+} }), Te = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
   let n = null;
   if (g ? n = (i) => {
     var u, c, h;
-    i[(u = f.value) == null ? void 0 : u.children] && i[(c = f.value) == null ? void 0 : c.children].length && i[(h = f.value) == null ? void 0 : h.children].forEach((s) => {
-      i[v + "-targetId"] == s[E.value] && d.nodeKey && (!t(s, p) && !b(s) && (y[s[d.nodeKey]].data[v] = !0), y[s[d.nodeKey]].data[v + "-targetId"] = s[d.nodeKey]), n && n(s);
+    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] && d.nodeKey && (!a(o, p) && !y(o) && (b[o[d.nodeKey]].data[v] = !0), b[o[d.nodeKey]].data[v + "-targetId"] = o[d.nodeKey]), n && n(o);
     });
   } : n = (i) => {
     var u, c, h;
-    i[d.nodeKey] === T ? delete y[i[d.nodeKey]].data[v + "-targetId"] : i[(u = f.value) == null ? void 0 : u.children] && i[(c = f.value) == null ? void 0 : c.children].length && i[(h = f.value) == null ? void 0 : h.children].forEach((s) => {
-      s[d.nodeKey] == T ? d.nodeKey && delete y[s[d.nodeKey]].data[v + "-targetId"] : n && n(s);
+    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 = Ce(k.value, (u) => u[d.nodeKey] === T);
@@ -63,7 +63,7 @@ const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
 }, $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
-}, Se = /* @__PURE__ */ he({
+}, Oe = /* @__PURE__ */ he({
   ...Me,
   props: /* @__PURE__ */ ee({
     virtual: { type: Boolean, default: !0 },
@@ -92,111 +92,112 @@ const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
     keywordModifiers: {}
   }),
   emits: /* @__PURE__ */ ee(["update:data", "update:keyword", "all-check", "item-check"], ["update:keyword"]),
-  setup(d, { expose: B, emit: f }) {
-    const t = d, b = f, E = z(), k = ce(d, "keyword"), D = I(() => {
+  setup(d, { expose: B, emit: r }) {
+    const a = d, y = r, E = U(), k = ce(d, "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%"), 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.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.height;
+        return a.height;
       }
     }), 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, { children: "children", disabled: "disabled", isLeaf: "leaf", ...e, label: t.fistLabel };
-    }), y = 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, { children: "children", disabled: "disabled", isLeaf: "leaf", ...e, label: a.fistLabel };
+    }), b = I(() => {
       var e;
-      return ((e = t.props) == null ? void 0 : e.parentId) ?? "parentId";
+      return ((e = a.props) == null ? void 0 : e.parentId) ?? "parentId";
     }), p = I(() => {
-      var a, l, o, r, C, R;
+      var t, l, s, f, C, R;
       let e = [];
-      return (a = t.props) != null && a.disabled && ((l = t.props) != null && l.disabled.length) ? ((o = t.props) != null && o.disabled[0] ? e[0] = (r = t.props) == null ? void 0 : r.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(() => {
+      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;
+    }), n = (e, t) => typeof p.value[t] == "function" ? p.value[t](e, t) : e[p.value[t]], i = 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], c = z(), h = z([!1, !1]), s = z([!1, !1]), m = I({
-      get: () => t.data,
-      set: (e) => b("update:data", e)
-    }), Y = (e, a = []) => {
-      const l = {};
-      return Array.isArray(e) && e.forEach((o, r) => {
-        l[o[t.nodeKey]] = [...a, r], Array.isArray(o[g.value.children]) && Object.assign(l, Y(o[g.value.children], [...a, r]));
-      }), l;
-    }, Z = () => Y(m.value), _ = (e, a, l) => {
-      t.allCheckboxDisabled[l] || (e > 0 && a > 0 ? (h.value[l] = !1, s.value[l] = !0) : e == 0 && a >= 0 ? (h.value[l] = !1, s.value[l] = !1) : (h.value[l] = !0, s.value[l] = !1));
+      return ((e = a.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,
+      set: (e) => y("update:data", e)
+    }), Y = (e) => {
+      const t = {};
+      return Array.isArray(e) && e.forEach((l) => {
+        const s = { data: l };
+        t[l[a.nodeKey]] = 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));
     }, oe = (e) => {
-      const a = g.value.children;
+      const t = g.value.children;
       let l = [];
-      l = te(m.value, a);
-      for (let o = 0; o < D.value; o++) {
-        let r = 0, C = 0;
+      l = ae(m.value, t);
+      for (let s = 0; s < D.value; s++) {
+        let f = 0, C = 0;
         l.forEach((R) => {
-          n(R, o) || u(R) || (R[t.checkboxLabels[o]] ? r++ : C++);
-        }), _(r, C, o);
+          n(R, s) || u(R) || (R[a.checkboxLabels[s]] ? f++ : C++);
+        }), _(f, C, s);
       }
     }, { linkCheck: se } = we(
-      t,
-      b,
+      a,
+      y,
       g,
       n,
       u,
-      y,
-      m
-    ), { linkCheck: ne } = Ke(t, b, g, n, u, y, m), { linkCheck: de } = Te(
-      t,
       b,
+      m
+    ), { linkCheck: ne } = Ke(a, y, g, n, u, b, m), { linkCheck: de } = Te(
+      a,
+      y,
       g,
       n,
       u,
-      y,
+      b,
       m
-    ), ue = (e, a, l, o, r) => t.linkageType === "custom" ? void 0 : {
+    ), ue = (e, t, l, s, f) => a.linkageType === "custom" ? void 0 : {
       first: se,
       two: ne,
       three: de
-    }[t.linkageType](e, a, l, o, r), O = (e, a) => {
-      b("all-check", e, a), h.value[a] = e, s.value[a] = !1;
+    }[a.linkageType](e, t, l, s, f), z = (e, t) => {
+      y("all-check", e, t), h.value[t] = e, o.value[t] = !1;
       const l = Z();
       if (l)
-        for (let o in l)
-          !n(l[o].data, a) && !u(l[o].data) && (l[o].data[t.checkboxLabels[a]] = e, delete l[o].data[t.checkboxLabels[a] + "-targetId"]);
-      if (t.twoLinkFirstCheck) {
+        for (let s in l)
+          !n(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) {
         if (e) {
-          if (a === 1) {
-            if (t.allCheckboxDisabled[a - 1]) return;
-            O(e, a - 1);
+          if (t === 1) {
+            if (a.allCheckboxDisabled[t - 1]) return;
+            z(e, t - 1);
           }
-        } else if (a === 0) {
-          if (t.allCheckboxDisabled[a + 1]) return;
-          O(e, a + 1);
+        } else if (t === 0) {
+          if (a.allCheckboxDisabled[t + 1]) return;
+          z(e, t + 1);
         }
       }
     }, re = I(() => {
       let e = [];
       if (!m.value || !m.value.length) return e;
-      const a = g.value.children;
-      return e = te(m.value, a).filter(
-        (o) => o[g.value.label].toLowerCase().includes(k.value.toLowerCase())
+      const t = g.value.children;
+      return e = ae(m.value, t).filter(
+        (s) => s[g.value.label].toLowerCase().includes(k.value.toLowerCase())
       ), e;
     }), q = I(() => {
-      var a;
+      var t;
       let e = !1;
-      return (!m.value || !m.value.length) && (e = !0), k.value && !((a = re.value) != null && a.length) && (e = !0), e;
+      return (!m.value || !m.value.length) && (e = !0), k.value && !((t = re.value) != null && t.length) && (e = !0), e;
     }), fe = () => new Promise((e) => {
-      const a = () => {
+      const t = () => {
         var l;
         if ((l = c.value) != null && l.treeRef) return e(!0);
-        setTimeout(() => a(), 50);
+        setTimeout(() => t(), 50);
       };
-      a();
+      t();
     });
     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);
+      var e, t;
+      P != k.value && (await fe(), (t = (e = c.value) == null ? void 0 : e.treeRef) == null || t.filter(k.value), P = k.value);
     };
     le(
       () => m.value,
@@ -205,28 +206,28 @@ const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
       },
       { immediate: !0, deep: !0 }
     ), le(() => k.value, x);
-    const S = (e, a, l) => {
-      b("item-check", e, a, l);
-      const o = Z(), r = t.checkboxLabels[l];
-      o && (o[a[t.nodeKey]].data[r + "-targetId"] = a[t.nodeKey], o[a[t.nodeKey]].data[r] = e), ue(a[t.nodeKey], r, e, o, l), t.twoLinkFirstCheck && (e ? l === 1 && !n(a, l - 1) && !u(a) && S(e, a, l - 1) : l === 0 && !n(a, l + 1) && !u(a) && S(e, a, l + 1));
+    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), ue(t[a.nodeKey], f, e, s, l), a.twoLinkFirstCheck && (e ? l === 1 && !n(t, l - 1) && !u(t) && O(e, t, l - 1) : l === 0 && !n(t, l + 1) && !u(t) && O(e, t, l + 1));
     };
     return B({
       $treeTableBody: c,
       /** 获取树的节点数据 */
       getTreeNodesMap: Z,
       /** 手动全选/取消全选；参数val,index */
-      setAllCheck: O,
+      setAllCheck: z,
       /** 手动选中/取消选中；参数val,data,index */
-      setCheck: S,
+      setCheck: O,
       /** 手动联动全选;参数trueNum，falseNum，index */
       linkAllCheck: _
-    }), (e, a) => (K(), V(
+    }), (e, t) => (K(), V(
       "div",
       {
         ref_key: "dasTreeTableRef",
         ref: E,
         class: ie(["das-ui-tree-table", e.border ? "is-border" : ""]),
-        style: W({ height: T.value })
+        style: j({ height: T.value })
       },
       [
         $("div", pe, [
@@ -245,7 +246,7 @@ const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
               "div",
               {
                 class: "check-item",
-                style: W({ width: e.checkboxWidth[0] })
+                style: j({ width: e.checkboxWidth[0] })
               },
               [
                 L(e.$slots, e.checkboxLabels[l - 1] + "Header", {}, () => [
@@ -258,17 +259,17 @@ const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
                   )) : (K(), Q(N(X), {
                     key: 1,
                     modelValue: h.value[l - 1],
-                    "onUpdate:modelValue": (o) => h.value[l - 1] = o,
+                    "onUpdate:modelValue": (s) => h.value[l - 1] = s,
                     checkboxType: "default",
-                    indeterminate: s.value[l - 1],
+                    indeterminate: o.value[l - 1],
                     disabled: e.allCheckboxDisabled[l - 1] || !m.value || !m.value.length,
                     isView: e.isView,
-                    onChange: (o) => {
-                      O(o, l - 1);
+                    onChange: (s) => {
+                      z(s, l - 1);
                     }
                   }, {
                     default: F(() => [
-                      U(
+                      S(
                         A(e.allCheckboxNames[l - 1] ?? ""),
                         1
                         /* TEXT */
@@ -288,7 +289,7 @@ const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
           e.$slots.headerRight ? L(e.$slots, "headerRight", { key: 1 }, void 0, !0) : w("v-if", !0)
         ]),
         $("div", Ve, [
-          e.virtual ? M((K(), Q(N(be), {
+          e.virtual ? M((K(), Q(N(ye), {
             key: 0,
             ref_key: "$treeTableBody",
             ref: c,
@@ -301,19 +302,19 @@ const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
             height: v.value,
             style: { width: "100%" }
           }, {
-            default: F(({ data: l, node: o }) => [
+            default: F(({ data: l, node: s }) => [
               M((K(), V("div", $e, [
                 $("div", Ne, [
                   $("div", Ee, [
                     e.$slots.icon ? L(e.$slots, "icon", {
                       key: 0,
-                      node: o,
+                      node: s,
                       data: l
                     }, () => [
-                      a[0] || (a[0] = U("icon"))
+                      t[0] || (t[0] = S("icon"))
                     ], !0) : w("v-if", !0),
                     L(e.$slots, "title", {
-                      node: o,
+                      node: s,
                       data: l
                     }, () => [
                       $(
@@ -327,32 +328,32 @@ const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
                   ]),
                   e.$slots.bodyLeft ? L(e.$slots, "bodyLeft", {
                     key: 0,
-                    node: o,
+                    node: s,
                     data: l
                   }, void 0, !0) : w("v-if", !0),
                   u(l) ? w("v-if", !0) : (K(!0), V(
                     G,
                     { key: 1 },
-                    J(D.value, (r) => (K(), V(
+                    J(D.value, (f) => (K(), V(
                       "div",
                       {
                         class: "check-item",
-                        style: W({ width: e.checkboxWidth[r - 1] })
+                        style: j({ width: e.checkboxWidth[f - 1] })
                       },
                       [
-                        j(N(X), {
-                          modelValue: l[e.checkboxLabels[r - 1]],
-                          "onUpdate:modelValue": (C) => l[e.checkboxLabels[r - 1]] = C,
+                        W(N(X), {
+                          modelValue: l[e.checkboxLabels[f - 1]],
+                          "onUpdate:modelValue": (C) => l[e.checkboxLabels[f - 1]] = C,
                           checkboxType: "default",
                           isView: e.isView,
-                          disabled: n(l, r - 1),
+                          disabled: n(l, f - 1),
                           onChange: (C) => {
-                            S(C, l, r - 1);
+                            O(C, l, f - 1);
                           }
                         }, {
                           default: F(() => [
-                            U(
-                              A(e.checkboxNames[r - 1] ?? ""),
+                            S(
+                              A(e.checkboxNames[f - 1] ?? ""),
                               1
                               /* TEXT */
                             )
@@ -369,12 +370,12 @@ const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
                   )),
                   e.$slots.bodyRight ? L(e.$slots, "bodyRight", {
                     key: 2,
-                    node: o,
+                    node: s,
                     data: l
                   }, void 0, !0) : w("v-if", !0)
                 ])
               ])), [
-                [N(ae), { x: !1, "z-index": "auto" }]
+                [N(te), { x: !1, "z-index": "auto" }]
               ])
             ]),
             _: 3
@@ -382,7 +383,7 @@ const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
           }, 8, ["nodeKey", "data", "props", "default-expand-all", "height"])), [
             [H, !q.value && !e.loading]
           ]) : w("v-if", !0),
-          e.virtual ? w("v-if", !0) : M((K(), Q(N(ye), {
+          e.virtual ? w("v-if", !0) : M((K(), Q(N(be), {
             key: 1,
             ref_key: "$treeTableBody",
             ref: c,
@@ -395,19 +396,19 @@ const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
             height: v.value,
             style: { width: "100%" }
           }, {
-            default: F(({ data: l, node: o }) => [
+            default: F(({ data: l, node: s }) => [
               M((K(), V("div", Ae, [
                 $("div", Be, [
                   $("div", Re, [
                     e.$slots.icon ? L(e.$slots, "icon", {
                       key: 0,
-                      node: o,
+                      node: s,
                       data: l
                     }, () => [
-                      a[1] || (a[1] = U("icon"))
+                      t[1] || (t[1] = S("icon"))
                     ], !0) : w("v-if", !0),
                     L(e.$slots, "title", {
-                      node: o,
+                      node: s,
                       data: l
                     }, () => [
                       $(
@@ -421,32 +422,32 @@ const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
                   ]),
                   e.$slots.bodyLeft ? L(e.$slots, "bodyLeft", {
                     key: 0,
-                    node: o,
+                    node: s,
                     data: l
                   }, void 0, !0) : w("v-if", !0),
                   u(l) ? w("v-if", !0) : (K(!0), V(
                     G,
                     { key: 1 },
-                    J(D.value, (r) => (K(), V(
+                    J(D.value, (f) => (K(), V(
                       "div",
                       {
                         class: "check-item",
-                        style: W({ width: e.checkboxWidth[r - 1] })
+                        style: j({ width: e.checkboxWidth[f - 1] })
                       },
                       [
-                        j(N(X), {
-                          modelValue: l[e.checkboxLabels[r - 1]],
-                          "onUpdate:modelValue": (C) => l[e.checkboxLabels[r - 1]] = C,
+                        W(N(X), {
+                          modelValue: l[e.checkboxLabels[f - 1]],
+                          "onUpdate:modelValue": (C) => l[e.checkboxLabels[f - 1]] = C,
                           checkboxType: "default",
                           isView: e.isView,
-                          disabled: n(l, r - 1),
+                          disabled: n(l, f - 1),
                           onChange: (C) => {
-                            S(C, l, r - 1);
+                            O(C, l, f - 1);
                           }
                         }, {
                           default: F(() => [
-                            U(
-                              A(e.checkboxNames[r - 1] ?? ""),
+                            S(
+                              A(e.checkboxNames[f - 1] ?? ""),
                               1
                               /* TEXT */
                             )
@@ -463,12 +464,12 @@ const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
                   )),
                   e.$slots.bodyRight ? L(e.$slots, "bodyRight", {
                     key: 2,
-                    node: o,
+                    node: s,
                     data: l
                   }, void 0, !0) : w("v-if", !0)
                 ])
               ])), [
-                [N(ae), { x: !1, "z-index": "auto" }]
+                [N(te), { x: !1, "z-index": "auto" }]
               ])
             ]),
             _: 3
@@ -477,7 +478,7 @@ const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
             [H, !q.value && !e.loading]
           ]),
           w(" 空状态 "),
-          M(j(
+          M(W(
             N(ge),
             null,
             null,
@@ -487,11 +488,11 @@ const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
             [H, q.value && !e.loading]
           ]),
           w(" 加载状态 "),
-          M(j(N(me), {
+          M(W(N(me), {
             size: "small",
             spinning: e.loading
           }, {
-            default: F(() => a[2] || (a[2] = [
+            default: F(() => t[2] || (t[2] = [
               $(
                 "div",
                 { style: { width: "100%", height: "100%" } },
@@ -511,19 +512,19 @@ const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
       /* CLASS, STYLE */
     ));
   }
-}), Ue = (d, B) => {
-  const f = d.__vccOpts || d;
-  for (const [t, b] of B)
-    f[t] = b;
-  return f;
-}, ze = /* @__PURE__ */ Ue(Se, [["__scopeId", "data-v-0930aa69"]]), Oe = {
+}), Se = (d, B) => {
+  const r = d.__vccOpts || d;
+  for (const [a, y] of B)
+    r[a] = y;
+  return r;
+}, Ue = /* @__PURE__ */ Se(Oe, [["__scopeId", "data-v-5d225f58"]]), 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"
 };
-ke(Oe);
-const _e = ve(ze), Pe = () => z(null), xe = { name: "tree-table 表格树" };
+ke(ze);
+const _e = ve(Ue), Pe = () => U(null), xe = { name: "tree-table 表格树" };
 export {
   _e as DasTreeTable,
   Pe as DasTreeTableRef,

package/packages/components/tree-table/style.css

@@ -1 +1 @@
-.das-ui-tree-table[data-v-0930aa69]{display:flex;flex-direction:column}.das-ui-tree-table.is-border[data-v-0930aa69]{border:1px solid var(--das-ui-tree-table-border-color)}.das-ui-tree-table .table-header[data-v-0930aa69]{height:32px;display:flex;align-items:center;background:var(--das-ui-tree-table-header-bg-color);border-bottom:1px solid var(--das-ui-tree-table-border-color);box-sizing:border-box}.das-ui-tree-table .table-header .title[data-v-0930aa69]{flex:1;min-width:0}.das-ui-tree-table .table-header .table-label[data-v-0930aa69]{font-size:12px;color:var(--das-ui-tree-table-header-color)}.das-ui-tree-table .table-body[data-v-0930aa69]{flex:1;min-height:0}.das-ui-tree-table .table-body .tree-node[data-v-0930aa69]{flex:1;min-width:0;display:flex;align-items:center}.das-ui-tree-table .table-body .tree-node .first-column[data-v-0930aa69]{flex:1;min-width:0}.das-ui-tree-table .table-body .tree-node .first-column .title.is-highlight[data-v-0930aa69]{color:var(--das-ui-tree-table-highlight-color)}.das-ui-tree-table .das-ui-tree[data-v-0930aa69] .el-tree-node.is-current:not([aria-disabled=true])>.el-tree-node__content{color:var(--das-ui-tree-node-active-font-color);background-color:var(--das-ui-tree-node-active-bg-color)}.das-ui-tree-table .das-ui-tree[data-v-0930aa69] .el-tree-node.is-current:not([aria-disabled=true])>.el-tree-node__content .el-tree-node__expand-icon:not(.is-leaf){color:var(--das-ui-tree-node-active-font-color)}.das-ui-tree-table .das-ui-tree[data-v-0930aa69] .el-tree-node .el-tree-node__content,.das-ui-tree-table .das-ui-tree[data-v-0930aa69] .el-tree-node .el-tree-node__content .el-tree-node__label{width:100%}
+.das-ui-tree-table[data-v-5d225f58]{display:flex;flex-direction:column}.das-ui-tree-table.is-border[data-v-5d225f58]{border:1px solid var(--das-ui-tree-table-border-color)}.das-ui-tree-table .table-header[data-v-5d225f58]{height:32px;display:flex;align-items:center;background:var(--das-ui-tree-table-header-bg-color);border-bottom:1px solid var(--das-ui-tree-table-border-color);box-sizing:border-box}.das-ui-tree-table .table-header .title[data-v-5d225f58]{flex:1;min-width:0}.das-ui-tree-table .table-header .table-label[data-v-5d225f58]{font-size:12px;color:var(--das-ui-tree-table-header-color)}.das-ui-tree-table .table-body[data-v-5d225f58]{flex:1;min-height:0}.das-ui-tree-table .table-body .tree-node[data-v-5d225f58]{flex:1;min-width:0;display:flex;align-items:center}.das-ui-tree-table .table-body .tree-node .first-column[data-v-5d225f58]{flex:1;min-width:0}.das-ui-tree-table .table-body .tree-node .first-column .title.is-highlight[data-v-5d225f58]{color:var(--das-ui-tree-table-highlight-color)}.das-ui-tree-table .das-ui-tree[data-v-5d225f58] .el-tree-node.is-current:not([aria-disabled=true])>.el-tree-node__content{color:var(--das-ui-tree-node-active-font-color);background-color:var(--das-ui-tree-node-active-bg-color)}.das-ui-tree-table .das-ui-tree[data-v-5d225f58] .el-tree-node.is-current:not([aria-disabled=true])>.el-tree-node__content .el-tree-node__expand-icon:not(.is-leaf){color:var(--das-ui-tree-node-active-font-color)}.das-ui-tree-table .das-ui-tree[data-v-5d225f58] .el-tree-node .el-tree-node__content,.das-ui-tree-table .das-ui-tree[data-v-5d225f58] .el-tree-node .el-tree-node__content .el-tree-node__label{width:100%}