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

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -1,55 +1,55 @@
1
1
  import '@das-fed/upf-ui/packages/components/tree-table/style.css';
2
- 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";
2
+ 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";
3
3
  import { withInstall as ve } from "@das-fed/upf-utils/with-install/index";
4
4
  import { setThemeRule as ke } from "@das-fed/upf-web/packages/theme/index";
5
- import { DasTree as be } from "@das-fed/upf-ui/packages/components/tree/index";
6
- import { DasVirtualTree as ye } from "@das-fed/upf-ui/packages/components/virtual-tree/index";
5
+ import { DasTree as ye } from "@das-fed/upf-ui/packages/components/tree/index";
6
+ import { DasVirtualTree as be } from "@das-fed/upf-ui/packages/components/virtual-tree/index";
7
7
  import { DasCheckbox as X } from "@das-fed/upf-ui/packages/components/checkbox/index";
8
- import { vOverlay as te } from "@das-fed/upf-ui/packages/components/overlay/index";
8
+ import { vOverlay as ae } from "@das-fed/upf-ui/packages/components/overlay/index";
9
9
  import { DasEmpty as ge } from "@das-fed/upf-ui/packages/components/empty/index";
10
10
  import { DasSpin as me } from "@das-fed/upf-ui/packages/components/spin/index";
11
- import { treeFind as Ce, flatTree as ae } from "@das-fed/upf-utils/common-tools";
12
- const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
11
+ import { treeFind as Ce, flatTree as te } from "@das-fed/upf-utils/common-tools";
12
+ const we = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
13
13
  let n = null;
14
14
  if (g ? n = (i) => {
15
15
  var u, c, h;
16
- 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) => {
17
- 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);
16
+ 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) => {
17
+ 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);
18
18
  });
19
19
  } : n = (i) => {
20
20
  var u, c, h;
21
- 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) => {
22
- 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);
21
+ 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) => {
22
+ 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);
23
23
  });
24
24
  }, k.value && k.value.length)
25
25
  for (let i = 0; i < k.value.length; i++)
26
26
  n && n(k.value[i]);
27
- } }), Ke = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
27
+ } }), Ke = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
28
28
  let n = null;
29
29
  if (g ? n = (i) => {
30
30
  var u, c, h;
31
- 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) => {
32
- 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);
31
+ 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) => {
32
+ 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);
33
33
  });
34
34
  } : n = (i) => {
35
35
  var u, c, h;
36
- 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) => {
37
- 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);
36
+ 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) => {
37
+ 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);
38
38
  });
39
39
  }, k.value && k.value.length)
40
40
  for (let i = 0; i < k.value.length; i++)
41
41
  n && n(k.value[i]);
42
- } }), Te = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
42
+ } }), Te = (d, B, f, t, b, E, k) => ({ linkCheck: (T, v, g, y, p) => {
43
43
  let n = null;
44
44
  if (g ? n = (i) => {
45
45
  var u, c, h;
46
- 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) => {
47
- 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);
46
+ 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) => {
47
+ 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);
48
48
  });
49
49
  } : n = (i) => {
50
50
  var u, c, h;
51
- 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) => {
52
- o[d.nodeKey] == T ? d.nodeKey && delete b[o[d.nodeKey]].data[v + "-targetId"] : n && n(o);
51
+ 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) => {
52
+ s[d.nodeKey] == T ? d.nodeKey && delete y[s[d.nodeKey]].data[v + "-targetId"] : n && n(s);
53
53
  });
