{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"cli.dispatch_command (cyclomatic 850): cli.dispatch_command has cyclomatic complexity 850 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a0e27ff3bef1baad1f909980ae249e680821d04ebe6e64631c01aca9b0f8f5"}},{"ruleId":"D1","level":"warning","message":{"text":"extract.extract (cyclomatic 372): extract.extract has cyclomatic complexity 372 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":9272}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a766b86c2b816ceca448e764212e996f525e0fd0106665491256a6e7363ba0"}},{"ruleId":"D1","level":"warning","message":{"text":"build.build_from_json (cyclomatic 165): build.build_from_json has cyclomatic complexity 165 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"52701565ee6895029e3824da6a80b8fe1b5411be82f3a58f9d3371ec6640f39f"}},{"ruleId":"D1","level":"warning","message":{"text":"watch._rebuild_code (cyclomatic 149): watch._rebuild_code has cyclomatic complexity 149 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"387098c7f603330fbedfc75ba54f6c12f204a3281e204a546410e68091e6ddb4"}},{"ruleId":"D1","level":"warning","message":{"text":"dedup.deduplicate_entities (cyclomatic 119): dedup.deduplicate_entities has cyclomatic complexity 119 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/dedup.py"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2223636c82dca2db97ada2beb636ffd0174c34e49f4fc938af537c4d34ee476"}},{"ruleId":"D1","level":"warning","message":{"text":"dart.extract_dart (cyclomatic 117): dart.extract_dart has cyclomatic complexity 117 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dart.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb7218e6497266291b97ee3e3286f1bfbedf275943d3bcff406fdf88b9854f2"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._extract_generic (cyclomatic 117): engine._extract_generic has cyclomatic complexity 117 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":5995}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a122c49ed84be35f4df5611996f80531ef4483cf477dabed990526059058ee"}},{"ruleId":"D1","level":"warning","message":{"text":"install.dispatch_install_cli (cyclomatic 111): install.dispatch_install_cli has cyclomatic complexity 111 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"86282af9a809c5f3c1159f93a27d8e23a2856bfa791c9b33e79953a4415edf7c"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._apply_symbol_resolution_facts (cyclomatic 98): resolution._apply_symbol_resolution_facts has cyclomatic complexity 98 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64c826b811b6bd2f672d22ae85b5066af953da14d831d69d56835eebc6d923e"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._js_extra_walk (cyclomatic 84): engine._js_extra_walk has cyclomatic complexity 84 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4317}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac25c3b195fda80ef5d7f912bbc9c9fb84cf1722e8a8362cd348acb4c1c6c38b"}},{"ruleId":"D1","level":"warning","message":{"text":"ruby_resolution.resolve_ruby_member_calls (cyclomatic 84): ruby_resolution.resolve_ruby_member_calls has cyclomatic complexity 84 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/ruby_resolution.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6e825264e91ad1216a2f7d656bcb3b492a2eb4a72cd032219bf69f9515cf15"}},{"ruleId":"D1","level":"warning","message":{"text":"build.build_merge (cyclomatic 83): build.build_merge has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5dc36971986f93442c466d08d656db0e53651fc78e24bce6cfae85529c8aa4"}},{"ruleId":"D1","level":"warning","message":{"text":"solidity.extract_solidity (cyclomatic 81): solidity.extract_solidity has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/solidity.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f87448ea4c9d83124376b10b07842f766fcebfd503f77bb15f092cd8c49461"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._resolve_python_member_calls (cyclomatic 80): extract._resolve_python_member_calls has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":4764}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9625a70a78db43bf6e044a469b96a720d9188f33430b9a142e5de6a0da26799"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._ts_receiver_type_table (cyclomatic 79): engine._ts_receiver_type_table has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3574}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d05106647bb170426cbd4e1728859a6ba36563eb915327c87b9cf8211b9887c"}},{"ruleId":"D1","level":"warning","message":{"text":"report.generate (cyclomatic 63): report.generate has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/report.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3120b4aff87fa9396b9df89bb7e3babcdd84777571e2e4ec28e1fec7750d050"}},{"ruleId":"D1","level":"warning","message":{"text":"detect.detect (cyclomatic 61): detect.detect has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d7a92e11003fac95de5e4e73cdba0851a9edd7fe2ab0dd4a212c88a20f7158"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._resolve_typescript_member_calls (cyclomatic 59): extract._resolve_typescript_member_calls has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e0a84e194934256ef35065fc8aed9ea11a9fd8a9e158138a06cbef9e331d49"}},{"ruleId":"D1","level":"warning","message":{"text":"watch._reconcile_existing_graph (cyclomatic 56): watch._reconcile_existing_graph has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9e737c451fb9c3896138b67b67458c0b73e46a635406c91ed73d7265521562"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._run_hook_guard (cyclomatic 55): cli._run_hook_guard has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aafdabb0391f9f534aef5259692992cac709b628dfef4064e9d60acad5704fe"}},{"ruleId":"D1","level":"warning","message":{"text":"erlang.extract_erlang (cyclomatic 55): erlang.extract_erlang has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/erlang.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c35d594d1b2560f92f7ac5c2ff76192e66fb6d8b3e45121f1ceb5a46a92959c"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._resolve_csharp_member_calls (cyclomatic 54): extract._resolve_csharp_member_calls has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5577}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b7791ead68809b8e69e7996cc6a2084e77bb4953250f7601a1bff9d0ebf88f"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._rewire_unique_stub_nodes (cyclomatic 53): extract._rewire_unique_stub_nodes has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":3926}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdd898e822b4ed360065287675e4c488c4204b915c94a2bd26171db441c93aa"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._resolve_java_type_references (cyclomatic 53): resolution._resolve_java_type_references has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":3715}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef81b2ba917466e6ce74dc2789fbcc6e2b1b98d51b037fa48e75d9ee527669e"}},{"ruleId":"D1","level":"warning","message":{"text":"llm._call_llm (cyclomatic 53): llm._call_llm has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":3041}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f3fcef390f87593c686b5eaa450544bb17b01277877c792cc4b983cc68d4c2"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._resolve_swift_member_calls (cyclomatic 48): extract._resolve_swift_member_calls has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":4563}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f4ed5dbfb2e73c537b6619a5810c0fa01d1e832494248674786f1e33d15a59"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._js_find_exported_objects (cyclomatic 47): engine._js_find_exported_objects has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0380902239e5b40b296f73773eafc7b7f37b49dc3dddb4e099a8d1d64c98681a"}},{"ruleId":"D1","level":"warning","message":{"text":"export.to_obsidian (cyclomatic 46): export.to_obsidian has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/export.py"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"5448378ef703e0ccde0c4237f1caf5305f89ebe2282b0ca299d9ee2dd7268f3d"}},{"ruleId":"D1","level":"warning","message":{"text":"detect.save_manifest (cyclomatic 44): detect.save_manifest has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":2575}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a8ba5cefbe1e95f06c31bea4042eb904df7d2cdeeb3af780f923e2efb7fccc"}},{"ruleId":"D1","level":"warning","message":{"text":"html.to_html (cyclomatic 44): html.to_html has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/exporters/html.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"010b89e9703e8f8f061f2b6c71f4f330d91492cf5b2d72a4fa09e0a50b769993"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._resolve_objc_member_calls (cyclomatic 44): extract._resolve_objc_member_calls has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6370}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7168ff7fa6d218f88fea509c471b4e22c2f526cfec137015c8ef31e680e433"}},{"ruleId":"D1","level":"warning","message":{"text":"extract.extract_xaml (cyclomatic 44): extract.extract_xaml has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":8413}}}],"partialFingerprints":{"codehealthFindingId/v1":"980b998d47d683ae8b502cffc2b42069c5766aae803fb90a462dd9e7f804c652"}},{"ruleId":"D1","level":"warning","message":{"text":"cache.save_semantic_cache (cyclomatic 43): cache.save_semantic_cache has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ea11bd187b9ec55aad60e760a43434a9e570a4871ffd9934058de92229269d"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._resolve_java_member_calls (cyclomatic 43): extract._resolve_java_member_calls has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6106}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b5294102ac6de092329ba6cc37be23e6289f89c8a29fe82be6165084a2f5b1"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._csharp_method_receiver_types (cyclomatic 43): engine._csharp_method_receiver_types has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3339}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e57f5d5e8d6fc873e48f753cc036167ffb5edcc68a4a88b83b3589dd860b581"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._resolve_php_type_references (cyclomatic 43): resolution._resolve_php_type_references has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":3996}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c527025344ca454705852e68521a81aefc95d8e2d70e008c025bc2906c5148f"}},{"ruleId":"D1","level":"warning","message":{"text":"sql.extract_sql (cyclomatic 43): sql.extract_sql has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/sql.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"44936e03545deb27b97829860b55f61c5bd61903515746b959290e51a55b2473"}},{"ruleId":"D1","level":"warning","message":{"text":"serve._subgraph_to_text (cyclomatic 43): serve._subgraph_to_text has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6e81a7067fed56bc78a9a602dcb13da107edecf1cb890b679fcbcd8f777a09"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._collect_js_symbol_resolution_facts (cyclomatic 42): resolution._collect_js_symbol_resolution_facts has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":2213}}}],"partialFingerprints":{"codehealthFindingId/v1":"65928496997a56185c52bf743d88dd5bacfdabd1f32c0c091498cb500d4e8e46"}},{"ruleId":"D1","level":"warning","message":{"text":"terraform.extract_terraform (cyclomatic 42): terraform.extract_terraform has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/terraform.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dee6386a20ebfda595661659fdbec79a38c13eefb96d858de45b132c7aac7f"}},{"ruleId":"D1","level":"warning","message":{"text":"dedup._llm_tiebreak (cyclomatic 41): dedup._llm_tiebreak has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/dedup.py"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2fea224069651c45d34c661c4e7602f914c75b40b97bb7f4a095cdbff548ae"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._disambiguate_colliding_node_ids (cyclomatic 41): resolution._disambiguate_colliding_node_ids has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa498d7e9c5d0420a4643e58a6fb40590255390b5528abba4c91faca404ee1e9"}},{"ruleId":"D1","level":"warning","message":{"text":"cluster.cluster (cyclomatic 40): cluster.cluster has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cluster.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ef4d0c04c7f87704824a30aee87f91eeb8e8b91d988213d46108ac20307db3"}},{"ruleId":"D1","level":"warning","message":{"text":"dedup._path_qualify_dropped_collisions (cyclomatic 40): dedup._path_qualify_dropped_collisions has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/dedup.py"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d8fd76b0347789e5d000f0ecc9a29cc00b29a53b722d2b6796ecce540b3011"}},{"ruleId":"D1","level":"warning","message":{"text":"serve._score_query (cyclomatic 40): serve._score_query has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f1c6473f1cb34c71e31324238d0a407aa27678bd9746db9b9305144b181446"}},{"ruleId":"D1","level":"warning","message":{"text":"apex.extract_apex (cyclomatic 39): apex.extract_apex has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/apex.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c03ad681ca993107d66f58de16a74b93bb04f2c748c3cda9800e526922148ee"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._resolve_cross_file_imports (cyclomatic 39): resolution._resolve_cross_file_imports has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":2913}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e41ff5282ec5371714ff9dc3297fe28f9730964f9605e2ca349e9601d72e0ae"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._resolve_cpp_member_calls (cyclomatic 38): extract._resolve_cpp_member_calls has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5371}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb64f53160f66a047a53dd0cf0127915758ac06967c586f355075d2545bdc6d"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._merge_csharp_partial_class_nodes (cyclomatic 36): extract._merge_csharp_partial_class_nodes has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":4249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2454920b4b064b1d3de84ceeac511cce308ee06f76dc8dc946037f1bea8455"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._resolve_php_member_calls (cyclomatic 36): extract._resolve_php_member_calls has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5954}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedc8559174f30633c59011bdb384e67a876daef85158b2600a919dee05dcb29"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._php_get_route_name (cyclomatic 36): engine._php_get_route_name has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":5909}}}],"partialFingerprints":{"codehealthFindingId/v1":"382e90fe3c39c52f7f7cc3b98f0d51e86b0bf310d9dd210f77c7e56d4dc61b8b"}},{"ruleId":"D1","level":"warning","message":{"text":"llm.extract_corpus_parallel (cyclomatic 36): llm.extract_corpus_parallel has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":2692}}}],"partialFingerprints":{"codehealthFindingId/v1":"986dea0c346ce7973d432f472005b881375b6222f4828046ed54042190e599b3"}},{"ruleId":"D1","level":"warning","message":{"text":"export.to_json (cyclomatic 35): export.to_json has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/export.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a1d60a9f0d91c15def1223900e12f61ed96cd907f1fd9257e1607bed179093"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._import_js (cyclomatic 35): extract._import_js has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"411d421b8da99cfc794b7ce3d67a44c4b47ef663f40c022596b29c773a70965a"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._resolve_c_include_edges (cyclomatic 35): extract._resolve_c_include_edges has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6679}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78c0e9ad7485a444a543b6d0a1e9d53aaa490cb0f7ecf43627e57060a586440"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._csharp_collect_type_refs (cyclomatic 35): engine._csharp_collect_type_refs has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e680e062947847ca778c431a9d01593af32f31f56085f7e42703c1f12e3b80"}},{"ruleId":"D1","level":"warning","message":{"text":"index.graphify (cyclomatic 35): index.graphify has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 3 of the 35 points are its own statements and the rest belongs to one function literal inside it that branches (line 130). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/pi/index.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbd90513420d03ef76cc5aff5c54b9d63273d3dda28369f570613e222111a46"}},{"ruleId":"D1","level":"warning","message":{"text":"build.finalize_raw_graph_endpoints (cyclomatic 34): build.finalize_raw_graph_endpoints has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"381037e86914958fe18d2f81571cc9a2b8f1f50b96172a7324675057a1457c73"}},{"ruleId":"D1","level":"warning","message":{"text":"razor.extract_razor (cyclomatic 34): razor.extract_razor has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/razor.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f542ec3a34e91be33de4b5edd0c3e3555e5eb8f85a08d924366738120dcf0a"}},{"ruleId":"D1","level":"warning","message":{"text":"symbol_resolution.resolve_bash_source_edges (cyclomatic 34): symbol_resolution.resolve_bash_source_edges has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/symbol_resolution.py"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"f225cc223d8837290238abb50c59a6573cd6764b56446347fec760a837732af0"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._import_python (cyclomatic 33): extract._import_python has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"3915f9a5ced71a63169d99d055b4fae2546c8e8281ea295e96d08b000391cc14"}},{"ruleId":"D1","level":"warning","message":{"text":"extract.extract_csproj (cyclomatic 33): extract.extract_csproj has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7902}}}],"partialFingerprints":{"codehealthFindingId/v1":"50dc9d4aab2c4907e44883503c42174c41121c8b1b5c7a7f1fe91c1b4b961db2"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._kotlin_collect_type_refs (cyclomatic 33): engine._kotlin_collect_type_refs has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a957b1d1ae208b10fcca8fc914c324f884d2c5122ee7fbdd5a716c7cabdd03"}},{"ruleId":"D1","level":"warning","message":{"text":"CsharpNameResolver.__init__ (cyclomatic 32): CsharpNameResolver.__init__ has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/csharp.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4f12c8f04e5c7830a84aa52b106def6fa9e89dd6cc7d71a91fe981405c6668"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._java_collect_type_refs (cyclomatic 32): engine._java_collect_type_refs has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd25360373b9b9c1f6d6dd09776ca8e7384c62d625edc20d50df7fc8a0af67a"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._resolve_go_type_references (cyclomatic 32): resolution._resolve_go_type_references has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":3612}}}],"partialFingerprints":{"codehealthFindingId/v1":"5955707337115c0fe8107a41538c7ae0e555de5f5caf4fcbc1227d618333735c"}},{"ruleId":"D1","level":"warning","message":{"text":"prs.cmd_prs (cyclomatic 32): prs.cmd_prs has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/prs.py"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad06c61cca38dfe0c3efa0b354cbf1bbbbaa4a78db8c4de45901fafe32f241b"}},{"ruleId":"D1","level":"warning","message":{"text":"semantic_cleanup.sanitize_semantic_fragment (cyclomatic 32): semantic_cleanup.sanitize_semantic_fragment has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/semantic_cleanup.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe79739df340c03517fef5eddb51966160483fa81864248954a5e60871dc0dd"}},{"ruleId":"D1","level":"warning","message":{"text":"serve._find_node_tiers (cyclomatic 32): serve._find_node_tiers has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"376e4a5b5a48076031f593fd5e04d9ef15805128ca36c5220d8889e49db19302"}},{"ruleId":"D1","level":"warning","message":{"text":"watch._reconcile_markdown_links (cyclomatic 32): watch._reconcile_markdown_links has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6e1239e09edf4c611d074824202c7b17d7a3a3c8aaf340c237361f61772d7e"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._ts_walk_class_members (cyclomatic 31): resolution._ts_walk_class_members has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":2104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54ec2f05d63f7c98960da9e01681b732779eec8247f6499772273df88f2206b"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._collect_python_symbol_resolution_facts (cyclomatic 31): resolution._collect_python_symbol_resolution_facts has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":2786}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e94c6b46e90df811b855298c42d709a2cad26ad86a7db2a3e1b9fa95a8c3b2"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze.suggest_questions (cyclomatic 30): analyze.suggest_questions has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67b5576618e748be4c72782120fb31e6164f51b94735c346729a5365f0fdbff"}},{"ruleId":"D1","level":"warning","message":{"text":"build.merge_raw_extraction (cyclomatic 30): build.merge_raw_extraction has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d14c56503a2c4b2d3975257b4ea2172c32fd4ea644ecf34b1e5635628940e03"}},{"ruleId":"D1","level":"warning","message":{"text":"cobol.extract_cobol (cyclomatic 30): cobol.extract_cobol has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/cobol.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c4af072b7be28d6ce15c1169cf3a8e324405489555ceac8687176672508336"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._python_collect_type_refs (cyclomatic 30): engine._python_collect_type_refs has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0517e29fd9130756b0dfa29c0b4bc55e11adb8fd56d646c62bf853b91eac2c"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._ts_collect_type_refs (cyclomatic 30): resolution._ts_collect_type_refs has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09bcc26f139df9b276194e36f4c759a0749103947dc274599e27c6c326d893a"}},{"ruleId":"D1","level":"warning","message":{"text":"sql._scan_sql (cyclomatic 30): sql._scan_sql has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/sql.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f2805cf54937fac96f63047bd35d090e5368915edb2de06babe1dcd75d79c9"}},{"ruleId":"D1","level":"warning","message":{"text":"build._lost_saved_semantic_nodes (cyclomatic 29): build._lost_saved_semantic_nodes has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"895fb3b61c918ac820bcbab17e3969a33cef039c799e38f35b9d8eeb8edaa102"}},{"ruleId":"D1","level":"warning","message":{"text":"cross_repo_calls.link_cross_repo_member_calls (cyclomatic 29): cross_repo_calls.link_cross_repo_member_calls has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cross_repo_calls.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab15425f2eb31bd7a082d4a9eec53c6313d7cd27e38d3647d0bafa6635e4e37"}},{"ruleId":"D1","level":"warning","message":{"text":"pascal._extract_pascal_regex (cyclomatic 29): pascal._extract_pascal_regex has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/pascal.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54f2622c21593eb0800d3cf6add77f39801c611a7d11e4c8eb3ce358101161d"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._merge_decl_def_classes (cyclomatic 29): resolution._merge_decl_def_classes has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":3209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ef9ec1e362165be5d9a51d7f3c6d4fb39032e4bfaeee030fd8e601bcb28a9c"}},{"ruleId":"D1","level":"warning","message":{"text":"install._platform_skill_destination (cyclomatic 29): install._platform_skill_destination has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90f9dec03bec8eaa5e697cc77fcd1facce09ba4a24af6153a564270396ac5f8"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._stale_graph_sources (cyclomatic 28): cli._stale_graph_sources has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea70b810096c1da9fbe46975a028c2b6638350bbe079b8be44e63ead7b7f4f21"}},{"ruleId":"D1","level":"warning","message":{"text":"detect.detect_incremental (cyclomatic 28): detect.detect_incremental has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":2886}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8a1fbaef8e3ad83119b77b32cabf49c362e41b28bb1950680ed719a0328758"}},{"ruleId":"D1","level":"warning","message":{"text":"export.to_canvas (cyclomatic 28): export.to_canvas has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/export.py"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2c1632d78247bcaa6572b375cb97128ac34b70e63a1bf2c27cad4808f2a5be"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._resolve_kotlin_qualified_calls (cyclomatic 28): extract._resolve_kotlin_qualified_calls has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6893}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d17f212cb0101185715559879a1cc651bdc6f0a11443aead2661eef2943a55b"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._read_tsconfig_aliases (cyclomatic 28): resolution._read_tsconfig_aliases has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc223a269ef8f5c6a03677d9d94e0ce73727063e950f374c1b52dd977a005201"}},{"ruleId":"D1","level":"warning","message":{"text":"llm._call_openai_compat (cyclomatic 28): llm._call_openai_compat has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c5bdabe40b6d3e3c6eb705b4f5be33eab455a9ce0572a8771b71883e33d88a"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._zero_node_stamped_semantic_sources (cyclomatic 27): cli._zero_node_stamped_semantic_sources has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5049e458f3cfbfa89ecabd2cf40405767dc276f6576066d49842f67fe123e8e"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._suppress_ambiguous_python_imports (cyclomatic 27): extract._suppress_ambiguous_python_imports has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f8cabda0512132a1157078c200d0546a6ad8e5a2fa19df67394cc86f90df49"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._resolve_rust_self_member_calls (cyclomatic 27): extract._resolve_rust_self_member_calls has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7004}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c689d8fb7d8cb471683fe91fc380b04146d3c853294ce90c7b44562d3313c26"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._kotlin_annotation_class_literal_refs (cyclomatic 27): engine._kotlin_annotation_class_literal_refs has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a6b1864d03a8f4a8319dcfb73253df5c649622b7edc6d9ad7f0d615bb4a4e8"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._require_imports_js (cyclomatic 27): engine._require_imports_js has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3880}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc00fbc82dcb3923841874d575d6379a392b0b5b0bc1b45180fbb5d2aa199c3"}},{"ruleId":"D1","level":"warning","message":{"text":"serve._shortest_path_text (cyclomatic 27): serve._shortest_path_text has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dd132432a29fa48443f6243f89d935b74de4b774aaafab5137625292834309"}},{"ruleId":"D1","level":"warning","message":{"text":"gen.main (cyclomatic 27): gen.main has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/skillgen/gen.py"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61e19dd51e6d2ae3f128350fad901e735c93ff5a086f646c250a366a083af0a"}},{"ruleId":"D1","level":"warning","message":{"text":"build._tier_replacement_sources (cyclomatic 26): build._tier_replacement_sources has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":2141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28cbf9056eb7670d0ac4ff3e28777fad9628c42267fe92103fa6296842c52d2"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._ejs_mask_non_script (cyclomatic 26): extract._ejs_mask_non_script has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":2804}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efbd894955580d028eb57729e95ef1854fe7528861c0c28e339a0a212f82b9f"}},{"ruleId":"D1","level":"warning","message":{"text":"extract.collect_files (cyclomatic 26): extract.collect_files has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":11196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8681ab4093c9671df607a1cd080eec76fc9137ecfb73ad841a94449e1ec4f66"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._swift_collect_type_refs (cyclomatic 26): engine._swift_collect_type_refs has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bc0d3beabd485dd7b302e2592759be1e706260110094fd15a4f218436920c6"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._scala_collect_type_refs (cyclomatic 26): engine._scala_collect_type_refs has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7216e795af08463de47a04f1edf988f22b8cfe37a5b478f4b2a802582f9b0a0"}},{"ruleId":"D1","level":"warning","message":{"text":"rust._rust_collect_type_refs (cyclomatic 26): rust._rust_collect_type_refs has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/rust.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dac34aedba95fa265f43a9c99b245424be3e5c60b975f6aae6d3bc7c0043e27"}},{"ruleId":"D1","level":"warning","message":{"text":"interface_dispatch.resolve_interface_dispatch (cyclomatic 26): interface_dispatch.resolve_interface_dispatch has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/interface_dispatch.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c6d95e93accf4bc35c0d2c2182aeedd4c2c0a17a2b2fa7676329b38ccda1dd"}},{"ruleId":"D1","level":"warning","message":{"text":"validate.validate_extraction (cyclomatic 26): validate.validate_extraction has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/validate.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba64ba477432893131ecc485dc6e374deb8118cdbe13d8c070b4444674f9f3b4"}},{"ruleId":"D1","level":"warning","message":{"text":"dedup._disambiguate_defining_collisions (cyclomatic 25): dedup._disambiguate_defining_collisions has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/dedup.py"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"4341f43e29457ae93c5106ce38c88cf13e0f2398f8a711291e6b4ecb39a0108d"}},{"ruleId":"D1","level":"warning","message":{"text":"csharp._resolve_cross_file_csharp_imports (cyclomatic 25): csharp._resolve_cross_file_csharp_imports has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/csharp.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3c4eed53d90afb5f7ac73569f5a3a681314602d40ae9f5a1a0db76f69297db"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._python_class_ref (cyclomatic 25): engine._python_class_ref has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":5273}}}],"partialFingerprints":{"codehealthFindingId/v1":"0418fe923b8787b4cd5dfdd6b87433b263d4656701a217fab0ea2e80c0139719"}},{"ruleId":"D1","level":"warning","message":{"text":"llm.extract_files_direct (cyclomatic 25): llm.extract_files_direct has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"507bdea6037407bf3e979a6fd9918f6a379d876f603b198c61adf0b0800e6624"}},{"ruleId":"D1","level":"warning","message":{"text":"watch._rebuild_lock (cyclomatic 25): watch._rebuild_lock has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca176c6a9d6133b2ef00b90b0ebf0c0c6d44e68f3acf4ee377dfa6577443b39"}},{"ruleId":"D1","level":"warning","message":{"text":"detect._env_command_args (cyclomatic 24): detect._env_command_args has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"8068339b26027b2090766029e8545519ec586d65f01f791290d640761b81b0fd"}},{"ruleId":"D1","level":"warning","message":{"text":"detect._is_noise_dir (cyclomatic 24): detect._is_noise_dir has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca172271f9364cc6bd46584d3d26e181684ba8d826afd6419c7537de82c95c0"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._repoint_python_sibling_imports (cyclomatic 24): extract._repoint_python_sibling_imports has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a04d79e44092955294725e357262e927dd6e84080089f923b1846bf6aa252f"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._csharp_broken_escape_offsets (cyclomatic 24): extract._csharp_broken_escape_offsets has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"071cab6c318eb9a50c21186ecfa7cbf088a64799ee76b2a8683a3bdb32cbdeac"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._ts_extra_walk (cyclomatic 24): engine._ts_extra_walk has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4666}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40e665a2b54e553a2c4e0a411a9bc2ba2eef47ebe949194e0b982e52748b442"}},{"ruleId":"D1","level":"warning","message":{"text":"markdown_resolution.resolve_markdown_mentions (cyclomatic 24): markdown_resolution.resolve_markdown_mentions has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/markdown_resolution.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ad88a0b49161a2d260d9a9a412dfdd1417c2f9a6406db47ea18e8f246aa2e8"}},{"ruleId":"D1","level":"warning","message":{"text":"prs.triage_with_opus (cyclomatic 24): prs.triage_with_opus has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/prs.py"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"03eea3802c0ed3b7976c6ae47b5de45f04c7256273378bd39e493732d8b1764c"}},{"ruleId":"D1","level":"warning","message":{"text":"cargo_introspect.introspect_cargo (cyclomatic 23): cargo_introspect.introspect_cargo has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cargo_introspect.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8abdca47b1df932f551f5f7f966c6b0f31d956f418dbad05f56ea96d4f1c4c9"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._zero_node_stamped_code_sources (cyclomatic 23): cli._zero_node_stamped_code_sources has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc2bdfec81db8a8e5a5bcd2dabfd84d0e7d391b501fb32a97ee3b182f85b7db"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._merge_swift_extensions (cyclomatic 23): extract._merge_swift_extensions has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":4148}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6243aac25e42dae77e08bfb3f016ade32d51f0ee2f1f87b0433f1daebb34fd"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze.suggest_questions (cyclomatic 23): analyze.suggest_questions has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"worked/mixed-corpus/raw/analyze.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c03ab9b68ede8226d46635f7347c0bb7d8831e81fff36974c6ab51015a01a62"}},{"ruleId":"D1","level":"warning","message":{"text":"affected.affected_nodes (cyclomatic 22): affected.affected_nodes has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/affected.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"09170a526eb037b4c76b2246cc0f90537afb652372e1c17570fe0f6131285175"}},{"ruleId":"D1","level":"warning","message":{"text":"build._semantic_id_remap (cyclomatic 22): build._semantic_id_remap has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f63b3ab88309561097cb8f2eac22a3dd7ad8bd1f2c9915786cd2291b21a772"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._resolve_go_member_calls (cyclomatic 22): extract._resolve_go_member_calls has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a15c8e2b8131046119afcddd55e5a8538cf16c881707949c3fd22c4751afa10"}},{"ruleId":"D1","level":"warning","message":{"text":"solidity.resolve_solidity_inherited_calls (cyclomatic 22): solidity.resolve_solidity_inherited_calls has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/solidity.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"80665b14afc84fcba5ad08cb1e15723a7ddb9ee1033256d6e10c29ad500fc5ff"}},{"ruleId":"D1","level":"warning","message":{"text":"vbnet.extract_vbnet (cyclomatic 22): vbnet.extract_vbnet has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/vbnet.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4905f2255162461def50635059ed10b7d5e443bc8c6932fefa4280f478ce6e"}},{"ruleId":"D1","level":"warning","message":{"text":"llm._call_claude_cli (cyclomatic 22): llm._call_claude_cli has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cc6c8ff7237e7335a6199d672ca41e92703994715975364073435f9d4c3432"}},{"ruleId":"D1","level":"warning","message":{"text":"llm._extract_with_adaptive_retry (cyclomatic 22): llm._extract_with_adaptive_retry has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8feb13d121437df4e2c2a50b5381d75b24fbe9ad237d1993ed203044563aae"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze.find_import_cycles (cyclomatic 21): analyze.find_import_cycles has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"135c7976f55fe6e5cc7d48c770437aefc147b536bf07be0d42b6fc8e912e3eb7"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._graph_hint (cyclomatic 21): cli._graph_hint has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa7246e8c24deeb5b3f9b921acaa9bc9ac40ed5d32dd00c73d415883d82bc2a"}},{"ruleId":"D1","level":"warning","message":{"text":"dm.extract_dmm (cyclomatic 21): dm.extract_dmm has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dm.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"23628ee3ff0f177152879c6475b3e0a3515572cce0f4f33a42628f347fb50457"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._cpp_collect_type_refs (cyclomatic 21): engine._cpp_collect_type_refs has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7164bc516c0560189e7f6138f3a8a4e36f30b8b56b55488348ada2371fe700a"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._ts_emit_decorator_edges (cyclomatic 21): engine._ts_emit_decorator_edges has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":10636}}}],"partialFingerprints":{"codehealthFindingId/v1":"b693010c4e980c0d4acfed700f8100b6c46b75966b5a1c83ac4295772d62d002"}},{"ruleId":"D1","level":"warning","message":{"text":"go._go_collect_type_refs (cyclomatic 21): go._go_collect_type_refs has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/go.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26554c97909c08cb04e009f7a144f908061f9d44297ca7e7c76e12237db416c"}},{"ruleId":"D1","level":"warning","message":{"text":"markdown._resolve_markdown_link (cyclomatic 21): markdown._resolve_markdown_link has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/markdown.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f280841b01b25fe1371b504f2a4c6026c93a05ad45fa9d74da6e3fb331a7561"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._package_entry_candidates (cyclomatic 21): resolution._package_entry_candidates has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"e283f47fdc47cf766e7cedf9d5b923090fe7906a77cf388b38292ca7c86aaa46"}},{"ruleId":"D1","level":"warning","message":{"text":"prs.render_dashboard (cyclomatic 21): prs.render_dashboard has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/prs.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e4f78d7451538abc82ca68ae3a28bf0e0f8dccf373106d15e75970cef43c69"}},{"ruleId":"D1","level":"warning","message":{"text":"build.graph_has_legacy_ids (cyclomatic 20): build.graph_has_legacy_ids has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e027cd00b33926bcb5805acdf92e32ea91fdd9ea2aa8ad737d8fecb3d1ab47ea"}},{"ruleId":"D1","level":"warning","message":{"text":"cache.load_cached (cyclomatic 20): cache.load_cached has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff40cf533adac2563168ec623d4ed4c41169663e98886292ce6532bd19e279a9"}},{"ruleId":"D1","level":"warning","message":{"text":"cache.scope_semantic_result (cyclomatic 20): cache.scope_semantic_result has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b25c0e28a462f13e9dd60a080cf6b7ada65c50e048c42c8e43e722099fdcba"}},{"ruleId":"D1","level":"warning","message":{"text":"diagnostics.diagnose_extraction (cyclomatic 20): diagnostics.diagnose_extraction has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/diagnostics.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdb24b854cd671b74aaa8d930dc5a447cf81a7ae3a9befb4684e18bfd9c49c8"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._repoint_python_package_imports (cyclomatic 20): extract._repoint_python_package_imports has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"763e776f970d74c12c419fbc14f4b8c759280096cfb3e68188698f4345383161"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._rescue_js_dynamic_imports (cyclomatic 20): extract._rescue_js_dynamic_imports has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":2227}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf826ef893d7e893ce838d49d6bf1b94d3be0e1800bf62586e55653e94c9d78"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._xaml_csharp_class_nodes (cyclomatic 20): extract._xaml_csharp_class_nodes has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":8282}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bccc0a2e36e2a5207aaa32519f1bb7d289873b7d33bcfa078ccdf5740b945bd"}},{"ruleId":"D1","level":"warning","message":{"text":"csharp._build_csharp_type_def_index (cyclomatic 20): csharp._build_csharp_type_def_index has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/csharp.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"003d318aba08c44ba05ce45dddf26d55a0e270b45cf3ee9ee898a4222405c5a7"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._js_scan_member_assignments (cyclomatic 20): engine._js_scan_member_assignments has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2cd584e42e9fcb0e990e10f50e9a5231367c1e845157cc11fe7417a65486f0"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._ruby_extra_walk (cyclomatic 20): engine._ruby_extra_walk has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":5778}}}],"partialFingerprints":{"codehealthFindingId/v1":"5138d3e7728a6d7c03dc33f05a539390e8e8c6ef2ff3ffef310c3e4a9facbf1f"}},{"ruleId":"D1","level":"warning","message":{"text":"markdown.extract_markdown (cyclomatic 20): markdown.extract_markdown has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/markdown.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9d69b1621fce9885907e084d2eb749fb6c97378397b9059c36b6f581433c7b"}},{"ruleId":"D1","level":"warning","message":{"text":"rust._rust_simple_generic_impl_key (cyclomatic 20): rust._rust_simple_generic_impl_key has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/rust.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"008d594777aed1ab0d0b9a18f859abe1076f9981e170af93d3c5056bcfe8a709"}},{"ruleId":"D1","level":"warning","message":{"text":"semantic_cleanup.validate_semantic_fragment (cyclomatic 20): semantic_cleanup.validate_semantic_fragment has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/semantic_cleanup.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"449a1a800ad53f96a14c2c38b0a659db9ff300bca5bd9ad25f297f8bef1ec839"}},{"ruleId":"D1","level":"warning","message":{"text":"graphdb.push_to_falkordb (cyclomatic 19): graphdb.push_to_falkordb has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/exporters/graphdb.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"539309a7dcdcd2d24569a17f90f217abd8a245156339e01d1748a35e2b5ce194"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._bind_member_field_tables (cyclomatic 19): extract._bind_member_field_tables has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5903}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bee8775ce5ea7aae10dc5cccbf08b47638669689f83e935446f0ba20c67da9"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._resolve_kotlin_member_calls (cyclomatic 19): extract._resolve_kotlin_member_calls has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7396}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8b6dbe052658907098438ddd067d925b298a1abf8f86fb8cc00e89e557eb15"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._extract_parallel (cyclomatic 19): extract._extract_parallel has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":9085}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57e63509c66576dc9216bc7e86483b23555287827d335ee11bddb6f1697b80b"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._php_receiver_type_table (cyclomatic 19): engine._php_receiver_type_table has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"8052080ef69f8410957041950508adc09bbfc6356a97f4652580e19ff51a5bf8"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._swift_local_var_types (cyclomatic 19): engine._swift_local_var_types has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3109}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d3e948445c8222a784833548f146f79795450018ccb0297c32ae65674dc0be"}},{"ruleId":"D1","level":"warning","message":{"text":"r.resolve_r_sourced_calls (cyclomatic 19): r.resolve_r_sourced_calls has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/r.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e009c22be43cbcf746201b7b9cc9e3e9695993ef1fd157175e978777da77c4"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._resolve_js_import_path (cyclomatic 19): resolution._resolve_js_import_path has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f1317987588c676148a255d02d307a3393945dfd99f868991228684c46eda2"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._merge_go_package_types (cyclomatic 19): resolution._merge_go_package_types has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":3361}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9594bb153004377241656bbdf53b9bbb018c9d185998722e4ccc05f18dd4ba"}},{"ruleId":"D1","level":"warning","message":{"text":"sln.extract_sln (cyclomatic 19): sln.extract_sln has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/sln.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa832f1c38c895796e474f15f53d16de75211ea4d92e8d47256360429cc52c99"}},{"ruleId":"D1","level":"warning","message":{"text":"global_graph.global_add (cyclomatic 19): global_graph.global_add has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/global_graph.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75f277c15c64745f6b68732a13e8a720c29b0612e6524a8cc92c5d6b00a1cdd"}},{"ruleId":"D1","level":"warning","message":{"text":"symbol_resolution.resolve_python_import_guided_calls (cyclomatic 19): symbol_resolution.resolve_python_import_guided_calls has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/symbol_resolution.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4d476a62b36dc947a8c2ce3de232211374a910d5064531607d9a840a865d03"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze._surprise_score (cyclomatic 18): analyze._surprise_score has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dedf025395c91164497650f727fd4ba60e66cf6071aecaa40892e50342325ee"}},{"ruleId":"D1","level":"warning","message":{"text":"build._alias_index (cyclomatic 18): build._alias_index has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c3d47cc50183bdab900df99cd8eeca43930301d96668c25918e1a463d11d5f"}},{"ruleId":"D1","level":"warning","message":{"text":"export.to_graphml (cyclomatic 18): export.to_graphml has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/export.py"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"0741b17f77aa29341501c171edffd8ea29a1bae1e72db417d80f2d68bbf36428"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._python_absolute_import_alias_files (cyclomatic 18): extract._python_absolute_import_alias_files has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"577ed8af842a4c7ceee70d9e6f131db6369399df6fae5207bffca1b816b37a1f"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._xaml_codebehind_symbols (cyclomatic 18): extract._xaml_codebehind_symbols has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":8133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8b7618f85696154737c7ec57c92990913a5095592f035005bf50c2f167eafe"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._xaml_communitytoolkit_members (cyclomatic 18): extract._xaml_communitytoolkit_members has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":8346}}}],"partialFingerprints":{"codehealthFindingId/v1":"054fda46aa90d1bdb14b8c908b6005ad93ade9110832c390ffa66e70b4186948"}},{"ruleId":"D1","level":"warning","message":{"text":"csharp._resolve_csharp_type_references (cyclomatic 18): csharp._resolve_csharp_type_references has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/csharp.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"a736711603ec80a6009f049fcc2629ad112f565002f57805e6da7b85eca934b5"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._csharp_method_signature (cyclomatic 18): engine._csharp_method_signature has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"271926d16827a3f9de4ac18ec876f92774734bedcd6af6cdf2aecba2fdfaf7d7"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._python_property_reads (cyclomatic 18): engine._python_property_reads has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":2619}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cc075ac2e6184bba5389997136fac9af8584273fae5da121763ec2c164560f"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._csharp_extra_walk (cyclomatic 18): engine._csharp_extra_walk has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4778}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3337449f176f0e54fc09f86feae19cd82255b9a5c28cf22b1149712b9860d4"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._resolve_python_namespace_dir (cyclomatic 18): resolution._resolve_python_namespace_dir has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":2710}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf89f38a094e31ad72c78f4057bc053f511dd4228f7fa3b943b3d4ee53d4b79"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._resolve_cross_file_java_imports (cyclomatic 18): resolution._resolve_cross_file_java_imports has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":3434}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8e841012c240dcabab2e1f0a5048afd97ee6b85c6eeb9bfd3d1e2660a417bb"}},{"ruleId":"D1","level":"warning","message":{"text":"solidity.resolve_solidity_type_references (cyclomatic 18): solidity.resolve_solidity_type_references has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/solidity.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3febc2a934dd5974b2127ee3da43eaaf9ad34cadb8884da58f9f4b55c227974"}},{"ruleId":"D1","level":"warning","message":{"text":"install._agents_uninstall (cyclomatic 18): install._agents_uninstall has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed50e020db923ca1ce066cbb9eb15a46c4f662a7181444ed6825709ff69f8ad"}},{"ruleId":"D1","level":"warning","message":{"text":"__main__._run_cli (cyclomatic 17): __main__._run_cli has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/__main__.py"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"9461a7f0881f85e6a9b2a0e7f7ce3da55b8ffdd213061d900bef743491548346"}},{"ruleId":"D1","level":"warning","message":{"text":"build.prefix_graph_for_global (cyclomatic 17): build.prefix_graph_for_global has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":2857}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd9b50b43e4e3e0fd21223e65f45f7ab21c0ec99a57edb57ab07e72f042864d"}},{"ruleId":"D1","level":"warning","message":{"text":"cross_repo_types.link_shared_type_declarations (cyclomatic 17): cross_repo_types.link_shared_type_declarations has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cross_repo_types.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e782f97e90140dde2cfd7a1cd71d15bfb9024e35db43486f07e1162615c5b6f1"}},{"ruleId":"D1","level":"warning","message":{"text":"export.backup_if_protected (cyclomatic 17): export.backup_if_protected has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/export.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"92003cdfe2c20e4b4146d8bd383b72bbaf7be0ba5f4f749a458edec92bfc871b"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._resolve_csharp_qualified_calls (cyclomatic 17): extract._resolve_csharp_qualified_calls has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6820}}}],"partialFingerprints":{"codehealthFindingId/v1":"026b80adffc06eee9b67e8b845fefdcb4dde2314c72cdaf913bd8a83a6d9d601"}},{"ruleId":"D1","level":"warning","message":{"text":"extract.extract_slnx (cyclomatic 17): extract.extract_slnx has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7816}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bec19398563f68f3acd41b99aed1e1be1fbb03bc4b85452b4e2c88adc48d3e7"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._java_receiver_chain (cyclomatic 17): engine._java_receiver_chain has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a7442415a709d3edae681bf114740d78aced57cd06794cf524606ab460de11"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._php_collect_type_refs (cyclomatic 17): engine._php_collect_type_refs has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"970ffe149e0a23a17ece350b2e40685d672b4ba107eea0c6236fdc302acad3a5"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._python_alias_name (cyclomatic 17): engine._python_alias_name has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedf3b9f9de49f9e436a033abd33df98f6b09a93aa7657471b3eede898ba3408"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._python_pre_scan_underscore_collisions (cyclomatic 17): engine._python_pre_scan_underscore_collisions has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c335310cbca275503a03c17123616f4f54ca8ca93b486f9722879c4c8c1c273"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._swift_attribute_type_name (cyclomatic 17): engine._swift_attribute_type_name has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd76a05332434116e59fcb40a09acf0c4e793f8c4c0022e50f5451e592a5a63"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._scan_python_nested_function_declarations (cyclomatic 17): engine._scan_python_nested_function_declarations has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4048}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc2f9535ad26d0fe39a4922d6766e3b403f1713b69c40738e880cc7645d6d84"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._ts_mark_public_twins (cyclomatic 17): engine._ts_mark_public_twins has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":10517}}}],"partialFingerprints":{"codehealthFindingId/v1":"a370dcaa9ca90bfe5c55da22fb2616e97a8afceff542ab00577fbd746be41dbe"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._resolve_python_module_path (cyclomatic 17): resolution._resolve_python_module_path has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":2637}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3a2dc1b27589cd359b6aa2b2976d4f2058829f782030efb2cb83d5f925fb17"}},{"ruleId":"D1","level":"warning","message":{"text":"vbnet.resolve_vbnet_partial_calls (cyclomatic 17): vbnet.resolve_vbnet_partial_calls has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/vbnet.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e088a59f233c79b020dd8422844ffdf250fef523137d163398c557c9c46248c1"}},{"ruleId":"D1","level":"warning","message":{"text":"verilog._augment_systemverilog_semantics (cyclomatic 17): verilog._augment_systemverilog_semantics has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/verilog.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ce233c855b8a232756bc9f863764fca72f9fc276f01dfa2e9e401180b7f778"}},{"ruleId":"D1","level":"warning","message":{"text":"install._strip_json_comments (cyclomatic 17): install._strip_json_comments has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b3f6c58950309d5ec80c6507f185b16517704b2d84f269f1fd06d2c5f9675a"}},{"ruleId":"D1","level":"warning","message":{"text":"serve._resolve_path_scoped_symbol (cyclomatic 17): serve._resolve_path_scoped_symbol has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eca735ef83b0f9ab5a04ee31a1a71739cb232cda028acde17f21a346fd2fdeb"}},{"ruleId":"D1","level":"warning","message":{"text":"watch._referenced_unscanned_identities (cyclomatic 17): watch._referenced_unscanned_identities has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff05fc484f16c7f598ec2c23b1316da7773a92831d60e89ecb637c76aa2ca2ab"}},{"ruleId":"D1","level":"warning","message":{"text":"wiki.to_wiki (cyclomatic 17): wiki.to_wiki has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/wiki.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"1980415e2439fd233d64bc69bea12f6fa123fbbdc8785eda49ab265b1628ce5c"}},{"ruleId":"D1","level":"warning","message":{"text":"__main__._refresh_v1_opencode_plugins (cyclomatic 16): __main__._refresh_v1_opencode_plugins has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/__main__.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b34c27bc0b79c57c80c522e5720a3e92899831f37b62087ebef9812bf740fa2"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze.graph_diff (cyclomatic 16): analyze.graph_diff has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"73926390427e979a5cfc27d5f95402934e5d3acfdb2f62e71d3a2b18e8cca1f0"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._bash_invokes_search (cyclomatic 16): cli._bash_invokes_search has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"756e4620c2ecd1c5ea14297234d84cbcb0bf8de648ff60250d274fb23c0d85a5"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._canonicalize_csharp_namespace_nodes (cyclomatic 16): extract._canonicalize_csharp_namespace_nodes has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":3731}}}],"partialFingerprints":{"codehealthFindingId/v1":"724a34dcc2f92b0f600636c92c7d94ce600e8697e1a27021811fe7dfcd60b535"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._resolve_kotlin_import_targets (cyclomatic 16): extract._resolve_kotlin_import_targets has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6623}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c58e4773efa4721331ed525e2c4e71a0b5798b6d2d4ddcffe426c353a7f87b"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._resolve_elixir_import_targets (cyclomatic 16): extract._resolve_elixir_import_targets has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7257}}}],"partialFingerprints":{"codehealthFindingId/v1":"4941cd8cf7a0ebf056bd8dd966f4eaa35e10e7e876a49098101c910168862d81"}},{"ruleId":"D1","level":"warning","message":{"text":"extract._resolve_elixir_qualified_calls (cyclomatic 16): extract._resolve_elixir_qualified_calls has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7329}}}],"partialFingerprints":{"codehealthFindingId/v1":"0155a69b99a475eabf57e0202b4d7163e79ed6b096394497e71dace3664c50e9"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._java_method_receiver_types (cyclomatic 16): engine._java_method_receiver_types has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4513eb4b6060bc8bddd97e533f86f4383000827f614bb2abd2604547e6643f4"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._python_fixture_type (cyclomatic 16): engine._python_fixture_type has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":2116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb68418ecb4f78120ec82844c39a5d8dde494d42ad1987b5bf1f11425ebe0f1"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._python_self_attr_bindings (cyclomatic 16): engine._python_self_attr_bindings has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":2693}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe331f0550011ac36e4d1e495c673c029af05f3c5f828d30d8ff51469f847b3"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._ts_field_destructured_from_this (cyclomatic 16): engine._ts_field_destructured_from_this has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3819}}}],"partialFingerprints":{"codehealthFindingId/v1":"b856ece2393c0e11b7783e51b1ab98de0011fcd6bc553bec79487946d21c340c"}},{"ruleId":"D1","level":"warning","message":{"text":"engine._js_member_assignment_target (cyclomatic 16): engine._js_member_assignment_target has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cb0b5fb2f25f2c7620fac7ef1472d9432733f837cfe43e20a193445a21622b"}},{"ruleId":"D1","level":"warning","message":{"text":"go._go_receiver_type_table (cyclomatic 16): go._go_receiver_type_table has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/go.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e326d0650fd72c74598ffdb8e9f579a62f2112ea9cedff914a1b7f5bee24a1"}},{"ruleId":"D1","level":"warning","message":{"text":"objc._objc_local_var_types (cyclomatic 16): objc._objc_local_var_types has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/objc.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1955ed3988a4af56eb54af71676b8ec63e256f49a5809664b6d4dfc6ba9d20"}},{"ruleId":"D1","level":"warning","message":{"text":"resolution._resolve_tsconfig_alias (cyclomatic 16): resolution._resolve_tsconfig_alias has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8fce206a990ee06d32331963a0914f4b9c9fdc871ba8163fd78a2dacea931f"}},{"ruleId":"D1","level":"warning","message":{"text":"terraform.resolve_terraform_modules (cyclomatic 16): terraform.resolve_terraform_modules has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/terraform.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8bd029f931d698373e4923b14976f0653a80ca2fd8de87b73485f249568a55"}},{"ruleId":"D1","level":"warning","message":{"text":"install.install (cyclomatic 16): install.install has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8aeb46ee22dc72df8c34d8343430f4c325441fcaa1e8452d708e24a458b33c"}},{"ruleId":"D1","level":"warning","message":{"text":"llm._bind_node_evidence (cyclomatic 16): llm._bind_node_evidence has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad09ff7d8fb6c4bf47bdab342d0543dadcaf473192bca844bfc3f017a4087467"}},{"ruleId":"D1","level":"warning","message":{"text":"llm._call_ollama_native (cyclomatic 16): llm._call_ollama_native has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b00ed9b7bb32ce7fa9055000212132559c958bf510911c1128d1f7aeaed7f6"}},{"ruleId":"D1","level":"warning","message":{"text":"llm._label_batch_with_retry (cyclomatic 16): llm._label_batch_with_retry has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":3571}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2bf69d920b373aa7898223b7095066e3a946a6175157b2eac7c029c2109239"}},{"ruleId":"D1","level":"warning","message":{"text":"prs.attach_graph_impact (cyclomatic 16): prs.attach_graph_impact has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/prs.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9651c650e4d7b324598ba312cc3ff5742c29cc363cd321837a7cdfc8a4e39f"}},{"ruleId":"D1","level":"warning","message":{"text":"reflect.aggregate_lessons (cyclomatic 16): reflect.aggregate_lessons has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/reflect.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"372b89b81d495c0f227d4335cbcdde256c8934ecb1e3a709946ae83bc3951ff9"}},{"ruleId":"D1","level":"warning","message":{"text":"reflect._render_bucket (cyclomatic 16): reflect._render_bucket has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/reflect.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d082d75dbd3e36574b6ab75fc8a3e6e2748c6977bdece6e2ff6fd823116dcc20"}},{"ruleId":"D1","level":"warning","message":{"text":"serve._trigram_candidates (cyclomatic 16): serve._trigram_candidates has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b87c0ea8c16e36365d9f95be0dcf7808d5a42185910c73c9bdba3b399cf0e48"}},{"ruleId":"D1","level":"warning","message":{"text":"serve._query_graph_text (cyclomatic 16): serve._query_graph_text has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5d66b00d4e9a25bb1c40e9888da98ebf1d6eb02642524f17afcd91793b0524"}},{"ruleId":"D1","level":"warning","message":{"text":"_StoredSourcePaths.__init__ (cyclomatic 16): _StoredSourcePaths.__init__ has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"1662e96f42dba520a56b4a8606e3f402b6dc47f84bae9475424bae3c3a2bb14a"}},{"ruleId":"D1","level":"warning","message":{"text":"watch._reconcile_graph_html (cyclomatic 16): watch._reconcile_graph_html has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ddd46e866c71067747acc8238f1428fff2ee7824f1085ac0fdf9e624e8cd90"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.dispatch_command (cognitive 1652): cli.dispatch_command has cognitive complexity 1652 (threshold 15). Drivers by points: if/else 363 (954 pts), error handling 66 (200 pts), boolean chains 190, loops 57 (154 pts), ternaries 56 (154 pts) (nesting depth added 920). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d7b02adb72c96eb2b673021616604f6b8cfc6fb3e509ffbe7c0ae5471fc654"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.extract (cognitive 788): extract.extract has cognitive complexity 788 (threshold 15). Drivers by points: if/else 217 (536 pts), loops 58 (105 pts), boolean chains 66, error handling 22 (46 pts), ternaries 14 (35 pts) (nesting depth added 411). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":9272}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e66fc96b2b1f9b9d597f3895ec95ab7275fca635e0d3c7eb3738c30f3f01c66"}},{"ruleId":"D2","level":"warning","message":{"text":"build.build_from_json (cognitive 337): build.build_from_json has cognitive complexity 337 (threshold 15). Drivers by points: if/else 88 (230 pts), boolean chains 47, loops 21 (33 pts), error handling 4 (14 pts), ternaries 5 (13 pts) (nesting depth added 172). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"552f0935fee2c7d348782d37b260ad81d40ec0145ae526efc2b644f31f546b33"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._js_extra_walk (cognitive 333): engine._js_extra_walk has cognitive complexity 333 (threshold 15). Drivers by points: if/else 48 (244 pts), loops 7 (42 pts), ternaries 4 (28 pts), boolean chains 19 (nesting depth added 255). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4317}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b4480de0364f8a66ae2afa9dbc4a5ede5b3c14d5ce2610e47eb3cf023821f7"}},{"ruleId":"D2","level":"warning","message":{"text":"dedup.deduplicate_entities (cognitive 309): dedup.deduplicate_entities has cognitive complexity 309 (threshold 15). Drivers by points: if/else 77 (224 pts), loops 20 (47 pts), boolean chains 21, ternaries 6 (13 pts), error handling 2 (4 pts) (nesting depth added 183). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/dedup.py"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"010e502813b03ad98bc9074adeb6d8a8310a450aa7fe9f841b100d9fd05efe67"}},{"ruleId":"D2","level":"warning","message":{"text":"dart.extract_dart (cognitive 279): dart.extract_dart has cognitive complexity 279 (threshold 15). Drivers by points: if/else 60 (165 pts), loops 31 (75 pts), ternaries 6 (19 pts), boolean chains 16, error handling 2 (4 pts) (nesting depth added 164). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dart.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38aec8a8db97ff1c8e8267a7a3c05ecff1ab558be33f46112fdad0829ad98dc"}},{"ruleId":"D2","level":"warning","message":{"text":"watch._rebuild_code (cognitive 257): watch._rebuild_code has cognitive complexity 257 (threshold 15). Drivers by points: if/else 78 (154 pts), boolean chains 37, error handling 16 (30 pts), loops 10 (18 pts), ternaries 11 (18 pts) (nesting depth added 105). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4d3af4598d2f6bce9fe9a26f10dfce9d6423c20d26e4907f7d641e5dd8081d"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._ts_receiver_type_table (cognitive 238): engine._ts_receiver_type_table has cognitive complexity 238 (threshold 15). Drivers by points: if/else 31 (132 pts), ternaries 10 (61 pts), boolean chains 24, loops 8 (21 pts) (nesting depth added 165). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3574}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d60c192cdc478aba0da0b2a05683f5938e8948e19a1075ab801447183e423b"}},{"ruleId":"D2","level":"warning","message":{"text":"solidity.extract_solidity (cognitive 229): solidity.extract_solidity has cognitive complexity 229 (threshold 15). Drivers by points: if/else 52 (178 pts), loops 13 (31 pts), boolean chains 10, ternaries 2 (8 pts), error handling 2 (nesting depth added 150). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/solidity.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"24994055743186e7cd459cd958db048abbef1dc4585edcfcbf66a12aec1ff45c"}},{"ruleId":"D2","level":"warning","message":{"text":"install.dispatch_install_cli (cognitive 215): install.dispatch_install_cli has cognitive complexity 215 (threshold 15). Drivers by points: if/else 83 (165 pts), ternaries 18 (41 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 107). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d65bd1afe59988aa7d49067eecb7a2c05c1e1d0791409421b059d0292c32a8"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._extract_generic (cognitive 183): engine._extract_generic has cognitive complexity 183 (threshold 15). Drivers by points: if/else 66 (119 pts), loops 18 (29 pts), boolean chains 17, ternaries 6 (14 pts), error handling 4 (nesting depth added 72). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":5995}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec23dfe72009b31fdcdba1e45cfe6115e115820bbff12c77566c736747febf86"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._apply_symbol_resolution_facts (cognitive 180): resolution._apply_symbol_resolution_facts has cognitive complexity 180 (threshold 15). Drivers by points: if/else 52 (123 pts), loops 22 (29 pts), boolean chains 20, error handling 3 (6 pts), ternaries 1 (2 pts) (nesting depth added 82). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfc80c0342f94864431157d47a6f62dec4a5ff7f7cf6043c78561132a563a74"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._php_get_route_name (cognitive 158): engine._php_get_route_name has cognitive complexity 158 (threshold 15). Drivers by points: if/else 19 (95 pts), loops 6 (34 pts), ternaries 3 (23 pts), boolean chains 6 (nesting depth added 124). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":5909}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5faa16ae3fd2610a9d4f2ee621a3915ccef8879fa7c1d20a7c5c760ce1f7b73"}},{"ruleId":"D2","level":"warning","message":{"text":"detect.detect (cognitive 157): detect.detect has cognitive complexity 157 (threshold 15). Drivers by points: if/else 37 (114 pts), loops 8 (19 pts), error handling 3 (11 pts), boolean chains 10, ternaries 3 (nesting depth added 96). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cb61e55ebb1cab9d38e7e25291db29c61ddb6c7d508246c5f31d7e6f4fa49c"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._js_find_exported_objects (cognitive 156): engine._js_find_exported_objects has cognitive complexity 156 (threshold 15). Drivers by points: if/else 21 (110 pts), loops 8 (35 pts), boolean chains 11 (nesting depth added 116). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7dc5bbb8398e952495dfcce1b9f88417414928d77dbc273267001c0038a37c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruby_resolution.resolve_ruby_member_calls (cognitive 150): ruby_resolution.resolve_ruby_member_calls has cognitive complexity 150 (threshold 15). Drivers by points: if/else 41 (87 pts), ternaries 9 (27 pts), boolean chains 23, loops 11 (13 pts) (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/ruby_resolution.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a7589ef2be2a27490fc175d927012f769aa7343b98d9b11acc6cbf8cea6af5"}},{"ruleId":"D2","level":"warning","message":{"text":"build.build_merge (cognitive 148): build.build_merge has cognitive complexity 148 (threshold 15). Drivers by points: if/else 49 (105 pts), boolean chains 26, loops 5 (11 pts), ternaries 5 (6 pts) (nesting depth added 63). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"92be3e7a42cb3bdd8d6cc3d35b8fc6c318dd2f99697975e97ad11fd80a254620"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._resolve_python_member_calls (cognitive 147): extract._resolve_python_member_calls has cognitive complexity 147 (threshold 15). Drivers by points: if/else 42 (105 pts), boolean chains 26, loops 10, ternaries 2 (6 pts) (nesting depth added 67). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":4764}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceeab16f7d79f83c40039ab744949e21fa80a2a701d675d0aa9b503662f326d3"}},{"ruleId":"D2","level":"warning","message":{"text":"erlang.extract_erlang (cognitive 135): erlang.extract_erlang has cognitive complexity 135 (threshold 15). Drivers by points: if/else 36 (111 pts), loops 6 (10 pts), boolean chains 8, ternaries 1 (4 pts), error handling 2 (nesting depth added 82). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/erlang.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e17b69672aecb5bc402fc8955c84ceb39865434ff02b423bc876125adebe73"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._import_js (cognitive 122): extract._import_js has cognitive complexity 122 (threshold 15). Drivers by points: if/else 22 (80 pts), loops 6 (24 pts), ternaries 2 (11 pts), boolean chains 4, error handling 1 (3 pts) (nesting depth added 87). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa70a3d64331d7d3574bfb1ff05677cc28c0342a0806d56aa1965e08f443b65e"}},{"ruleId":"D2","level":"warning","message":{"text":"report.generate (cognitive 120): report.generate has cognitive complexity 120 (threshold 15). Drivers by points: if/else 41 (70 pts), ternaries 10 (22 pts), loops 9 (20 pts), boolean chains 8 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/report.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bf178bd278e82c48d4a307181744374c579a3c791050117f53e555216189c8"}},{"ruleId":"D2","level":"warning","message":{"text":"apex.extract_apex (cognitive 119): apex.extract_apex has cognitive complexity 119 (threshold 15). Drivers by points: if/else 26 (93 pts), loops 6 (16 pts), ternaries 2 (6 pts), boolean chains 3, error handling 1 (nesting depth added 81). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/apex.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3537739877350d158c045f4c074dc05e5feb11c9ccfe3d923d2c8b6056e2cd00"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._csharp_method_receiver_types (cognitive 119): engine._csharp_method_receiver_types has cognitive complexity 119 (threshold 15). Drivers by points: if/else 23 (82 pts), loops 8 (24 pts), ternaries 5 (10 pts), boolean chains 3 (nesting depth added 80). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3339}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e734cdd5554612e55e029b85fb952346663ff2421059cd4269533eaf9b6f18"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._import_python (cognitive 108): extract._import_python has cognitive complexity 108 (threshold 15). Drivers by points: if/else 20 (66 pts), ternaries 5 (18 pts), error handling 5 (16 pts), loops 2 (7 pts), boolean chains 1 (nesting depth added 75). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4443f33b1f98423333384b97a16cd5a8fb1579c2b9753a200e3466627edad0"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._collect_js_symbol_resolution_facts (cognitive 104): resolution._collect_js_symbol_resolution_facts has cognitive complexity 104 (threshold 15). Drivers by points: if/else 23 (64 pts), loops 16 (39 pts), boolean chains 1 (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":2213}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda510b0d42eeb5aa67bec1c4ebf41d268d501d3f6b0fbec4c795e3a10346e38"}},{"ruleId":"D2","level":"warning","message":{"text":"html.to_html (cognitive 100): html.to_html has cognitive complexity 100 (threshold 15). Drivers by points: if/else 19 (55 pts), loops 8 (21 pts), ternaries 7 (13 pts), boolean chains 9, error handling 1 (2 pts) (nesting depth added 56). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/exporters/html.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01be57d1f5a92c350211f6dade38239ae4209f176766eb25ec54d7d8d7f073c"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._resolve_typescript_member_calls (cognitive 100): extract._resolve_typescript_member_calls has cognitive complexity 100 (threshold 15). Drivers by points: if/else 30 (60 pts), loops 13 (16 pts), boolean chains 13, ternaries 4 (11 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0126b4cb5fd145044368bf83825f70255d8ba2d7f9f87029943b8acf340e51db"}},{"ruleId":"D2","level":"warning","message":{"text":"watch._reconcile_existing_graph (cognitive 100): watch._reconcile_existing_graph has cognitive complexity 100 (threshold 15). Drivers by points: if/else 31 (75 pts), boolean chains 17, loops 6 (7 pts), error handling 1 (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99a68b0009618c97413a1d67e74aaf42a1bc3e1515dc3b0d31bd4b795c50023"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._resolve_csharp_member_calls (cognitive 98): extract._resolve_csharp_member_calls has cognitive complexity 98 (threshold 15). Drivers by points: if/else 28 (67 pts), boolean chains 13, ternaries 4 (10 pts), loops 6 (8 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5577}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c019dd1f3c6a0616bc5eba6b38a9cbb906c6c107bbe4661fa8156a6925c7950"}},{"ruleId":"D2","level":"warning","message":{"text":"dedup._llm_tiebreak (cognitive 97): dedup._llm_tiebreak has cognitive complexity 97 (threshold 15). Drivers by points: if/else 25 (75 pts), boolean chains 9, error handling 4 (7 pts), loops 4 (6 pts) (nesting depth added 55). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/dedup.py"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2681d55b4c9787ac5329c0eaa36f0ac4ddefc35412271a520ce6a0f3ba2df5"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._resolve_swift_member_calls (cognitive 96): extract._resolve_swift_member_calls has cognitive complexity 96 (threshold 15). Drivers by points: if/else 25 (60 pts), loops 9 (13 pts), ternaries 4 (10 pts), boolean chains 9, error handling 1 (4 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":4563}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ff40fcd2f4a531cf28d76aebd8b65b34ac423b28699b4cc0df8ea201572c35"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._resolve_java_member_calls (cognitive 96): extract._resolve_java_member_calls has cognitive complexity 96 (threshold 15). Drivers by points: if/else 23 (70 pts), boolean chains 12, ternaries 2 (8 pts), loops 5 (6 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83216ba49ba43c595e0014fadc3dd60a1b87ccd0bb5f28dbcbe1c54f50f368f"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._rewire_unique_stub_nodes (cognitive 94): extract._rewire_unique_stub_nodes has cognitive complexity 94 (threshold 15). Drivers by points: if/else 31 (72 pts), boolean chains 12, loops 8 (10 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":3926}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd1acc952fc55c432e05041d11c7893944046578131e58cd42a5d5a09d7a0bd"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.extract_xaml (cognitive 94): extract.extract_xaml has cognitive complexity 94 (threshold 15). Drivers by points: if/else 22 (56 pts), loops 8 (19 pts), boolean chains 9, ternaries 3 (8 pts), error handling 2 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":8413}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53be1a0840846ee847e7fe161446cea3474ae9a249192aa6b5944e6dbdf13b2"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._ts_walk_class_members (cognitive 94): resolution._ts_walk_class_members has cognitive complexity 94 (threshold 15). Drivers by points: loops 12 (41 pts), if/else 12 (38 pts), ternaries 3 (15 pts) (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":2104}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da15d1bc3396e95b8b836958db16dbf8f7e1573f5639e9fcd0b41b9fa8af485"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._kotlin_collect_type_refs (cognitive 91): engine._kotlin_collect_type_refs has cognitive complexity 91 (threshold 15). Drivers by points: if/else 18 (51 pts), loops 7 (22 pts), ternaries 3 (15 pts), boolean chains 3 (nesting depth added 60). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1e4beff147c467704dd12625344f21ba5da480e77f4d7fb6efc699565d172d"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._collect_python_symbol_resolution_facts (cognitive 91): resolution._collect_python_symbol_resolution_facts has cognitive complexity 91 (threshold 15). Drivers by points: if/else 17 (55 pts), ternaries 4 (20 pts), loops 6 (12 pts), boolean chains 4 (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":2786}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3648bed2218d5d1a0428e387630b0a96a1037c3618d823bc5792e8ec54d1fb"}},{"ruleId":"D2","level":"warning","message":{"text":"cache.save_semantic_cache (cognitive 90): cache.save_semantic_cache has cognitive complexity 90 (threshold 15). Drivers by points: if/else 22 (54 pts), loops 8 (14 pts), boolean chains 10, ternaries 3 (8 pts), error handling 1 (4 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd4206716c61a6b652883e005ab9750486f2282b16a15709c6dbc45ab6495d0"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._run_hook_guard (cognitive 90): cli._run_hook_guard has cognitive complexity 90 (threshold 15). Drivers by points: if/else 24 (48 pts), error handling 10 (21 pts), boolean chains 18, loops 1 (3 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3f15ac05bfd1377898720be6d94914860b97533ea0e44e20856cc9adeaa4d1"}},{"ruleId":"D2","level":"warning","message":{"text":"serve._subgraph_to_text (cognitive 90): serve._subgraph_to_text has cognitive complexity 90 (threshold 15). Drivers by points: if/else 18 (46 pts), ternaries 6 (21 pts), loops 7 (14 pts), boolean chains 9 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ecb97f054d03406c85b44604127cd00f26d3dc958b71a74d869d251e52335f"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._resolve_java_type_references (cognitive 86): resolution._resolve_java_type_references has cognitive complexity 86 (threshold 15). Drivers by points: if/else 26 (48 pts), loops 9 (14 pts), boolean chains 13, ternaries 3 (8 pts), error handling 2 (3 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":3715}}}],"partialFingerprints":{"codehealthFindingId/v1":"df51b03c1bafd748a4935a9601c9c85a4dffa9cf129ddd7cd619315af83fb7be"}},{"ruleId":"D2","level":"warning","message":{"text":"terraform.extract_terraform (cognitive 86): terraform.extract_terraform has cognitive complexity 86 (threshold 15). Drivers by points: if/else 14 (45 pts), loops 5 (17 pts), boolean chains 13, error handling 3 (7 pts), ternaries 1 (4 pts) (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/terraform.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfea98b0edc4b512c0d3ca0a0c7e89e72645f297dd27359a4399215ef6fffe64"}},{"ruleId":"D2","level":"warning","message":{"text":"export.to_obsidian (cognitive 85): export.to_obsidian has cognitive complexity 85 (threshold 15). Drivers by points: if/else 17 (33 pts), ternaries 8 (22 pts), loops 12 (21 pts), boolean chains 5, error handling 3 (4 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/export.py"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdca9b24b7d5f19abc85529d8b69451223dc263bf88364313c1b9db405ab9de"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._resolve_objc_member_calls (cognitive 83): extract._resolve_objc_member_calls has cognitive complexity 83 (threshold 15). Drivers by points: if/else 23 (55 pts), loops 9 (12 pts), ternaries 4 (11 pts), boolean chains 5 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6370}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0817689a4e8e71f19c5d6f6dd798e13ca90f2162836c46624feda5357b4fcf"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._resolve_cross_file_imports (cognitive 80): resolution._resolve_cross_file_imports has cognitive complexity 80 (threshold 15). Drivers by points: if/else 18 (51 pts), loops 7 (14 pts), boolean chains 10, ternaries 2 (4 pts), error handling 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":2913}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fdb4b3ea33440366475bb8b5e94b5dd5b61ff8400045e488ff61f9e9bca681"}},{"ruleId":"D2","level":"warning","message":{"text":"dedup._path_qualify_dropped_collisions (cognitive 79): dedup._path_qualify_dropped_collisions has cognitive complexity 79 (threshold 15). Drivers by points: if/else 17 (41 pts), loops 9 (15 pts), ternaries 4 (13 pts), boolean chains 10 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/dedup.py"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b72bec2f4efb27146254c5e3a5c44c543f3d7b242e83851642f0e874ed04cd3"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._csharp_collect_type_refs (cognitive 77): engine._csharp_collect_type_refs has cognitive complexity 77 (threshold 15). Drivers by points: if/else 21 (45 pts), loops 6 (15 pts), ternaries 4 (14 pts), boolean chains 3 (nesting depth added 43). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35ed0755bcec77cab95aec09a9b576660048ce740fd73b6bccbc17b7dfa871c"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._resolve_php_member_calls (cognitive 76): extract._resolve_php_member_calls has cognitive complexity 76 (threshold 15). Drivers by points: if/else 20 (58 pts), loops 6 (7 pts), ternaries 2 (6 pts), boolean chains 5 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5954}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80c8a132211b5376245f9f2c981362f66eeeee8239327476bd8dd70751c00f6"}},{"ruleId":"D2","level":"warning","message":{"text":"sql.extract_sql (cognitive 75): sql.extract_sql has cognitive complexity 75 (threshold 15). Drivers by points: if/else 16 (38 pts), loops 12 (21 pts), ternaries 5 (10 pts), boolean chains 4, error handling 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/sql.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e84f76c542567cf5f983634c76f332a5aca89da213ed388ef090c7b155d21b"}},{"ruleId":"D2","level":"warning","message":{"text":"symbol_resolution.resolve_bash_source_edges (cognitive 75): symbol_resolution.resolve_bash_source_edges has cognitive complexity 75 (threshold 15). Drivers by points: if/else 22 (59 pts), loops 6 (9 pts), boolean chains 4, error handling 1 (3 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/symbol_resolution.py"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"a192c1cfd8a9a7d85dd6bd27122fb211b42e454f66f7c1f69cf2ebc12cf718e5"}},{"ruleId":"D2","level":"warning","message":{"text":"razor.extract_razor (cognitive 74): razor.extract_razor has cognitive complexity 74 (threshold 15). Drivers by points: if/else 20 (59 pts), loops 5 (7 pts), boolean chains 5, ternaries 1 (2 pts), error handling 1 (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/razor.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"600bc74d5a99260ed803e1f89aa3a4a42273b849cb42c2cc9e97e30e8a927d0d"}},{"ruleId":"D2","level":"warning","message":{"text":"cluster.cluster (cognitive 73): cluster.cluster has cognitive complexity 73 (threshold 15). Drivers by points: if/else 26 (46 pts), loops 9 (17 pts), boolean chains 5, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cluster.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9ba3a1f5a71126abc76419675b918c2ed40ca8b5261512e8f852dd2696f16c"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._ts_collect_type_refs (cognitive 72): resolution._ts_collect_type_refs has cognitive complexity 72 (threshold 15). Drivers by points: if/else 17 (39 pts), ternaries 4 (16 pts), loops 5 (13 pts), boolean chains 4 (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfcfcdec9ad8ea030a9bd6413dcfe92ca2b91c1c3614209ca3aa75c0ade6d01"}},{"ruleId":"D2","level":"warning","message":{"text":"cross_repo_calls.link_cross_repo_member_calls (cognitive 68): cross_repo_calls.link_cross_repo_member_calls has cognitive complexity 68 (threshold 15). Drivers by points: if/else 17 (48 pts), loops 4 (12 pts), boolean chains 8 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cross_repo_calls.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"3885dc20f31654a645bf72d3ba2b6ad25e58ac7551274a751b307b34b35ec19f"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._resolve_cpp_member_calls (cognitive 68): extract._resolve_cpp_member_calls has cognitive complexity 68 (threshold 15). Drivers by points: if/else 20 (47 pts), loops 7 (8 pts), boolean chains 7, ternaries 3 (6 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5371}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe6982c2ff6c30e5f97f833f59ce72cdce7c39e214ef7a1f69372bb2d06b1fa"}},{"ruleId":"D2","level":"warning","message":{"text":"cobol.extract_cobol (cognitive 67): cobol.extract_cobol has cognitive complexity 67 (threshold 15). Drivers by points: if/else 19 (50 pts), loops 5 (9 pts), ternaries 1 (4 pts), boolean chains 3, error handling 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/cobol.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"01eee0884985682e0f6a703aeb2cbdd7300cc2ab81b128a52978dbe9b906bee8"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._java_collect_type_refs (cognitive 67): engine._java_collect_type_refs has cognitive complexity 67 (threshold 15). Drivers by points: if/else 16 (33 pts), ternaries 5 (17 pts), loops 5 (12 pts), boolean chains 5 (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da943e8fe25d49f2c066826588f23de4dc29985502c0d72ea4013b7c467d97e"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._disambiguate_colliding_node_ids (cognitive 67): resolution._disambiguate_colliding_node_ids has cognitive complexity 67 (threshold 15). Drivers by points: if/else 20 (44 pts), loops 11 (16 pts), boolean chains 7 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd81b4f5e24b51a5fb631094bd38b2c4e5137e051b9454002ca9cddf0776236"}},{"ruleId":"D2","level":"warning","message":{"text":"detect.save_manifest (cognitive 66): detect.save_manifest has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (36 pts), ternaries 7 (13 pts), boolean chains 8, error handling 3 (5 pts), loops 3 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":2575}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cd2474fc165d0f07684a7d3909304952e06bb02f723d141d1c805d65350f16"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._resolve_c_include_edges (cognitive 66): extract._resolve_c_include_edges has cognitive complexity 66 (threshold 15). Drivers by points: if/else 25 (49 pts), boolean chains 5, loops 3 (5 pts), ternaries 2 (5 pts), error handling 1 (2 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6679}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfba04a37053b738af31a856133860b4f790912a355d9b1db2c7303387ea8bc"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._package_entry_candidates (cognitive 66): resolution._package_entry_candidates has cognitive complexity 66 (threshold 15). Drivers by points: if/else 14 (50 pts), ternaries 1 (7 pts), loops 2 (5 pts), boolean chains 3, error handling 1 (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"750645433605bb8eba485bb21772a56daccae3259aafd61f882ff4a7076294b7"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._csharp_broken_escape_offsets (cognitive 65): extract._csharp_broken_escape_offsets has cognitive complexity 65 (threshold 15). Drivers by points: if/else 15 (42 pts), ternaries 4 (12 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3d41c69167da7e49e0572c1c936bde9395553a5b5045aaa8655e460239bb20"}},{"ruleId":"D2","level":"warning","message":{"text":"llm._call_llm (cognitive 65): llm._call_llm has cognitive complexity 65 (threshold 15). Drivers by points: if/else 27 (41 pts), boolean chains 16, error handling 3 (5 pts), ternaries 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":3041}}}],"partialFingerprints":{"codehealthFindingId/v1":"e700dccb8ee3dcafeca518b388cd55e27d995d86e5509e241b818e6534f7c5cd"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._kotlin_annotation_class_literal_refs (cognitive 64): engine._kotlin_annotation_class_literal_refs has cognitive complexity 64 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 6 (15 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5a7ab44242646e382aea0bdc2687f26bb7cea1a99839c9701bcf6fbd526811"}},{"ruleId":"D2","level":"warning","message":{"text":"detect.detect_incremental (cognitive 63): detect.detect_incremental has cognitive complexity 63 (threshold 15). Drivers by points: if/else 14 (38 pts), ternaries 5 (12 pts), error handling 3 (6 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":2886}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa4cf599500c3692e2429a7094fd34c04b4ab469ea91943685ebff8f924726d"}},{"ruleId":"D2","level":"warning","message":{"text":"export.to_json (cognitive 63): export.to_json has cognitive complexity 63 (threshold 15). Drivers by points: if/else 21 (42 pts), error handling 5 (12 pts), boolean chains 6, loops 2, ternaries 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/export.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bca0be92e1e82506b4022e6f2a074b7c838d4aed7067b31e8f6a86723090fb"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal._extract_pascal_regex (cognitive 63): pascal._extract_pascal_regex has cognitive complexity 63 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 9 (15 pts), ternaries 7 (14 pts), boolean chains 1, error handling 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/pascal.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"6256e433d3cd9f94cde913e8a9725f4bf6c12218ebb22f8633cc221bfa2ba534"}},{"ruleId":"D2","level":"warning","message":{"text":"serve._score_query (cognitive 63): serve._score_query has cognitive complexity 63 (threshold 15). Drivers by points: if/else 14 (39 pts), boolean chains 16, ternaries 4 (5 pts), loops 2 (3 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57525949e8ef7e63695093214824714dab3d2e47c210ca9c505f55278005d38"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._merge_csharp_partial_class_nodes (cognitive 62): extract._merge_csharp_partial_class_nodes has cognitive complexity 62 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 11 (17 pts), boolean chains 5, error handling 2 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":4249}}}],"partialFingerprints":{"codehealthFindingId/v1":"2728fb75d8736f8a6a19396e1ecc161c7479a4d33c440edaeab45d1600c90f11"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._python_collect_type_refs (cognitive 61): engine._python_collect_type_refs has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 5 (12 pts), ternaries 3 (11 pts), boolean chains 4 (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2a1f8cc313ce6f986bf6a3e186e14f0763a9ab5d2abd44dabb5ba76da242f4"}},{"ruleId":"D2","level":"warning","message":{"text":"validate.validate_extraction (cognitive 61): validate.validate_extraction has cognitive complexity 61 (threshold 15). Drivers by points: if/else 14 (36 pts), loops 5 (13 pts), error handling 2 (8 pts), boolean chains 3, ternaries 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/validate.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4d579d35aa274cbf2e288687ad9a76ce3a4907cafd26aef1479849e16e18b0"}},{"ruleId":"D2","level":"warning","message":{"text":"build.finalize_raw_graph_endpoints (cognitive 60): build.finalize_raw_graph_endpoints has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (33 pts), ternaries 5 (13 pts), loops 6 (8 pts), boolean chains 6 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bf5ff377f3783b40f9b49cdc5c92120fa8214698f9fd6e9731bf7731f2ea76"}},{"ruleId":"D2","level":"warning","message":{"text":"build._tier_replacement_sources (cognitive 60): build._tier_replacement_sources has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (41 pts), loops 8 (16 pts), boolean chains 3 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":2141}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2290434769eb7998c3797dff2cb5c105b57867e7d426a983ffb6d98685fd95"}},{"ruleId":"D2","level":"warning","message":{"text":"rust._rust_collect_type_refs (cognitive 59): rust._rust_collect_type_refs has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 5 (13 pts), ternaries 3 (10 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/rust.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"303ba9c88d7a290711ef0b5a754f53c16b3abaea92f5594c550627fbfea76e88"}},{"ruleId":"D2","level":"warning","message":{"text":"llm.extract_corpus_parallel (cognitive 59): llm.extract_corpus_parallel has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (36 pts), loops 5 (8 pts), ternaries 4 (8 pts), boolean chains 7 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":2692}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c73936fb84d6215aebfc7e88557e0d42dcb9c3b1266ad1bc07d7e21c3a086bd"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._resolve_php_type_references (cognitive 58): resolution._resolve_php_type_references has cognitive complexity 58 (threshold 15). Drivers by points: if/else 21 (35 pts), boolean chains 10, loops 5 (6 pts), ternaries 2 (4 pts), error handling 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":3996}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a6cad6d905967ba93df8c1afa3370b2c342c09d580ac69209bcd3c7dea191a"}},{"ruleId":"D2","level":"warning","message":{"text":"sql._scan_sql (cognitive 58): sql._scan_sql has cognitive complexity 58 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 5 (13 pts), boolean chains 12, ternaries 1 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/sql.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c11162b0ddaa9456db94d469c95f6651e62f2bf9c09f6009784f96f3ffad97"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._resolve_kotlin_qualified_calls (cognitive 57): extract._resolve_kotlin_qualified_calls has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (41 pts), loops 5 (8 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6893}}}],"partialFingerprints":{"codehealthFindingId/v1":"684be50147f511ec80e3e0f86f1243c39591b45b38f2fc365bc9dba5b26f2574"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._swift_collect_type_refs (cognitive 57): engine._swift_collect_type_refs has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 6 (14 pts), ternaries 2 (8 pts), boolean chains 2 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef54a304fd6952ddbfdc9ba3abb13b7c46ab92697b1b9e3284809faac1d586e"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._merge_decl_def_classes (cognitive 57): resolution._merge_decl_def_classes has cognitive complexity 57 (threshold 15). Drivers by points: if/else 20 (44 pts), loops 5 (7 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":3209}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0c14c8ac0ec275896b02a4a11ca62076db01afe039a227c37bfa4b90b9e3f5"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._scala_collect_type_refs (cognitive 56): engine._scala_collect_type_refs has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 5 (13 pts), ternaries 2 (7 pts), boolean chains 3 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66a53829ba498811713a0298354fc3cf150f47dd2a6316e30bbe035cf567d2a"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._ts_field_destructured_from_this (cognitive 56): engine._ts_field_destructured_from_this has cognitive complexity 56 (threshold 15). Drivers by points: if/else 8 (40 pts), loops 3 (10 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 41). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3819}}}],"partialFingerprints":{"codehealthFindingId/v1":"8846ed7e36d882a2704409ca9231b583f16df30c2b1227240c380b735b1fe4d3"}},{"ruleId":"D2","level":"warning","message":{"text":"detect._env_command_args (cognitive 55): detect._env_command_args has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (51 pts), boolean chains 3, loops 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69f2376ca54a305fb345311fda6fabcc68f605e2270ad1bf0ab2c0e481b0ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._suppress_ambiguous_python_imports (cognitive 55): extract._suppress_ambiguous_python_imports has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (43 pts), loops 4 (7 pts), boolean chains 5 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1505e1bc02ccb0087a7c01e7db882b29e2e4c3c6e95ddcd3da3713bef44ace0"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze.suggest_questions (cognitive 54): analyze.suggest_questions has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (31 pts), ternaries 4 (11 pts), loops 6 (9 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"391a3518310825aa81ac6057b062b207e829dd93c7c3ff7a60f30f2d89d90746"}},{"ruleId":"D2","level":"warning","message":{"text":"semantic_cleanup.sanitize_semantic_fragment (cognitive 54): semantic_cleanup.sanitize_semantic_fragment has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (39 pts), loops 8 (9 pts), boolean chains 6 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/semantic_cleanup.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85a3a37d7ce315dc899409adfaa727c9db30092ca119723fddc1c9f10afef28"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._ts_extra_walk (cognitive 53): engine._ts_extra_walk has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (39 pts), loops 3 (9 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4666}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4770fb456c444f121028d6890c019019ae0cde5b98f22da038374a2c1ddff9"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._stale_graph_sources (cognitive 52): cli._stale_graph_sources has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (36 pts), loops 4 (7 pts), error handling 4 (6 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ff52e773171c07d7bf90d8ab6bd2da6321a3b7fdc5aa8806005994cefca6c1"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._ejs_mask_non_script (cognitive 52): extract._ejs_mask_non_script has cognitive complexity 52 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 9 (19 pts), ternaries 3 (8 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":2804}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50e48d2ed0b11d28d717fb1aff100f9cdc7f1d79e750a0cacb776d81f17b456"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.extract_csproj (cognitive 52): extract.extract_csproj has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 9, loops 5 (7 pts), error handling 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7902}}}],"partialFingerprints":{"codehealthFindingId/v1":"0411d38366cd51610cfbc9f0181b02f540c001942e0efd860a48b2f6351c38e9"}},{"ruleId":"D2","level":"warning","message":{"text":"vbnet.extract_vbnet (cognitive 52): vbnet.extract_vbnet has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (36 pts), ternaries 1 (6 pts), loops 4 (5 pts), boolean chains 3, error handling 2 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/vbnet.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"715492a916f2bca7b06a3073a46482d0f71566d45a35ac76f5f952670ed34787"}},{"ruleId":"D2","level":"warning","message":{"text":"watch._reconcile_markdown_links (cognitive 52): watch._reconcile_markdown_links has cognitive complexity 52 (threshold 15). Drivers by points: if/else 18 (36 pts), loops 5 (6 pts), error handling 2 (5 pts), boolean chains 4, ternaries 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"828564b7f3b8e947c462f72c798fe3c34d737d54ff460415499d8bc0beeec3e0"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._python_property_reads (cognitive 51): engine._python_property_reads has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (41 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":2619}}}],"partialFingerprints":{"codehealthFindingId/v1":"5047851253241c2e308f97ed4d93951d348fc2b50da22398ad05b92234850de0"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._require_imports_js (cognitive 51): engine._require_imports_js has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 4 (9 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3880}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0165baee2a191f429b7c5f1915b735644a40bd411077758985db59bda275b9b"}},{"ruleId":"D2","level":"warning","message":{"text":"detect.xlsx_extract_structure (cognitive 49): detect.xlsx_extract_structure has cognitive complexity 49 (threshold 15). Drivers by points: if/else 6 (24 pts), loops 5 (17 pts), error handling 4 (8 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb9ebfce16a8d34ff5f7de8a3c69aba50e14e15a08f2d21d8d5e5efac5e68b7"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._scan_python_nested_function_declarations (cognitive 49): engine._scan_python_nested_function_declarations has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (40 pts), loops 2 (5 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4048}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56eebb7ec9b76a9c8515f5e1f35b664d0638aabc321a3a0406a600fdfb8868c"}},{"ruleId":"D2","level":"warning","message":{"text":"build.merge_raw_extraction (cognitive 48): build.merge_raw_extraction has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 9, loops 3 (6 pts), ternaries 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0016e85788689687efd643d407f3082ab46b6df971f89b785030489e6436cfd6"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_introspect.introspect_cargo (cognitive 48): cargo_introspect.introspect_cargo has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (38 pts), loops 3 (4 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cargo_introspect.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9af4726a25b9f8186b4855992109ee23366bcd50bf7ba5b00c9344be84e3b8"}},{"ruleId":"D2","level":"warning","message":{"text":"dedup._disambiguate_defining_collisions (cognitive 48): dedup._disambiguate_defining_collisions has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 6 (10 pts), boolean chains 5, ternaries 2 (5 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/dedup.py"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75d8489ca1372cbc50554903406d90b7db7fff2d4bbfba15117651771c60634"}},{"ruleId":"D2","level":"warning","message":{"text":"CsharpNameResolver.__init__ (cognitive 48): CsharpNameResolver.__init__ has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (35 pts), boolean chains 10, loops 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/csharp.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"7336b9e276e662800bd2b0c6d8ee466d7ee24be88ce775979ac7204023539604"}},{"ruleId":"D2","level":"warning","message":{"text":"gen.main (cognitive 48): gen.main has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 8 (20 pts), ternaries 4 (7 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/skillgen/gen.py"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07a2421763d931d9f5d843f4e58b9ddb2cf2c39339653723a499172e62eb6a7"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._swift_local_var_types (cognitive 47): engine._swift_local_var_types has cognitive complexity 47 (threshold 15). Drivers by points: if/else 8 (31 pts), loops 3 (6 pts), boolean chains 5, ternaries 1 (5 pts) (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3109}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b22e9089470fe0720ef2c436c168cf3c5a84d846216e2e1abbc1f54791473c"}},{"ruleId":"D2","level":"warning","message":{"text":"serve._shortest_path_text (cognitive 47): serve._shortest_path_text has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (25 pts), ternaries 4 (10 pts), loops 4 (8 pts), boolean chains 3, error handling 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"01df14cdc72eee46037ba9a5dc1e4ad4d9cf6c9d2412253490abc5ddc6719e20"}},{"ruleId":"D2","level":"warning","message":{"text":"index.graphify (cognitive 47): index.graphify has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 7, ternaries 4 (6 pts), loops 3 (4 pts), error handling 2 (3 pts) (nesting depth added 14). Most of this is not in the body itself: 2 of the 47 points are its own statements and the rest belongs to one function literal inside it that branches (line 130). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/pi/index.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2266a0de96676070ad1af2b5cc770b3182cddab211790a280a2c61bd55ee01a9"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._zero_node_stamped_semantic_sources (cognitive 45): cli._zero_node_stamped_semantic_sources has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (19 pts), error handling 7 (13 pts), loops 5 (9 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cfc9d236802b0ab4d3e81dd2cbf30d6d5da678fb413092930c84cbca14f04f"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._bind_member_field_tables (cognitive 45): extract._bind_member_field_tables has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 4 (7 pts), boolean chains 5 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5903}}}],"partialFingerprints":{"codehealthFindingId/v1":"f684c67b7df720ddddc9b4fabf2977bad9ef889ea220c6f9996e72671396c4f6"}},{"ruleId":"D2","level":"warning","message":{"text":"go._go_receiver_type_table (cognitive 45): go._go_receiver_type_table has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (32 pts), loops 3 (8 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/go.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74c707a28859041fd1048c25ba87fb3497c1d22a0c695951b6f5dde85d41342"}},{"ruleId":"D2","level":"warning","message":{"text":"interface_dispatch.resolve_interface_dispatch (cognitive 45): interface_dispatch.resolve_interface_dispatch has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 6 (13 pts), boolean chains 6 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/interface_dispatch.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"041c5ba8e7c206c837c022ed970f853ceed410d2f8a0317a08f7a93ea5d8f131"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._csharp_type_parameters_in_scope (cognitive 44): engine._csharp_type_parameters_in_scope has cognitive complexity 44 (threshold 15). Drivers by points: if/else 7 (36 pts), loops 3 (8 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baa905ced99cf163cf7b96f69dc6ba5fa37fb7947c78fb27e63f87cf3d4f271"}},{"ruleId":"D2","level":"warning","message":{"text":"verilog._augment_systemverilog_semantics (cognitive 44): verilog._augment_systemverilog_semantics has cognitive complexity 44 (threshold 15). Drivers by points: loops 8 (21 pts), ternaries 3 (13 pts), if/else 3 (8 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/verilog.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6534745c0e0c24d31b6fa0f8127a43d658965d3d58ca00e01b09114ca6304810"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._ruby_extra_walk (cognitive 43): engine._ruby_extra_walk has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":5778}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe59168fbf833c3fa4a7af4c976bf86ea4e3016cb67324cd137f437e7f0c385c"}},{"ruleId":"D2","level":"warning","message":{"text":"go._go_collect_type_refs (cognitive 43): go._go_collect_type_refs has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 4 (10 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/go.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd36f3545c949cbe5823927410faa8e88c42592878c8269cf09469650b452ce"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._read_tsconfig_aliases (cognitive 43): resolution._read_tsconfig_aliases has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (30 pts), error handling 4 (5 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ace523b7d7d9fc9686d9e70d8b1406ea829a0d22091fffd8f0e4a4e1d998bbb"}},{"ruleId":"D2","level":"warning","message":{"text":"affected.affected_nodes (cognitive 42): affected.affected_nodes has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/affected.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b500edf351869a5d39cd1c8b5666aab4b5428520f27b92f6297dd7b2151b5ee3"}},{"ruleId":"D2","level":"warning","message":{"text":"build._lost_saved_semantic_nodes (cognitive 42): build._lost_saved_semantic_nodes has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 10, ternaries 2 (3 pts), loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98766b14dbfd190ae04a42380f049f5fe61e1e6ed283b0ea814810258be87e7"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._repoint_python_sibling_imports (cognitive 42): extract._repoint_python_sibling_imports has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (33 pts), error handling 3 (5 pts), boolean chains 2, loops 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c0fd64dc59815f7a76dec07db075406f3ede1f4d243b8cd72ebbfbff446216"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._resolve_rust_self_member_calls (cognitive 42): extract._resolve_rust_self_member_calls has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 6, loops 5 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7004}}}],"partialFingerprints":{"codehealthFindingId/v1":"a807bfefb994043443dafbe6f6f09dbdf1248118761a11026294cbf5be6f0604"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.collect_files (cognitive 42): extract.collect_files has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 9, loops 4 (8 pts), ternaries 3 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":11196}}}],"partialFingerprints":{"codehealthFindingId/v1":"812493e70599d74ccd70e30c2edda1473faf29263de4957d9a975231160d4fac"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._php_receiver_type_table (cognitive 42): engine._php_receiver_type_table has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (31 pts), boolean chains 4, loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f191f155d11aa79f087074e82255092ca2d260a8e0472e6e3502b026bc24785"}},{"ruleId":"D2","level":"warning","message":{"text":"serve._find_node_tiers (cognitive 42): serve._find_node_tiers has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 12, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab68dcfc29a2e7d674e321fd7eb78902a911e53def5684538f1c0fa3c6f58a59"}},{"ruleId":"D2","level":"warning","message":{"text":"go._go_type_param_names (cognitive 41): go._go_type_param_names has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 5 (12 pts) (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/go.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d885287b227c15605797e155d324fc19174de078e3671542b604a766378096b"}},{"ruleId":"D2","level":"warning","message":{"text":"_StoredSourcePaths.__init__ (cognitive 41): _StoredSourcePaths.__init__ has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 3 (9 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b1794cabef3a149ff630c62e97c577062192eda16649fe26f2f5710dfee6e2"}},{"ruleId":"D2","level":"warning","message":{"text":"watch._rebuild_lock (cognitive 41): watch._rebuild_lock has cognitive complexity 41 (threshold 15). Drivers by points: error handling 10 (22 pts), if/else 7 (10 pts), loops 2 (4 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdf16f09764b4740e254bdb0dc146fd0085a604bd46ca01bd05e8c94e4feec8"}},{"ruleId":"D2","level":"warning","message":{"text":"cache.scope_semantic_result (cognitive 40): cache.scope_semantic_result has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (30 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4ce74bbda7e74021bff21cf9fb54ccd65c4e5d41b7035cf078ba39d7551895"}},{"ruleId":"D2","level":"warning","message":{"text":"export.to_canvas (cognitive 40): export.to_canvas has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 11 (14 pts), ternaries 4 (7 pts), boolean chains 5 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/export.py"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed604114e2e689760fb7eb801023ad4651b1cbeecf075610d61fc1936a999d85"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._resolve_go_type_references (cognitive 40): resolution._resolve_go_type_references has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 12, loops 4 (5 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":3612}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8caae964cb46acebdc5bb0c3f102cb559cc92bad4f3bb14bde8219cbaa51a0"}},{"ruleId":"D2","level":"warning","message":{"text":"build._semantic_id_remap (cognitive 39): build._semantic_id_remap has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"258f949a42ad27503081e67c8b304dbff156648f20c44feaddcc306fc49c9998"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._cpp_collect_type_refs (cognitive 39): engine._cpp_collect_type_refs has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (24 pts), ternaries 2 (7 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5115ef8728946400e36b5eb7edc97acfaf163bc62941e38f9d40d93e580262b"}},{"ruleId":"D2","level":"warning","message":{"text":"objc._objc_local_var_types (cognitive 39): objc._objc_local_var_types has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (28 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/objc.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"efed82ff47a1906ba9934de53a6daf7afccd89f6283d1f7862bdcca5bc97dfa7"}},{"ruleId":"D2","level":"warning","message":{"text":"symbol_resolution.resolve_python_import_guided_calls (cognitive 39): symbol_resolution.resolve_python_import_guided_calls has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 3 (4 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/symbol_resolution.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba2d17efd36de7fa25309d4765413dc6ab11e61d165f1a2d80d4fa2522273a6"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze.suggest_questions (cognitive 39): analyze.suggest_questions has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 5 (8 pts), ternaries 2 (7 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"worked/mixed-corpus/raw/analyze.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b4dd9797e6af48d60b22b2c88dd3aa38ce9844532204ea2c22d9f93479a20a"}},{"ruleId":"D2","level":"warning","message":{"text":"cache._relativize_source_files_in (cognitive 38): cache._relativize_source_files_in has cognitive complexity 38 (threshold 15). Drivers by points: if/else 5 (20 pts), error handling 3 (10 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8ce617514be91ef2af88e58f656e557979298a33223fdeb83665359345acf2"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._zero_node_stamped_code_sources (cognitive 38): cli._zero_node_stamped_code_sources has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (19 pts), error handling 6 (10 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3b081fd3cc3be98916af8bddfca6d552bc09411e1369521c7d0af917eef214"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._python_absolute_import_alias_files (cognitive 38): extract._python_absolute_import_alias_files has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (17 pts), error handling 5 (12 pts), loops 3 (5 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82fd154fc26132ff248a6d39f2df682c4dfe3e7711487b95dab40df83110807"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._swift_attribute_type_name (cognitive 38): engine._swift_attribute_type_name has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (32 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d58c0a6d69b3f60d38c129e98aafd7ebb0f59b6c94c1e87649f8b0e715e0c9d"}},{"ruleId":"D2","level":"warning","message":{"text":"llm._load_custom_providers (cognitive 38): llm._load_custom_providers has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 2 (5 pts), boolean chains 3, error handling 1 (3 pts), ternaries 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c9218062d4b54fb1111c7d434587c72d771586f9bb29f9f0f7283174f46011"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._python_class_ref (cognitive 37): engine._python_class_ref has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (23 pts), ternaries 4 (9 pts), boolean chains 5 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":5273}}}],"partialFingerprints":{"codehealthFindingId/v1":"883c2b8912f7821b21dc34c2ce819ab4a5857c1c90d6b3f901cbe5096aabe44c"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._ts_emit_decorator_edges (cognitive 37): engine._ts_emit_decorator_edges has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 6 (13 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":10636}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d01a45f86b2e3e73c37a6e433ec2e82d9c3bf4e5d309593349b5abb95fb35f"}},{"ruleId":"D2","level":"warning","message":{"text":"install._platform_skill_destination (cognitive 37): install._platform_skill_destination has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 10 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af3ced70fa8fce65ae986641f2123a7ddccb37423bb9a70cfe6ef3f347954b9"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._rescue_js_dynamic_imports (cognitive 36): extract._rescue_js_dynamic_imports has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (21 pts), error handling 3 (8 pts), boolean chains 3, loops 2, ternaries 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":2227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50185e38b94557a0c1f00f7152c4a8d9668ab0a92c9ca0b8ef7086bbbdc362c"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._scala_type_parameters_in_scope (cognitive 36): engine._scala_type_parameters_in_scope has cognitive complexity 36 (threshold 15). Drivers by points: if/else 5 (25 pts), loops 4 (11 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed86ebc93f083155a325e1247527795a34ba9739d2eaefd9a37f33c3ca259eb4"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._scan_js_nested_function_declarations (cognitive 36): engine._scan_js_nested_function_declarations has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 2 (5 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3977}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4204e593e16a8f8d711245011a39cd004a24226ca25cb7413469fa3f6dc7a5"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._js_scan_member_assignments (cognitive 36): engine._js_scan_member_assignments has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8196f1a043746e879e22e311bf44d92f33e48fc972ec6245b74972df76f750"}},{"ruleId":"D2","level":"warning","message":{"text":"markdown.extract_markdown (cognitive 36): markdown.extract_markdown has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 6 (13 pts), ternaries 3 (6 pts), boolean chains 3, error handling 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/markdown.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1f8b76bdf4e5fa871f07051ad0a239cc19cc46ca19c9075fd6dbdc0f19acc9"}},{"ruleId":"D2","level":"warning","message":{"text":"dm.extract_dmm (cognitive 35): dm.extract_dmm has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 3 (6 pts), boolean chains 2, error handling 1, ternaries 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dm.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbaf2efc5553f8e8dbd11528ac22a6b3011c99a48763172d77d05cfe24feecf7"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._java_method_receiver_types (cognitive 35): engine._java_method_receiver_types has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 5 (10 pts), boolean chains 1, ternaries 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"636bd6b89b42925147fa0fb7d1177859b57e525783bc8a6fbb5318499f87fab8"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._php_collect_type_refs (cognitive 35): engine._php_collect_type_refs has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (21 pts), ternaries 2 (8 pts), loops 3 (6 pts) (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e46dd828830ec5c51aa1bc3b4ced09c229d95ed6df4d57c9bcadc1f956e1c4"}},{"ruleId":"D2","level":"warning","message":{"text":"prs.triage_with_opus (cognitive 35): prs.triage_with_opus has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (8 pts), error handling 4 (6 pts), boolean chains 5, ternaries 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/prs.py"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"987074cc32452e56995c2812033aad1990f6008a4632201f5a1ca15f7c510294"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze.find_import_cycles (cognitive 34): analyze.find_import_cycles has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 4, ternaries 1 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"178e140c23bb53e66f4e82a35ca62ea05e41264e9663d427d697458107095b38"}},{"ruleId":"D2","level":"warning","message":{"text":"build.graph_has_legacy_ids (cognitive 34): build.graph_has_legacy_ids has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 6, loops 2 (4 pts), ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff2cdc418dfea23a58c8d30a4378b118ff7bbef3dd7544cad22f155da655e49"}},{"ruleId":"D2","level":"warning","message":{"text":"detect._is_noise_dir (cognitive 34): detect._is_noise_dir has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bc14eecba4543c8a5bacbb594351f327db35d8dc8692f7c003ca6163824dfe"}},{"ruleId":"D2","level":"warning","message":{"text":"csharp._resolve_cross_file_csharp_imports (cognitive 34): csharp._resolve_cross_file_csharp_imports has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 8, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/csharp.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6df2988b0ef10375b003dfe8020ae395ed6a58505f996431b7ce2c85130627"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._swift_pre_scan (cognitive 34): engine._swift_pre_scan has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 2 (5 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6209ccc8bfd5415f2c38faa2d0c5b69ea36c798862259784a73538402f34562"}},{"ruleId":"D2","level":"warning","message":{"text":"sln.extract_sln (cognitive 34): sln.extract_sln has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 4, error handling 2 (4 pts), loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/sln.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1a93e1d1471987a42fabfb0a01937efe5f6209186df2b677c62d35c7262a08"}},{"ruleId":"D2","level":"warning","message":{"text":"llm._extract_with_adaptive_retry (cognitive 34): llm._extract_with_adaptive_retry has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 5 (11 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5568140a0093d7cdf96e56cf7eab71307ced415d34102de40441c4940a82719"}},{"ruleId":"D2","level":"warning","message":{"text":"build._alias_index (cognitive 33): build._alias_index has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b3a8accb98e444e777fbaf62958fe5a60c0c7f4c7a9aea91db2cecaa1c210d"}},{"ruleId":"D2","level":"warning","message":{"text":"build.prefix_graph_for_global (cognitive 33): build.prefix_graph_for_global has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (21 pts), ternaries 1 (5 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":2857}}}],"partialFingerprints":{"codehealthFindingId/v1":"a239172116d083435b5e0d490f545b63077dafeed65731e334cb728e085a427a"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._bash_invokes_search (cognitive 33): cli._bash_invokes_search has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (8 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d048a127dc0bace861cb63a2a049c5ab6628a53ed61f3c4cebcc9813fac9a38"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._merge_swift_extensions (cognitive 33): extract._merge_swift_extensions has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 5 (6 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":4148}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2168f0dab50ff3f3099468478b352c346811bcfd37607019af0fc63d8c86f2"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._xaml_communitytoolkit_members (cognitive 33): extract._xaml_communitytoolkit_members has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (22 pts), ternaries 2 (5 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":8346}}}],"partialFingerprints":{"codehealthFindingId/v1":"420fa78ab5e2dcfef498fc6dbe3388ca476d03785b24c3b55694f34fe0180e59"}},{"ruleId":"D2","level":"warning","message":{"text":"csharp._build_csharp_type_def_index (cognitive 33): csharp._build_csharp_type_def_index has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/csharp.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bf3f9d8918aa6a6532df2a2bd4a6b54b3695347e9b1b2e0c7f9cacd48d71e7"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._csharp_attribute_names (cognitive 33): engine._csharp_attribute_names has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 3 (7 pts), ternaries 1 (5 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"a335476e8d5410a705ce9b6e8e93908e1439ddcac227ecac5f29c3e6b0c944c8"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._swift_extra_walk (cognitive 33): engine._swift_extra_walk has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 4 (11 pts), ternaries 1 (5 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4854}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc8b1ac1d650af517b2a80d1139cfa1225ad42695bbb00e67a3b52ab79fc564"}},{"ruleId":"D2","level":"warning","message":{"text":"r.resolve_r_sourced_calls (cognitive 33): r.resolve_r_sourced_calls has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 5 (8 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/r.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"101b944ca5d9fcc30d3a3b3d9290416a85a749acc44743ae1203e237eced37e1"}},{"ruleId":"D2","level":"warning","message":{"text":"markdown_resolution.resolve_markdown_mentions (cognitive 33): markdown_resolution.resolve_markdown_mentions has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 6, loops 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/markdown_resolution.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2a42bb010c2d3ddd7e0f90a7874c482a401ffd58bed08a7fa0d3e1debe1d21"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnostics.diagnose_extraction (cognitive 32): diagnostics.diagnose_extraction has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 4, loops 2 (3 pts), ternaries 2 (3 pts), error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/diagnostics.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd90a8c92733b050d75b09755b289eb736e434c8c0b9b442d90a03547bbd32a"}},{"ruleId":"D2","level":"warning","message":{"text":"markdown._resolve_markdown_link (cognitive 32): markdown._resolve_markdown_link has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (23 pts), error handling 2 (4 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/markdown.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"1969c9a003f484959da770c7e6b997a23ef2b897779de9a8fe18c01fd9f8c466"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._resolve_cross_file_java_imports (cognitive 32): resolution._resolve_cross_file_java_imports has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 6 (9 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":3434}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8ff242744f85880a15bfdd5c992e50e640ed218054eab3559f61d131cccbf9"}},{"ruleId":"D2","level":"warning","message":{"text":"__main__._refresh_v1_opencode_plugins (cognitive 31): __main__._refresh_v1_opencode_plugins has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (4 pts), error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/__main__.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85193d9113b74e45d81a9d36b24f235e45d879a3073f99ba7930ba3db7fd3f9"}},{"ruleId":"D2","level":"warning","message":{"text":"cache.load_cached (cognitive 31): cache.load_cached has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 5, error handling 3 (5 pts), ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a298b76af2f5f9c6fa305f8a5d3b186f88d3c6b0be0d3f0d2352ab75a3466a"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._xaml_csharp_class_nodes (cognitive 31): extract._xaml_csharp_class_nodes has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 4 (6 pts), boolean chains 4, error handling 1, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":8282}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0447e05161e585dbf4e8bb428b9dc10accc72ec5b07a31313b53468647fbd0"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._python_pre_scan_underscore_collisions (cognitive 31): engine._python_pre_scan_underscore_collisions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6df5fd30872397acdf6f21ba892bb2a63450dd9dafc0ebe1073d6b8bc9a97ed"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._python_self_attr_bindings (cognitive 31): engine._python_self_attr_bindings has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 5 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":2693}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2f186904d9bf5636f62a435e82572c6639c1702f4742207925a29be6a812ca"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._resolve_tsconfig_alias (cognitive 31): resolution._resolve_tsconfig_alias has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), error handling 2 (5 pts), ternaries 1 (3 pts), loops 2, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17e52688900828b29d8deac23d8418baefe50cce28d4a58abcd8761f7be54e5"}},{"ruleId":"D2","level":"warning","message":{"text":"solidity.resolve_solidity_inherited_calls (cognitive 31): solidity.resolve_solidity_inherited_calls has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 5, ternaries 2 (5 pts), loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/solidity.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f506c27c7b281eda952f8264c8b02ccb46c41a0f2e93c65a5252e4762bc18741"}},{"ruleId":"D2","level":"warning","message":{"text":"vbnet.resolve_vbnet_partial_calls (cognitive 31): vbnet.resolve_vbnet_partial_calls has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/vbnet.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5154943cba04946e8210f6b63337349febc8187144474d1eb79360dee20e25"}},{"ruleId":"D2","level":"warning","message":{"text":"prs.render_dashboard (cognitive 31): prs.render_dashboard has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13, ternaries 4 (12 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/prs.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4a71a0e257127e7511022f1dad47eba206b6564263ea3efd3b94464acd4166"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._resolve_go_member_calls (cognitive 30): extract._resolve_go_member_calls has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 6, loops 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5b0434be6260de4ac608e187b9fd0627ea2818cb7a0a830b8a16d3a65537f4"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._ts_mark_public_twins (cognitive 30): engine._ts_mark_public_twins has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":10517}}}],"partialFingerprints":{"codehealthFindingId/v1":"d639c0ddd78662585e76e43c047c0b6c5f1a89a1944ccc5c53e595873a404389"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._ts_heritage_clause_entries (cognitive 30): resolution._ts_heritage_clause_entries has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 2 (5 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"9461200e85a301d5a13d6526bc0be57cb41b9021231bafbc30259c189af5f556"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._merge_go_package_types (cognitive 30): resolution._merge_go_package_types has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":3361}}}],"partialFingerprints":{"codehealthFindingId/v1":"599f3cc0321381b9e2a604049bcff372979d707b61de8ae0de234c6a191189a8"}},{"ruleId":"D2","level":"warning","message":{"text":"llm._call_openai_compat (cognitive 30): llm._call_openai_compat has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 10, ternaries 4 (7 pts), error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0e247a838b4151b1e84149002d1698c6c64f54987d717ec19617adeedd807a"}},{"ruleId":"D2","level":"warning","message":{"text":"semantic_cleanup.validate_semantic_fragment (cognitive 30): semantic_cleanup.validate_semantic_fragment has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 4 (7 pts), error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/semantic_cleanup.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c575c09b6e0db605d29749cf593da314eb60eee60aa3b9b5a1c13580184bda"}},{"ruleId":"D2","level":"warning","message":{"text":"cross_repo_types.link_shared_type_declarations (cognitive 29): cross_repo_types.link_shared_type_declarations has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (7 pts), boolean chains 6 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cross_repo_types.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b958a9dad8f7b32af2f3952b5f1e3d30b29060c068b4c15b865dbc44e16d780d"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._repoint_python_package_imports (cognitive 29): extract._repoint_python_package_imports has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, loops 3 (4 pts), error handling 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f62e06f70fad7e2fc5530e630d99fa7b9123ebf5bf5082fbfc72f2b6b0540e"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._canonicalize_csharp_namespace_nodes (cognitive 29): extract._canonicalize_csharp_namespace_nodes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":3731}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8a68aba3100d80e43e1e972ac0a6946ae98b81b41af69d431bea5fb5571da1"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._resolve_kotlin_member_calls (cognitive 29): extract._resolve_kotlin_member_calls has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 3, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7396}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb60db0b528f5856fc04d78538b0575829a58e59539715ad402744ebeaaf8fa"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._csharp_method_signature (cognitive 29): engine._csharp_method_signature has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 5 (11 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b19db56853dd101b22cce6d59ad99f63460ee772827f8ed2290afac6b2911b"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._kotlin_annotation_names (cognitive 29): engine._kotlin_annotation_names has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 4 (8 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"322760570cb5f025155df2f7c7ba9a31efddf05dd9728dfc73922d1681cf6453"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._swift_receiver_name (cognitive 29): engine._swift_receiver_name has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (8 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f729704ca715c7ef0eb8f4d2f987deb76a563a54ab06f66ce21570ba33a48b"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._cpp_local_var_types (cognitive 29): engine._cpp_local_var_types has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (23 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3070}}}],"partialFingerprints":{"codehealthFindingId/v1":"862dd4ad53cf2c5915c5fd3ea2712b7fb216554f33a49097a121e43870556212"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._resolve_python_module_path (cognitive 29): resolution._resolve_python_module_path has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 2 (4 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":2637}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0e431fbb4fae5e5eab9606bdb87db525f7a8f4b223c5323536ad1bb0bfedd3"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._resolve_python_namespace_dir (cognitive 29): resolution._resolve_python_namespace_dir has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":2710}}}],"partialFingerprints":{"codehealthFindingId/v1":"9876649926707e10bd940a0e6b407f830c3951c501ad5758848fd95bb52f604b"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._resolve_kotlin_import_targets (cognitive 28): extract._resolve_kotlin_import_targets has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6623}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a343d382fb6fdec358fc15ecf5d8a7f0a0528da537ceb804be6fa3ae4bc19bc"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._kotlin_type_parameters_in_scope (cognitive 28): engine._kotlin_type_parameters_in_scope has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (18 pts), loops 4 (10 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (engine._swift_type_parameters_in_scope, engine._cpp_type_parameters_in_scope) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5aa1f21e63598a5f51cf469c886bb142dd286201d8a681c9457d0682819502"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._swift_type_parameters_in_scope (cognitive 28): engine._swift_type_parameters_in_scope has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (18 pts), loops 4 (10 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (engine._kotlin_type_parameters_in_scope, engine._cpp_type_parameters_in_scope) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a268595faaef76996e58fcefef1f1a89035dcca8ead63ad6eaf9f04f0c2d792"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._cpp_type_parameters_in_scope (cognitive 28): engine._cpp_type_parameters_in_scope has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (18 pts), loops 4 (10 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (engine._kotlin_type_parameters_in_scope, engine._swift_type_parameters_in_scope) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37e4d785fdacf43e4f8f9042cd91aafb444b344318c69cc31937a6a99fe3691"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._resolve_js_import_path (cognitive 28): resolution._resolve_js_import_path has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (7 pts), boolean chains 4, error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23f2fb938f8682c081f232e0074079690811ac28c55d5370dced65bcfaa409f"}},{"ruleId":"D2","level":"warning","message":{"text":"install._strip_json_comments (cognitive 28): install._strip_json_comments has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"83727ecbee47a8307f0bf61cdc8ac34f3932ba60c5f9ea57bc09bb6f87fdff39"}},{"ruleId":"D2","level":"warning","message":{"text":"prs.cmd_prs (cognitive 28): prs.cmd_prs has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 6, loops 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/prs.py"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"d603f781f8835b845cac048f5e0c547b574839b0d5776266cf9790d0f20e92fb"}},{"ruleId":"D2","level":"warning","message":{"text":"serve._trigram_candidates (cognitive 28): serve._trigram_candidates has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"992bf3deee61ff8347b94c2f5ee868df8a7d9dcb18b1868a4149e5e329c26a09"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._extract_parallel (cognitive 27): extract._extract_parallel has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 5 (9 pts), ternaries 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":9085}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee52e6d6104e80e0ef4bce27edce857f78132f486efc47fc11923aaa920428d9"}},{"ruleId":"D2","level":"warning","message":{"text":"csharp._resolve_csharp_type_references (cognitive 27): csharp._resolve_csharp_type_references has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 5, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/csharp.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bbe0a344081db0da2585b171d57f9a074044a043e251851a12991142255577"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._csharp_extra_walk (cognitive 27): engine._csharp_extra_walk has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4778}}}],"partialFingerprints":{"codehealthFindingId/v1":"6612ae8b327639dd56fcdf07a4ca168b8ef89b833b7c0acdb6885456e8aef8bb"}},{"ruleId":"D2","level":"warning","message":{"text":"llm.extract_files_direct (cognitive 27): llm.extract_files_direct has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 7, error handling 1 (2 pts), ternaries 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc3a1d52448ab8d120ede31cc07bf2c9c2c213516c0eb39f8b9953c925239f8"}},{"ruleId":"D2","level":"warning","message":{"text":"reflect.aggregate_lessons (cognitive 27): reflect.aggregate_lessons has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 4 (9 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/reflect.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d001eb214449dae830c4d8d486a7bb1e5525787c87ebd1d7560413f8fdc9b35"}},{"ruleId":"D2","level":"warning","message":{"text":"serve._query_graph_text (cognitive 27): serve._query_graph_text has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"457cb865469b6e17b72ef7bcfc35ba5e3ba4b3d9562f99919476fa03c5710601"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._graph_hint (cognitive 26): cli._graph_hint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, ternaries 3 (5 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd990a5b5a95b9df799aa8c3a14cd92bdb9b8841366e3b65ac3f401d43d21f2"}},{"ruleId":"D2","level":"warning","message":{"text":"dedup._remap_hyperedge_members (cognitive 26): dedup._remap_hyperedge_members has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 2 (8 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/dedup.py"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1b4455bf6b6c86588a91c146e846a0f76fa21f16288a07d658b04056f889f5"}},{"ruleId":"D2","level":"warning","message":{"text":"detect._git_info_exclude (cognitive 26): detect._git_info_exclude has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 2 (6 pts), ternaries 2 (6 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d100fa02b5b1b6f736d65542d068ded0ee63fa4aad2a1d349003e1a601515f"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._xaml_explicit_viewmodel_names (cognitive 26): extract._xaml_explicit_viewmodel_names has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":8208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d62f5d6e0666a7475d746409b52879f482500672b03ca05dc6adc80e7b7deb"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._self_call_target (cognitive 26): engine._self_call_target has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 4 (10 pts), loops 2, boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":2213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb2adabb4cf97994881bffcee0f8982dcaae502e2e1a38400c627ce641d6c4e"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._js_top_level_function_bodies (cognitive 26): resolution._js_top_level_function_bodies has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15dc9b922f71febd4307bd9b36e0f506f9260e36a8795c3b7e09d55d14e4246"}},{"ruleId":"D2","level":"warning","message":{"text":"reflect._render_bucket (cognitive 26): reflect._render_bucket has cognitive complexity 26 (threshold 15). Drivers by points: loops 5 (10 pts), ternaries 3 (9 pts), if/else 6, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/reflect.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aaecc412298515c3fc539e8155df9b6bd69ea219f8d9a76cc4da4d6970dabc4"}},{"ruleId":"D2","level":"warning","message":{"text":"gen._core_to_powershell (cognitive 26): gen._core_to_powershell has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/skillgen/gen.py"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee43b8d85cf1947678de1d95584268879fc83fc6fec7926acfcaf3cb284e055"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.extract_slnx (cognitive 25): extract.extract_slnx has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (4 pts), boolean chains 2, error handling 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7816}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b2480d89239ee958462e6b8aac8e7517ef4d85f2cfa9b64cdb0cffe9aff09c"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._xaml_codebehind_symbols (cognitive 25): extract._xaml_codebehind_symbols has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (5 pts), boolean chains 3, ternaries 2, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":8133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b795fed6589c727c535092e7b23694e71bd16d50a216a76e16cee0073b0c4f4"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._java_type_parameters_in_scope (cognitive 25): engine._java_type_parameters_in_scope has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (20 pts), loops 2 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"826c9f4c6d6ba43bee41e2b44bb700207f118a1502a041d16b3d57af14ec51ee"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._python_alias_name (cognitive 25): engine._python_alias_name has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 7 (10 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c0b18ff6dea8f15bb900abba96483bb9d423c37c49f8928493ff69cb0b3ae1"}},{"ruleId":"D2","level":"warning","message":{"text":"solidity._callee_text (cognitive 25): solidity._callee_text has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 3 (9 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/solidity.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd7b855a8c278361728cfdb6c39b3c6e990d7b63bb0862d4b18c89a4102e578"}},{"ruleId":"D2","level":"warning","message":{"text":"solidity.resolve_solidity_type_references (cognitive 25): solidity.resolve_solidity_type_references has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/solidity.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f578e460d97a8db3473099241cf1f97a73245c838dc270f12b4af02fcf5071"}},{"ruleId":"D2","level":"warning","message":{"text":"prs.attach_graph_impact (cognitive 25): prs.attach_graph_impact has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (7 pts), boolean chains 3, error handling 1 (2 pts), ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/prs.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a017ca9c967bdd3f97983ef65d51379a6b791e6adbc2b7fc56e37c24cc4c5ac5"}},{"ruleId":"D2","level":"warning","message":{"text":"watch._referenced_unscanned_identities (cognitive 25): watch._referenced_unscanned_identities has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (4 pts), boolean chains 3, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ebc4f7f3ba4529a5601a72f6bc49df7fdc61f251bdb5834237f2aa140d34a4"}},{"ruleId":"D2","level":"warning","message":{"text":"cache.file_hash (cognitive 24): cache.file_hash has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 4 (6 pts), loops 1 (2 pts), ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffc9b015201fc46bf4c8518e5ce70295f2484ec3bcfbfe0b3135fce54dd7399"}},{"ruleId":"D2","level":"warning","message":{"text":"export.to_graphml (cognitive 24): export.to_graphml has cognitive complexity 24 (threshold 15). Drivers by points: loops 10 (14 pts), if/else 6 (8 pts), error handling 1 (2 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/export.py"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb91c471660573bc33559a348ce3465812b6ffa2cf3a98110b59b8c46c0cb0b"}},{"ruleId":"D2","level":"warning","message":{"text":"CsharpNameResolver.resolve_type_name (cognitive 24): CsharpNameResolver.resolve_type_name has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/csharp.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a290b333d858b0380f455081ef56effacc0c5d76a3647b8d7faf7f523f51ee8"}},{"ruleId":"D2","level":"warning","message":{"text":"dm.extract_dmf (cognitive 24): dm.extract_dmf has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), boolean chains 3, error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dm.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"28565a76d5b4e9bdf3365b89d0315f0e00a1ab990902f634ed15e3309e27b776"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._java_receiver_chain (cognitive 24): engine._java_receiver_chain has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa64de8e03519fa0e244ce52cf06c13640a087f7aa6ae4b8adc379ff8d06da5"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._python_fixture_type (cognitive 24): engine._python_fixture_type has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 3 (7 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":2116}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a563fe5ed9ec88f706161effb264981ec986d93b78e667db7fc957d7c093d3"}},{"ruleId":"D2","level":"warning","message":{"text":"erlang.resolve_erlang_remote_calls (cognitive 24): erlang.resolve_erlang_remote_calls has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/erlang.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4659afd627591d339112acb15ac9484c78999bf5a9a96858fea8c4c7e3cffb9b"}},{"ruleId":"D2","level":"warning","message":{"text":"global_graph.global_add (cognitive 24): global_graph.global_add has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (5 pts), boolean chains 4, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/global_graph.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74149bd5c40955d99fd9f1d13660504958508e04615e06bca8c378447edb5fa"}},{"ruleId":"D2","level":"warning","message":{"text":"llm._call_claude_cli (cognitive 24): llm._call_claude_cli has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 8, loops 1 (2 pts), ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac69512995498fe2899f90077210eca9cde27558f4a5d5672ad3ad2cd7b8340a"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze._cross_community_surprises (cognitive 23): analyze._cross_community_surprises has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1965fb1141298fc3d0cf60dea578e4dcec8f8aa138e88358e97dcd67e869a4a"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._dynamic_import_js (cognitive 23): engine._dynamic_import_js has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":2955}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1303b456fd99dd4d237c985979e0aa2a40772b5a23d478df2d0aeeb45c4adc5"}},{"ruleId":"D2","level":"warning","message":{"text":"llm._bind_node_evidence (cognitive 23): llm._bind_node_evidence has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d634dbad9eae10a5f377cdaa49cb7737c1e0968a410370913df4ef46aecb71"}},{"ruleId":"D2","level":"warning","message":{"text":"rcfile.load_graphifyrc (cognitive 23): rcfile.load_graphifyrc has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/rcfile.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e52acd3ac4ec2378e7f4b3f3a26700fea8269cc9030edde6ed1b654dc8d59f3"}},{"ruleId":"D2","level":"warning","message":{"text":"reflect._yaml_unescape (cognitive 23): reflect._yaml_unescape has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 2 (8 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/reflect.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21fc056b39465f333c0565b62883c10be0982b7c34dd9777164e2e5f55b9ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"watch._relativize_source_files (cognitive 23): watch._relativize_source_files has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (6 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d0e30833e269759455b37be15e49c88c5ea8ca1b3158b3a63b7fbeca6b9b4f"}},{"ruleId":"D2","level":"warning","message":{"text":"cache._ensure_stat_index (cognitive 22): cache._ensure_stat_index has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (3 pts), error handling 1 (2 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f73b31039a113ac80d48c8c1079acabfcf18258b99864c4c1e770448fb737ef"}},{"ruleId":"D2","level":"warning","message":{"text":"cache._absolutize_source_files_in (cognitive 22): cache._absolutize_source_files_in has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 pts), error handling 2 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"c028edc2507f77ab4ab802cfbfa40dbe391cf9b44494a1537abfc856462074aa"}},{"ruleId":"D2","level":"warning","message":{"text":"graphdb.push_to_falkordb (cognitive 22): graphdb.push_to_falkordb has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (6 pts), error handling 2 (3 pts), loops 3, ternaries 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/exporters/graphdb.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc78adfc0204ea701ded27f2687c93e289133520b21d85e01fadd2b85b001fd6"}},{"ruleId":"D2","level":"warning","message":{"text":"cobol._code_lines (cognitive 22): cobol._code_lines has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/cobol.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad35cda49b0eb9582e0a448f04153bea0c806b0fe516b5e055f64a52b8a08bc5"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._js_member_nid (cognitive 22): engine._js_member_nid has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d967375f22aebf5d46df7482b7dadeab4355f9a6f0d4909e70af10b162733b"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._js_member_assignment_target (cognitive 22): engine._js_member_assignment_target has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a77069881e3838d61f21f429cc7efd84a191ef262346843a7f31aeb1b40ee1d"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._resolve_js_module_path (cognitive 22): resolution._resolve_js_module_path has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b3463e62a950272e90b08faf1df7c17b49126a7e56596b3f998c545fd300ab"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._resolve_lua_import_target (cognitive 22): resolution._resolve_lua_import_target has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (8 pts), error handling 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"46021880ada6e219157edc3181c61f67b0e53713a2765fff894335f4d879443f"}},{"ruleId":"D2","level":"warning","message":{"text":"rust._rust_simple_generic_impl_key (cognitive 22): rust._rust_simple_generic_impl_key has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/rust.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5db55b67b86dd056e41987614530a09865f9f1b75eaab385149026d79376c8a"}},{"ruleId":"D2","level":"warning","message":{"text":"terraform.resolve_terraform_modules (cognitive 22): terraform.resolve_terraform_modules has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/terraform.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa75cd8c521baf7994518dfa0640de818b3283f94727abd8c6b08037bdb20fd"}},{"ruleId":"D2","level":"warning","message":{"text":"serve._pick_seeds (cognitive 22): serve._pick_seeds has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b7324b5e1910ee937a98921e8f4e967a5f8d7442a4151662f300ae4fb4eaf9"}},{"ruleId":"D2","level":"warning","message":{"text":"__main__._run_cli (cognitive 21): __main__._run_cli has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/__main__.py"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"253944a9834d555cfd2475a758412e29f1e2b740c01f69b32db667cd2de69d46"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze.graph_diff (cognitive 21): analyze.graph_diff has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 5 (9 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ce189a2e6dbb32359599540da523d3c0f59a7b942073e3c12a1bc93b7bca11"}},{"ruleId":"D2","level":"warning","message":{"text":"detect._has_build_output_markers (cognitive 21): detect._has_build_output_markers has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts), boolean chains 2, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ce546e0d179d22518a7c557798ea1b3d68cb107e89f5ac46311463e4d6ca59"}},{"ruleId":"D2","level":"warning","message":{"text":"export.backup_if_protected (cognitive 21): export.backup_if_protected has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 3 (6 pts), boolean chains 2, ternaries 2, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/export.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0e55a9a8b0290b1f82b79bce1dfd25be84b8a9879ff5c79e093ca0b181f0df"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._resolve_elixir_import_targets (cognitive 21): extract._resolve_elixir_import_targets has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7257}}}],"partialFingerprints":{"codehealthFindingId/v1":"759a47b7de51411c4d7abaac3af140a82103ef11af0fb80e6535aca8a342dfff"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._resolve_elixir_qualified_calls (cognitive 21): extract._resolve_elixir_qualified_calls has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7329}}}],"partialFingerprints":{"codehealthFindingId/v1":"af678772b5c9f97e36a4d72cb794a227094c540db0d86346dbcf6d3a7d22f027"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._resolve_workspace_import (cognitive 21): resolution._resolve_workspace_import has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb05308c769d74f7b42dd1ee07466cdb0c13b806344464d009c5336c2790ba2"}},{"ruleId":"D2","level":"warning","message":{"text":"sql._routine_body_refs (cognitive 21): sql._routine_body_refs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4, boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/sql.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b20232adb104d83cc0cc00d11a399959d0d2427fe7e9cc36ae84631e2b31fa"}},{"ruleId":"D2","level":"warning","message":{"text":"llm._community_label_lines (cognitive 21): llm._community_label_lines has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":3490}}}],"partialFingerprints":{"codehealthFindingId/v1":"7776a1c48503444864356d1630bc4036bdd086bc8096e0986c6114d0abab3dfc"}},{"ruleId":"D2","level":"warning","message":{"text":"manifest_ingest._parse_gomod (cognitive 21): manifest_ingest._parse_gomod has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 1, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/manifest_ingest.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e618231f675026f30f519b17f3cad935ad42f43d76f48e60f6ec84518d0a2a2"}},{"ruleId":"D2","level":"warning","message":{"text":"serve._query_terms (cognitive 21): serve._query_terms has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8aa0241054abf37280f470744d11c45f94365ce729ce0034ca23e9266e1eb83"}},{"ruleId":"D2","level":"warning","message":{"text":"watch._reconcile_graph_html (cognitive 21): watch._reconcile_graph_html has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afe8a8d125fc056a0f0c530c852fa865a2f12f74b677e70f5a93dfc0ff4ea34"}},{"ruleId":"D2","level":"warning","message":{"text":"__main__._check_skill_version (cognitive 20): __main__._check_skill_version has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 5 (6 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/__main__.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc2b0360221f1b0ea5781a8fcfd98bca46a22000aba4a39493463c5ff2a27a5"}},{"ruleId":"D2","level":"warning","message":{"text":"__main__._refresh_stale_skills (cognitive 20): __main__._refresh_stale_skills has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 2 (4 pts), loops 2, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/__main__.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ce69fb2a10795973e4452ee5ff95759b30315232c859fd096a9c7f0cb0a258"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze._cross_file_surprises (cognitive 20): analyze._cross_file_surprises has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 2, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0d1f1acd6936ac17feb07163a6e3a509c9e383b840933363ef61ce784f61aa"}},{"ruleId":"D2","level":"warning","message":{"text":"build._coerce_non_string_ids (cognitive 20): build._coerce_non_string_ids has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a211c2b644a652fd88e87fc2cd3f6ffdd7a4bffc377bd385ce7660a6f7967c9"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._search_hint_terms (cognitive 20): cli._search_hint_terms has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17769b77a51c14d7c1a2068a734f34851793b8eee2022d5b1f1d515b6bb6d3c"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._resolve_csharp_qualified_calls (cognitive 20): extract._resolve_csharp_qualified_calls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6820}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b44dc6c5f868fc06a6b90306a4679bcca06598dd7c509a98122fe2975599cf9"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._csharp_deferred_call (cognitive 20): engine._csharp_deferred_call has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3305}}}],"partialFingerprints":{"codehealthFindingId/v1":"1791de9ce5f80b7240da55a9ffe7fcfd5877734bd1dba63d7cf12788f07ee53c"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._cpp_extra_walk (cognitive 20): engine._cpp_extra_walk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4994}}}],"partialFingerprints":{"codehealthFindingId/v1":"725474f9409c0daa6a8b4d7af0889f5b3aaf05a3da37d8ef1325f4426a4ca468"}},{"ruleId":"D2","level":"warning","message":{"text":"llm._label_batch_with_retry (cognitive 20): llm._label_batch_with_retry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, error handling 2 (3 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":3571}}}],"partialFingerprints":{"codehealthFindingId/v1":"749cc6b067a5b396502b08080f24bb9ac37a2e334a57fccc262f67c3da70a8dd"}},{"ruleId":"D2","level":"warning","message":{"text":"pascal_resolution.resolve_pascal_inherited_calls (cognitive 20): pascal_resolution.resolve_pascal_inherited_calls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/pascal_resolution.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a70b0c87c26fd0c3932cbffae719a009b724e2574b0144b7b9337815725dfee"}},{"ruleId":"D2","level":"warning","message":{"text":"pg_introspect.introspect_postgres (cognitive 20): pg_introspect.introspect_postgres has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4, boolean chains 3, ternaries 1 (3 pts), error handling 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/pg_introspect.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d9e58bed32e3b974163fe5fe769160599f197924626ae92556c6c7a15bd8df"}},{"ruleId":"D2","level":"warning","message":{"text":"report._learning_section (cognitive 20): report._learning_section has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 2 (6 pts), boolean chains 5, if/else 5, loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/report.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"273da2857286d4c2365638abf8f1ed9e815a824e8a97a639bf9d639285011383"}},{"ruleId":"D2","level":"warning","message":{"text":"scip_ingest._emit_relationships (cognitive 20): scip_ingest._emit_relationships has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/scip_ingest.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9760c2f037a57aae71ca334ff9bd5c47dbb7f59b810974573414644f75acd824"}},{"ruleId":"D2","level":"warning","message":{"text":"symbol_resolution.resolve_cross_file_raw_calls (cognitive 20): symbol_resolution.resolve_cross_file_raw_calls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/symbol_resolution.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df873dd79a024f0bf0718a2f5c018c69e3307113c7f429f4bfcd5f83b553c5d"}},{"ruleId":"D2","level":"warning","message":{"text":"watch._canonical_topology_for_compare (cognitive 20): watch._canonical_topology_for_compare has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d318f29fb6e1774afde48069eeec61c50c6ddaa4d0bb8852afef6a0452a9141"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze._surprise_score (cognitive 19): analyze._surprise_score has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7, boolean chains 6, ternaries 4 (6 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"266d701c2f8dec153df5626305932631063b95090a1f57944ccc2bc10c076004"}},{"ruleId":"D2","level":"warning","message":{"text":"detect.docx_to_markdown (cognitive 19): detect.docx_to_markdown has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), error handling 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"583480494c538592f1303ce17d130dba1751eae73491c137ba51f20d7c02ada7"}},{"ruleId":"D2","level":"warning","message":{"text":"detect.xlsx_to_markdown (cognitive 19): detect.xlsx_to_markdown has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 pts), ternaries 1 (3 pts), error handling 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8b0ddc2d4ba27e8cfc61821a79c0192de127f3ebe4c87f4a26180459b856e0"}},{"ruleId":"D2","level":"warning","message":{"text":"detect._load_graphifyignore (cognitive 19): detect._load_graphifyignore has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (6 pts), ternaries 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"902c74b9d2e7f65c01acc68cdc4347e860aae6c7763c73f1e2a43d2fbefcd6ed"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._kotlin_user_type_name (cognitive 19): engine._kotlin_user_type_name has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b29141b46851281b9aa978a288dd7207f7fcc2ad935aed53453f58e1077b19b"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._python_untouched_params (cognitive 19): engine._python_untouched_params has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":2155}}}],"partialFingerprints":{"codehealthFindingId/v1":"af65bfecd9752f90b55578d4fa7929f927ab69b5d8b87cd578950241536cd088"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._lexical_call_target (cognitive 19): engine._lexical_call_target has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 2 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"996369b4af7b2065df71f8efc6917e4fa8c8fdbf815a9db76c16a9985ec55944"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._csharp_loop_element_types (cognitive 19): engine._csharp_loop_element_types has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1d62d339783a0a147fe9d206817bde17293922fd7f2bacbb6fb0426632b52c"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._ts_attach_class_fields (cognitive 19): engine._ts_attach_class_fields has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (6 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3773}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a100f181a599c7c10bf4004aa2d28afa9bde17b1d8e76e3bc926d80811551a"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._scala_extra_walk (cognitive 19): engine._scala_extra_walk has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4890}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9aa504efd0bbc849875de6e84d4b496086350374ddbbf4770165957de2da98e"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._go_import_path_for_file (cognitive 19): resolution._go_import_path_for_file has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 3 (4 pts), ternaries 3 (4 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":3564}}}],"partialFingerprints":{"codehealthFindingId/v1":"573d4b00711492c6a828eb13950035c562891f1350adcb0398b48162f0bb072e"}},{"ruleId":"D2","level":"warning","message":{"text":"llm._parse_llm_json (cognitive 19): llm._parse_llm_json has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 2 (3 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8925fc9fb0c7db58c1dc1d48f0b7ed1c7dc0d6df62accb1875b7205296e4f00"}},{"ruleId":"D2","level":"warning","message":{"text":"llm.detect_backend_with_source (cognitive 19): llm.detect_backend_with_source has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":3398}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e6bc8918f10bfecca770c840f37008147cb5c00a9861a6543fba2a688bfe22"}},{"ruleId":"D2","level":"warning","message":{"text":"llm.generate_community_labels (cognitive 19): llm.generate_community_labels has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":3775}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f13bea7bb001accf8cabab0e7bc23196effe80ed99b4dd48b3b861f97513fa"}},{"ruleId":"D2","level":"warning","message":{"text":"paths.os_replace_with_fallback (cognitive 19): paths.os_replace_with_fallback has cognitive complexity 19 (threshold 15). Drivers by points: error handling 6 (10 pts), if/else 5 (7 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/paths.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9930101c7448db729921888f5802ebc6e44578f060c8c5f0956f6dc03860087"}},{"ruleId":"D2","level":"warning","message":{"text":"reflect._load_node_community (cognitive 19): reflect._load_node_community has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 3 (4 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/reflect.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7cde03295d8fbf462a433a495f8288c4ee536ace73c98d3f9569a79d5f7f6d"}},{"ruleId":"D2","level":"warning","message":{"text":"scip_ingest.ingest_scip_json (cognitive 19): scip_ingest.ingest_scip_json has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/scip_ingest.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb03918482fa9601e3a9b879e978853d2316b8082b78349c75fb550cda954ce"}},{"ruleId":"D2","level":"warning","message":{"text":"_StoredSourcePaths._anchors_stored_sources (cognitive 19): _StoredSourcePaths._anchors_stored_sources has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 2 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"f430cc5c67194e46c397cb338679be4ea82a2d8f6c01d7da4261ea0d98f3320a"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze.graph_diff (cognitive 19): analyze.graph_diff has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 6 (8 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"worked/mixed-corpus/raw/analyze.py"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"274b421a02519a3cf76f7bd9f4d7292ac3a1cd5a20a728b32bdaed8c035c77f4"}},{"ruleId":"D2","level":"warning","message":{"text":"build.build (cognitive 18): build.build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5c84758e005336b68fb441afc680152c34a106c61dd7b74804dd7fc40134b1"}},{"ruleId":"D2","level":"warning","message":{"text":"cache._flush_stat_index (cognitive 18): cache._flush_stat_index has cognitive complexity 18 (threshold 15). Drivers by points: error handling 6 (9 pts), if/else 3 (4 pts), ternaries 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33fa7a5a5b5b57e630d78de330ee09edff90151d9963e526465832560e8a6d0"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._drop_shadowed_csharp_partial_bases (cognitive 18): extract._drop_shadowed_csharp_partial_bases has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":4447}}}],"partialFingerprints":{"codehealthFindingId/v1":"261cd8ec75715a65533993e976639db5f4da14e97527bf9ba310ec1cd584b4aa"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._kotlin_extra_walk (cognitive 18): engine._kotlin_extra_walk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":5093}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b799d0a31540946fb355202ecc3c1c0cedc6526e9c121ae39196a2f02b191c"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._python_local_class_bindings (cognitive 18): engine._python_local_class_bindings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":5320}}}],"partialFingerprints":{"codehealthFindingId/v1":"16614da172d19cb59b49964e0079ca8e990becb319eb452006e45577f22d5074"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._load_workspace_packages (cognitive 18): resolution._load_workspace_packages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 1 (3 pts), loops 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efbcf4df2d2e71ba7d91683ebeee7ee22c522d362baad0ed47f4b28222f213f"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._resolve_package_import (cognitive 18): resolution._resolve_package_import has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, ternaries 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"127fd0dd52b862c359b52b9f1efbd141771bcc54eddb3cd416736c515fc9741a"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._js_exported_declaration_names (cognitive 18): resolution._js_exported_declaration_names has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"25070d71b3e41a302f5fb5e8ae5314970251be2fdb7f77486b697de83c57c8b7"}},{"ruleId":"D2","level":"warning","message":{"text":"rust.extract_rust (cognitive 18): rust.extract_rust has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3, boolean chains 2, error handling 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/rust.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e31d812d12bfb4868c4b682ea10a3bc5e8c6dbe52346b19eee15042c2bcb27"}},{"ruleId":"D2","level":"warning","message":{"text":"install.install (cognitive 18): install.install has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab088e4ecd54795c3c36d0f75466104f1e06e01413b9bf1ac4ec143163d5167"}},{"ruleId":"D2","level":"warning","message":{"text":"manifest_ingest._parse_apm_fallback (cognitive 18): manifest_ingest._parse_apm_fallback has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/manifest_ingest.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"613a1f2f5b9c9e7ebb021d57b035e7ee4b14b47a620d000b1be4ca47d82751f1"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_ingest.extract_mcp_config (cognitive 18): mcp_ingest.extract_mcp_config has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 3, boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/mcp_ingest.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c669755cfebb010e28c2435c2085c4bd5a0190d0448374c9c9ba2af64fdac493"}},{"ruleId":"D2","level":"warning","message":{"text":"serve._resolve_path_scoped_symbol (cognitive 18): serve._resolve_path_scoped_symbol has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 11, if/else 3 (5 pts), loops 1, ternaries 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d9979018002a78cb3006f52d23868dac127cef2c392bfb7d441cfe74641826"}},{"ruleId":"D2","level":"warning","message":{"text":"tree_html.build_tree (cognitive 18): tree_html.build_tree has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/tree_html.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ad7dae8198ce6efdc7b55549945286c5798b4b4fc974a1bb0a9ec8f11762fb"}},{"ruleId":"D2","level":"warning","message":{"text":"wiki.to_wiki (cognitive 18): wiki.to_wiki has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 5, boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/wiki.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f3707a0a069911c3260f9222118463891224bf0c43dd8b0047f220655f5692"}},{"ruleId":"D2","level":"warning","message":{"text":"build._fold_confidence (cognitive 17): build._fold_confidence has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 1 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba7d5064c7e6c47de27cc4c0704131f79377bec4851c2a1d03ca9e1b99d7c59"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._clone_repo (cognitive 17): cli._clone_repo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4e59a296ee23ff67eaf558bd94f27247a0563a39413bc4990cb9742489395b"}},{"ruleId":"D2","level":"warning","message":{"text":"cluster.remap_communities_to_previous (cognitive 17): cluster.remap_communities_to_previous has cognitive complexity 17 (threshold 15). Drivers by points: loops 7 (9 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cluster.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd840ece40da58a5273e7a1cb9be13982b689a144e50f7ade1517ce9e8880e8"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._import_c (cognitive 17): extract._import_c has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bff4d00e94922ae40043cc06e320a704accba1b658114f3002e3e05e4e0155"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._extract_spock_fallback (cognitive 17): extract._extract_spock_fallback has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e1f7fa914bcda16ee8d4115834476d082205af7afca6321b52e5c10c1cd13b"}},{"ruleId":"D2","level":"warning","message":{"text":"extract.extract_lazarus_package (cognitive 17): extract.extract_lazarus_package has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 2, loops 2, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7702}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c9532cf84f3fe83cc7863d09d2073e413ca42f4fb1ba933082a39bdccf2a8a"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._xaml_binding_refs (cognitive 17): extract._xaml_binding_refs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":8090}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d061c0bfe30c6f9266b41daa2e78482b21d1452b54b72c260a1e0cf7ea38991"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._get_extractor (cognitive 17): extract._get_extractor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":8927}}}],"partialFingerprints":{"codehealthFindingId/v1":"3880d076929b5c1f696530960bba608efc03a6f8e70ed3f36382384d72851280"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._lexical_class_bases (cognitive 17): engine._lexical_class_bases has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":2280}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5dbc37ad73e1475c735b1e244e581bd8ee69c1815b1f4c573b785ceeaa19266"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._js_dispatch_value_idents (cognitive 17): engine._js_dispatch_value_idents has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":2928}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34ac7117da28c119482884a72283024dd3e08c1567ea5342af29b5f01cecf9e"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._cpp_alias_names (cognitive 17): engine._cpp_alias_names has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, loops 2, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4955}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0b43de7782a7c0215200d11c2a8671082120d74952fe5c82e35199fd5e1215"}},{"ruleId":"D2","level":"warning","message":{"text":"go.extract_go (cognitive 17): go.extract_go has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 4, loops 4, error handling 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/go.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"13dbf5f3aadae5903182ac20a7d51d6874b2edc0290847ce3705b663e93d50ee"}},{"ruleId":"D2","level":"warning","message":{"text":"markdown._vault_lookup (cognitive 17): markdown._vault_lookup has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 1 (2 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/markdown.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"243596bfdcef82b05792884c8f8aefffc45b6339635fe4470e5935b55b069890"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._python_import_from_module (cognitive 17): resolution._python_import_from_module has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":2462}}}],"partialFingerprints":{"codehealthFindingId/v1":"7931a521478efb37fcb35ddc72d5e53c01c2617cb20c0de2581efa002ab0f00e"}},{"ruleId":"D2","level":"warning","message":{"text":"hooks._install_hook (cognitive 17): hooks._install_hook has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 2 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/hooks.py"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef87789dc33ef3ea1fa2c8dab8015d97f9d05f74473e4ea30b295d51c026d86"}},{"ruleId":"D2","level":"warning","message":{"text":"install._agents_uninstall (cognitive 17): install._agents_uninstall has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6cf3180635ee0ffd701d2aba2db2d49a3c339d41de84370b6d6c4521eb4e77"}},{"ruleId":"D2","level":"warning","message":{"text":"interface_dispatch._overload_pairs (cognitive 17): interface_dispatch._overload_pairs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/interface_dispatch.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f101818dc4686211a941d9ed78f4fe6ee0d66924bc65892ed0d4d2cf00fe297d"}},{"ruleId":"D2","level":"warning","message":{"text":"manifest_ingest._parse_pyproject (cognitive 17): manifest_ingest._parse_pyproject has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 5, ternaries 4, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/manifest_ingest.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bea4dc1453262c660ef67e65669eb1b389995428c1e3e404198edef20f5902"}},{"ruleId":"D2","level":"warning","message":{"text":"manifest_ingest._parse_pom (cognitive 17): manifest_ingest._parse_pom has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (4 pts), boolean chains 3, loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/manifest_ingest.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6957d457532960053cd8a0fa101c66f67a00a58cc1659c942fc1a7f2d99f91b"}},{"ruleId":"D2","level":"warning","message":{"text":"tree_html._attach_files (cognitive 17): tree_html._attach_files has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (4 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/tree_html.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"937ca4cb3e1248740ec3aca1cdc31505ea4dcc9d5f20386985ba77f6fc953bb7"}},{"ruleId":"D2","level":"warning","message":{"text":"wiki._community_article (cognitive 17): wiki._community_article has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (6 pts), if/else 5, boolean chains 4, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/wiki.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40cb0bac312ab6e006f5883b96c860e55b5adc871be8dc2e18c7ebc293150a5"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze._cross_community_surprises (cognitive 17): analyze._cross_community_surprises has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"worked/mixed-corpus/raw/analyze.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"020d75d99116f7c17e0d928c43db73393d9879c64958f821f5b692a3902066ca"}},{"ruleId":"D2","level":"warning","message":{"text":"build.deduplicate_by_label (cognitive 16): build.deduplicate_by_label has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ee1476a64936272c561781d4046d1646b8fabef6de025d7898152650b1a815"}},{"ruleId":"D2","level":"warning","message":{"text":"detect._git_tracked_path_keys (cognitive 16): detect._git_tracked_path_keys has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d193a535a98014cb3c752fa727f7a229043850bce8e33c2addc95e2d487583"}},{"ruleId":"D2","level":"warning","message":{"text":"extract._import_kotlin (cognitive 16): extract._import_kotlin has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e525515f604607b99ff2229a335186b41fb5823ee53fc803d57feccc7c60f58"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._java_bound_names (cognitive 16): engine._java_bound_names has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cedc08cf9dbe1e0230597a0ccd617d07948f2a30ff460d9d11f4c2acdd3ca6"}},{"ruleId":"D2","level":"warning","message":{"text":"engine._csharp_element_type_name (cognitive 16): engine._csharp_element_type_name has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4c45bd374cc4059117532e927eb5d1383adeaf4c8295fdbeacf8c39b31c60c"}},{"ruleId":"D2","level":"warning","message":{"text":"resolution._pnpm_workspace_globs (cognitive 16): resolution._pnpm_workspace_globs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed5cc811e9b4f1e347a8e8c14fddea13d10212ddd8eb18ab64a27948e59f70f"}},{"ruleId":"D2","level":"warning","message":{"text":"install._drop_opencode_config_entry (cognitive 16): install._drop_opencode_config_entry has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 2, boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c82a6bd7c90d3f03aada545b68116e11728a8d5d05e12f9c11f6a8d5e0ed1dd"}},{"ruleId":"D2","level":"warning","message":{"text":"llm._call_ollama_native (cognitive 16): llm._call_ollama_native has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, error handling 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be98b541423b8c083430a0b3d2c6de5077042e8a2e02c1124493e2287a75e9e"}},{"ruleId":"D2","level":"warning","message":{"text":"llm._parse_label_response (cognitive 16): llm._parse_label_response has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":3531}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae24fc8f36f08142403cd821ec8dcb735b6cd0297d54e9da076a67e8a0d1d3b3"}},{"ruleId":"D2","level":"warning","message":{"text":"multigraph_compat._probe_node_link_round_trip (cognitive 16): multigraph_compat._probe_node_link_round_trip has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/multigraph_compat.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce2cfe8eec0c44fdbb6e86b5e40346349617d145a522520b1c45b7c4ef5768f"}},{"ruleId":"D2","level":"warning","message":{"text":"paths.disambiguate_ambiguous_candidates (cognitive 16): paths.disambiguate_ambiguous_candidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/paths.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd61fa58a473497a9e9a81badc3d2312ffd5267171e481c6c66f0d59361d72e"}},{"ruleId":"D2","level":"warning","message":{"text":"security.validate_url (cognitive 16): security.validate_url has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/security.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"49deb379ef3d94f13c41b22a76e2619953c68186824b3833152515d9e3a965de"}},{"ruleId":"D2","level":"warning","message":{"text":"serve._compute_idf (cognitive 16): serve._compute_idf has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 3 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b3642c82fd320f38ac41b49cd182a930f9262190617172f10177c2dd35ecd8"}},{"ruleId":"D2","level":"warning","message":{"text":"serve._bfs (cognitive 16): serve._bfs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f52b574bd03abc2c2462790b94736dac9172877421e89aad5d55bd54b174f7"}},{"ruleId":"D2","level":"warning","message":{"text":"watch._rebase_relative_source_files (cognitive 16): watch._rebase_relative_source_files has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 2 (5 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bdc5145c90246117f3ad2cc1abc939715409bf61a916946305c06bfb223d26"}},{"ruleId":"D2","level":"warning","message":{"text":"watch._check_shrink (cognitive 16): watch._check_shrink has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0b96a3d6a76e4ea6f4188d28f807343080b4ab62fdd5fac40c8c8f977a5405"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze._cross_file_surprises (cognitive 16): analyze._cross_file_surprises has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, loops 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"worked/mixed-corpus/raw/analyze.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af6689ef55e6e47958ab8fa8da012b6dc65c8aeef969767cf079f881e3d1ca2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/engine.py: FileTooLong \u2014 7512 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 7012 over it, 15.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee505e49cef49a251ad95b6625f303fa104a6c5309ade70eb461aca14d03a57"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graphify/extract.py: FileTooLong \u2014 6094 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5594 over it, 12.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f46fb88b07b6c5bb49be9aa1cd6b9ede6ff1a7e5c01e8257fff81e8d7ce381"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graphify/cli.py: FileTooLong \u2014 3968 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3468 over it, 7.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af39de73dda94f56daa76e0eb269193edeae7d205ffe66ad7a70de3de0b6029"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/resolution.py: FileTooLong \u2014 3026 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2526 over it, 6.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6493e8c13f1f66dcb8a84477f595592b53b25c3419e185db7e2dcc3112d255"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graphify/llm.py: FileTooLong \u2014 2239 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1739 over it, 4.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"877b10f5c3e03ccce03a935500d3a0f5fc2fe98e4a454c51d7e6ad33afb14dff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graphify/install.py: FileTooLong \u2014 2010 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1510 over it, 4.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2974d920cbf0a5676f04d320b2364d4b8b5222c524439519bf5cf4a77146f86d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graphify/serve.py: FileTooLong \u2014 1908 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1408 over it, 3.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fcdd0f0cc8965654e997216db9cec6ee65c9b7a47440c221a433f39f34ecdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graphify/watch.py: FileTooLong \u2014 1827 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1327 over it, 3.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a79b45eb47cc2678f138fa00e03ceb5a07a2f0ae598dcc3435625aca95c0da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graphify/detect.py: FileTooLong \u2014 1769 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1269 over it, 3.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"824daa147ffe2aa5098680675e7966f685ee64483b85cb6d66f8c37ad7799c7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graphify/build.py: FileTooLong \u2014 1564 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1064 over it, 3.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd34ad1ba8d90f47c105a8eed9ab67d5c59a4a67bba320098d98eba9eaf020a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graphify/cache.py: FileTooLong \u2014 968 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 468 over it, 1.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa14793b6f0d9947b56abf7f5843859bf422207b989338045d80191dc9d5c6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graphify/dedup.py: FileTooLong \u2014 917 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 417 over it, 1.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/dedup.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e80214a0fe3015ea1f9e521b8644a4ff2fb041ed1ae7511339e923096fb5265"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: skillgen/gen.py: FileTooLong \u2014 830 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 330 over it, 1.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/skillgen/gen.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"395da454f5c5f69f8ed942ec5edf635bdfd9b349397a7809064240d14a309b7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graphify/export.py: FileTooLong \u2014 823 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 323 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/export.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be124730f1870f4faa867052751f1651d6f46be0352547cd654b8d4db832ae0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/rust.py: FileTooLong \u2014 713 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 213 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/rust.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46855d29665d77ccd56a82c18eb9977b43210fdf4bb0f946c364420c1d34c00"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graphify/prs.py: FileTooLong \u2014 610 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 110 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/prs.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"548eb86dcf07b212f44ee6d8c2732f6b5e85c5887c621e8cf2331d11c8f69efc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: exporters/html.py: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 88 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/exporters/html.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b456ba24bb5ff4c52a0fd788e5884b9c6b9229616d957562a19b93e8f2ae19fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/go.py: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 88 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/go.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9f6a5b56c209d89727adaa8db13433f5a89e673e35859d6e367956af31845e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/sql.py: FileTooLong \u2014 582 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 82 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/sql.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e646d118cf040e6e607115035c80c5af835634d39cc4b4c84caf4d352adb904f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/objc.py: FileTooLong \u2014 572 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 72 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/objc.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcb4a829f3279a0630a2e7134f2bab0eeb496ce55570ba0143c5c76b9ad3912"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/solidity.py: FileTooLong \u2014 566 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 66 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/solidity.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3408b2ddd5d9f8ae487229a8fce838dfd132afd9d551545a29970d36635bec9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graphify/reflect.py: FileTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 50 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/reflect.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0b65c5a8e94541f4b60edbe5ffb2a1c202a3da389afe101826ca585875a95b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graphify/analyze.py: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 26 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c06caaa51b22907ff89492afb4eb4abde32671094af570cb647dc95ee4cd156"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/pascal.py: FileTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 12 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/pascal.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c51af162366357263b831a3628dd9893c09a8997d70fab82da4dbe47037c50"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (98 shared lines): graphify/analyze.py:481-618 | worked/mixed-corpus/raw/analyze.py:327-435 \u2014 These two members are variants of one another: 98 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5022ad9a19283f42a6ddf202a6810781ab8787f934572026e4545c40b36d2a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (62 shared lines): graphify/analyze.py:622-717 | worked/mixed-corpus/raw/analyze.py:439-517 \u2014 These two members are variants of one another: 62 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf0ca6388be980293da50811ad8ce2c55dab3d1ffd490169fc8d3155d107899"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (37 shared lines): graphify/extractors/erlang.py:28-74 | graphify/extractors/vbnet.py:24-78 \u2014 These two members are variants of one another: 37 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/erlang.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1ee45f12cc2273f4472d39e3ef94e25489905a272c32daf7800857976fada0"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (29 shared lines): graphify/exporters/graphdb.py:29-101 | graphify/exporters/graphdb.py:111-210 \u2014 These two members are variants of one another: 29 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/exporters/graphdb.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebbf0ce10433b618e21e18977c6fe5602b3517a244439ad420d53f5e41a74db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): graphify/extractors/pascal_forms.py:11-101 | graphify/extractors/pascal_forms.py:104-196 \u2014 These two members are one piece of code written twice and then edited apart: 65 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/pascal_forms.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8fd4af4c8e818c53597716dacd8bb66d96917f585cf05485792882946d8a50"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): graphify/extractors/cobol.py:100-297 | graphify/extractors/erlang.py:78-353 | graphify/extractors/r.py:91-482 | graphify/extractors/solidity.py:269-710 | graphify/extractors/vbnet.py:82-433 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/cobol.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbcbc5cd5d29957d12fc128868450cc578db84db3765f58de65444cb77a02db"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): graphify/extract.py:4568-4734 | graphify/extract.py:5131-5368 | graphify/extract.py:5376-5534 | graphify/extract.py:6375-6605 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":4568}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38386fbf5733c77e07cfb0c6e2ad41dcbd514406c863fb83cae8501e5c21e41"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): graphify/extract.py:4568-4734 | graphify/extract.py:5131-5368 | graphify/extract.py:5376-5534 | graphify/extract.py:5582-5900 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":4568}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80eda9b79ea5ba077f69c046e4e7c508b7dd376800fd89be6be2bd9514ea076"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): graphify/extract.py:7817-7899 | graphify/extract.py:7903-8013 | graphify/extractors/razor.py:12-196 | graphify/extractors/sln.py:11-92 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7817}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6a113efce7216b12f8658feeb4f0ed5d8a46aaf031ab4edd22afa3004776e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): graphify/extractors/csharp.py:106-172 | graphify/extractors/csharp.py:445-567 | graphify/extractors/resolution.py:3721-3964 | graphify/extractors/resolution.py:4002-4229 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/csharp.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86ea0566e4d3d97fadc0b014155537e8dc09c8a62591668e0a61d093fbdb1dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): graphify/extractors/dm.py:18-255 | graphify/extractors/elixir.py:17-464 | graphify/extractors/powershell.py:12-426 | graphify/extractors/zig.py:21-245 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dm.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f1072453d9a26b42a2ad22dce3689948ded73d989ee7609b22e83cde5e431f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): graphify/install.py:1058-1088 | graphify/install.py:1945-1980 | graphify/install.py:2184-2211 | graphify/install.py:2408-2432 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"783b87412d2f196de6fdf4f63937c944a84d5edce9ec7c81fb9e91dcc0ef0608"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): graphify/install.py:1132-1144 | graphify/install.py:1882-1923 | graphify/install.py:2213-2234 | graphify/install.py:2434-2450 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c80791ebfb64ce1c356ffc16a76ded6756cf96ee6203a16f87c2bffcb9a2d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): graphify/install.py:1146-1161 | graphify/install.py:1927-1943 | graphify/install.py:2246-2261 | graphify/install.py:2452-2468 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed83256bcd050dc8e4aadf699097f3c095f81d487ef594ad783d113d62a5b6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (64\u201368 lines \u00D7 2): graphify/extractors/pascal_forms.py:34-101 | graphify/extractors/pascal_forms.py:133-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/pascal_forms.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"616df948703ef2d2924e5ada3c8e0a986adafba38600ff6f789ddf2f42f73193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54\u201362 lines \u00D7 2): graphify/cli.py:4331-4384 | graphify/watch.py:2024-2085 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":4331}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f35ab2578f4d5653edb25a24eeb73ef07ba4961effe836f6b5ed8e93eaa57d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201348 lines \u00D7 2): graphify/cache.py:657-704 | graphify/cache.py:987-1007 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/cache.py:657\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f2df63f1960328bef4fe20d727c1206e5790fc30a2401ecb8ae8d8ce78d28e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201339 lines \u00D7 3): graphify/export.py:133-167 | graphify/google_workspace.py:32-66 | graphify/ingest.py:15-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/export.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb57029897159f84c8826f1281a13f73b899dc06c85afb98996d9e38aa4d7df6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): graphify/analyze.py:576-607 | worked/mixed-corpus/raw/analyze.py:402-433 \u2014 before extracting anything, compare \u0060graphify/analyze.py\u0060 and \u0060worked/mixed-corpus/raw/analyze.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/analyze.py:576\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c816947150d62e34e406c33af7c5dc255c323a08f2170a431e84c48a05eea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201332 lines \u00D7 2): graphify/build.py:1101-1132 | graphify/build.py:1211-1226 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060root\u0060 to \u0060str | None\u0060 in one and \u0060str | Path | None = None\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f993da5380f6b64a30eef4a1b511edf455cc25773510f83354c00c240705d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): graphify/analyze.py:410-440 | worked/mixed-corpus/raw/analyze.py:260-290 \u2014 before extracting anything, compare \u0060graphify/analyze.py\u0060 and \u0060worked/mixed-corpus/raw/analyze.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"378c1dd7fb31ec8a3ae9d7f00254a181444882af744230cfe8ccad8bc781a1c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): graphify/cli.py:4389-4419 | graphify/watch.py:2090-2119 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":4389}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c62128d1783335b3e172fcbbd7cc88254fb4a070e65cff8d1f9b53b3e43f49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201330 lines \u00D7 2): graphify/extractors/engine.py:6610-6639 | graphify/extractors/engine.py:8347-8371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":6610}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3f27f1a5c9a507c6a09d316974caef616f52e9a49193ec153e3f03f19ed55c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): graphify/analyze.py:446-472 | worked/mixed-corpus/raw/analyze.py:292-318 \u2014 before extracting anything, compare \u0060graphify/analyze.py\u0060 and \u0060worked/mixed-corpus/raw/analyze.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c05a2403aef1761c0542bd0172f6220b6b7e94b8a127bf237b1b03bbcef8ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): graphify/analyze.py:528-554 | worked/mixed-corpus/raw/analyze.py:362-388 \u2014 before extracting anything, compare \u0060graphify/analyze.py\u0060 and \u0060worked/mixed-corpus/raw/analyze.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"de493b20377bf69baa05a3e9c330378a4ea363da517ffc955dd3875cb4f4761d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): graphify/analyze.py:622-648 | worked/mixed-corpus/raw/analyze.py:439-465 \u2014 before extracting anything, compare \u0060graphify/analyze.py\u0060 and \u0060worked/mixed-corpus/raw/analyze.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5ba35a0462be1ded1ec09dae3fe4cf748716420e4088d86f21bac9e6465c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201327 lines \u00D7 2): graphify/extractors/engine.py:7045-7067 | graphify/extractors/engine.py:8234-8260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":7045}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d552ddccd5f1a1ad0429bc776e95aca78f3a082a9ee86f994e88bb46bf8a603"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201327 lines \u00D7 2): graphify/llm.py:1911-1937 | graphify/llm.py:3122-3141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25bb5c5d7a1a69ba41163e783edfc015c99fc051230d8658f099c301fef924f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): graphify/cli.py:663-688 | graphify/cli.py:744-767 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"91575385cce0142afff5b490bd686a86033f4a5d258951a9016a1eefdc2717de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201325 lines \u00D7 3): graphify/extract.py:7817-7841 | graphify/extract.py:7903-7920 | graphify/extract.py:8414-8431 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extract.py:7817\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7817}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60a7bbf2af8b5a6168878617951ec08791a0db1a33e227f1be3e7f3f60b0ace"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): graphify/analyze.py:156-180 | worked/mixed-corpus/raw/analyze.py:62-86 \u2014 before extracting anything, compare \u0060graphify/analyze.py\u0060 and \u0060worked/mixed-corpus/raw/analyze.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8302fe684ee9bdd36db42b18f3bd83b51b511fef3f3c093efc5503adb586004c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201325 lines \u00D7 2): graphify/extract.py:2641-2665 | graphify/extract.py:2746-2764 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extract.py:2641\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":2641}}}],"partialFingerprints":{"codehealthFindingId/v1":"626073287905ff8de21b49537ca08e4d6a3767ada2364c2798b9886cac4df11f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): graphify/extractors/erlang.py:102-126 | graphify/extractors/vbnet.py:115-139 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/erlang.py:102\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/erlang.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b75efec649df3726d74cbc1d585142f90567bb66e4f013d8acb60c53d6783a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): graphify/extractors/fortran.py:144-168 | graphify/extractors/powershell.py:76-100 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/fortran.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21d421301bbf55c9b279614d0b69e3c3b244d243548ef60cfb66d7021689884"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): graphify/analyze.py:680-703 | worked/mixed-corpus/raw/analyze.py:480-503 \u2014 before extracting anything, compare \u0060graphify/analyze.py\u0060 and \u0060worked/mixed-corpus/raw/analyze.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"589a2ca81571d1833f245dfe508c01f6471f4b74cca5c4525ed5ba3157716bec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): graphify/cli.py:1695-1718 | graphify/cli.py:1766-1789 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb444be4fdbc8309c036a1d74341f3564ad3ccab399902ec6b22085600704679"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): graphify/extract.py:6825-6848 | graphify/extract.py:7401-7428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extract.py:7401\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6825}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b918ad994b1741ef9f5d2235416f6f9c31771528aaaec43df9f67609da8f716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201324 lines \u00D7 2): graphify/extractors/powershell.py:12-24 | graphify/extractors/powershell.py:457-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/powershell.py:457\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060graphify/extractors/powershell.py:28\u0060 calls \u0060_file_stem\u0060 and \u0060graphify/extractors/powershell.py:484\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/powershell.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bde556576cc5545ae3ead8db4258d021e422c805e55c79ddc34f25de7290f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): graphify/extractors/julia.py:63-85 | graphify/extractors/objc.py:171-193 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/julia.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e4a2d8624ce9dc89b284a5a77a9d2ce5611ea75e5fac4e01e952411c7201ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 2): graphify/llm.py:2579-2597 | graphify/llm.py:2667-2689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/llm.py:2579\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":2579}}}],"partialFingerprints":{"codehealthFindingId/v1":"2445f12f9e923f013dd67e2c04bb5c00c7b9e788dd8afeb1d1dc2c47d37b5679"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201322 lines \u00D7 2): graphify/analyze.py:492-513 | worked/mixed-corpus/raw/analyze.py:332-348 \u2014 before extracting anything, compare \u0060graphify/analyze.py\u0060 and \u0060worked/mixed-corpus/raw/analyze.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"009e4650c9f8e9cb4a773a02934b8cd8b219607bcc37d3cdc344e849be46c3f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): graphify/extract.py:6980-7001 | graphify/extract.py:7466-7487 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6980}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea45ce4f3df0ac8bd52dd7ed4e4941a4593a6320c7f03404abad4e3acd4bcfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201321 lines \u00D7 3): graphify/extractors/pascal.py:489-509 | graphify/extractors/pascal_forms.py:55-71 | graphify/extractors/pascal_forms.py:154-170 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/pascal.py:489\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/pascal.py"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c600a00be70272f7f3d5ea6f3b71826f2c15ceb2262ab338248b9275e6f263a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): graphify/extractors/commonlisp.py:117-137 | graphify/extractors/ocaml.py:57-77 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/commonlisp.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d2f9e8247b4eaf900c646c7d6177bb3cbdd202f731468b8747e84057d7550b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): graphify/extractors/erlang.py:54-74 | graphify/extractors/vbnet.py:58-78 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/erlang.py:54\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/erlang.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67a2dd3b317305e6ff924915b3b88a04f852449bd3c8e434e57dfba11769530"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201321 lines \u00D7 2): graphify/extractors/ocaml.py:193-205 | graphify/extractors/ocaml.py:266-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/ocaml.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe4c31ba44bed7444357c811533a19b9916b481efa569e4e3a1696f34dd7d07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): graphify/extractors/engine.py:10566-10585 | graphify/extractors/engine.py:10588-10607 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":10566}}}],"partialFingerprints":{"codehealthFindingId/v1":"618b8bd57a662fdcd4bc79e41f15af0221fc5836666f5ed58016c3be261242cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): graphify/install.py:386-405 | graphify/install.py:1215-1234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdab86058ce62cfb83d080d52e6a340f8059318581cb6967effa1aea374bb4b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): graphify/install.py:2683-2702 | graphify/install.py:2717-2736 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"1584451db97526f917335be0c13b361f3b9629ac6b79642978add1de344f4c1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): graphify/cli.py:1612-1636 | graphify/cli.py:3064-3082 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53846ab3754c91eaf3c62e7a82109becc50145fe97643219ae9d95851ebb0c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201319 lines \u00D7 2): graphify/cli.py:2053-2071 | graphify/serve.py:2123-2136 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aec5bcff2f25cff8393bdca4ffe89b10706574ef357c48d601bad5df848e04d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): graphify/extract.py:686-704 | graphify/extractors/resolution.py:2484-2502 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fed7a4643790cadae9ffc0c046db6f154b7ad0a0ad46a461788345968e2ad9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): graphify/install.py:1271-1289 | graphify/install.py:1445-1463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43a3d6f4afcbed503947f9cd7a4050355a7310336d910f1361416a22603c4a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): graphify/mcp_ingest.py:204-222 | graphify/mcp_ingest.py:227-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/mcp_ingest.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0944fdb96d762541b73ca5037a3fbac8cd803976ca3bb8a46731b7efff66d402"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): graphify/export.py:218-235 | graphify/watch.py:368-385 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/export.py:218\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060cwd\u0060 to \u0060\u0022str | Path | None\u0022 = None\u0060 in one and \u0060Path | str | None = None\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/export.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91db78dc2d3fd1942d0b76c21f1b9c5c960be99df5501344b091cd16a156e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): graphify/extractors/go.py:269-286 | graphify/extractors/julia.py:46-63 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/go.py:269\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/go.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"45de52d4304e36c4e892c15d5028783a011abac4a72614427a9c1c311a117157"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): graphify/extractors/resolution.py:3867-3884 | graphify/extractors/resolution.py:4156-4173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060graphify/extractors/resolution.py:4155\u0060 calls \u0060lower\u0060 and \u0060graphify/extractors/resolution.py:3866\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":3867}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a56abd23ec510135ca6af3e61a3f31bad956c715ea507729104bc593775ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): graphify/install.py:2213-2230 | graphify/install.py:2434-2447 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/install.py:2213\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":2213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2fb261860ab012ebd8ee30759fa16e89ebbe1acfe3073a8cb067d782e72fb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201318 lines \u00D7 2): graphify/llm.py:2024-2041 | graphify/llm.py:3159-3169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/llm.py:2024\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffb526579e65f2db96b93811c77a3689d30c1fdb79078a10149990251ca4bc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): graphify/watch.py:2318-2335 | graphify/watch.py:2623-2636 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9456f2f419fd7f91964c5dfa39452994500ee6b473e8dfb7d58c6eeb92e9ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): graphify/extractors/fortran.py:112-128 | graphify/extractors/go.py:268-284 | graphify/extractors/julia.py:45-61 | graphify/extractors/rust.py:305-321 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/fortran.py:112\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/fortran.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"553f11688241926e70d22697d1a936aa86c1e2b7c2d06907e02040ed4ab8653d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 3): graphify/cli.py:483-498 | graphify/cli.py:660-676 | graphify/cli.py:741-755 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d56c52d9570fb4b2475aa794b36a9f2f1ba5490765f7c983fceb189276c9cdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): graphify/extract.py:4220-4236 | graphify/extract.py:4406-4422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060src\u0060 to \u0060str\u0060 in one and \u0060str | None\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":4220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c549fca3a018f1a63da8724ab6f8669aa25b65e6b73cdbb2408a46d3c1a61192"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): graphify/extractors/engine.py:1202-1218 | graphify/extractors/engine.py:1560-1577 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a860dc35c76c9d8b90703a3fcf6e1b70990641165fbb06b4f41270cb761d0cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): graphify/extractors/engine.py:3999-4015 | graphify/extractors/engine.py:4072-4086 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3999}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fb308e679c2bd7c29229d3ecb8ae5bbe955f2e2b7f3ddaddb1e80d684deef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): graphify/extractors/engine.py:5020-5036 | graphify/extractors/engine.py:5050-5066 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":5020}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd534124ef6b0d1df9c4b1f10c3ed1544dec033749694d3530499fe90b1d346"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): graphify/extractors/engine.py:7333-7349 | graphify/extractors/engine.py:7400-7415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/engine.py:7333\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060graphify/extractors/engine.py:7416\u0060 calls \u0060setdefault\u0060, \u0060set\u0060, \u0060update\u0060 and \u0060graphify/extractors/engine.py:7364\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":7333}}}],"partialFingerprints":{"codehealthFindingId/v1":"5772d448646877883f5d7000d4a02170d6eb2f1c903c8857f2ef60006095b83c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): graphify/extractors/engine.py:8058-8073 | graphify/extractors/engine.py:8203-8219 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":8058}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5cca851aa556da93d1bcbcc87b470ace08dd7b63605721721e05624d42750b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): graphify/cli.py:680-695 | graphify/cli.py:759-774 | graphify/cli.py:780-795 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e523288e08913169313dc1f2bce52f49f68eaf7e477b2d1fffc25f65b0e6e2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): graphify/mcp_ingest.py:203-218 | graphify/mcp_ingest.py:226-241 | graphify/mcp_ingest.py:251-266 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/mcp_ingest.py:203\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/mcp_ingest.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a46ce6c2ee3b32bdd91fde8d62a7cc022620e9f3c74a4af2384af15f3ee1186"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 3): graphify/watch.py:2322-2337 | graphify/watch.py:2371-2382 | graphify/watch.py:2627-2638 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"9582050a4bec2fe9cda804c308d4335dcf8ddf1fa6c22be64e5e2e775351e478"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): graphify/analyze.py:340-355 | worked/mixed-corpus/raw/analyze.py:196-211 \u2014 before extracting anything, compare \u0060graphify/analyze.py\u0060 and \u0060worked/mixed-corpus/raw/analyze.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060graphify/analyze.py:339\u0060 calls \u0060dict\u0060, \u0060degree\u0060 and \u0060worked/mixed-corpus/raw/analyze.py:195\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"6960da708e84ac8243b9a83bfebed81c9d103a0991eb338730e87a0f84c2749c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): graphify/cache.py:1711-1726 | graphify/cache.py:1921-1936 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbba4c316db8e461e32a0431e9a228a6cc9bd0de16f8c835ee062ca94a31da8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): graphify/extractors/apex.py:108-123 | graphify/extractors/apex.py:139-154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/apex.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e16d4c0194a2dd432f0a79fbbb188abbb7f7f201adb34709838b9d526e46b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): graphify/extractors/engine.py:6565-6580 | graphify/extractors/engine.py:6879-6894 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":6565}}}],"partialFingerprints":{"codehealthFindingId/v1":"2977a89a52db20187914d58d35f2bd7e5c4f37b457009da681020fb4bb6c8e03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): graphify/extractors/engine.py:10122-10137 | graphify/extractors/engine.py:10143-10158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":10122}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f4cb5475688747579863b0a29ba6a60cce9f9ba623628f5e22b4d38d96db22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): graphify/extractors/resolution.py:317-331 | graphify/extractors/resolution.py:787-802 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"404c178718fb446b527ef3bc59dc7d3f582044cc47d6795be55163d7e945cb07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 4): graphify/install.py:1147-1160 | graphify/install.py:1929-1942 | graphify/install.py:2246-2260 | graphify/install.py:2454-2467 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb81cc832b56eafb71f26d9f81208d9d272a404b725998f8b1a428d8c562be3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): graphify/install.py:1163-1177 | graphify/install.py:2339-2362 | graphify/install.py:2470-2484 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/install.py:1163\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"037e6e166555f05b3c7a8016b70ac7e75d4f4f78a5f96ec9c6122c9bc5c1f44e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): graphify/cli.py:1723-1737 | graphify/cli.py:1802-1816 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1723}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb360a1e86ca423c7581d65ca70ddf7a2037bd4366ec4c3dd98e16149572bf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): graphify/cli.py:4869-4883 | graphify/cli.py:5017-5031 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/cli.py:4869\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":4869}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe32e71dfddd0a553c463196b8e3149330e6254dfcbc0504821647377da3e06f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): graphify/extract.py:5999-6013 | graphify/extract.py:6138-6152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extract.py:5999\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060graphify/extract.py:6154\u0060 calls \u0060get\u0060 and \u0060graphify/extract.py:6015\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5999}}}],"partialFingerprints":{"codehealthFindingId/v1":"919f9234b01193c22d611fee8304f61b78d519c4d2a879d1b87f071c2ceee985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): graphify/extractors/engine.py:5076-5090 | graphify/extractors/engine.py:5104-5116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":5076}}}],"partialFingerprints":{"codehealthFindingId/v1":"0587071b73a4e4fbedf0b3e4601d0512ae37ab0fd85f2545f7b7cd375664c1c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201315 lines \u00D7 2): graphify/extractors/engine.py:9454-9468 | graphify/extractors/rust.py:875-884 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":9454}}}],"partialFingerprints":{"codehealthFindingId/v1":"6523d76431b9c665a858eb2258abf398edf771165af74537bf69a5e1ad43870b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): graphify/extractors/erlang.py:78-92 | graphify/extractors/r.py:91-105 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/erlang.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6939ecc0ab1993100f5b22c3d803b25a6dc75ddc47ac0ed24929a3149cadf111"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): graphify/extractors/powershell.py:354-368 | graphify/extractors/zig.py:222-236 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/powershell.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4eac797e4c52a8ac5fb7f0350d4e9f1f8382aeb04fd28fa35df96d8c73a5cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201315 lines \u00D7 2): graphify/extractors/zig.py:147-154 | graphify/extractors/zig.py:173-187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/zig.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf10fa9d918afd6eaa22807a86acb073b3ed96496f9fbf6e5307fdb61eb263b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): graphify/watch.py:2277-2291 | graphify/watch.py:2545-2559 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060graphify/watch.py:2544\u0060 calls \u0060unlink\u0060 and \u0060graphify/watch.py:2272\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eed45996f3e3426406e2607227775c652258c4a1472e9b65edee5b0bfad5172"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): graphify/extractors/engine.py:7121-7134 | graphify/extractors/engine.py:7937-7950 | graphify/extractors/engine.py:7954-7967 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":7121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fac4593fd245cc014742febe194e519eec2a34129eb682bcd357a4b4874e3cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): graphify/analyze.py:560-573 | worked/mixed-corpus/raw/analyze.py:390-401 \u2014 before extracting anything, compare \u0060graphify/analyze.py\u0060 and \u0060worked/mixed-corpus/raw/analyze.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/analyze.py:560\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfd5c986c52fbdbd6a32688ebc9b62826127962e01e4595e41d24b0ae8da5e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): graphify/build.py:2287-2300 | graphify/build.py:2555-2568 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"572f2334a534ac0d4abdd84bdf5c2b2242f3421c5c6d77d93da3b03a50ea50f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): graphify/cli.py:1429-1442 | graphify/cli.py:1504-1517 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/cli.py:1429\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9b133adf8b64e728986fab633ed6a04b06e198fc8c8f35613b43bd67357cdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): graphify/extract.py:5459-5472 | graphify/extract.py:6539-6549 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5459}}}],"partialFingerprints":{"codehealthFindingId/v1":"6964d68f868506fbb93da9f9a27bcb9857ccebc03ec9907929c3c651b29ffe64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): graphify/extract.py:10252-10265 | graphify/extract.py:10267-10276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extract.py:10252\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":10252}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85008540eb68cf4900ea6aa1bcca96d692ee86a68ec9957ca47befb309c2e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): graphify/extractors/engine.py:2370-2383 | graphify/extractors/engine.py:2411-2424 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":2370}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7b02a7404f0706a9dd9b1e2f3746e336b83cbdb3055723ad53a63ca4d11f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): graphify/extractors/ocaml.py:198-211 | graphify/extractors/ocaml.py:212-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060graphify/extractors/ocaml.py:196\u0060 calls \u0060next\u0060 and \u0060graphify/extractors/ocaml.py:211\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/ocaml.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4967bec37af0d7821b038f5bf8ef0f68dd90a0badb97dc085e0b65a939a7f69f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201314 lines \u00D7 2): graphify/extractors/rust.py:458-466 | graphify/extractors/rust.py:485-498 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060graphify/extractors/rust.py:468\u0060 calls \u0060_rust_type_last_segment\u0060, \u0060setdefault\u0060, \u0060set\u0060 and \u0060graphify/extractors/rust.py:499\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/rust.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"7530ef9316472233800ff9506094ced0a6a8298909a0fd6de72ae2dd6005d0eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): graphify/extractors/solidity.py:461-474 | graphify/extractors/solidity.py:482-494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/solidity.py:461\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/solidity.py"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b56c6a6db6e3b46c133de07c5a3418c7cbdf129da9056e819f194acb6076eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): graphify/extract.py:4669-4681 | graphify/extract.py:5260-5272 | graphify/extract.py:5454-5466 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":4669}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d5dd197e91b0098b78e0d6a2138477c42abfd5df90f7db71e4693aee772552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 3): graphify/install.py:1132-1141 | graphify/install.py:2218-2230 | graphify/install.py:2435-2447 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1d5d44c00e14ced0d982a893f91bcc4bdda9f5ca6c5af56e4a2cfc936ee7f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): graphify/cli.py:4972-4983 | graphify/cli.py:5154-5166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/cli.py:5154\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":4972}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9a8915b9af7f5cefa4b8cbbe5af4edf9b8b7a37272e939849dd1af1501627e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): graphify/exporters/graphdb.py:65-77 | graphify/exporters/graphdb.py:178-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/exporters/graphdb.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d870a97e76bea96673ab69cb082fe17f0fb6d1a995cfec71e2417bdd97b24f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): graphify/extractors/apex.py:144-156 | graphify/extractors/apex.py:167-179 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/apex.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ab28f47620dac6e8aadad130221cda456abe2cf63f08f8fdf0d939a966743e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 2): graphify/extractors/bash.py:119-131 | graphify/extractors/markdown.py:424-431 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/bash.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0364dab0d6a654565328443d72097872bb716ef87c7a29235326d03808aba26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): graphify/extractors/dart.py:289-301 | graphify/extractors/dart.py:509-521 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/dart.py:289\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dart.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba679c35233feca648ae83b6bcc8c09e76b9116ab7a8b91c7492c721987376f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): graphify/extractors/elixir.py:235-250 | graphify/extractors/elixir.py:255-267 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/elixir.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"874c19f7020f4f18ca04c0666234f533f01f2b5eb35187e81b4850d3b9c370a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): graphify/extractors/engine.py:6696-6708 | graphify/extractors/engine.py:8089-8099 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":6696}}}],"partialFingerprints":{"codehealthFindingId/v1":"756d73f4843b2d0f03413fe021cb5f0dc9e01493106ec4a6a26fe6561084e924"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): graphify/extractors/zig.py:148-156 | graphify/extractors/zig.py:159-171 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/zig.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9a34c18e00ee1708b28827b04b4887202aea6a15c5236cea86c821adf5810d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): graphify/extractors/csharp.py:162-172 | graphify/extractors/csharp.py:557-567 | graphify/extractors/resolution.py:3953-3964 | graphify/extractors/resolution.py:4219-4229 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/csharp.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7999eacdcede099d8ac3875694f4f9ec1abe0d02547eea651f6a2ede713b6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 4): graphify/install.py:1068-1079 | graphify/install.py:1952-1961 | graphify/install.py:2191-2200 | graphify/install.py:2416-2425 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/install.py:1068\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32fb4d738f510fe7242f6aac051822d8be8122383156ac41f3449bae4ba3810"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): graphify/extractors/elixir.py:26-37 | graphify/extractors/powershell.py:21-32 | graphify/extractors/zig.py:30-41 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/elixir.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cba2661e16fba6a5cb8043aa4b32b50894d591bdc8d3ba8410754524c09a425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): graphify/detect.py:391-402 | graphify/detect.py:403-414 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"38abb6832b94a6b1f210d07ac7c177b0ebec13c5e5a0598e2b1698df00ad7932"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): graphify/extractors/engine.py:6663-6672 | graphify/extractors/engine.py:6704-6715 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":6663}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a438018fd2e70617095f48928819ae9e37befc4ef281e49fdabe4bc39f5623"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): graphify/extractors/solidity.py:594-605 | graphify/extractors/solidity.py:680-689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/solidity.py:594\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/solidity.py"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d58b39e0a3bc78618120fbdd4194085e775124417686b043c75b490a422ed3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): graphify/analyze.py:707-717 | worked/mixed-corpus/raw/analyze.py:507-517 \u2014 before extracting anything, compare \u0060graphify/analyze.py\u0060 and \u0060worked/mixed-corpus/raw/analyze.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee053ef8f968993fdbbd379474f8777a1e7f5c08bbf3e1d305d1b20c00b641e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): graphify/build.py:2329-2339 | graphify/build.py:2481-2491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":2329}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2e0a4e5a055abec11157165fd874f9e6c27ab48f4c7fd16169e6d4edf86c5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): graphify/cli.py:703-713 | graphify/cli.py:800-810 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9b344c13c094e075fd65d1774506193b87a81b49c8b6d95d73125c2d29e80b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): graphify/extract.py:5502-5512 | graphify/extract.py:6345-6362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extract.py:6345\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5502}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bce554e3f0648b067bb28a65ff92647185abb6b59f21e9fdcbe47437c713d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): graphify/extract.py:7956-7966 | graphify/extract.py:7972-7982 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060graphify/extract.py:7967\u0060 calls \u0060get\u0060 and \u0060graphify/extract.py:7983\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7956}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a34064bbbd07d782580b14dbf7111d375f05152b2fdd17796b7b50b328d46ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): graphify/extractors/engine.py:1571-1581 | graphify/extractors/go.py:76-86 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe0d9673f32ec69f84dfb41d5af344228dde987b36df928450f0e477bffd3cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): graphify/extractors/engine.py:7429-7439 | graphify/extractors/engine.py:7445-7456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/engine.py:7445\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":7429}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de079ed2fd559da76fc1be20ab66f8f6c5dfb948714d8eac41d34d5d6c4901f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): graphify/extractors/ocaml.py:209-219 | graphify/extractors/ocaml.py:249-259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060graphify/extractors/ocaml.py:220\u0060 calls \u0060add\u0060, \u0060walk\u0060 and \u0060graphify/extractors/ocaml.py:260\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/ocaml.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5575808f6e98e76a262c9fea0b6a0374d6a1568aa32c19525a2a4a0519b0503"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): graphify/extractors/pascal.py:209-219 | graphify/pascal_resolution.py:91-101 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/pascal.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"9937027a15903e7bdfbac6559dd77b5a5ecbdf7180f1485155085f0f3fc2471b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): graphify/extractors/razor.py:12-22 | graphify/extractors/sln.py:11-21 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/razor.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"527e4877259f88591181228d5c58c366065acf01e6018fa645215001fced74df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): graphify/extractors/sql.py:564-574 | graphify/extractors/sql.py:581-591 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/sql.py"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb2e51337b278a6b0c6467e0e3d927e55479d1dfaa33fa7ca427e5f4214335e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): graphify/install.py:1185-1194 | graphify/install.py:2493-2503 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"08eaa2dd9bf1911995418a27df7e770a7b12f79f6d3b4c587a3ea2b856e47297"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): graphify/prs.py:424-434 | graphify/serve.py:2664-2671 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/prs.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"203a74de854d19df09eacaf302fb234bcb92f75f9ffc8e1fa39216a0bbbf5f4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): graphify/detect.py:2662-2671 | graphify/detect.py:2673-2682 | graphify/detect.py:2684-2693 | graphify/detect.py:2695-2706 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":2662}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb7e6c304b11e7aced4e924ffa0acab2d38774db590d032ee810a1dd85d1698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): graphify/cli.py:2504-2513 | graphify/cli.py:2557-2566 | graphify/watch.py:2455-2464 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":2504}}}],"partialFingerprints":{"codehealthFindingId/v1":"715ece02552755e9e41035d295ca68711d7d62de01eea64c96bf5282623c0a95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): graphify/extractors/elixir.py:49-58 | graphify/extractors/powershell.py:45-54 | graphify/extractors/zig.py:51-60 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/elixir.py:49\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/elixir.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b465ba7ffe78dd370580ecc141e677e3a74916146f85fbc6829b2059c465379"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): graphify/analyze.py:517-526 | worked/mixed-corpus/raw/analyze.py:351-360 \u2014 before extracting anything, compare \u0060graphify/analyze.py\u0060 and \u0060worked/mixed-corpus/raw/analyze.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2e966bd8ea51828e206f4f8944767ed654b4867a4b85122916e5b8e63b79a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): graphify/cache.py:348-357 | graphify/cache.py:735-744 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ca77d60c283f9c10d8b06c39e10bb506fb555468430e123f27ca5153a01c08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): graphify/cli.py:1990-1999 | graphify/serve.py:2093-2101 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bc7dbee14d7ed018fb24005c372b8602a0aae57e0bf3e41466c472fb829a3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): graphify/extract.py:5686-5695 | graphify/extract.py:6242-6251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5686}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e135a905128945682e97231b62aef74f142732efed96bc2ea18bbe41db8ee5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): graphify/extract.py:6919-6928 | graphify/extract.py:7421-7430 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extract.py:6919\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6919}}}],"partialFingerprints":{"codehealthFindingId/v1":"191bac39ae7762aeca2c4d4120446a56933a443b815a6c3d2b1db7bc48c3457c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): graphify/extract.py:7954-7963 | graphify/extract.py:8002-8011 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7954}}}],"partialFingerprints":{"codehealthFindingId/v1":"2845f659790cb5ee7db243b014b00691270df2f0dc179179c37c7d0ea088660d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): graphify/extractors/apex.py:133-142 | graphify/extractors/apex.py:157-166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/apex.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7a1566e3e4809119e007dd70438c5f6342032c6c00ee523f9a29d69cbc02ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): graphify/extractors/dm.py:285-294 | graphify/extractors/dm.py:446-455 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dm.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1c20757574c2304523ec5abedf4f709c3c64702fc44307127bba611fd80b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): graphify/extractors/engine.py:3098-3107 | graphify/extractors/objc.py:78-84 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/engine.py:3098\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3098}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec8fa7dd44920657527b3eefb94b634489d2c553f0a4fb5cd69d4701059df4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): graphify/extractors/engine.py:6944-6953 | graphify/extractors/engine.py:8008-8016 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":6944}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf1eb4467dadf391663306a242026be39a00f51629313b63e868f79adb86c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): graphify/extractors/erlang.py:42-51 | graphify/extractors/vbnet.py:46-55 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/erlang.py:42\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/erlang.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5586350cc5c0aee24e3e97ec04960dec7df076b814a6d2ba08623efd4b1f451"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): graphify/extractors/resolution.py:1581-1590 | graphify/extractors/resolution.py:1639-1648 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"add450ba9d7fc26dda13de32910032cd1a1d7eb41010cd613eb435ffe433c821"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): graphify/extractors/robot.py:195-203 | graphify/extractors/robot.py:222-231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/robot.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a754cea951d4be636fd9974a73bbe6c9b53a79f82e35e69560b1b01406e189fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): graphify/install.py:213-222 | graphify/install.py:227-236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"3caa85aa5f0b4a4b2f5f96f07c08dbddf72b3e7c5200c8569a1819e9d66ed993"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): graphify/symbol_resolution.py:457-466 | graphify/symbol_resolution.py:482-491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/symbol_resolution.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac345d6f33740b1332af960eb7e9245bb05eba53844b92ffbab6ab22dee5788"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9): graphify/extractors/bash.py:117-125 | graphify/extractors/dm.py:28-36 | graphify/extractors/fortran.py:88-96 | graphify/extractors/json_config.py:113-121 | graphify/extractors/julia.py:21-29 | graphify/extractors/objc.py:105-113 | graphify/extractors/ocaml.py:31-39 | graphify/extractors/rust.py:246-254 | graphify/extractors/verilog.py:219-227 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 9 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060graphify/extractors/bash.py:133\u0060 calls \u0060set\u0060 and \u0060graphify/extractors/fortran.py:97\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/bash.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bba0d2f6ef262172159c1cd099479bcba1441c745af923e89c23f91a060d00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): graphify/extractors/erlang.py:87-95 | graphify/extractors/r.py:100-108 | graphify/extractors/solidity.py:278-286 | graphify/extractors/vbnet.py:91-99 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/erlang.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"30daf8046341af936fbba8a4d834524893faa354f67c92abb6aed3d8dfcc7a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): graphify/cli.py:1953-1959 | graphify/cli.py:2107-2113 | graphify/cli.py:3057-3065 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"235b8e374c3101ce0ad39fa3cb6a40ea09bf8367f70f4dec98aa9746e9fc9935"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): graphify/extract.py:5639-5647 | graphify/extract.py:6004-6012 | graphify/extract.py:6143-6151 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060graphify/extract.py:6154\u0060 calls \u0060get\u0060 and \u0060graphify/extract.py:6015\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5639}}}],"partialFingerprints":{"codehealthFindingId/v1":"95964a16cddde184ecbfba69f892e4f8a290c046df76dbfd8162c9bf0e680c80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): graphify/extract.py:6840-6848 | graphify/extract.py:6918-6926 | graphify/extract.py:7420-7428 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6840}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f228045956f998f9fa38e89c66ba916018b1f9aa75e1ade0e18e9b1bb2c5958"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): graphify/extractors/dart.py:302-310 | graphify/extractors/dart.py:311-319 | graphify/extractors/dart.py:522-530 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/dart.py:302\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dart.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f84681ddcff206bb04d3b3f12e23f4167af0b9001ee8305fbf7d5f93dfdad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): graphify/extractors/dart.py:328-336 | graphify/extractors/dart.py:337-345 | graphify/extractors/dart.py:531-539 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/dart.py:328\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dart.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"2074611eb2fc0bc47f0f21f19457f1a8a20910393be50768396d518d94f6d097"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): graphify/extractors/engine.py:7988-7995 | graphify/extractors/engine.py:8225-8233 | graphify/extractors/rust.py:435-442 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":7988}}}],"partialFingerprints":{"codehealthFindingId/v1":"348bc291a493c4c44a47b6648ba4206f32c551902a5b6db06525de1cee531aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): graphify/build.py:2320-2328 | graphify/build.py:2471-2479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":2320}}}],"partialFingerprints":{"codehealthFindingId/v1":"794433fe89912e46a63caef1cc22b9837d9d9c445275addd77ea7cf599f866ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): graphify/cluster.py:402-409 | worked/mixed-corpus/raw/cluster.py:81-89 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cluster.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d25901a2ab24c466734e3baeeeca5f2ae88bcda94bc3dbf167f3dd2d0eb33c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): graphify/dedup.py:1260-1268 | graphify/dedup.py:1566-1573 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/dedup.py"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd5fe7d7a67b87a7257f0316e52f3ed1216de45cb56cbac7afb272338222a59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): graphify/exporters/graphdb.py:82-90 | graphify/exporters/graphdb.py:194-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/exporters/graphdb.py:82\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/exporters/graphdb.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba89334558d14a0459a245824ddf9075e28f2fd0497ccc97a303df3f548e4ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): graphify/extract.py:6923-6931 | graphify/extract.py:7053-7060 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extract.py:6923\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6923}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e306b0ad92f1f0bd33514e4372af8c7232f2995eb7c9967702961b874869d5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): graphify/extractors/bash.py:503-511 | graphify/extractors/bash.py:546-554 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/bash.py"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb1bb2122d2a3cb3e23a8b8f47e531575b0606edb88b370d22ba4bda17e8301"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): graphify/extractors/blade.py:42-50 | graphify/extractors/blade.py:52-60 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/blade.py:42\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/blade.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3222d13bfb6bf5224a221f1d928c5fc0da6531a8d5843f20e75ad812d099789"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): graphify/extractors/commonlisp.py:328-336 | graphify/extractors/commonlisp.py:418-426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/commonlisp.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"553810901fafd2be345f42a625a5db9fc39cb0597968b6c1afdac8a34b2fa88f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): graphify/extractors/dart.py:178-186 | graphify/extractors/dart.py:189-197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dart.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe595e8eefbff862fcad08bf827ee22d95d312da84d01fa2deed1317504f8cc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): graphify/extractors/dart.py:319-327 | graphify/extractors/dart.py:554-561 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/dart.py:319\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dart.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ad4d8bfda5f5ab7b002c2bdc419e450e2e8d0436b1bceeb26567d06fca185a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): graphify/extractors/engine.py:4425-4433 | graphify/extractors/engine.py:4635-4643 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4425}}}],"partialFingerprints":{"codehealthFindingId/v1":"965ae246017a1111845d809344801d97013178d1e0ddc25d8f9787396fd5a9c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): graphify/extractors/engine.py:6860-6868 | graphify/extractors/engine.py:9378-9386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":6860}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87a6a7b972e7b8197570381da940df0b93019102b7187911324398e0b8429f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): graphify/extractors/fortran.py:276-284 | graphify/extractors/fortran.py:334-342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060graphify/extractors/fortran.py:333\u0060 calls \u0060emit_signature_refs\u0060 and \u0060graphify/extractors/fortran.py:275\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/fortran.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0060cce3026262a82d7243177aa44b7e21d3d1fe8aa797eecab3c0ce4272e31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): graphify/extractors/go.py:648-656 | graphify/extractors/go.py:661-666 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/go.py"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb98dd6e209798de3a2ac912cee7f724a1a79fd3528da239f45a14cd1b29792f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): graphify/extractors/resolution.py:3755-3763 | graphify/extractors/resolution.py:4031-4039 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":3755}}}],"partialFingerprints":{"codehealthFindingId/v1":"0064c16c76fae5ae2fc3a3583c333792d5ad876c6cda9196f8437b8f4148009a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): graphify/google_workspace.py:222-230 | graphify/google_workspace.py:235-243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060graphify/google_workspace.py:245\u0060 calls \u0060RuntimeError\u0060 and \u0060graphify/google_workspace.py:231\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/google_workspace.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ab4bc85f6032e27743da25d80c2d7351b48528d31e5ba446236c4754238911"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): graphify/install.py:821-829 | graphify/install.py:866-873 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"e632292b399a3c34a065578062af12617c56bad0e1375300b24341100a3d0822"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): graphify/serve.py:1593-1601 | graphify/serve.py:1688-1696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060graphify/serve.py:1697\u0060 calls \u0060join\u0060, \u0060_search_tokens\u0060, \u0060get\u0060 and \u0060graphify/serve.py:1602\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac6804a7bac2c2fe2a6c4f80d6448ae76bf4fdbc72c747cbf797ef278b9731e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): graphify/serve.py:2606-2614 | graphify/serve.py:2650-2658 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":2606}}}],"partialFingerprints":{"codehealthFindingId/v1":"75219cab3f5884ec3468f241c0db38eb9bbd3dacc74ae177ba1319f72fe72cec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): graphify/extractors/dart.py:299-306 | graphify/extractors/dart.py:308-315 | graphify/extractors/dart.py:317-324 | graphify/extractors/dart.py:325-332 | graphify/extractors/dart.py:334-341 | graphify/extractors/dart.py:519-526 | graphify/extractors/dart.py:528-535 | graphify/extractors/dart.py:537-544 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dart.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6edb675a42710754974d7ed4edc76923afb48784f0b4f4590a87de27db49e5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): graphify/extractors/bash.py:115-122 | graphify/extractors/dm.py:26-33 | graphify/extractors/go.py:229-236 | graphify/extractors/julia.py:19-26 | graphify/extractors/ocaml.py:29-36 | graphify/extractors/rust.py:244-251 | graphify/extractors/verilog.py:217-224 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 7 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/bash.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6c9ace5d8d4838037395998dd1fef79bfc55e907acfdab280309d78d98d1a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): graphify/extractors/engine.py:7044-7051 | graphify/extractors/engine.py:7625-7632 | graphify/extractors/engine.py:8223-8230 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":7044}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab210dfc5882adcb3733c353d83c54268e8473f78a505b17af279814f8e739bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): graphify/extractors/fortran.py:278-285 | graphify/extractors/fortran.py:322-329 | graphify/extractors/fortran.py:336-343 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060graphify/extractors/fortran.py:333\u0060 calls \u0060emit_signature_refs\u0060 and \u0060graphify/extractors/fortran.py:275\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/fortran.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"439547714d74ae6e4867556129c74d2e32ce37570855adbd8e488bbb3ac3a3a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): graphify/cli.py:1576-1583 | graphify/cli.py:1716-1723 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"8757442e982be7aa0f8efa29843ca16f88fba04b1303f28924b6fd437204ebb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): graphify/cluster.py:325-332 | worked/mixed-corpus/raw/cluster.py:49-56 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cluster.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc7ba974b67e7b8ca75cd5e0bdeee2c0e283529c9b3cf2dc4c16a61571bc317"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): graphify/extract.py:1881-1888 | graphify/extract.py:1893-1900 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbc58acbe79b58b147f13d96709016fe01276fd152d092c10f066374500d87a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): graphify/extractors/commonlisp.py:524-530 | graphify/extractors/powershell.py:353-360 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/commonlisp.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca3951edc398eedc98571563f03b39ea11112345f5db8a28a2c9261177669b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): graphify/extractors/engine.py:4464-4471 | graphify/extractors/engine.py:4519-4526 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4464}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede46cc6f733305be9dc67441bf78879165900296384989e645167d9e0af1449"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): graphify/extractors/engine.py:6695-6702 | graphify/extractors/engine.py:8079-8085 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":6695}}}],"partialFingerprints":{"codehealthFindingId/v1":"22921e57fb08b326c944a38c8ab6467fed868c9d329fd806772bec3292a91f72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): graphify/extractors/go.py:792-799 | graphify/extractors/rust.py:955-960 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/go.py:792\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/go.py"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b21999ec03ecce723eb87bfff0f8a9886750a6dc843a0cbd0dfc7e42ca4fc89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): graphify/extractors/powershell.py:135-146 | graphify/extractors/powershell.py:167-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060graphify/extractors/powershell.py:176\u0060 calls \u0060setdefault\u0060, \u0060lower\u0060 and \u0060graphify/extractors/powershell.py:147\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/powershell.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b346d73e8a133cfeb80ca2a73e338c289733e8337e22b7b2dc672885782e39f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): graphify/extractors/resolution.py:3662-3669 | graphify/extractors/resolution.py:3862-3869 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":3662}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75973e3a2fbdb6887f353e375bf215623ba86dfd45fe34f3f94b9db2f4f9337"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): graphify/serve.py:1065-1072 | graphify/serve.py:1094-1101 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"753866c5fb6a0c4b514e0353626999d53f5c797ce272f7255c78d311b9e203cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): graphify/install.py:2683-2689 | graphify/install.py:2717-2723 | graphify/install.py:2733-2739 | graphify/install.py:2763-2769 | graphify/install.py:2810-2816 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f184043256ec279741fbbeaf8a7cd5e61f021067c68dc6c1cc0c8e985f06f2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): graphify/extract.py:7843-7849 | graphify/extract.py:7922-7928 | graphify/extractors/razor.py:18-24 | graphify/extractors/sln.py:17-23 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":7843}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ebdec5dbf465ef413b67ed7d54ae82df972e80ff6461fce197e24695829ea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): graphify/extractors/dm.py:53-59 | graphify/extractors/elixir.py:53-59 | graphify/extractors/powershell.py:49-55 | graphify/extractors/zig.py:55-61 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/dm.py:53\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dm.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc6aadf2abc4559f45dc955238445e9930baff8d867ab3be8d1179bebd007f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): graphify/extractors/engine.py:7988-7994 | graphify/extractors/engine.py:8225-8232 | graphify/extractors/go.py:325-331 | graphify/extractors/rust.py:435-441 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":7988}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a38d6b66098842fa9a3ed4aa471559f4ad31944d4fdbfc7ededf8cf7184975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): graphify/install.py:1135-1141 | graphify/install.py:1910-1916 | graphify/install.py:2223-2230 | graphify/install.py:2440-2447 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6e2ff233ede276094e6166ec708249b0a36f7113454d8b3d6415b6ede5249e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): graphify/extractors/blade.py:31-37 | graphify/extractors/blade.py:42-48 | graphify/extractors/blade.py:52-58 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/blade.py:31\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/blade.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0040436ea7bfd1d143fe94cf87e882f39ec12b2a298b9be1da03657f6757dca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): graphify/extractors/elixir.py:457-463 | graphify/extractors/r.py:472-481 | graphify/extractors/zig.py:238-244 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/elixir.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a892a33b8041ae7c3add444a9655af6f3a8e6b813bde3acd4221f20f1355f702"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): graphify/extractors/engine.py:7330-7336 | graphify/extractors/engine.py:7936-7942 | graphify/extractors/engine.py:7953-7959 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":7330}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe934c080fea37b19b767cd81a2bca51f341cc171bc1a0aca4407193337036a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): graphify/extractors/erlang.py:42-48 | graphify/extractors/r.py:55-61 | graphify/extractors/vbnet.py:44-52 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/vbnet.py:44\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/erlang.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfa2df1b35e54dedd15c182d226d3edc20fbef62fa6f5c3d9a8628a757fcbda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): graphify/cli.py:1459-1465 | graphify/cli.py:3749-3755 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a88e6532044d57bc2b4a14d737dd00dac51a7d9f3b5d9a17f4dea69a5d8b134"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): graphify/cli.py:2326-2332 | graphify/cli.py:3207-3213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":2326}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f8e2ac6d5feab1b03b6ae2617c1f775cc2e910a53f6c7d6b89c6415c9dd58e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): graphify/cli.py:2333-2339 | graphify/cli.py:3211-3217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":2333}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d491493447ed88d4a5e7213c443bedaf2e8117aeaee1d98ba6727f5352f584"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): graphify/cli.py:3554-3559 | graphify/cli.py:3565-3571 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/cli.py:3565\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060graphify/cli.py:3553\u0060 calls \u0060exit\u0060 and \u0060graphify/cli.py:3564\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":3554}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9d412b5fb0b498a9eeb7336ee2ca43bd68007e51218bdbb527c1c5c554c312"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): graphify/cli.py:3729-3735 | graphify/cli.py:3740-3746 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":3729}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a73b97bdf16752c2da377731d2df30d0d4992b81f1a535521ab7511fa4afab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): graphify/cli.py:5247-5253 | graphify/cli.py:5256-5262 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":5247}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5ca0ff8b6e673a2a83164b5519f283597cbae3909d400b79721f5fab4cd856"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): graphify/cluster.py:365-371 | worked/mixed-corpus/raw/cluster.py:59-65 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cluster.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"92685ada275f6b32aa5e715baf2d5e72363c458fc4a590b5f9d8839d61b9fbcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): graphify/exporters/graphdb.py:45-51 | graphify/exporters/graphdb.py:142-148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/exporters/graphdb.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09ae73a243a7ef79520d0fbf76960f437ce117d7fc6f4cb3db2b90754b4b539"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): graphify/extract.py:5990-5996 | graphify/extract.py:6129-6135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extract.py:5990\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5990}}}],"partialFingerprints":{"codehealthFindingId/v1":"138af266c92226e1bde85d517e1ac3cf7d26b97d14cc19c8c8344ad71116c262"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): graphify/extract.py:11233-11239 | graphify/extract.py:11254-11260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extract.py:11233\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":11233}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0a8fcac29873304051d4a708c84b73fe68115419f669ac9f71915a5330ac46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): graphify/extractors/cobol.py:108-114 | graphify/extractors/erlang.py:94-100 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/cobol.py:108\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/cobol.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8309dd27a239783e036284a54b8c4a1b3b63a9ae359de749060d61a98ce3b93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): graphify/extractors/engine.py:4010-4016 | graphify/extractors/engine.py:4517-4523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":4010}}}],"partialFingerprints":{"codehealthFindingId/v1":"be69e7380ba60289b35f1636f3a9763d9b3ee8e07976ff5ab7a0cf9a30d893c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): graphify/extractors/fortran.py:268-274 | graphify/extractors/fortran.py:281-287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/fortran.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"57afe97c4b870cb684d69add72b3f0df9f2b1d566942f120aa57146e1c6f63ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): graphify/llm.py:3195-3201 | graphify/llm.py:3246-3252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":3195}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf06207a2edfe0f1b5ee0119c2023923a7cd9eb2bfe5f2541bbe9c9591a01b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): graphify/extractors/dart.py:297-302 | graphify/extractors/dart.py:323-328 | graphify/extractors/dart.py:517-522 | graphify/extractors/dart.py:557-562 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dart.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b7b17ba30fa80b5614e4afb28c306d578c4984050033ffc674c683f14a7e77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): graphify/extractors/fortran.py:267-272 | graphify/extractors/fortran.py:280-285 | graphify/extractors/fortran.py:324-329 | graphify/extractors/fortran.py:338-343 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/fortran.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"e113c4084d23967122b0ebbeb131c06c99a40280f185b2ecc333353f827df861"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): graphify/extract.py:6923-6929 | graphify/extract.py:7053-7058 | graphify/extract.py:7425-7431 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extract.py:6923\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060graphify/extract.py:7433\u0060 calls \u0060get\u0060, \u0060setdefault\u0060 and \u0060graphify/extract.py:6930\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":6923}}}],"partialFingerprints":{"codehealthFindingId/v1":"9490277061d5f745499111e3919807bc0b02fd8e16dce87ddd66ce88e6af9ee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): graphify/extractors/cobol.py:108-113 | graphify/extractors/erlang.py:94-99 | graphify/extractors/solidity.py:285-290 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/cobol.py:108\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/cobol.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e2b8e1e45407607ae01ee7b297eb0df98a6def6e91073a859f34deecbce5b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): graphify/extractors/engine.py:6662-6667 | graphify/extractors/engine.py:6703-6709 | graphify/extractors/engine.py:8095-8100 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":6662}}}],"partialFingerprints":{"codehealthFindingId/v1":"31dbbe07fc2643d06add62e7a4ed9c4413cf405a9d60690b8dd82ab1bfd6d3fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): graphify/extractors/engine.py:6697-6703 | graphify/extractors/engine.py:7997-8002 | graphify/extractors/engine.py:8090-8095 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":6697}}}],"partialFingerprints":{"codehealthFindingId/v1":"4670d3e1e0490455bb04a346eee1ae5870876cdfad5af4b23c704ec770f0514d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): graphify/extractors/engine.py:7988-7993 | graphify/extractors/engine.py:8182-8188 | graphify/extractors/engine.py:8225-8231 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":7988}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded5e91e8af7b262c74f3701928da4939baa08f6e7a63135f1b1b3609705a5c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): graphify/build.py:316-321 | graphify/build.py:338-343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b74c0bae77abc66ab49b6f4b3c0e3c02d246ca64ee77f4e6a3e4bc0b6d5084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): graphify/cli.py:2390-2395 | graphify/cli.py:2896-2901 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":2390}}}],"partialFingerprints":{"codehealthFindingId/v1":"2beaf395f49037ab92423942f577e32767b4572595d72b542cdae35048bc5295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): graphify/extract.py:2940-2945 | graphify/extract.py:2997-3002 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":2940}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dc42b11bba77c57d35e37762d92243931379bbe3952d80da7bfa3858c56660"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): graphify/extract.py:4793-4798 | graphify/extract.py:6456-6461 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":4793}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7078a48f81992c320cc7342d4c8f8de54d5ae6ee8d4aa9a3c10192ecbea3cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): graphify/extractors/engine.py:1244-1249 | graphify/extractors/engine.py:1251-1256 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac36a265d99618cd4caf4237717c1dbf36551a6aa885aae13f14ef70f987dcdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): graphify/extractors/erlang.py:28-33 | graphify/extractors/vbnet.py:24-29 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/erlang.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6378fb4d6edda018e79f47233812796b869416e77111b64b48562c5fc7c4b6df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): graphify/extractors/powershell.py:120-125 | graphify/extractors/powershell.py:137-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/powershell.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6228e2fc709aac0873e1985907cf8f0af49ee81eb05a487ee415f1a1643662"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): graphify/serve.py:2209-2214 | graphify/serve.py:2218-2223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/serve.py:2209\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":2209}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b59d62eac7842e8bf787fb49315f5486b621bcef13bdaeaa3148b28254e8c50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): graphify/extractors/cobol.py:106-110 | graphify/extractors/erlang.py:92-96 | graphify/extractors/r.py:105-109 | graphify/extractors/solidity.py:283-287 | graphify/extractors/vbnet.py:96-100 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/cobol.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"840b54f1e4b293c41bdef4ff6074f9b770b803ecd2d4dd06e1f2ade174699859"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): graphify/extract.py:4598-4604 | graphify/extract.py:5173-5180 | graphify/extract.py:5410-5414 | graphify/extract.py:5621-5625 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":4598}}}],"partialFingerprints":{"codehealthFindingId/v1":"0609ede7283d4d3c65863f8e30bfda4684d27a58de698cdab40d3587cf8db1f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): graphify/cli.py:1464-1468 | graphify/cli.py:2397-2401 | graphify/cli.py:3754-3758 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/cli.py:1464\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"528cdb2212366adac90306026eca4a21ef37c21985503acb988573cddf1d0d1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): graphify/cli.py:4114-4118 | graphify/cli.py:4127-4131 | graphify/watch.py:1806-1810 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":4114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc94b6b8c867c42d1655a162f03cfe2274b46b4525aa04c8891c1279fb9fd4f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): graphify/extractors/dm.py:44-48 | graphify/extractors/powershell.py:42-46 | graphify/extractors/zig.py:48-52 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/extractors/dm.py:44\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dm.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e460dd747edf77fc4853f30511786f9c0d59714b7912c47db7e5f9fe2ee639e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): graphify/serve.py:634-643 | graphify/serve.py:1597-1601 | graphify/serve.py:1692-1696 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/serve.py:634\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060graphify/serve.py:1697\u0060 calls \u0060join\u0060, \u0060_search_tokens\u0060, \u0060get\u0060 and \u0060graphify/serve.py:1602\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"453f3765e9ac4116f883a9edb476811a294e17355b450f3ab1ccf087cec0e28c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): graphify/build.py:1398-1404 | graphify/build.py:1430-1434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc367d8029a9f156d4b5307f9fca2af351c780aa7bd54b39033516e880055bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): graphify/cli.py:2076-2080 | graphify/serve.py:2141-2145 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21a52063c7cff59876e7ac28d6a2dd1ea36c93d5dc5d27301943f300841b379"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): graphify/dedup.py:550-554 | graphify/dedup.py:568-572 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/dedup.py"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cc21ddcbe872e1e2893ad50857ab082197ee41d1e03ce1417e850aa3ae9419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): graphify/extract.py:5061-5065 | graphify/extract.py:5080-5084 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5061}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e33213306f474da3992dc7d1af8930a3965bd6d5163661cc76f50c2f06ce4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): graphify/extract.py:5157-5161 | graphify/extract.py:6405-6409 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":5157}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ad2c52ca9c67e49b9db26c6e5d1215e14f10307dbfbc7b4461452159eceaf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): graphify/extractors/dart.py:539-544 | graphify/extractors/dart.py:547-551 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dart.py"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb067ec4783e1aa80bc16867d5a47d64897a38907183f228ee64db6778d7c22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): graphify/extractors/sql.py:771-775 | graphify/extractors/sql.py:777-781 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/sql.py"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"11246689e8851c488ea4f8cc0b9da192974eb8f4970fd65645d3340759cdfb3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): graphify/analyze.py:184-199 | worked/mixed-corpus/raw/analyze.py:90-105 \u2014 before extracting anything, compare \u0060graphify/analyze.py\u0060 and \u0060worked/mixed-corpus/raw/analyze.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f771b88ff5e2c81a4de36a03b653b502e5d7c6a549f9452d6a7c9a547a3bb16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): graphify/export.py:125-129 | graphify/serve.py:215-219 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/export.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"92855a592ba6de148bef03f5888ba4e428acd490b30d5819caddb55a67933efd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): graphify/cli.py:2403-2407 | graphify/cli.py:3807-3811 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/cli.py:2403\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e639f6014ed9ea33d455bb58504a6a3e34dcc955a8a8d9e7d6f252e298ab4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): graphify/cli.py:2903-2907 | graphify/cli.py:3291-3295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060graphify/cli.py:2903\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":2903}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bfb1289513e40dd906b35ec713eb10db110a207591e5655776b5adcf9a4f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): graphify/detect.py:716-720 | graphify/detect.py:764-768 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"3009ae8f81bc3cf0f86346ada31c0b692ecf3f57ef3cf001dacf98e8e65e335c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): graphify/extractors/dm.py:316-321 | graphify/extractors/dm.py:468-473 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dm.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b8d54f9fb1cd04867d1f5a15026efb058d662810619c420d64b5f302f977a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): graphify/prs.py:334-338 | graphify/prs.py:648-652 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/prs.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f370d99738dde07dba0df7d1bd2263ef037377b5c36c97d2a5c5373152a776e"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 no coverage collector is wired up: Coverage NOT MEASURED: \u0060--collect:\u0022XPlat Code Coverage\u0022\u0060 names a data collector that ships in the \u0060coverlet.collector\u0060 package, and this repository wires up none \u2014 no test project references it and no runsettings declares one. The absence of coverage here is therefore not evidence about the suite or about our analyzer environment: without a collector, \u0060--collect\u0060 produces nothing even from a suite that builds and passes. Add a \u0060coverlet.collector\u0060 PackageReference to the test project(s) (or commit the Cobertura/OpenCover/lcov report your CI produces) and real coverage will be measured. It is excluded from the score rather than counted as a near-zero defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: output that finishes after navigation is discarded: This test starts work it did not wait for (\u0060api\u0060, still running when the sleep starts) and then orders itself against it with \u0060Bun.sleep(5)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pi.test.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6412c8657476c7d5f8144fb40cb28faab979cbf21d7f2ec5d79ae9e815d1217"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/extract.py: graphify/extract.py changed 209 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 372 in extract.extract at line 9272. 159 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extract.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extract.py"},"region":{"startLine":9272}}}],"partialFingerprints":{"codehealthFindingId/v1":"201f2a2cc493a762aaf75a59908bb9b8c2c888487d6e02984e6ff401d92303b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/cli.py: graphify/cli.py changed 82 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 850 in cli.dispatch_command at line 1408. 52 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/cli.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"7436a8a573b2772e7c78e0170f74a0d4d1d58fe8a1a48f5faf33c591a42619e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/extractors/engine.py: graphify/extractors/engine.py changed 166 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 117 in engine._extract_generic at line 5995. 137 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/engine.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":5995}}}],"partialFingerprints":{"codehealthFindingId/v1":"911d7d398928ab784a9912ff5dbccf6ca1a7dece10a8f009dad82ac8e5c35e50"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/build.py: graphify/build.py changed 57 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 165 in build.build_from_json at line 1270. 50 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/build.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"3689674c32046a923b695b907c4d3eace9dceb67000b3a3c7bfcfd13d1431fb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/watch.py: graphify/watch.py changed 60 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 149 in watch._rebuild_code at line 1677. 45 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/watch.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"3baed1cdfcea1ea100afb98f43847a4f6740c1c78b3d1867c55535c379694f5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/extractors/resolution.py: graphify/extractors/resolution.py changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 98 in resolution._apply_symbol_resolution_facts at line 1248. 40 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/resolution.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"759ef75e4083fd95a1829b75639c85674969e1404717ecd759bc4f855517705f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/detect.py: graphify/detect.py changed 57 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in detect.detect at line 1960. 38 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/detect.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a41276090b00e72510ec8ca061ef2486a82ac423e3f402649f6c1f25754394"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/dedup.py: graphify/dedup.py changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 119 in dedup.deduplicate_entities at line 950. 15 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/dedup.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/dedup.py"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdff5e14982a355595b4fa4ea2f441fda410d7f1b1ce63988b16c11fa888df4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/cache.py: graphify/cache.py changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in cache.save_semantic_cache at line 1525. 30 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/cache.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d1c71f85542be956f187d5f9bbf427666ec13f744e9e98420ac225dd560652"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/serve.py: graphify/serve.py changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in serve._subgraph_to_text at line 1120. 35 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/serve.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c04de74d1c529232757a94b052bc5a1763db168222b2f0568cbbe956942929d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/llm.py: graphify/llm.py changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in llm._call_llm at line 3041. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/llm.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/llm.py"},"region":{"startLine":3041}}}],"partialFingerprints":{"codehealthFindingId/v1":"669e1e7b3a1af30e8d2d827a87174a1639a1765a0ac3f3bf660485200a4feb5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/export.py: graphify/export.py changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in export.to_obsidian at line 760. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/export.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/export.py"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f98a8cb870d0b41519d4e745757cd5d21b1ff3a36941d6146cd1abd9d236a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/extractors/sql.py: graphify/extractors/sql.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in sql.extract_sql at line 453. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/sql.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/sql.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33b5426e27fa1d2357030c6236ac36805edfad48dcea065e3c5f764d599b669"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/ruby_resolution.py: graphify/ruby_resolution.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in ruby_resolution.resolve_ruby_member_calls at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/ruby_resolution.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/ruby_resolution.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd32445936245929a7b122c57be6b50de30269f8532b00219643e7623e1b2f3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/extractors/dart.py: graphify/extractors/dart.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 117 in dart.extract_dart at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/dart.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/dart.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"620391ae1d6e5cd9cceedeec48dad600818502384fe3f58883fd1c73cd408758"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/exporters/html.py: graphify/exporters/html.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in html.to_html at line 508. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/exporters/html.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/exporters/html.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a734ce966c7306cf1efb6e4d8e5fe1abca5668409113579e2be467fb750c19c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/report.py: graphify/report.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in report.generate at line 96. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/report.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/report.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45b0c0a9cb02d85631ba8927485d1c85dcb1ca6e66604c5c55feb2928e65070"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/install.py: graphify/install.py changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in install._agents_uninstall at line 2110. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/install.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2ff8a6919ae7f5c889838a61639d03471a7c1c140f15bf646aef4492edc78e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/extractors/solidity.py: graphify/extractors/solidity.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in solidity.extract_solidity at line 268. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/solidity.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/solidity.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"037a4064ab5900cccb4d7968ebf5e534c32fa8c682ada41874e5f96bfa8688a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/__main__.py: graphify/__main__.py changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in __main__._run_cli at line 822. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/__main__.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/__main__.py"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e86c9b1cf4d45fa8ddf7fe018d25048d0a9c4e367d987c698185243338fa08a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/analyze.py: graphify/analyze.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in analyze.suggest_questions at line 475. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/analyze.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c44e6a7fb5ff1fd4a7c4e940bcae54820a7e9460dd374ed1637f7d17fac866"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/extractors/go.py: graphify/extractors/go.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in go._go_collect_type_refs at line 106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/go.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/go.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"42505b04c869b2b79a5b0ca5c1749ad56728d0ccafd667561a4b33c1d2908548"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/extractors/terraform.py: graphify/extractors/terraform.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in terraform.extract_terraform at line 177. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/terraform.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/terraform.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfacc39bab03cdcf22f1263ab19da40b7065a1605050c0315f35d3f9aeb32db8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/cross_repo_calls.py: graphify/cross_repo_calls.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in cross_repo_calls.link_cross_repo_member_calls at line 211. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/cross_repo_calls.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cross_repo_calls.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d74a414b3cd23af0f3d54108cc43fbff0f474fe74eea03dfdad4da0bee357c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/cluster.py: graphify/cluster.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in cluster.cluster at line 233. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/cluster.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cluster.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00b8a61bfca804fb73c6e10589a6bb95d1566ef219c6f6aa99533d6c838e75d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/extractors/csharp.py: graphify/extractors/csharp.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in CsharpNameResolver.__init__ at line 204. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/csharp.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/csharp.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"704180cb1ea78f5459ec96fac6cb33a3da7ce295d686a10b5f42bd6cd915e867"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/extractors/markdown.py: graphify/extractors/markdown.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in markdown._resolve_markdown_link at line 259. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/markdown.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/markdown.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c064b479d8d7f3e6ee78f347628ba83b25939491ccc0714f8a8b67c4ea176fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/wiki.py: graphify/wiki.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in wiki.to_wiki at line 304. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/wiki.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/wiki.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"787be5006a081dc4247a892cb85ea8270b12d3f313ecc9b5d83bb2b269b7384d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/interface_dispatch.py: graphify/interface_dispatch.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in interface_dispatch.resolve_interface_dispatch at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/interface_dispatch.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/interface_dispatch.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ea7a88050014508eba4a2fcf87bfa594edf437e2bf4e5d9f84d84104c1156f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/extractors/erlang.py: graphify/extractors/erlang.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in erlang.extract_erlang at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/erlang.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/erlang.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1ca1708f68ade87c430ca2441594457f8efd7fb7ba637e6f98ee6c4fddfde6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/extractors/razor.py: graphify/extractors/razor.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in razor.extract_razor at line 11. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/razor.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/razor.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7629463af40566dce87f49b7fb514caca80cf241a2bba3d13b8efabc3d7df3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/extractors/cobol.py: graphify/extractors/cobol.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in cobol.extract_cobol at line 99. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/cobol.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/cobol.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"887ed8e585d15c971ad0934340d5f21f5bfaa7bfaff6309026fd0d102f6e56cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/markdown_resolution.py: graphify/markdown_resolution.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in markdown_resolution.resolve_markdown_mentions at line 146. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/markdown_resolution.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/markdown_resolution.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43723a6ada3f100fc928ea6ebe6a86e9a3eeb8214ad982705acadd10800cb86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/extractors/vbnet.py: graphify/extractors/vbnet.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in vbnet.extract_vbnet at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/vbnet.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/vbnet.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e53125979cd1828baff6498a755104b5d6dd2f542f19eb2dcef06d19501f74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/global_graph.py: graphify/global_graph.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in global_graph.global_add at line 79. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/global_graph.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/global_graph.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"182e5aa1f505f018fae67374094fcc60dc163ccc547dd0b3c7a9be0aa028264d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/cargo_introspect.py: graphify/cargo_introspect.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in cargo_introspect.introspect_cargo at line 80. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/cargo_introspect.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cargo_introspect.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af3ed0fd60fd28b9a7a456437c0382804d9f7f8866282e99ed5acfe1b8bc392"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/diagnostics.py: graphify/diagnostics.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in diagnostics.diagnose_extraction at line 156. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/diagnostics.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/diagnostics.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf46e38c6b698267d92d248dc524b959e44a220fbddf2ba3d675832defadfc2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: graphify/exporters/graphdb.py: graphify/exporters/graphdb.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in graphdb.push_to_falkordb at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/exporters/graphdb.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/exporters/graphdb.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1244fe2289524cb57bbc5097f169392f61abad2486b5681fc076faca9cef3dbc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: graphify/hooks.py: graphify/hooks.py changed 25 times in last 90 days and 18 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is hooks._unquote_git_path at line 149), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hooks): run the rebuild from the checkout\u0027s top level (#3258)\u201D; \u201Cfix(hooks): rebuild after cherry-pick, rebase and pull --rebase (#4490)\u201D; \u201Cfix(hooks): drop MERGE_HEAD guard from post-merge so real merges rebuild (#4463)\u201D; \u201Cfix(install): never let uninstall --purge delete the project when GRAPHIFY_OUT is empty or \u0022.\u0022\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/hooks.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/hooks.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"69203f31568501cba5334effe4f7f31dd23e189286e64c00f9654995ae9b8f71"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: graphify/paths.py: graphify/paths.py changed 17 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is paths.os_replace_with_fallback at line 84), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cache): read and write AST cache entries via extended-length paths on Windows\u201D; \u201Cfix: write graph.json as one line of compact JSON (#3413)\u201D; \u201Cfix(install): never let uninstall --purge delete the project when GRAPHIFY_OUT is empty or \u0022.\u0022\u201D; \u201Cfix: make the test suite pass on Windows (#4260)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/paths.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/paths.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac023272841fe20e372fc2acd90d9247a55e1876ae17fbc082e89a08e8fbcad"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: graphify/extractors/elixir.py: graphify/extractors/elixir.py changed 10 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is elixir.extract_elixir at line 16), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(elixir): extract defdelegate as a function definition (#4132)\u201D; \u201Cfix(elixir): emit calls edges for keyword-form def bodies\u201D; \u201Cfix(elixir): resolve qualified and aliased remote calls (#4206)\u201D; \u201Cfix(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/elixir.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/elixir.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cb1ece08b4838b547f6a94843ca9f12d86cb0285fd420562f3d90d80b82111"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: graphify/extractors/bash.py: graphify/extractors/bash.py changed 11 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is bash._bash_assignment_base at line 76), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)\u201D; \u201Cfix(bash): resolve exec-position script paths built from a variable\u201D; \u201Cfix(bash): emit calls edges for x=$(fn) command substitution (#2978)\u201D; \u201Cfix(extractors/bash): resolve dirname cmdsubst and dotdot suffix in source paths (#2596)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/bash.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/bash.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad52ad6de76f38f2c209e837bb848d8fd2d4002e679355494d7d508ec60525fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: graphify/extractors/powershell.py: graphify/extractors/powershell.py changed 7 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is powershell.extract_powershell at line 11), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(powershell): dot-source quoted/$PSScriptRoot paths and script-scope calls (#4356)\u201D; \u201Cfix(powershell): extract functions inside file-scope begin/process/end blocks (#4270)\u201D; \u201Cfix(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)\u201D; \u201Cfix(powershell): resolve member calls by receiver owner (#4163)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/powershell.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/powershell.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a41ffc8271b7c7c2f4a0e73429a3791c1ea2c4a17b72fc3768921ddfc57e03"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: graphify/extractors/julia.py: graphify/extractors/julia.py changed 7 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is julia.extract_julia at line 9), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(julia): resolve module-qualified functor types, never fall back to the variable\u201D; \u201Cfix(julia): name parametric functors by their type, not the variable\u201D; \u201Cfix(julia): extract return-typed, qualified, operator and functor methods; broadcast/pipe calls\u201D; \u201Cfix(julia,fortran): extract where-clause funcs, parametric types, and named generic interfaces (#4126, #4128, #4141)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/julia.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/julia.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef443703ec23a330729f7249a0ce8fd932fa3d7fc789228ea2e3af07be276418"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: graphify/file_slice.py: graphify/file_slice.py changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is file_slice.expand_oversized_files at line 181), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(detect/extract): structurally extract .yaml/.yml config files (#2214)\u201D; \u201Cfix(detect): classify Jinja templates as documents (#3427)\u201D; \u201Cfix(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)\u201D; \u201Cfix(llm): bisect PDF slices on extracted text; reconcile splittable-PDF tests (#2906)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/file_slice.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/file_slice.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"370f1d640a8aa656798f5d38638129832e06518c43eee93d1b0c28f982c1472d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: graphify/security.py: graphify/security.py changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is security.validate_url at line 105), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(security): reject embedded URL credentials\u201D; \u201Cfix(security): reject malformed URL ports\u201D; \u201Cfix(security): reject HTTP URLs without a hostname\u201D; \u201Cfix(extract): also redact opaque Bearer tokens; guard against over-redaction\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/security.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/security.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"87327941fdc9138eb0044b9073f128ac42d01e38ee16d9d899a30ad8bef65474"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: graphify/extractors/fortran.py: graphify/extractors/fortran.py changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is fortran.extract_fortran at line 72), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(fortran): extract named generic interfaces as callable nodes\u201D; \u201Crevert(fortran): drop re-implementation of #4141 in favor of PR #4142\u201D; \u201Cfix(julia,fortran): extract where-clause funcs, parametric types, and named generic interfaces (#4126, #4128, #4141)\u201D; \u201Cfix(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/fortran.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/fortran.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f12308bfa09b810f2c9f930de5ab407723966a0886886b58bd6192ea2d5e5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: graphify/extractors/base.py: graphify/extractors/base.py changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is base._read_source_bytes at line 125), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extractors): share the in-flight scan root via base, not graphify.extract (#3666)\u201D; \u201Cfix(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)\u201D; \u201Cfix(rust): stop prelude types becoming god nodes and label constructors\u201D; \u201Cfix(go): scope the predeclared-function filter to Go bare identifiers\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/base.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/base.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafaa23e47d9bf0c658db7efb5eb702e8a77c0f8c670bdd5757e8b2f3b50271b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: graphify/ingest.py: graphify/ingest.py changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is ingest._yaml_str at line 14), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ingest): never write a text capture through an existing entry\u201D; \u201Cfix: preserve earlier binary URL captures\u201D; \u201Cfix(ingest): rewrite only the host when normalizing a tweet URL for oEmbed\u201D; \u201Cfix(ingest): classify a URL by its host, not by text it contains\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/ingest.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/ingest.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbcd82bfa0228b337314b46c819ccf4f629150469706b978103fe316d54840b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: graphify/extractors/zig.py: graphify/extractors/zig.py changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is zig.extract_zig at line 20), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)\u201D; \u201Cfix(zig): emit a node per tagged-union variant with a case_of edge\u201D; \u201Cfix(zig): extract error set declarations and their members\u201D; \u201Cfix(zig): emit a node per enum member with a case_of edge\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/zig.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/zig.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef750ff7f442791751f2e9ff256b3809151cf767200acecbfe8b4ad857a47580"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: graphify/tree_html.py: graphify/tree_html.py changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is tree_html.build_tree at line 178), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tree): don\u0027t count untagged nodes as a repo when choosing merged layout\u201D; \u201Cfix(tree): group merged graphs by repo tag so repos get their own roots\u201D; \u201Cfix(html): stop a node label from breaking out of the embedded script block (#4124)\u201D; \u201Cfix(cli): surface four silent success-exit failures (#2534)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/tree_html.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/tree_html.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"41864ac0e54dbc76bf447e505ebd2bf4d2d7bff8f129ad53c98965690b4e5575"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: graphify/extractors/commonlisp.py: graphify/extractors/commonlisp.py changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is commonlisp.extract_commonlisp at line 60), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)\u201D; \u201Cfix(commonlisp): derive node ids from the full path stem\u201D; \u201Cfix(commonlisp): keep inherits edge when the superclass is in another file\u201D; \u201Cfix(commonlisp): mint sourceless stubs for import targets so edges don\u0027t dangle\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/commonlisp.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/commonlisp.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d53a19bba4cddb5494a01719aa73b6058478097b45de77582d43d605c5a6bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: graphify/extractors/ocaml.py: graphify/extractors/ocaml.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is ocaml.extract_ocaml at line 15), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extract): decode UTF-16 and non-UTF-8 source files before parsing (#4146, #4145)\u201D; \u201Cfix(ocaml): extract classes and their methods and instance variables\u201D; \u201Cfix(ocaml): don\u0027t bind a qualified external call to a same-named local def\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/ocaml.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/ocaml.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5548bd4ab295fe3b304d0668f3523975ff7664b6163b471ef62d0be86a370994"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: graphify/extractors/json_config.py: graphify/extractors/json_config.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is json_config._is_config_json at line 34), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(json_config): link a package.json dependency\u0027s manifest entry to its ref node (#4569, #4572)\u201D; \u201Cfix(extract): stop walking JSON Schema files as config manifests (#2255)\u201D; \u201Cfix(json_config): stop emitting self-referential dep imports and array-as-extends edges\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/extractors/json_config.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/json_config.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abc2a2a9532fb5c78150a46f9d5cbdbdefd5e29484b7f5a121359c5778992fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: graphify/benchmark.py: graphify/benchmark.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is benchmark.run_benchmark at line 55), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(benchmark): count the tokens of the answer query_graph returns\u201D; \u201Cfix(benchmark): guard against a node with a None label (#2674)\u201D; \u201Cfix: load raw edges-keyed graphs \u002B stop pruning alive files as deleted (#2212, #2210)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 18:20:06 \u002B01:00\u0027 --until=\u00272026-10-23 18:20:06 \u002B01:00\u0027 --full-history --no-merges -- graphify/benchmark.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/benchmark.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea034aee1693af470fb34cca8d67546c4297f859d10a611d587211bb24f052b"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 3 significant file(s) lose their only recent owner: graphify/mcp_ingest.py, scripts/gen_demo_path.py, graphify/transcribe.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3dc7d098f7cae2ba28dac295978fa00fbdff653730043d8c7121ab39459d63a4"}},{"ruleId":"D22","level":"warning","message":{"text":"Redundant entry points for graph construction. \u0060build_from_json\u0060 appears to be a thin wrapper or legacy alias for \u0060build\u0060, differing only in accepting a single extraction dict vs a list, and lacking the \u0060dedup_llm_backend\u0060 and \u0060protected_ids\u0060 parameters. This creates confusion about which function to use for new code.: Deprecate \u0060build_from_json\u0060 and have it delegate to \u0060build\u0060 with a list wrapper, or remove it if \u0060build\u0060 is the canonical entry point. (signatures: build.build_from_json(extraction: dict, directed: bool, root: str | Path | None, dedup: bool): Graph | build.build(extractions: list[dict], directed: bool, dedup: bool, dedup_llm_backend: str | None, root: str | Path | None, protected_ids: set[str] | None): Graph)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ad2f7a7014dffb1459830eb6564bb84bec0b03e81e9c38fda17f169093b2700f"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent naming convention for singular vs plural operations. \u0060edge_data\u0060 (singular) returns a single dict, while \u0060edge_datas\u0060 (plural) returns a list. Standard Python/English convention would typically be \u0060edge_data\u0060 (singular) for one item and \u0060edge_data\u0060 (plural context) or \u0060get_edge_data\u0060 for multiple, or consistently use \u0060edge_data\u0060 and \u0060edge_datas\u0060 but the latter is awkward. More importantly, if the graph supports multi-edges, \u0060edge_data\u0060 returning a single dict implies it picks one arbitrarily or fails, whereas \u0060edge_datas\u0060 returns all. The naming \u0060edge_datas\u0060 is non-standard (should be \u0060edge_data\u0060 or \u0060get_edge_data\u0060 for the list version, or \u0060edge_data\u0060 for single and \u0060edge_data_list\u0060 for plural).: Rename \u0060edge_datas\u0060 to \u0060get_edge_data\u0060 (returning list) or \u0060edge_data\u0060 (returning list) and ensure \u0060edge_data\u0060 is clearly documented as returning the first/primary edge or raising if multiple exist. Alternatively, rename both to \u0060get_edge\u0060 and \u0060get_edges\u0060 for clarity. (signatures: build.edge_data(G: Graph, u: str, v: str): dict | build.edge_datas(G: Graph, u: str, v: str): list[dict])"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1fb532617ee1a67ebc40af35648659f0d3c88c649ffc3b3e36edc3db51f83b18"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022ObservableProperty\u0022 \u2014 delete - the field name already says this"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/xaml_viewmodel/ViewModels/ToolkitViewModel.cs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d734751260b6e6ec12dbddc79091829bb9b5ed9668508cc2bf70ad7678300d61"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022RelayCommand\u0022 \u2014 delete - restates the method\u0027s RelayCommand\u003C\u003E signature"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/xaml_viewmodel/ViewModels/ToolkitViewModel.cs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"406dd778ba3dcbd17152a8f11627dacb590825c7fbdf619e9bd994fb4c8dbeca"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc8e1a13e54149042ff4324be8e405e5452c6b84492c8c03406198443efe8f75"},"properties":{"commitSha":"10f1dda0e105405b185032e7df79b6642986140e"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86000a5cc3323db9770c954481ad3366175ed153cb490ef91dadbb25c3c8ddf5"},"properties":{"commitSha":"10f1dda0e105405b185032e7df79b6642986140e"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb954bf28acba2f9531ea60fbb4a975457958c1ea72f6bdedbdff3276eea4ea5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"42228a79e7c87e4e1e0e7afff07f1e9be01390a447a83fe455e983934006fa69"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae4b19a624088a80ae967fa19fc6e2d3b4d86bf95f6afb9918729adad8224e32"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e53d9111d4f6c012fad18771857b74232d82318093e258b7920ba479146fba9d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"adedf6702b4730eccbe6a3cfb63e4df53882dae2e67e3d51e788026fa3810e77"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82a1893f62fe8dee3fcdaad2e3da3e94b86729172346ee8d336b86cb9d8780c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"858e63b519d122087663931ef01204a3992497f270290c931d6eef3617bda04f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"211c5244bda0c271e5f45cafacf4d6dc684246a256bcb9ab87eb7cdeb3a49c22"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"88580137b17d8041112b4ffd767ced6854c744bee2ed4e54b1ec4e2fac40f505"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0368062220b7d03a1fa9e9d2bccb854d86c67fc9ecc0cc9ff48703e4ad75233a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3bfb062085fda1f3c91e45900c000e1ef9d1449d8ad7ab90e3a7218da6970c0c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d818e944899ba27da1fbc623858eb1f91f4682165316fc5b831f8d206800cdd7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9477325ca6f0762a230e9ce80537dd2b2925f656c1964ad966b3318e9a8e4b80"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03f25f2a65b678272bd495b309fe8c74eaf0d2c79f89dae5def04fa6379e06c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af824e67a9afce7a225b6782e0e7b7052603032370618ed2271c6ad13486ed02"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8bf70c04964de1451829ac94e4c5ae74ae97bcef643eed5e5e877dabf53391b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65e27970639dc4058ae9d5bbbce6d4bb9d50f6604a671f16b146c55aac6a3ef0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ed059458dc0d864f79fffc2c8cd3f09ac2213f256b255ba1e07734350228541"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"734828d919d66a7143a63f49e44d49b5b7a42b90b634b4668d5c87520e0722f4"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71701a30dc110c523ceff6db9ae2146ff613421220bcc6c4fe9716bcaa1bf5e5"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ccef8fd1aa320d45be53345fcbb12d27c728a4eb5c902f90a1eed7fce5b5829"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1427296d6e0e0f0d15b477af56b088831f728b241330b1edd41f6e16a0011684"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3580304a4e2d4144d70f739d2faa08904123aee11caccd0d70748efc2c0d3caf"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b589c2f87cdc6a92353c156d26da5f80bfcbac538b838fd1d805082e609c105"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be8888e067a757315ea42cd59de475504d984912f133300dc01581aac1c0a900"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1fe5364c98740fdd7783cffc6eefbb7a2349a9e9bf72c1030223639f608c5e0"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2220ed7641adff3f32328bc6548de45cf8775024ce67dcfd88999cdb66ad2a6c"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6c487bd2ced671edc976b93177439ed642a3b13f585928f9930e7dd212f37d2b"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6970ef048d3715feefe929bf2b0c34680891e994e391049f27982fe0e5d413ef"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d4374aad4803935aa271fa27a956da35bc38fd6099d49b29b12475fd3ff61464"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"98a589f2b82f3ef1eee6631f3fd6f4f1fe1553c9f2a1dcf05d7f78d15743ef08"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17951c6bc2d8c3aac5b8912ab408c5495231d4cfd41a9f9a8d0c8ec311a9710f"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"57f00d4be58de5cfa3e306bdab79e8e77abbc2cce51b2ae7eabfdfdec485fc1d"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c7a14b65fa291554a58a6b167282c123289e1772fdadc6db7908abf326e591c7"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cbc621c4b9eda608baa05b25ce6a75dbf5c16911eda205ea506d9fb855bf0bea"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09eef8b6625b25738f8700358b71be29a093fcfe59905926f2178ad3d178132f"},"properties":{"dependency":{"package":"pillow","version":"12.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d546733b9ca45c1bd162da0b0b01ea42af530b6ed35676e28a14281b1424acd0"},"properties":{"dependency":{"package":"anyio","version":"4.13.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-4024","PYSEC-2026-4025"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"041ce66dfaf19f7320f95af54b0addd19bef1651ee4639465d26bbef12a137a0"},"properties":{"dependency":{"package":"pyjwt","version":"2.13.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4140","PYSEC-2026-4141","PYSEC-2026-4142","PYSEC-2026-4143","PYSEC-2026-4144","PYSEC-2026-4145","PYSEC-2026-4146","PYSEC-2026-4147","PYSEC-2026-4148","PYSEC-2026-4149","PYSEC-2026-4150","PYSEC-2026-4151","PYSEC-2026-4152","PYSEC-2026-4183"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c39221e7a57c94c8668f293a52beb2217070a9b1a940bee5edd4b6b0b226af4b"},"properties":{"dependency":{"package":"certifi","version":"2026.4.22","advisory":"[GHSA redacted]","aliases":["PYSEC-2026-4320"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10e04b22e35243729294f2c63d26777ab5e2f09392f1c7f89a239026644367c0"},"properties":{"dependency":{"package":"fsspec","version":"2026.4.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4217"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6fbb72981de59d5d2e2e2eb22003cc3569dddc398322df21d8b898c8b556cdaa"},"properties":{"dependency":{"package":"soupsieve","version":"2.8.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-3071","PYSEC-2026-3072","PYSEC-2026-4170","PYSEC-2026-4171"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cebe9ad6cd46790024b517d6c5049099ee23b44f50c9cae011efb57f253284fa"},"properties":{"dependency":{"package":"virtualenv","version":"21.3.3","advisory":"[GHSA redacted]","aliases":["BIT-virtualenv-2026-102925","BIT-virtualenv-2026-102930","BIT-virtualenv-2026-102937","BIT-virtualenv-2026-102938","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4011","PYSEC-2026-4012","PYSEC-2026-4013","PYSEC-2026-4014"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"273c3b74c9e071803380bf9d1995f0617b24789f1ec27c6e65b7e89c5470c5e3"},"properties":{"dependency":{"package":"pypdf","version":"6.18.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4157","PYSEC-2026-4159","PYSEC-2026-4160"],"reachability":{"kind":"production","file":"graphify/detect.py","line":595}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f268873f65bdaa9fa0eb6931555627e85a8ff8143ca35ae482b4a7d5ea5ae3e9"},"properties":{"dependency":{"package":"urllib3","version":"2.7.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4175","PYSEC-2026-4176","PYSEC-2026-4177"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"006bc09fe1c8f368204de0316eff374aa31b7c81c27de1cd301ae024f2a90b4d"},"properties":{"dependency":{"package":"cryptography","version":"49.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3552"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1cd5edb55bbbb627ab2f3a485a1a65f2b7d9e94a298b940d9d0c04d4a4bc987f"},"properties":{"dependency":{"package":"filelock","version":"3.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4457bc763dc2c97f2bf0bdecdce30f543143e31808673b82988674889c3ef8d2"},"properties":{"dependency":{"package":"mcp","version":"1.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"graphify/serve.py","line":2238}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af205982137016589c13fcf26e2ccf62675d2509e3129794e823686828d8cdc1"},"properties":{"dependency":{"package":"pip","version":"26.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-196","PYSEC-2026-3721"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9958ffb9a1831d3aa4b9a5ff26d13631913a6a56cc5e7cb007bbcdf19046f529"},"properties":{"dependency":{"package":"setuptools","version":"84.0.0","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5cfed0ee4e80785ce23c7083cffdead9acc6c64f9dce56a00ca7178bd3d7bee5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f51a163f26d94ce6b6f473117dde579d091c8cbf9e59810475c94d9fc921120"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 3 of 99 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 99 of the 111 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: graphify/scip_ingest.py, graphify/multigraph_compat.py, graphify/pascal_resolution.py. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/scip_ingest.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74768fdbae174a21dc47da6783872585dc6c0217ee7ede63e43f2b67fe8dceb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/multigraph_compat.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3935725729231f14184e2255ac42d6a62e4cf992a56e730193f4f9023fd90157"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/pascal_resolution.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ce1d105fdc06e69e7c26d173883e472016d5d3f60271398a3fd04c2fe16a7c"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"759dca709f1a032fb6f624ce672e6afb5558fce53ecf01fb73618c4d33923164"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19d4cbb252a3e4997007fe629a8fde65a6a24e745494155b47ed43cbf523f1eb"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c593d4dbd23724f337bfb8d2c1653812f143ae255bd9b59d4b3e9c37779fa6f4"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"worked/rsl-siege-manager/graph.html"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1f9e431093a926fd5edaf400953b5f44d70c04eb9770a5d7c5501926c1c646"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"worked/rsl-siege-manager/graph.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8001d15fc84a954f6c87bd561a6d0f6e9f40c14adc4b10960c8db6a8408d65d6"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 1 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"C2","level":"warning","message":{"text":"No authorization: This repository serves requests \u2014 a request handler (uvicorn.run() (graphify/serve.py:3058) \u2014 and no route guard, auth-gate middleware, global guard or imperative check that refuses a caller (401/403, an Unauthorized/Forbidden error) was found: its endpoints may be unprotected."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":3058}}}],"partialFingerprints":{"codehealthFindingId/v1":"7798511b1aea5dbaaa7dccc4105abb08b10b88ae54d313af40305d27f95a97c6"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M3","level":"note","message":{"text":"No src/ separation: Production code isn\u0027t grouped under a src/ folder \u2014 it\u0027s spread across several top-level directories, so there\u0027s no one place that says \u0027this is the product\u0027."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 16275 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060https://unpkg.com/vis-network/standalone/umd/vis-network.min.js\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time \u2014 the executed bytes can change with nobody touching this repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"worked/rsl-siege-manager/graph.html"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d112a8c3a0d89634268c122d7151bb4f048bec8cea1323adc99344639166638"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: No packages.lock.json and no central package management \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a97b4f69ccac509400ece7eedefb06d3ede0522cd4d8bcb5c068bea719545a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_is_concept_node(G, u) or _is_concept_node(G, v)\u0060 appears character-identically in 2 files \u2014 graphify/analyze.py, worked/mixed-corpus/raw/analyze.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aef8748c992f1f24f784969c2693c2420bb60001fe46e2ec5aa393ff928b2d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_is_file_node(G, u) or _is_file_node(G, v)\u0060 appears character-identically in 2 files \u2014 graphify/analyze.py, worked/mixed-corpus/raw/analyze.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0bbe332042285c34b019c90ea7fdf778ad4d5529f5c81ce52f938376e73efd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cid_u is None or cid_v is None or cid_u == cid_v\u0060 appears character-identically in 2 files \u2014 graphify/analyze.py, worked/mixed-corpus/raw/analyze.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"f868a8c35cb351cf9ca82e8b6c76e28af3c0b833495c0b64c6ee3b435fa63d44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cu is not None and cv is not None and cu != cv\u0060 appears character-identically in 2 files \u2014 graphify/export.py, graphify/exporters/html.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/export.py"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"230d952830942d153cd4f7f576be2149b8cc059e994fab91f58e3f7917f91ee3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060edge[\u0022target\u0022] in seen_ids or edge[\u0022relation\u0022] == \u0022imports_from\u0022\u0060 appears character-identically in 4 files \u2014 graphify/extractors/cobol.py, graphify/extractors/erlang.py, graphify/extractors/r.py, graphify/extractors/solidity.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/cobol.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ff493953362794751182f652d84fd669ff89f1b78865089ce1d8227548b08a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060label.endswith(\u0022()\u0022) and G.degree(node_id) \u003C= 1\u0060 appears character-identically in 2 files \u2014 graphify/analyze.py, worked/mixed-corpus/raw/analyze.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3cd5272cef4dc27e29401fcf57736a25508e995ed5c423901bf06895a4ebbe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060label.startswith(\u0022.\u0022) and label.endswith(\u0022()\u0022)\u0060 appears character-identically in 3 files \u2014 graphify/analyze.py, graphify/build.py, worked/mixed-corpus/raw/analyze.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"803b4d29bddc29d8e265215ac3257e2f0546c9eb96e97efd1c622d33acbf4c1e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(candidates) != 1 or candidates[0] == caller\u0060 appears character-identically in 3 files \u2014 graphify/extractors/erlang.py, graphify/extractors/r.py, graphify/extractors/vbnet.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/erlang.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eabacf2b636cd02e3181ff5319b2dd2b3bd63728bbdad508dee52f095e36a50"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(value) \u003E= 2 and value[0] == value[-1] and value[0] in \u0022\u0027\\\u0022\u0022\u0060 appears character-identically in 2 files \u2014 graphify/extractors/r.py, graphify/extractors/solidity.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/r.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d890be67f89349c733357910b5a7d5e548d75b0737f12077301fbbadb4cb1f9a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060min(deg_u, deg_v) \u003C= 2 and max(deg_u, deg_v) \u003E= 5\u0060 appears character-identically in 2 files \u2014 graphify/analyze.py, worked/mixed-corpus/raw/analyze.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b2bd5ee673f0d643785f0fbf8de8868cc9c210c6298efacedcadff9479ae6a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name_node is not None and name_node.type == \u0022identifier\u0022\u0060 appears character-identically in 2 files \u2014 graphify/extractors/engine.py, graphify/extractors/resolution.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd7ecb55a537efbbd5802a0ed51f8f8589c67ea56cbbf3e14c29608696c74e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.get(\u0022id\u0022) not in repointed_from or node.get(\u0022id\u0022) in still_referenced\u0060 appears character-identically in 2 files \u2014 graphify/extractors/csharp.py, graphify/extractors/resolution.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/csharp.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91f2f8d7806d10665c8e9278021a5ecdce215df182a63793f7e38cb44f25dd7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.get(\u0022source_file\u0022) and node.get(\u0022label\u0022) == Path(str(node[\u0022source_file\u0022])).name\u0060 appears character-identically in 2 files \u2014 graphify/extractors/r.py, graphify/extractors/solidity.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/r.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cc9860440e4a99efedbddcf7c498f9a670ae1cb7440318ffe9f0c9b250dce9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not _is_file_node(G, n) and not _is_concept_node(G, n) and s \u003E 0\u0060 appears character-identically in 2 files \u2014 graphify/analyze.py, worked/mixed-corpus/raw/analyze.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"5feda12d146b6c1045223a884898926cc5b70d0520a8a3bfff7837f15ee4cce0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not data.get(\u0022_callable_class\u0022) or not data.get(\u0022source_file\u0022)\u0060 appears character-identically in 2 files \u2014 graphify/cross_repo_calls.py, graphify/cross_repo_types.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cross_repo_calls.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"56029d6c400f49c1a075c37da5d409b2c9bdc364a3145a6809e3d15296a3654b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not source_id or not target_id or source_id == target_id or key in seen_edges\u0060 appears character-identically in 5 files \u2014 graphify/extractors/cobol.py, graphify/extractors/erlang.py, graphify/extractors/r.py, graphify/extractors/solidity.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/cobol.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"65990c2cbaeb3514913cca631b4244e0b8632cb3f33eeecd14a0a27278158c3c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not u_source or not v_source or u_source == v_source\u0060 appears character-identically in 2 files \u2014 graphify/analyze.py, worked/mixed-corpus/raw/analyze.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/analyze.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"580ab643bc24d42558a9748b9d349d63e5c49d4ed71d6a161fb36e9614b08497"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.base_branch == base and p.status not in (\u0022WRONG-BASE\u0022, \u0022STALE\u0022)\u0060 appears character-identically in 2 files \u2014 graphify/prs.py, graphify/serve.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/prs.py"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4d2873470acbdc4e5d13b2129654ca82a4c8ade6675e228280f133cf371c4c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060recv is not None and recv.type == \u0022identifier\u0022\u0060 appears character-identically in 2 files \u2014 graphify/extractors/engine.py, graphify/extractors/objc.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":9244}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8bf30449d1fe8d2e616cae94608e5c4ca21813928eb2924e05d54860716d12"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060src not in node_set or tgt not in node_set\u0060 appears character-identically in 2 files \u2014 graphify/build.py, worked/mixed-corpus/raw/build.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/build.py"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f11545ceca7fce0fb3caea738c08c3a97ecb7ffd2cc9adaf30372d34b723f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tgt in valid_ids or edge[\u0022relation\u0022] in (\u0022imports\u0022, \u0022imports_from\u0022)\u0060 appears character-identically in 2 files \u2014 graphify/extractors/go.py, graphify/extractors/rust.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/go.py"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"48857ce2348b8f3a267d3e27f27c0d2b2e7f9dc0f20816ef0cbadf23cd4e1b30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060true_src is not None and true_tgt is not None\u0060 appears character-identically in 2 files \u2014 graphify/export.py, graphify/watch.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/export.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"5437f4de4b29e8fd80ccbed66f709163dc6f49180b569f612e3b6ace2ca4fc0a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type_name and type_name[:1].isupper() and len(declarators) == 1\u0060 appears character-identically in 2 files \u2014 graphify/extractors/engine.py, graphify/extractors/objc.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/engine.py"},"region":{"startLine":3102}}}],"partialFingerprints":{"codehealthFindingId/v1":"518c0d8dc713e5874a1b704060a9c20b95b36d04c04b3104ac467d68da1c367a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_hashable\u0060 (in \u0060scope_semantic_result\u0060) returns \u0060False\u0060 when \u0060TypeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf9720e485ff2b91c1475475279d348b0b80284be4c5a1872caf9b40823ac42"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060edge_dangles\u0060 (in \u0060scope_semantic_result\u0060) returns \u0060False\u0060 when \u0060TypeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7a76ea8d88a93390d2ff7a099be0567583b1802dc31221a66a661940df1719"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060hyperedge_dangles\u0060 (in \u0060scope_semantic_result\u0060) returns \u0060False\u0060 when \u0060TypeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cache.py"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"a465f1e989d3606312cb8bf81a915838151e7016eda9dfab2efce097c1c94105"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_search_hint_terms\u0060 returns \u0060[]\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"6503a945d42ff7d2249bb527bf21f08acccb6c2041f6022fa1095bc048ddba99"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_zero_node_stamped_code_sources\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca1277d8c6693221e34ecf7ba5a9125ce41463c9ab8df005074dfeb12af5ed1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_zero_node_stamped_semantic_sources\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfe68face683122678b5496e78005cc7168a8ffb1a922a422b3416b33551723"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_prune_graph_json_sources\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/cli.py"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"081027b18f75b61b719c29bff70c5883e1e644d0149753cbe88b6df0f42c1470"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060docx_to_markdown\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3fe87620addb8b1a2a77fabbb587b396c329feb01af2fa47e67aa43814dc53"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060xlsx_to_markdown\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a2f153b0f02d5fddbc6353c83988be57e357479a24e8be9c1a1059f995e3f1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060count_words\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"519a6df852d63801f94595de5ff75206fced7da25367a6181766b17c26d81a9f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_ignored\u0060 (in \u0060ignored_predicate\u0060) returns \u0060False\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0813496fb5222f9aa8a3991cad0bda4e14fdc714e68cbef3d434cd887cd3fd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_in_root\u0060 (in \u0060save_manifest\u0060) returns \u0060False\u0060 when \u0060(ValueError, OSError, RuntimeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":2716}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfa114bda036d10edf25a08ac3ac7c09af6321cab8b935b1e717344ed5533ae"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_in_root\u0060 (in \u0060detect_incremental\u0060) returns \u0060False\u0060 when \u0060(ValueError, OSError, RuntimeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/detect.py"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e80eb84af2f1dd29b8ff8608953c5e00bcb44cc51da67eea0924d57553282a1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_workspace_globs\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/resolution.py"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e51a9bb72c00c0a43b5d66ed9684218d18f76fd14a7d6b015df97dbdb65230b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_go_separators\u0060 returns \u0060[]\u0060 when \u0060UnicodeDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/extractors/sql.py"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bb40cc3b2b2d1a1a162a9a6db75b97e89d34f2a7173f859f85cbcc773c95c5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_load_json_like\u0060 returns \u0060{}\u0060 when \u0060(OSError, json.JSONDecodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/install.py"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"66807b5e27b37b2e8b40679100a112d25ab3c85fd43de9cc92079c965cff497d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_probe_reserved_key_attr_rejected\u0060 returns \u0060True\u0060 when \u0060TypeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/multigraph_compat.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d870af684172d5d6e24aaec53992fa96f11a9e23be06c9302d140a8b6edfc7f3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060load_learning_overlay\u0060 returns \u0060{}\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/reflect.py"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"35da777ed397c174b5486165f61f764d231852942a40c2a8016289c14ee2c4b2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_max_server_contexts\u0060 returns \u00608\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/serve.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbdc12df6cf446e0f030ede5628e467e772ad685a815e5d1689a05df174b166"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_referenced_unscanned_identities\u0060 returns \u0060set()\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"graphify/watch.py"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f54fd39346e0b44f82074ef0085cb304e88fdc139ba4bdeb5c218e0c0740abc"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":61,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}