@das-fed/ui 6.4.0-dev.97 → 6.4.0-dev.99
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/package.json +5 -5
- package/packages/business-components/device-panel/index.js +14 -14
- package/packages/business-components/device-panel/index.js.gz +0 -0
- package/packages/business-components/import-button/i18n/index.d.ts +10 -0
- package/packages/business-components/import-button/index.js +79 -77
- package/packages/business-components/import-button/index.js.gz +0 -0
- package/packages/business-components/layout-breadcrumb/index.js +4 -3
- package/packages/business-components/layout-breadcrumb/index.js.gz +0 -0
- package/packages/business-components/video-dialog/index.js +110 -110
- package/packages/business-components/video-dialog/index.js.gz +0 -0
- package/packages/components/tree/index.js +310 -310
- package/packages/components/tree/index.js.gz +0 -0
- package/packages/components/tree/src/App.vue.d.ts +14 -9
- package/packages/components/tree/src/hooks/use-tree.d.ts +1 -1
- package/packages/components/tree-v2/index.d.ts +0 -22
- package/packages/components/tree-v2/index.js +1725 -1728
- package/packages/components/tree-v2/index.js.gz +0 -0
- package/packages/components/tree-v2/src/hooks/use-style.d.ts +1 -1
- package/packages/components/tree-v2/src/hooks/use-tree.d.ts +1 -1
- package/packages/components/tree-v2/src/type.d.ts +1 -1
- package/packages/components/tree-v2/style.css +1 -1
- package/packages/components/tree-v2/style.css.gz +0 -0
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
import '@das-fed/ui/packages/components/tree/style.css';
|
|
2
|
-
import { defineComponent as nr, openBlock as w, createBlock as Wt, unref as i, createElementBlock as S, createElementVNode as De, renderSlot as M, createTextVNode as Oe, toDisplayString as
|
|
2
|
+
import { defineComponent as nr, openBlock as w, createBlock as Wt, unref as i, createElementBlock as S, createElementVNode as De, renderSlot as M, createTextVNode as Oe, toDisplayString as be, ref as G, computed as Q, watch as yt, nextTick as Le, onMounted as wa, onBeforeUnmount as En, useAttrs as Ln, normalizeStyle as Or, normalizeClass as Ye, mergeProps as Sr, isRef as Kn, createSlots as Tt, withCtx as Ie, createVNode as xe, createCommentVNode as E, withDirectives as ge, withModifiers as Xe, Fragment as Te, vShow as Nn, renderList as ct } from "vue";
|
|
3
3
|
import { withInstall as ja } from "@das-fed/utils/with-install/index";
|
|
4
4
|
import { setThemeRule as Dn } from "@das-fed/web/packages/theme/index";
|
|
5
|
-
import { t as
|
|
5
|
+
import { t as $e, setI18nRule as Mn } from "@das-fed/web/packages/i18n/index";
|
|
6
6
|
import { DasAutoRegisterIcon as Fn, DasIcon as ut } from "@das-fed/ui/packages/components/icon/index";
|
|
7
7
|
import { DasInput as Bn } from "@das-fed/ui/packages/components/input/index";
|
|
8
8
|
import { vOverlay as zt } from "@das-fed/ui/packages/components/overlay/index";
|
|
@@ -35,7 +35,7 @@ const Rn = /* @__PURE__ */ nr({
|
|
|
35
35
|
return (t, r) => (w(), S("div", Hn, [
|
|
36
36
|
De("div", Wn, [
|
|
37
37
|
M(t.$slots, "default", {}, () => [
|
|
38
|
-
Oe(
|
|
38
|
+
Oe(be(t.emptyText), 1)
|
|
39
39
|
], !0)
|
|
40
40
|
])
|
|
41
41
|
]));
|
|
@@ -296,8 +296,8 @@ function Pt(e, t, r, a) {
|
|
|
296
296
|
var c = !r;
|
|
297
297
|
r || (r = {});
|
|
298
298
|
for (var f = -1, s = t.length; ++f < s; ) {
|
|
299
|
-
var
|
|
300
|
-
b === void 0 && (b = e[
|
|
299
|
+
var p = t[f], b = void 0;
|
|
300
|
+
b === void 0 && (b = e[p]), c ? Pa(r, p, b) : Ea(r, p, b);
|
|
301
301
|
}
|
|
302
302
|
return r;
|
|
303
303
|
}
|
|
@@ -349,14 +349,14 @@ var Ma = typeof exports == "object" && exports && !exports.nodeType && exports,
|
|
|
349
349
|
}
|
|
350
350
|
}(), Kr = Qe && Qe.isTypedArray, Bs = Kr ? sr(Kr) : Ms, Us = Object.prototype, zs = Us.hasOwnProperty;
|
|
351
351
|
function Fa(e, t) {
|
|
352
|
-
var r = or(e), a = !r && ss(e), c = !r && !a && Na(e), f = !r && !a && !c && Bs(e), s = r || a || c || f,
|
|
352
|
+
var r = or(e), a = !r && ss(e), c = !r && !a && Na(e), f = !r && !a && !c && Bs(e), s = r || a || c || f, p = s ? rs(e.length, String) : [], b = p.length;
|
|
353
353
|
for (var h in e)
|
|
354
354
|
(t || zs.call(e, h)) && !(s && // Safari 9 has enumerable `arguments.length` in strict mode.
|
|
355
355
|
(h == "length" || // Node.js 0.10 has enumerable non-index properties on buffers.
|
|
356
356
|
c && (h == "offset" || h == "parent") || // PhantomJS 2 has enumerable non-index properties on typed arrays.
|
|
357
357
|
f && (h == "buffer" || h == "byteLength" || h == "byteOffset") || // Skip index properties.
|
|
358
|
-
ds(h, b))) &&
|
|
359
|
-
return
|
|
358
|
+
ds(h, b))) && p.push(h);
|
|
359
|
+
return p;
|
|
360
360
|
}
|
|
361
361
|
var Gs = Object.prototype;
|
|
362
362
|
function ir(e) {
|
|
@@ -569,26 +569,26 @@ var Yr = Qe && Qe.isSet, Zi = Yr ? sr(Yr) : Xi, Qi = 1, el = 2, tl = 4, qa = "[o
|
|
|
569
569
|
F[qa] = F[rl] = F[vl] = F[yl] = F[al] = F[nl] = F[pl] = F[gl] = F[bl] = F[$l] = F[_l] = F[il] = F[ll] = F[Ya] = F[cl] = F[ul] = F[fl] = F[dl] = F[ml] = F[Tl] = F[Cl] = F[wl] = !0;
|
|
570
570
|
F[ol] = F[Ja] = F[hl] = !1;
|
|
571
571
|
function jt(e, t, r, a, c, f) {
|
|
572
|
-
var s,
|
|
572
|
+
var s, p = t & Qi, b = t & el, h = t & tl;
|
|
573
573
|
if (s !== void 0)
|
|
574
574
|
return s;
|
|
575
575
|
if (!Me(e))
|
|
576
576
|
return e;
|
|
577
577
|
var x = or(e);
|
|
578
578
|
if (x) {
|
|
579
|
-
if (s = $i(e), !
|
|
579
|
+
if (s = $i(e), !p)
|
|
580
580
|
return ri(e, s);
|
|
581
581
|
} else {
|
|
582
582
|
var C = Ee(e), $ = C == Ja || C == sl;
|
|
583
583
|
if (Na(e))
|
|
584
|
-
return ti(e,
|
|
584
|
+
return ti(e, p);
|
|
585
585
|
if (C == Ya || C == qa || $ && !c) {
|
|
586
|
-
if (s = b || $ ? {} : Hi(e), !
|
|
586
|
+
if (s = b || $ ? {} : Hi(e), !p)
|
|
587
587
|
return b ? li(e, Qs(s, e)) : si(e, qs(s, e));
|
|
588
588
|
} else {
|
|
589
589
|
if (!F[C])
|
|
590
590
|
return c ? e : {};
|
|
591
|
-
s = Ri(e, C,
|
|
591
|
+
s = Ri(e, C, p);
|
|
592
592
|
}
|
|
593
593
|
}
|
|
594
594
|
f || (f = new rt());
|
|
@@ -600,7 +600,7 @@ function jt(e, t, r, a, c, f) {
|
|
|
600
600
|
}) : Ji(e) && e.forEach(function(N, L) {
|
|
601
601
|
s.set(L, jt(N, t, r, L, e, f));
|
|
602
602
|
});
|
|
603
|
-
var
|
|
603
|
+
var ae = h ? b ? ui : ci : b ? cr : lr, O = x ? void 0 : ae(e);
|
|
604
604
|
return Qo(O || e, function(N, L) {
|
|
605
605
|
O && (L = N, N = e[L]), Ea(s, L, jt(N, t, r, L, e, f));
|
|
606
606
|
}), s;
|
|
@@ -643,7 +643,7 @@ function Zr(e) {
|
|
|
643
643
|
}
|
|
644
644
|
var Dl = "Expected a function", Ml = Math.max, Fl = Math.min;
|
|
645
645
|
function Bl(e, t, r) {
|
|
646
|
-
var a, c, f, s,
|
|
646
|
+
var a, c, f, s, p, b, h = 0, x = !1, C = !1, $ = !0;
|
|
647
647
|
if (typeof e != "function")
|
|
648
648
|
throw new TypeError(Dl);
|
|
649
649
|
t = Zr(t) || 0, Me(r) && (x = !!r.leading, C = "maxWait" in r, f = C ? Ml(Zr(r.maxWait) || 0, t) : f, $ = "trailing" in r ? !!r.trailing : $);
|
|
@@ -651,12 +651,12 @@ function Bl(e, t, r) {
|
|
|
651
651
|
var ce = a, Y = c;
|
|
652
652
|
return a = c = void 0, h = k, s = e.apply(Y, ce), s;
|
|
653
653
|
}
|
|
654
|
-
function
|
|
655
|
-
return h = k,
|
|
654
|
+
function ae(k) {
|
|
655
|
+
return h = k, p = setTimeout(L, t), x ? q(k) : s;
|
|
656
656
|
}
|
|
657
657
|
function O(k) {
|
|
658
|
-
var ce = k - b, Y = k - h,
|
|
659
|
-
return C ? Fl(
|
|
658
|
+
var ce = k - b, Y = k - h, ne = t - ce;
|
|
659
|
+
return C ? Fl(ne, f - Y) : ne;
|
|
660
660
|
}
|
|
661
661
|
function N(k) {
|
|
662
662
|
var ce = k - b, Y = k - h;
|
|
@@ -666,31 +666,31 @@ function Bl(e, t, r) {
|
|
|
666
666
|
var k = Vt();
|
|
667
667
|
if (N(k))
|
|
668
668
|
return Ae(k);
|
|
669
|
-
|
|
669
|
+
p = setTimeout(L, O(k));
|
|
670
670
|
}
|
|
671
671
|
function Ae(k) {
|
|
672
|
-
return
|
|
672
|
+
return p = void 0, $ && a ? q(k) : (a = c = void 0, s);
|
|
673
673
|
}
|
|
674
|
-
function
|
|
675
|
-
|
|
674
|
+
function ue() {
|
|
675
|
+
p !== void 0 && clearTimeout(p), h = 0, a = b = c = p = void 0;
|
|
676
676
|
}
|
|
677
|
-
function
|
|
678
|
-
return
|
|
677
|
+
function fe() {
|
|
678
|
+
return p === void 0 ? s : Ae(Vt());
|
|
679
679
|
}
|
|
680
680
|
function le() {
|
|
681
681
|
var k = Vt(), ce = N(k);
|
|
682
682
|
if (a = arguments, c = this, b = k, ce) {
|
|
683
|
-
if (
|
|
684
|
-
return
|
|
683
|
+
if (p === void 0)
|
|
684
|
+
return ae(b);
|
|
685
685
|
if (C)
|
|
686
|
-
return clearTimeout(
|
|
686
|
+
return clearTimeout(p), p = setTimeout(L, t), q(b);
|
|
687
687
|
}
|
|
688
|
-
return
|
|
688
|
+
return p === void 0 && (p = setTimeout(L, t)), s;
|
|
689
689
|
}
|
|
690
|
-
return le.cancel =
|
|
690
|
+
return le.cancel = ue, le.flush = fe, le;
|
|
691
691
|
}
|
|
692
|
-
const Ul = (e, t, r, a, c, f, s,
|
|
693
|
-
const h = G(null), x = G([]), C = G(!1), $ =
|
|
692
|
+
const Ul = (e, t, r, a, c, f, s, p, b) => {
|
|
693
|
+
const h = G(null), x = G([]), C = G(!1), $ = Q(() => ({
|
|
694
694
|
label: "name",
|
|
695
695
|
children: "children",
|
|
696
696
|
parentId: "parentId",
|
|
@@ -699,18 +699,18 @@ const Ul = (e, t, r, a, c, f, s, g, b) => {
|
|
|
699
699
|
isLeaf: "leaf",
|
|
700
700
|
allowUnSelect: "allowUnSelect",
|
|
701
701
|
...e.props
|
|
702
|
-
})), q =
|
|
702
|
+
})), q = Q(() => {
|
|
703
703
|
let o = "100%";
|
|
704
704
|
return e.height && (o = Yn(e.height)), o;
|
|
705
|
-
}),
|
|
705
|
+
}), ae = (o, u, l) => {
|
|
706
706
|
if (!e.operationsLabel) return;
|
|
707
707
|
const y = e.operationsLabel[o];
|
|
708
708
|
if (y)
|
|
709
709
|
return typeof y == "function" ? y(u, l) : y;
|
|
710
710
|
}, O = G({}), N = (o, u) => {
|
|
711
711
|
o && (O.value[u] = o);
|
|
712
|
-
}, L = G(null), Ae = G(null),
|
|
713
|
-
Ae.value = O.value[u[e.nodeKey]],
|
|
712
|
+
}, L = G(null), Ae = G(null), ue = G({ node: null, data: null }), fe = (o, u) => {
|
|
713
|
+
Ae.value = O.value[u[e.nodeKey]], ue.value = {
|
|
714
714
|
node: o,
|
|
715
715
|
data: u
|
|
716
716
|
};
|
|
@@ -718,33 +718,33 @@ const Ul = (e, t, r, a, c, f, s, g, b) => {
|
|
|
718
718
|
var o;
|
|
719
719
|
(o = L.value) == null || o.hide();
|
|
720
720
|
}, k = G(""), ce = (o) => {
|
|
721
|
-
k.value = o ?
|
|
721
|
+
k.value = o ? ue.value.data[e.nodeKey] : "";
|
|
722
722
|
}, Y = (o, u) => {
|
|
723
|
-
var j,
|
|
723
|
+
var j, Z, m, me;
|
|
724
724
|
let l = {};
|
|
725
725
|
const y = "bottom";
|
|
726
|
-
return e.showOperations && ((j = e.mergeOprations) != null && j.list ? typeof e.mergeOprations.list != "function" ? (
|
|
727
|
-
},
|
|
726
|
+
return e.showOperations && ((j = e.mergeOprations) != null && j.list ? typeof e.mergeOprations.list != "function" ? (Z = e.mergeOprations) != null && Z.list && e.mergeOprations.list.length && (l.list = e.mergeOprations.list) : l.list = e.mergeOprations.list(o, u) : l.list = [], (m = l.list) != null && m.length && (l.list = l.list.filter((_t) => !_t.hidden)), (me = e.mergeOprations) != null && me.position ? (typeof e.mergeOprations.position != "function" ? l.position = e.mergeOprations.position : l.position = e.mergeOprations.position(o, u), l.position === "left" && (l.position = "top"), l.position === "right" && (l.position = "bottom")) : l.position = y), l;
|
|
727
|
+
}, ne = (o, u) => {
|
|
728
728
|
let l = [], y = [];
|
|
729
729
|
if (e.showOperations && (!e.operations || !e.operations.length ? y = [
|
|
730
730
|
{
|
|
731
731
|
value: "add",
|
|
732
|
-
label:
|
|
732
|
+
label: ae("add", o, u) ?? $e("新增同级"),
|
|
733
733
|
icon: "add"
|
|
734
734
|
},
|
|
735
735
|
{
|
|
736
736
|
value: "addItem",
|
|
737
|
-
label:
|
|
737
|
+
label: ae("addItem", o, u) ?? $e("新增子级"),
|
|
738
738
|
icon: "addItem"
|
|
739
739
|
},
|
|
740
740
|
{
|
|
741
741
|
value: "edit",
|
|
742
|
-
label:
|
|
742
|
+
label: ae("edit", o, u) ?? $e("编辑"),
|
|
743
743
|
icon: "edit"
|
|
744
744
|
},
|
|
745
745
|
{
|
|
746
746
|
value: "delete",
|
|
747
|
-
label:
|
|
747
|
+
label: ae("delete", o, u) ?? $e("删除"),
|
|
748
748
|
icon: "delete"
|
|
749
749
|
}
|
|
750
750
|
] : typeof e.operations == "function" ? y = e.operations(o, u) : y = e.operations), !y || !y.length) return [];
|
|
@@ -752,27 +752,27 @@ const Ul = (e, t, r, a, c, f, s, g, b) => {
|
|
|
752
752
|
l = y;
|
|
753
753
|
else {
|
|
754
754
|
let j = [];
|
|
755
|
-
e.operationsLayout && (typeof e.operationsLayout == "string" ? j = e.operationsLayout.split(",") : typeof e.operationsLayout(o, u) == "string" ? j = e.operationsLayout(o, u).split(",") : j = ["add", "addItem", "edit", "delete"]), y != null && y.length && (j != null && j.length) && j.forEach((
|
|
756
|
-
const
|
|
757
|
-
|
|
755
|
+
e.operationsLayout && (typeof e.operationsLayout == "string" ? j = e.operationsLayout.split(",") : typeof e.operationsLayout(o, u) == "string" ? j = e.operationsLayout(o, u).split(",") : j = ["add", "addItem", "edit", "delete"]), y != null && y.length && (j != null && j.length) && j.forEach((Z) => {
|
|
756
|
+
const m = y.find((me) => me.value === Z);
|
|
757
|
+
m && l.push(m);
|
|
758
758
|
});
|
|
759
759
|
}
|
|
760
|
-
return o.level === Number(e.maxNodeLevel) && (l = l.filter((j) => j.icon !== "addItem" && j.name !==
|
|
761
|
-
},
|
|
760
|
+
return o.level === Number(e.maxNodeLevel) && (l = l.filter((j) => j.icon !== "addItem" && j.name !== $e("新增子级"))), l.length && (l = l.filter((j) => !j.hidden)), l;
|
|
761
|
+
}, he = (o, u, l) => {
|
|
762
762
|
o.disabled || (le(), k.value = "", setTimeout(() => t("handleOperation", o, u, l), 0));
|
|
763
|
-
}, He = (o, u) => o ? u[$.value.label].toLowerCase().includes(o.toLowerCase()) : !0,
|
|
763
|
+
}, He = (o, u) => o ? u[$.value.label].toLowerCase().includes(o.toLowerCase()) : !0, oe = Q(() => (e == null ? void 0 : e.filterNodeMethod) ?? He), se = Q({
|
|
764
764
|
get: () => e.filterValue,
|
|
765
765
|
set: (o) => {
|
|
766
766
|
t("update:filterValue", o);
|
|
767
767
|
}
|
|
768
768
|
}), we = () => {
|
|
769
|
-
const o =
|
|
769
|
+
const o = se.value;
|
|
770
770
|
if (!o) {
|
|
771
771
|
x.value = [];
|
|
772
772
|
return;
|
|
773
773
|
}
|
|
774
774
|
const u = $.value.children;
|
|
775
|
-
o && e.data ? x.value = qt(e.data, u).filter((l) =>
|
|
775
|
+
o && e.data ? x.value = qt(e.data, u).filter((l) => oe.value(o, l)) : e.data && (x.value = qt(e.data, u)), x.value.length || x.value.push({ [$.value.label]: $e("暂无数据"), id: "nodata" });
|
|
776
776
|
}, Fe = () => {
|
|
777
777
|
x.value = [];
|
|
778
778
|
}, We = (o, u) => {
|
|
@@ -781,20 +781,20 @@ const Ul = (e, t, r, a, c, f, s, g, b) => {
|
|
|
781
781
|
}, je = (o, u) => {
|
|
782
782
|
let l = !1;
|
|
783
783
|
return typeof $.value.disabled == "string" ? l = o[$.value.disabled] ?? !1 : typeof $.value.disabled == "function" && (l = $.value.disabled(o, u) ?? !1), l;
|
|
784
|
-
},
|
|
785
|
-
var
|
|
786
|
-
const l = o[u], y = (
|
|
784
|
+
}, ve = (o, u = "parentId") => {
|
|
785
|
+
var m;
|
|
786
|
+
const l = o[u], y = (m = r.value) == null ? void 0 : m.store.nodesMap, j = (y == null ? void 0 : y[l]) ?? null;
|
|
787
787
|
if (!j) return [null, null];
|
|
788
788
|
if (!je(j.data, j)) return [j.data, j];
|
|
789
|
-
const
|
|
790
|
-
if (
|
|
789
|
+
const Z = ve(j.data, u);
|
|
790
|
+
if (Z) return Z;
|
|
791
791
|
}, qe = (o, u) => {
|
|
792
792
|
let l = !1;
|
|
793
793
|
return typeof $.value.isLeaf == "string" ? l = o[$.value.isLeaf] ?? !1 : typeof $.value.isLeaf == "function" && (l = $.value.isLeaf(o, u) ?? !1), l;
|
|
794
794
|
}, Ne = (o) => {
|
|
795
795
|
let u = !1;
|
|
796
796
|
return typeof $.value.allowUnSelect == "string" ? u = o[$.value.allowUnSelect] ?? !1 : typeof $.value.allowUnSelect == "function" && (u = $.value.allowUnSelect(o) ?? !1), u;
|
|
797
|
-
},
|
|
797
|
+
}, de = (o) => e.draggable ? e.allowDrag ? e.allowDrag(o) : !0 : !1, _ = (o, u) => {
|
|
798
798
|
if (typeof e.filterItemClass == "string")
|
|
799
799
|
return e.filterItemClass;
|
|
800
800
|
if (typeof e.filterItemClass == "function")
|
|
@@ -805,8 +805,8 @@ const Ul = (e, t, r, a, c, f, s, g, b) => {
|
|
|
805
805
|
var y;
|
|
806
806
|
if ((y = h.value) == null || y.click(), je(o, u)) return;
|
|
807
807
|
let l = !0;
|
|
808
|
-
e.changeNodeConfirm && (l = await e.changeNodeConfirm(o)), l && (P++,
|
|
809
|
-
},
|
|
808
|
+
e.changeNodeConfirm && (l = await e.changeNodeConfirm(o)), l && (P++, ye(o, u));
|
|
809
|
+
}, ye = Bl((...o) => {
|
|
810
810
|
const [u, l] = o;
|
|
811
811
|
P > 1 ? J(u, l) : H(u, l), P = 0;
|
|
812
812
|
}, 500), J = (o, u) => {
|
|
@@ -814,32 +814,32 @@ const Ul = (e, t, r, a, c, f, s, g, b) => {
|
|
|
814
814
|
}, H = (o, u) => {
|
|
815
815
|
var l;
|
|
816
816
|
e.showCheckbox ? t("check-node-click", o, u) : (C.value = !0, c.value = o[e.nodeKey], (l = r.value) == null || l.setCurrentKey(c.value), o.path && (a.value = o.path), t("change", o[e.nodeKey], o), t("node-click", o, u), t("node-change", o));
|
|
817
|
-
},
|
|
817
|
+
}, _e = async (o, u) => {
|
|
818
818
|
await Le(), !(f.value && !e.showCheckbox && c.value && o[e.nodeKey] !== c.value) && t("current-change", o, u);
|
|
819
|
-
},
|
|
819
|
+
}, pe = (o, u = !1) => {
|
|
820
820
|
let l = !1;
|
|
821
821
|
return e != null && e.nodeKey && (e.showCheckbox ? u && (l = !!c.value.includes(o[e.nodeKey])) : l = c.value === o[e.nodeKey]), l;
|
|
822
|
-
}, ke = async (o
|
|
823
|
-
var l, y
|
|
822
|
+
}, ke = async (o) => {
|
|
823
|
+
var u, l, y;
|
|
824
824
|
if (!je(o, null)) {
|
|
825
825
|
if (!e.showCheckbox)
|
|
826
826
|
I(o);
|
|
827
827
|
else {
|
|
828
|
-
const
|
|
829
|
-
if (!
|
|
830
|
-
const
|
|
831
|
-
if (e != null && e.nodeKey && !
|
|
832
|
-
const
|
|
833
|
-
e.showCheckbox && ((
|
|
828
|
+
const j = (u = e.data) == null ? void 0 : u.find((Z) => Z[e.nodeKey] === o[e.nodeKey]);
|
|
829
|
+
if (!pe(o, !0) || !(e.hideRootCheckbox && j)) {
|
|
830
|
+
const Z = c.value || [];
|
|
831
|
+
if (e != null && e.nodeKey && !Z.includes(o[e.nodeKey])) {
|
|
832
|
+
const m = Z.concat(o[e.nodeKey]) || [];
|
|
833
|
+
e.showCheckbox && ((l = r.value) == null || l.setCheckedKeys(m)), p(o, { checkedKeys: [...m] }, !0);
|
|
834
834
|
}
|
|
835
835
|
}
|
|
836
|
-
(
|
|
836
|
+
(y = r.value) == null || y.setCurrentKey(o[e.nodeKey]);
|
|
837
837
|
}
|
|
838
|
-
x.value = [],
|
|
838
|
+
x.value = [], se.value = "", t("filter-node-click", o);
|
|
839
839
|
}
|
|
840
|
-
},
|
|
840
|
+
}, ee = (o, u) => {
|
|
841
841
|
let l = "", y = "";
|
|
842
|
-
return $.value.class && (typeof $.value.class == "string" ? y = $.value.class : y = $.value.class(o, u)), y && (l = `${l} ${y}`),
|
|
842
|
+
return $.value.class && (typeof $.value.class == "string" ? y = $.value.class : y = $.value.class(o, u)), y && (l = `${l} ${y}`), pe(o) && (l = `${l} is-active`), de(u) && (l = `${l} show-draggable-icon`), l;
|
|
843
843
|
}, X = async () => {
|
|
844
844
|
var o;
|
|
845
845
|
return await Le(), C.value ? C.value = !1 : (e.showCheckbox || (o = r.value) == null || o.setCurrentKey(c.value, !0), !0);
|
|
@@ -871,20 +871,20 @@ const Ul = (e, t, r, a, c, f, s, g, b) => {
|
|
|
871
871
|
dasTree: h,
|
|
872
872
|
treeRef: r,
|
|
873
873
|
oprationVisibleChange: ce,
|
|
874
|
-
getOperations:
|
|
875
|
-
handleOperation:
|
|
876
|
-
filterInnerValue:
|
|
874
|
+
getOperations: ne,
|
|
875
|
+
handleOperation: he,
|
|
876
|
+
filterInnerValue: se,
|
|
877
877
|
filterMethod: We,
|
|
878
878
|
filterList: x,
|
|
879
879
|
selectItem: ke,
|
|
880
|
-
nodeClass:
|
|
880
|
+
nodeClass: ee,
|
|
881
881
|
innerValue: c,
|
|
882
882
|
nodeClick: I,
|
|
883
883
|
defaultProps: $,
|
|
884
884
|
filterSeach: we,
|
|
885
|
-
filterNodeMethodFn:
|
|
885
|
+
filterNodeMethodFn: oe,
|
|
886
886
|
filterClear: Fe,
|
|
887
|
-
isActive:
|
|
887
|
+
isActive: pe,
|
|
888
888
|
expandParent: X,
|
|
889
889
|
disabledFlag: je,
|
|
890
890
|
currentOprationKey: k,
|
|
@@ -892,13 +892,13 @@ const Ul = (e, t, r, a, c, f, s, g, b) => {
|
|
|
892
892
|
setOprationsMoreBtnRefs: N,
|
|
893
893
|
oprationsPopoverRef: L,
|
|
894
894
|
currentMoreBtnRef: Ae,
|
|
895
|
-
moreBtnEnter:
|
|
896
|
-
currentOprationItem:
|
|
895
|
+
moreBtnEnter: fe,
|
|
896
|
+
currentOprationItem: ue,
|
|
897
897
|
isLeafFlag: qe,
|
|
898
|
-
filterCustomClass:
|
|
898
|
+
filterCustomClass: _,
|
|
899
899
|
allowUnSelectFlag: Ne,
|
|
900
|
-
findSelectableParentNode:
|
|
901
|
-
currentChange:
|
|
900
|
+
findSelectableParentNode: ve,
|
|
901
|
+
currentChange: _e
|
|
902
902
|
};
|
|
903
903
|
};
|
|
904
904
|
var Ct = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
|
|
@@ -1183,8 +1183,8 @@ function Yf(e, t, r, a) {
|
|
|
1183
1183
|
var c = !r;
|
|
1184
1184
|
r || (r = {});
|
|
1185
1185
|
for (var f = -1, s = t.length; ++f < s; ) {
|
|
1186
|
-
var
|
|
1187
|
-
b === void 0 && (b = e[
|
|
1186
|
+
var p = t[f], b = a ? a(r[p], e[p], p, r, e) : void 0;
|
|
1187
|
+
b === void 0 && (b = e[p]), c ? Jf(r, p, b) : qf(r, p, b);
|
|
1188
1188
|
}
|
|
1189
1189
|
return r;
|
|
1190
1190
|
}
|
|
@@ -1213,7 +1213,7 @@ function fd() {
|
|
|
1213
1213
|
var dd = fd;
|
|
1214
1214
|
St.exports;
|
|
1215
1215
|
(function(e, t) {
|
|
1216
|
-
var r = Se, a = dd, c = t && !t.nodeType && t, f = c && !0 && e && !e.nodeType && e, s = f && f.exports === c,
|
|
1216
|
+
var r = Se, a = dd, c = t && !t.nodeType && t, f = c && !0 && e && !e.nodeType && e, s = f && f.exports === c, p = s ? r.Buffer : void 0, b = p ? p.isBuffer : void 0, h = b || a;
|
|
1217
1217
|
e.exports = h;
|
|
1218
1218
|
})(St, St.exports);
|
|
1219
1219
|
var on = St.exports, hd = 9007199254740991, vd = /^(?:0|[1-9]\d*)$/;
|
|
@@ -1240,25 +1240,25 @@ function qd(e) {
|
|
|
1240
1240
|
var yr = qd, At = { exports: {} };
|
|
1241
1241
|
At.exports;
|
|
1242
1242
|
(function(e, t) {
|
|
1243
|
-
var r = Za, a = t && !t.nodeType && t, c = a && !0 && e && !e.nodeType && e, f = c && c.exports === a, s = f && r.process,
|
|
1243
|
+
var r = Za, a = t && !t.nodeType && t, c = a && !0 && e && !e.nodeType && e, f = c && c.exports === a, s = f && r.process, p = function() {
|
|
1244
1244
|
try {
|
|
1245
1245
|
var b = c && c.require && c.require("util").types;
|
|
1246
1246
|
return b || s && s.binding && s.binding("util");
|
|
1247
1247
|
} catch {
|
|
1248
1248
|
}
|
|
1249
1249
|
}();
|
|
1250
|
-
e.exports =
|
|
1250
|
+
e.exports = p;
|
|
1251
1251
|
})(At, At.exports);
|
|
1252
1252
|
var pr = At.exports, Jd = Wd, Yd = yr, ia = pr, la = ia && ia.isTypedArray, Xd = la ? Yd(la) : Jd, Zd = Xd, Qd = Zf, eh = cd, th = vr, rh = on, ah = pd, nh = Zd, oh = Object.prototype, sh = oh.hasOwnProperty;
|
|
1253
1253
|
function ih(e, t) {
|
|
1254
|
-
var r = th(e), a = !r && eh(e), c = !r && !a && rh(e), f = !r && !a && !c && nh(e), s = r || a || c || f,
|
|
1254
|
+
var r = th(e), a = !r && eh(e), c = !r && !a && rh(e), f = !r && !a && !c && nh(e), s = r || a || c || f, p = s ? Qd(e.length, String) : [], b = p.length;
|
|
1255
1255
|
for (var h in e)
|
|
1256
1256
|
(t || sh.call(e, h)) && !(s && // Safari 9 has enumerable `arguments.length` in strict mode.
|
|
1257
1257
|
(h == "length" || // Node.js 0.10 has enumerable non-index properties on buffers.
|
|
1258
1258
|
c && (h == "offset" || h == "parent") || // PhantomJS 2 has enumerable non-index properties on typed arrays.
|
|
1259
1259
|
f && (h == "buffer" || h == "byteLength" || h == "byteOffset") || // Skip index properties.
|
|
1260
|
-
ah(h, b))) &&
|
|
1261
|
-
return
|
|
1260
|
+
ah(h, b))) && p.push(h);
|
|
1261
|
+
return p;
|
|
1262
1262
|
}
|
|
1263
1263
|
var ln = ih, lh = Object.prototype;
|
|
1264
1264
|
function ch(e) {
|
|
@@ -1320,11 +1320,11 @@ function Hh(e, t) {
|
|
|
1320
1320
|
var Wh = Hh, kt = { exports: {} };
|
|
1321
1321
|
kt.exports;
|
|
1322
1322
|
(function(e, t) {
|
|
1323
|
-
var r = Se, a = t && !t.nodeType && t, c = a && !0 && e && !e.nodeType && e, f = c && c.exports === a, s = f ? r.Buffer : void 0,
|
|
1323
|
+
var r = Se, a = t && !t.nodeType && t, c = a && !0 && e && !e.nodeType && e, f = c && c.exports === a, s = f ? r.Buffer : void 0, p = s ? s.allocUnsafe : void 0;
|
|
1324
1324
|
function b(h, x) {
|
|
1325
1325
|
if (x)
|
|
1326
1326
|
return h.slice();
|
|
1327
|
-
var C = h.length, $ =
|
|
1327
|
+
var C = h.length, $ = p ? p(C) : new h.constructor(C);
|
|
1328
1328
|
return h.copy($), $;
|
|
1329
1329
|
}
|
|
1330
1330
|
e.exports = b;
|
|
@@ -1492,26 +1492,26 @@ var yp = vp, pp = yp, gp = yr, Ta = pr, Ca = Ta && Ta.isSet, bp = Ca ? gp(Ca) :
|
|
|
1492
1492
|
B[gn] = B[Vp] = B[ag] = B[ng] = B[Hp] = B[Wp] = B[og] = B[sg] = B[ig] = 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[hg] = !0;
|
|
1493
1493
|
B[qp] = B[bn] = B[rg] = !1;
|
|
1494
1494
|
function Ot(e, t, r, a, c, f) {
|
|
1495
|
-
var s,
|
|
1495
|
+
var s, p = t & zp, b = t & Gp, h = t & Rp;
|
|
1496
1496
|
if (r && (s = c ? r(e, a, c, f) : r(e)), s !== void 0)
|
|
1497
1497
|
return s;
|
|
1498
1498
|
if (!Mp(e))
|
|
1499
1499
|
return e;
|
|
1500
1500
|
var x = Kp(e);
|
|
1501
1501
|
if (x) {
|
|
1502
|
-
if (s = Pp(e), !
|
|
1502
|
+
if (s = Pp(e), !p)
|
|
1503
1503
|
return Op(e, s);
|
|
1504
1504
|
} else {
|
|
1505
1505
|
var C = xp(e), $ = C == bn || C == Jp;
|
|
1506
1506
|
if (Np(e))
|
|
1507
|
-
return jp(e,
|
|
1507
|
+
return jp(e, p);
|
|
1508
1508
|
if (C == $n || C == gn || $ && !c) {
|
|
1509
|
-
if (s = b || $ ? {} : Lp(e), !
|
|
1509
|
+
if (s = b || $ ? {} : Lp(e), !p)
|
|
1510
1510
|
return b ? Ap(e, wp(s, e)) : Sp(e, Cp(s, e));
|
|
1511
1511
|
} else {
|
|
1512
1512
|
if (!B[C])
|
|
1513
1513
|
return c ? e : {};
|
|
1514
|
-
s = Ep(e, C,
|
|
1514
|
+
s = Ep(e, C, p);
|
|
1515
1515
|
}
|
|
1516
1516
|
}
|
|
1517
1517
|
f || (f = new _p());
|
|
@@ -1523,7 +1523,7 @@ function Ot(e, t, r, a, c, f) {
|
|
|
1523
1523
|
}) : Dp(e) && e.forEach(function(N, L) {
|
|
1524
1524
|
s.set(L, Ot(N, t, r, L, e, f));
|
|
1525
1525
|
});
|
|
1526
|
-
var
|
|
1526
|
+
var ae = h ? b ? Ip : kp : b ? Up : Bp, O = x ? void 0 : ae(e);
|
|
1527
1527
|
return mp(O || e, function(N, L) {
|
|
1528
1528
|
O && (L = N, N = e[L]), Tp(s, L, Ot(N, t, r, L, e, f));
|
|
1529
1529
|
}), s;
|
|
@@ -1533,12 +1533,12 @@ function bg(e) {
|
|
|
1533
1533
|
return yg(e, pg | gg);
|
|
1534
1534
|
}
|
|
1535
1535
|
var $g = bg;
|
|
1536
|
-
const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s,
|
|
1537
|
-
const
|
|
1536
|
+
const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, p, b, h, x, C, $, q, ae, O, N, L, Ae) => {
|
|
1537
|
+
const ue = G([]), fe = G(!1), le = G(null), k = G(null);
|
|
1538
1538
|
yt(
|
|
1539
|
-
() =>
|
|
1540
|
-
(
|
|
1541
|
-
if (!
|
|
1539
|
+
() => fe.value,
|
|
1540
|
+
(_) => {
|
|
1541
|
+
if (!_) {
|
|
1542
1542
|
k.value && k.value.close();
|
|
1543
1543
|
return;
|
|
1544
1544
|
}
|
|
@@ -1547,69 +1547,69 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
1547
1547
|
});
|
|
1548
1548
|
}
|
|
1549
1549
|
);
|
|
1550
|
-
const ce = async (
|
|
1550
|
+
const ce = async (_, P) => {
|
|
1551
1551
|
if (e.load)
|
|
1552
|
-
return await e.load(
|
|
1552
|
+
return await e.load(_, P);
|
|
1553
1553
|
}, Y = async () => {
|
|
1554
1554
|
if (e.search)
|
|
1555
1555
|
return await e.search(f.value);
|
|
1556
|
-
},
|
|
1557
|
-
var
|
|
1558
|
-
await Le(), !le.value && a.value && (
|
|
1556
|
+
}, ne = G([]), he = G([]), He = G([]), oe = G(!1), se = async (_, P, I = !1) => {
|
|
1557
|
+
var pe, ke;
|
|
1558
|
+
await Le(), !le.value && a.value && (oe.value = !0, le.value = Ar.service({
|
|
1559
1559
|
target: a.value
|
|
1560
1560
|
}));
|
|
1561
|
-
let
|
|
1562
|
-
q(
|
|
1563
|
-
let { data: J } =
|
|
1561
|
+
let ye = {};
|
|
1562
|
+
q(_.data, _) ? ye = { data: [] } : ye = await ce(_.data, _.level), le.value && (le.value.close(), oe.value = !1);
|
|
1563
|
+
let { data: J } = ye;
|
|
1564
1564
|
J || (J = []);
|
|
1565
1565
|
let H = [];
|
|
1566
|
-
const
|
|
1567
|
-
if (
|
|
1568
|
-
const
|
|
1566
|
+
const _e = ((pe = _ == null ? void 0 : _.childNodes) == null ? void 0 : pe.map((ee) => ee.data)) || [];
|
|
1567
|
+
if (_e && J && _e.length && J.length && _e.length === J.length) {
|
|
1568
|
+
const ee = Object.keys(J[0]), X = _e.map((l) => {
|
|
1569
1569
|
let y = {};
|
|
1570
|
-
return
|
|
1570
|
+
return ee.forEach((j) => y[j] = l[j]), y;
|
|
1571
1571
|
}), o = J.map((l) => {
|
|
1572
1572
|
let y = {};
|
|
1573
|
-
return
|
|
1573
|
+
return ee.forEach((j) => y[j] = l[j]), y;
|
|
1574
1574
|
});
|
|
1575
1575
|
if (JSON.stringify(X) === JSON.stringify(o))
|
|
1576
|
-
return
|
|
1576
|
+
return _.loaded = !0, _.loading = !1, [];
|
|
1577
1577
|
}
|
|
1578
|
-
if (
|
|
1579
|
-
if (
|
|
1580
|
-
for (const
|
|
1581
|
-
const X = await L(
|
|
1578
|
+
if (_.level === 0) {
|
|
1579
|
+
if (ne.value = J, e.parentLinkChildrenStrictly)
|
|
1580
|
+
for (const ee of ne.value) {
|
|
1581
|
+
const X = await L(ee);
|
|
1582
1582
|
H = [...H, ...X];
|
|
1583
1583
|
}
|
|
1584
1584
|
if (e.defaultExpandRoot) {
|
|
1585
|
-
const
|
|
1586
|
-
N.value = ht(
|
|
1585
|
+
const ee = (ke = ne.value) == null ? void 0 : ke.map((X) => X[e.nodeKey]);
|
|
1586
|
+
N.value = ht(ee);
|
|
1587
1587
|
}
|
|
1588
|
-
I || (
|
|
1588
|
+
I || (he.value.push(_), He.value.push(P));
|
|
1589
1589
|
}
|
|
1590
|
-
return
|
|
1590
|
+
return ae.value = Oa([...ae.value, ...J, ...H], e.nodeKey), P && P(J), J;
|
|
1591
1591
|
}, we = async () => {
|
|
1592
1592
|
var I;
|
|
1593
1593
|
if (!(f.value ? (I = f.value) == null ? void 0 : I.trim() : "")) {
|
|
1594
|
-
|
|
1594
|
+
ue.value = [];
|
|
1595
1595
|
return;
|
|
1596
1596
|
}
|
|
1597
1597
|
const P = await Y();
|
|
1598
|
-
P.length === 0 && P.push({ [
|
|
1598
|
+
P.length === 0 && P.push({ [p.value.label]: $e("暂无数据"), id: "nodata" }), ue.value = P;
|
|
1599
1599
|
}, Fe = () => {
|
|
1600
|
-
|
|
1601
|
-
}, We = async (
|
|
1602
|
-
var
|
|
1603
|
-
let I =
|
|
1604
|
-
if (
|
|
1605
|
-
const
|
|
1606
|
-
|
|
1607
|
-
const J = (
|
|
1600
|
+
ue.value = [];
|
|
1601
|
+
}, We = async (_, P = !1) => {
|
|
1602
|
+
var _e, pe, ke, ee, X, o, u;
|
|
1603
|
+
let I = _ ?? {};
|
|
1604
|
+
if (ue.value = [], f.value = "", fe.value || P && C(I, null) || (I.path || (I.path = I[e.nodeKey] ?? ""), !I.path)) return;
|
|
1605
|
+
const ye = I.path.split(/[\/,]/);
|
|
1606
|
+
ye[0] !== e.rootNodeId && ye.unshift(e.rootNodeId + "");
|
|
1607
|
+
const J = (_e = r.value) == null ? void 0 : _e.store.nodesMap;
|
|
1608
1608
|
if (I[e.nodeKey] ? J[I[e.nodeKey]] : null) {
|
|
1609
1609
|
if (!e.showCheckbox)
|
|
1610
1610
|
h(I);
|
|
1611
1611
|
else if (P) {
|
|
1612
|
-
const l = (X =
|
|
1612
|
+
const l = (X = ne.value) == null ? void 0 : X.find((y) => y[e.nodeKey] === I[e.nodeKey]);
|
|
1613
1613
|
if (!(e.hideRootCheckbox && l)) {
|
|
1614
1614
|
const y = s.value.includes(I.id) ? ht(s.value) : ht([...s.value, I.id]);
|
|
1615
1615
|
(o = r.value) == null || o.setCheckedKeys(y), O(I, { checkedKeys: [...y] }, P);
|
|
@@ -1619,75 +1619,75 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
1619
1619
|
t("filter-node-click", I);
|
|
1620
1620
|
} else {
|
|
1621
1621
|
let l = "", y = {};
|
|
1622
|
-
|
|
1623
|
-
for (const j of
|
|
1622
|
+
fe.value = !0;
|
|
1623
|
+
for (const j of ye) {
|
|
1624
1624
|
await Le();
|
|
1625
|
-
const
|
|
1626
|
-
if (!
|
|
1627
|
-
if (
|
|
1625
|
+
const Z = (pe = r.value) == null ? void 0 : pe.store.nodesMap, m = Z == null ? void 0 : Z[j];
|
|
1626
|
+
if (!m) continue;
|
|
1627
|
+
if (m.loaded) {
|
|
1628
1628
|
l = j;
|
|
1629
1629
|
continue;
|
|
1630
1630
|
}
|
|
1631
|
-
|
|
1632
|
-
const
|
|
1633
|
-
|
|
1631
|
+
m.loading = !0, m.childNodes = [], m.shouldLoadData();
|
|
1632
|
+
const me = await se(m);
|
|
1633
|
+
me && me.length && m.doCreateChildren(me), m.loaded = !0, m.loading = !1, m.expand(), await Le(), l = j, y = m.data;
|
|
1634
1634
|
}
|
|
1635
1635
|
if (P && y) {
|
|
1636
1636
|
if (!e.showCheckbox)
|
|
1637
1637
|
h(y);
|
|
1638
1638
|
else {
|
|
1639
1639
|
const j = s.value.includes(l) ? ht(s.value) : ht([...s.value, l]);
|
|
1640
|
-
(ke = r.value) == null || ke.setCheckedKeys(j), O(y, { checkedKeys: [...j] }, P), y[e.nodeKey] && ((
|
|
1640
|
+
(ke = r.value) == null || ke.setCheckedKeys(j), O(y, { checkedKeys: [...j] }, P), y[e.nodeKey] && ((ee = r.value) == null || ee.setCurrentKey(y[e.nodeKey]));
|
|
1641
1641
|
}
|
|
1642
1642
|
t("filter-node-click", y);
|
|
1643
1643
|
}
|
|
1644
1644
|
}
|
|
1645
|
-
return
|
|
1645
|
+
return fe.value = !1, !0;
|
|
1646
1646
|
}, je = async () => {
|
|
1647
|
-
let
|
|
1648
|
-
if (e.showCheckbox ? b.value && b.value.length && (
|
|
1649
|
-
|
|
1650
|
-
for (const P of
|
|
1647
|
+
let _ = e.defaultExpandedPaths || [];
|
|
1648
|
+
if (e.showCheckbox ? b.value && b.value.length && (_ = [..._, ...b.value]) : b.value && (_ = _ == null ? void 0 : _.concat(b.value)), _.length) {
|
|
1649
|
+
_ = Array.from(new Set(_));
|
|
1650
|
+
for (const P of _)
|
|
1651
1651
|
await We({ path: P });
|
|
1652
1652
|
}
|
|
1653
1653
|
return !0;
|
|
1654
|
-
},
|
|
1654
|
+
}, ve = () => new Promise((_) => {
|
|
1655
1655
|
const P = () => {
|
|
1656
|
-
if (
|
|
1656
|
+
if (ne.value && ne.value.length) return _(!0);
|
|
1657
1657
|
setTimeout(() => P(), 50);
|
|
1658
1658
|
};
|
|
1659
1659
|
P();
|
|
1660
1660
|
}), qe = async () => {
|
|
1661
|
-
await
|
|
1662
|
-
const
|
|
1663
|
-
Ae.value = !
|
|
1661
|
+
await ve();
|
|
1662
|
+
const _ = ne.value.find((P) => !q(P));
|
|
1663
|
+
Ae.value = !_;
|
|
1664
1664
|
}, Ne = async () => {
|
|
1665
1665
|
await x(), await je(), e.showOperations || await qe();
|
|
1666
|
-
},
|
|
1667
|
-
var
|
|
1668
|
-
if ((P = (
|
|
1669
|
-
for (let I = 0; I <
|
|
1670
|
-
|
|
1666
|
+
}, de = async () => {
|
|
1667
|
+
var _, P;
|
|
1668
|
+
if ((P = (_ = r.value) == null ? void 0 : _.store) != null && P.nodesMap && (r.value.store.nodesMap = {}), he.value.length) {
|
|
1669
|
+
for (let I = 0; I < he.value.length; I++)
|
|
1670
|
+
he.value[I].childNodes = [], await se(he.value[I], He.value[I], !0);
|
|
1671
1671
|
return await Ne(), !0;
|
|
1672
1672
|
}
|
|
1673
1673
|
};
|
|
1674
1674
|
return yt(
|
|
1675
1675
|
() => e.renderDom,
|
|
1676
|
-
(
|
|
1677
|
-
|
|
1676
|
+
(_) => {
|
|
1677
|
+
_ && de();
|
|
1678
1678
|
}
|
|
1679
1679
|
), wa(async () => {
|
|
1680
1680
|
c.value && await Ne();
|
|
1681
1681
|
}), {
|
|
1682
|
-
rootLevelData:
|
|
1683
|
-
searchData:
|
|
1684
|
-
firstLoading:
|
|
1685
|
-
lazyLoad:
|
|
1682
|
+
rootLevelData: ne,
|
|
1683
|
+
searchData: ue,
|
|
1684
|
+
firstLoading: oe,
|
|
1685
|
+
lazyLoad: se,
|
|
1686
1686
|
search: Y,
|
|
1687
1687
|
handleSearch: we,
|
|
1688
1688
|
handleSearchClear: Fe,
|
|
1689
1689
|
handleSearchResultItemClick: We,
|
|
1690
|
-
resetLazyLoad:
|
|
1690
|
+
resetLazyLoad: de
|
|
1691
1691
|
};
|
|
1692
1692
|
}, mg = (e, t, r) => {
|
|
1693
1693
|
let a = 0, c = "";
|
|
@@ -1698,12 +1698,12 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
1698
1698
|
!h && c === b && a === C || (a = C, c = b, x && x.length && x.forEach((q) => {
|
|
1699
1699
|
q.classList.remove(c === "visible" ? "overflow-hide" : "overflow-visible"), q.classList.add(c === "visible" ? "overflow-visible" : "overflow-hide");
|
|
1700
1700
|
}));
|
|
1701
|
-
}, s = new AbortController(), { signal:
|
|
1701
|
+
}, s = new AbortController(), { signal: p } = s;
|
|
1702
1702
|
return wa(() => {
|
|
1703
1703
|
var h;
|
|
1704
1704
|
if (!r.isEllipsis) return;
|
|
1705
1705
|
const b = (h = e.value) == null ? void 0 : h.querySelector(".das-tree-container");
|
|
1706
|
-
b && b.addEventListener("mousemove", () => f("visible"), { signal:
|
|
1706
|
+
b && b.addEventListener("mousemove", () => f("visible"), { signal: p });
|
|
1707
1707
|
}), En(() => {
|
|
1708
1708
|
r.isEllipsis && s.abort();
|
|
1709
1709
|
}), { setTreeNodeChildrenOverflow: f };
|
|
@@ -1814,39 +1814,39 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
1814
1814
|
preview: import("@das-fed/ui/packages/icons/preview"),
|
|
1815
1815
|
view: import("@das-fed/ui/packages/icons/view")
|
|
1816
1816
|
});
|
|
1817
|
-
const f = Ln(), s = G(),
|
|
1817
|
+
const f = Ln(), s = G(), p = Q(() => a.emptyText || $e("暂无数据")), b = Q(() => a.searchEmptyText || $e("noDataTryAnotherKeyword")), h = Q(() => f.lazy ?? !!x.value), x = Q(() => a.load ?? void 0), C = G([]), $ = Q(() => a.search ?? void 0), q = Q(() => a.showCheckbox ? O.value : []), ae = Q(() => a.showCheckbox ? a.currentNodeKey : O.value), O = Q({
|
|
1818
1818
|
get() {
|
|
1819
1819
|
return a.showCheckbox && !a.modelValue ? [] : a.modelValue;
|
|
1820
1820
|
},
|
|
1821
1821
|
set(n) {
|
|
1822
1822
|
c("update:modelValue", n);
|
|
1823
1823
|
}
|
|
1824
|
-
}), N =
|
|
1824
|
+
}), N = Q({
|
|
1825
1825
|
get: () => a.path,
|
|
1826
1826
|
set: (n) => {
|
|
1827
1827
|
c("update:path", n);
|
|
1828
1828
|
}
|
|
1829
|
-
}), L = G([]), Ae =
|
|
1829
|
+
}), L = G([]), Ae = Q(() => {
|
|
1830
1830
|
let n = [...L.value, ...a.defaultExpandedKeys];
|
|
1831
1831
|
return Array.from(new Set(n));
|
|
1832
|
-
}),
|
|
1832
|
+
}), ue = () => new Promise((n) => {
|
|
1833
1833
|
const d = () => {
|
|
1834
|
-
var A, v,
|
|
1835
|
-
if ((v = (A = s.value) == null ? void 0 : A.store) != null && v.nodesMap && ((K = Object.keys((
|
|
1834
|
+
var A, v, g, K;
|
|
1835
|
+
if ((v = (A = s.value) == null ? void 0 : A.store) != null && v.nodesMap && ((K = Object.keys((g = s.value) == null ? void 0 : g.store.nodesMap)) == null ? void 0 : K.length) > 0)
|
|
1836
1836
|
return n(!0);
|
|
1837
1837
|
setTimeout(() => d(), 50);
|
|
1838
1838
|
};
|
|
1839
1839
|
d();
|
|
1840
|
-
}),
|
|
1840
|
+
}), fe = (n) => new Promise((d) => {
|
|
1841
1841
|
let A = 0;
|
|
1842
1842
|
const v = () => {
|
|
1843
1843
|
if (!(!C.value || !C.value.length)) {
|
|
1844
1844
|
if (Array.isArray(n)) {
|
|
1845
|
-
const
|
|
1846
|
-
if (
|
|
1845
|
+
const g = C.value.filter((K) => n.includes(K[a.nodeKey]));
|
|
1846
|
+
if (g.length === n.length) return d(g);
|
|
1847
1847
|
} else {
|
|
1848
|
-
const
|
|
1849
|
-
if (
|
|
1848
|
+
const g = C.value.find((K) => K[a.nodeKey] === n);
|
|
1849
|
+
if (g) return d(g);
|
|
1850
1850
|
}
|
|
1851
1851
|
if (setTimeout(() => {
|
|
1852
1852
|
v(), A += 50;
|
|
@@ -1859,8 +1859,8 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
1859
1859
|
var v;
|
|
1860
1860
|
let A = n.childNodes.length;
|
|
1861
1861
|
if (A > 0)
|
|
1862
|
-
for (let
|
|
1863
|
-
const K = d, W = n.childNodes[
|
|
1862
|
+
for (let g = 0; g < A; g++) {
|
|
1863
|
+
const K = d, W = n.childNodes[g];
|
|
1864
1864
|
if (X(W.data, W)) {
|
|
1865
1865
|
k({ ...W, checked: K }, d);
|
|
1866
1866
|
continue;
|
|
@@ -1869,88 +1869,88 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
1869
1869
|
}
|
|
1870
1870
|
s.value && (O.value = (v = s.value) == null ? void 0 : v.getCheckedKeys());
|
|
1871
1871
|
}, ce = async (n, d) => {
|
|
1872
|
-
var K, W,
|
|
1873
|
-
if (
|
|
1872
|
+
var K, W, te;
|
|
1873
|
+
if (me(n, null)) {
|
|
1874
1874
|
if (d)
|
|
1875
1875
|
O.value.includes(n[a.nodeKey]) || O.value.push(n[a.nodeKey]);
|
|
1876
1876
|
else {
|
|
1877
|
-
const
|
|
1878
|
-
|
|
1877
|
+
const re = O.value.findIndex((R) => R === n[a.nodeKey]);
|
|
1878
|
+
re > -1 && O.value.splice(re, 1);
|
|
1879
1879
|
}
|
|
1880
|
-
return (K = s.value) == null || K.setCheckedKeys(O.value),
|
|
1880
|
+
return (K = s.value) == null || K.setCheckedKeys(O.value), se.value = !0, [];
|
|
1881
1881
|
}
|
|
1882
1882
|
let A = await le(n);
|
|
1883
1883
|
C.value = Oa([...C.value, ...A], a.nodeKey);
|
|
1884
|
-
const v = A.concat(n),
|
|
1884
|
+
const v = A.concat(n), g = Array.from(new Set(v.map((re) => re[a.nodeKey])));
|
|
1885
1885
|
if (d) {
|
|
1886
|
-
const
|
|
1886
|
+
const re = O.value ?? [], R = Be([...re, ...g]);
|
|
1887
1887
|
O.value = Array.from(new Set(R)), (W = s.value) == null || W.setCheckedKeys(R);
|
|
1888
1888
|
} else {
|
|
1889
|
-
const R = (O.value ?? []).filter((V) => !
|
|
1890
|
-
O.value = Array.from(new Set(R)), (
|
|
1889
|
+
const R = (O.value ?? []).filter((V) => !g.includes(V));
|
|
1890
|
+
O.value = Array.from(new Set(R)), (te = s.value) == null || te.setCheckedKeys(R);
|
|
1891
1891
|
}
|
|
1892
1892
|
return A;
|
|
1893
|
-
}, Y = G([]),
|
|
1893
|
+
}, Y = G([]), ne = async (n, d) => {
|
|
1894
1894
|
var v;
|
|
1895
1895
|
if (h.value) {
|
|
1896
|
-
const
|
|
1897
|
-
return c("check-node-change", O.value, n, d), Y.value =
|
|
1896
|
+
const g = await ce(n, d);
|
|
1897
|
+
return c("check-node-change", O.value, n, d), Y.value = g.map((K) => K[a.nodeKey]), g;
|
|
1898
1898
|
}
|
|
1899
1899
|
await Le();
|
|
1900
1900
|
const A = (v = s.value) == null ? void 0 : v.getNode(n[a.nodeKey]);
|
|
1901
1901
|
return k(A, d), [];
|
|
1902
|
-
},
|
|
1902
|
+
}, he = (n, d) => {
|
|
1903
1903
|
const A = n == null ? void 0 : n.parent;
|
|
1904
1904
|
if (!A) return;
|
|
1905
1905
|
const v = d;
|
|
1906
1906
|
if (X(A.data, A)) {
|
|
1907
|
-
|
|
1907
|
+
he({ ...A, checked: v }, d);
|
|
1908
1908
|
return;
|
|
1909
1909
|
}
|
|
1910
|
-
A.checked !== v && (A.checked = v),
|
|
1910
|
+
A.checked !== v && (A.checked = v), he(A, d);
|
|
1911
1911
|
}, He = async (n, d) => {
|
|
1912
|
-
var v,
|
|
1912
|
+
var v, g;
|
|
1913
1913
|
await Le();
|
|
1914
1914
|
const A = (v = s.value) == null ? void 0 : v.getNode(n[a.nodeKey]);
|
|
1915
|
-
return
|
|
1916
|
-
},
|
|
1915
|
+
return he(A, d), s.value && (O.value = (g = s.value) == null ? void 0 : g.getCheckedKeys()), !0;
|
|
1916
|
+
}, oe = G(!1), se = G(!1), we = async (n, d, A = !1) => {
|
|
1917
1917
|
var R, V;
|
|
1918
|
-
|
|
1919
|
-
const { checkedKeys: v } = d,
|
|
1918
|
+
se.value = !0;
|
|
1919
|
+
const { checkedKeys: v } = d, g = v.includes(n[a.nodeKey]), K = O.value.includes(n[a.nodeKey]), W = a.keepSelected && !_n(n) && K && !g;
|
|
1920
1920
|
await Le();
|
|
1921
|
-
let
|
|
1922
|
-
if (W && (
|
|
1921
|
+
let te = ((R = s.value) == null ? void 0 : R.getCheckedKeys()) || [];
|
|
1922
|
+
if (W && (te = Be([...te, n[a.nodeKey]]), a.showCheckbox && ((V = s.value) == null || V.setCheckedKeys(te))), a.parentLinkChildrenStrictly || (O.value = te), g && a.childLinkParentStrictly && !oe.value) {
|
|
1923
1923
|
const D = O.value ?? [];
|
|
1924
|
-
await He(n,
|
|
1924
|
+
await He(n, g), O.value = Array.from(/* @__PURE__ */ new Set([...D, ...O.value]));
|
|
1925
1925
|
}
|
|
1926
|
-
let
|
|
1927
|
-
a.parentLinkChildrenStrictly && !
|
|
1926
|
+
let re = [];
|
|
1927
|
+
a.parentLinkChildrenStrictly && !oe.value && (re = await ne(n, g)), a.parentLinkChildrenStrictly && h.value || (await Le(), c("check-node-change", O.value, n, g)), A && c("change", O.value, n, g, re);
|
|
1928
1928
|
}, Fe = G(!1), {
|
|
1929
1929
|
realHeight: We,
|
|
1930
1930
|
dasTree: je,
|
|
1931
|
-
getMergeOperations:
|
|
1931
|
+
getMergeOperations: ve,
|
|
1932
1932
|
getOperations: qe,
|
|
1933
1933
|
handleOperation: Ne,
|
|
1934
|
-
filterInnerValue:
|
|
1935
|
-
filterList:
|
|
1934
|
+
filterInnerValue: de,
|
|
1935
|
+
filterList: _,
|
|
1936
1936
|
selectItem: P,
|
|
1937
1937
|
nodeClass: I,
|
|
1938
|
-
nodeClick:
|
|
1938
|
+
nodeClick: ye,
|
|
1939
1939
|
isActive: J,
|
|
1940
1940
|
defaultProps: H,
|
|
1941
|
-
filterNodeMethodFn:
|
|
1942
|
-
filterSeach:
|
|
1941
|
+
filterNodeMethodFn: _e,
|
|
1942
|
+
filterSeach: pe,
|
|
1943
1943
|
filterClear: ke,
|
|
1944
|
-
expandParent:
|
|
1944
|
+
expandParent: ee,
|
|
1945
1945
|
disabledFlag: X,
|
|
1946
1946
|
currentOprationKey: o,
|
|
1947
1947
|
oprationVisibleChange: u,
|
|
1948
1948
|
setOprationsMoreBtnRefs: l,
|
|
1949
1949
|
oprationsPopoverRef: y,
|
|
1950
1950
|
moreBtnEnter: j,
|
|
1951
|
-
currentMoreBtnRef:
|
|
1952
|
-
currentOprationItem:
|
|
1953
|
-
isLeafFlag:
|
|
1951
|
+
currentMoreBtnRef: Z,
|
|
1952
|
+
currentOprationItem: m,
|
|
1953
|
+
isLeafFlag: me,
|
|
1954
1954
|
filterCustomClass: _t,
|
|
1955
1955
|
allowUnSelectFlag: _n,
|
|
1956
1956
|
findSelectableParentNode: mn,
|
|
@@ -1970,25 +1970,25 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
1970
1970
|
s,
|
|
1971
1971
|
je,
|
|
1972
1972
|
h,
|
|
1973
|
-
|
|
1973
|
+
de,
|
|
1974
1974
|
O,
|
|
1975
1975
|
H,
|
|
1976
1976
|
N,
|
|
1977
|
-
|
|
1978
|
-
|
|
1977
|
+
ye,
|
|
1978
|
+
ue,
|
|
1979
1979
|
X,
|
|
1980
1980
|
J,
|
|
1981
|
-
|
|
1981
|
+
me,
|
|
1982
1982
|
C,
|
|
1983
1983
|
we,
|
|
1984
1984
|
L,
|
|
1985
1985
|
le,
|
|
1986
1986
|
Fe
|
|
1987
1987
|
), An = () => {
|
|
1988
|
-
$.value ? Cr() :
|
|
1988
|
+
$.value ? Cr() : pe();
|
|
1989
1989
|
};
|
|
1990
1990
|
yt(
|
|
1991
|
-
() =>
|
|
1991
|
+
() => de.value,
|
|
1992
1992
|
(n) => {
|
|
1993
1993
|
c("filter-value-change", n), An();
|
|
1994
1994
|
}
|
|
@@ -1997,38 +1997,38 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
1997
1997
|
yt(
|
|
1998
1998
|
() => O.value,
|
|
1999
1999
|
(n) => {
|
|
2000
|
-
var v,
|
|
2000
|
+
var v, g, K, W, te, re;
|
|
2001
2001
|
const d = a.showCheckbox ? n ?? [] : n ?? void 0, A = a.showCheckbox ? Je.value ?? [] : Je.value ?? void 0;
|
|
2002
2002
|
if (JSON.stringify(d) !== JSON.stringify(A)) {
|
|
2003
2003
|
if (a.showCheckbox) {
|
|
2004
2004
|
if (d.length === 0) {
|
|
2005
|
-
(
|
|
2005
|
+
(g = s.value) == null || g.setCheckedKeys([]), Je.value = Be(d);
|
|
2006
2006
|
return;
|
|
2007
2007
|
}
|
|
2008
2008
|
} else if (!d) {
|
|
2009
2009
|
(v = s.value) == null || v.setCurrentKey(), Je.value = Be(d);
|
|
2010
2010
|
return;
|
|
2011
2011
|
}
|
|
2012
|
-
if (
|
|
2013
|
-
|
|
2012
|
+
if (se.value) {
|
|
2013
|
+
se.value = !1, Je.value = Be(d);
|
|
2014
2014
|
return;
|
|
2015
2015
|
}
|
|
2016
2016
|
if (!h.value)
|
|
2017
|
-
a.showCheckbox ? (K = s.value) == null || K.setCheckedKeys(d) :
|
|
2017
|
+
a.showCheckbox ? (K = s.value) == null || K.setCheckedKeys(d) : ee();
|
|
2018
2018
|
else if (a.showCheckbox)
|
|
2019
2019
|
if (!a.parentLinkChildrenStrictly || !a.dataLinkView) {
|
|
2020
2020
|
const R = C.value.map((D) => D[a.nodeKey]), V = d.filter((D) => !R.includes(D));
|
|
2021
2021
|
V && V.length ? Ft().then(() => {
|
|
2022
2022
|
var D;
|
|
2023
2023
|
s.value && ((D = s.value) == null || D.setCheckedKeys(d));
|
|
2024
|
-
}) : s.value && ((
|
|
2024
|
+
}) : s.value && ((te = s.value) == null || te.setCheckedKeys(d));
|
|
2025
2025
|
} else {
|
|
2026
|
-
if (s.value && ((
|
|
2026
|
+
if (s.value && ((re = s.value) == null || re.setCheckedKeys([])), d.length && A.length === 0)
|
|
2027
2027
|
for (let R of d) {
|
|
2028
2028
|
const V = Y.value.findIndex((D) => D === R);
|
|
2029
|
-
V !== -1 && Y.value.splice(V, 1),
|
|
2030
|
-
D && (
|
|
2031
|
-
|
|
2029
|
+
V !== -1 && Y.value.splice(V, 1), fe(R).then((D) => {
|
|
2030
|
+
D && (oe.value = !0, we(D, { checkedKeys: [...d] }).then(() => {
|
|
2031
|
+
se.value = !1, oe.value = !1;
|
|
2032
2032
|
}));
|
|
2033
2033
|
});
|
|
2034
2034
|
}
|
|
@@ -2037,18 +2037,18 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2037
2037
|
if (R && R.length)
|
|
2038
2038
|
for (let D of R) {
|
|
2039
2039
|
const T = Y.value.findIndex((ie) => ie === D);
|
|
2040
|
-
T !== -1 && Y.value.splice(T, 1),
|
|
2041
|
-
ie && (
|
|
2042
|
-
|
|
2040
|
+
T !== -1 && Y.value.splice(T, 1), fe(D).then(async (ie) => {
|
|
2041
|
+
ie && (oe.value = !0, we(ie, { checkedKeys: [...d] }).then(() => {
|
|
2042
|
+
se.value = !1, oe.value = !1;
|
|
2043
2043
|
}));
|
|
2044
2044
|
});
|
|
2045
2045
|
}
|
|
2046
2046
|
if (V && V.length)
|
|
2047
2047
|
for (let D of V) {
|
|
2048
2048
|
const T = Y.value.findIndex((ie) => ie === D);
|
|
2049
|
-
T !== -1 && Y.value.splice(T, 1),
|
|
2050
|
-
ie && (
|
|
2051
|
-
|
|
2049
|
+
T !== -1 && Y.value.splice(T, 1), fe(D).then((ie) => {
|
|
2050
|
+
ie && (oe.value = !0, we(ie, { checkedKeys: [...d] }).then(() => {
|
|
2051
|
+
se.value = !1, oe.value = !1;
|
|
2052
2052
|
}));
|
|
2053
2053
|
});
|
|
2054
2054
|
}
|
|
@@ -2070,14 +2070,14 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2070
2070
|
);
|
|
2071
2071
|
const Bt = () => {
|
|
2072
2072
|
$.value ? On() : ke();
|
|
2073
|
-
}, kn =
|
|
2073
|
+
}, kn = Q(() => a.parentLinkChildrenStrictly || a.childLinkParentStrictly ? !0 : !!(a.checkStrictly ?? h.value)), In = Q(() => h.value ? !!jn.value : a.loading), Ut = Q(() => {
|
|
2074
2074
|
var n, d;
|
|
2075
2075
|
return h.value ? !((n = Cn.value) != null && n.length) : !((d = a.data) != null && d.length);
|
|
2076
|
-
}), wr =
|
|
2076
|
+
}), wr = Q(() => {
|
|
2077
2077
|
if ($.value)
|
|
2078
|
-
return mt.value.length === 1 && mt.value[0][H.value.label] ===
|
|
2078
|
+
return mt.value.length === 1 && mt.value[0][H.value.label] === $e("暂无数据");
|
|
2079
2079
|
if (a.isFilter)
|
|
2080
|
-
return
|
|
2080
|
+
return _.value.length === 1 && _.value[0][H.value.label] === $e("暂无数据");
|
|
2081
2081
|
}), { setTreeNodeChildrenOverflow: xn } = mg(je, s, a), Pn = () => {
|
|
2082
2082
|
a.isEllipsis && xn("hidden");
|
|
2083
2083
|
};
|
|
@@ -2089,21 +2089,21 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2089
2089
|
/** 获取可选的父级节点,递归往上查找 */
|
|
2090
2090
|
findSelectableParentNode: mn,
|
|
2091
2091
|
/** 非懒加载:子级联动父级 */
|
|
2092
|
-
childLinkParent:
|
|
2092
|
+
childLinkParent: he,
|
|
2093
2093
|
/** 非懒加载:父级联动子级 */
|
|
2094
2094
|
parentLinkChild: k,
|
|
2095
2095
|
/** 清空搜索框并重新加载整棵树方法(用于懒加载重新请求整颗树的数据) */
|
|
2096
|
-
resetLazyLoad: async () => (($.value || a.isFilter) && (
|
|
2096
|
+
resetLazyLoad: async () => (($.value || a.isFilter) && (de.value = "", Bt()), await Ft(), !0),
|
|
2097
2097
|
/** 自动展开父节点方法 */
|
|
2098
|
-
autoExpand:
|
|
2098
|
+
autoExpand: ee,
|
|
2099
2099
|
/** 清空搜索值,回到tree面板 */
|
|
2100
2100
|
searchClear: Bt,
|
|
2101
2101
|
/** 懒加载获取到的所有平铺数据 */
|
|
2102
2102
|
lazyData: C,
|
|
2103
2103
|
/** 判断懒加载指定节点、节点集合是否全部加载完成 */
|
|
2104
|
-
lazyDataNextTick:
|
|
2104
|
+
lazyDataNextTick: fe,
|
|
2105
2105
|
/** 非懒加载模式触发搜索 */
|
|
2106
|
-
filterSeach:
|
|
2106
|
+
filterSeach: pe,
|
|
2107
2107
|
/** 懒加载模式触发搜索 */
|
|
2108
2108
|
handleSearch: Cr,
|
|
2109
2109
|
/** 根据父级获取所有子孙节点(提供给tree-select组件使用) */
|
|
@@ -2126,12 +2126,12 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2126
2126
|
(n.isFilter || $.value) && n.showFilterInput ? (w(), Wt(i(Bn), Sr({
|
|
2127
2127
|
key: 0,
|
|
2128
2128
|
class: "das-tree-filter-input",
|
|
2129
|
-
modelValue: i(
|
|
2130
|
-
"onUpdate:modelValue": d[0] || (d[0] = (v) => Kn(
|
|
2129
|
+
modelValue: i(de),
|
|
2130
|
+
"onUpdate:modelValue": d[0] || (d[0] = (v) => Kn(de) ? de.value = v : null),
|
|
2131
2131
|
borderType: "bordered",
|
|
2132
2132
|
size: "table"
|
|
2133
2133
|
}, n.inputOptions, {
|
|
2134
|
-
placeholder: (A = n.inputOptions) != null && A.placeholder ? n.inputOptions.placeholder : i(
|
|
2134
|
+
placeholder: (A = n.inputOptions) != null && A.placeholder ? n.inputOptions.placeholder : i($e)("请搜索"),
|
|
2135
2135
|
onClear: Bt,
|
|
2136
2136
|
clearable: "",
|
|
2137
2137
|
filterSpace: !1
|
|
@@ -2172,7 +2172,7 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2172
2172
|
]), 1040, ["modelValue", "placeholder"])) : E("", !0),
|
|
2173
2173
|
n.$slots["container-top"] ? M(n.$slots, "container-top", { key: 1 }) : E("", !0),
|
|
2174
2174
|
De("div", Tg, [
|
|
2175
|
-
|
|
2175
|
+
ge((w(), S("div", Cg, [
|
|
2176
2176
|
n.$slots.top ? M(n.$slots, "top", { key: 0 }) : E("", !0),
|
|
2177
2177
|
De("div", wg, [
|
|
2178
2178
|
(w(), Wt(i(Un), Sr({
|
|
@@ -2186,27 +2186,27 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2186
2186
|
load: x.value ? i(wn) : void 0,
|
|
2187
2187
|
"check-strictly": h.value ? !0 : kn.value,
|
|
2188
2188
|
"node-key": n.nodeKey,
|
|
2189
|
-
"current-node-key":
|
|
2189
|
+
"current-node-key": ae.value,
|
|
2190
2190
|
"default-checked-keys": q.value,
|
|
2191
2191
|
"default-expanded-keys": Ae.value,
|
|
2192
2192
|
props: { ...i(H), class: i(I) },
|
|
2193
2193
|
"show-checkbox": n.showCheckbox,
|
|
2194
2194
|
"expand-on-click-node": n.expandOnClickNode ?? n.showCheckbox,
|
|
2195
|
-
"filter-node-method": i(
|
|
2195
|
+
"filter-node-method": i(_e),
|
|
2196
2196
|
draggable: n.draggable,
|
|
2197
2197
|
"allow-drag": n.allowDrag
|
|
2198
2198
|
}, { ...i(f), onCurrentChange: void 0 }, {
|
|
2199
2199
|
onCurrentChange: i(Tn),
|
|
2200
|
-
onNodeClick: i(
|
|
2201
|
-
onCheck: d[2] || (d[2] = (v,
|
|
2202
|
-
we(v,
|
|
2200
|
+
onNodeClick: i(ye),
|
|
2201
|
+
onCheck: d[2] || (d[2] = (v, g) => {
|
|
2202
|
+
we(v, g, !0);
|
|
2203
2203
|
}),
|
|
2204
2204
|
onNodeCollapse: Pn
|
|
2205
2205
|
}), {
|
|
2206
|
-
default: Ie(({ node: v, data:
|
|
2206
|
+
default: Ie(({ node: v, data: g }) => [
|
|
2207
2207
|
M(n.$slots, "default", {
|
|
2208
2208
|
node: v,
|
|
2209
|
-
data:
|
|
2209
|
+
data: g
|
|
2210
2210
|
}, () => {
|
|
2211
2211
|
var K, W;
|
|
2212
2212
|
return [
|
|
@@ -2214,24 +2214,24 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2214
2214
|
n.showOperations ? (w(), S("div", Og, [
|
|
2215
2215
|
M(n.$slots, "oprations-label", {
|
|
2216
2216
|
node: v,
|
|
2217
|
-
data:
|
|
2217
|
+
data: g
|
|
2218
2218
|
}, () => [
|
|
2219
|
-
n.isEllipsis ?
|
|
2220
|
-
Oe(
|
|
2219
|
+
n.isEllipsis ? ge((w(), S("div", Sg, [
|
|
2220
|
+
Oe(be(g[i(H).label]), 1)
|
|
2221
2221
|
])), [
|
|
2222
2222
|
[i(Pe)]
|
|
2223
2223
|
]) : E("", !0),
|
|
2224
|
-
n.isEllipsis ? E("", !0) : (w(), S("div", Ag,
|
|
2224
|
+
n.isEllipsis ? E("", !0) : (w(), S("div", Ag, be(g[i(H).label]), 1))
|
|
2225
2225
|
]),
|
|
2226
|
-
!i(X)(
|
|
2226
|
+
!i(X)(g, v) && ((W = (K = i(ve)(v, g)) == null ? void 0 : K.list) != null && W.length || i(qe)(v, g).length) ? (w(), S("div", {
|
|
2227
2227
|
key: 0,
|
|
2228
2228
|
class: "oprations-box",
|
|
2229
|
-
onMouseenter: (
|
|
2229
|
+
onMouseenter: (te) => i(j)(v, g)
|
|
2230
2230
|
}, [
|
|
2231
2231
|
De("div", {
|
|
2232
2232
|
class: "more-icon",
|
|
2233
|
-
ref: (
|
|
2234
|
-
style: Or(i(o) ===
|
|
2233
|
+
ref: (te) => i(l)(te, g[n.nodeKey]),
|
|
2234
|
+
style: Or(i(o) === g[n.nodeKey] ? "opacity: 1" : ""),
|
|
2235
2235
|
onClick: d[1] || (d[1] = Xe(() => {
|
|
2236
2236
|
}, ["stop"]))
|
|
2237
2237
|
}, [
|
|
@@ -2244,11 +2244,11 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2244
2244
|
], 40, kg)) : E("", !0)
|
|
2245
2245
|
])) : E("", !0),
|
|
2246
2246
|
n.showOperations ? E("", !0) : (w(), S(Te, { key: 1 }, [
|
|
2247
|
-
n.isEllipsis ?
|
|
2248
|
-
Oe(
|
|
2247
|
+
n.isEllipsis ? ge((w(), S("div", Ig, [
|
|
2248
|
+
Oe(be(g[i(H).label]), 1)
|
|
2249
2249
|
])), [
|
|
2250
2250
|
[i(Pe)]
|
|
2251
|
-
]) : (w(), S("div", xg,
|
|
2251
|
+
]) : (w(), S("div", xg, be(g[i(H).label]), 1))
|
|
2252
2252
|
], 64))
|
|
2253
2253
|
];
|
|
2254
2254
|
})
|
|
@@ -2263,7 +2263,7 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2263
2263
|
]),
|
|
2264
2264
|
Ut.value && !In.value ? (w(), S("div", Pg, [
|
|
2265
2265
|
n.$slots.top ? M(n.$slots, "top", { key: 0 }) : E("", !0),
|
|
2266
|
-
xe(wt, { "empty-text":
|
|
2266
|
+
xe(wt, { "empty-text": p.value }, Tt({ _: 2 }, [
|
|
2267
2267
|
n.$slots["empty-text"] ? {
|
|
2268
2268
|
name: "default",
|
|
2269
2269
|
fn: Ie(() => [
|
|
@@ -2274,7 +2274,7 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2274
2274
|
]), 1032, ["empty-text"]),
|
|
2275
2275
|
n.$slots.bottom ? M(n.$slots, "bottom", { key: 1 }) : E("", !0)
|
|
2276
2276
|
])) : E("", !0),
|
|
2277
|
-
i(
|
|
2277
|
+
i(de) && $.value && i(mt).length ? (w(), S(Te, { key: 1 }, [
|
|
2278
2278
|
wr.value ? (w(), S("div", Dg, [
|
|
2279
2279
|
n.$slots.top ? M(n.$slots, "top", { key: 0 }) : E("", !0),
|
|
2280
2280
|
xe(wt, { "empty-text": b.value }, Tt({ _: 2 }, [
|
|
@@ -2287,29 +2287,29 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2287
2287
|
} : void 0
|
|
2288
2288
|
]), 1032, ["empty-text"]),
|
|
2289
2289
|
n.$slots.bottom ? M(n.$slots, "bottom", { key: 1 }) : E("", !0)
|
|
2290
|
-
])) :
|
|
2290
|
+
])) : ge((w(), S("ul", Eg, [
|
|
2291
2291
|
n.$slots.top ? M(n.$slots, "top", { key: 0 }) : E("", !0),
|
|
2292
|
-
(w(!0), S(Te, null, ct(i(mt), (v,
|
|
2293
|
-
key:
|
|
2292
|
+
(w(!0), S(Te, null, ct(i(mt), (v, g) => (w(), S("li", {
|
|
2293
|
+
key: g,
|
|
2294
2294
|
class: Ye([
|
|
2295
2295
|
"search-result-item",
|
|
2296
2296
|
i(J)(v, !0) ? "is-active" : "",
|
|
2297
2297
|
i(X)(v, null) ? "is-disabled" : "",
|
|
2298
|
-
i(_t)(v,
|
|
2298
|
+
i(_t)(v, g)
|
|
2299
2299
|
]),
|
|
2300
2300
|
onMousedown: Xe((K) => i(Sn)(v, !0), ["stop"])
|
|
2301
2301
|
}, [
|
|
2302
2302
|
M(n.$slots, "search-result-item", {
|
|
2303
2303
|
item: v,
|
|
2304
|
-
index:
|
|
2304
|
+
index: g
|
|
2305
2305
|
}, () => [
|
|
2306
|
-
|
|
2307
|
-
Oe(
|
|
2306
|
+
ge((w(), S("div", Kg, [
|
|
2307
|
+
Oe(be(v[i(H).label]), 1)
|
|
2308
2308
|
])), [
|
|
2309
2309
|
[i(Pe)]
|
|
2310
2310
|
]),
|
|
2311
|
-
v[i(H).pathName] ?
|
|
2312
|
-
Oe(
|
|
2311
|
+
v[i(H).pathName] ? ge((w(), S("div", Ng, [
|
|
2312
|
+
Oe(be(v[i(H).pathName]), 1)
|
|
2313
2313
|
])), [
|
|
2314
2314
|
[i(Pe)]
|
|
2315
2315
|
]) : E("", !0)
|
|
@@ -2319,7 +2319,7 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2319
2319
|
])), [
|
|
2320
2320
|
[i(zt)]
|
|
2321
2321
|
])
|
|
2322
|
-
], 64)) : i(
|
|
2322
|
+
], 64)) : i(de) && n.isFilter && i(_).length ? (w(), S(Te, { key: 2 }, [
|
|
2323
2323
|
wr.value ? (w(), S("div", zg, [
|
|
2324
2324
|
n.$slots.top ? M(n.$slots, "top", { key: 0 }) : E("", !0),
|
|
2325
2325
|
xe(wt, { "empty-text": b.value }, Tt({ _: 2 }, [
|
|
@@ -2332,29 +2332,29 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2332
2332
|
} : void 0
|
|
2333
2333
|
]), 1032, ["empty-text"]),
|
|
2334
2334
|
n.$slots.bottom ? M(n.$slots, "bottom", { key: 1 }) : E("", !0)
|
|
2335
|
-
])) :
|
|
2335
|
+
])) : ge((w(), S("ul", Mg, [
|
|
2336
2336
|
n.$slots.top ? M(n.$slots, "top", { key: 0 }) : E("", !0),
|
|
2337
|
-
(w(!0), S(Te, null, ct(i(
|
|
2338
|
-
key:
|
|
2337
|
+
(w(!0), S(Te, null, ct(i(_), (v, g) => (w(), S("li", {
|
|
2338
|
+
key: g,
|
|
2339
2339
|
class: Ye([
|
|
2340
2340
|
"search-result-item",
|
|
2341
2341
|
i(J)(v, !0) ? "is-active" : "",
|
|
2342
2342
|
i(X)(v, null) ? "is-disabled" : "",
|
|
2343
|
-
i(_t)(v,
|
|
2343
|
+
i(_t)(v, g)
|
|
2344
2344
|
]),
|
|
2345
|
-
onMousedown: Xe((K) => i(P)(v
|
|
2345
|
+
onMousedown: Xe((K) => i(P)(v), ["stop"])
|
|
2346
2346
|
}, [
|
|
2347
2347
|
M(n.$slots, "search-result-item", {
|
|
2348
2348
|
item: v,
|
|
2349
|
-
index:
|
|
2349
|
+
index: g
|
|
2350
2350
|
}, () => [
|
|
2351
|
-
|
|
2352
|
-
Oe(
|
|
2351
|
+
ge((w(), S("div", Bg, [
|
|
2352
|
+
Oe(be(v[i(H).label]), 1)
|
|
2353
2353
|
])), [
|
|
2354
2354
|
[i(Pe)]
|
|
2355
2355
|
]),
|
|
2356
|
-
v[i(H).pathName] ?
|
|
2357
|
-
Oe(
|
|
2356
|
+
v[i(H).pathName] ? ge((w(), S("div", Ug, [
|
|
2357
|
+
Oe(be(v[i(H).pathName]), 1)
|
|
2358
2358
|
])), [
|
|
2359
2359
|
[i(Pe)]
|
|
2360
2360
|
]) : E("", !0)
|
|
@@ -2371,7 +2371,7 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2371
2371
|
"popper-class": "das-tree-operation-dropdown",
|
|
2372
2372
|
ref_key: "oprationsPopoverRef",
|
|
2373
2373
|
ref: y,
|
|
2374
|
-
"virtual-ref": i(
|
|
2374
|
+
"virtual-ref": i(Z),
|
|
2375
2375
|
placement: "bottom-start",
|
|
2376
2376
|
"show-arrow": !1,
|
|
2377
2377
|
trigger: "hover",
|
|
@@ -2380,17 +2380,17 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2380
2380
|
onHide: d[4] || (d[4] = (v) => i(u)(!1))
|
|
2381
2381
|
}, {
|
|
2382
2382
|
default: Ie(() => {
|
|
2383
|
-
var v,
|
|
2383
|
+
var v, g, K, W, te, re, R, V, D;
|
|
2384
2384
|
return [
|
|
2385
|
-
(v = i(
|
|
2386
|
-
(K = (
|
|
2385
|
+
(v = i(m)) != null && v.node ? (w(), S("ul", Gg, [
|
|
2386
|
+
(K = (g = i(ve)(i(m).node, i(m).data)) == null ? void 0 : g.list) != null && K.length && ((W = i(ve)(i(m).node, i(m).data)) == null ? void 0 : W.position) === "top" ? (w(!0), S(Te, { key: 0 }, ct((te = i(ve)(i(m).node, i(m).data)) == null ? void 0 : te.list, (T, ie) => (w(), S(Te, {
|
|
2387
2387
|
key: T.value
|
|
2388
2388
|
}, [
|
|
2389
2389
|
T.hidden ? E("", !0) : (w(), S("li", {
|
|
2390
2390
|
class: Ye(["opration-item", T.disabled ? "is-disabled" : ""]),
|
|
2391
2391
|
key: T.value || ie,
|
|
2392
2392
|
disabled: T.disabled,
|
|
2393
|
-
onClick: Xe((jr) => i(Ne)(T, i(
|
|
2393
|
+
onClick: Xe((jr) => i(Ne)(T, i(m).node, i(m).data), ["stop"])
|
|
2394
2394
|
}, [
|
|
2395
2395
|
De("div", Vg, [
|
|
2396
2396
|
xe(i(ut), {
|
|
@@ -2399,21 +2399,21 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2399
2399
|
iconColor: T.disabled ? "#b2b2b2" : T.iconColor ? T.iconColor : "#666666"
|
|
2400
2400
|
}, null, 8, ["icon", "iconColor"])
|
|
2401
2401
|
]),
|
|
2402
|
-
|
|
2403
|
-
Oe(
|
|
2402
|
+
ge((w(), S("div", Hg, [
|
|
2403
|
+
Oe(be(T.label || T.value), 1)
|
|
2404
2404
|
])), [
|
|
2405
2405
|
[i(Pe)]
|
|
2406
2406
|
])
|
|
2407
2407
|
], 10, Rg))
|
|
2408
2408
|
], 64))), 128)) : E("", !0),
|
|
2409
|
-
(w(!0), S(Te, null, ct(i(qe)(i(
|
|
2409
|
+
(w(!0), S(Te, null, ct(i(qe)(i(m).node, i(m).data), (T, ie) => (w(), S(Te, {
|
|
2410
2410
|
key: T.value
|
|
2411
2411
|
}, [
|
|
2412
2412
|
T.hidden ? E("", !0) : (w(), S("li", {
|
|
2413
2413
|
class: Ye(["opration-item", T.disabled ? "is-disabled" : ""]),
|
|
2414
2414
|
key: T.value || ie,
|
|
2415
2415
|
disabled: T.disabled,
|
|
2416
|
-
onClick: Xe((jr) => i(Ne)(T, i(
|
|
2416
|
+
onClick: Xe((jr) => i(Ne)(T, i(m).node, i(m).data), ["stop"])
|
|
2417
2417
|
}, [
|
|
2418
2418
|
De("div", qg, [
|
|
2419
2419
|
xe(i(ut), {
|
|
@@ -2422,21 +2422,21 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2422
2422
|
iconColor: T.disabled ? "#b2b2b2" : T.iconColor ? T.iconColor : "#666666"
|
|
2423
2423
|
}, null, 8, ["icon", "iconColor"])
|
|
2424
2424
|
]),
|
|
2425
|
-
|
|
2426
|
-
Oe(
|
|
2425
|
+
ge((w(), S("div", Jg, [
|
|
2426
|
+
Oe(be(T.label || T.value), 1)
|
|
2427
2427
|
])), [
|
|
2428
2428
|
[i(Pe)]
|
|
2429
2429
|
])
|
|
2430
2430
|
], 10, Wg))
|
|
2431
2431
|
], 64))), 128)),
|
|
2432
|
-
(R = (
|
|
2432
|
+
(R = (re = i(ve)(i(m).node, i(m).data)) == null ? void 0 : re.list) != null && R.length && ((V = i(ve)(i(m).node, i(m).data)) == null ? void 0 : V.position) === "bottom" ? (w(!0), S(Te, { key: 1 }, ct((D = i(ve)(i(m).node, i(m).data)) == null ? void 0 : D.list, (T, ie) => (w(), S(Te, {
|
|
2433
2433
|
key: T.value
|
|
2434
2434
|
}, [
|
|
2435
2435
|
T.hidden ? E("", !0) : (w(), S("li", {
|
|
2436
2436
|
class: Ye(["opration-item", T.disabled ? "is-disabled" : ""]),
|
|
2437
2437
|
key: T.value || ie,
|
|
2438
2438
|
disabled: T.disabled,
|
|
2439
|
-
onClick: Xe((jr) => i(Ne)(T, i(
|
|
2439
|
+
onClick: Xe((jr) => i(Ne)(T, i(m).node, i(m).data), ["stop"])
|
|
2440
2440
|
}, [
|
|
2441
2441
|
De("div", Xg, [
|
|
2442
2442
|
xe(i(ut), {
|
|
@@ -2445,8 +2445,8 @@ const ht = /* @__PURE__ */ zl($g), _g = (e, t, r, a, c, f, s, g, b, h, x, C, $,
|
|
|
2445
2445
|
iconColor: T.disabled ? "#b2b2b2" : T.iconColor ? T.iconColor : "#666666"
|
|
2446
2446
|
}, null, 8, ["icon", "iconColor"])
|
|
2447
2447
|
]),
|
|
2448
|
-
|
|
2449
|
-
Oe(
|
|
2448
|
+
ge((w(), S("div", Zg, [
|
|
2449
|
+
Oe(be(T.label || T.value), 1)
|
|
2450
2450
|
])), [
|
|
2451
2451
|
[i(Pe)]
|
|
2452
2452
|
])
|