@das-fed/ui 6.4.0-dev.76 → 6.4.0-dev.78
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.
- package/esm-map.json +2 -1
- package/package.json +5 -6
- package/packages/business-components/device-panel/index.js +10121 -10094
- package/packages/business-components/device-panel/index.js.gz +0 -0
- package/packages/business-components/device-panel/style.css +1 -1
- package/packages/business-components/device-panel/style.css.gz +0 -0
- package/packages/business-components/echarts/index.js +2 -2
- package/packages/business-components/echarts/index.js.gz +0 -0
- package/packages/business-components/echarts/style.css +1 -1
- package/packages/business-components/model-table-dialog/src/ModelTable.vue.d.ts +2 -2
- package/packages/business-components/payment/index.js +175 -1626
- package/packages/business-components/payment/index.js.gz +0 -0
- package/packages/business-components/payment/style.css +1 -1
- package/packages/business-components/payment/type.d.ts +3 -2
- package/packages/components/autocomplete/src/index.vue.d.ts +5 -3
- package/packages/components/popover/index.d.ts +160 -2
- package/packages/components/popover/index.js +29 -27
- package/packages/components/popover/index.js.gz +0 -0
- package/packages/components/search/index.js +1 -1
- package/packages/components/search/index.js.gz +0 -0
- package/packages/components/search/style.css +1 -1
- package/packages/components/search/style.css.gz +0 -0
- package/packages/components/tree/index.js +88 -91
- package/packages/components/tree/index.js.gz +0 -0
- package/packages/components/tree/src/App.vue.d.ts +11 -19
- package/packages/components/tree/src/type.d.ts +1 -1
- package/packages/components/tree-select/index.js +81 -81
- package/packages/components/tree-select/index.js.gz +0 -0
- package/packages/components/tree-select/src/App.vue.d.ts +4 -4
- package/packages/components/tree-select/src/hooks/use-tree-select.d.ts +4 -4
- package/packages/components/tree-select/src/type.d.ts +0 -2
- package/packages/components/tree-v2/i18n/index.d.ts +5 -0
- package/packages/components/tree-v2/index.js +150 -149
- package/packages/components/tree-v2/index.js.gz +0 -0
|
@@ -300,8 +300,8 @@ function Pt(e, t, r, a) {
|
|
|
300
300
|
var c = !r;
|
|
301
301
|
r || (r = {});
|
|
302
302
|
for (var f = -1, i = t.length; ++f < i; ) {
|
|
303
|
-
var
|
|
304
|
-
b === void 0 && (b = e[
|
|
303
|
+
var g = t[f], b = void 0;
|
|
304
|
+
b === void 0 && (b = e[g]), c ? Pa(r, g, b) : Ea(r, g, b);
|
|
305
305
|
}
|
|
306
306
|
return r;
|
|
307
307
|
}
|
|
@@ -353,14 +353,14 @@ var Ma = typeof exports == "object" && exports && !exports.nodeType && exports,
|
|
|
353
353
|
}
|
|
354
354
|
}(), Kr = Qe && Qe.isTypedArray, Bi = Kr ? ir(Kr) : Mi, Ui = Object.prototype, zi = Ui.hasOwnProperty;
|
|
355
355
|
function Fa(e, t) {
|
|
356
|
-
var r = or(e), a = !r && ii(e), c = !r && !a && Na(e), f = !r && !a && !c && Bi(e), i = r || a || c || f,
|
|
356
|
+
var r = or(e), a = !r && ii(e), c = !r && !a && Na(e), f = !r && !a && !c && Bi(e), i = r || a || c || f, g = i ? ri(e.length, String) : [], b = g.length;
|
|
357
357
|
for (var v in e)
|
|
358
358
|
(t || zi.call(e, v)) && !(i && // Safari 9 has enumerable `arguments.length` in strict mode.
|
|
359
359
|
(v == "length" || // Node.js 0.10 has enumerable non-index properties on buffers.
|
|
360
360
|
c && (v == "offset" || v == "parent") || // PhantomJS 2 has enumerable non-index properties on typed arrays.
|
|
361
361
|
f && (v == "buffer" || v == "byteLength" || v == "byteOffset") || // Skip index properties.
|
|
362
|
-
di(v, b))) &&
|
|
363
|
-
return
|
|
362
|
+
di(v, b))) && g.push(v);
|
|
363
|
+
return g;
|
|
364
364
|
}
|
|
365
365
|
var Gi = Object.prototype;
|
|
366
366
|
function sr(e) {
|
|
@@ -573,26 +573,26 @@ var Yr = Qe && Qe.isSet, Zs = Yr ? ir(Yr) : Xs, Qs = 1, el = 2, tl = 4, qa = "[o
|
|
|
573
573
|
F[qa] = F[rl] = F[hl] = F[yl] = F[al] = F[nl] = F[pl] = F[gl] = F[bl] = F[$l] = F[_l] = F[sl] = F[ll] = F[Ya] = F[cl] = F[ul] = F[fl] = F[dl] = F[ml] = F[Tl] = F[Cl] = F[wl] = !0;
|
|
574
574
|
F[ol] = F[Ja] = F[vl] = !1;
|
|
575
575
|
function jt(e, t, r, a, c, f) {
|
|
576
|
-
var i,
|
|
576
|
+
var i, g = t & Qs, b = t & el, v = t & tl;
|
|
577
577
|
if (i !== void 0)
|
|
578
578
|
return i;
|
|
579
579
|
if (!Me(e))
|
|
580
580
|
return e;
|
|
581
581
|
var P = or(e);
|
|
582
582
|
if (P) {
|
|
583
|
-
if (i = $s(e), !
|
|
583
|
+
if (i = $s(e), !g)
|
|
584
584
|
return rs(e, i);
|
|
585
585
|
} else {
|
|
586
586
|
var C = Ee(e), $ = C == Ja || C == il;
|
|
587
587
|
if (Na(e))
|
|
588
|
-
return ts(e,
|
|
588
|
+
return ts(e, g);
|
|
589
589
|
if (C == Ya || C == qa || $ && !c) {
|
|
590
|
-
if (i = b || $ ? {} : Hs(e), !
|
|
590
|
+
if (i = b || $ ? {} : Hs(e), !g)
|
|
591
591
|
return b ? ls(e, Qi(i, e)) : is(e, qi(i, e));
|
|
592
592
|
} else {
|
|
593
593
|
if (!F[C])
|
|
594
594
|
return c ? e : {};
|
|
595
|
-
i = Rs(e, C,
|
|
595
|
+
i = Rs(e, C, g);
|
|
596
596
|
}
|
|
597
597
|
}
|
|
598
598
|
f || (f = new rt());
|
|
@@ -647,7 +647,7 @@ function Zr(e) {
|
|
|
647
647
|
}
|
|
648
648
|
var Dl = "Expected a function", Ml = Math.max, Fl = Math.min;
|
|
649
649
|
function Bl(e, t, r) {
|
|
650
|
-
var a, c, f, i,
|
|
650
|
+
var a, c, f, i, g, b, v = 0, P = !1, C = !1, $ = !0;
|
|
651
651
|
if (typeof e != "function")
|
|
652
652
|
throw new TypeError(Dl);
|
|
653
653
|
t = Zr(t) || 0, Me(r) && (P = !!r.leading, C = "maxWait" in r, f = C ? Ml(Zr(r.maxWait) || 0, t) : f, $ = "trailing" in r ? !!r.trailing : $);
|
|
@@ -656,7 +656,7 @@ function Bl(e, t, r) {
|
|
|
656
656
|
return a = c = void 0, v = I, i = e.apply(Y, ce), i;
|
|
657
657
|
}
|
|
658
658
|
function re(I) {
|
|
659
|
-
return v = I,
|
|
659
|
+
return v = I, g = setTimeout(L, t), P ? q(I) : i;
|
|
660
660
|
}
|
|
661
661
|
function O(I) {
|
|
662
662
|
var ce = I - b, Y = I - v, ae = t - ce;
|
|
@@ -670,30 +670,30 @@ function Bl(e, t, r) {
|
|
|
670
670
|
var I = Vt();
|
|
671
671
|
if (N(I))
|
|
672
672
|
return Ae(I);
|
|
673
|
-
|
|
673
|
+
g = setTimeout(L, O(I));
|
|
674
674
|
}
|
|
675
675
|
function Ae(I) {
|
|
676
|
-
return
|
|
676
|
+
return g = void 0, $ && a ? q(I) : (a = c = void 0, i);
|
|
677
677
|
}
|
|
678
678
|
function fe() {
|
|
679
|
-
|
|
679
|
+
g !== void 0 && clearTimeout(g), v = 0, a = b = c = g = void 0;
|
|
680
680
|
}
|
|
681
681
|
function de() {
|
|
682
|
-
return
|
|
682
|
+
return g === void 0 ? i : Ae(Vt());
|
|
683
683
|
}
|
|
684
684
|
function le() {
|
|
685
685
|
var I = Vt(), ce = N(I);
|
|
686
686
|
if (a = arguments, c = this, b = I, ce) {
|
|
687
|
-
if (
|
|
687
|
+
if (g === void 0)
|
|
688
688
|
return re(b);
|
|
689
689
|
if (C)
|
|
690
|
-
return clearTimeout(
|
|
690
|
+
return clearTimeout(g), g = setTimeout(L, t), q(b);
|
|
691
691
|
}
|
|
692
|
-
return
|
|
692
|
+
return g === void 0 && (g = setTimeout(L, t)), i;
|
|
693
693
|
}
|
|
694
694
|
return le.cancel = fe, le.flush = de, le;
|
|
695
695
|
}
|
|
696
|
-
const Ul = (e, t, r, a, c, f, i,
|
|
696
|
+
const Ul = (e, t, r, a, c, f, i, g, b) => {
|
|
697
697
|
const v = G(null), P = G([]), C = G(!1), $ = Z(() => ({
|
|
698
698
|
label: "name",
|
|
699
699
|
children: "children",
|
|
@@ -834,7 +834,7 @@ const Ul = (e, t, r, a, c, f, i, p, b) => {
|
|
|
834
834
|
const _ = c.value || [];
|
|
835
835
|
if (e != null && e.nodeKey && !_.includes(o[e.nodeKey])) {
|
|
836
836
|
const ue = _.concat(o[e.nodeKey]) || [];
|
|
837
|
-
e.showCheckbox && ((y = r.value) == null || y.setCheckedKeys(ue)),
|
|
837
|
+
e.showCheckbox && ((y = r.value) == null || y.setCheckedKeys(ue)), g(o, { checkedKeys: [...ue] }, !0);
|
|
838
838
|
}
|
|
839
839
|
}
|
|
840
840
|
(j = r.value) == null || j.setCurrentKey(o[e.nodeKey]);
|
|
@@ -1187,8 +1187,8 @@ function Yf(e, t, r, a) {
|
|
|
1187
1187
|
var c = !r;
|
|
1188
1188
|
r || (r = {});
|
|
1189
1189
|
for (var f = -1, i = t.length; ++f < i; ) {
|
|
1190
|
-
var
|
|
1191
|
-
b === void 0 && (b = e[
|
|
1190
|
+
var g = t[f], b = a ? a(r[g], e[g], g, r, e) : void 0;
|
|
1191
|
+
b === void 0 && (b = e[g]), c ? Jf(r, g, b) : qf(r, g, b);
|
|
1192
1192
|
}
|
|
1193
1193
|
return r;
|
|
1194
1194
|
}
|
|
@@ -1217,7 +1217,7 @@ function fd() {
|
|
|
1217
1217
|
var dd = fd;
|
|
1218
1218
|
St.exports;
|
|
1219
1219
|
(function(e, t) {
|
|
1220
|
-
var r = Se, a = dd, c = t && !t.nodeType && t, f = c && !0 && e && !e.nodeType && e, i = f && f.exports === c,
|
|
1220
|
+
var r = Se, a = dd, c = t && !t.nodeType && t, f = c && !0 && e && !e.nodeType && e, i = f && f.exports === c, g = i ? r.Buffer : void 0, b = g ? g.isBuffer : void 0, v = b || a;
|
|
1221
1221
|
e.exports = v;
|
|
1222
1222
|
})(St, St.exports);
|
|
1223
1223
|
var on = St.exports, vd = 9007199254740991, hd = /^(?:0|[1-9]\d*)$/;
|
|
@@ -1244,25 +1244,25 @@ function qd(e) {
|
|
|
1244
1244
|
var yr = qd, At = { exports: {} };
|
|
1245
1245
|
At.exports;
|
|
1246
1246
|
(function(e, t) {
|
|
1247
|
-
var r = Za, a = t && !t.nodeType && t, c = a && !0 && e && !e.nodeType && e, f = c && c.exports === a, i = f && r.process,
|
|
1247
|
+
var r = Za, a = t && !t.nodeType && t, c = a && !0 && e && !e.nodeType && e, f = c && c.exports === a, i = f && r.process, g = function() {
|
|
1248
1248
|
try {
|
|
1249
1249
|
var b = c && c.require && c.require("util").types;
|
|
1250
1250
|
return b || i && i.binding && i.binding("util");
|
|
1251
1251
|
} catch {
|
|
1252
1252
|
}
|
|
1253
1253
|
}();
|
|
1254
|
-
e.exports =
|
|
1254
|
+
e.exports = g;
|
|
1255
1255
|
})(At, At.exports);
|
|
1256
1256
|
var pr = At.exports, Jd = Wd, Yd = yr, sa = pr, la = sa && sa.isTypedArray, Xd = la ? Yd(la) : Jd, Zd = Xd, Qd = Zf, ev = cd, tv = hr, rv = on, av = pd, nv = Zd, ov = Object.prototype, iv = ov.hasOwnProperty;
|
|
1257
1257
|
function sv(e, t) {
|
|
1258
|
-
var r = tv(e), a = !r && ev(e), c = !r && !a && rv(e), f = !r && !a && !c && nv(e), i = r || a || c || f,
|
|
1258
|
+
var r = tv(e), a = !r && ev(e), c = !r && !a && rv(e), f = !r && !a && !c && nv(e), i = r || a || c || f, g = i ? Qd(e.length, String) : [], b = g.length;
|
|
1259
1259
|
for (var v in e)
|
|
1260
1260
|
(t || iv.call(e, v)) && !(i && // Safari 9 has enumerable `arguments.length` in strict mode.
|
|
1261
1261
|
(v == "length" || // Node.js 0.10 has enumerable non-index properties on buffers.
|
|
1262
1262
|
c && (v == "offset" || v == "parent") || // PhantomJS 2 has enumerable non-index properties on typed arrays.
|
|
1263
1263
|
f && (v == "buffer" || v == "byteLength" || v == "byteOffset") || // Skip index properties.
|
|
1264
|
-
av(v, b))) &&
|
|
1265
|
-
return
|
|
1264
|
+
av(v, b))) && g.push(v);
|
|
1265
|
+
return g;
|
|
1266
1266
|
}
|
|
1267
1267
|
var ln = sv, lv = Object.prototype;
|
|
1268
1268
|
function cv(e) {
|
|
@@ -1324,11 +1324,11 @@ function Hv(e, t) {
|
|
|
1324
1324
|
var Wv = Hv, kt = { exports: {} };
|
|
1325
1325
|
kt.exports;
|
|
1326
1326
|
(function(e, t) {
|
|
1327
|
-
var r = Se, a = t && !t.nodeType && t, c = a && !0 && e && !e.nodeType && e, f = c && c.exports === a, i = f ? r.Buffer : void 0,
|
|
1327
|
+
var r = Se, a = t && !t.nodeType && t, c = a && !0 && e && !e.nodeType && e, f = c && c.exports === a, i = f ? r.Buffer : void 0, g = i ? i.allocUnsafe : void 0;
|
|
1328
1328
|
function b(v, P) {
|
|
1329
1329
|
if (P)
|
|
1330
1330
|
return v.slice();
|
|
1331
|
-
var C = v.length, $ =
|
|
1331
|
+
var C = v.length, $ = g ? g(C) : new v.constructor(C);
|
|
1332
1332
|
return v.copy($), $;
|
|
1333
1333
|
}
|
|
1334
1334
|
e.exports = b;
|
|
@@ -1496,26 +1496,26 @@ var yp = hp, pp = yp, gp = yr, Ta = pr, Ca = Ta && Ta.isSet, bp = Ca ? gp(Ca) :
|
|
|
1496
1496
|
B[gn] = B[Vp] = B[ag] = B[ng] = B[Hp] = B[Wp] = B[og] = B[ig] = B[sg] = B[lg] = B[cg] = B[Yp] = B[Xp] = B[$n] = B[Zp] = B[Qp] = B[eg] = B[tg] = B[ug] = B[fg] = B[dg] = B[vg] = !0;
|
|
1497
1497
|
B[qp] = B[bn] = B[rg] = !1;
|
|
1498
1498
|
function Ot(e, t, r, a, c, f) {
|
|
1499
|
-
var i,
|
|
1499
|
+
var i, g = t & zp, b = t & Gp, v = t & Rp;
|
|
1500
1500
|
if (r && (i = c ? r(e, a, c, f) : r(e)), i !== void 0)
|
|
1501
1501
|
return i;
|
|
1502
1502
|
if (!Mp(e))
|
|
1503
1503
|
return e;
|
|
1504
1504
|
var P = Kp(e);
|
|
1505
1505
|
if (P) {
|
|
1506
|
-
if (i = Pp(e), !
|
|
1506
|
+
if (i = Pp(e), !g)
|
|
1507
1507
|
return Op(e, i);
|
|
1508
1508
|
} else {
|
|
1509
1509
|
var C = xp(e), $ = C == bn || C == Jp;
|
|
1510
1510
|
if (Np(e))
|
|
1511
|
-
return jp(e,
|
|
1511
|
+
return jp(e, g);
|
|
1512
1512
|
if (C == $n || C == gn || $ && !c) {
|
|
1513
|
-
if (i = b || $ ? {} : Lp(e), !
|
|
1513
|
+
if (i = b || $ ? {} : Lp(e), !g)
|
|
1514
1514
|
return b ? Ap(e, wp(i, e)) : Sp(e, Cp(i, e));
|
|
1515
1515
|
} else {
|
|
1516
1516
|
if (!B[C])
|
|
1517
1517
|
return c ? e : {};
|
|
1518
|
-
i = Ep(e, C,
|
|
1518
|
+
i = Ep(e, C, g);
|
|
1519
1519
|
}
|
|
1520
1520
|
}
|
|
1521
1521
|
f || (f = new _p());
|
|
@@ -1537,7 +1537,7 @@ function bg(e) {
|
|
|
1537
1537
|
return yg(e, pg | gg);
|
|
1538
1538
|
}
|
|
1539
1539
|
var $g = bg;
|
|
1540
|
-
const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i,
|
|
1540
|
+
const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, g, b, v, P, C, $, q, re, O, N, L, Ae) => {
|
|
1541
1541
|
const fe = G([]), de = G(!1), le = G(null), I = G(null);
|
|
1542
1542
|
yt(
|
|
1543
1543
|
() => de.value,
|
|
@@ -1599,7 +1599,7 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
1599
1599
|
return;
|
|
1600
1600
|
}
|
|
1601
1601
|
const E = await Y();
|
|
1602
|
-
E.length === 0 && E.push({ [
|
|
1602
|
+
E.length === 0 && E.push({ [g.value.label]: _e("暂无数据"), id: "nodata" }), fe.value = E;
|
|
1603
1603
|
}, Fe = () => {
|
|
1604
1604
|
fe.value = [];
|
|
1605
1605
|
}, We = async (m, E = !1) => {
|
|
@@ -1702,12 +1702,12 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
1702
1702
|
!v && c === b && a === C || (a = C, c = b, P && P.length && P.forEach((q) => {
|
|
1703
1703
|
q.classList.remove(c === "visible" ? "overflow-hide" : "overflow-visible"), q.classList.add(c === "visible" ? "overflow-visible" : "overflow-hide");
|
|
1704
1704
|
}));
|
|
1705
|
-
}, i = new AbortController(), { signal:
|
|
1705
|
+
}, i = new AbortController(), { signal: g } = i;
|
|
1706
1706
|
return wa(() => {
|
|
1707
1707
|
var v;
|
|
1708
1708
|
if (!r.isEllipsis) return;
|
|
1709
1709
|
const b = (v = e.value) == null ? void 0 : v.querySelector(".das-tree-container");
|
|
1710
|
-
b && b.addEventListener("mousemove", () => f("visible"), { signal:
|
|
1710
|
+
b && b.addEventListener("mousemove", () => f("visible"), { signal: g });
|
|
1711
1711
|
}), En(() => {
|
|
1712
1712
|
r.isEllipsis && i.abort();
|
|
1713
1713
|
}), { setTreeNodeChildrenOverflow: f };
|
|
@@ -1818,7 +1818,7 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
1818
1818
|
preview: import("@das-fed/ui/packages/icons/preview"),
|
|
1819
1819
|
view: import("@das-fed/ui/packages/icons/view")
|
|
1820
1820
|
});
|
|
1821
|
-
const f = Ln(), i = G(),
|
|
1821
|
+
const f = Ln(), i = G(), g = Z(() => a.emptyText || _e("暂无数据")), b = Z(() => a.searchEmptyText || _e("noDataTryAnotherKeyword")), v = Z(() => f.lazy ?? !!P.value), P = Z(() => a.load ?? void 0), C = G([]), $ = Z(() => a.search ?? void 0), q = Z(() => a.showCheckbox ? O.value : []), re = Z(() => a.showCheckbox ? a.currentNodeKey : O.value), O = Z({
|
|
1822
1822
|
get() {
|
|
1823
1823
|
return a.showCheckbox && !a.modelValue ? [] : a.modelValue;
|
|
1824
1824
|
},
|
|
@@ -1835,8 +1835,8 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
1835
1835
|
return Array.from(new Set(n));
|
|
1836
1836
|
}), fe = () => new Promise((n) => {
|
|
1837
1837
|
const d = () => {
|
|
1838
|
-
var k, h,
|
|
1839
|
-
if ((h = (k = i.value) == null ? void 0 : k.store) != null && h.nodesMap && ((K = Object.keys((
|
|
1838
|
+
var k, h, p, K;
|
|
1839
|
+
if ((h = (k = i.value) == null ? void 0 : k.store) != null && h.nodesMap && ((K = Object.keys((p = i.value) == null ? void 0 : p.store.nodesMap)) == null ? void 0 : K.length) > 0)
|
|
1840
1840
|
return n(!0);
|
|
1841
1841
|
setTimeout(() => d(), 50);
|
|
1842
1842
|
};
|
|
@@ -1846,11 +1846,11 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
1846
1846
|
const h = () => {
|
|
1847
1847
|
if (!(!C.value || !C.value.length)) {
|
|
1848
1848
|
if (Array.isArray(n)) {
|
|
1849
|
-
const
|
|
1850
|
-
if (
|
|
1849
|
+
const p = C.value.filter((K) => n.includes(K[a.nodeKey]));
|
|
1850
|
+
if (p.length === n.length) return d(p);
|
|
1851
1851
|
} else {
|
|
1852
|
-
const
|
|
1853
|
-
if (
|
|
1852
|
+
const p = C.value.find((K) => K[a.nodeKey] === n);
|
|
1853
|
+
if (p) return d(p);
|
|
1854
1854
|
}
|
|
1855
1855
|
if (setTimeout(() => {
|
|
1856
1856
|
h(), k += 50;
|
|
@@ -1859,15 +1859,12 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
1859
1859
|
}
|
|
1860
1860
|
};
|
|
1861
1861
|
h();
|
|
1862
|
-
}), le = async (n) => {
|
|
1863
|
-
if (a.getGrandChildren)
|
|
1864
|
-
return await a.getGrandChildren(n);
|
|
1865
|
-
}, I = (n, d) => {
|
|
1862
|
+
}), le = async (n) => a.getGrandChildren ? await a.getGrandChildren(n) : [], I = (n, d) => {
|
|
1866
1863
|
var h;
|
|
1867
1864
|
let k = n.childNodes.length;
|
|
1868
1865
|
if (k > 0)
|
|
1869
|
-
for (let
|
|
1870
|
-
const K = d, W = n.childNodes[
|
|
1866
|
+
for (let p = 0; p < k; p++) {
|
|
1867
|
+
const K = d, W = n.childNodes[p];
|
|
1871
1868
|
if (X(W.data, W)) {
|
|
1872
1869
|
I({ ...W, checked: K }, d);
|
|
1873
1870
|
continue;
|
|
@@ -1888,20 +1885,20 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
1888
1885
|
}
|
|
1889
1886
|
let k = await le(n);
|
|
1890
1887
|
C.value = Oa([...C.value, ...k], a.nodeKey);
|
|
1891
|
-
const h = k.concat(n),
|
|
1888
|
+
const h = k.concat(n), p = Array.from(new Set(h.map((te) => te[a.nodeKey])));
|
|
1892
1889
|
if (d) {
|
|
1893
|
-
const te = O.value ?? [], R = Be([...te, ...
|
|
1890
|
+
const te = O.value ?? [], R = Be([...te, ...p]);
|
|
1894
1891
|
O.value = Array.from(new Set(R)), (W = i.value) == null || W.setCheckedKeys(R);
|
|
1895
1892
|
} else {
|
|
1896
|
-
const R = (O.value ?? []).filter((V) => !
|
|
1893
|
+
const R = (O.value ?? []).filter((V) => !p.includes(V));
|
|
1897
1894
|
O.value = Array.from(new Set(R)), (ee = i.value) == null || ee.setCheckedKeys(R);
|
|
1898
1895
|
}
|
|
1899
1896
|
return k;
|
|
1900
1897
|
}, Y = G([]), ae = async (n, d) => {
|
|
1901
1898
|
var h;
|
|
1902
1899
|
if (v.value) {
|
|
1903
|
-
const
|
|
1904
|
-
return c("check-node-change", O.value, n, d), Y.value =
|
|
1900
|
+
const p = await ce(n, d);
|
|
1901
|
+
return c("check-node-change", O.value, n, d), Y.value = p.map((K) => K[a.nodeKey]), p;
|
|
1905
1902
|
}
|
|
1906
1903
|
await Le();
|
|
1907
1904
|
const k = (h = i.value) == null ? void 0 : h.getNode(n[a.nodeKey]);
|
|
@@ -1916,22 +1913,22 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
1916
1913
|
}
|
|
1917
1914
|
k.checked !== h && (k.checked = h), he(k, d);
|
|
1918
1915
|
}, He = async (n, d) => {
|
|
1919
|
-
var h,
|
|
1916
|
+
var h, p;
|
|
1920
1917
|
await Le();
|
|
1921
1918
|
const k = (h = i.value) == null ? void 0 : h.getNode(n[a.nodeKey]);
|
|
1922
|
-
return he(k, d), i.value && (O.value = (
|
|
1919
|
+
return he(k, d), i.value && (O.value = (p = i.value) == null ? void 0 : p.getCheckedKeys()), !0;
|
|
1923
1920
|
}, ne = G(!1), oe = G(!1), we = async (n, d, k = !1) => {
|
|
1924
1921
|
var R, V;
|
|
1925
1922
|
oe.value = !0;
|
|
1926
|
-
const { checkedKeys: h } = d,
|
|
1923
|
+
const { checkedKeys: h } = d, p = h.includes(n[a.nodeKey]), K = O.value.includes(n[a.nodeKey]), W = a.keepSelected && !_n(n) && K && !p;
|
|
1927
1924
|
await Le();
|
|
1928
1925
|
let ee = ((R = i.value) == null ? void 0 : R.getCheckedKeys()) || [];
|
|
1929
|
-
if (W && (ee = Be([...ee, n[a.nodeKey]]), a.showCheckbox && ((V = i.value) == null || V.setCheckedKeys(ee))), a.parentLinkChildrenStrictly || (O.value = ee),
|
|
1926
|
+
if (W && (ee = Be([...ee, n[a.nodeKey]]), a.showCheckbox && ((V = i.value) == null || V.setCheckedKeys(ee))), a.parentLinkChildrenStrictly || (O.value = ee), p && a.childLinkParentStrictly && !ne.value) {
|
|
1930
1927
|
const D = O.value ?? [];
|
|
1931
|
-
await He(n,
|
|
1928
|
+
await He(n, p), O.value = Array.from(/* @__PURE__ */ new Set([...D, ...O.value]));
|
|
1932
1929
|
}
|
|
1933
1930
|
let te = [];
|
|
1934
|
-
a.parentLinkChildrenStrictly && !ne.value && (te = await ae(n,
|
|
1931
|
+
a.parentLinkChildrenStrictly && !ne.value && (te = await ae(n, p)), a.parentLinkChildrenStrictly && v.value || (await Le(), c("check-node-change", O.value, n, p)), k && c("change", O.value, n, p, te);
|
|
1935
1932
|
}, Fe = G(!1), {
|
|
1936
1933
|
realHeight: We,
|
|
1937
1934
|
dasTree: je,
|
|
@@ -2004,12 +2001,12 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
2004
2001
|
yt(
|
|
2005
2002
|
() => O.value,
|
|
2006
2003
|
(n) => {
|
|
2007
|
-
var h,
|
|
2004
|
+
var h, p, K, W, ee, te;
|
|
2008
2005
|
const d = a.showCheckbox ? n ?? [] : n ?? void 0, k = a.showCheckbox ? Je.value ?? [] : Je.value ?? void 0;
|
|
2009
2006
|
if (JSON.stringify(d) !== JSON.stringify(k)) {
|
|
2010
2007
|
if (a.showCheckbox) {
|
|
2011
2008
|
if (d.length === 0) {
|
|
2012
|
-
(
|
|
2009
|
+
(p = i.value) == null || p.setCheckedKeys([]), Je.value = Be(d);
|
|
2013
2010
|
return;
|
|
2014
2011
|
}
|
|
2015
2012
|
} else if (!d) {
|
|
@@ -2213,15 +2210,15 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
2213
2210
|
}, { ...s(f), onCurrentChange: void 0 }, {
|
|
2214
2211
|
onCurrentChange: s(Tn),
|
|
2215
2212
|
onNodeClick: s(pe),
|
|
2216
|
-
onCheck: d[2] || (d[2] = (h,
|
|
2217
|
-
we(h,
|
|
2213
|
+
onCheck: d[2] || (d[2] = (h, p) => {
|
|
2214
|
+
we(h, p, !0);
|
|
2218
2215
|
}),
|
|
2219
2216
|
onNodeCollapse: Pn
|
|
2220
2217
|
}), {
|
|
2221
|
-
default: Ie(({ node: h, data:
|
|
2218
|
+
default: Ie(({ node: h, data: p }) => [
|
|
2222
2219
|
M(n.$slots, "default", {
|
|
2223
2220
|
node: h,
|
|
2224
|
-
data:
|
|
2221
|
+
data: p
|
|
2225
2222
|
}, () => {
|
|
2226
2223
|
var K, W;
|
|
2227
2224
|
return [
|
|
@@ -2236,11 +2233,11 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
2236
2233
|
n.showOperations ? (w(), S("div", jg, [
|
|
2237
2234
|
M(n.$slots, "oprations-label", {
|
|
2238
2235
|
node: h,
|
|
2239
|
-
data:
|
|
2236
|
+
data: p
|
|
2240
2237
|
}, () => [
|
|
2241
2238
|
n.isEllipsis ? be((w(), S("div", Og, [
|
|
2242
2239
|
Oe(
|
|
2243
|
-
$e(
|
|
2240
|
+
$e(p[s(H).label]),
|
|
2244
2241
|
1
|
|
2245
2242
|
/* TEXT */
|
|
2246
2243
|
)
|
|
@@ -2250,22 +2247,22 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
2250
2247
|
n.isEllipsis ? A("v-if", !0) : (w(), S(
|
|
2251
2248
|
"div",
|
|
2252
2249
|
Sg,
|
|
2253
|
-
$e(
|
|
2250
|
+
$e(p[s(H).label]),
|
|
2254
2251
|
1
|
|
2255
2252
|
/* TEXT */
|
|
2256
2253
|
))
|
|
2257
2254
|
]),
|
|
2258
|
-
!s(X)(
|
|
2255
|
+
!s(X)(p, h) && ((W = (K = s(ye)(h, p)) == null ? void 0 : K.list) != null && W.length || s(qe)(h, p).length) ? (w(), S("div", {
|
|
2259
2256
|
key: 0,
|
|
2260
2257
|
class: "oprations-box",
|
|
2261
|
-
onMouseenter: (ee) => s(j)(h,
|
|
2258
|
+
onMouseenter: (ee) => s(j)(h, p)
|
|
2262
2259
|
}, [
|
|
2263
2260
|
De(
|
|
2264
2261
|
"div",
|
|
2265
2262
|
{
|
|
2266
2263
|
class: "more-icon",
|
|
2267
|
-
ref: (ee) => s(l)(ee,
|
|
2268
|
-
style: Or(s(o) ===
|
|
2264
|
+
ref: (ee) => s(l)(ee, p[n.nodeKey]),
|
|
2265
|
+
style: Or(s(o) === p[n.nodeKey] ? "opacity: 1" : ""),
|
|
2269
2266
|
onClick: d[1] || (d[1] = Xe(() => {
|
|
2270
2267
|
}, ["stop"]))
|
|
2271
2268
|
},
|
|
@@ -2288,7 +2285,7 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
2288
2285
|
[
|
|
2289
2286
|
n.isEllipsis ? be((w(), S("div", kg, [
|
|
2290
2287
|
Oe(
|
|
2291
|
-
$e(
|
|
2288
|
+
$e(p[s(H).label]),
|
|
2292
2289
|
1
|
|
2293
2290
|
/* TEXT */
|
|
2294
2291
|
)
|
|
@@ -2297,7 +2294,7 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
2297
2294
|
]) : (w(), S(
|
|
2298
2295
|
"div",
|
|
2299
2296
|
Ig,
|
|
2300
|
-
$e(
|
|
2297
|
+
$e(p[s(H).label]),
|
|
2301
2298
|
1
|
|
2302
2299
|
/* TEXT */
|
|
2303
2300
|
))
|
|
@@ -2323,7 +2320,7 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
2323
2320
|
A(" 空状态 "),
|
|
2324
2321
|
Ut.value && !In.value ? (w(), S("div", xg, [
|
|
2325
2322
|
n.$slots.top ? M(n.$slots, "top", { key: 0 }) : A("v-if", !0),
|
|
2326
|
-
xe(wt, { "empty-text":
|
|
2323
|
+
xe(wt, { "empty-text": g.value }, Tt({
|
|
2327
2324
|
_: 2
|
|
2328
2325
|
/* DYNAMIC */
|
|
2329
2326
|
}, [
|
|
@@ -2362,19 +2359,19 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
2362
2359
|
(w(!0), S(
|
|
2363
2360
|
Te,
|
|
2364
2361
|
null,
|
|
2365
|
-
ct(s(mt), (h,
|
|
2366
|
-
key:
|
|
2362
|
+
ct(s(mt), (h, p) => (w(), S("li", {
|
|
2363
|
+
key: p,
|
|
2367
2364
|
class: Ye([
|
|
2368
2365
|
"search-result-item",
|
|
2369
2366
|
s(J)(h, !0) ? "is-active" : "",
|
|
2370
2367
|
s(X)(h, null) ? "is-disabled" : "",
|
|
2371
|
-
s(_t)(h,
|
|
2368
|
+
s(_t)(h, p)
|
|
2372
2369
|
]),
|
|
2373
2370
|
onMousedown: Xe((K) => s(Sn)(h, !0), ["stop"])
|
|
2374
2371
|
}, [
|
|
2375
2372
|
M(n.$slots, "search-result-item", {
|
|
2376
2373
|
item: h,
|
|
2377
|
-
index:
|
|
2374
|
+
index: p
|
|
2378
2375
|
}, () => [
|
|
2379
2376
|
be((w(), S("div", Lg, [
|
|
2380
2377
|
Oe(
|
|
@@ -2431,19 +2428,19 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
2431
2428
|
(w(!0), S(
|
|
2432
2429
|
Te,
|
|
2433
2430
|
null,
|
|
2434
|
-
ct(s(m), (h,
|
|
2435
|
-
key:
|
|
2431
|
+
ct(s(m), (h, p) => (w(), S("li", {
|
|
2432
|
+
key: p,
|
|
2436
2433
|
class: Ye([
|
|
2437
2434
|
"search-result-item",
|
|
2438
2435
|
s(J)(h, !0) ? "is-active" : "",
|
|
2439
2436
|
s(X)(h, null) ? "is-disabled" : "",
|
|
2440
|
-
s(_t)(h,
|
|
2437
|
+
s(_t)(h, p)
|
|
2441
2438
|
]),
|
|
2442
|
-
onMousedown: Xe((K) => s(E)(h,
|
|
2439
|
+
onMousedown: Xe((K) => s(E)(h, p), ["stop"])
|
|
2443
2440
|
}, [
|
|
2444
2441
|
M(n.$slots, "search-result-item", {
|
|
2445
2442
|
item: h,
|
|
2446
|
-
index:
|
|
2443
|
+
index: p
|
|
2447
2444
|
}, () => [
|
|
2448
2445
|
be((w(), S("div", Fg, [
|
|
2449
2446
|
Oe(
|
|
@@ -2492,10 +2489,10 @@ const vt = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, i, p, b, v, P, C, $,
|
|
|
2492
2489
|
onHide: d[4] || (d[4] = (h) => s(u)(!1))
|
|
2493
2490
|
}, {
|
|
2494
2491
|
default: Ie(() => {
|
|
2495
|
-
var h,
|
|
2492
|
+
var h, p, K, W, ee, te, R, V, D;
|
|
2496
2493
|
return [
|
|
2497
2494
|
(h = s(_)) != null && h.node ? (w(), S("ul", zg, [
|
|
2498
|
-
(K = (
|
|
2495
|
+
(K = (p = s(ye)(s(_).node, s(_).data)) == null ? void 0 : p.list) != null && K.length && ((W = s(ye)(s(_).node, s(_).data)) == null ? void 0 : W.position) === "top" ? (w(!0), S(
|
|
2499
2496
|
Te,
|
|
2500
2497
|
{ key: 0 },
|
|
2501
2498
|
ct((ee = s(ye)(s(_).node, s(_).data)) == null ? void 0 : ee.list, (T, se) => (w(), S(
|
|
Binary file
|
|
@@ -142,9 +142,7 @@ declare const _default: __VLS_WithTemplateSlots<import("vue").DefineComponent<Pr
|
|
|
142
142
|
setChecked: (value?: string | boolean | undefined, deep?: boolean | undefined, recursion?: boolean | undefined, passValue?: boolean | undefined) => void;
|
|
143
143
|
getChildren: (forceInit?: boolean) => import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData | import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData[];
|
|
144
144
|
updateChildren: () => void;
|
|
145
|
-
loadData: (callback: (node: import("element-plus/es/components/tree/src/model/node.mjs").default) => void, defaultProps
|
|
146
|
-
/** 非懒加载:子级联动父级 */
|
|
147
|
-
?: import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeLoadedDefaultProps) => void;
|
|
145
|
+
loadData: (callback: (node: import("element-plus/es/components/tree/src/model/node.mjs").default) => void, defaultProps?: import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeLoadedDefaultProps) => void;
|
|
148
146
|
};
|
|
149
147
|
currentNodeKey: import("element-plus/es/components/tree/src/tree.type.mjs").TreeKey;
|
|
150
148
|
nodesMap: import("element-plus/es/components/tree/src/tree.type.mjs").TreeStoreNodesMap;
|
|
@@ -213,7 +211,9 @@ declare const _default: __VLS_WithTemplateSlots<import("vue").DefineComponent<Pr
|
|
|
213
211
|
initialize: () => void;
|
|
214
212
|
filter: (value: any) => void;
|
|
215
213
|
setData: (newVal: import("element-plus/es/components/tree/src/tree.type.mjs").TreeData) => void;
|
|
216
|
-
getNode: (data: import("element-plus/es/components/tree/src/model/node.mjs").default | import(
|
|
214
|
+
getNode: (data: import("element-plus/es/components/tree/src/model/node.mjs").default | import(
|
|
215
|
+
/** 等待tree渲染完成 */
|
|
216
|
+
"element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData | import("element-plus/es/components/tree/src/tree.type.mjs").TreeKey) => import("element-plus/es/components/tree/src/model/node.mjs").default;
|
|
217
217
|
insertBefore: (data: import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData, refData: import("element-plus/es/components/tree/src/model/node.mjs").default | import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData | import("element-plus/es/components/tree/src/tree.type.mjs").TreeKey) => void;
|
|
218
218
|
insertAfter: (data: import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData, refData: import("element-plus/es/components/tree/src/model/node.mjs").default | import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData | import("element-plus/es/components/tree/src/tree.type.mjs").TreeKey) => void;
|
|
219
219
|
remove: (data: import("element-plus/es/components/tree/src/model/node.mjs").default | import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData) => void;
|
|
@@ -342,9 +342,9 @@ declare const _default: __VLS_WithTemplateSlots<import("vue").DefineComponent<Pr
|
|
|
342
342
|
getCheckedKeys: (leafOnly?: boolean | undefined) => import("element-plus/es/components/tree/src/tree.type.mjs").TreeKey[];
|
|
343
343
|
getCurrentNode: () => import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData;
|
|
344
344
|
getCurrentKey: () => any;
|
|
345
|
-
setCheckedNodes: (nodes: import("element-plus/es/components/tree/src/model/node.mjs"
|
|
345
|
+
setCheckedNodes: (nodes: import("element-plus/es/components/tree/src/model/node.mjs").default[], leafOnly?: boolean | undefined) => void;
|
|
346
346
|
setCheckedKeys: (keys: import("element-plus/es/components/tree/src/tree.type.mjs").TreeKey[], leafOnly?: boolean | undefined) => void;
|
|
347
|
-
setChecked: (data: import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData | import("element-plus/es/components/tree/src/tree.type.mjs").TreeKey, checked: boolean, deep: boolean) => void;
|
|
347
|
+
setChecked: (data: import("element-plus/es/components/tree/src/tree.type.mjs" /** newInnerVal为空,直接处理 */).TreeNodeData | import("element-plus/es/components/tree/src/tree.type.mjs").TreeKey, checked: boolean, deep: boolean) => void;
|
|
348
348
|
getHalfCheckedNodes: () => import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData[];
|
|
349
349
|
getHalfCheckedKeys: () => import("element-plus/es/components/tree/src/tree.type.mjs").TreeKey[];
|
|
350
350
|
setCurrentNode: (node: import("element-plus/es/components/tree/src/model/node.mjs").default, shouldAutoExpandParent?: boolean) => void;
|
|
@@ -358,9 +358,7 @@ declare const _default: __VLS_WithTemplateSlots<import("vue").DefineComponent<Pr
|
|
|
358
358
|
handleNodeExpand: (nodeData: import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData, node: import("element-plus/es/components/tree/src/model/node.mjs").default, instance: import("vue").ComponentInternalInstance) => void;
|
|
359
359
|
updateKeyChildren: (key: import("element-plus/es/components/tree/src/tree.type.mjs").TreeKey, data: import("element-plus/es/components/tree/src/tree.type.mjs").TreeData) => void;
|
|
360
360
|
}, unknown, {}, {}, import("vue").ComponentOptionsMixin, import("vue").ComponentOptionsMixin, ("node-click" | "current-change" | "node-expand" | "check-change" | "node-contextmenu" | "node-collapse" | "check" | "node-drag-start" | "node-drag-end" | "node-drop" | "node-drag-leave" | "node-drag-enter" | "node-drag-over")[], import("vue").VNodeProps & import("vue").AllowedComponentProps & import("vue").ComponentCustomProps, {
|
|
361
|
-
props: import(
|
|
362
|
-
/** el-tree实例 */
|
|
363
|
-
"element-plus/es/components/tree/src/tree.type.mjs").TreeOptionProps;
|
|
361
|
+
props: import("element-plus/es/components/tree/src/tree.type.mjs").TreeOptionProps;
|
|
364
362
|
data: unknown[];
|
|
365
363
|
checkStrictly: boolean;
|
|
366
364
|
lazy: boolean;
|
|
@@ -521,9 +519,7 @@ declare const _default: __VLS_WithTemplateSlots<import("vue").DefineComponent<Pr
|
|
|
521
519
|
setChecked: (value?: string | boolean | undefined, deep?: boolean | undefined, recursion?: boolean | undefined, passValue?: boolean | undefined) => void;
|
|
522
520
|
getChildren: (forceInit?: boolean) => import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData | import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData[];
|
|
523
521
|
updateChildren: () => void;
|
|
524
|
-
loadData: (callback: (node: import("element-plus/es/components/tree/src/model/node.mjs").default) => void, defaultProps
|
|
525
|
-
/** 非懒加载:子级联动父级 */
|
|
526
|
-
?: import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeLoadedDefaultProps) => void;
|
|
522
|
+
loadData: (callback: (node: import("element-plus/es/components/tree/src/model/node.mjs").default) => void, defaultProps?: import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeLoadedDefaultProps) => void;
|
|
527
523
|
};
|
|
528
524
|
currentNodeKey: import("element-plus/es/components/tree/src/tree.type.mjs").TreeKey;
|
|
529
525
|
nodesMap: import("element-plus/es/components/tree/src/tree.type.mjs").TreeStoreNodesMap;
|
|
@@ -891,9 +887,7 @@ declare const _default: __VLS_WithTemplateSlots<import("vue").DefineComponent<Pr
|
|
|
891
887
|
setChecked: (value?: string | boolean | undefined, deep?: boolean | undefined, recursion?: boolean | undefined, passValue?: boolean | undefined) => void;
|
|
892
888
|
getChildren: (forceInit?: boolean) => import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData | import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData[];
|
|
893
889
|
updateChildren: () => void;
|
|
894
|
-
loadData: (callback: (node: import("element-plus/es/components/tree/src/model/node.mjs").default) => void, defaultProps
|
|
895
|
-
/** 非懒加载:子级联动父级 */
|
|
896
|
-
?: import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeLoadedDefaultProps) => void;
|
|
890
|
+
loadData: (callback: (node: import("element-plus/es/components/tree/src/model/node.mjs").default) => void, defaultProps?: import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeLoadedDefaultProps) => void;
|
|
897
891
|
};
|
|
898
892
|
currentNodeKey: import("element-plus/es/components/tree/src/tree.type.mjs").TreeKey;
|
|
899
893
|
nodesMap: import("element-plus/es/components/tree/src/tree.type.mjs").TreeStoreNodesMap;
|
|
@@ -1268,9 +1262,7 @@ declare const _default: __VLS_WithTemplateSlots<import("vue").DefineComponent<Pr
|
|
|
1268
1262
|
setChecked: (value?: string | boolean | undefined, deep?: boolean | undefined, recursion?: boolean | undefined, passValue?: boolean | undefined) => void;
|
|
1269
1263
|
getChildren: (forceInit?: boolean) => import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData | import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeData[];
|
|
1270
1264
|
updateChildren: () => void;
|
|
1271
|
-
loadData: (callback: (node: import("element-plus/es/components/tree/src/model/node.mjs").default) => void, defaultProps
|
|
1272
|
-
/** 非懒加载:子级联动父级 */
|
|
1273
|
-
?: import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeLoadedDefaultProps) => void;
|
|
1265
|
+
loadData: (callback: (node: import("element-plus/es/components/tree/src/model/node.mjs").default) => void, defaultProps?: import("element-plus/es/components/tree/src/tree.type.mjs").TreeNodeLoadedDefaultProps) => void;
|
|
1274
1266
|
};
|
|
1275
1267
|
currentNodeKey: import("element-plus/es/components/tree/src/tree.type.mjs").TreeKey;
|
|
1276
1268
|
nodesMap: import("element-plus/es/components/tree/src/tree.type.mjs").TreeStoreNodesMap;
|
|
@@ -1523,7 +1515,7 @@ declare const _default: __VLS_WithTemplateSlots<import("vue").DefineComponent<Pr
|
|
|
1523
1515
|
/** 懒加载模式触发搜索 */
|
|
1524
1516
|
handleSearch: () => Promise<void>;
|
|
1525
1517
|
/** 根据父级获取所有子孙节点(提供给tree-select组件使用) */
|
|
1526
|
-
getGrandChildrenFn: (data: any) => Promise<any[]
|
|
1518
|
+
getGrandChildrenFn: (data: any) => Promise<any[]>;
|
|
1527
1519
|
}, {}, {}, {}, import("vue").ComponentOptionsMixin, import("vue").ComponentOptionsMixin, {
|
|
1528
1520
|
[x: string]: any;
|
|
1529
1521
|
} & {
|
|
@@ -192,7 +192,7 @@ export interface Emits {
|
|
|
192
192
|
(e: 'update:path', value: string | string[]): void
|
|
193
193
|
|
|
194
194
|
|
|
195
|
-
(e: 'change', value: string | string[], data: Record<any, any>, childrenData?: any[]): void
|
|
195
|
+
(e: 'change', value: string | string[], data: Record<any, any>, isCheck?: boolean, childrenData?: any[]): void
|
|
196
196
|
|
|
197
197
|
|
|
198
198
|
(e: 'handleOperation', item: any, node: any, data: any): void
|