|
@@ -399,21 +399,21 @@ $(document).ready(() => {
|
|
|
return;
|
|
|
}
|
|
|
}
|
|
|
- } else if (type === 'up-level') {
|
|
|
- const parent = tree.getParent(node);
|
|
|
- const children = parent ? parent.children : tree.children;
|
|
|
- const index = children.indexOf(node);
|
|
|
- for (let i = index; i < children.length; i++) {
|
|
|
- const child = children[index];
|
|
|
- if (tree.checkNodeUsed(child, pos)) {
|
|
|
- if (i >= index + count) {
|
|
|
- toastr.warning('其后节点已计量,选中的节点不可升级');
|
|
|
- } else {
|
|
|
- toastr.warning('选中的节点已计量,不可升级');
|
|
|
- }
|
|
|
- return;
|
|
|
- }
|
|
|
- }
|
|
|
+ // } else if (type === 'up-level') {
|
|
|
+ // const parent = tree.getParent(node);
|
|
|
+ // const children = parent ? parent.children : tree.children;
|
|
|
+ // const index = children.indexOf(node);
|
|
|
+ // for (let i = index; i < children.length; i++) {
|
|
|
+ // const child = children[index];
|
|
|
+ // if (tree.checkNodeUsed(child, pos)) {
|
|
|
+ // if (i >= index + count) {
|
|
|
+ // toastr.warning('其后节点已计量,选中的节点不可升级');
|
|
|
+ // } else {
|
|
|
+ // toastr.warning('选中的节点已计量,不可升级');
|
|
|
+ // }
|
|
|
+ // return;
|
|
|
+ // }
|
|
|
+ // }
|
|
|
} else if (type === 'down-level') {
|
|
|
const parent = tree.getParent(node);
|
|
|
const children = parent ? parent.children : tree.children;
|