概算对比，关联标段、决算对比选择相关

app/public/js/budget_compare.js

@@ -251,7 +251,7 @@ $(document).ready(() => {
                 html.push(`<tr><td></td><td class="in-${t.level}"><i class="fa fa-folder-o"></i> ${t.name}</td><td></td><td></td></tr>`);
             } else if (t.tid) {
                 const icon = tree.isLastSibling(t) ? '└' : '├';
-                html.push(`<tr><td class="text-center"><input type="checkbox" name="select-rela-check" tid="${t.id}"></td><td class="in-${t.level}">${icon} ${t.name}</td><td>第${t.lastStageOrder}期</td><td>${t.lastStageStatus}</td></tr>`);
+                html.push(`<tr><td class="text-center"><input type="checkbox" name="sf-tender" tid="${t.id}"></td><td class="in-${t.level}">${icon} ${t.name}</td><td>第${t.lastStageOrder}期</td><td>${t.lastStageStatus}</td></tr>`);
             }
         }
         return html.join('');

app/public/js/budget_list.js

@@ -89,7 +89,7 @@ $(document).ready(() => {
                     html.push(`<tr><td></td><td class="in-${t.level}"><i class="fa fa-folder-o"></i> ${t.name}</td><td></td><td></td></tr>`);
                 } else if (t.tid) {
                     const icon = tree.isLastSibling(t) ? '└' : '├';
-                    html.push(`<tr><td class="text-center"><input type="checkbox" name="select-rela-check" tid="${t.id}"></td><td class="in-${t.level}">${icon} ${t.name}</td><td>第${t.lastStageOrder}期</td><td>${t.lastStageStatus}</td></tr>`);
+                    html.push(`<tr><td class="text-center"><input type="checkbox" name="select-rela-check" tid="${t.tid}"></td><td class="in-${t.level}">${icon} ${t.name}</td><td>第${t.lastStageOrder}期</td><td>${t.lastStageStatus}</td></tr>`);
                 }
             }
             $('#valid-rela-tender').html(html.join(''));

app/public/js/revise.js

@@ -362,7 +362,11 @@ $(document).ready(() => {
                 const parent = tree.getParent(node);
                 const children = parent ? parent.children : tree.children;
                 const index = children.indexOf(node);
-                for (let i = 0; i < count; i++) {
+                if (index > 0 && children[index-1].used) {
+                    toastr.warning('其前节点已计量，选中的节点不可降级');
+                    return;
+                }
+                for (let i = index; i < count; i++) {
                     const child = children[i+index];
                     if (tree.checkNodeUsed(child, pos)) {
                         toastr.warning('选中的节点已计量，不可降级');