@@ -9,6 +9,9 @@ from pathlib import Path
    
    ROOT = Path(__file__).resolve().parents[1]
    SCHEMA = "asw.quality-result/v1"
  + BRANCH_NODES = (ast.If, ast.For, ast.AsyncFor, ast.While, ast.Try, ast.BoolOp)
  + if hasattr(ast, "Match"):
  +     BRANCH_NODES += (ast.Match,)
    
    
    def write_result(path: str, payload: dict) -> None:
@@ -38,7 +41,7 @@ def static_analysis() -> dict:
            for node in ast.walk(tree):
                if isinstance(node, (ast.FunctionDef, ast.AsyncFunctionDef)):
                    functions += 1
  −                 complexity = 1 + sum(isinstance(item, (ast.If, ast.For, ast.AsyncFor, ast.While, ast.Try, ast.BoolOp, ast.Match)) for item in ast.walk(node))
  +                 complexity = 1 + sum(isinstance(item, BRANCH_NODES) for item in ast.walk(node))
                    maximum_complexity = max(maximum_complexity, complexity)
                    if complexity > 12:
                        issues.append({"rule": "PY-COMPLEXITY", "severity": "MEDIUM", "path": relative, "line": node.lineno, "message": f"{node.name} complexity {complexity} exceeds warning threshold 12"})