「体系构建全指南」第一讲：节点式巡检管理工具的核心概念与价值解析

/\*\*  
 \* 根据巡检节点状态更新父级区域完成度  
 \* @param {Object} node 巡检区域对象（包含子节点数组）  
 \* @returns {number} 聚合后的巡检完成度  
 \*/  
function calculateNodeProgress(node) {  
    // 基准情况：如果是原子检查项，直接返回其完成状态（0或100）  
    if (\!node.subNodes || node.subNodes.length \=== 0) {  
        return node.isChecked ? 100 : 0;  
    }

    // 汇总所有子节点的巡检进度  
    const totalSubProgress \= node.subNodes.reduce((sum, sub) \=\> {  
        return sum \+ calculateNodeProgress(sub);  
    }, 0);

    // 返回当前区域的平均巡检进度  
    const aggregateProgress \= totalSubProgress / node.subNodes.length;  
      
    // 更新节点显示状态  
    node.currentProgress \= Math.round(aggregateProgress);  
    return node.currentProgress;  
}

class InspectionNodeEngine:  
    def \_\_init\_\_(self):  
        \# 预设巡检节点模板库：区域 \-\> 检查项序列  
        self.templates \= {  
            "Power\_Room": {  
                "Fire\_Security": \["Extinguisher", "Detector", "Exits"\],  
                "Electrical": \["Voltage", "Temp", "Loading"\],  
                "Environment": \["Ventilation", "Humidity"\]  
            }  
        }

    def deploy\_inspection(self, template\_key, parent\_id="Area"):  
        """动态为巡检任务注入节点执行序列"""  
        nodes \= self.templates.get(template\_key)  
        if isinstance(nodes, dict):  
            for sub\_key, sub\_value in nodes.items():  
                node\_id \= f"{parent\_id} \-\> {sub\_key}"  
                print(f"\[Node\] 正在激活巡检节点: {node\_id}")  
                \# 递归生成多级检查节点  
                self.deploy\_inspection(sub\_key, node\_id)  
        elif isinstance(nodes, list):  
            for item in nodes:  
                print(f"\[Check\] 注入底层原子项: {parent\_id} \-\> {item}")

\# 调用示例  
engine \= InspectionNodeEngine()  
engine.deploy\_inspection("Power\_Room")

WITH RECURSIVE InspectionHierarchy AS (  
    \-- 初始行：选择顶层巡检区域  
    SELECT id, node\_name, parent\_id, status, check\_time   
    FROM inspection\_nodes WHERE parent\_id IS NULL  
    UNION ALL  
    \-- 关联子检查节点  
    SELECT i.id, i.node\_name, i.parent\_id, i.status, i.check\_time  
    FROM inspection\_nodes i  
    INNER JOIN InspectionHierarchy ih ON i.parent\_id \= ih.id  
)  
SELECT   
    id, node\_name,   
    COUNT(CASE WHEN status \= 'missed' THEN 1 END) as miss\_count  
FROM InspectionHierarchy  
GROUP BY id  
HAVING miss\_count \> 5  
ORDER BY miss\_count DESC; \-- 识别漏洞频发的巡检盲区