lh-ui-next 0.1.7 → 0.1.8-beta.2
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/README.md +1 -1
- package/lib/lh-ui-next.mjs +9 -14
- package/lib/lh-ui-next.umd.js +1 -1
- package/package.json +9 -9
package/README.md
CHANGED
|
@@ -5,7 +5,7 @@ alpha version is use to self-test; beta version is use to public survey.for exam
|
|
|
5
5
|
1.0.0-alpha.1
|
|
6
6
|
1.0.0-test.2
|
|
7
7
|
## Official version : "0.1.7",
|
|
8
|
-
## test version : "0.1.
|
|
8
|
+
## test version : "0.1.8-beta.2,
|
|
9
9
|
## npmmirror
|
|
10
10
|
When cnpm sync execution is unsuccessful,you can go the website(http://www.npmmirror.com/package/lh-ui-next) and press sync button to
|
|
11
11
|
manual trigger the sync event
|
package/lib/lh-ui-next.mjs
CHANGED
|
@@ -3696,7 +3696,7 @@ const Jl = {
|
|
|
3696
3696
|
let e = this.fourthList[0];
|
|
3697
3697
|
this.changeFatherCount(e, this.fourthList), this.calSecondChecked1Status(this.clickedFisrtNode), this.checkChanged();
|
|
3698
3698
|
},
|
|
3699
|
-
|
|
3699
|
+
//计算父亲节点的 子集被选中的数量
|
|
3700
3700
|
changeFatherCount(e, t) {
|
|
3701
3701
|
let i = this.findNodeByKey(e.parentMirror.key);
|
|
3702
3702
|
e.checked ? i.childSelectedCount = t.length : i.childSelectedCount = 0;
|
|
@@ -3796,18 +3796,15 @@ const Jl = {
|
|
|
3796
3796
|
let t = this.findNodeByKey(e);
|
|
3797
3797
|
t && (t.checked = !t.checked, this.oneNodeClickCallback(t), this.checkChanged());
|
|
3798
3798
|
},
|
|
3799
|
-
//根据key
|
|
3799
|
+
//根据key值选中单个节点和节点下的所有子孙级。
|
|
3800
3800
|
setCheckedKeyAndChildren(e) {
|
|
3801
|
-
this.
|
|
3802
|
-
|
|
3803
|
-
|
|
3804
|
-
|
|
3805
|
-
for (let n = 0; n < s.children.length; n++) {
|
|
3806
|
-
let a = s.children[n];
|
|
3807
|
-
a.checked = l, a.checked && (a.indeterminate = !1), a.isLeaf || (a.childSelectedCount = a.children.length, i(a, l));
|
|
3801
|
+
let t = this.findNodeByKey(e), i = [e], s = (l) => {
|
|
3802
|
+
for (let n = 0; n < l.children.length; n++) {
|
|
3803
|
+
let a = l.children[n];
|
|
3804
|
+
i.push(a.key), a.isLeaf || s(a);
|
|
3808
3805
|
}
|
|
3809
3806
|
};
|
|
3810
|
-
t.isLeaf || (t
|
|
3807
|
+
t.isLeaf || s(t), this.setCheckedKeys(i);
|
|
3811
3808
|
},
|
|
3812
3809
|
//隐藏其他
|
|
3813
3810
|
hideOthers() {
|
|
@@ -8474,12 +8471,10 @@ const Ko = {
|
|
|
8474
8471
|
this.handleHeader();
|
|
8475
8472
|
},
|
|
8476
8473
|
cellMouseEnter(e) {
|
|
8477
|
-
|
|
8478
|
-
this.$emit("cellMouseEnter", e, t);
|
|
8474
|
+
this.$emit("cellMouseEnter", e, null);
|
|
8479
8475
|
},
|
|
8480
8476
|
cellMouseLeave(e) {
|
|
8481
|
-
|
|
8482
|
-
this.$emit("cellMouseLeave", e, t);
|
|
8477
|
+
this.$emit("cellMouseLeave", e, null);
|
|
8483
8478
|
}
|
|
8484
8479
|
},
|
|
8485
8480
|
mounted() {
|