54
54
  }, k.value && k.value.length) {
55
55
  const i = Ce(k.value, (u) => u[d.nodeKey] === T);
@@ -63,7 +63,7 @@ const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
63
63
  }, $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 = {
64
64
  name: "DasTreeTable",
65
65
  inheritAttrs: !1
66
- }, Oe = /* @__PURE__ */ he({
66
+ }, Se = /* @__PURE__ */ he({
67
67
  ...Me,
68
68
  props: /* @__PURE__ */ ee({
69
69
  virtual: { type: Boolean, default: !0 },
@@ -92,112 +92,111 @@ const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
92
92
  keywordModifiers: {}
93
93
  }),
94
94
  emits: /* @__PURE__ */ ee(["update:data", "update:keyword", "all-check", "item-check"], ["update:keyword"]),
95
- setup(d, { expose: B, emit: r }) {
96
- const a = d, y = r, E = U(), k = ce(d, "keyword"), D = I(() => {
95
+ setup(d, { expose: B, emit: f }) {
96
+ const t = d, b = f, E = z(), k = ce(d, "keyword"), D = I(() => {
97
97
  var e;
98
- return a.checkNum ?? ((e = a.checkboxLabels) == null ? void 0 : e.length) ?? 0;
99
- }), T = I(() => a != null && a.height ? a.height + "px" : "100%"), v = I(() => {
100
- if (a != null && a.height) {
101
- if (typeof a.height == "string") {
102
- if (a.height.includes("%")) return;
103
- if (a.height.includes("px")) return Number(a.height.replace("px", ""));
98
+ return t.checkNum ?? ((e = t.checkboxLabels) == null ? void 0 : e.length) ?? 0;
99
+ }), T = I(() => t != null && t.height ? t.height + "px" : "100%"), v = I(() => {
100
+ if (t != null && t.height) {
101
+ if (typeof t.height == "string") {
102
+ if (t.height.includes("%")) return;
103
+ if (t.height.includes("px")) return Number(t.height.replace("px", ""));
104
104
  }
105
- return a.height;
105
+ return t.height;
106
106
  }
107
107
  }), g = I(() => {
108
- const e = { ...a.props };
109
- 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 };
110
- }), b = I(() => {
108
+ const e = { ...t.props };
109
+ 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 };
110
+ }), y = I(() => {
111
111
  var e;
112
- return ((e = a.props) == null ? void 0 : e.parentId) ?? "parentId";
112
+ return ((e = t.props) == null ? void 0 : e.parentId) ?? "parentId";
113
113
  }), p = I(() => {
114
- var t, l, s, f, C, R;
114
+ var a, l, o, r, C, R;
115
115
  let e = [];
116
- 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;
117
- }), n = (e, t) => typeof p.value[t] == "function" ? p.value[t](e, t) : e[p.value[t]], i = I(() => {
116
+ 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;
117
+ }), n = (e, a) => typeof p.value[a] == "function" ? p.value[a](e, a) : e[p.value[a]], i = I(() => {
118
118
  var e;
119
- return ((e = a.props) == null ? void 0 : e.hidden) ?? "hidden";
120
- }), u = (e) => typeof i.value == "function" ? i.value(e) : e[i.value], c = U(), h = U([!1, !1]), o = U([!1, !1]), m = I({
121
- get: () => a.data,
122
- set: (e) => y("update:data", e)
123
- }), Y = (e) => {
124
- const t = {};
125
- return Array.isArray(e) && e.forEach((l) => {
126
- const s = { data: l };
127
- t[l[a.nodeKey]] = s, Array.isArray(l[g.value.children]) && Object.assign(t, Y(l[g.value.children]));
128
- }), t;
129
- }, Z = () => Y(m.value), _ = (e, t, l) => {
130
- 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));
119
+ return ((e = t.props) == null ? void 0 : e.hidden) ?? "hidden";
120
+ }), u = (e) => typeof i.value == "function" ? i.value(e) : e[i.value], c = z(), h = z([!1, !1]), s = z([!1, !1]), m = I({
121
+ get: () => t.data,
122
+ set: (e) => b("update:data", e)
123
+ }), Y = (e, a = []) => {
124
+ const l = {};
125
+ return Array.isArray(e) && e.forEach((o, r) => {
126
+ l[o[t.nodeKey]] = [...a, r], Array.isArray(o[g.value.children]) && Object.assign(l, Y(o[g.value.children], [...a, r]));
127
+ }), l;
128
+ }, Z = () => Y(m.value), _ = (e, a, l) => {
129
+ 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));
131
130
  }, oe = (e) => {
132
- const t = g.value.children;
131
+ const a = g.value.children;
133
132
  let l = [];
134
- l = ae(m.value, t);
135
- for (let s = 0; s < D.value; s++) {
136
- let f = 0, C = 0;
133
+ l = te(m.value, a);
134
+ for (let o = 0; o < D.value; o++) {
135
+ let r = 0, C = 0;
137
136
  l.forEach((R) => {
138
- n(R, s) || u(R) || (R[a.checkboxLabels[s]] ? f++ : C++);
139
- }), _(f, C, s);
137
+ n(R, o) || u(R) || (R[t.checkboxLabels[o]] ? r++ : C++);
138
+ }), _(r, C, o);
140
139
  }
141
140
  }, { linkCheck: se } = we(
142
- a,
143
- y,
141
+ t,
142
+ b,
144
143
  g,
145
144
  n,
146
145
  u,
147
- b,
148
- m
149
- ), { linkCheck: ne } = Ke(a, y, g, n, u, b, m), { linkCheck: de } = Te(
150
- a,
151
146
  y,
147
+ m
148
+ ), { linkCheck: ne } = Ke(t, b, g, n, u, y, m), { linkCheck: de } = Te(
149
+ t,
150
+ b,
152
151
  g,
153
152
  n,
154
153
  u,
155
- b,
154
+ y,
156
155
  m
157
- ), ue = (e, t, l, s, f) => a.linkageType === "custom" ? void 0 : {
156
+ ), ue = (e, a, l, o, r) => t.linkageType === "custom" ? void 0 : {
158
157
  first: se,
159
158
  two: ne,
160
159
  three: de
161
- }[a.linkageType](e, t, l, s, f), z = (e, t) => {
162
- y("all-check", e, t), h.value[t] = e, o.value[t] = !1;
160
+ }[t.linkageType](e, a, l, o, r), O = (e, a) => {
161
+ b("all-check", e, a), h.value[a] = e, s.value[a] = !1;
163
162
  const l = Z();
164
163
  if (l)
165
- for (let s in l)
166
- !n(l[s].data, t) && !u(l[s].data) && (l[s].data[a.checkboxLabels[t]] = e, delete l[s].data[a.checkboxLabels[t] + "-targetId"]);
167
- if (a.twoLinkFirstCheck) {
164
+ for (let o in l)
165
+ !n(l[o].data, a) && !u(l[o].data) && (l[o].data[t.checkboxLabels[a]] = e, delete l[o].data[t.checkboxLabels[a] + "-targetId"]);
166
+ if (t.twoLinkFirstCheck) {
168
167
  if (e) {
169
- if (t === 1) {
170
- if (a.allCheckboxDisabled[t - 1]) return;
171
- z(e, t - 1);
168
+ if (a === 1) {
169
+ if (t.allCheckboxDisabled[a - 1]) return;
170
+ O(e, a - 1);
172
171
  }
173
- } else if (t === 0) {
174
- if (a.allCheckboxDisabled[t + 1]) return;
175
- z(e, t + 1);
172
+ } else if (a === 0) {
173
+ if (t.allCheckboxDisabled[a + 1]) return;
174
+ O(e, a + 1);
176
175
  }
177
176
  }
178
177
  }, re = I(() => {
179
178
  let e = [];
180
179
  if (!m.value || !m.value.length) return e;
181
- const t = g.value.children;
182
- return e = ae(m.value, t).filter(
183
- (s) => s[g.value.label].toLowerCase().includes(k.value.toLowerCase())
180
+ const a = g.value.children;
181
+ return e = te(m.value, a).filter(
182
+ (o) => o[g.value.label].toLowerCase().includes(k.value.toLowerCase())
184
183
  ), e;
185
184
  }), q = I(() => {
186
- var t;
185
+ var a;
187
186
  let e = !1;
188
- return (!m.value || !m.value.length) && (e = !0), k.value && !((t = re.value) != null && t.length) && (e = !0), e;
187
+ return (!m.value || !m.value.length) && (e = !0), k.value && !((a = re.value) != null && a.length) && (e = !0), e;
189
188
  }), fe = () => new Promise((e) => {
190
- const t = () => {
189
+ const a = () => {
191
190
  var l;
192
191
  if ((l = c.value) != null && l.treeRef) return e(!0);
193
- setTimeout(() => t(), 50);
192
+ setTimeout(() => a(), 50);
194
193
  };
195
- t();
194
+ a();
196
195
  });
197
196
  let P = "";
198
197
  const x = async () => {
199
- var e, t;
200
- P != k.value && (await fe(), (t = (e = c.value) == null ? void 0 : e.treeRef) == null || t.filter(k.value), P = k.value);
198
+ var e, a;
199
+ P != k.value && (await fe(), (a = (e = c.value) == null ? void 0 : e.treeRef) == null || a.filter(k.value), P = k.value);
201
200
  };
202
201
  le(
203
202
  () => m.value,
@@ -206,28 +205,28 @@ const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
206
205
  },
207
206
  { immediate: !0, deep: !0 }
208
207
  ), le(() => k.value, x);
209
- const O = (e, t, l) => {
210
- y("item-check", e, t, l);
211
- const s = Z(), f = a.checkboxLabels[l];
212
- 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));
208
+ const S = (e, a, l) => {
209
+ b("item-check", e, a, l);
210
+ const o = Z(), r = t.checkboxLabels[l];
211
+ 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));
213
212
  };
214
213
  return B({
215
214
  $treeTableBody: c,
216
215
  /** 获取树的节点数据 */
217
216
  getTreeNodesMap: Z,
218
217
  /** 手动全选/取消全选;参数val,index */
219
- setAllCheck: z,
218
+ setAllCheck: O,
220
219
  /** 手动选中/取消选中;参数val,data,index */
221
- setCheck: O,
220
+ setCheck: S,
222
221
  /** 手动联动全选;参数trueNum,falseNum,index */
223
222
  linkAllCheck: _
224
- }), (e, t) => (K(), V(
223
+ }), (e, a) => (K(), V(
225
224
  "div",
226
225
  {
227
226
  ref_key: "dasTreeTableRef",
228
227
  ref: E,
229
228
  class: ie(["das-ui-tree-table", e.border ? "is-border" : ""]),
230
- style: j({ height: T.value })
229
+ style: W({ height: T.value })
231
230
  },
232
231
  [
233
232
  $("div", pe, [
@@ -246,7 +245,7 @@ const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
246
245
  "div",
247
246
  {
248
247
  class: "check-item",
249
- style: j({ width: e.checkboxWidth[0] })
248
+ style: W({ width: e.checkboxWidth[0] })
250
249
  },
251
250
  [
252
251
  L(e.$slots, e.checkboxLabels[l - 1] + "Header", {}, () => [
@@ -259,17 +258,17 @@ const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
259
258
  )) : (K(), Q(N(X), {
260
259
  key: 1,
261
260
  modelValue: h.value[l - 1],
262
- "onUpdate:modelValue": (s) => h.value[l - 1] = s,
261
+ "onUpdate:modelValue": (o) => h.value[l - 1] = o,
263
262
  checkboxType: "default",
264
- indeterminate: o.value[l - 1],
263
+ indeterminate: s.value[l - 1],
265
264
  disabled: e.allCheckboxDisabled[l - 1] || !m.value || !m.value.length,
266
265
  isView: e.isView,
267
- onChange: (s) => {
268
- z(s, l - 1);
266
+ onChange: (o) => {
267
+ O(o, l - 1);
269
268
  }
270
269
  }, {
271
270
  default: F(() => [
272
- S(
271
+ U(
273
272
  A(e.allCheckboxNames[l - 1] ?? ""),
274
273
  1
275
274
  /* TEXT */
@@ -289,7 +288,7 @@ const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
289
288
  e.$slots.headerRight ? L(e.$slots, "headerRight", { key: 1 }, void 0, !0) : w("v-if", !0)
290
289
  ]),
291
290
  $("div", Ve, [
292
- e.virtual ? M((K(), Q(N(ye), {
291
+ e.virtual ? M((K(), Q(N(be), {
293
292
  key: 0,
294
293
  ref_key: "$treeTableBody",
295
294
  ref: c,
@@ -302,19 +301,19 @@ const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
302
301
  height: v.value,
303
302
  style: { width: "100%" }
304
303
  }, {
305
- default: F(({ data: l, node: s }) => [
304
+ default: F(({ data: l, node: o }) => [
306
305
  M((K(), V("div", $e, [
307
306
  $("div", Ne, [
308
307
  $("div", Ee, [
309
308
  e.$slots.icon ? L(e.$slots, "icon", {
310
309
  key: 0,
311
- node: s,
310
+ node: o,
312
311
  data: l
313
312
  }, () => [
314
- t[0] || (t[0] = S("icon"))
313
+ a[0] || (a[0] = U("icon"))
315
314
  ], !0) : w("v-if", !0),
316
315
  L(e.$slots, "title", {
317
- node: s,
316
+ node: o,
318
317
  data: l
319
318
  }, () => [
320
319
  $(
@@ -328,32 +327,32 @@ const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
328
327
  ]),
329
328
  e.$slots.bodyLeft ? L(e.$slots, "bodyLeft", {
330
329
  key: 0,
331
- node: s,
330
+ node: o,
332
331
  data: l
333
332
  }, void 0, !0) : w("v-if", !0),
334
333
  u(l) ? w("v-if", !0) : (K(!0), V(
335
334
  G,
336
335
  { key: 1 },
337
- J(D.value, (f) => (K(), V(
336
+ J(D.value, (r) => (K(), V(
338
337
  "div",
339
338
  {
340
339
  class: "check-item",
341
- style: j({ width: e.checkboxWidth[f - 1] })
340
+ style: W({ width: e.checkboxWidth[r - 1] })
342
341
  },
343
342
  [
344
- W(N(X), {
345
- modelValue: l[e.checkboxLabels[f - 1]],
346
- "onUpdate:modelValue": (C) => l[e.checkboxLabels[f - 1]] = C,
343
+ j(N(X), {
344
+ modelValue: l[e.checkboxLabels[r - 1]],
345
+ "onUpdate:modelValue": (C) => l[e.checkboxLabels[r - 1]] = C,
347
346
  checkboxType: "default",
348
347
  isView: e.isView,
349
- disabled: n(l, f - 1),
348
+ disabled: n(l, r - 1),
350
349
  onChange: (C) => {
351
- O(C, l, f - 1);
350
+ S(C, l, r - 1);
352
351
  }
353
352
  }, {
354
353
  default: F(() => [
355
- S(
356
- A(e.checkboxNames[f - 1] ?? ""),
354
+ U(
355
+ A(e.checkboxNames[r - 1] ?? ""),
357
356
  1
358
357
  /* TEXT */
359
358
  )
@@ -370,12 +369,12 @@ const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
370
369
  )),
371
370
  e.$slots.bodyRight ? L(e.$slots, "bodyRight", {
372
371
  key: 2,
373
- node: s,
372
+ node: o,
374
373
  data: l
375
374
  }, void 0, !0) : w("v-if", !0)
376
375
  ])
377
376
  ])), [
378
- [N(te), { x: !1, "z-index": "auto" }]
377
+ [N(ae), { x: !1, "z-index": "auto" }]
379
378
  ])
380
379
  ]),
381
380
  _: 3
@@ -383,7 +382,7 @@ const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
383
382
  }, 8, ["nodeKey", "data", "props", "default-expand-all", "height"])), [
384
383
  [H, !q.value && !e.loading]
385
384
  ]) : w("v-if", !0),
386
- e.virtual ? w("v-if", !0) : M((K(), Q(N(be), {
385
+ e.virtual ? w("v-if", !0) : M((K(), Q(N(ye), {
387
386
  key: 1,
388
387
  ref_key: "$treeTableBody",
389
388
  ref: c,
@@ -396,19 +395,19 @@ const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
396
395
  height: v.value,
397
396
  style: { width: "100%" }
398
397
  }, {
399
- default: F(({ data: l, node: s }) => [
398
+ default: F(({ data: l, node: o }) => [
400
399
  M((K(), V("div", Ae, [
401
400
  $("div", Be, [
402
401
  $("div", Re, [
403
402
  e.$slots.icon ? L(e.$slots, "icon", {
404
403
  key: 0,
405
- node: s,
404
+ node: o,
406
405
  data: l
407
406
  }, () => [
408
- t[1] || (t[1] = S("icon"))
407
+ a[1] || (a[1] = U("icon"))
409
408
  ], !0) : w("v-if", !0),
410
409
  L(e.$slots, "title", {
411
- node: s,
410
+ node: o,
412
411
  data: l
413
412
  }, () => [
414
413
  $(
@@ -422,32 +421,32 @@ const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
422
421
  ]),
423
422
  e.$slots.bodyLeft ? L(e.$slots, "bodyLeft", {
424
423
  key: 0,
425
- node: s,
424
+ node: o,
426
425
  data: l
427
426
  }, void 0, !0) : w("v-if", !0),
428
427
  u(l) ? w("v-if", !0) : (K(!0), V(
429
428
  G,
430
429
  { key: 1 },
431
- J(D.value, (f) => (K(), V(
430
+ J(D.value, (r) => (K(), V(
432
431
  "div",
433
432
  {
434
433
  class: "check-item",
435
- style: j({ width: e.checkboxWidth[f - 1] })
434
+ style: W({ width: e.checkboxWidth[r - 1] })
436
435
  },
437
436
  [
438
- W(N(X), {
439
- modelValue: l[e.checkboxLabels[f - 1]],
440
- "onUpdate:modelValue": (C) => l[e.checkboxLabels[f - 1]] = C,
437
+ j(N(X), {
438
+ modelValue: l[e.checkboxLabels[r - 1]],
439
+ "onUpdate:modelValue": (C) => l[e.checkboxLabels[r - 1]] = C,
441
440
  checkboxType: "default",
442
441
  isView: e.isView,
443
- disabled: n(l, f - 1),
442
+ disabled: n(l, r - 1),
444
443
  onChange: (C) => {
445
- O(C, l, f - 1);
444
+ S(C, l, r - 1);
446
445
  }
447
446
  }, {
448
447
  default: F(() => [
449
- S(
450
- A(e.checkboxNames[f - 1] ?? ""),
448
+ U(
449
+ A(e.checkboxNames[r - 1] ?? ""),
451
450
  1
452
451
  /* TEXT */
453
452
  )
@@ -464,12 +463,12 @@ const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
464
463
  )),
465
464
  e.$slots.bodyRight ? L(e.$slots, "bodyRight", {
466
465
  key: 2,
467
- node: s,
466
+ node: o,
468
467
  data: l
469
468
  }, void 0, !0) : w("v-if", !0)
470
469
  ])
471
470
  ])), [
472
- [N(te), { x: !1, "z-index": "auto" }]
471
+ [N(ae), { x: !1, "z-index": "auto" }]
473
472
  ])
474
473
  ]),
475
474
  _: 3
@@ -478,7 +477,7 @@ const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
478
477
  [H, !q.value && !e.loading]
479
478
  ]),
480
479
  w(" 空状态 "),
481
- M(W(
480
+ M(j(
482
481
  N(ge),
483
482
  null,
484
483
  null,
@@ -488,11 +487,11 @@ const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
488
487
  [H, q.value && !e.loading]
489
488
  ]),
490
489
  w(" 加载状态 "),
491
- M(W(N(me), {
490
+ M(j(N(me), {
492
491
  size: "small",
493
492
  spinning: e.loading
494
493
  }, {
495
- default: F(() => t[2] || (t[2] = [
494
+ default: F(() => a[2] || (a[2] = [
496
495
  $(
497
496
  "div",
498
497
  { style: { width: "100%", height: "100%" } },
@@ -512,19 +511,19 @@ const we = (d, B, r, a, y, E, k) => ({ linkCheck: (T, v, g, b, p) => {
512
511
  /* CLASS, STYLE */
513
512
  ));
514
513
  }
515
- }), Se = (d, B) => {
516
- const r = d.__vccOpts || d;
517
- for (const [a, y] of B)
518
- r[a] = y;
519
- return r;
520
- }, Ue = /* @__PURE__ */ Se(Oe, [["__scopeId", "data-v-5d225f58"]]), ze = {
514
+ }), Ue = (d, B) => {
515
+ const f = d.__vccOpts || d;
516
+ for (const [t, b] of B)
517
+ f[t] = b;
518
+ return f;
519
+ }, ze = /* @__PURE__ */ Ue(Se, [["__scopeId", "data-v-0930aa69"]]), Oe = {
521
520
  "--das-ui-tree-table-highlight-color": "#5582f3",
522
521
  "--das-ui-tree-table-header-color": "#212121",
523
522
  "--das-ui-tree-table-header-bg-color": "#F2F2F2",
524
523
  "--das-ui-tree-table-border-color": "#D9D9D9"
525
524
  };
526
- ke(ze);
527
- const _e = ve(Ue), Pe = () => U(null), xe = { name: "tree-table 表格树" };
525
+ ke(Oe);
526
+ const _e = ve(ze), Pe = () => z(null), xe = { name: "tree-table 表格树" };
528
527
  export {
529
528
  _e as DasTreeTable,
530
529
  Pe as DasTreeTableRef,
@@ -1 +1 @@
1
- .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%}
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%}
@@ -25,18 +25,20 @@ const s = {
25
25
  "--das-ui-color-help": "#999999",
26
26
  "--das-ui-color-disabled": "#B2B2B2",
27
27
  "--das-ui-color-overlay-error": "#FFDBE0"
28
- }, a = {
28
+ }, e = {
29
29
  "--das-ui-font-size-sm": "12px",
30
30
  "--das-ui-font-size-md": "14px",
31
- "--das-ui-font-size-lg": "16px"
32
- }, e = {
31
+ "--das-ui-font-size-lg": "16px",
32
+ "--das-upf-ui-font-size-sm": "14px",
33
+ "--das-upf-ui-line-height": "32px"
34
+ }, a = {
33
35
  "--das-ui-scrollbar-thumb-color": "#b2b2b2",
34
36
  "--das-ui-scrollbar-thumb-hover-color": "#999999",
35
37
  "--das-ui-scrollbar-padding": "1px",
36
38
  "--das-ui-scrollbar-thumb-size": "8px"
37
- }, o = /* @__PURE__ */ Object.assign({ "./module/color.ts": s, "./module/fontSize.ts": a, "./module/scrollbar.ts": e });
39
+ }, o = /* @__PURE__ */ Object.assign({ "./module/color.ts": s, "./module/fontSize.ts": e, "./module/scrollbar.ts": a });
38
40
  Object.keys(o).map((l) => r(o[l]));
39
- const c = {};
41
+ const d = {};
40
42
  export {
41
- c as default
43
+ d as default
42
44
  };
Binary file