{"$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":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"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":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"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":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"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":"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":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"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":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"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":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"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":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"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":"query.query_graph (cyclomatic 196): query.query_graph has cyclomatic complexity 196 (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":"code_review_graph/tools/query.py"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb8b642b325600087c7eaea6945a46f0d5e3a3110d7edde6fe2ac3ed25444f2"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._dispatch (cyclomatic 165): cli._dispatch 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":"code_review_graph/cli.py"},"region":{"startLine":2721}}}],"partialFingerprints":{"codehealthFindingId/v1":"333ccd13bd37a11b3e5cf5715d0c504e21d985edd175fa826ed55af608033398"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._get_name (cyclomatic 139): CodeParser._get_name has cyclomatic complexity 139 (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":"code_review_graph/parser.py"},"region":{"startLine":22976}}}],"partialFingerprints":{"codehealthFindingId/v1":"876c726e9c2d513ec4957085f2d2c9d19f36ac8f66e5c2828675d6e949236faf"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._get_bases (cyclomatic 119): CodeParser._get_bases 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":"code_review_graph/parser.py"},"region":{"startLine":23802}}}],"partialFingerprints":{"codehealthFindingId/v1":"982328493c75e5db480506603e53459e25852d77fad9cdc67554ffdbc155e69c"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._extract_import (cyclomatic 107): CodeParser._extract_import has cyclomatic complexity 107 (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":"code_review_graph/parser.py"},"region":{"startLine":24256}}}],"partialFingerprints":{"codehealthFindingId/v1":"629c767d3e452c8f8bba08f813859f3d6a833120dd0f8a8400cd9b91d55e89be"}},{"ruleId":"D1","level":"warning","message":{"text":"incremental.incremental_update (cyclomatic 105): incremental.incremental_update has cyclomatic complexity 105 (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":"code_review_graph/incremental.py"},"region":{"startLine":3173}}}],"partialFingerprints":{"codehealthFindingId/v1":"52092462bac1a7a367130e6c47ffbf167e9cd6d9ca3c73db4378ab243802c162"}},{"ruleId":"D1","level":"warning","message":{"text":"refactor.find_dead_code (cyclomatic 98): refactor.find_dead_code 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":"code_review_graph/refactor.py"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f9ca4604758e7273323d3ca25180012dea156cd34320c933422761ec13fc1f"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._do_resolve_module (cyclomatic 88): CodeParser._do_resolve_module has cyclomatic complexity 88 (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":"code_review_graph/parser.py"},"region":{"startLine":21348}}}],"partialFingerprints":{"codehealthFindingId/v1":"d539a4430a513b3c2807be9e10260469778c2d06d974bfa097245477a4abf84b"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._get_call_name (cyclomatic 79): CodeParser._get_call_name 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":"code_review_graph/parser.py"},"region":{"startLine":24579}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0f4398f114a47d7d6bfdeaab0432159e132e8bc10263fcfff06f707789418f"}},{"ruleId":"D1","level":"warning","message":{"text":"extension.registerCommands (cyclomatic 77): extension.registerCommands has cyclomatic complexity 77 (threshold 15). Most of this is not in the body itself: 1 of the 77 points is its own statement and the rest belongs to 18 function literals inside it that branch (lines 658, 317, 246, \u2026). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d754f778320bcf47b4b2248f563315b7f73b1ad8f230b91b79e9de1cb42cc16"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._extract_functions (cyclomatic 75): CodeParser._extract_functions has cyclomatic complexity 75 (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":"code_review_graph/parser.py"},"region":{"startLine":16850}}}],"partialFingerprints":{"codehealthFindingId/v1":"a290f8afe99a18a2724861169786b0b22e237ecec14121e1d1318bf18d21e7f9"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._extract_verilog_constructs (cyclomatic 68): CodeParser._extract_verilog_constructs has cyclomatic complexity 68 (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":"code_review_graph/parser.py"},"region":{"startLine":19627}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb814d4d26cc818a2913af10a689965b6ee1785151566c145fc867aef0c828d"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._extract_calls (cyclomatic 67): CodeParser._extract_calls has cyclomatic complexity 67 (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":"code_review_graph/parser.py"},"region":{"startLine":17274}}}],"partialFingerprints":{"codehealthFindingId/v1":"9864b3a5c7fa13571d3727f1559190de9c67ca58d787a550609668ecb0a816ba"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._resolve_call_targets (cyclomatic 66): CodeParser._resolve_call_targets has cyclomatic complexity 66 (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":"code_review_graph/parser.py"},"region":{"startLine":8024}}}],"partialFingerprints":{"codehealthFindingId/v1":"1545736ab52e97319efbc535b7692982755f87624de2c7536066f29b42166c4f"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._extract_bytes (cyclomatic 64): CodeParser._extract_bytes has cyclomatic complexity 64 (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":"code_review_graph/parser.py"},"region":{"startLine":4133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1925b50a8ad3f97fc006008374d7a954067859754449f6d4011050f321678cce"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._extract_classes (cyclomatic 64): CodeParser._extract_classes has cyclomatic complexity 64 (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":"code_review_graph/parser.py"},"region":{"startLine":16553}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1a6135d1b4d6ad5a418740f0d1927e152361f10cb114fd445611d7ca18aa37"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._parse_rescript (cyclomatic 63): CodeParser._parse_rescript 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":"code_review_graph/parser.py"},"region":{"startLine":6550}}}],"partialFingerprints":{"codehealthFindingId/v1":"9257e4ffe51ba05ed26e389fa0a8c1ada3cd364a857de8879a3ac8b437a033fb"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._parse_robot (cyclomatic 61): CodeParser._parse_robot 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":"code_review_graph/parser.py"},"region":{"startLine":6234}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cd5a31b8026afe22d6eb86449a68e21747b2d69dbf8fe5a754394515b86b62"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._extract_julia_constructs (cyclomatic 60): CodeParser._extract_julia_constructs has cyclomatic complexity 60 (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":"code_review_graph/parser.py"},"region":{"startLine":13765}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e3a474113aeb2ca1ef9fed0b1e3a3d1e539fb0d0c2939651d5faa3c8003fc5"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._get_member_call_receiver_method (cyclomatic 58): CodeParser._get_member_call_receiver_method has cyclomatic complexity 58 (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":"code_review_graph/parser.py"},"region":{"startLine":17582}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8123f1d511737963ebf105b0e7daa53a3ed74de2bd4d30f8ce95b0d50c57e41"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._collect_import_names (cyclomatic 57): CodeParser._collect_import_names has cyclomatic complexity 57 (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":"code_review_graph/parser.py"},"region":{"startLine":21043}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3cc30dff80c660673865673396ad0c23e77582feee8b9ce0a464c8bb39f054"}},{"ruleId":"D1","level":"warning","message":{"text":"search.hybrid_search (cyclomatic 57): search.hybrid_search has cyclomatic complexity 57 (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":"code_review_graph/search.py"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e6eb19128af5862fbf15f64463e51d848f1aea2030ac5685b2c7e915597f52"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphStore._resolve_bare_endpoints (cyclomatic 55): GraphStore._resolve_bare_endpoints 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":"code_review_graph/graph.py"},"region":{"startLine":3969}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe7428644d59a3767cb0d9e83f536f2618f78df00149998587b2c6d84dbd6f1"}},{"ruleId":"D1","level":"warning","message":{"text":"spring_resolver.resolve_spring_di_calls (cyclomatic 53): spring_resolver.resolve_spring_di_calls 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":"code_review_graph/spring_resolver.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"451a2020efc25c2ee0d2d6a85111fdb7ce050a4800b84f83d21a6647cba600aa"}},{"ruleId":"D1","level":"warning","message":{"text":"build.build_or_update_graph (cyclomatic 53): build.build_or_update_graph 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":"code_review_graph/tools/build.py"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"86972d136601d0d4dfb2c6b19d04017e39248a9850099206038ee66dba16eb61"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._extract_from_tree (cyclomatic 52): CodeParser._extract_from_tree has cyclomatic complexity 52 (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":"code_review_graph/parser.py"},"region":{"startLine":12324}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c8390bbc431308e2ba90c6f74af10bd3cdcd6ab0b1a6ba1c2fc0b274ce9a64"}},{"ruleId":"D1","level":"warning","message":{"text":"changes.analyze_changes (cyclomatic 50): changes.analyze_changes has cyclomatic complexity 50 (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":"code_review_graph/changes.py"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d70d6cfcfad8cfef7da19278eab9b4969733685bd150e1976340282d8e870a"}},{"ruleId":"D1","level":"warning","message":{"text":"skills._install_platform_configs (cyclomatic 49): skills._install_platform_configs has cyclomatic complexity 49 (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":"code_review_graph/skills.py"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac05f6d16b620206eda5f266101aa0f93cda3ea4b39831aa5bf9cd15b43b0f0"}},{"ruleId":"D1","level":"warning","message":{"text":"graph.buildGraph (cyclomatic 44): graph.buildGraph has cyclomatic complexity 44 (threshold 15). Most of this is not in the body itself: 15 of the 44 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 466, 532, 426, \u2026). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3173296f1af42c788a8a9ec9c0e5cd558e2659aa602d9c0d1364b95c6d13eb6"}},{"ruleId":"D1","level":"warning","message":{"text":"_PyRenameScan._visit (cyclomatic 43): _PyRenameScan._visit 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":"code_review_graph/refactor.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"3089d320ca4783a74b05971cf43431c0424e2fb4764b796a2ab18c24bbf8e3d7"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._plan_integrations (cyclomatic 42): cli._plan_integrations 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":"code_review_graph/cli.py"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2db21be97cef2168e7bb0160caa8c252ca5e90a755aec0343566927c51dc7bb"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._parse_vbnet (cyclomatic 42): CodeParser._parse_vbnet 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":"code_review_graph/parser.py"},"region":{"startLine":5888}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1bed585265e691daad041c13721da530f12e65c79fcb216a4592182617380a"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._typed_bindings_from_node (cyclomatic 42): CodeParser._typed_bindings_from_node 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":"code_review_graph/parser.py"},"region":{"startLine":8809}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cc155d4eef4832e8c89081ebae67a876090b4ff132378e849b1ee7624096af"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._handle_init (cyclomatic 41): cli._handle_init 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":"code_review_graph/cli.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bfa05cda780d78a663318791ba399ea8c805df304540149d559bf5f4e38edd"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphStore.get_transitive_tests (cyclomatic 41): GraphStore.get_transitive_tests 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":"code_review_graph/graph.py"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b457dd2e962b6da0127b283e40bcb129ea13d9e0e44af382506a444b7271b1c"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._collect_file_scope (cyclomatic 40): CodeParser._collect_file_scope 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":"code_review_graph/parser.py"},"region":{"startLine":19968}}}],"partialFingerprints":{"codehealthFindingId/v1":"365cb0d5c26933feb869064c63069f1744ae9a72fdff3196ce7a319567fcd831"}},{"ruleId":"D1","level":"warning","message":{"text":"query.get_impact_radius (cyclomatic 39): query.get_impact_radius 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":"code_review_graph/tools/query.py"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2778c5b9955e9be997e15fe4d3737dc332f87b8d3e5c36b545d10b869215a4"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphStore.get_caller_test_routes (cyclomatic 38): GraphStore.get_caller_test_routes 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":"code_review_graph/graph.py"},"region":{"startLine":2734}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e88f7ce5bb3ff01ec47b53ef0712ed9ae226aa1ae0fd6b88fa7de60de68524a"}},{"ruleId":"D1","level":"warning","message":{"text":"aop_resolver.resolve_aop_advice (cyclomatic 35): aop_resolver.resolve_aop_advice 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":"code_review_graph/aop_resolver.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c56f05660885e0e84509d620b7f80e87aac139dd3e096f55e98a21843b0ea1e"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiWorktreeRouter.handle (cyclomatic 35): MultiWorktreeRouter.handle 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":"code_review_graph/multi_worktree.py"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d65de4706a97ba988e4139d81b231847a2465958f975d91bcc6a499c16e62b"}},{"ruleId":"D1","level":"warning","message":{"text":"jedi_resolver.enrich_jedi_calls (cyclomatic 34): jedi_resolver.enrich_jedi_calls 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":"code_review_graph/jedi_resolver.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a256625ae9d34af0f2d289c500fd0fcd126f7aa4757c23ef56637e6c0649dd14"}},{"ruleId":"D1","level":"warning","message":{"text":"refactor._rename_edits (cyclomatic 34): refactor._rename_edits 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":"code_review_graph/refactor.py"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"44452da36c4e55f25a264d2aa4ba3a534ca65fe456bcbe4899fc2dd26e74b02d"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._go_receiver_binding_index (cyclomatic 33): CodeParser._go_receiver_binding_index 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":"code_review_graph/parser.py"},"region":{"startLine":23390}}}],"partialFingerprints":{"codehealthFindingId/v1":"597c24edd492c549bb473f52b41bad3c0b09f8d8e7ea0693fa7f68e78b8e7061"}},{"ruleId":"D1","level":"warning","message":{"text":"temporal_resolver.resolve_temporal_calls (cyclomatic 33): temporal_resolver.resolve_temporal_calls 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":"code_review_graph/temporal_resolver.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"812087b7dd6c2d9cdb8c08eaee356a4be73de80d611e2cca6674d60babf08f02"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphStore._import_evidence (cyclomatic 32): GraphStore._import_evidence 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":"code_review_graph/graph.py"},"region":{"startLine":3788}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab783ec0ac57233bb179ab597b7a12f107733e7925322f79d822dac78bb1f27f"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._emit_laravel_endpoint_nodes (cyclomatic 32): CodeParser._emit_laravel_endpoint_nodes 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":"code_review_graph/parser.py"},"region":{"startLine":18579}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a3933390698601150b21be151f7b65b414cfa9d9b9bbad7d249c139c57c33b"}},{"ruleId":"D1","level":"warning","message":{"text":"embeddings.get_provider (cyclomatic 31): embeddings.get_provider 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":"code_review_graph/embeddings.py"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35d8b60a71173bcb58bc2e37df2b3deda89964d1c2d84abf8b6daaf00d31185"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphStore.resolve_cpp_scoped_call_targets (cyclomatic 31): GraphStore.resolve_cpp_scoped_call_targets 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":"code_review_graph/graph.py"},"region":{"startLine":3535}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6cd8a7835018e728ec3d30aa996472feba5a2ca2bb273b2b99a4f31eda034e"}},{"ruleId":"D1","level":"warning","message":{"text":"graph.node_to_dict (cyclomatic 31): graph.node_to_dict 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":"code_review_graph/graph.py"},"region":{"startLine":5886}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf7d3a49cbaaf85331e0d9863be9bdd25542a5d1f0538859309175c4df736af"}},{"ruleId":"D1","level":"warning","message":{"text":"npm_alias_resolver._token_comparators (cyclomatic 31): npm_alias_resolver._token_comparators 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":"code_review_graph/npm_alias_resolver.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a9c853dbf13887a743c43d33c37e81ac448ce7378a51ab3e6284194ee1e694"}},{"ruleId":"D1","level":"warning","message":{"text":"review.get_review_context (cyclomatic 31): review.get_review_context 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":"code_review_graph/tools/review.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f900e55f98b4a73046babb59ac55c4ef18bedc0d6dd20ea639984369e3181a8"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._emit_spring_field_injection (cyclomatic 30): CodeParser._emit_spring_field_injection 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":"code_review_graph/parser.py"},"region":{"startLine":15473}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20698f45bcb831328b76c1f0c84b81e55ecd1be36f7be85012b6d35ad5c375c"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._rust_project_context (cyclomatic 30): CodeParser._rust_project_context 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":"code_review_graph/parser.py"},"region":{"startLine":22266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3858437cd056a21a98e3a10feebacdae2f39d78ff7f6911b0e1ab0239a1a3a"}},{"ruleId":"D1","level":"warning","message":{"text":"scoped_resolver.resolve_scoped_calls (cyclomatic 30): scoped_resolver.resolve_scoped_calls 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":"code_review_graph/scoped_resolver.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"662ed4a1f9efc40159505819fedec67ea80b6d285fdb5822d644c14c72f1b9fc"}},{"ruleId":"D1","level":"warning","message":{"text":"skills._merge_yaml_mcp_server (cyclomatic 30): skills._merge_yaml_mcp_server 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":"code_review_graph/skills.py"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e65d3ad013189762275f7005c971fe5c4f9425eaf2d3ca535880219c8443a96"}},{"ruleId":"D1","level":"warning","message":{"text":"custom_languages._validate_entry (cyclomatic 29): custom_languages._validate_entry 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":"code_review_graph/custom_languages.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79fef45a706cffa909d9f7a37052789d700710042331975bba631406c1557e1"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._parse_sql (cyclomatic 29): CodeParser._parse_sql 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":"code_review_graph/parser.py"},"region":{"startLine":7315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95c43eadef47f37f8f14d2717a0e33fb560aaeea53c8e629db2d297995064e4"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._parse_ansible_tasks (cyclomatic 29): CodeParser._parse_ansible_tasks 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":"code_review_graph/parser.py"},"region":{"startLine":12093}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68d23a6d1c5ca3c07cf7a2e5f81ed0387e0fc6e8e298d8ecdf25d6ec4eb1076"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._extract_elixir_constructs (cyclomatic 29): CodeParser._extract_elixir_constructs 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":"code_review_graph/parser.py"},"region":{"startLine":12686}}}],"partialFingerprints":{"codehealthFindingId/v1":"684180006a085eb7e680ba8ecb98b0d23242c94719fb5fb72ef8e37ddb5bbe48"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._php_route_group_settings (cyclomatic 29): CodeParser._php_route_group_settings 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":"code_review_graph/parser.py"},"region":{"startLine":18448}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b43e2eab0bc1cc467bbcee26652d1e8d2d009079ca6347665a585c445be882"}},{"ruleId":"D1","level":"warning","message":{"text":"csharp_resolver.resolve_csharp_calls (cyclomatic 28): csharp_resolver.resolve_csharp_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":"code_review_graph/csharp_resolver.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d99d13c0e11cf765f47e3181f46d941f065369a35c0d3831ae724d47a1ff33"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIEmbeddingProvider._call_api (cyclomatic 28): OpenAIEmbeddingProvider._call_api 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":"code_review_graph/embeddings.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ddde564ab28dfd5755e0957d7a464aeaa9367f621783691c94f1ebd5f837d7"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphStore._plan_file_identities (cyclomatic 28): GraphStore._plan_file_identities 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":"code_review_graph/graph.py"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9ad9f8c1fa0e1d717e82c4e4594c9cf9b474cba5eaabd4961905580e066333"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphStore._resolve_inherited_endpoints (cyclomatic 28): GraphStore._resolve_inherited_endpoints 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":"code_review_graph/graph.py"},"region":{"startLine":3274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c41623d7c241cd3c95a16e0216769fee528da423e30b1987b3c45670bd06161"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._parse_svelte (cyclomatic 28): CodeParser._parse_svelte 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":"code_review_graph/parser.py"},"region":{"startLine":4852}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f8027d2dd2af4738867b435264e1cb3ffa1c6c6bdb70c5b4f13beef01538c7"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._parse_html (cyclomatic 28): CodeParser._parse_html 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":"code_review_graph/parser.py"},"region":{"startLine":4983}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e71652ba52e829fe809bd071e99f05118de089fd9444e6127ed2b02e97ee9e"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._extract_solidity_constructs (cyclomatic 28): CodeParser._extract_solidity_constructs 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":"code_review_graph/parser.py"},"region":{"startLine":19304}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fb1d88624f35b1df2cf90f910e34934edd1a0915de59bee458e7f3c6ecfda3"}},{"ruleId":"D1","level":"warning","message":{"text":"parser._strip_rescript_noise (cyclomatic 28): parser._strip_rescript_noise 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":"code_review_graph/parser.py"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"605bd635121731d6b841e9f20bee4e6a84f78582a4f9a1690141e778725c3243"}},{"ruleId":"D1","level":"warning","message":{"text":"refactor._lexical_sites (cyclomatic 28): refactor._lexical_sites 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":"code_review_graph/refactor.py"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0218a400faa91f3380884a5f5e24c2237be0ead164e1e1479cd19e60bfd7b6f"}},{"ruleId":"D1","level":"warning","message":{"text":"rescript_resolver.resolve_rescript_cross_module (cyclomatic 28): rescript_resolver.resolve_rescript_cross_module 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":"code_review_graph/rescript_resolver.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0e2cc1ccfc56b6bd2964c0d2044e8c3726c57479e5603cf8a5871e1b03eb94"}},{"ruleId":"D1","level":"warning","message":{"text":"build._run_postprocess (cyclomatic 28): build._run_postprocess 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":"code_review_graph/tools/build.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"92896961aa9e8a595d19907575b026719c461de486ac49bb471f05f4c17fe2b4"}},{"ruleId":"D1","level":"warning","message":{"text":"wiki._generate_community_page (cyclomatic 28): wiki._generate_community_page 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":"code_review_graph/wiki.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dff590aab81f1d9f3f77f5aa98055b298471ca78abaec0afed7d15132fe87d"}},{"ruleId":"D1","level":"warning","message":{"text":"crg_readonly._command_args (cyclomatic 27): crg_readonly._command_args 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":"code_review_graph/assets/code-review-graph/scripts/crg_readonly.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e93d4a9e57573a836a354f4cfd9089e8ed5876aaea20850c9f1bd3115faa5e7"}},{"ruleId":"D1","level":"warning","message":{"text":"flows.incremental_trace_flows (cyclomatic 27): flows.incremental_trace_flows 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":"code_review_graph/flows.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"513c6bcdc06342a3544a0ad0d4459a5d5d526a649d5fe1c3813f49f733f5fea7"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._mask_cpp_qt_macros (cyclomatic 27): CodeParser._mask_cpp_qt_macros 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":"code_review_graph/parser.py"},"region":{"startLine":4449}}}],"partialFingerprints":{"codehealthFindingId/v1":"874cc68cb6ae12781f9f0bfa4f1cfdd8daa00ac8dc5916bed5b2b806c6683f37"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._parse_vue (cyclomatic 27): CodeParser._parse_vue 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":"code_review_graph/parser.py"},"region":{"startLine":4740}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fa95d209d2b8129ce0bd059b30de2c54005cee262b8556bb96698985610dee"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._python_expression_class_evidence (cyclomatic 27): CodeParser._python_expression_class_evidence 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":"code_review_graph/parser.py"},"region":{"startLine":9926}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cccb0e264919037db292322eb4d03b08f1b3774baecb93e45018936faa670d"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._emit_kafka_edges_from_class (cyclomatic 27): CodeParser._emit_kafka_edges_from_class 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":"code_review_graph/parser.py"},"region":{"startLine":16306}}}],"partialFingerprints":{"codehealthFindingId/v1":"45739df616893a0f0d307dbdd5da28f567157b4a3e6439f23cc2c16e583599b9"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._resolve_exported_symbol (cyclomatic 27): CodeParser._resolve_exported_symbol 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":"code_review_graph/parser.py"},"region":{"startLine":22758}}}],"partialFingerprints":{"codehealthFindingId/v1":"2274320fcb23e7b7cbfd35d03b6aeb0e562f48bb6cf995dd6085d9cdb8a03f95"}},{"ruleId":"D1","level":"warning","message":{"text":"python_resolver.resolve_python_imports (cyclomatic 27): python_resolver.resolve_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":"code_review_graph/python_resolver.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"89def6a8205ac566fc115919ab70efa326591e502c9609f16a8dbc3e1e023eac"}},{"ruleId":"D1","level":"warning","message":{"text":"_JsScan.run (cyclomatic 27): _JsScan.run 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":"code_review_graph/refactor.py"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c8e5b3bdcab4a5b747ee153e0f73e61a23ea0cee05e3fdda181decde8e8d6d"}},{"ruleId":"D1","level":"warning","message":{"text":"_PyRenameScan._visit_import_from (cyclomatic 26): _PyRenameScan._visit_import_from 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":"code_review_graph/refactor.py"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fc93faa5b327408d1e5473b464961dcf96b512b108cb974dbf13c29354ab68"}},{"ruleId":"D1","level":"warning","message":{"text":"graph.getVisibleData (cyclomatic 26): graph.getVisibleData has cyclomatic complexity 26 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. 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":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da2ad85e495c9fef6ab52b8ae842c29ef84a2eea9b51780e2d76847e2ef0315"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._handle_build_update (cyclomatic 25): cli._handle_build_update 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":"code_review_graph/cli.py"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ca1ab69fc31e8abc04aca590cd4623a4c1ed6c9670062d1274a8e71c0841b5"}},{"ruleId":"D1","level":"warning","message":{"text":"VoyageEmbeddingProvider._call_api (cyclomatic 25): VoyageEmbeddingProvider._call_api 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":"code_review_graph/embeddings.py"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b15ca2e7e95101e4481dd915a9e162834e3722b07389f83cf35b3a4565c221"}},{"ruleId":"D1","level":"warning","message":{"text":"enrich._format_node_context (cyclomatic 25): enrich._format_node_context 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":"code_review_graph/enrich.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"add1458f0bcb913567f96962d1cfd1d6077833eab2a4e3af97e80b05e27ef3c7"}},{"ruleId":"D1","level":"warning","message":{"text":"reporter.generate_readme_tables (cyclomatic 25): reporter.generate_readme_tables 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":"code_review_graph/eval/reporter.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d76538545c60eca15974df6cf401efd5188d5ee5b25a75f703714fb4fc18fb9"}},{"ruleId":"D1","level":"warning","message":{"text":"hcl_resolver.resolve_hcl_module_references (cyclomatic 25): hcl_resolver.resolve_hcl_module_references 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":"code_review_graph/hcl_resolver.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4eaf25d2ed48452d169155bf19c9ddd0d9def4b1eff500ed6281765797d5ac"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.find_surprising_connections (cyclomatic 24): analysis.find_surprising_connections 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":"code_review_graph/analysis.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9798fcd67436a66a2ae6555c2c0e18e95bd11b56d2276cb8152505750d0a499"}},{"ruleId":"D1","level":"warning","message":{"text":"InheritanceIndex.resolve_type (cyclomatic 24): InheritanceIndex.resolve_type 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":"code_review_graph/inheritance.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf65e5f78c668ca59928b6d17cde8f94baf2453e9271fbd14d94005989f6ea8d"}},{"ruleId":"D1","level":"warning","message":{"text":"install_gitignore.repo_files (cyclomatic 24): install_gitignore.repo_files 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":"code_review_graph/install_gitignore.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bd46cf49fd6188e14f4e9d1d024106ba8dad409fd5a78e3fb4c2aa558d222c"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._parse_json (cyclomatic 24): CodeParser._parse_json 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":"code_review_graph/parser.py"},"region":{"startLine":11493}}}],"partialFingerprints":{"codehealthFindingId/v1":"3230c2487b632eee28a67059eec04ce1121c164aed64503b499256511274ed2a"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._read_python_module_alias (cyclomatic 24): CodeParser._read_python_module_alias 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":"code_review_graph/parser.py"},"region":{"startLine":20570}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab6dcf293cab99784277d46620a52968597d0f59d2351ff9b20151ffecdaa65"}},{"ruleId":"D1","level":"warning","message":{"text":"context.get_minimal_context (cyclomatic 24): context.get_minimal_context has cyclomatic complexity 24 (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":"code_review_graph/tools/context.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"28315a524a7718e8fcae6a9f8cf321570ba0508293a82fdbb42bd53183e133dd"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphStore._get_impact_radius_networkx (cyclomatic 23): GraphStore._get_impact_radius_networkx 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":"code_review_graph/graph.py"},"region":{"startLine":4906}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27c79dd26b36b7ed3c7299857958e34294f24af7579841a336056f0b6abdf03"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._parse_databricks_py_notebook (cyclomatic 23): CodeParser._parse_databricks_py_notebook 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":"code_review_graph/parser.py"},"region":{"startLine":5786}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e0c07b938081abc34fd1edebd9ca6d859c3a8958f5b0892d0c349fa26bb46f"}},{"ruleId":"D1","level":"warning","message":{"text":"refactor._python_rename_sites (cyclomatic 23): refactor._python_rename_sites 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":"code_review_graph/refactor.py"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"90434ae4e6b93719163e61d2360c422b6af1a838d3352791662c7a86f6635a6e"}},{"ruleId":"D1","level":"warning","message":{"text":"refactor.apply_refactor (cyclomatic 23): refactor.apply_refactor 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":"code_review_graph/refactor.py"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a876421d9eb2a54fc850ef02d086fa97492974e65f49cb2ba8cc98fbc50431"}},{"ruleId":"D1","level":"warning","message":{"text":"uninstall._remove_yaml_entry (cyclomatic 23): uninstall._remove_yaml_entry has cyclomatic complexity 23 (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":"code_review_graph/uninstall.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24cfeedb0769a338b212410f261dede9d194048f22e2312e935b55296724a13"}},{"ruleId":"D1","level":"warning","message":{"text":"install_gitignore.apply (cyclomatic 22): install_gitignore.apply 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":"code_review_graph/install_gitignore.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3686b8548ce8f0428830a664097181454633da72b93fb5291dc4f5c681074a"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._strip_plsql_noise (cyclomatic 22): CodeParser._strip_plsql_noise 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":"code_review_graph/parser.py"},"region":{"startLine":7092}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1bcf07ef42c4b57d774b9cea6723f48f23f2535f3cd8be0213b60a1aea2f19"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._handle_zig_var_decl (cyclomatic 22): CodeParser._handle_zig_var_decl 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":"code_review_graph/parser.py"},"region":{"startLine":14550}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c9cc86ffa1ff9e71008e63ece71e49e48619a37df3f524ce760e88cd6f9636"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._extract_js_var_functions (cyclomatic 22): CodeParser._extract_js_var_functions 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":"code_review_graph/parser.py"},"region":{"startLine":14935}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2255984fdf23db6110fd0e021ca38ecb5d91ccbd3ddc83ee92fc0d5b736240"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._resolve_rust_module_file (cyclomatic 22): CodeParser._resolve_rust_module_file 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":"code_review_graph/parser.py"},"region":{"startLine":22415}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a5fe3a8405afb68726403cda8f5d3363ab230754b404851ca158bf1e8b766d"}},{"ruleId":"D1","level":"warning","message":{"text":"visualization._aggregate_community (cyclomatic 22): visualization._aggregate_community 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":"code_review_graph/visualization.py"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a53711a92045e28ecf5b9f22ed1888c06b7bd7f90ca5f68770aa348d3e30b7"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.resolve_mcp_entry (cyclomatic 21): doctor.resolve_mcp_entry 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":"code_review_graph/doctor.py"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9bdcae6b99aec96513e6fa23ec8efbbe8fb17b33e08c160b7ba393036d3b60"}},{"ruleId":"D1","level":"warning","message":{"text":"jsonc.tokenize (cyclomatic 21): jsonc.tokenize 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":"code_review_graph/jsonc.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b3671b9c7f606cfa47989a0a8ffd1fdce0907ea527c5ae397d42c601e1d523"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._parse_notebook_cells (cyclomatic 21): CodeParser._parse_notebook_cells 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":"code_review_graph/parser.py"},"region":{"startLine":5651}}}],"partialFingerprints":{"codehealthFindingId/v1":"873d8e0fc37977491ddf953627239496fcf29ddce0b1968e08e3c1b8e4656865"}},{"ruleId":"D1","level":"warning","message":{"text":"parser._python_type_checking_aliases (cyclomatic 21): parser._python_type_checking_aliases 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":"code_review_graph/parser.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd29d168d11dbd498897ad5f301f7e0f7930fc84c28c66dd56e760a971a97ede"}},{"ruleId":"D1","level":"warning","message":{"text":"skills._copilot_vscode_detected (cyclomatic 21): skills._copilot_vscode_detected has cyclomatic complexity 21 (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":"code_review_graph/skills.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f8e81e44932df4eff63148e4c5766d73b9bd4e6fc6ad9ad762b67c3e79a0f0"}},{"ruleId":"D1","level":"warning","message":{"text":"review.detect_changes_func (cyclomatic 21): review.detect_changes_func 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":"code_review_graph/tools/review.py"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5484176b48178b14124e7a6e83ada92892453109e89f6a0af63bf1f7826e9d"}},{"ruleId":"D1","level":"warning","message":{"text":"codex_skill.install_codex_skill (cyclomatic 20): codex_skill.install_codex_skill 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":"code_review_graph/codex_skill.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42ea19f51f03905f2cceaa7725d51b5abb904ffd60f1305076fbb2cfe6b9ea7"}},{"ruleId":"D1","level":"warning","message":{"text":"exports.export_obsidian_vault (cyclomatic 20): exports.export_obsidian_vault 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":"code_review_graph/exports.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec35a11929b1cda7b9a132574b778299b51f9d3c257b177eac3dc62de54e4bd0"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphStore.__init__ (cyclomatic 20): GraphStore.__init__ 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":"code_review_graph/graph.py"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"d846a5e4548e7d9b9a3d08e13ce997652b8c07f477af8301791c89c5300433e8"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphStore.get_ambiguous_call_tests (cyclomatic 20): GraphStore.get_ambiguous_call_tests 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":"code_review_graph/graph.py"},"region":{"startLine":2542}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b82850c3b5c1dd12f0e069d10e02f0847957c3cc5a3c59c50a3cdf1193928d5"}},{"ruleId":"D1","level":"warning","message":{"text":"_WatchSupervisor._replan_if_requested (cyclomatic 20): _WatchSupervisor._replan_if_requested 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":"code_review_graph/incremental.py"},"region":{"startLine":4186}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bc3099c994ba2c95eb66ba94beb97325a5b6ad7a2f8d5357db9aaefa3917ff"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._add_xslt_apply (cyclomatic 20): CodeParser._add_xslt_apply 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":"code_review_graph/parser.py"},"region":{"startLine":5506}}}],"partialFingerprints":{"codehealthFindingId/v1":"9108781d18297525c5d3cf8c3bfba81b2226414d5019406c949b28164e9be430"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._plsql_member_signature (cyclomatic 20): CodeParser._plsql_member_signature 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":"code_review_graph/parser.py"},"region":{"startLine":7259}}}],"partialFingerprints":{"codehealthFindingId/v1":"056f23e416343302deb5ff41fef1fca8ab045e9fb109246544d9a2c71d5f878d"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._resolve_julia_call_targets (cyclomatic 20): CodeParser._resolve_julia_call_targets 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":"code_review_graph/parser.py"},"region":{"startLine":8387}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3af70bbe04368901d7678f40bda43b7a757b06231c5dd5cb8ab7953c7c63d7b"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._extract_nix_constructs (cyclomatic 20): CodeParser._extract_nix_constructs 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":"code_review_graph/parser.py"},"region":{"startLine":13048}}}],"partialFingerprints":{"codehealthFindingId/v1":"477975f62d76c9da95433f653c58a2175c8f4cd43978eeae539d8edc1bdcf85d"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._handle_lua_variable_declaration (cyclomatic 20): CodeParser._handle_lua_variable_declaration 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":"code_review_graph/parser.py"},"region":{"startLine":14205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c4994328805047312774787736be026ce1e23e3d7ad7464aa56479b0e1f075"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._js_wrapped_function (cyclomatic 20): CodeParser._js_wrapped_function 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":"code_review_graph/parser.py"},"region":{"startLine":14861}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76702eb6f339350b811db4f8d0b8adcd8ee210bc39e16690e89532f7c8a7381"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._get_csharp_receiver_method (cyclomatic 20): CodeParser._get_csharp_receiver_method 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":"code_review_graph/parser.py"},"region":{"startLine":17747}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2de999c4db7f2204f59354b3c92066602005751d7391f93292e32d6872330b7"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._python_name_bindings (cyclomatic 20): CodeParser._python_name_bindings 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":"code_review_graph/parser.py"},"region":{"startLine":20662}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08d072b151add2004494ea576959e590be3dacd2f30679ab154dffe46441de4"}},{"ruleId":"D1","level":"warning","message":{"text":"uninstall._clean_hook_data (cyclomatic 20): uninstall._clean_hook_data 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":"code_review_graph/uninstall.py"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cac04ec3f744651b0ce9825e14471673127f227113e175c9eaf6549b50431d"}},{"ruleId":"D1","level":"warning","message":{"text":"uninstall._process_platform_configs (cyclomatic 20): uninstall._process_platform_configs 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":"code_review_graph/uninstall.py"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4e86779bacbbbde886a7865c68ea1ecbf9a1503346f7b86440cbd02bd2946a"}},{"ruleId":"D1","level":"warning","message":{"text":"visualization._export_seeded (cyclomatic 20): visualization._export_seeded 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":"code_review_graph/visualization.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3208918c11977ae87be9374eb26d392386d14cbd052b3b8713bf8f5d2c47b7"}},{"ruleId":"D1","level":"warning","message":{"text":"workspace_resolver._exports_targets (cyclomatic 20): workspace_resolver._exports_targets 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":"code_review_graph/workspace_resolver.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7e5064c3e2db102e7ffc2f6a50699691c2fbd42c588a76de689dc2370c8cec"}},{"ruleId":"D1","level":"warning","message":{"text":"navigation.registerNavigationCommands (cyclomatic 20): navigation.registerNavigationCommands has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 75, 16, 153, \u2026). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/navigation.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e123665846165cd474b6b3b2b5c11c8c638b3671a7739c3085e57fd40ed7e6"}},{"ruleId":"D1","level":"warning","message":{"text":"graph.bindToolbarEvents (cyclomatic 20): graph.bindToolbarEvents has cyclomatic complexity 20 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 10 belong to 6 function items inside it that branch. 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":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b495437726d650d4e55df05a40117e57766a092ee58ad762c972c36ffc34d51"}},{"ruleId":"D1","level":"warning","message":{"text":"changes._review_pure_deletions (cyclomatic 19): changes._review_pure_deletions 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":"code_review_graph/changes.py"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb1b74d894da85d2f0f484c42c93ef45a1273a067153f05fd614953ffce43ec"}},{"ruleId":"D1","level":"warning","message":{"text":"communities._split_oversized (cyclomatic 19): communities._split_oversized 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":"code_review_graph/communities.py"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d08cd1997c9fba502d673a4668ec5e3389ef4b70dd44ab3416a2973bbadcd09"}},{"ruleId":"D1","level":"warning","message":{"text":"daemon_cli._handle_status (cyclomatic 19): daemon_cli._handle_status 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":"code_review_graph/daemon_cli.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"18603265c53bc564380852fe96793a6ebb42b52af5e503f73368101a76a76abb"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.check_hooks (cyclomatic 19): doctor.check_hooks 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":"code_review_graph/doctor.py"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1f9a4696619dcef226edf91ca6807e33f8253175a936d012fb9a6657b03aee"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphStore._align_edge_with_collisions (cyclomatic 19): GraphStore._align_edge_with_collisions has cyclomatic complexity 19 (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":"code_review_graph/graph.py"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"302037543677a6b5b2d13be0e32a2138112d3d5fdd4811fc55810d00f40ea14c"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphStore._receiver_backed_candidates (cyclomatic 19): GraphStore._receiver_backed_candidates 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":"code_review_graph/graph.py"},"region":{"startLine":2969}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f0d0df0c158387bbb52d94c4dd67d455204dedda33832afa9a35de5a5fc8c8"}},{"ruleId":"D1","level":"warning","message":{"text":"incremental._walk_symlinked_dirs (cyclomatic 19): incremental._walk_symlinked_dirs 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":"code_review_graph/incremental.py"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d25c86576730be95715250ec02b1436f71abb22f9529843a37d91d693edf12"}},{"ruleId":"D1","level":"warning","message":{"text":"InheritanceIndex.__init__ (cyclomatic 19): InheritanceIndex.__init__ 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":"code_review_graph/inheritance.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbf5c8cf4b5843020edbbe6e7a601ae601a469cbb0bf28b857ed6a872bcfc9b"}},{"ruleId":"D1","level":"warning","message":{"text":"main.main (cyclomatic 19): main.main 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":"code_review_graph/main.py"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e804c817f1a83390badd1456858fa4ce22c032de26cfd961f12364e7047dec"}},{"ruleId":"D1","level":"warning","message":{"text":"neighbourhood.extract (cyclomatic 19): neighbourhood.extract has cyclomatic complexity 19 (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":"code_review_graph/neighbourhood.py"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a952f93d26abe03ea15eee210aabd7d69e46a249a42b3ef78fad9e987d0cd55"}},{"ruleId":"D1","level":"warning","message":{"text":"_PythonUnreachableCallVisitor._visit_statements (cyclomatic 19): _PythonUnreachableCallVisitor._visit_statements 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":"code_review_graph/parser.py"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a27ad984e9cc5cf0eb5ad7bca137e30430a8234ef34a0064163ebe6ee82926"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._parse_ansible_playbook (cyclomatic 19): CodeParser._parse_ansible_playbook 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":"code_review_graph/parser.py"},"region":{"startLine":11977}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0a1c8389d1885e22a2925642e40efaf72c975312200ac375b5ac052fe6983c"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._emit_temporal_stub_fields (cyclomatic 19): CodeParser._emit_temporal_stub_fields 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":"code_review_graph/parser.py"},"region":{"startLine":16218}}}],"partialFingerprints":{"codehealthFindingId/v1":"225126613d079692e69df6f056d76345c8a8edb8b80251175f4de247315f0ef4"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._php_import_bindings (cyclomatic 19): CodeParser._php_import_bindings 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":"code_review_graph/parser.py"},"region":{"startLine":18226}}}],"partialFingerprints":{"codehealthFindingId/v1":"91488b2d348fe37cd6647d85e7eb50012055a740f3fbe85ce4331a1c9c4a660c"}},{"ruleId":"D1","level":"warning","message":{"text":"_PyRenameScan._collect_all (cyclomatic 19): _PyRenameScan._collect_all 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":"code_review_graph/refactor.py"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0afb1b1893f0d398a279a7f51ba71970a115cdf20d1b851aa2aa85d7c9453b"}},{"ruleId":"D1","level":"warning","message":{"text":"_JsScan.visit_import (cyclomatic 19): _JsScan.visit_import 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":"code_review_graph/refactor.py"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f874c81e968032b920b5203b97ad8e28b2aa462d1c96278aea7dbb998ce732"}},{"ruleId":"D1","level":"warning","message":{"text":"skills._merge_hook_entries (cyclomatic 19): skills._merge_hook_entries 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":"code_review_graph/skills.py"},"region":{"startLine":3017}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e5f3429e2c0b682fc080b3c1fc6895101fe84f273f330364c9a7084e1eeffe"}},{"ruleId":"D1","level":"warning","message":{"text":"build.run_postprocess (cyclomatic 19): build.run_postprocess has cyclomatic complexity 19 (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":"code_review_graph/tools/build.py"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"09945151a4301ef35c9231a3465f03774ff36c865886686285bce8c1675277e6"}},{"ruleId":"D1","level":"warning","message":{"text":"flows_tools.get_flow (cyclomatic 19): flows_tools.get_flow 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":"code_review_graph/tools/flows_tools.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15e7cf3d74302874cf76f91265d48a541dfd4e181376fbe6e4d61ef1f75ee84"}},{"ruleId":"D1","level":"warning","message":{"text":"query.semantic_search_nodes (cyclomatic 19): query.semantic_search_nodes 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":"code_review_graph/tools/query.py"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"8963e831aabd5455e03ef768dcab7aab0ea8de68a5f9222ce4f25f4963c7ea0a"}},{"ruleId":"D1","level":"warning","message":{"text":"review._file_regions (cyclomatic 19): review._file_regions 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":"code_review_graph/tools/review.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ce36787e8a8f635c6ef7165736214d36416aab93215ed5d48c4eeb716d49ae"}},{"ruleId":"D1","level":"warning","message":{"text":"change_details._coupling (cyclomatic 18): change_details._coupling 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":"code_review_graph/change_details.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e1200b268dc2a4b4b81d6ca13454381a2ec46def13ca37aa3b867de8dfd12a"}},{"ruleId":"D1","level":"warning","message":{"text":"communities._reassign_test_nodes (cyclomatic 18): communities._reassign_test_nodes 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":"code_review_graph/communities.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f9fda22a038c9b4af9eb30ebc770863d5dea43a5699d33a49aff7cec86d054"}},{"ruleId":"D1","level":"warning","message":{"text":"embeddings._node_to_text (cyclomatic 18): embeddings._node_to_text 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":"code_review_graph/embeddings.py"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb89a82970aa0c27fb8658c905f75d9c3b97a0baa6f52870b51338476c6517b"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphStore._get_test_helper_routes (cyclomatic 18): GraphStore._get_test_helper_routes 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":"code_review_graph/graph.py"},"region":{"startLine":2654}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df928d6b32caa3914160ac3871dde0b53d35fc1e1890ebcaa0c10c35a68110f"}},{"ruleId":"D1","level":"warning","message":{"text":"incremental.get_staged_and_unstaged (cyclomatic 18): incremental.get_staged_and_unstaged 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":"code_review_graph/incremental.py"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"97de842bf92d96d9b565706e8427ab5588b27f0bd291cd6e34fd09444fbd26f9"}},{"ruleId":"D1","level":"warning","message":{"text":"incremental.full_build (cyclomatic 18): incremental.full_build 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":"code_review_graph/incremental.py"},"region":{"startLine":2988}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96b342cdbb66ac0f5e6440c6cce1cfbc440b2cf5066b3a1737d9ec720a04203"}},{"ruleId":"D1","level":"warning","message":{"text":"install_plan.render (cyclomatic 18): install_plan.render 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":"code_review_graph/install_plan.py"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"802e6405b8a576194aa25f21b45bba6877e865a163023aea64b6bc7ce6418d5b"}},{"ruleId":"D1","level":"warning","message":{"text":"neighbourhood._select_within_budget (cyclomatic 18): neighbourhood._select_within_budget 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":"code_review_graph/neighbourhood.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4a3e1ae3c54e002a0cea021028b2688f93ccb0e3d85ea8727f955a4e264845"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._xslt_template (cyclomatic 18): CodeParser._xslt_template 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":"code_review_graph/parser.py"},"region":{"startLine":5402}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf49ca3c09de4e85d9ad7ac8bbd63c1915df1b608ee956a41e0b8baa333a4dc"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._parse_notebook (cyclomatic 18): CodeParser._parse_notebook 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":"code_review_graph/parser.py"},"region":{"startLine":5567}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d4e7d7593f676f92ff65e5eed4dbd1e053f6825059562926343c6eb980033d"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._extract_hcl_constructs (cyclomatic 18): CodeParser._extract_hcl_constructs 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":"code_review_graph/parser.py"},"region":{"startLine":13192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd430aefa55448da0724a117a0ab893de90fdd3d1db30c30be0f3fc64ebfed4"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._emit_spring_config_edges (cyclomatic 18): CodeParser._emit_spring_config_edges 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":"code_review_graph/parser.py"},"region":{"startLine":15362}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2139063fa789ab0eb6233ae9689c835ce1bfc423bfc00afe91906295b451710"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._php_endpoint_handler (cyclomatic 18): CodeParser._php_endpoint_handler 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":"code_review_graph/parser.py"},"region":{"startLine":18541}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a8728caac276986b84dcf4ed7d7f2c4c6bff989c57c9fdaa4477e7f4e063bc"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._get_java_method_and_receiver (cyclomatic 18): CodeParser._get_java_method_and_receiver 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":"code_review_graph/parser.py"},"region":{"startLine":18844}}}],"partialFingerprints":{"codehealthFindingId/v1":"df213c986c8117ef14e1b31685b71de1bb58d65925ba1359aad0635df22c6f8e"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._parse_rust_use_node (cyclomatic 18): CodeParser._parse_rust_use_node 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":"code_review_graph/parser.py"},"region":{"startLine":19492}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e088e0cb97d7b4521d6c48636666afa82df328026df6d316006776437faf24"}},{"ruleId":"D1","level":"warning","message":{"text":"skills._merge_toml_mcp_server (cyclomatic 18): skills._merge_toml_mcp_server 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":"code_review_graph/skills.py"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6203aaf0d741ab72c579a8bf914ebb8b3eabfab000c0740ee78e205b588629"}},{"ruleId":"D1","level":"warning","message":{"text":"uninstall._remove_mcp_entry (cyclomatic 18): uninstall._remove_mcp_entry 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":"code_review_graph/uninstall.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a638bf73a418a5c671589ff2aecde2545fc79a65de19c51671806c578e608687"}},{"ruleId":"D1","level":"warning","message":{"text":"communities._detect_leiden (cyclomatic 17): communities._detect_leiden 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":"code_review_graph/communities.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"08016fb8768a6ee13cf89aee7d4c1d5b7c9c35fc91433c863b33871c95a82c3c"}},{"ruleId":"D1","level":"warning","message":{"text":"event_resolver.resolve_spring_events (cyclomatic 17): event_resolver.resolve_spring_events 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":"code_review_graph/event_resolver.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"160db75d1e653b81dff9e6a82386a72f3f0ef4386a39a590ceb2b934456f0c7b"}},{"ruleId":"D1","level":"warning","message":{"text":"flows.expand_changed_file_paths (cyclomatic 17): flows.expand_changed_file_paths 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":"code_review_graph/flows.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"855fe5eba0833510895b8fb100cc80c7a0cf0313d1ce19cb9c3fdb550f55eae9"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphStore._class_backed_candidates (cyclomatic 17): GraphStore._class_backed_candidates 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":"code_review_graph/graph.py"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"17649feffa6b85592b057b382494df3916948ca75a7e4d4bfb2699fe6aac8b7d"}},{"ruleId":"D1","level":"warning","message":{"text":"_WatchSupervisor.sync_watches (cyclomatic 17): _WatchSupervisor.sync_watches 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":"code_review_graph/incremental.py"},"region":{"startLine":4289}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3e673ec7e55c32ddc7d31e323c80e284e11de173725caf06ec7268ce3af591"}},{"ruleId":"D1","level":"warning","message":{"text":"incremental.get_changed_files (cyclomatic 17): incremental.get_changed_files 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":"code_review_graph/incremental.py"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef12aad55c5063c6fa1e4533108369fee40f881f24680af3a9b8a73dcf530a80"}},{"ruleId":"D1","level":"warning","message":{"text":"incremental._prewarm_parser_probes (cyclomatic 17): incremental._prewarm_parser_probes 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":"code_review_graph/incremental.py"},"region":{"startLine":2843}}}],"partialFingerprints":{"codehealthFindingId/v1":"e972718fcb8cba8a2e39918961ef2fcb15c45a1149975ee632cf281acfdef7c9"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._plsql_is_forward_decl (cyclomatic 17): CodeParser._plsql_is_forward_decl 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":"code_review_graph/parser.py"},"region":{"startLine":7208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6953a50b6a92fe13480e61e82bddc35485e9fb199da912a6090fab510b6955"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._python_module_class_identities (cyclomatic 17): CodeParser._python_module_class_identities 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":"code_review_graph/parser.py"},"region":{"startLine":9770}}}],"partialFingerprints":{"codehealthFindingId/v1":"587ba6fbd88ad792f1616b242942dcf2428868da9ee02968e5fd9f8b56b8ee43"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._cpp_function_identity (cyclomatic 17): CodeParser._cpp_function_identity 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":"code_review_graph/parser.py"},"region":{"startLine":23547}}}],"partialFingerprints":{"codehealthFindingId/v1":"e914f28fa0f4a430c4aa51f27eec49f7ffbf51947b41abd6c574526c66cc8115"}},{"ruleId":"D1","level":"warning","message":{"text":"parser._python_static_truth (cyclomatic 17): parser._python_static_truth 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":"code_review_graph/parser.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3ab40ea285414d92bbf01b413342ca78caf6f804a3573280e1997dcc3fbc17"}},{"ruleId":"D1","level":"warning","message":{"text":"parser._read_go_mod (cyclomatic 17): parser._read_go_mod 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":"code_review_graph/parser.py"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"7516abf23157894ee0a326ff048afe50312e37725dd4bcaaec05edee1ecd8c29"}},{"ruleId":"D1","level":"warning","message":{"text":"review._generate_review_guidance (cyclomatic 17): review._generate_review_guidance 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":"code_review_graph/tools/review.py"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"c637b3f7e132098899ecf32148a21bb173d62f5a8f6ac9b961af9c9af72585a1"}},{"ruleId":"D1","level":"warning","message":{"text":"TsconfigResolver._resolve_extends (cyclomatic 17): TsconfigResolver._resolve_extends 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":"code_review_graph/tsconfig_resolver.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74f43c0759747e0dab2c9dd367d370dc944f0c20d66c4a3caca008984e2bf5a"}},{"ruleId":"D1","level":"warning","message":{"text":"daemon_cli._handle_stop (cyclomatic 16): daemon_cli._handle_stop 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":"code_review_graph/daemon_cli.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"158289adc5f558fa571daa6cfa1854e379f435f7846d932f626091c9d913085a"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.check_graph (cyclomatic 16): doctor.check_graph 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":"code_review_graph/doctor.py"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e412234442b8b92e91dfb6645f5f48556b2997aed97a9c33523da70ce7e2614"}},{"ruleId":"D1","level":"warning","message":{"text":"http_origin_guard.split_host_port (cyclomatic 16): http_origin_guard.split_host_port 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":"code_review_graph/http_origin_guard.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8c4d95e033d10c0bdfbac7c279ac2214c8e33637870410e3689bfa8655c518"}},{"ruleId":"D1","level":"warning","message":{"text":"incremental._load_ignore_patterns (cyclomatic 16): incremental._load_ignore_patterns 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":"code_review_graph/incremental.py"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccee1de0357026ae5b548b1e0776acd887852f430bb2e1dd40f1981fcac0dcda"}},{"ruleId":"D1","level":"warning","message":{"text":"incremental._scan_nested_output_dirs (cyclomatic 16): incremental._scan_nested_output_dirs 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":"code_review_graph/incremental.py"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"118dc4169378c6202a447737ce55969c67b1976b5cab604581d4b21f65d90afc"}},{"ruleId":"D1","level":"warning","message":{"text":"incremental.watch (cyclomatic 16): incremental.watch 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":"code_review_graph/incremental.py"},"region":{"startLine":5177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6de17ada7c57752ae0c2611e6f6394c44d8d90f21dfd25e06cea32f9915bd47"}},{"ruleId":"D1","level":"warning","message":{"text":"NpmAliasResolver._aliases_for_file (cyclomatic 16): NpmAliasResolver._aliases_for_file 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":"code_review_graph/npm_alias_resolver.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c7984b54ee77f33494422fbe3f1f9ad8212d6086b6ac8457c4d6c849c49acb"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._extract_html_scripts (cyclomatic 16): CodeParser._extract_html_scripts 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":"code_review_graph/parser.py"},"region":{"startLine":5151}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ce435637c3082a30c215f8f39e222bcac1477a26813e9aa4bc391a3d64dbbc"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._resolve_typed_method_target (cyclomatic 16): CodeParser._resolve_typed_method_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":"code_review_graph/parser.py"},"region":{"startLine":9046}}}],"partialFingerprints":{"codehealthFindingId/v1":"792f8a98200f75b6ed8f26b33a701bab7a81d05e58836a17c34399aac20b9d2f"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._apply_typed_call_targets (cyclomatic 16): CodeParser._apply_typed_call_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":"code_review_graph/parser.py"},"region":{"startLine":9100}}}],"partialFingerprints":{"codehealthFindingId/v1":"053b8049945b0aa72b175ad4b466e853e9b7ee1bc5db2456d5cfa3adc9e66759"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._resolve_java_method_reference_target (cyclomatic 16): CodeParser._resolve_java_method_reference_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":"code_review_graph/parser.py"},"region":{"startLine":15838}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ac647d7b0941e45f5f15c7d83efdf479698a20fe52b5202e649fdc6f4ba21e"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeParser._preceding_doc_comment (cyclomatic 16): CodeParser._preceding_doc_comment 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":"code_review_graph/parser.py"},"region":{"startLine":16501}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e331ebda315f9e48875b730fe874549c02d54e8dba721e78d28b1fa4656d3d"}},{"ruleId":"D1","level":"warning","message":{"text":"parser._read_php_composer_psr4 (cyclomatic 16): parser._read_php_composer_psr4 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":"code_review_graph/parser.py"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d580d39f5da3d285b7eef83a451c51626b88ce4324e94589a4a7aaeeecf208"}},{"ruleId":"D1","level":"warning","message":{"text":"refactor._js_rename_sites (cyclomatic 16): refactor._js_rename_sites 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":"code_review_graph/refactor.py"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"b659f9a3de39c70d3da26869a26410246280fff5f042abd9786f3b63373db925"}},{"ruleId":"D1","level":"warning","message":{"text":"query.traverse_graph_func (cyclomatic 16): query.traverse_graph_func 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":"code_review_graph/tools/query.py"},"region":{"startLine":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"2060e37403caab2589f272f0b8093cad9a58c1a6bdc9e76017815a1ace642b5d"}},{"ruleId":"D1","level":"warning","message":{"text":"review._risk_by_file (cyclomatic 16): review._risk_by_file 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":"code_review_graph/tools/review.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df243fae4ab0598ae9557aed17fa7070637570d2f524a7036375d41dc27d0d2"}},{"ruleId":"D1","level":"warning","message":{"text":"TsconfigResolver._strip_jsonc_comments (cyclomatic 16): TsconfigResolver._strip_jsonc_comments 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":"code_review_graph/tsconfig_resolver.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8815f33d8b2ace2a834b67f63eb2f3c41b029200dae7d0496c87b3d1d90d24"}},{"ruleId":"D1","level":"warning","message":{"text":"SqliteReader.getImpactRadius (cyclomatic 16): SqliteReader.getImpactRadius 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":"code-review-graph-vscode/src/backend/sqlite.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cdb04b7304b086d6bbbcb7e7cf083edbb1957bccca38e91d7c7a4c78e6d17e"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._get_name (cognitive 435): CodeParser._get_name has cognitive complexity 435 (threshold 15). Drivers by points: if/else 82 (273 pts), loops 38 (144 pts), boolean chains 18 (nesting depth added 297). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":22976}}}],"partialFingerprints":{"codehealthFindingId/v1":"85920dd8d6120766232792915196e768ccb4990a2b28c6a2be4636e49645121f"}},{"ruleId":"D2","level":"warning","message":{"text":"query.query_graph (cognitive 413): query.query_graph has cognitive complexity 413 (threshold 15). Drivers by points: if/else 101 (273 pts), loops 32 (77 pts), boolean chains 34, ternaries 11 (29 pts) (nesting depth added 235). 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":"code_review_graph/tools/query.py"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"7630c62c1490d781a2dc68b1babf967e444470965c074c760723a434d68094ee"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._get_bases (cognitive 364): CodeParser._get_bases has cognitive complexity 364 (threshold 15). Drivers by points: if/else 53 (218 pts), loops 38 (134 pts), boolean chains 8, ternaries 2 (4 pts) (nesting depth added 263). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":23802}}}],"partialFingerprints":{"codehealthFindingId/v1":"0579cba61129ae9b9add9f784747fa68f75877a71ca45752dea75a3f622922f1"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._dispatch (cognitive 332): cli._dispatch has cognitive complexity 332 (threshold 15). Drivers by points: if/else 112 (216 pts), ternaries 19 (54 pts), boolean chains 28, error handling 8 (25 pts), loops 3 (9 pts) (nesting depth added 162). 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":"code_review_graph/cli.py"},"region":{"startLine":2721}}}],"partialFingerprints":{"codehealthFindingId/v1":"01379142ddafac50e19803fb1d682d8454e2f5ab1577726315e241dd62965721"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_import (cognitive 238): CodeParser._extract_import has cognitive complexity 238 (threshold 15). Drivers by points: if/else 49 (169 pts), loops 20 (55 pts), ternaries 2 (9 pts), boolean chains 5 (nesting depth added 162). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":24256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dc28f272eadd44fa4696c9ece9386c3f39af01a323f0a3297b8dc2c272f56f"}},{"ruleId":"D2","level":"warning","message":{"text":"refactor.find_dead_code (cognitive 236): refactor.find_dead_code has cognitive complexity 236 (threshold 15). Drivers by points: if/else 59 (177 pts), boolean chains 25, loops 8 (24 pts), error handling 1 (5 pts), ternaries 3 (5 pts) (nesting depth added 140). 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":"code_review_graph/refactor.py"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b12f63d53a1e7584ddff4439231799616981b3b2519f0c978c70a63a6b53fa"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._do_resolve_module (cognitive 203): CodeParser._do_resolve_module has cognitive complexity 203 (threshold 15). Drivers by points: if/else 51 (137 pts), loops 12 (33 pts), error handling 7 (18 pts), boolean chains 10, ternaries 2 (5 pts) (nesting depth added 121). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":21348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e197dee829097c7c74804404f50327d3f0de33a8e339525f81411e7acd1f52"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_julia_constructs (cognitive 181): CodeParser._extract_julia_constructs has cognitive complexity 181 (threshold 15). Drivers by points: if/else 34 (105 pts), loops 11 (39 pts), ternaries 10 (32 pts), boolean chains 5 (nesting depth added 121). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":13765}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbab92c89a3c587d5c603affe90c6d34063db19e16eae247b1373c2a8761b9f"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._get_call_name (cognitive 162): CodeParser._get_call_name has cognitive complexity 162 (threshold 15). Drivers by points: if/else 50 (111 pts), loops 14 (37 pts), boolean chains 14 (nesting depth added 84). To reduce it, split the body into named stages: move each independent 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":24579}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4644330ccf4b70d2dc6722190c2170875a3945031a93e9402afa5c426c380eb"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._resolve_call_targets (cognitive 154): CodeParser._resolve_call_targets has cognitive complexity 154 (threshold 15). Drivers by points: if/else 39 (104 pts), loops 7 (20 pts), boolean chains 19, ternaries 2 (11 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":8024}}}],"partialFingerprints":{"codehealthFindingId/v1":"3460f563e7d43a86a8968d5140c23bffb3c4fb6b9c92a13e97f11affb0e72a0b"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_verilog_constructs (cognitive 151): CodeParser._extract_verilog_constructs has cognitive complexity 151 (threshold 15). Drivers by points: if/else 36 (92 pts), loops 18 (48 pts), ternaries 4 (8 pts), boolean chains 3 (nesting depth added 90). To reduce it, split the body into named stages: move each independent 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":19627}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd969258d20f9be2c415979fa62e41e9137e5ab372acdd11c015981e3cd3f56"}},{"ruleId":"D2","level":"warning","message":{"text":"incremental.incremental_update (cognitive 148): incremental.incremental_update has cognitive complexity 148 (threshold 15). Drivers by points: if/else 46 (73 pts), boolean chains 34, error handling 6 (17 pts), ternaries 15 (16 pts), loops 5 (8 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":"code_review_graph/incremental.py"},"region":{"startLine":3173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d93a483f4a232552c6ae99f84db08a68f3d6c7e1d756e1addc7ee452af2643b"}},{"ruleId":"D2","level":"warning","message":{"text":"skills._install_platform_configs (cognitive 124): skills._install_platform_configs has cognitive complexity 124 (threshold 15). Drivers by points: if/else 39 (94 pts), ternaries 5 (14 pts), boolean chains 8, error handling 1 (4 pts), loops 2 (4 pts) (nesting depth added 69). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/skills.py"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"31900e30cdfc7769224cb7db9f2b6364f12009836069ba32d60dee983f3e87e3"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore._resolve_bare_endpoints (cognitive 120): GraphStore._resolve_bare_endpoints has cognitive complexity 120 (threshold 15). Drivers by points: if/else 33 (73 pts), ternaries 8 (22 pts), boolean chains 11, loops 4 (9 pts), error handling 2 (5 pts) (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/graph.py"},"region":{"startLine":3969}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fca98dce741cacf40f40a052d998b794d48b5a9e61a73ca10001452cd1b2c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._parse_robot (cognitive 120): CodeParser._parse_robot has cognitive complexity 120 (threshold 15). Drivers by points: if/else 37 (88 pts), loops 9 (17 pts), boolean chains 12, ternaries 1 (3 pts) (nesting depth added 61). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":6234}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca04878ddd45fb3abd2b06069a8e438deb1d7be25d4ab0aec1e98da025f1ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._collect_import_names (cognitive 117): CodeParser._collect_import_names has cognitive complexity 117 (threshold 15). Drivers by points: if/else 25 (83 pts), loops 7 (17 pts), ternaries 3 (9 pts), boolean chains 8 (nesting depth added 74). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":21043}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bfd584af775973c42530c229c6a68fdf1f66b4dc28859350d58c4e9643853c"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._parse_rescript (cognitive 112): CodeParser._parse_rescript has cognitive complexity 112 (threshold 15). Drivers by points: if/else 29 (68 pts), loops 22 (34 pts), boolean chains 8, ternaries 1 (2 pts) (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":6550}}}],"partialFingerprints":{"codehealthFindingId/v1":"35898900afb0550bb7dbbe68d0b13ed386563601826710f9a1416d90893a0d8f"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_functions (cognitive 112): CodeParser._extract_functions has cognitive complexity 112 (threshold 15). Drivers by points: if/else 45 (76 pts), boolean chains 16, loops 6 (14 pts), ternaries 5 (6 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":16850}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b89c0f36ee9a17862239d36ab2179415e9c84ae8f9812b12965dd7df877f66"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_classes (cognitive 107): CodeParser._extract_classes has cognitive complexity 107 (threshold 15). Drivers by points: if/else 40 (71 pts), ternaries 6 (15 pts), boolean chains 12, loops 4 (9 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":16553}}}],"partialFingerprints":{"codehealthFindingId/v1":"601c782648464f9f9167861b3f15f77f7a70a821aba9d1989feea7f19728f404"}},{"ruleId":"D2","level":"warning","message":{"text":"search.hybrid_search (cognitive 101): search.hybrid_search has cognitive complexity 101 (threshold 15). Drivers by points: if/else 34 (73 pts), boolean chains 13, ternaries 4 (9 pts), loops 4 (5 pts), error handling 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/search.py"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b292e07647527e6950e154b41ab1a1926986bfd7e9678977386dfa2b84aab8"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_calls (cognitive 100): CodeParser._extract_calls has cognitive complexity 100 (threshold 15). Drivers by points: if/else 25 (54 pts), boolean chains 31, ternaries 6 (15 pts) (nesting depth added 38). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":17274}}}],"partialFingerprints":{"codehealthFindingId/v1":"00215e9a70989914d5b3268c2c73a1fdd4bf3cdc6802807219ea6f7debaf8d40"}},{"ruleId":"D2","level":"warning","message":{"text":"aop_resolver.resolve_aop_advice (cognitive 94): aop_resolver.resolve_aop_advice has cognitive complexity 94 (threshold 15). Drivers by points: if/else 21 (66 pts), loops 9 (18 pts), ternaries 1 (6 pts), boolean chains 4 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/aop_resolver.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14626ea8fb233f43f705464e55c23ee777f961c136c2c080810cb7a73b969dc"}},{"ruleId":"D2","level":"warning","message":{"text":"build.build_or_update_graph (cognitive 91): build.build_or_update_graph has cognitive complexity 91 (threshold 15). Drivers by points: if/else 26 (53 pts), boolean chains 18, ternaries 7 (18 pts), error handling 1 (2 pts) (nesting depth added 39). 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":"code_review_graph/tools/build.py"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbd2f616d43598c4240d8869cf92bf8b6095c44630e3e478838b7ed35281dd4"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore.get_caller_test_routes (cognitive 90): GraphStore.get_caller_test_routes has cognitive complexity 90 (threshold 15). Drivers by points: if/else 21 (58 pts), loops 13 (29 pts), boolean chains 3 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/graph.py"},"region":{"startLine":2734}}}],"partialFingerprints":{"codehealthFindingId/v1":"548b89a247db3d382d64e57ecbfc4dc8af75435360cb01f0582828fc2c834ee3"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_bytes (cognitive 90): CodeParser._extract_bytes has cognitive complexity 90 (threshold 15). Drivers by points: if/else 51 (75 pts), boolean chains 8, loops 3 (5 pts), 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":4133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc852a3652da91d5cb358c345d05308f309e4834caa85750635533b1a162bfb"}},{"ruleId":"D2","level":"warning","message":{"text":"spring_resolver.resolve_spring_di_calls (cognitive 90): spring_resolver.resolve_spring_di_calls has cognitive complexity 90 (threshold 15). Drivers by points: if/else 26 (49 pts), boolean chains 14, ternaries 6 (13 pts), error handling 4 (8 pts), loops 6 (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":"code_review_graph/spring_resolver.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e5a7afbf9b6eb1a331c17eb48d2b1b46d2850443716389e8819b6fba6e2773"}},{"ruleId":"D2","level":"warning","message":{"text":"extension.registerCommands (cognitive 90): extension.registerCommands has cognitive complexity 90 (threshold 15). Drivers by points: if/else 66 (73 pts), ternaries 6 (8 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 10). None of this is in the body itself: all 90 points belong to 18 function literals inside it that branch (lines 658, 317, 139, \u2026). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8472f605f25131c34400482c359f5fb2f221c44db0a4c8fb525ae6d3fdbd8c52"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore.get_transitive_tests (cognitive 87): GraphStore.get_transitive_tests has cognitive complexity 87 (threshold 15). Drivers by points: if/else 18 (53 pts), loops 12 (24 pts), boolean chains 5, ternaries 3, error handling 1 (2 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":"code_review_graph/graph.py"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"656147703f6b348cd2986b819ce4058c001c9223e4aac946b5daa8fff3085699"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._collect_file_scope (cognitive 87): CodeParser._collect_file_scope has cognitive complexity 87 (threshold 15). Drivers by points: if/else 19 (53 pts), loops 5 (14 pts), boolean chains 12, ternaries 2 (8 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":19968}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecdfa68e75f2d351a776b3f69063ab4000557b776acc69734090854f3724ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._emit_kafka_edges_from_class (cognitive 86): CodeParser._emit_kafka_edges_from_class has cognitive complexity 86 (threshold 15). Drivers by points: if/else 12 (56 pts), loops 7 (28 pts), boolean chains 2 (nesting depth added 65). To reduce it, split the body into named stages: move each independent 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":16306}}}],"partialFingerprints":{"codehealthFindingId/v1":"8064bdcc1dd74b601e162a84365bffe64687ceb39080626bfe93a26d65f3a867"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._parse_vbnet (cognitive 85): CodeParser._parse_vbnet has cognitive complexity 85 (threshold 15). Drivers by points: if/else 21 (49 pts), loops 10 (22 pts), boolean chains 10, ternaries 1 (4 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":5888}}}],"partialFingerprints":{"codehealthFindingId/v1":"080cba5b2274555e2e504c7cf50eff0e276ed1860e09805601d28ddaee346332"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_from_tree (cognitive 85): CodeParser._extract_from_tree has cognitive complexity 85 (threshold 15). Drivers by points: if/else 29 (63 pts), boolean chains 21, loops 1 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":12324}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57225491cb8bb2b1a566199635c18143d5612c834cfbf59be03818b37cb319a"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._get_member_call_receiver_method (cognitive 81): CodeParser._get_member_call_receiver_method has cognitive complexity 81 (threshold 15). Drivers by points: if/else 32 (53 pts), boolean chains 22, loops 3 (6 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":17582}}}],"partialFingerprints":{"codehealthFindingId/v1":"1391a6498a0d679f674d5c0f1d73436ccff91002576c40ab89372025245724bf"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._plan_integrations (cognitive 72): cli._plan_integrations has cognitive complexity 72 (threshold 15). Drivers by points: if/else 27 (49 pts), error handling 5 (11 pts), boolean chains 7, loops 2 (4 pts), ternaries 1 (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":"code_review_graph/cli.py"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b15d3eca3415d77b07313594a87af072f76281d0d22a0ca11bfdcef03e7a25"}},{"ruleId":"D2","level":"warning","message":{"text":"refactor._lexical_sites (cognitive 72): refactor._lexical_sites has cognitive complexity 72 (threshold 15). Drivers by points: if/else 15 (45 pts), loops 5 (12 pts), ternaries 2 (9 pts), boolean chains 6 (nesting depth added 44). 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":"code_review_graph/refactor.py"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d6fe91dfc7c0b093df8ffa401635c2541ac10e73e47966436bb64a4c2e20fc"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._parse_svelte (cognitive 71): CodeParser._parse_svelte has cognitive complexity 71 (threshold 15). Drivers by points: if/else 14 (43 pts), loops 9 (26 pts), boolean chains 2 (nesting depth added 46). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":4852}}}],"partialFingerprints":{"codehealthFindingId/v1":"491c0b688747d2d07d019f780763c77458e972e407d71ec54211436b8e99c517"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._php_route_group_settings (cognitive 71): CodeParser._php_route_group_settings has cognitive complexity 71 (threshold 15). Drivers by points: if/else 17 (55 pts), ternaries 2 (8 pts), loops 3 (5 pts), boolean chains 3 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":18448}}}],"partialFingerprints":{"codehealthFindingId/v1":"519502858aef0acfd58a7e4301d05ce97a6271234c070fac598f34174fdb48ac"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._parse_vue (cognitive 70): CodeParser._parse_vue has cognitive complexity 70 (threshold 15). Drivers by points: if/else 13 (42 pts), loops 9 (26 pts), boolean chains 2 (nesting depth added 46). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":4740}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacdafa7d259723ac941b1c916f679c581ca2a208c053fc99a66bc324d8bf2d6"}},{"ruleId":"D2","level":"warning","message":{"text":"jedi_resolver.enrich_jedi_calls (cognitive 69): jedi_resolver.enrich_jedi_calls has cognitive complexity 69 (threshold 15). Drivers by points: if/else 25 (50 pts), error handling 5 (11 pts), loops 4 (6 pts), boolean chains 1, ternaries 1 (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":"code_review_graph/jedi_resolver.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"befeaaf5cf373cbecad293d614fb1d52c7bfff452aad0883664126232babb608"}},{"ruleId":"D2","level":"warning","message":{"text":"changes.analyze_changes (cognitive 68): changes.analyze_changes has cognitive complexity 68 (threshold 15). Drivers by points: if/else 32 (44 pts), loops 6 (11 pts), boolean chains 8, ternaries 3, error handling 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":"code_review_graph/changes.py"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4df91a2684ae4db1eb91df2bbe7a16b10b5e5e126ba5ec0a381e2fe5d6ddda7"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._typed_bindings_from_node (cognitive 68): CodeParser._typed_bindings_from_node has cognitive complexity 68 (threshold 15). Drivers by points: if/else 18 (50 pts), boolean chains 14, loops 2 (4 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":8809}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9be5abc6be146dc1687fa52f109ccc9e61bb13ba8aff9e0cd4349fe4a0c2ed"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore._import_evidence (cognitive 63): GraphStore._import_evidence has cognitive complexity 63 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 9 (19 pts), boolean chains 5, error handling 2 (5 pts), ternaries 1 (2 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":"code_review_graph/graph.py"},"region":{"startLine":3788}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd7c127f45c1d7feca2e7ff986d844c46081163db08065ba99269fc38cd0097"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiWorktreeRouter.handle (cognitive 63): MultiWorktreeRouter.handle has cognitive complexity 63 (threshold 15). Drivers by points: if/else 21 (37 pts), error handling 6 (17 pts), boolean chains 5, loops 1 (2 pts), ternaries 1 (2 pts) (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":"code_review_graph/multi_worktree.py"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"557e9d7dd9d58929253bb76763704585c1ee01df35159bd5d7135640005e4217"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._go_receiver_binding_index (cognitive 63): CodeParser._go_receiver_binding_index has cognitive complexity 63 (threshold 15). Drivers by points: if/else 19 (45 pts), boolean chains 10, loops 3 (5 pts), 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":23390}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5995d2520d58ff20c9bdc1b036ea9f9a53e59382d1c1168e3a6dd0ca344cb35"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._emit_spring_field_injection (cognitive 62): CodeParser._emit_spring_field_injection has cognitive complexity 62 (threshold 15). Drivers by points: if/else 12 (38 pts), loops 7 (21 pts), boolean chains 3 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":15473}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5028dfe2ec13d35748698bdab1d9113cd4344ea64a20cbc733a80711dc239a7"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._handle_init (cognitive 61): cli._handle_init has cognitive complexity 61 (threshold 15). Drivers by points: if/else 21 (32 pts), loops 5 (11 pts), ternaries 5 (9 pts), boolean chains 6, error handling 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":"code_review_graph/cli.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7fd0c28353255a6abfac23a228014feb202c01708c3d8847fa68bcb4ed41a7"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore.resolve_cpp_scoped_call_targets (cognitive 61): GraphStore.resolve_cpp_scoped_call_targets has cognitive complexity 61 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 9 (20 pts), ternaries 2 (6 pts), boolean chains 5, error handling 2 (4 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":"code_review_graph/graph.py"},"region":{"startLine":3535}}}],"partialFingerprints":{"codehealthFindingId/v1":"3262dc26643cb56dcfa36f988c7858a875a4091d304bfb24963cef0888157468"}},{"ruleId":"D2","level":"warning","message":{"text":"graph.node_to_dict (cognitive 61): graph.node_to_dict has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (43 pts), loops 4 (9 pts), boolean chains 6, ternaries 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":"code_review_graph/graph.py"},"region":{"startLine":5886}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cffcb0b5d13c46692b4c99c8ebea97cc33c25d0dcdbabcd064ebcffbc6838ea"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_solidity_constructs (cognitive 61): CodeParser._extract_solidity_constructs has cognitive complexity 61 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 6 (16 pts), ternaries 3 (12 pts), boolean chains 1 (nesting depth added 38). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":19304}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf638b8111249da34c1d60550e783d1f6bcdf9e3970ca5560054b7a22b7740ed"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._strip_rescript_noise (cognitive 60): parser._strip_rescript_noise has cognitive complexity 60 (threshold 15). Drivers by points: if/else 9 (23 pts), ternaries 4 (15 pts), loops 5 (13 pts), boolean chains 9 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5471a8cf88a2249a96f9f304957a230dcf8a87ef4ff2ad2b2c94758f56650f"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore._plan_file_identities (cognitive 59): GraphStore._plan_file_identities has cognitive complexity 59 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 11 (23 pts), boolean chains 4 (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":"code_review_graph/graph.py"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95855f4347dbc191fe104153ea41db2f64843a34320faae5084179b79ccf92a"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._mask_cpp_qt_macros (cognitive 58): CodeParser._mask_cpp_qt_macros has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (39 pts), loops 3 (7 pts), boolean chains 6, ternaries 2 (6 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":4449}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c97f14d0d7c7ba5e6829c04dcbbb01884ea35edebfdb627f84df8873e96b20"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._parse_ansible_tasks (cognitive 58): CodeParser._parse_ansible_tasks has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (37 pts), ternaries 4 (9 pts), loops 4 (8 pts), boolean chains 4 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":12093}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eff9f9bb41a9886f154d6666505a4bf4df0acba4711dc9fe72c84938024fc35"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._emit_spring_config_edges (cognitive 57): CodeParser._emit_spring_config_edges has cognitive complexity 57 (threshold 15). Drivers by points: if/else 8 (30 pts), loops 9 (27 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":15362}}}],"partialFingerprints":{"codehealthFindingId/v1":"783f021be539eb2e29762f543255cdb5801c2ee85d4c478f7e3bf0d03630000f"}},{"ruleId":"D2","level":"warning","message":{"text":"refactor._rename_edits (cognitive 57): refactor._rename_edits has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 8 (14 pts), boolean chains 8, ternaries 1 (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":"code_review_graph/refactor.py"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"9974fe1914b4a2ce08e6c0e399f53de7acd9658245d60be416ee78603b9d3d99"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._resolve_exported_symbol (cognitive 56): CodeParser._resolve_exported_symbol has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (47 pts), loops 3 (6 pts), boolean chains 2, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":22758}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a25a7699ddb7073d1553be255cf926916b567c3ddc8217900693699fed4c1c"}},{"ruleId":"D2","level":"warning","message":{"text":"_PyRenameScan._visit (cognitive 56): _PyRenameScan._visit has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 6 (12 pts), ternaries 4 (11 pts), boolean chains 5 (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":"code_review_graph/refactor.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"305f12b066e1387b4e086a758836cd6d65921baa89cabc24f748b422e4ac7274"}},{"ruleId":"D2","level":"warning","message":{"text":"graph.getVisibleData (cognitive 55): graph.getVisibleData has cognitive complexity 55 (threshold 15). Drivers by points: if/else 8 (22 pts), ternaries 4 (16 pts), loops 4 (11 pts), boolean chains 6 (nesting depth added 33). Of this number, 54 points are the body\u0027s own statements and 1 belongs to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c07ceac5d3813ee3ff1e54c42cd2bf6e05b4599e42fdd650c641568dc75a8b9"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIEmbeddingProvider._call_api (cognitive 53): OpenAIEmbeddingProvider._call_api has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (28 pts), error handling 4 (10 pts), boolean chains 7, ternaries 2 (7 pts), loops 1 (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":"code_review_graph/embeddings.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"14857b0053a3ff78027e2ba4f27c8140c123573429be8c21e74a804ca1b98c84"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_elixir_constructs (cognitive 53): CodeParser._extract_elixir_constructs has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 5 (10 pts), ternaries 3 (5 pts), boolean chains 2 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":12686}}}],"partialFingerprints":{"codehealthFindingId/v1":"97485dfe61bedc81f76abecb8a2afe4b3094faeca96a2726aaeafbaa0d1ca7da"}},{"ruleId":"D2","level":"warning","message":{"text":"temporal_resolver.resolve_temporal_calls (cognitive 53): temporal_resolver.resolve_temporal_calls has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 6, error handling 3 (6 pts), loops 6, 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":"code_review_graph/temporal_resolver.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee676bafcebd17c63c74a1a1bb6a0f2ca8c14e006b376df6d4d67936eae63a5"}},{"ruleId":"D2","level":"warning","message":{"text":"query.get_impact_radius (cognitive 52): query.get_impact_radius has cognitive complexity 52 (threshold 15). Drivers by points: if/else 24 (38 pts), boolean chains 7, ternaries 4, loops 2, error handling 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":"code_review_graph/tools/query.py"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"56635c072b87a56ba4a05df576fd4a5f9ae93c2f8e1bb1f1f5a0494195e527a0"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._handle_build_update (cognitive 51): cli._handle_build_update has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (38 pts), ternaries 4 (8 pts), boolean chains 3, error handling 1 (2 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":"code_review_graph/cli.py"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25bf497e5c87ed48388fe7dfe1e766d6cb46d912b35c2f3de3fff19415c5189"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonc.tokenize (cognitive 50): jsonc.tokenize has cognitive complexity 50 (threshold 15). Drivers by points: if/else 11 (30 pts), ternaries 2 (8 pts), loops 3 (6 pts), boolean chains 3, error handling 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":"code_review_graph/jsonc.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bb416dbba0f59f9f7803d07f12edf39393284b452de04616ee65a183d322da"}},{"ruleId":"D2","level":"warning","message":{"text":"review.get_review_context (cognitive 50): review.get_review_context has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (31 pts), boolean chains 6, ternaries 5, error handling 2 (4 pts), loops 2 (4 pts) (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":"code_review_graph/tools/review.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b698eae316eafbef9e3a90d8cca7fa93678345eed83af14cdfd2a071617d37"}},{"ruleId":"D2","level":"warning","message":{"text":"VoyageEmbeddingProvider._call_api (cognitive 49): VoyageEmbeddingProvider._call_api has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (25 pts), error handling 4 (10 pts), ternaries 2 (7 pts), boolean chains 6, loops 1 (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":"code_review_graph/embeddings.py"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"884ad0b37402946c0a79eed72869058ac14bbf8f6875b804230298d1461a8b49"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._parse_json (cognitive 49): CodeParser._parse_json has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 3 (7 pts), ternaries 2 (7 pts), boolean chains 4 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":11493}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1c16b452cbce00b1fb36bba89937b010483902f8a9cd9366b11c3eba27a2e4"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._emit_temporal_stub_fields (cognitive 49): CodeParser._emit_temporal_stub_fields has cognitive complexity 49 (threshold 15). Drivers by points: if/else 7 (27 pts), loops 5 (16 pts), boolean chains 3, ternaries 1 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":16218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95c52a04f47d5b8cbcc5def60b4d5a69d5b06432993adcaf892d9d659850f5a"}},{"ruleId":"D2","level":"warning","message":{"text":"python_resolver.resolve_python_imports (cognitive 49): python_resolver.resolve_python_imports has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 4, loops 3 (4 pts), ternaries 2 (4 pts), error handling 1 (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":"code_review_graph/python_resolver.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"46820f570dc89cea56f2c8173d1efb63815df7c61686ca95d31e864328f8d2fe"}},{"ruleId":"D2","level":"warning","message":{"text":"scoped_resolver.resolve_scoped_calls (cognitive 49): scoped_resolver.resolve_scoped_calls has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (32 pts), loops 6 (7 pts), boolean chains 4, error handling 2 (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":"code_review_graph/scoped_resolver.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6406a0a738a0a4a8990cd7bb7e6d750aba1af057bb343a4e0e439d4d3d8051a"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._emit_laravel_endpoint_nodes (cognitive 48): CodeParser._emit_laravel_endpoint_nodes has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (31 pts), ternaries 4 (7 pts), boolean chains 6, loops 3 (4 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":18579}}}],"partialFingerprints":{"codehealthFindingId/v1":"03be23248fdd9e92988ba3366f21d1b36c78fa3c632364e50e5b14d019bb67e0"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore._get_impact_radius_networkx (cognitive 47): GraphStore._get_impact_radius_networkx has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 3 (6 pts), boolean chains 5, 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":"code_review_graph/graph.py"},"region":{"startLine":4906}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afab448cc91276186d14bded13e9b7572dccb775c86c399f24f4de997a90b48"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._parse_html (cognitive 47): CodeParser._parse_html has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 6 (11 pts), boolean chains 7, ternaries 2 (4 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":4983}}}],"partialFingerprints":{"codehealthFindingId/v1":"7452afbe03f82659d875c4e80ac8dfdfb18c3a1e6998588beb6f7f57ea3f9b65"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._get_kafka_annotation_topics (cognitive 47): CodeParser._get_kafka_annotation_topics has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (36 pts), loops 4 (11 pts) (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":16276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebe4f859fb683cb0c38f955454cb1471314dfe239e857e4cb27f9fafe39ade3"}},{"ruleId":"D2","level":"warning","message":{"text":"csharp_resolver.resolve_csharp_calls (cognitive 46): csharp_resolver.resolve_csharp_calls has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (29 pts), loops 5 (8 pts), boolean chains 7, 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":"code_review_graph/csharp_resolver.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1189e47388c2706cb360de6f62f6c0cbe153e4b8e1eea2bcdefe4873b9241851"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._strip_plsql_noise (cognitive 46): CodeParser._strip_plsql_noise has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (23 pts), ternaries 5 (16 pts), boolean chains 6, loops 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":7092}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbaa3f59faff1da7f428dc88a9432d13a3e0e992de3fd1d6872e8c5874b466e4"}},{"ruleId":"D2","level":"warning","message":{"text":"wiki._generate_community_page (cognitive 46): wiki._generate_community_page has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (29 pts), loops 7 (13 pts), boolean chains 2, error handling 2 (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":"code_review_graph/wiki.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"93854d5c66c9d4e7b2e3ac42e42d609d25d64917809795b2724fa86c058bff89"}},{"ruleId":"D2","level":"warning","message":{"text":"embeddings.get_provider (cognitive 45): embeddings.get_provider has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (22 pts), ternaries 7 (13 pts), boolean chains 7, 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":"code_review_graph/embeddings.py"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"7028118181b3717eba16e91b44ee7aa8745e47092630c1f763ea5c265aa9d504"}},{"ruleId":"D2","level":"warning","message":{"text":"flows.incremental_trace_flows (cognitive 45): flows.incremental_trace_flows has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 7 (14 pts), error handling 2 (4 pts), boolean chains 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":"code_review_graph/flows.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"babed6e0bcfbb8f274bd44adfcf8197f410c3a8b659e7570f7c2bad2cdfa5857"}},{"ruleId":"D2","level":"warning","message":{"text":"install_gitignore.repo_files (cognitive 45): install_gitignore.repo_files has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 3 (6 pts), error handling 1 (3 pts), boolean chains 1, 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":"code_review_graph/install_gitignore.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e8ed9e74828a2b58f85bc69b67d189ea6633a729f06c44750f0ff9861a6099"}},{"ruleId":"D2","level":"warning","message":{"text":"_PythonUnreachableCallVisitor._visit_statements (cognitive 45): _PythonUnreachableCallVisitor._visit_statements has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (31 pts), loops 4 (12 pts), boolean chains 2 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5578d37ca8a5c6f84fda2059f99159da9b0fe9ee0e5bcfa2474dcb7b8ba24ff"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._parse_databricks_py_notebook (cognitive 45): CodeParser._parse_databricks_py_notebook has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 4 (6 pts), boolean chains 3, ternaries 1 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":5786}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfda7c1c7e7c8ad1424c76644d7f623d390e24a55d1d59546244e9fdd4d9b4d"}},{"ruleId":"D2","level":"warning","message":{"text":"reporter.generate_readme_tables (cognitive 44): reporter.generate_readme_tables has cognitive complexity 44 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 8 (12 pts), error handling 2 (6 pts), ternaries 2 (6 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":"code_review_graph/eval/reporter.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b512494bca9c91077753167b167a2ce0652dc8d9a47477f251b1891159059e"}},{"ruleId":"D2","level":"warning","message":{"text":"flows.expand_changed_file_paths (cognitive 43): flows.expand_changed_file_paths has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 6 (15 pts), error handling 2 (7 pts), ternaries 1 (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":"code_review_graph/flows.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd0e31b2593519ff2bc06570a05b170003b9659698633ff155ff08a0f3704d5"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore._get_test_helper_routes (cognitive 43): GraphStore._get_test_helper_routes has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 7 (18 pts), boolean chains 2 (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":"code_review_graph/graph.py"},"region":{"startLine":2654}}}],"partialFingerprints":{"codehealthFindingId/v1":"927713fe1136706510e08bcf290fdf15559b3ccc262438383d77560112e1d9cb"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._rust_project_context (cognitive 43): CodeParser._rust_project_context has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 4, error handling 3 (4 pts), loops 2, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":22266}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fb6e189a012ec9b40a6db98483771f799adc9097110ef4ba7016b87fbdd369"}},{"ruleId":"D2","level":"warning","message":{"text":"_PyRenameScan._visit_import_from (cognitive 43): _PyRenameScan._visit_import_from has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 5, loops 3 (5 pts), ternaries 2 (3 pts) (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":"code_review_graph/refactor.py"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ae41f601246b9e2d6e1fdadeda317cff4c08b2b7e9069fdc555effb1aa9e32"}},{"ruleId":"D2","level":"warning","message":{"text":"_JsScan.run (cognitive 43): _JsScan.run has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (31 pts), boolean chains 9, 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":"code_review_graph/refactor.py"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5746d180d63877f890e9a945f332d84804d94a9185322a05366cca9f94ca81b"}},{"ruleId":"D2","level":"warning","message":{"text":"skills._merge_yaml_mcp_server (cognitive 43): skills._merge_yaml_mcp_server has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 11, ternaries 3 (5 pts), error handling 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":"code_review_graph/skills.py"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fb37dc9b61a6fb8d93ac11486f4973d151b7ac7223192121494e5d57cae4e9"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._parse_notebook_cells (cognitive 42): CodeParser._parse_notebook_cells has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 9 (18 pts), ternaries 1 (3 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":5651}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf29e1e528ac85f9303d77434fe212e5de3a0f8fa9249f17e29f68e2cd250bde"}},{"ruleId":"D2","level":"warning","message":{"text":"skills._copilot_vscode_detected (cognitive 42): skills._copilot_vscode_detected has cognitive complexity 42 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 6 (15 pts), error handling 3 (8 pts), boolean chains 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":"code_review_graph/skills.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b743be52a9d93c11a315294b41dde07eaf9cbd9a6a5ec6bba1dbef8c66f8c7"}},{"ruleId":"D2","level":"warning","message":{"text":"incremental.full_build (cognitive 41): incremental.full_build has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (27 pts), error handling 2 (6 pts), loops 2 (4 pts), boolean chains 3, ternaries 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":"code_review_graph/incremental.py"},"region":{"startLine":2988}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d264397bff54c4f24adc4afe3f8ecfa6d6eb2fc4d753ccdcefc654469ca07f"}},{"ruleId":"D2","level":"warning","message":{"text":"InheritanceIndex.resolve_type (cognitive 41): InheritanceIndex.resolve_type has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (30 pts), ternaries 1 (5 pts), boolean chains 3, loops 1 (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":"code_review_graph/inheritance.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a03ca42b67e9e2c55b4713617c9594192254c2ca3100dee9d73ea74841cdb0"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._handle_zig_var_decl (cognitive 41): CodeParser._handle_zig_var_decl has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 5 (11 pts), ternaries 2 (5 pts), boolean chains 4 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":14550}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbe6aea7e497f193f9c28f757fc9f6b618e2431bae5dd924dcbc4c6be8e2560"}},{"ruleId":"D2","level":"warning","message":{"text":"hcl_resolver.resolve_hcl_module_references (cognitive 40): hcl_resolver.resolve_hcl_module_references has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (23 pts), ternaries 2 (5 pts), boolean chains 4, error handling 2 (4 pts), loops 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":"code_review_graph/hcl_resolver.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"02694930cbeb8e8b90252ae0d9ac7738736dde30beca4caabbfaf4038d698799"}},{"ruleId":"D2","level":"warning","message":{"text":"npm_alias_resolver._token_comparators (cognitive 40): npm_alias_resolver._token_comparators has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 14, ternaries 3 (7 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":"code_review_graph/npm_alias_resolver.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f553609bbf3d855685507219e07ac47eec58c96f0244f1a9c732dc0097ea8912"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._parse_sql (cognitive 40): CodeParser._parse_sql has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 9 (12 pts), ternaries 5 (7 pts), boolean chains 4 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":7315}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3b79bf000f998cae875311a2f6fa02d7668df92e64d3ec2f8317d541b75eba"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._emit_spring_event_listener_edges (cognitive 40): CodeParser._emit_spring_event_listener_edges has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (31 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 26). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":16088}}}],"partialFingerprints":{"codehealthFindingId/v1":"947487dbe6821ff60b4bcfb1ed2ba1f4acae311c5f407030690c7524b3c6ce00"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._collect_js_import_names (cognitive 40): CodeParser._collect_js_import_names has cognitive complexity 40 (threshold 15). Drivers by points: if/else 6 (26 pts), loops 3 (7 pts), ternaries 1 (6 pts), boolean chains 1 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":21243}}}],"partialFingerprints":{"codehealthFindingId/v1":"271bfd707da41a18155cc45a6cea9c08785c4b612c01c5049046c4a4f5814817"}},{"ruleId":"D2","level":"warning","message":{"text":"rescript_resolver.resolve_rescript_cross_module (cognitive 40): rescript_resolver.resolve_rescript_cross_module has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 7, error handling 2 (4 pts), loops 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":"code_review_graph/rescript_resolver.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed308d4e28d498c05e8b431523f081a43327e86d7a0e59aedf7689f3de141af"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall._clean_hook_data (cognitive 40): uninstall._clean_hook_data has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 3 (6 pts), boolean chains 4, ternaries 1 (4 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":"code_review_graph/uninstall.py"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab5ebdd8eb06bbdb462abb75a93bbd025ae234d531c9be96209a7c6242ec088"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._parse_ansible_playbook (cognitive 39): CodeParser._parse_ansible_playbook has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 4 (9 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":11977}}}],"partialFingerprints":{"codehealthFindingId/v1":"25641754f713366c423e0d1ac65ab10e5ff583efceb2b49d07edd23b329c0432"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._python_name_bindings (cognitive 39): CodeParser._python_name_bindings has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 3 (7 pts), ternaries 1 (5 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":20662}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc549eab9660644b7022dd64aa109ae93ea99d444c65cb3de1cd5277107c14c5"}},{"ruleId":"D2","level":"warning","message":{"text":"review.detect_changes_func (cognitive 39): review.detect_changes_func has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 3 (7 pts), error handling 2 (6 pts), boolean chains 4, loops 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":"code_review_graph/tools/review.py"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3a6f35488c9cdfbd5f9d6bce37bc8e94fa14b1ed9dbbcf55f47aac3f055856"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall._process_platform_configs (cognitive 39): uninstall._process_platform_configs has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (6 pts), ternaries 2 (5 pts), boolean chains 3, error handling 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":"code_review_graph/uninstall.py"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ddf4181e9763b3a17e3fb0185e55c0c73c49464b9b73b4323387bd113f25d6"}},{"ruleId":"D2","level":"warning","message":{"text":"enrich._format_node_context (cognitive 38): enrich._format_node_context has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 6, loops 3 (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":"code_review_graph/enrich.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a55d9120ccbc449e7479a57840a4d7d2e14bfb4de636a0d968f9f19c1cf46c"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore._resolve_inherited_endpoints (cognitive 38): GraphStore._resolve_inherited_endpoints has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 7 (10 pts), boolean chains 6, 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":"code_review_graph/graph.py"},"region":{"startLine":3274}}}],"partialFingerprints":{"codehealthFindingId/v1":"9240de7979814bac56d6d39d2c72927b529e7d66dc4b39f81360771135db33c9"}},{"ruleId":"D2","level":"warning","message":{"text":"install_plan.render (cognitive 38): install_plan.render has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (17 pts), ternaries 4 (14 pts), boolean chains 6, loops 1 (nesting depth added 20). 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":"code_review_graph/install_plan.py"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b012f319d6a36dc71b734204a0b25efbc5d67504d569f5729e16ee1bec755d"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._handle_lua_variable_declaration (cognitive 38): CodeParser._handle_lua_variable_declaration has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 3 (10 pts), loops 6 (8 pts), boolean chains 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":14205}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfef7a055dbeb59bc68d835ee6c31d6242cc0d5bacd11963a2c1d005b60be4e5"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._read_php_composer_psr4 (cognitive 38): parser._read_php_composer_psr4 has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (6 pts), ternaries 2 (6 pts), error handling 2 (5 pts) (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0700e6082e3b6a278f576a34e80459e6c832da04da41d226907b409f561bae"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._php_attribute_aliases (cognitive 38): parser._php_attribute_aliases has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (35 pts), loops 2, boolean chains 1 (nesting depth added 27). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":2855}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1042c2de52eda5f79838e68c4899d283031cd55457b8e6308476e11627c6124"}},{"ruleId":"D2","level":"warning","message":{"text":"query._attach_neighbors (cognitive 38): query._attach_neighbors has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 3 (6 pts), error handling 1 (2 pts), boolean chains 1 (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":"code_review_graph/tools/query.py"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea56ae06dc01eb06adbf3fcfa7c9521f9fe090691b6bc7b23fc593b26fd3898b"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon_cli._handle_status (cognitive 37): daemon_cli._handle_status has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 7 (19 pts), if/else 8 (11 pts), loops 2 (4 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":"code_review_graph/daemon_cli.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"942be481eeb4dddd81493b3ce7240a33f093a27562be1ae8fa5142ca0e90fd37"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore.get_ambiguous_call_tests (cognitive 37): GraphStore.get_ambiguous_call_tests has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (5 pts), boolean chains 4, error handling 1 (3 pts), ternaries 1 (3 pts) (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":"code_review_graph/graph.py"},"region":{"startLine":2542}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c3fee2f1fc7c046c3ffa3259802d81dabde20e5b592e7259b0acbf42d7bf40"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._plsql_member_signature (cognitive 37): CodeParser._plsql_member_signature has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (21 pts), ternaries 2 (6 pts), boolean chains 5, loops 3 (5 pts) (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":7259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c19e41cde82347d136d3d2b7dba22fb095f95418dd8a5921005479163ad335a"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._python_expression_class_evidence (cognitive 37): CodeParser._python_expression_class_evidence has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 6, ternaries 2 (6 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":9926}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be87e45cc810482514a5950e5717e204be0e54990fb3f60f683c20ef04aa7bc"}},{"ruleId":"D2","level":"warning","message":{"text":"exports.export_obsidian_vault (cognitive 36): exports.export_obsidian_vault has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 9 (16 pts), boolean chains 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":"code_review_graph/exports.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda64d3f0b04b71758e057d98b7e079b75f6b1d004876fbe1a195fbe802a1ab1"}},{"ruleId":"D2","level":"warning","message":{"text":"incremental._load_ignore_patterns (cognitive 36): incremental._load_ignore_patterns has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (29 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 20). 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":"code_review_graph/incremental.py"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"e076d00709f0bfb85743e9430838dfbac9eb272d8b856aa817f9666cefbe96a8"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_dart_calls_from_children (cognitive 36): CodeParser._extract_dart_calls_from_children has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 3 (9 pts), ternaries 1 (4 pts), boolean chains 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":13430}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae82b8ec690c952526192545e6c39ebc8b79f2a2a7107dd8ce84f950928ff8fd"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_js_var_functions (cognitive 36): CodeParser._extract_js_var_functions has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (6 pts), boolean chains 4, ternaries 2 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":14935}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec49d20fc782bc7bd5b84098f18d69ac3e9ce516417e4390408dac9cd3a2981b"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._r_first_string_arg (cognitive 36): CodeParser._r_first_string_arg has cognitive complexity 36 (threshold 15). Drivers by points: if/else 4 (20 pts), loops 4 (16 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":24909}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78a1f7684f70ede77fd5e5052872a5c7b254044f0b29c5276817f5f8207e7d3"}},{"ruleId":"D2","level":"warning","message":{"text":"custom_languages._validate_entry (cognitive 35): custom_languages._validate_entry has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 7, ternaries 2 (3 pts), 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":"code_review_graph/custom_languages.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ee2c36605efd56ffa6d8c53abc9d15f21e5c86e759a34f70fc89d7f7bea92a"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._python_type_checking_aliases (cognitive 35): parser._python_type_checking_aliases has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (8 pts), boolean chains 6 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"1156dd0c78bc127cb4db2b38798cac2d63984bdb0d0dddaa8026b5038335071c"}},{"ruleId":"D2","level":"warning","message":{"text":"_JsScan.visit_import (cognitive 35): _JsScan.visit_import has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 2 (4 pts), boolean chains 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":"code_review_graph/refactor.py"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ad6ec0f0350464ec0c5162e19a19162cbc4cb6633453fb9eaf978747e1bdf3"}},{"ruleId":"D2","level":"warning","message":{"text":"refactor.apply_refactor (cognitive 35): refactor.apply_refactor has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (20 pts), error handling 3 (6 pts), loops 5 (6 pts), ternaries 1 (2 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":"code_review_graph/refactor.py"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"acae22422d8c9348a480d348c235866bc710cfe92e7b7f0bb4b9eddf9618b7ca"}},{"ruleId":"D2","level":"warning","message":{"text":"build._run_postprocess (cognitive 35): build._run_postprocess has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (19 pts), error handling 6 (8 pts), boolean chains 7, loops 1 (nesting depth added 6). 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":"code_review_graph/tools/build.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00a25457b8527a30dab058b396373dc81cfd19f3a0ff58de811ae283576ddf7"}},{"ruleId":"D2","level":"warning","message":{"text":"changes._review_pure_deletions (cognitive 34): changes._review_pure_deletions has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 4 (5 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":"code_review_graph/changes.py"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c342d3ea441bf9a4ecacbde93d8e79e93ae9fea004954dc350f60643f287cf"}},{"ruleId":"D2","level":"warning","message":{"text":"incremental._scan_nested_output_dirs (cognitive 34): incremental._scan_nested_output_dirs has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 3 (6 pts), boolean chains 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":"code_review_graph/incremental.py"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace751fc9ca12904334571e435da3ed6095dc50d46cbc8b919aab0d9fd9d2ee0"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._get_jsx_component_reference (cognitive 34): CodeParser._get_jsx_component_reference has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 3 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":24819}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e04bd059d65260c94d7c6a215863cb0eceae8b7cef43a5f51ee921c2083b5e7"}},{"ruleId":"D2","level":"warning","message":{"text":"refactor.suggest_refactorings (cognitive 34): refactor.suggest_refactorings has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 5 (11 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":"code_review_graph/refactor.py"},"region":{"startLine":2411}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b5f5bba5575f6c1ef006c37b1cfd447f453fa2046a36c4cd4d2bc9cede5a5e"}},{"ruleId":"D2","level":"warning","message":{"text":"skills._merge_hook_entries (cognitive 34): skills._merge_hook_entries has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 3 (6 pts), boolean chains 4, ternaries 1 (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":"code_review_graph/skills.py"},"region":{"startLine":3017}}}],"partialFingerprints":{"codehealthFindingId/v1":"287449eebce1cdd41c347ccb80a0aac8f54e6f65e8fd37625aa5000ff044c289"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.find_surprising_connections (cognitive 33): analysis.find_surprising_connections has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 9, ternaries 2 (4 pts), loops 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":"code_review_graph/analysis.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6558bef9231ec4c6251aec9fc248624271188fd8ae1c97cd05cb81b4e6401e03"}},{"ruleId":"D2","level":"warning","message":{"text":"communities._split_oversized (cognitive 33): communities._split_oversized has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 4 (7 pts), boolean chains 2, error handling 1 (2 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":"code_review_graph/communities.py"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df655998695b66aab13eb9826c3d087e6d128b181c94c81addc18642f17b82b"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._parse_notebook (cognitive 33): CodeParser._parse_notebook has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 3 (6 pts), boolean chains 3, error handling 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":5567}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74cf5572f0c4a7eb3b1c0b068db06f15966684a761321b75d5aaeadb7e2dcb1"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._resolve_julia_call_targets (cognitive 33): CodeParser._resolve_julia_call_targets has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 3 (7 pts), loops 4 (5 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":8387}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51e825383681cec24365f900264abf505b25fa79581b750d450ef75d487d493"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._get_csharp_receiver_method (cognitive 33): CodeParser._get_csharp_receiver_method has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 3, loops 1 (2 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":17747}}}],"partialFingerprints":{"codehealthFindingId/v1":"7126ff4994a1bc471dc5eb5139d525d0545881bd0932f602a351ad77c416ee31"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._php_import_bindings (cognitive 33): CodeParser._php_import_bindings has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (2 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":18226}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85dda1c53e0fc8cb04c513a519ce09621cceffc5e456eccb4a7847af5f01b95"}},{"ruleId":"D2","level":"warning","message":{"text":"refactor._python_rename_sites (cognitive 33): refactor._python_rename_sites has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 6, loops 3 (5 pts), ternaries 2 (3 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":"code_review_graph/refactor.py"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93de28112556d468b754c15c04bdf9573b0091cf1c220e395669af7afc46a0f"}},{"ruleId":"D2","level":"warning","message":{"text":"skills._merge_toml_mcp_server (cognitive 33): skills._merge_toml_mcp_server has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (28 pts), error handling 1 (2 pts), ternaries 1 (2 pts), loops 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":"code_review_graph/skills.py"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced8fa235f3588e610cd66b071666f0ee645cd99cd4cc2e21dd7d5c03e1747cf"}},{"ruleId":"D2","level":"warning","message":{"text":"changes.map_changes_to_nodes (cognitive 32): changes.map_changes_to_nodes has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 4 (9 pts), boolean chains 4 (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":"code_review_graph/changes.py"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fc2f0514f07dc27b1059d9b455ddd6698d0a1fee6a1a5d5916de3a68fb1997"}},{"ruleId":"D2","level":"warning","message":{"text":"InheritanceIndex.__init__ (cognitive 32): InheritanceIndex.__init__ has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 3 (9 pts), loops 6 (7 pts), boolean chains 3 (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":"code_review_graph/inheritance.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e772a75fcb94112c36635c8e43a503f6dcd33eac362fa07a16c1220b95b588"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._add_html_script_import (cognitive 32): CodeParser._add_html_script_import has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (22 pts), error handling 1 (3 pts), loops 1 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 18). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":5252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96dc8bf4680a1819fd2639cbf0873b3e7e9cc614e9881b9010b8ae1b0683839"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._php_attribute_names (cognitive 32): parser._php_attribute_names has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 4 (10 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":2906}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b37568badf4e77e45fea66f03f073cd50b870fa4bbff485abac0cbf504227a5"}},{"ruleId":"D2","level":"warning","message":{"text":"flows_tools.get_flow (cognitive 32): flows_tools.get_flow has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, error handling 2 (5 pts), loops 2 (4 pts), ternaries 1 (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":"code_review_graph/tools/flows_tools.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ebbecb2b50b3244cf57a6a6c46c3810538a3b4524085a9f12dddf15edb0594"}},{"ruleId":"D2","level":"warning","message":{"text":"crg_readonly._command_args (cognitive 31): crg_readonly._command_args has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 2 (4 pts), ternaries 2 (4 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":"code_review_graph/assets/code-review-graph/scripts/crg_readonly.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e805b434d67bb91fdb7df71910726d5cbb2c6e7964a72798eee9a54b59628cd"}},{"ruleId":"D2","level":"warning","message":{"text":"_WatchSupervisor.sync_watches (cognitive 31): _WatchSupervisor.sync_watches has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 4 (7 pts), boolean chains 2 (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":"code_review_graph/incremental.py"},"region":{"startLine":4289}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c6fb98defb5fd39ac9f2afb4cca17c7c4c7189689ca1e71bf351c3efba1023"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmAliasResolver._aliases_for_file (cognitive 31): NpmAliasResolver._aliases_for_file has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (8 pts), boolean chains 3, error handling 1 (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":"code_review_graph/npm_alias_resolver.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e63947f288a75b64369ed9c634128be8e2c26f0ea4f9225710e8627e91d7961"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._r_iter_args (cognitive 31): CodeParser._r_iter_args has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 4 (11 pts), boolean chains 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":24924}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fa1f8ea1922cfa53aa15e3b816e151bc86ed3602419b90e263cec0099448ea"}},{"ruleId":"D2","level":"warning","message":{"text":"skills._strip_jsonc (cognitive 31): skills._strip_jsonc has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 2 (4 pts), boolean chains 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":"code_review_graph/skills.py"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a59351713c3f98bf4d61f79ae0b975d95ccd8db58aecf5abff9d0b1501b7beb"}},{"ruleId":"D2","level":"warning","message":{"text":"review._risk_by_file (cognitive 31): review._risk_by_file has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 4 (6 pts), boolean chains 1, error handling 1 (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":"code_review_graph/tools/review.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e96f75afc8cd4352536321f533e578143868a0db7cc19b0e8f20809a46a0107"}},{"ruleId":"D2","level":"warning","message":{"text":"visualization._export_seeded (cognitive 31): visualization._export_seeded has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 4 (5 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":"code_review_graph/visualization.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"2796d2804e01c707e8d2e970fd12d7353f11f9d62c962efea4266620b3f97211"}},{"ruleId":"D2","level":"warning","message":{"text":"communities._dedupe_community_names (cognitive 30): communities._dedupe_community_names has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 5 (11 pts), boolean chains 2 (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":"code_review_graph/communities.py"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c037021bc402d9a80f7f0209603e8d86449e20da9b12b91e79cbade8d20ea9c"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchDaemon._start_watcher (cognitive 30): WatchDaemon._start_watcher has cognitive complexity 30 (threshold 15). Drivers by points: error handling 7 (19 pts), if/else 6 (9 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":"code_review_graph/daemon.py"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f50dd58208021921c2d1d216e0084dc13e66d8e12075bf6ffacbeb673be345b"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.resolve_mcp_entry (cognitive 30): doctor.resolve_mcp_entry has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 6 (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":"code_review_graph/doctor.py"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a954abe78cc2cb6f9703c448f33f42140821f39114706ba10f8885fe907bb5"}},{"ruleId":"D2","level":"warning","message":{"text":"incremental.get_staged_and_unstaged (cognitive 30): incremental.get_staged_and_unstaged has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 2 (5 pts), boolean chains 3, 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":"code_review_graph/incremental.py"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2809b7b585e1336c7ec62b3855fca48da18cc644188071735f7f8c8855f640"}},{"ruleId":"D2","level":"warning","message":{"text":"incremental._walk_symlinked_dirs (cognitive 30): incremental._walk_symlinked_dirs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, error handling 2 (4 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":"code_review_graph/incremental.py"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7145092b64b22776e5019f3291767e1432a78f43d001c29391a7b879542457ad"}},{"ruleId":"D2","level":"warning","message":{"text":"neighbourhood._select_within_budget (cognitive 30): neighbourhood._select_within_budget has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, loops 3 (4 pts), 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":"code_review_graph/neighbourhood.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc0d5891d9c996cf607e0b7641d563354f8e732a29a55f23c28497f557fdf4d"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._php_route_enclosing_groups (cognitive 30): CodeParser._php_route_enclosing_groups has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (20 pts), boolean chains 4, ternaries 1 (4 pts), loops 2 (nesting depth added 18). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":18513}}}],"partialFingerprints":{"codehealthFindingId/v1":"811c0c92ae073878a01f4a3099ea5a70912d6d255c39044547ca9fcb0601adff"}},{"ruleId":"D2","level":"warning","message":{"text":"skills.install_git_sync_hooks (cognitive 30): skills.install_git_sync_hooks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (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":"code_review_graph/skills.py"},"region":{"startLine":2665}}}],"partialFingerprints":{"codehealthFindingId/v1":"440bca9decf0d41342ac1310e62876bc3bf59e43e2fcbc818d812fff291ba58f"}},{"ruleId":"D2","level":"warning","message":{"text":"review._file_regions (cognitive 30): review._file_regions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 4, loops 2 (3 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":"code_review_graph/tools/review.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2a1ccad319447b0ea6d8a9c2bd4c64504aefa9c4d7c407b6ef81a18b664bb3"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteReader.getImpactRadius (cognitive 30): SqliteReader.getImpactRadius has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 8 (14 pts), boolean chains 1, ternaries 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":"code-review-graph-vscode/src/backend/sqlite.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ce8692726172988f94ce5bf199059e3404ce37958ca17b21c6d43ca692b47c"}},{"ruleId":"D2","level":"warning","message":{"text":"change_details._coupling (cognitive 29): change_details._coupling has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 4 (6 pts), boolean chains 4 (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":"code_review_graph/change_details.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"52abc54634303399025fc8c65d0da4ffb79ceecf465012fc5817c739f3f22f1e"}},{"ruleId":"D2","level":"warning","message":{"text":"enrich.extract_pattern (cognitive 29): enrich.extract_pattern has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (22 pts), ternaries 2 (5 pts), loops 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":"code_review_graph/enrich.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"67da96efc29db62d51c90caa07601bf5ada00741677532ada412bffba1876af3"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore._receiver_backed_candidates (cognitive 29): GraphStore._receiver_backed_candidates has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 7, loops 1 (2 pts), ternaries 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":"code_review_graph/graph.py"},"region":{"startLine":2969}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a746c14044b43d68f774042c1fce227e386f5c604be9b874b0002ea6e8921c"}},{"ruleId":"D2","level":"warning","message":{"text":"_PyRenameScan._collect_all (cognitive 29): _PyRenameScan._collect_all has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (9 pts), boolean chains 4, ternaries 1 (2 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":"code_review_graph/refactor.py"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c1f4ce9395f17a7b1c8fb6ca2afa5270833e4527c92d6870470fe03fb67a8a"}},{"ruleId":"D2","level":"warning","message":{"text":"query.traverse_graph_func (cognitive 29): query.traverse_graph_func has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (5 pts), boolean chains 2, ternaries 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":"code_review_graph/tools/query.py"},"region":{"startLine":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ae2d80184e43c11e531c3ba5ce965902042c6118cc98e2c1c75cc9a28a2d95"}},{"ruleId":"D2","level":"warning","message":{"text":"TsconfigResolver._strip_jsonc_comments (cognitive 29): TsconfigResolver._strip_jsonc_comments has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (10 pts), boolean chains 5 (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":"code_review_graph/tsconfig_resolver.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"49197bc97b8c369f016f5231ad99d424dbcfdc1aef4a65364f3b003558da35fe"}},{"ruleId":"D2","level":"warning","message":{"text":"graph.bindToolbarEvents (cognitive 29): graph.bindToolbarEvents has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 3, loops 1 (nesting depth added 10). Most of this is not in the body itself: 10 of the 29 points are its own statements and the rest belongs to 6 function items inside it that branch (toggle, a function literal at line 854, a function literal at line 868, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc108cf772760dde2b245d746d08ff8ad9b681b4d215ee7b908d21f19b10f313"}},{"ruleId":"D2","level":"warning","message":{"text":"communities._reassign_test_nodes (cognitive 28): communities._reassign_test_nodes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 5 (6 pts), ternaries 3 (6 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":"code_review_graph/communities.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22c4471bff065de2b9381d777296f1283c9690d2150a5300e5436012e9db870"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.check_hooks (cognitive 28): doctor.check_hooks has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (4 pts), error handling 1 (3 pts), ternaries 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":"code_review_graph/doctor.py"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb3042074458b7134a45b9140075f0a39a761dcbf8c8b410aab2e704bba5288"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore.__init__ (cognitive 28): GraphStore.__init__ has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), error handling 3 (5 pts), boolean chains 4, ternaries 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":"code_review_graph/graph.py"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8b66b1a480edd5bf9add92f83288fc83912b13e51bfe71be361bf408d94087"}},{"ruleId":"D2","level":"warning","message":{"text":"incremental._should_ignore (cognitive 28): incremental._should_ignore has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 3, ternaries 1 (2 pts), 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":"code_review_graph/incremental.py"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4398c59b147e08a904a29c7cda38acdccc4f938302bbe2bb4b7a479720880cc"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiWorktreeRouter.get_child (cognitive 28): MultiWorktreeRouter.get_child has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (4 pts), boolean chains 3, error handling 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":"code_review_graph/multi_worktree.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb1638ffc77d33d56dd70161d61ea33dffaa68025e7a69a4e76f92214b7a1a6"}},{"ruleId":"D2","level":"warning","message":{"text":"_PythonUnreachableCallVisitor._visit_function (cognitive 28): _PythonUnreachableCallVisitor._visit_function has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 5 (10 pts), boolean chains 2 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"0780fed4ac03ff32aaf51659d8035aae2d226492f95f28fa739dc65b7452af0a"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._plsql_is_forward_decl (cognitive 28): CodeParser._plsql_is_forward_decl has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 2 (6 pts), boolean chains 5, loops 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":7208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea7b1347a36c48f93cc069729fd70432f984e743885f8c3c2f0b64633a264f6"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._emit_spring_constructor_injection (cognitive 28): CodeParser._emit_spring_constructor_injection has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (6 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":15560}}}],"partialFingerprints":{"codehealthFindingId/v1":"85edb9faf1dd0111afb65aa598d25bb30b53724d5c862cb05aea09ab8d674e74"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._read_python_module_alias (cognitive 28): CodeParser._read_python_module_alias has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 7, error handling 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":20570}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b34c7701327c9e8e253ff75c67eb761b8c59f737a37fa7a71a4fba9eac19425"}},{"ruleId":"D2","level":"warning","message":{"text":"visualization._aggregate_community (cognitive 28): visualization._aggregate_community has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 10 (11 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":"code_review_graph/visualization.py"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"157f51199618e1716898625f15d60e629ce3365dd8e4fa9ed0149e9ccb4fceef"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore._settle_unbound_endpoints (cognitive 27): GraphStore._settle_unbound_endpoints has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (8 pts), boolean chains 1, 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":"code_review_graph/graph.py"},"region":{"startLine":3403}}}],"partialFingerprints":{"codehealthFindingId/v1":"3541b37b1efaa7c409a8690e859cc48beba51e3239acc2f5f9b6111625bf306c"}},{"ruleId":"D2","level":"warning","message":{"text":"incremental._get_svn_changed_files (cognitive 27): incremental._get_svn_changed_files has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts), ternaries 1 (4 pts), error handling 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":"code_review_graph/incremental.py"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1eead6423ecc3ae9f4f27435facdfc24f9c5559eb79a3de2f15c4af38eec113"}},{"ruleId":"D2","level":"warning","message":{"text":"main.main (cognitive 27): main.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 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":"code_review_graph/main.py"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7cdaa793c3057646c07ddd755411183aca2fb3a1b2d946cbee5b1c7e91bd79"}},{"ruleId":"D2","level":"warning","message":{"text":"memory.list_memories (cognitive 27): memory.list_memories has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (7 pts), error handling 1 (2 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":"code_review_graph/memory.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"860c877357b45b83acf91e771c87784cac7adcc12bdcaded4aff1e2c3262468e"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_html_scripts (cognitive 27): CodeParser._extract_html_scripts has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (7 pts), ternaries 1 (2 pts), boolean chains 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":5151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76bd8ffff2600a1bc75dd6412f002361d402b77e634b279628b767b46ff48a7"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_nix_constructs (cognitive 27): CodeParser._extract_nix_constructs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (6 pts), boolean chains 4, ternaries 2 (3 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":13048}}}],"partialFingerprints":{"codehealthFindingId/v1":"17169da7d4798d68e72a4c518db9be0453c3a6fd60acc908ce47f605e07741df"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_zig_calls_in_subtree (cognitive 27): CodeParser._extract_zig_calls_in_subtree has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 3 (6 pts), boolean chains 1, ternaries 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":14744}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12564bfa6d6de1fd64d52a51391defa4a6ace4881d0ecf89a21716371a5d665"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._spring_mapping_methods (cognitive 27): CodeParser._spring_mapping_methods has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 3 (6 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":15684}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba23db06385a88d97eeefd8ff7d9fa4feb050410c38de3938d502c4ad9c2dd5"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._python_static_truth (cognitive 27): parser._python_static_truth has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 3 (8 pts), boolean chains 4 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"c759b04b1ac551e5621f361ced155236a8a51ed2864adf1d466ed824bce81c94"}},{"ruleId":"D2","level":"warning","message":{"text":"refactor._js_rename_sites (cognitive 27): refactor._js_rename_sites has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, ternaries 1 (2 pts), loops 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":"code_review_graph/refactor.py"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1ad80130df9bb66fb57fef3a53015ec9af71d7002e0254227c932d49360495"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon_cli._handle_stop (cognitive 26): daemon_cli._handle_stop has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (6 pts), error handling 3 (4 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":"code_review_graph/daemon_cli.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f625b43c625ae1591c095b2fc41cb5582de2fed421838bc57a92a51df04f8af"}},{"ruleId":"D2","level":"warning","message":{"text":"_WatchSupervisor._replan_if_requested (cognitive 26): _WatchSupervisor._replan_if_requested has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 5 (6 pts), boolean chains 5, 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":"code_review_graph/incremental.py"},"region":{"startLine":4186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbd990e37344609e3c4fdf49163ff9ca65e61ab01442cdf8851fc278c4cb09b"}},{"ruleId":"D2","level":"warning","message":{"text":"incremental.watch (cognitive 26): incremental.watch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (3 pts), boolean chains 2, error handling 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":"code_review_graph/incremental.py"},"region":{"startLine":5177}}}],"partialFingerprints":{"codehealthFindingId/v1":"117b350cfdd953e2249e3610f17a0127c597c45ec3954f3d74fc519d6ff5149a"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonc.has_unclosed_comment (cognitive 26): jsonc.has_unclosed_comment has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (4 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":"code_review_graph/jsonc.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f188d877f612cfbb44f55b5b4b10be8c6bdf3cef47ca250f97089c41f129990b"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._walk_hcl_expressions (cognitive 26): CodeParser._walk_hcl_expressions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 2 (3 pts), boolean chains 2 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":13329}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e108d08ee5f08e415ebb65257f88f09763256194fd325c4a6a2311c29e2e72d"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._emit_kafka_edges_from_method (cognitive 26): CodeParser._emit_kafka_edges_from_method has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (10 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":16388}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3155524a7eb0a2fab580519b13e0b8e665f8679fe6767d466cdd3b5539aa8e6"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_ts_type_reference (cognitive 26): CodeParser._extract_ts_type_reference has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 3, loops 1 (2 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":19021}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e56faa7c6a7c5093fa242978f7969a3a94bb1e05acd0bedf3059a2ddf22ac58"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._parse_rust_use_node (cognitive 26): CodeParser._parse_rust_use_node has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), ternaries 2 (4 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":19492}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd7d2e4f765350064d6ec430e7e052e9267698d7967d8329338e8fa7838fa6d"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._resolve_rust_module_file (cognitive 26): CodeParser._resolve_rust_module_file has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":22415}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f2a5b8c9e37842abcdf3a389c473489de36cba050240b4979ad911f1dbc6b1"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._hcl_dynamic_iterator_name (cognitive 26): parser._hcl_dynamic_iterator_name has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":3216}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ffccca48619d076af04f59c36c715a84eb9ab77575a6bbfa7e35a10da247f3"}},{"ruleId":"D2","level":"warning","message":{"text":"refactor._apply_file_edits (cognitive 26): refactor._apply_file_edits has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (5 pts), boolean chains 3, ternaries 1 (3 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":"code_review_graph/refactor.py"},"region":{"startLine":2504}}}],"partialFingerprints":{"codehealthFindingId/v1":"d128632232d94c43b86d04dcc4214ddc8f7da9a1953a87b85628cc2d554ad7cf"}},{"ruleId":"D2","level":"warning","message":{"text":"build.run_postprocess (cognitive 26): build.run_postprocess has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (16 pts), error handling 5 (8 pts), boolean chains 1, loops 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":"code_review_graph/tools/build.py"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"5863ca22be1a0ff1b44d2cd242389275ee18710856cbeaa9b90aad2a35c38058"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._match_files_to_forget (cognitive 25): cli._match_files_to_forget has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 3, error handling 1 (3 pts), loops 2 (3 pts), ternaries 1 (2 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":"code_review_graph/cli.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"af36b868b0ba1ba3b7cd2c78dfe192d3e3604d0e7972a2ead032f5dec9c05f43"}},{"ruleId":"D2","level":"warning","message":{"text":"communities._detect_leiden (cognitive 25): communities._detect_leiden has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 5 (6 pts), ternaries 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":"code_review_graph/communities.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e962bc1ccbd07f4e0389add4287a5da72c0de333fe417d30d2e9b6214cbe02"}},{"ruleId":"D2","level":"warning","message":{"text":"event_resolver.resolve_spring_events (cognitive 25): event_resolver.resolve_spring_events has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 5 (8 pts), boolean chains 4, ternaries 2 (3 pts), error handling 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":"code_review_graph/event_resolver.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9c316d087ab2d6bba956d2a160da2d06735919651757a1aedbbe2277f9f7a1"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._apply_typed_call_targets (cognitive 25): CodeParser._apply_typed_call_targets has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 6, ternaries 2 (4 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":9100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9149e12934bc12dfe02114d98a4745ec6a1ae7fdc107c5958e952eb0836f599b"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._read_go_mod (cognitive 25): parser._read_go_mod has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 6, error handling 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9490796b6f15b45fff205bbfa53a0ac4080967c031f1fe0228cf2dd54249969"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._scan_rescript_modules (cognitive 25): parser._scan_rescript_modules has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (6 pts), boolean chains 2, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":2434}}}],"partialFingerprints":{"codehealthFindingId/v1":"724d2d8ffc96a7f5a21d7a6b1a427f2000853a30f6ed1190c94e9b35d3d9a244"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._csharp_namespace_context (cognitive 25): parser._csharp_namespace_context has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (5 pts), boolean chains 2, ternaries 1 (2 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":3017}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef1c3da1002697c96c0b13b3cdbda0a26983c6808183ab76d705c708515d218"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._html_first_heading (cognitive 25): parser._html_first_heading has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), boolean chains 3, ternaries 1 (2 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":3515}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc22887b5ef6f0eae598d00732507341eb7785818e617174ff12645ec6391fb9"}},{"ruleId":"D2","level":"warning","message":{"text":"_common._resolve_graph_file_paths_with_unmatched (cognitive 25): _common._resolve_graph_file_paths_with_unmatched has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (10 pts), error handling 1 (3 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":"code_review_graph/tools/_common.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb196ba6a8a28668dad586eb77d74969489d62e933c6ef32a05f15dbd648f21c"}},{"ruleId":"D2","level":"warning","message":{"text":"context.get_minimal_context (cognitive 25): context.get_minimal_context has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12, error handling 4 (5 pts), boolean chains 4, ternaries 2 (4 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":"code_review_graph/tools/context.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9635ef6533b3ddaf416594b78a4573c65c989d9ce3e78306a1baa680970da1f1"}},{"ruleId":"D2","level":"warning","message":{"text":"query.semantic_search_nodes (cognitive 25): query.semantic_search_nodes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 7 (9 pts), loops 2 (4 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":"code_review_graph/tools/query.py"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26b9f9835cb8505927821c64b2cbc196ecf26d64ad5c2e0f49d5d80e2a85f08"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace_resolver._exports_targets (cognitive 25): workspace_resolver._exports_targets has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, ternaries 2 (4 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":"code_review_graph/workspace_resolver.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adbbf596b4b3670437b5403b469bb1a765a04bdc4afa3f0a6bfde9f74c2edad"}},{"ruleId":"D2","level":"warning","message":{"text":"changes._parse_unified_diff (cognitive 24): changes._parse_unified_diff has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, ternaries 2 (4 pts), 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":"code_review_graph/changes.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8e9a1209aea99e756140a39bfae2c3da646081c04eeb7b66fc573eeb0cc1f8"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore._settle_collision_endpoints (cognitive 24): GraphStore._settle_collision_endpoints has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 6 (9 pts), boolean chains 1, error handling 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":"code_review_graph/graph.py"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"1245e7e67e2e79457ed96b193262de76341ecf5ab9961efbe727538124ee41f8"}},{"ruleId":"D2","level":"warning","message":{"text":"graph._ordered_pairs (cognitive 24): graph._ordered_pairs has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 6 (10 pts), ternaries 2, 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":"code_review_graph/graph.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"819aa43f55c17f782a4d41e49824bfe806d5409bdd8bd0bd7dad7fa7404c94c2"}},{"ruleId":"D2","level":"warning","message":{"text":"http_origin_guard.split_host_port (cognitive 24): http_origin_guard.split_host_port has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), error handling 2 (3 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":"code_review_graph/http_origin_guard.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e3a1db25be69ef495537afd8669c8377884ff2904a96519d4038e4de63daa0"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._lua_get_require_target (cognitive 24): CodeParser._lua_get_require_target has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (9 pts), boolean chains 1, ternaries 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":14392}}}],"partialFingerprints":{"codehealthFindingId/v1":"972e12e8c07739a0d5ac36e493b00181d5bfd90851bb47edbcbc47a936960bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._php_endpoint_handler (cognitive 24): CodeParser._php_endpoint_handler has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 3 (6 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":18541}}}],"partialFingerprints":{"codehealthFindingId/v1":"faca2045e2297507d07e5ead48cd1e5b4d3605e73157f381183a7f27246ec831"}},{"ruleId":"D2","level":"warning","message":{"text":"refactor._js_declaration_scope (cognitive 24): refactor._js_declaration_scope has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, ternaries 1 (3 pts), 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":"code_review_graph/refactor.py"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e615f347d186a111ceea65240abd3b23a784564dce9ebedb9cefc02db13b10"}},{"ruleId":"D2","level":"warning","message":{"text":"skills.install_git_hook (cognitive 24): skills.install_git_hook has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, error handling 1 (2 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":"code_review_graph/skills.py"},"region":{"startLine":2476}}}],"partialFingerprints":{"codehealthFindingId/v1":"660147dcdc45e204afe7d77a50427f9286aef963c84ec1d0ee3ca65fd5e61861"}},{"ruleId":"D2","level":"warning","message":{"text":"review._generate_review_guidance (cognitive 24): review._generate_review_guidance has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), error handling 1 (3 pts), ternaries 1 (3 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":"code_review_graph/tools/review.py"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0c47ecbed1240ae16c8df72cedad5d8852d6214d9f0b34686b31ce2bc6a0c2"}},{"ruleId":"D2","level":"warning","message":{"text":"TsconfigResolver._resolve_extends (cognitive 24): TsconfigResolver._resolve_extends has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (3 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":"code_review_graph/tsconfig_resolver.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6d69e11b0c2f5b99a5315594bd186ee1c979bfa8c4da15b84f62d473dc02a2"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace_resolver._declared_names (cognitive 24): workspace_resolver._declared_names has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (4 pts), boolean chains 2, ternaries 1 (2 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":"code_review_graph/workspace_resolver.py"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"860b8ca659a81c7d49f0d806866ff0fd49907c4c3f1227b7576b7ba77f7e0c23"}},{"ruleId":"D2","level":"warning","message":{"text":"graph.buildGraph (cognitive 24): graph.buildGraph has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (8 pts), ternaries 2 (5 pts) (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 11 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad5168449011b4ae82f7a17564237e97c61374e0e9c58ec9d58e8fde6ae7979"}},{"ruleId":"D2","level":"warning","message":{"text":"changes._removed_flow_criticalities (cognitive 23): changes._removed_flow_criticalities has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 6 (9 pts), ternaries 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":"code_review_graph/changes.py"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccf6d73a4c22b6c98b696a87ca1447d382b993c679cb68411df832c39acb8c2"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_skill.install_codex_skill (cognitive 23): codex_skill.install_codex_skill has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 6, loops 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":"code_review_graph/codex_skill.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"910b8403c37d83b92a8385d2f8e955447657a01a10cf1c0be8a7c25d000f8aea"}},{"ruleId":"D2","level":"warning","message":{"text":"communities._detect_file_based (cognitive 23): communities._detect_file_based has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5 (6 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":"code_review_graph/communities.py"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98e8a50abdbd420a1fa9692c1793aa2bea60c554b0022e0cd001d267bf6aac1"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore._impact_seed_qns (cognitive 23): GraphStore._impact_seed_qns has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 3 (8 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":"code_review_graph/graph.py"},"region":{"startLine":4447}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b060a662b056fe739236f839226410dadbac8e5df474cab4fef2b0ca9c8947"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore._build_networkx_graph (cognitive 23): GraphStore._build_networkx_graph has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 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":"code_review_graph/graph.py"},"region":{"startLine":5740}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1bb5853b74adf8b16581dd4ff703d148ee107e8b3e52a06849057d84ea2371"}},{"ruleId":"D2","level":"warning","message":{"text":"install_gitignore.apply (cognitive 23): install_gitignore.apply has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, error handling 3 (4 pts), ternaries 3 (4 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":"code_review_graph/install_gitignore.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"964e9f821d117fe8bacf0ddb2d08d92f22e8ffc38bf89594a266ff49e1e55af0"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._add_xslt_apply (cognitive 23): CodeParser._add_xslt_apply has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 4 (6 pts), boolean chains 4, loops 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":5506}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d03a2ec714506f23e10ac813783d5b3c98d754606f4f7831ea49df62948e6c8"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._get_java_method_and_receiver (cognitive 23): CodeParser._get_java_method_and_receiver has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 5, loops 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":18844}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4a2b45fbf07c1aa8c92ee70eac26c7e9f48c7e922c771e0000594a807d69cc"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._resolve_php_composer_module (cognitive 23): CodeParser._resolve_php_composer_module has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 1 (3 pts), loops 2 (3 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":22490}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88e441bf95b820279a6720332b8742a0dd62c12473a9fed31e850b156c301e3"}},{"ruleId":"D2","level":"warning","message":{"text":"_RouteGraph._guessed_hops (cognitive 23): _RouteGraph._guessed_hops has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 3 (8 pts), loops 2 (4 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":"code_review_graph/tools/query.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceed838369dacf2544d935566932a713bd53a005f5a6055a97365320f865185a"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall._remove_yaml_entry (cognitive 23): uninstall._remove_yaml_entry has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6, error handling 2, loops 2 (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":"code_review_graph/uninstall.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b4b220a979c00f2a98c62ba6489f9129e65f0e6fd269c199e4f6ca1f573dc5"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor._settings_hook_events (cognitive 22): doctor._settings_hook_events has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), ternaries 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":"code_review_graph/doctor.py"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33ee99db7f8d19e1b1835039b9a2b29f8c7c7b169276ea560b6c04097f687cb"}},{"ruleId":"D2","level":"warning","message":{"text":"hints._track_result (cognitive 22): hints._track_result has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (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":"code_review_graph/hints.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaa6d3f4701b008153e1084485285aaacceb757a7e3fc0aa8dbea9b2bff97ea"}},{"ruleId":"D2","level":"warning","message":{"text":"incremental._usable_review_base (cognitive 22): incremental._usable_review_base has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 1 (4 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":"code_review_graph/incremental.py"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"db180203a3bcff9b8a1fa7aa0254d9accf2c7d24f71e671a6d5eca39afac210f"}},{"ruleId":"D2","level":"warning","message":{"text":"incremental.files_hold_commits (cognitive 22): incremental.files_hold_commits has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 2 (4 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":"code_review_graph/incremental.py"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ddaf382e5c95eaefc8e3ecb0f23b34ef3f3caa331c0112084e59d7a3eb8070"}},{"ruleId":"D2","level":"warning","message":{"text":"incremental._reconcile_stale_files (cognitive 22): incremental._reconcile_stale_files has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, error handling 1 (3 pts), loops 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":"code_review_graph/incremental.py"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"742a8b54ee9863a16f15d93be32b55ca9a393dc0895dbb487dab517495914e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._js_wrapped_function (cognitive 22): CodeParser._js_wrapped_function has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 8, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":14861}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e4ed987f8130873657857c0c4adaa571e6373b9f6df576a25e9d9f4621e2c6"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._preceding_doc_comment (cognitive 22): CodeParser._preceding_doc_comment has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3, boolean chains 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":16501}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8861ce7890c58f11d0c0690aeb34138fdba639a7f8e9009585d8d04cb3992f"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall._remove_mcp_entry (cognitive 22): uninstall._remove_mcp_entry has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, ternaries 2 (3 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":"code_review_graph/uninstall.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fb2fa94c36896719278cfe4f8871e251237f438d04ae911ebc0c8858a76a7a"}},{"ruleId":"D2","level":"warning","message":{"text":"visualization._aggregate_file (cognitive 22): visualization._aggregate_file has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (6 pts), loops 4, 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":"code_review_graph/visualization.py"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"6707d2139313bcf72c18aa2664d91ce12e12ae9b7a90c3de185c2d5bf8c1036c"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace_resolver._target_candidates (cognitive 22): workspace_resolver._target_candidates has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, loops 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":"code_review_graph/workspace_resolver.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5567de3317ea84a13c42b29e1eb755328fa13f9eee49117b57dd7588ed54202"}},{"ruleId":"D2","level":"warning","message":{"text":"navigation.registerNavigationCommands (cognitive 22): navigation.registerNavigationCommands has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (15 pts), loops 4 (5 pts), boolean chains 1, ternaries 1 (nesting depth added 3). None of this is in the body itself: all 22 points belong to 4 function literals inside it that branch (lines 75, 16, 153, \u2026). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/navigation.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd21df0c86529c58fb9aa3ab8db038d9d5fab6891b2927cd12213e5592d4ef0"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.run_eval (cognitive 21): runner.run_eval has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (5 pts), loops 3 (5 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":"code_review_graph/eval/runner.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"db379ce42f93dd11a0dd3f3afb6158d1637b3a134225ff738187dfa92d9fc8ba"}},{"ruleId":"D2","level":"warning","message":{"text":"incremental._svn_revision_info (cognitive 21): incremental._svn_revision_info has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (6 pts), boolean chains 1, 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":"code_review_graph/incremental.py"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"e207bac51499e822df835f2d0e41fca952c5bfe49a6e27c9caf5acbdf83d31c8"}},{"ruleId":"D2","level":"warning","message":{"text":"incremental.get_changed_files (cognitive 21): incremental.get_changed_files has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, ternaries 1 (2 pts), error handling 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":"code_review_graph/incremental.py"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f69027fa509381066fe93148b15c06cbf13a7a4616774b123ceeb4e72c5704"}},{"ruleId":"D2","level":"warning","message":{"text":"_Child.stop (cognitive 21): _Child.stop has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 5 (10 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":"code_review_graph/multi_worktree.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f073f03a5d36047d95d3cce4563db6303ea1f24cf91fdb0827b26dee61d2d4"}},{"ruleId":"D2","level":"warning","message":{"text":"neighbourhood.extract (cognitive 21): neighbourhood.extract has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 3, ternaries 2 (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":"code_review_graph/neighbourhood.py"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64788e4393693ea112de57c5723f1bd61efd77e231de8b559db6623ef2fe3aa"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_hcl_constructs (cognitive 21): CodeParser._extract_hcl_constructs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 2 (4 pts), boolean chains 3 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":13192}}}],"partialFingerprints":{"codehealthFindingId/v1":"6207f660619dbc1613650c37f68c18e924e56d21907d4838b6dd669726a24886"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._spring_config_annotation_values (cognitive 21): CodeParser._spring_config_annotation_values has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (3 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":15340}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5c4b04c094bfd02355e7aa287f109615eea448f6b0b4843078ea662c1a8a8f"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._spring_mapping_paths (cognitive 21): CodeParser._spring_mapping_paths has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (3 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":15665}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d804773b40edbc7aa7ac37fe7f592a898b4c575146af1c25a391cb2f6b973e"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._emit_spring_endpoint_nodes (cognitive 21): CodeParser._emit_spring_endpoint_nodes has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (6 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 9). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":15716}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ff1ae77aebe877d5e84ee928d3adc3e68800edf7929f2222061245897bdef7"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._collect_js_exported_local_names (cognitive 21): CodeParser._collect_js_exported_local_names has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (9 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":20904}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca29c02bfb188195a274d49151054f7289c31ae5772378ee8dc7af3b4d14139"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._csharp_namespaces (cognitive 21): parser._csharp_namespaces has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (11 pts), ternaries 1 (6 pts), loops 2 (4 pts) (nesting depth added 15). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":3062}}}],"partialFingerprints":{"codehealthFindingId/v1":"00587d5de76730272e0e1feccf569fb329407af53b3f6f0b862307c084b14ca3"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.find_knowledge_gaps (cognitive 20): analysis.find_knowledge_gaps has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 6, 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":"code_review_graph/analysis.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c7a63f75a95e8309dd3d0371aa6a0cfa04ab00a3272cf58610538075cd76f4"}},{"ruleId":"D2","level":"warning","message":{"text":"embeddings._node_to_text (cognitive 20): embeddings._node_to_text has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 4, 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":"code_review_graph/embeddings.py"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"61743e91c92048137c6b2e5b05b6cc08fc3c9c2b84b9c985786c600fd8dd53c2"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore._class_backed_candidates (cognitive 20): GraphStore._class_backed_candidates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, 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":"code_review_graph/graph.py"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"1752b5a28e42a449a7f13fb35c8b3e6800ab8646fc3a483950cac7797d067d78"}},{"ruleId":"D2","level":"warning","message":{"text":"InheritanceIndex._only_declaration (cognitive 20): InheritanceIndex._only_declaration has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 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":"code_review_graph/inheritance.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b3872500a8aede5ebebf89396fd16b8208cd316027edfc749944e4709dac8b"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._resolve_typed_method_target (cognitive 20): CodeParser._resolve_typed_method_target has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":9046}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31f165205767e0bd00512ea51e6432196bf9b3d8a38de51b8c8a6526d66772d"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._strip_vbnet_noise (cognitive 20): parser._strip_vbnet_noise has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), ternaries 1 (3 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":2109}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb23717031d9c7cbebce131a3875f47fe48e25a5d33556ff04b0e4bd7a217197"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._html_attributes (cognitive 20): parser._html_attributes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (7 pts), boolean chains 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":3476}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6a6749285bc04ec6d6c0a32ac5278da52bcd2ef0d06fecd845aab71483c1d0"}},{"ruleId":"D2","level":"warning","message":{"text":"scoped_resolver._scope_and_method (cognitive 20): scoped_resolver._scope_and_method has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 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":"code_review_graph/scoped_resolver.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"203ebcb2dfe9f6f0a84f75358554a9836cc71e763f06a9aefeebb25e36cd4e92"}},{"ruleId":"D2","level":"warning","message":{"text":"review._allocate_regions (cognitive 20): review._allocate_regions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 pts), boolean chains 3 (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":"code_review_graph/tools/review.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"9282aa7d4f936e806ff9ed81494a62dac74dc50c1efb2cdb604f4bd126684e56"}},{"ruleId":"D2","level":"warning","message":{"text":"TsconfigResolver._load_tsconfig_for_file (cognitive 20): TsconfigResolver._load_tsconfig_for_file has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 3 (7 pts) (nesting depth added 12). 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":"code_review_graph/tsconfig_resolver.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b8b57eccedd1c6e14135ca1a68c0f9600b40d7e591c4760d8ee82781609edb"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.find_import_cycles (cognitive 19): analysis.find_import_cycles has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2, ternaries 2, 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":"code_review_graph/analysis.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed2703c659e1832a4473a84b0c1122e60800a7f4d4b135e05163e852b2e9ffa"}},{"ruleId":"D2","level":"warning","message":{"text":"communities._compute_cohesion_batch (cognitive 19): communities._compute_cohesion_batch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 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":"code_review_graph/communities.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8964a1258ded82779fbb3a6d384c95129e14f975a9b5ac8fb2420ed00db3cc"}},{"ruleId":"D2","level":"warning","message":{"text":"jedi_resolver._walk_calls (cognitive 19): jedi_resolver._walk_calls has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (7 pts), boolean chains 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":"code_review_graph/jedi_resolver.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d136e71d7873b416b8468dbcc63ab623f62bf2cd21513da19d3873bb24a2e7"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonc.removal_ranges (cognitive 19): jsonc.removal_ranges has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 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":"code_review_graph/jsonc.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccc40ce36c0c65a541c3bed480e770122925cb7ef14494ee0ce51ae8716b7eb"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_plsql_calls (cognitive 19): CodeParser._extract_plsql_calls has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, ternaries 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":7874}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c43e523f2ce24d1b810dab3298ab668a25110bf0c75e1f6816a00a38395a5b"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._elixir_function_name_and_params (cognitive 19): CodeParser._elixir_function_name_and_params has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":12639}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd3992f63e733da29260dd89030f53a9d97e5b93413a6c4d390606b15f0937c"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._java_annotation_attributes (cognitive 19): CodeParser._java_annotation_attributes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":15632}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f158235cd10116a586d158f44c8706b41c71f142d5e120a7786c291ac61774"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_imports (cognitive 19): CodeParser._extract_imports has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (4 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":17175}}}],"partialFingerprints":{"codehealthFindingId/v1":"e563bb42250835fc22f63eb6a3fe1524e03ad39cb9694ccf373ebf4c4621da3a"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._collect_js_require_names (cognitive 19): CodeParser._collect_js_require_names has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":21015}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9ad159c75303a93d86a06b5d452cf952a449da5a5322787fdfc4668cda589a"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._xml_attributes (cognitive 19): parser._xml_attributes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":3568}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1afdac2297e6712a47791c15a2d0d69105db68077a18ef559b812808ca0136"}},{"ruleId":"D2","level":"warning","message":{"text":"skills._yaml_section_bounds (cognitive 19): skills._yaml_section_bounds has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, 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":"code_review_graph/skills.py"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b6c1a0259e802cdb898ff498437596e18e01410af20633467152fda917d435"}},{"ruleId":"D2","level":"warning","message":{"text":"skills._write_merged_settings (cognitive 19): skills._write_merged_settings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 2 (4 pts), boolean chains 2, ternaries 1 (2 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":"code_review_graph/skills.py"},"region":{"startLine":3191}}}],"partialFingerprints":{"codehealthFindingId/v1":"406a8a8a98fd01f93eedc7a4ef7a7c9464db148ce8b3e6b3409032c3654eaea1"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.graph_provenance (cognitive 19): _common.graph_provenance has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, 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":"code_review_graph/tools/_common.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4da28bf9c99b97bcdfa051e6f2492a61fb626513a38abb2794b934a2484374"}},{"ruleId":"D2","level":"warning","message":{"text":"wiki.generate_wiki (cognitive 19): wiki.generate_wiki has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 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":"code_review_graph/wiki.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54462e482574ec7e12574b6a1eceb473e2edf9ff653a2ec366d6c88cf35a6e3"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._report_gitignore_block (cognitive 18): cli._report_gitignore_block has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (7 pts), loops 1 (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":"code_review_graph/cli.py"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d376eeb28ed658bc4a57e0721f902988ef870e6766ac01c84179589eae31d2"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._handle_forget (cognitive 18): cli._handle_forget has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 2 (3 pts), error handling 1 (2 pts), loops 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":"code_review_graph/cli.py"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61b432292632dfb8b92f2d8f7bf6a6dcfe11d656db1e8836c5d53577b995d61"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchDaemon.reconcile (cognitive 18): WatchDaemon.reconcile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (7 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":"code_review_graph/daemon.py"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d637a9100f81a77b2861b85169e922d37f968de9c5d51992960e28f61ab3296"}},{"ruleId":"D2","level":"warning","message":{"text":"flows.compute_criticality (cognitive 18): flows.compute_criticality has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (6 pts), boolean chains 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":"code_review_graph/flows.py"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"4927fc20bc9148fccae45add11f84686f6583abe52f5dc9b98a471e0162cf84a"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore._resolve_edge_identities (cognitive 18): GraphStore._resolve_edge_identities has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, ternaries 2, 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":"code_review_graph/graph.py"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd8e877340a6fd41307ba831e0cd7dd21c15aa1bbce9adad15741cf81f85770"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore._align_edge_with_collisions (cognitive 18): GraphStore._align_edge_with_collisions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6 (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":"code_review_graph/graph.py"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74050e11b9d923cbb030f485794d7014d78543189fefa76952c5c6f4ce78dc6"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore.get_impact_radius_sql (cognitive 18): GraphStore.get_impact_radius_sql has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4, error handling 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":"code_review_graph/graph.py"},"region":{"startLine":4663}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5455c4b2d5c7a7e7dd84d21dde2e2ca732199bf5a796a5878a1dd4085533ff"}},{"ruleId":"D2","level":"warning","message":{"text":"NpmAliasResolver._local_package_roots (cognitive 18): NpmAliasResolver._local_package_roots has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, ternaries 1 (2 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":"code_review_graph/npm_alias_resolver.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fd5eb75f2dc7da65d5186f90ce20f85dc2466cfe1f25ff13ba01c7035e45d9"}},{"ruleId":"D2","level":"warning","message":{"text":"npm_alias_resolver._set_matches (cognitive 18): npm_alias_resolver._set_matches has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, 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":"code_review_graph/npm_alias_resolver.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa84aec34aa9a633d6556bc8cab348a6a60ddaa03684e956b04b02a9327d9f2a"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._has_cpp_header_evidence (cognitive 18): CodeParser._has_cpp_header_evidence has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 2 (3 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":4402}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c71dcc44713bb43feeb7f606801cdff3f8301769b83a81375c270a86e1f12ca"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._xslt_template (cognitive 18): CodeParser._xslt_template has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, ternaries 5 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":5402}}}],"partialFingerprints":{"codehealthFindingId/v1":"526e7006f5c22a50a31f5f0cfcb550b3e0cc1756a6c6f11c9f0c42213a963af0"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_sql_ddl (cognitive 18): CodeParser._extract_sql_ddl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":7960}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf81698b46d82a5512f16d1f9e0e78ca63372218946aa8e86af624a1483736f6"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._python_module_class_identities (cognitive 18): CodeParser._python_module_class_identities has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 4, loops 3 (4 pts), error handling 2 (nesting depth added 2). To reduce it, split the body into named stages: move each independent 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":9770}}}],"partialFingerprints":{"codehealthFindingId/v1":"69622136e0292ddcfaab8a112a502247aaba0e04b183c4af74ebed1ebc58f68e"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._resolve_java_method_reference_target (cognitive 18): CodeParser._resolve_java_method_reference_target has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, loops 1 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":15838}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b5d8e2e08ce800b2a3bf245f842c86845dcec3ab40b448f15ce7892576b2de"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._js_static_module_target (cognitive 18): CodeParser._js_static_module_target has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":20920}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fe5d4c53b34ea4992a28a16815d12f5c5df6e77fcf63e592cb71115bc596e9"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._get_base_call_name (cognitive 18): CodeParser._get_base_call_name has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":24873}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c86669b0b7a995736d1460090407646f11119aa0e7abc6fba15f8a6fbc96c0"}},{"ruleId":"D2","level":"warning","message":{"text":"_JsScan.visit_reexport (cognitive 18): _JsScan.visit_reexport has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, 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":"code_review_graph/refactor.py"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"209dcf12978d99746ceb27f18e0b8d4c643d3664e0788a69354b2c52eab4cde5"}},{"ruleId":"D2","level":"warning","message":{"text":"skills._splice_merged_settings (cognitive 18): skills._splice_merged_settings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 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":"code_review_graph/skills.py"},"region":{"startLine":3150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d899de4c359578b31a09eff60ed3f026275c75a7633c00314658e103cb81ea"}},{"ruleId":"D2","level":"warning","message":{"text":"docs.get_docs_section (cognitive 18): docs.get_docs_section has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 1 (2 pts), loops 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":"code_review_graph/tools/docs.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9e82acfb73a24fd7c4034f696a42117a3b3c724eaf5d66ab795b1ab7808b03"}},{"ruleId":"D2","level":"warning","message":{"text":"ScmDecorationProvider.update (cognitive 18): ScmDecorationProvider.update has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), error handling 2, boolean chains 1 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/scmDecorations.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"80007b6a9ff00012318e57940e123d662e8d83cca8ed571ceb559f1bf6b395e2"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._apply_steering_choice (cognitive 17): cli._apply_steering_choice has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (5 pts), boolean chains 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":"code_review_graph/cli.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d8fdafaff606538dca235743f5f883ac235ce55087b94b2b3d0f58c6e37fe3"}},{"ruleId":"D2","level":"warning","message":{"text":"context_savings.format_context_savings_panel (cognitive 17): context_savings.format_context_savings_panel has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3, loops 1 (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":"code_review_graph/context_savings.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15e708c27b9e6dd46abf27cc5c4473af0fb260c02777f93136df819483697d6"}},{"ruleId":"D2","level":"warning","message":{"text":"incremental.get_data_dir (cognitive 17): incremental.get_data_dir has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, 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":"code_review_graph/incremental.py"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"271ccc20d72aa24887fc7e9dec763fdb68581aa776f546bc3437309452fb340d"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonc.has_comments (cognitive 17): jsonc.has_comments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 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":"code_review_graph/jsonc.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3f13609dfed889e33f361d77131389b3ddc27cfa7fc7f6608d7f10235b7905"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonc.object_members (cognitive 17): jsonc.object_members has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, ternaries 2 (4 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":"code_review_graph/jsonc.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6d29a8a444ad3ae529b87d7784be22d68af7e93a8b19c6cf6a83ce7f05e555"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._detect_language_from_shebang (cognitive 17): CodeParser._detect_language_from_shebang has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":4022}}}],"partialFingerprints":{"codehealthFindingId/v1":"174fe06b04614914664c6dacc2a4a11314c31cbae81887c294a77317f4ad3c1b"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._base_type_name (cognitive 17): CodeParser._base_type_name has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":9016}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae515fe3202358a0d1a59e3c9ba1888c715e31a0e10364379e45b052c2e414a"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._python_binding_evidence (cognitive 17): CodeParser._python_binding_evidence has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":10096}}}],"partialFingerprints":{"codehealthFindingId/v1":"521170ad0c6b2045bcee544f28b41eb86b6b5875743767ab716882fedbf07951"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._python_from_import_bindings (cognitive 17): CodeParser._python_from_import_bindings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), ternaries 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":10491}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b9dcff9155adf11d8b9969236fdcefbc722583a039e91851c26aa2dcfa9637"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._resolve_ansible_notify_targets (cognitive 17): CodeParser._resolve_ansible_notify_targets has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (4 pts), boolean chains 3, ternaries 1 (2 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":11931}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3bd23b4b1e948d3f30de2d897b28aa4da0b7f6ab1ad1c782a41985031396b7"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._julia_string_arg (cognitive 17): CodeParser._julia_string_arg has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 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. This shape REPEATS in the file: one other method here (CodeParser._get_java_annotations) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":13742}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b40db32044d2cdd7d6200b2f186d3c4bce2d374cff9062a14dadf442789d31a"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._extract_js_member_functions (cognitive 17): CodeParser._extract_js_member_functions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 2, loops 1 (2 pts), ternaries 2 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":15161}}}],"partialFingerprints":{"codehealthFindingId/v1":"607524d022591aece9758524f4c1144fd463aa38ba303eb084ef7508a9c3fd18"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._get_java_annotations (cognitive 17): CodeParser._get_java_annotations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 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. This shape REPEATS in the file: one other method here (CodeParser._julia_string_arg) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":15304}}}],"partialFingerprints":{"codehealthFindingId/v1":"562829f69bae441109de0ee16354b77c84b8c72290813c2e6703d6da83380121"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._index_ambiguous_method_scopes (cognitive 17): CodeParser._index_ambiguous_method_scopes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 1 (4 pts), loops 2, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":16821}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee2e273f37caa7985f7f60c9833a83eb8d3ba34078f157ec6220d391bc55acc"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._is_in_rust_dead_guard (cognitive 17): parser._is_in_rust_dead_guard has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6e873f9db7ea634c09d046df02499fd9c3caa37ad80d820496a830b6f06a61"}},{"ruleId":"D2","level":"warning","message":{"text":"_PyRenameScan.run (cognitive 17): _PyRenameScan.run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (5 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":"code_review_graph/refactor.py"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"99dfaf94843857e68a5d3f7f6496d48294a8e11b235b13116ee8810af01a1c0e"}},{"ruleId":"D2","level":"warning","message":{"text":"_PyRenameScan._visit_import (cognitive 17): _PyRenameScan._visit_import has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, ternaries 1 (3 pts), loops 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":"code_review_graph/refactor.py"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc038d409a82c6ba7803339256ff292c3e93ff26bfcf9f8440681efbdd90c16e"}},{"ruleId":"D2","level":"warning","message":{"text":"skills._yaml_child_bounds (cognitive 17): skills._yaml_child_bounds has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 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":"code_review_graph/skills.py"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c4c176460a4f8a584d150993fb5f3a31032abbab0e95d11427018f9197d088"}},{"ruleId":"D2","level":"warning","message":{"text":"_RouteGraph.hops_from (cognitive 17): _RouteGraph.hops_from has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (5 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":"code_review_graph/tools/query.py"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0755750c1d0e1fc63ffffad958c0b6b1c74d2672af5f9f59037a539aad4131"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall._safe_path (cognitive 17): uninstall._safe_path has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 2 (3 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":"code_review_graph/uninstall.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ee9ab221f9d66e694de4137c4c5210569c7cee55ca396628cfdc467396900d"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall._process_repo_files (cognitive 17): uninstall._process_repo_files has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 6 (7 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":"code_review_graph/uninstall.py"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba666b84e3a2dc471d3c2755b5325def31483bb9a3f60e80c73463f4a95631b"}},{"ruleId":"D2","level":"warning","message":{"text":"uninstall._registry_repo_paths (cognitive 17): uninstall._registry_repo_paths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (5 pts), boolean chains 3, 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":"code_review_graph/uninstall.py"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fde0eed38aae51723fafbc076742195af41969a15cd71c6ae1558de7b1af7e5"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace_resolver._workspace_patterns (cognitive 17): workspace_resolver._workspace_patterns has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 2 (4 pts), error handling 1 (3 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":"code_review_graph/workspace_resolver.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1988a823d1060a57078fa97493e3f36bceb6c84a65ab0b1bc11d6a83343402b3"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace_resolver._expand_patterns (cognitive 17): workspace_resolver._expand_patterns has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 2 (5 pts), loops 2 (3 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":"code_review_graph/workspace_resolver.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"190009809f7f73c4f138d18983ed22eb06cbdb1dd0037d84bc8b71d299118071"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._handle_context_history (cognitive 16): cli._handle_context_history has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 1, ternaries 1 (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":"code_review_graph/cli.py"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb3635b66d19c78d6526cc5cae254b6305ba7378eaa82f91e3ecd971aee85db"}},{"ruleId":"D2","level":"warning","message":{"text":"communities.get_architecture_overview (cognitive 16): communities.get_architecture_overview has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (5 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":"code_review_graph/communities.py"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c950cdd7c3e3a8886989e6677d510f0e0ced6895747ac822a7b73732746fed33"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.copies_on_path (cognitive 16): doctor.copies_on_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1, ternaries 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":"code_review_graph/doctor.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6f46dc70dd2a83c023c1fa7c50673abc7d3bb2326c27b8fb4f1e42d7b38915"}},{"ruleId":"D2","level":"warning","message":{"text":"graph._index_tokens (cognitive 16): graph._index_tokens has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 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":"code_review_graph/graph.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"594523aa9ca6c134d9797f3d75c291c86e60088253eec5906dce3e69fe1051f6"}},{"ruleId":"D2","level":"warning","message":{"text":"_WatchSupervisor.check_liveness (cognitive 16): _WatchSupervisor.check_liveness has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 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":"code_review_graph/incremental.py"},"region":{"startLine":4542}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a8bbed1bbf34b10d16c9a1f899f6a7f233debec63bdb5f6bad3dc23809fc44"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiWorktreeRouter.child_message (cognitive 16): MultiWorktreeRouter.child_message has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 1 (3 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":"code_review_graph/multi_worktree.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b73ef4b3333ad0eb37e4ab447faf63444531e30acdf4dbe315c4ce48ccac9b7"}},{"ruleId":"D2","level":"warning","message":{"text":"neighbourhood.resolve_seeds (cognitive 16): neighbourhood.resolve_seeds has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (4 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":"code_review_graph/neighbourhood.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e891e51b227636e186728b3b9a2a034cc4b6d5d081834db74d89ded54690f8e"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._liquid_statements (cognitive 16): CodeParser._liquid_statements has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 2 (7 pts), if/else 2 (5 pts), loops 2 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":4604}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdb0e4f386b5529ca94629d4a12548c080b7407832812eced40de91988bf1f3"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._parse_liquid (cognitive 16): CodeParser._parse_liquid has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3, ternaries 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":4655}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cc7171cc1cda88e7f1d7d17fa12776a35ebc4b34de0a1eeb8628b63e20c17d"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._apply_python_receiver_evidence (cognitive 16): CodeParser._apply_python_receiver_evidence has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (5 pts), boolean chains 2, loops 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":10577}}}],"partialFingerprints":{"codehealthFindingId/v1":"9251b65f8b63e1a379190d6f984381029420acc0d6cf998dd22decf19ed4853e"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._julia_short_func_name (cognitive 16): CodeParser._julia_short_func_name has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":13722}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbe011e490c75596c63bf9d4bac694862b5e82f3130e91daf4d78580428e4b0"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._python_module_search (cognitive 16): CodeParser._python_module_search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), ternaries 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":20788}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bff5b595c1bd7c74c6d441e139a41c9c3b40c5c517e9c1d77ee2117f28ecce"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._ruby_load_path_additions (cognitive 16): CodeParser._ruby_load_path_additions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (4 pts), error handling 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":21921}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d161164ce93e0c28680f0c6a692f0b7db66eb36d5f0b5e4ed5dac04a7b802a3"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._rust_dependency_specs (cognitive 16): CodeParser._rust_dependency_specs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":22226}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca0948e497f60fc13c3f176fffc141e0dcba440a92d2abf209d52873e8fed03"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeParser._cpp_function_identity (cognitive 16): CodeParser._cpp_function_identity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: code_review_graph/parser.py holds 134 of the 344 methods over the threshold \u2014 including the worst \u2014 and 4603 of the 9399 points over it (49%), 7.3\u00D7 the next-largest file (code_review_graph/graph.py at 629). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":23547}}}],"partialFingerprints":{"codehealthFindingId/v1":"815097c1d60e9691d427a2281eb4bdfff1e4d3af9b672eb6678a0d80b5933c35"}},{"ruleId":"D2","level":"warning","message":{"text":"skills._is_generated_hook_script (cognitive 16): skills._is_generated_hook_script has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, 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":"code_review_graph/skills.py"},"region":{"startLine":2922}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0018efc3d9e5c0bf394c9facce4ab9685d6d509623049035b3ea321490f11f"}},{"ruleId":"D2","level":"warning","message":{"text":"community_tools.get_community_func (cognitive 16): community_tools.get_community_func has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), 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":"code_review_graph/tools/community_tools.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d237bfc074d42ce6fa5a3926263dbb9feb3b9b6c44b41798a6e6ba2d4b7f3fb"}},{"ruleId":"D2","level":"warning","message":{"text":"registry_tools.cross_repo_search_func (cognitive 16): registry_tools.cross_repo_search_func has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 2 (3 pts), loops 2 (3 pts) (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":"code_review_graph/tools/registry_tools.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba8926849c90a338fbad5ea0495331db6df2a1c80bb067ac2d3d7929f19d92b"}},{"ruleId":"D2","level":"warning","message":{"text":"graph.setData (cognitive 16): graph.setData has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 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":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e73d9c510a332b103c72b403abec6e979bf38e75c799827427e1b576834281"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_review_graph/parser.py: FileTooLong \u2014 18396 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 17896 over it, 36.79\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":"code_review_graph/parser.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff59a1e61cf74bfe51560f0fc0520f71e34215b33950af386fdfd614d1a19b4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CodeParser: TooManyMethods \u2014 384 methods. The bar is 30 methods; this is 354 over it, 12.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":3801}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c49d953119aca312abf03c36574153d229691e7f7cd9beafef5ec6389fa810d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_review_graph/graph.py: FileTooLong \u2014 3986 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3486 over it, 7.97\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":"code_review_graph/graph.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b288581090826002ebf7376e2e175807737114816b300a7b6f795bc22d0c1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_review_graph/incremental.py: FileTooLong \u2014 3432 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2932 over it, 6.86\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":"code_review_graph/incremental.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5521d94e9added341c0d003f86e90ac28f55786e436220dfd2250004217bd54e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_review_graph/cli.py: FileTooLong \u2014 2586 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2086 over it, 5.17\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":"code_review_graph/cli.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bea294c1f8a5af7533a21addcc9362d3fe1466b1ba788fe9fa881dc03fc35b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_review_graph/skills.py: FileTooLong \u2014 2479 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1979 over it, 4.96\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":"code_review_graph/skills.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3299f9912c6393cd3e9cb239be35167f9b64d0a9c3c8b857300311c0284acf3a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GraphStore: TooManyMethods \u2014 147 methods. The bar is 30 methods; this is 117 over it, 4.90\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/graph.py"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"612d9669784e7aac4acf1c567e12df33d9d12c9d67d18e607a9ea8a9d8925e5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_review_graph/visualization.py: FileTooLong \u2014 2267 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1767 over it, 4.53\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":"code_review_graph/visualization.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefc00ca9199535f649e07e1365c312cf50086c5934cf409e3d967e7c87b83dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: extension.registerCommands: FunctionTooLong \u2014 registerCommands runs 419 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 319 over it, 4.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d90409377f4f7b31e568c81c9e0f34abd8765123802e29c8fd18e227c034f67"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_review_graph/refactor.py: FileTooLong \u2014 1903 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1403 over it, 3.81\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":"code_review_graph/refactor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5c6b288969cad54c8a991bc9b76eae32aa670ec879374de2df3baf667bb936"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/query.py: FileTooLong \u2014 1661 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1161 over it, 3.32\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":"code_review_graph/tools/query.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c53990de1ff22b3faf921a4525e2268066f4e4063f065be96587123458155b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_review_graph/uninstall.py: FileTooLong \u2014 1342 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 842 over it, 2.68\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":"code_review_graph/uninstall.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d9ef9e89eed18d771ed40d489e3141c924b357705a4531ae7f20d7908a5066"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraphWebviewPanel.getHtmlContent: MethodTooLong \u2014 getHtmlContent runs 259 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 159 over it, 2.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/views/graphWebview.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"161a6e957bc33ee2dd965af1e34471a907d2b14a3e7767ee662dfd538b5512b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_review_graph/changes.py: FileTooLong \u2014 1141 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 641 over it, 2.28\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":"code_review_graph/changes.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f726b9ba2a5c1e93aa0ac6ecd8a21232600cdab30c8f2692ed27541706d33a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_review_graph/embeddings.py: FileTooLong \u2014 1083 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 583 over it, 2.17\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":"code_review_graph/embeddings.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95e88219a37954d43da11813dfb0937f41f24ced0774dd0a2c4686b3480f8b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_review_graph/daemon.py: FileTooLong \u2014 1056 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 556 over it, 2.11\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":"code_review_graph/daemon.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31211cfc72199ba1274a28fbbb737bc53dcfa14bf33ff4da262a54677582ddde"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graph.buildGraph: FunctionTooLong \u2014 buildGraph runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2b9ba0f5e3768a455b195fa9de32722f47f4cd9903af79459d449e3eda39ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_review_graph/communities.py: FileTooLong \u2014 790 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 290 over it, 1.58\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":"code_review_graph/communities.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95dfbe24bb8957ad5fa0feb3db57df49c296286d7364f925ac944a53b764d195"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_review_graph/main.py: FileTooLong \u2014 776 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 276 over it, 1.55\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":"code_review_graph/main.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1394b88052c48c2a8ca887a49b67a42e765b28c11e0b1c9e59d26ad8a020a515"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/review.py: FileTooLong \u2014 727 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 227 over it, 1.45\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":"code_review_graph/tools/review.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"751ddbe31142040714943315661c35f3e7eaa2ec8b1e556a110706061ada942c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_review_graph/flows.py: FileTooLong \u2014 691 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 191 over it, 1.38\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":"code_review_graph/flows.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0405824a88a91e0ed2a1d92a8bd15e5c143950381029ba36e4ef060f83d902"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/build.py: FileTooLong \u2014 678 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 178 over it, 1.36\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":"code_review_graph/tools/build.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a6b68ed66da5c52229df25c9bfbe31eaa92fbcf9f5ca1efb3bf0aa75c0d2b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webview/graph.ts: FileTooLong \u2014 662 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 162 over it, 1.32\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":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c458f18584ae122d216b48a102f96c8fc0b1ed520430e2db9f9809421489cc05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_review_graph/search.py: FileTooLong \u2014 639 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 139 over it, 1.28\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":"code_review_graph/search.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"434345630547e0c921c90de068b786160319f381dcbaff8a4a19367f876ecfb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_review_graph/multi_worktree.py: FileTooLong \u2014 629 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 129 over it, 1.26\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":"code_review_graph/multi_worktree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8885f6c8107e7d108b017b9341877a2c7194819086f8cd448b392118cee6a81b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: code_review_graph/doctor.py: FileTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 123 over it, 1.25\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":"code_review_graph/doctor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9456f3d42c5ec7555b04df81b641ad20093142e7b4230d09b577546093cd8be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/extension.ts: FileTooLong \u2014 580 significant lines (blank, comment-only and punctuation-only lines excluded), about 72% of them inside a single declaration: registerCommands (80-773). The bar is 500 significant lines; this is 80 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b3ca9dcf08038ea6ec2e87aa2127881248f0426caf616ebf605c3c6754a505"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: navigation.registerNavigationCommands: FunctionTooLong \u2014 registerNavigationCommands runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/navigation.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cb5a321ec01b345544f0964030ecfe3dd8d7f5f4e6e47f28f4ed6ef898f5a8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GraphWebviewPanel: ClassTooLong \u2014 431 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 31 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/views/graphWebview.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a64cb2b1173a72b8eefebd67343aa62837779730449ca955295baf898e7fe3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagrams/generate_diagrams.py: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 14 over it, 1.03\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":"diagrams/generate_diagrams.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0d71db73d96b7a2ede6b5dd01961a99b1f1c632fdb3da83691488786b77d08"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (74 shared lines): code_review_graph/spring_resolver.py:31-279 | code_review_graph/temporal_resolver.py:32-213 \u2014 These two members are variants of one another: 74 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":"code_review_graph/spring_resolver.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7399fc51e018ce79ae17dce0466da281388049af91c762f2c2137c3fddbc1c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): code_review_graph/communities.py:396-505 | code_review_graph/communities.py:519-596 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"code_review_graph/communities.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"285374890fdaae08fba7dc542645d8c4c4dc1c83dfd7b2f04f5948737fae5926"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): code_review_graph/graph.py:5256-5273 | code_review_graph/graph.py:5358-5373 | code_review_graph/graph.py:5378-5394 | code_review_graph/graph.py:5488-5501 | code_review_graph/graph.py:5506-5519 \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":"code_review_graph/graph.py"},"region":{"startLine":5256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebaf7c9c61bcf5e87dda90ffa681cd1919ed6b84048446c4cba83ab02d1de93"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): code_review_graph/graph.py:5590-5601 | code_review_graph/graph.py:5604-5616 | code_review_graph/graph.py:5639-5653 | code_review_graph/graph.py:5683-5696 \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":"code_review_graph/graph.py"},"region":{"startLine":5590}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26452c23e5390182e615f7aafff071ba61dfa99cc0a346935a91ec08c74dfd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (124 corresponding lines): code_review_graph/embeddings.py:452-608 | code_review_graph/embeddings.py:687-810 \u2014 These two members are one piece of code written twice and then edited apart: 124 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":"code_review_graph/embeddings.py"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3fb6a1326038938837a389b04df22ed00523ddc09376401bb903d9c80e4405"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (108 corresponding lines): code_review_graph/parser.py:4743-4850 | code_review_graph/parser.py:4855-4981 \u2014 These two members are one piece of code written twice and then edited apart: 108 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":"code_review_graph/parser.py"},"region":{"startLine":4743}}}],"partialFingerprints":{"codehealthFindingId/v1":"669ba0e80ab20c42b2818ed29f2a20fd3cdd214c7cd74e49464e1b8c1ed325f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 49\u002B corresponding lines): code_review_graph/parser.py:14328-14389 | code_review_graph/parser.py:15111-15159 | code_review_graph/parser.py:15175-15271 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 49 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":14328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0499b6ae7fc063429a2b86656e5cc67b2d90d5d4b9f67f2459d729bf74b42ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): code_review_graph/graph.py:4331-4377 | code_review_graph/graph.py:4380-4415 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"code_review_graph/graph.py"},"region":{"startLine":4331}}}],"partialFingerprints":{"codehealthFindingId/v1":"6baf06793f41278309bfbb71fc6238fd3a86117ffda8871ded60742a13d25c8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): code_review_graph/parser.py:14508-14548 | code_review_graph/parser.py:14680-14723 \u2014 These two members are one piece of code written twice and then edited apart: 41 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":"code_review_graph/parser.py"},"region":{"startLine":14508}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c90c175c894c7effa722977187a2d8d7207bbff2601dd600d0a30db8ecbaaab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): code_review_graph/parser.py:9740-9768 | code_review_graph/parser.py:10387-10419 | code_review_graph/parser.py:20169-20206 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/parser.py"},"region":{"startLine":9740}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b8fbfd157fb89a86988b9e720b65b43a3257a249a671c8e7c0fe6a472f754e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): code_review_graph/parser.py:25094-25125 | code_review_graph/parser.py:25134-25166 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"code_review_graph/parser.py"},"region":{"startLine":25094}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a2d398213613461b543f543f615131b4bb5516c010c6db4e2ddacb1a2e92e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): code_review_graph/changes.py:138-175 | code_review_graph/changes.py:242-279 \u2014 These two members are one piece of code written twice and then edited apart: 38 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":"code_review_graph/changes.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0824d14ffa90b34ed71b9e3e74b2a3c668e87aa4c5564f41d04b39c0291f4d0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): code_review_graph/skills.py:3244-3271 | code_review_graph/skills.py:3330-3361 \u2014 These two members are one piece of code written twice and then edited apart: 28 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":"code_review_graph/skills.py"},"region":{"startLine":3244}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1b99441f75eca6eadc094c92932294e84aeac702b99b6c338e8bd37a991903"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): code_review_graph/postprocessing.py:208-232 | code_review_graph/tools/build.py:126-147 \u2014 These two members are one piece of code written twice and then edited apart: 22 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":"code_review_graph/postprocessing.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"170075bc8ae6472b5533a9110e47b00b171d42061329d1a0cd2519ea282efba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): code_review_graph/parser.py:15345-15360 | code_review_graph/parser.py:15666-15682 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"code_review_graph/parser.py"},"region":{"startLine":15345}}}],"partialFingerprints":{"codehealthFindingId/v1":"2064f741a1bee6939f38858294bc23dc032af11cc47d98bdfe70e3f83b4957be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): code_review_graph/parser.py:3477-3495 | code_review_graph/parser.py:3569-3585 \u2014 These two members are one piece of code written twice and then edited apart: 17 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":"code_review_graph/parser.py"},"region":{"startLine":3477}}}],"partialFingerprints":{"codehealthFindingId/v1":"1888c61bf47f040dc8603ff7adcd1903a134f135446a233fc98fee5158d023e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): code_review_graph/graph.py:5529-5551 | code_review_graph/graph.py:5554-5574 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"code_review_graph/graph.py"},"region":{"startLine":5529}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c9cfcdfd17afd6a56c6f72f2bf1518828b8d25339f81f73cb40bad5a87fa0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): code_review_graph/eval/token_benchmark.py:81-105 | code_review_graph/eval/token_benchmark.py:109-131 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"code_review_graph/eval/token_benchmark.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"57db6c1940df8867d2f912898fb0d6d87947000f914ff82d8fc2bf19684fc738"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): code_review_graph/forget.py:40-61 | code_review_graph/graph.py:2716-2732 | code_review_graph/graph.py:5230-5241 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/forget.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"10882d2699963f64881f811bcfb7fe2f5c5546dc98df9dda1af8a03b76ac3449"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): code_review_graph/communities.py:963-991 | code_review_graph/flows.py:307-339 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"code_review_graph/communities.py"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6ffae33f20228471252f03b29b49addbbc6f161ce4febdb48a91a2ff9615cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): diagrams/generate_diagrams.py:75-81 | diagrams/generate_diagrams.py:84-90 \u2014 These two members are one piece of code written twice and then edited apart: 7 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":"diagrams/generate_diagrams.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"fceb973bef0fc5146990745af674b9d0d872960ad136cee516be00fc3f968aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): code_review_graph/incremental.py:179-192 | code_review_graph/incremental.py:211-227 \u2014 These two members are one piece of code written twice and then edited apart: 14 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":"code_review_graph/incremental.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"691069a049501d415ae6806072b44acc0e34a0c2ed1e9b5de47345d3fd57b9af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): code_review_graph/uninstall.py:873-885 | code_review_graph/uninstall.py:895-910 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"code_review_graph/uninstall.py"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd4a7c0f06f511083b08232473622b77a1a051aa1fd4848403f3d0a717e65d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): code_review_graph/parser.py:23604-23620 | code_review_graph/parser.py:23750-23768 \u2014 These two members are one piece of code written twice and then edited apart: 17 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":"code_review_graph/parser.py"},"region":{"startLine":23604}}}],"partialFingerprints":{"codehealthFindingId/v1":"549d1576d4819eb9b27513ca3ca9e2f943190108d3ff370d29396b97a4737261"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): code_review_graph/incremental.py:1655-1670 | code_review_graph/incremental.py:1674-1693 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"code_review_graph/incremental.py"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14cafce9e040fb0d5f5f4f3bb69979e476bd7f9b6b5487c5ba265390c1f7fba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): code_review_graph/parser.py:2831-2849 | code_review_graph/parser.py:15305-15316 \u2014 These two members are one piece of code written twice and then edited apart: 12 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":"code_review_graph/parser.py"},"region":{"startLine":2831}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3306e272c34e5a64e20f9092f4281d1a4fa83c35af4803f8d443ae9d5e2aefd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): code_review_graph/parser.py:13743-13754 | code_review_graph/parser.py:14727-14742 \u2014 These two members are one piece of code written twice and then edited apart: 12 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":"code_review_graph/parser.py"},"region":{"startLine":13743}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb3c227618f8c1d235f0771640a890e16be81e95ae9d1cbe698a2fd1e09737b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): code_review_graph/parser.py:15330-15338 | code_review_graph/parser.py:15654-15663 \u2014 These two members are one piece of code written twice and then edited apart: 9 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":"code_review_graph/parser.py"},"region":{"startLine":15330}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7224f56a77e5edd5faffd380bd6ba685d63b9d2c94c6e08006b351fc8cd560"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): code_review_graph/parser.py:19202-19219 | code_review_graph/parser.py:19290-19302 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"code_review_graph/parser.py"},"region":{"startLine":19202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7610696048b25f39a255def58d44241ea6358c8e4f521d4612b1aeeed4eeaf12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 43\u002B corresponding lines): code_review_graph/tools/analysis_tools.py:45-87 | code_review_graph/tools/analysis_tools.py:95-137 | code_review_graph/tools/analysis_tools.py:206-249 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 43 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/tools/analysis_tools.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3097d1e07dd84570d1e131a633854179ce087d5ade1bd0a13277524f3c89349b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): code_review_graph/postprocessing.py:147-163 | code_review_graph/postprocessing.py:171-180 | code_review_graph/postprocessing.py:188-197 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/postprocessing.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"704d78324d0a03f34a851f9c79b4f34a1e81ef9d7f02e109101adf7dffc73559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (63\u201385 lines \u00D7 2): code_review_graph/embeddings.py:485-569 | code_review_graph/embeddings.py:720-782 \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 before the matched lines, \u0060code_review_graph/embeddings.py:719\u0060 calls \u0060_wait_for_rate_limit_slot\u0060 and \u0060code_review_graph/embeddings.py:484\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":"code_review_graph/embeddings.py"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"82497a03c9acc5a5802974020d9b7deed7cc4df6bd6ea2b82668391080c58b28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44\u201345 lines \u00D7 2): code_review_graph/parser.py:4793-4837 | code_review_graph/parser.py:4921-4964 \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 \u0060code_review_graph/parser.py:4921\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. 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":"code_review_graph/parser.py"},"region":{"startLine":4793}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9e42a1e6df1a5d6484cdfc691238118a4ed1d44102f461e5d371e71befb467"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): code_review_graph/parser.py:4744-4784 | code_review_graph/parser.py:4867-4907 \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 \u0060code_review_graph/parser.py:4867\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":"code_review_graph/parser.py"},"region":{"startLine":4744}}}],"partialFingerprints":{"codehealthFindingId/v1":"89199156e6971bf595ddc93d7a6f5156908e93e86ebe353fca848694adb6fb84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201333 lines \u00D7 2): code_review_graph/embeddings.py:576-608 | code_review_graph/embeddings.py:786-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 \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":"code_review_graph/embeddings.py"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f38fa649d3276ab3145af29a62d7522f55e307da87770a553740444fb7b8d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): code_review_graph/graph.py:4870-4902 | code_review_graph/graph.py:4994-5026 \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":"code_review_graph/graph.py"},"region":{"startLine":4870}}}],"partialFingerprints":{"codehealthFindingId/v1":"affab160e8847078fdfbe1d05d0e57d0227f27bbff04088ee4c9c08908619ce5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): code_review_graph/flows.py:768-798 | code_review_graph/flows.py:954-984 \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, \u0060code_review_graph/flows.py:800\u0060 calls \u0060execute\u0060 and \u0060code_review_graph/flows.py:985\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":"code_review_graph/flows.py"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f28d9cbbf58f06abfc59983327d07f5ef6fef22634abe9701449f5bfa40487"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201331 lines \u00D7 2): code_review_graph/spring_resolver.py:182-212 | code_review_graph/temporal_resolver.py:149-176 \u2014 before extracting anything, compare \u0060code_review_graph/spring_resolver.py\u0060 and \u0060code_review_graph/temporal_resolver.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 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":"code_review_graph/spring_resolver.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c02dbaf8bd3543de12dc94c505c760e4a6e7992ae2ed1b932f4762556532482"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201329 lines \u00D7 2): code_review_graph/parser.py:16225-16251 | code_review_graph/parser.py:16313-16341 \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":"code_review_graph/parser.py"},"region":{"startLine":16225}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa0f3ed7314eb2bdd2edd087283f309794d9ecefaf511dafaf3d9edf0fbce3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201327 lines \u00D7 2): code_review_graph/cli.py:1918-1939 | code_review_graph/cli.py:1976-2002 \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 \u0060code_review_graph/cli.py:1918\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":"code_review_graph/cli.py"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8fa72b3d54db024ded7ec7ee6244d1749478dd2af938e1e97e5e8940f5d63c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): code_review_graph/parser.py:15004-15030 | code_review_graph/parser.py:15231-15257 \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 \u0060code_review_graph/parser.py:15004\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":"code_review_graph/parser.py"},"region":{"startLine":15004}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0f08ca91fcdf6e206bafe6838a0d724b6ae942bf43bc6ea94aa97f23507328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201327 lines \u00D7 2): code_review_graph/registry.py:67-93 | code_review_graph/tools/_common.py:178-196 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060code_review_graph/registry.py:67\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060path\u0060 to \u0060str\u0060 in one and \u0060\u0022Path | str\u0022\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":"code_review_graph/registry.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8ff8e681d9b7ae352344b59ecfad1db17b6fbee09a234290eea2c9b80ba7bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): code_review_graph/spring_resolver.py:152-178 | code_review_graph/temporal_resolver.py:120-146 \u2014 before extracting anything, compare \u0060code_review_graph/spring_resolver.py\u0060 and \u0060code_review_graph/temporal_resolver.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 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":"code_review_graph/spring_resolver.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4461a6c641e6d395227790c705451ec6f326aa45a6edf01f4402f82e5ab4b27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): code_review_graph/eval/token_benchmark.py:21-45 | code_review_graph/eval/token_benchmark.py:135-157 \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":"code_review_graph/eval/token_benchmark.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f1fe267abc6f3d01a514fe8c35d674d23e2283785af05b90ee11517b5d9cf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): code_review_graph/postprocessing.py:112-134 | code_review_graph/tools/build.py:318-340 | code_review_graph/tools/build.py:935-957 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060code_review_graph/tools/build.py:317\u0060 calls \u0060perf_counter\u0060 and \u0060code_review_graph/tools/build.py:933\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":"code_review_graph/postprocessing.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26f0fe57e3c3c06c27b9a517fcded6bc04728c4ed8a0197671fd5ba6039c6e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): code_review_graph/eval/reporter.py:200-222 | code_review_graph/eval/reporter.py:284-305 | code_review_graph/eval/reporter.py:306-327 \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":"code_review_graph/eval/reporter.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"810437386ab61f7edce4459c056f870fce460860ecfeefce24af3c6bab8556d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 2): code_review_graph/parser.py:13875-13893 | code_review_graph/parser.py:17120-17141 \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 \u0060code_review_graph/parser.py:13875\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":"code_review_graph/parser.py"},"region":{"startLine":13875}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee68a2a22382207c85f9106ff7db5de57640d6a008f9945ab0c515ccca3d09f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): code_review_graph/cli.py:1752-1771 | code_review_graph/cli.py:1804-1823 \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 \u0060code_review_graph/cli.py:1752\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":"code_review_graph/cli.py"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"8613d4a7bf340ceb41ddae6d4c3f65e0ed62df3aa4af5c6c33db64a69a9eaa42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 2): code_review_graph/jsonc.py:70-85 | code_review_graph/jsonc.py:93-112 \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":"code_review_graph/jsonc.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"11339026517d058887cbd3d5b299e168a5562e7082f31279c259dc938447229f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): code_review_graph/parser.py:17612-17631 | code_review_graph/parser.py:17642-17660 \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 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":"code_review_graph/parser.py"},"region":{"startLine":17612}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff003bbfc7ffbd1042c0acf0a3618a19ae45eb76651566b383952dcea91e4fed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): code_review_graph/cli.py:2039-2057 | code_review_graph/cli.py:2132-2149 \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 \u0060code_review_graph/cli.py:2039\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":"code_review_graph/cli.py"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace70642465e6c2118a743316d8f3535266ef4ad1359e010b6e10da054817d7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): code_review_graph/parser.py:9261-9279 | code_review_graph/parser.py:9810-9827 \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 \u0060code_review_graph/parser.py:9261\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":"code_review_graph/parser.py"},"region":{"startLine":9261}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da5d0adf10b1e45a7c8b82b4e0243046147e084b627ede56692eeab979626ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): code_review_graph/spring_resolver.py:261-279 | code_review_graph/temporal_resolver.py:195-213 \u2014 before extracting anything, compare \u0060code_review_graph/spring_resolver.py\u0060 and \u0060code_review_graph/temporal_resolver.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"code_review_graph/spring_resolver.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"910dc91955b620f9207bff3e286069aada1142cc3920b3a324a375b9abda1e15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): code_review_graph/parser.py:10536-10553 | code_review_graph/parser.py:21116-21133 \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 \u0060code_review_graph/parser.py:10536\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":"code_review_graph/parser.py"},"region":{"startLine":10536}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f596e87d375a28cdbb77b9a2f14bcd664bb75ce56e2130ef87d66e8896724d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 5): code_review_graph/parser.py:14293-14307 | code_review_graph/parser.py:14373-14386 | code_review_graph/parser.py:15142-15156 | code_review_graph/parser.py:15252-15268 | code_review_graph/parser.py:24999-25011 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060code_review_graph/parser.py:14293\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":"code_review_graph/parser.py"},"region":{"startLine":14293}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14c56827904e6ea47cb279af1cdf0ed8d13a4f52f20db304d07f13b190eccdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 5): code_review_graph/parser.py:14288-14302 | code_review_graph/parser.py:15020-15035 | code_review_graph/parser.py:15137-15151 | code_review_graph/parser.py:15247-15263 | code_review_graph/parser.py:24993-25008 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060code_review_graph/parser.py:14288\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":"code_review_graph/parser.py"},"region":{"startLine":14288}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f7768a53b3a4e4b3ea1587c5da6f232947cee7250175aaf16726a2db44b437"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): code_review_graph/change_details.py:78-94 | scripts/render_pr_comment.py:501-516 \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":"code_review_graph/change_details.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"550428cec3c670964651e61964b4b37022c074b9e5cb84b924b21f692873490c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): code_review_graph/embeddings.py:468-484 | code_review_graph/embeddings.py:702-718 \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, \u0060code_review_graph/embeddings.py:719\u0060 calls \u0060_wait_for_rate_limit_slot\u0060 and \u0060code_review_graph/embeddings.py:485\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":"code_review_graph/embeddings.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f5bc3c06cb60ba75b254847b6ee645878074b510211f87b6935fca8de88a2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): code_review_graph/parser.py:9740-9752 | code_review_graph/parser.py:10387-10403 \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":"code_review_graph/parser.py"},"region":{"startLine":9740}}}],"partialFingerprints":{"codehealthFindingId/v1":"5267da673c2827fc4bd16db1f0c1dc8a84f9555d9c3f8555950e5c18290cd82e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): code_review_graph/skills.py:3749-3765 | code_review_graph/skills.py:3769-3785 \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":"code_review_graph/skills.py"},"region":{"startLine":3749}}}],"partialFingerprints":{"codehealthFindingId/v1":"392d164524632d3ace1a2fad0907089c91a9286258e5bb8b494cec2dd4f3fa54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): code_review_graph/uninstall.py:267-283 | code_review_graph/uninstall.py:769-784 \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 \u0060code_review_graph/uninstall.py:267\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":"code_review_graph/uninstall.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03d04054e892d22abe3c2041019abfd9e1072159e87ef94d8202c61f8119125"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): code_review_graph/parser.py:7470-7485 | code_review_graph/parser.py:7500-7515 | code_review_graph/parser.py:7527-7542 \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 \u0060code_review_graph/parser.py:7470\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":"code_review_graph/parser.py"},"region":{"startLine":7470}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a13ea2f95d801c0e85f6db282ca99a229e770f901d33a7b6fe1583ee0a77c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): code_review_graph/parser.py:6697-6712 | code_review_graph/parser.py:6733-6748 \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 \u0060code_review_graph/parser.py:6697\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":"code_review_graph/parser.py"},"region":{"startLine":6697}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56977652ab9a7417a3ab72acaddaa4ece5f8ae43a7009ab9b1261415c8f3482"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 4): code_review_graph/parser.py:12775-12788 | code_review_graph/parser.py:14282-14295 | code_review_graph/parser.py:15131-15144 | code_review_graph/parser.py:24987-25001 \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 \u0060code_review_graph/parser.py:12775\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":"code_review_graph/parser.py"},"region":{"startLine":12775}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1df48cb808b527411504551a0033b9ee17b052f9f37ba33ddc9d95d41a2fdea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): code_review_graph/scoped_resolver.py:400-413 | code_review_graph/spring_resolver.py:153-167 | code_review_graph/temporal_resolver.py:121-135 \u2014 before extracting anything, compare \u0060code_review_graph/spring_resolver.py\u0060 and \u0060code_review_graph/temporal_resolver.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code_review_graph/scoped_resolver.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ba0aa8760a293b00c3f936ffe4b563c62b1125a53a5d6f9e292d8ae0e02884"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): code_review_graph/cli.py:1907-1920 | code_review_graph/cli.py:1947-1961 \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 \u0060code_review_graph/cli.py:1907\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060code_review_graph/cli.py:1906\u0060 calls \u0060add_parser\u0060, \u0060add_argument\u0060 and \u0060code_review_graph/cli.py:1947\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":"code_review_graph/cli.py"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36fb2c56c4df037e08682f138fb1f5f8ffe190957c512751481e7ad1725f8c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): code_review_graph/parser.py:14109-14122 | code_review_graph/parser.py:14530-14544 \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 \u0060code_review_graph/parser.py:14109\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":"code_review_graph/parser.py"},"region":{"startLine":14109}}}],"partialFingerprints":{"codehealthFindingId/v1":"db517fe644f45610c48d953beb2db31077dfff6b9b99e4ada76582942a10021e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): code_review_graph/parser.py:17376-17390 | code_review_graph/parser.py:25070-25082 \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 \u0060code_review_graph/parser.py:17376\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":"code_review_graph/parser.py"},"region":{"startLine":17376}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1715154d7c8515f0a1c4abbd18983a7da289d82c6c25fd6d9e325613c7cebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): code_review_graph/tools/build.py:299-313 | code_review_graph/tools/build.py:919-933 \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, \u0060code_review_graph/tools/build.py:317\u0060 calls \u0060perf_counter\u0060 and \u0060code_review_graph/tools/build.py:935\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":"code_review_graph/tools/build.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38f499410393299ca3dff690fdf01ca2b4b1d490d88aff394c5848eec03e8c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): code_review_graph/parser.py:13870-13884 | code_review_graph/parser.py:14285-14298 | code_review_graph/parser.py:15134-15147 | code_review_graph/parser.py:24990-25004 \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 \u0060code_review_graph/parser.py:13870\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":"code_review_graph/parser.py"},"region":{"startLine":13870}}}],"partialFingerprints":{"codehealthFindingId/v1":"d815aeb7396a6ef1cdb2aebe286b8ce2c21e7303f524555768e9df56b1c9cdd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): code_review_graph/parser.py:14274-14287 | code_review_graph/parser.py:14355-14368 | code_review_graph/parser.py:15123-15136 \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 \u0060code_review_graph/parser.py:14274\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":"code_review_graph/parser.py"},"region":{"startLine":14274}}}],"partialFingerprints":{"codehealthFindingId/v1":"11013faef4f69377e596eb0da3751222267142ee51abafc1971e0831401dc6c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): code_review_graph/communities.py:489-502 | code_review_graph/communities.py:581-594 \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":"code_review_graph/communities.py"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"2366bdc09020a425291c4e10516929ebf8ac75ddeff61c8c2d2632666bd3d6bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): code_review_graph/jsonc.py:294-304 | code_review_graph/jsonc.py:311-324 \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":"code_review_graph/jsonc.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"194e32ec70d87cfe507e69b78965a25bae3db7a9a6374920b58712284583edea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): code_review_graph/parser.py:10506-10515 | code_review_graph/parser.py:21061-21074 \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":"code_review_graph/parser.py"},"region":{"startLine":10506}}}],"partialFingerprints":{"codehealthFindingId/v1":"327e8cf5e209570d3881d5d3f2d9500baee7b913709b46ebcb25f6cd90e91014"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): code_review_graph/parser.py:13873-13886 | code_review_graph/parser.py:14529-14542 \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 \u0060code_review_graph/parser.py:13873\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":"code_review_graph/parser.py"},"region":{"startLine":13873}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b602bfdd5dfac69908b0804069bc33b09315ffd342c0b997b2922c2fcfbeef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): code_review_graph/parser.py:14049-14062 | code_review_graph/parser.py:14094-14107 \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 \u0060code_review_graph/parser.py:14049\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":"code_review_graph/parser.py"},"region":{"startLine":14049}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62de3c0106a0b24780f91759513bd792c8a82b6918a6b13845dbbbaa7fbd7c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): code_review_graph/tools/query.py:1618-1631 | code_review_graph/tools/query.py:1659-1672 \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":"code_review_graph/tools/query.py"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e760bc4a9da5a7e99a96e5da5e1dbb3fab228da3f2a9f17c26042a3827c0b1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 7): code_review_graph/parser.py:13873-13886 | code_review_graph/parser.py:14288-14300 | code_review_graph/parser.py:14529-14542 | code_review_graph/parser.py:15020-15032 | code_review_graph/parser.py:15137-15149 | code_review_graph/parser.py:15247-15259 | code_review_graph/parser.py:24993-25006 \u2014 all 7 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 \u0060code_review_graph/parser.py:13873\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":"code_review_graph/parser.py"},"region":{"startLine":13873}}}],"partialFingerprints":{"codehealthFindingId/v1":"a376973f2bfcbf32baf7cee19011faf6ace10d2ede3609c8b2b6596b444678de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): code_review_graph/parser.py:14298-14310 | code_review_graph/parser.py:14377-14389 | code_review_graph/parser.py:15147-15159 | code_review_graph/parser.py:15257-15271 | code_review_graph/parser.py:17381-17393 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060code_review_graph/parser.py:14298\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":"code_review_graph/parser.py"},"region":{"startLine":14298}}}],"partialFingerprints":{"codehealthFindingId/v1":"4646d5d26c2493c81a85365a1ca073cd34337ee095d3a920cc2b0d4989ab3448"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): code_review_graph/parser.py:7476-7488 | code_review_graph/parser.py:7506-7518 | code_review_graph/parser.py:7533-7545 | code_review_graph/parser.py:7574-7586 \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 \u0060code_review_graph/parser.py:7476\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, \u0060code_review_graph/parser.py:7489\u0060 calls \u0060_extract_plsql_calls\u0060, \u0060end\u0060 and \u0060code_review_graph/parser.py:7562\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":"code_review_graph/parser.py"},"region":{"startLine":7476}}}],"partialFingerprints":{"codehealthFindingId/v1":"215a650644963ee09471f6ae9100aed34a8629b8855f9195af79da54164ce89b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): code_review_graph/graph.py:2672-2683 | code_review_graph/graph.py:2819-2831 \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":"code_review_graph/graph.py"},"region":{"startLine":2672}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c894019c1ce199a29065693623d41621560dd104631093c7edbd92ed2e9ca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): code_review_graph/parser.py:9857-9869 | code_review_graph/parser.py:10424-10436 \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":"code_review_graph/parser.py"},"region":{"startLine":9857}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eca9e342536758efcaad4ce1cb470b45df80a8cd61d6ccbf7f518f5d43c205b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): code_review_graph/parser.py:19369-19381 | code_review_graph/parser.py:19413-19425 \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 \u0060code_review_graph/parser.py:19369\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":"code_review_graph/parser.py"},"region":{"startLine":19369}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd3bf8e0b0d8fb2b8cb5dfe403b48844e3e237ad1a477be2777090315853689"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): code_review_graph/parser.py:12778-12789 | code_review_graph/parser.py:13870-13882 | code_review_graph/parser.py:14285-14296 | code_review_graph/parser.py:15134-15145 | code_review_graph/parser.py:24990-25002 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060code_review_graph/parser.py:12778\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":"code_review_graph/parser.py"},"region":{"startLine":12778}}}],"partialFingerprints":{"codehealthFindingId/v1":"e082d2219bf82e0fec3f3a6c5fb44e5053aa2c880fcf46f0bec7b22d4e638840"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): code_review_graph/parser.py:13807-13818 | code_review_graph/parser.py:14051-14062 | code_review_graph/parser.py:14096-14107 \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 \u0060code_review_graph/parser.py:13807\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 before the matched lines, \u0060code_review_graph/parser.py:14049\u0060 calls \u0060_julia_scope_join\u0060 and \u0060code_review_graph/parser.py:13806\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":"code_review_graph/parser.py"},"region":{"startLine":13807}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd1da66e3b104903c9650bb8fff93f911ecafbbdf8a24e14364f8f490d199e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): code_review_graph/cli.py:1307-1318 | code_review_graph/cli.py:1354-1365 \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 \u0060code_review_graph/cli.py:1307\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":"code_review_graph/cli.py"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db3c04dbe45e1b48409ecab5e1c1e208a54615817cb5c1fede74e9ae561d966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): code_review_graph/parser.py:12736-12746 | code_review_graph/parser.py:12786-12797 \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 \u0060code_review_graph/parser.py:12736\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":"code_review_graph/parser.py"},"region":{"startLine":12736}}}],"partialFingerprints":{"codehealthFindingId/v1":"273d2955ed9e9e4ad17a6185d6dab134da112e1a59137cd6a5fe15a859a56772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): code_review_graph/parser.py:21567-21578 | code_review_graph/parser.py:21584-21595 \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":"code_review_graph/parser.py"},"region":{"startLine":21567}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8d896301e3b4beb6122884a4919f016ddc8a5a7fe51803306f232195983ae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): code_review_graph/parser.py:23866-23875 | code_review_graph/parser.py:23952-23963 \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 \u0060code_review_graph/parser.py:23866\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":"code_review_graph/parser.py"},"region":{"startLine":23866}}}],"partialFingerprints":{"codehealthFindingId/v1":"34527aa1d98298725125f9108c029ce253a564829d5f386e23b9ce155b712469"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): code_review_graph/parser.py:23909-23917 | code_review_graph/parser.py:23969-23980 \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 \u0060code_review_graph/parser.py:23909\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":"code_review_graph/parser.py"},"region":{"startLine":23909}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc33ca3e1aff2d31f1d0c62b8cc684a90a77d0111841ef7b7c3527a18edaa96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): code_review_graph/parser.py:12772-12782 | code_review_graph/parser.py:14279-14289 | code_review_graph/parser.py:14360-14370 | code_review_graph/parser.py:15128-15138 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060code_review_graph/parser.py:14277\u0060 calls \u0060_get_params\u0060 and \u0060code_review_graph/parser.py:12771\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":"code_review_graph/parser.py"},"region":{"startLine":12772}}}],"partialFingerprints":{"codehealthFindingId/v1":"91616286b2e80ae05c9eaf1b48357eda15720c96ca45f2dcd6e8726e666b0031"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): code_review_graph/doctor.py:313-322 | code_review_graph/skills.py:638-648 \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. 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":"code_review_graph/doctor.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"5813d29100dd92c0eb4831411f4729a2a42705681a01020842a03c0c22df01a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): code_review_graph/flows.py:275-285 | code_review_graph/flows.py:288-298 \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":"code_review_graph/flows.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"5665079a2df947926174705107d013b529960772c40621df66e2f6ca8ca3fc3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): code_review_graph/graph.py:4343-4353 | code_review_graph/graph.py:4385-4395 \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 \u0060code_review_graph/graph.py:4343\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":"code_review_graph/graph.py"},"region":{"startLine":4343}}}],"partialFingerprints":{"codehealthFindingId/v1":"d823eeb5a3088f1a26c88001d1980a6ff075c5529d71f23f36f1c8a72b72ca05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): code_review_graph/incremental.py:182-192 | code_review_graph/incremental.py:217-227 \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":"code_review_graph/incremental.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"040d9905470e7c790de7a06c239eefb87caa13ea36dd1408292555a52d7075d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): code_review_graph/parser.py:7233-7243 | code_review_graph/parser.py:7284-7294 \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":"code_review_graph/parser.py"},"region":{"startLine":7233}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c8af81b9d26988cc157f22616540427f06a3abdf15786cbd4da9019cfc0c47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): code_review_graph/parser.py:12791-12801 | code_review_graph/parser.py:14119-14129 \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 \u0060code_review_graph/parser.py:12791\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":"code_review_graph/parser.py"},"region":{"startLine":12791}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b56c3586395fe57fad2d4571f9cca17f9e51cb7e1330d0916d570b711c5f35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): code_review_graph/parser.py:15345-15355 | code_review_graph/parser.py:15666-15676 \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":"code_review_graph/parser.py"},"region":{"startLine":15345}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b72e6849d18a2849c7ea184226f8827f7ba12018bfd14340849a2e638980e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): code_review_graph/graph.py:2833-2842 | code_review_graph/graph.py:2884-2893 \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":"code_review_graph/graph.py"},"region":{"startLine":2833}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e82f20b8adc487ef50dade6c9eb3240d14002fcba94eb206029cf0b72a5392"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): code_review_graph/graph.py:3380-3389 | code_review_graph/graph.py:3469-3476 \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 \u0060code_review_graph/graph.py:3380\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":"code_review_graph/graph.py"},"region":{"startLine":3380}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c7c9f41766b162cbfb559a6f01d0e535fb040bd0e8984185fe2644ab809707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): code_review_graph/incremental.py:1048-1057 | code_review_graph/incremental.py:1061-1070 \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":"code_review_graph/incremental.py"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2e3c04babcc0f750727c8ec75ed50418bbaeb496d2066ee74686a64ca87fbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 4): code_review_graph/parser.py:23869-23877 | code_review_graph/parser.py:23958-23964 | code_review_graph/parser.py:24288-24296 | code_review_graph/parser.py:24353-24359 \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. 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":"code_review_graph/parser.py"},"region":{"startLine":23869}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d8d9e641d2808d95b76970b968fe4f6b6a1a94533ec6abeab9fc6c09ccbf45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): code_review_graph/daemon.py:410-418 | code_review_graph/registry.py:84-92 | code_review_graph/tools/_common.py:185-195 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060code_review_graph/registry.py:84\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":"code_review_graph/daemon.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4593a22c1379149f734c192b4b6df75894484a40a5aa25371f0d4168919794"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): code_review_graph/graph.py:5262-5270 | code_review_graph/graph.py:5363-5371 | code_review_graph/graph.py:5383-5391 \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":"code_review_graph/graph.py"},"region":{"startLine":5262}}}],"partialFingerprints":{"codehealthFindingId/v1":"40474cc04b7afc5da52966c24de556359a0fdc528684fd08e93cba4cdf07037c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): code_review_graph/parser.py:4834-4842 | code_review_graph/parser.py:5768-5776 | code_review_graph/parser.py:6910-6918 \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 \u0060code_review_graph/parser.py:4834\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":"code_review_graph/parser.py"},"region":{"startLine":4834}}}],"partialFingerprints":{"codehealthFindingId/v1":"0550f1a6d69d1c3bcf95e8eda91927ca8bdf7619c8c19784375f6d1333215bdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): code_review_graph/parser.py:9533-9541 | code_review_graph/parser.py:9673-9681 \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 \u0060code_review_graph/parser.py:9533\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":"code_review_graph/parser.py"},"region":{"startLine":9533}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b4a48108f78b93a098874e90511b04122f75909e2b2b8143af0325f3a00afc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): code_review_graph/parser.py:14695-14704 | code_review_graph/parser.py:25099-25107 \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 \u0060code_review_graph/parser.py:14695\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":"code_review_graph/parser.py"},"region":{"startLine":14695}}}],"partialFingerprints":{"codehealthFindingId/v1":"6218400dd4492b64cb4a0ad29402aeb0ccd4a0eee9e1280e5103a0f2a6d9b41e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): code_review_graph/graph.py:2723-2730 | code_review_graph/graph.py:2832-2839 | code_review_graph/graph.py:2883-2890 | code_review_graph/graph.py:4529-4536 \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":"code_review_graph/graph.py"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b42fbc64630c08a328ebb1ebe03732c3330da049f7e6e71d71af0fb9f496f9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): code_review_graph/graph.py:5607-5614 | code_review_graph/graph.py:5644-5651 | code_review_graph/graph.py:5686-5693 \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":"code_review_graph/graph.py"},"region":{"startLine":5607}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a15b81c2f7b4ba9f2616dd4f81dd1609bd155d45c3fcb1bd2010a6d276c2335"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): code_review_graph/parser.py:2805-2811 | code_review_graph/parser.py:16884-16891 \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":"code_review_graph/parser.py"},"region":{"startLine":2805}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46a87dcf3499359b54cc675840a75a8db0093bbca95f402e90058109829f89a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): code_review_graph/parser.py:23162-23169 | code_review_graph/parser.py:24762-24769 \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":"code_review_graph/parser.py"},"region":{"startLine":23162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc365f96a2198e3ab39ec00896b18196eee02e60a133d0eae6f9307b9b6197c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): code_review_graph/refactor.py:2126-2133 | code_review_graph/refactor.py:2136-2142 \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":"code_review_graph/refactor.py"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a98ca74b53520862720273407e2bcf97f137202cd1011bab92b05e46c16730"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): code_review_graph/skills.py:3253-3260 | code_review_graph/skills.py:3344-3352 \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 \u0060code_review_graph/skills.py:3253\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":"code_review_graph/skills.py"},"region":{"startLine":3253}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cac5967e879b98b84db6b1fea67634e9cece972a8b363c386e87017fd6b736"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): code_review_graph/parser.py:23162-23168 | code_review_graph/parser.py:24762-24768 | code_review_graph/parser.py:24887-24893 \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":"code_review_graph/parser.py"},"region":{"startLine":23162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb758e9a2dc488779f68bcd19c47792ef7143fdf6dc914d7b0eb0172ea21623"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): code_review_graph/graph.py:5592-5599 | code_review_graph/graph.py:5607-5613 \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 \u0060code_review_graph/graph.py:5607\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":"code_review_graph/graph.py"},"region":{"startLine":5592}}}],"partialFingerprints":{"codehealthFindingId/v1":"21318e29c2a5c4c2b5aeb2ec03d87cbb8d58436c32afefcb2cd7d465e88f4e77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): code_review_graph/parser.py:8159-8165 | code_review_graph/parser.py:8193-8204 \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 \u0060code_review_graph/parser.py:8193\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":"code_review_graph/parser.py"},"region":{"startLine":8159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9beb0401daf4787ecd6875051a287d1dfb71c5d16ad560403560ec5c5390cb01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): code_review_graph/parser.py:15320-15326 | code_review_graph/parser.py:15603-15609 \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":"code_review_graph/parser.py"},"region":{"startLine":15320}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c211dde8b10d1830e266b9a82e76ab750867db1a24beb74df60659a1428d9e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): code_review_graph/parser.py:15330-15336 | code_review_graph/parser.py:15655-15661 \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":"code_review_graph/parser.py"},"region":{"startLine":15330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12599adf5e887e3ce834f9d82cceadd80da1a81e7fa6a86444b674a48193bb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): code_review_graph/parser.py:20445-20451 | code_review_graph/parser.py:23902-23908 \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":"code_review_graph/parser.py"},"region":{"startLine":20445}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07339a42212a5026fc9e4930fe251270c2a11203ef4130a35415fa768ccd97c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): code_review_graph/graph.py:5383-5388 | code_review_graph/graph.py:5490-5496 | code_review_graph/graph.py:5508-5514 \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 \u0060code_review_graph/graph.py:5383\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":"code_review_graph/graph.py"},"region":{"startLine":5383}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba020f54b9dae91e537b75cf1a9c656202fd2d87606032d5f148bd2da0f95328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): code_review_graph/cli.py:2482-2487 | code_review_graph/cli.py:2498-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060code_review_graph/cli.py:2481\u0060 calls \u0060add_argument\u0060 and \u0060code_review_graph/cli.py:2497\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":"code_review_graph/cli.py"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce26a7197ee3c16d74a7c21d4e608bf6eb2f164bf7e3a5d19a81115b8ff551c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): code_review_graph/graph.py:106-110 | code_review_graph/inheritance.py:43-47 \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":"code_review_graph/graph.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"297fcf86c1bff616edcb8b0209de89566d14757fc5a64bc13b3fd0d3a0bd0ff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): code_review_graph/csharp_resolver.py:40-44 | code_review_graph/jedi_resolver.py:289-293 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060raw\u0060 to \u0060str | None\u0060 in one and \u0060Optional[str]\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":"code_review_graph/csharp_resolver.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c03a2fbb3c4da1448767914fe8e291b406260b5823943020eb719f6c6146c99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): code_review_graph/graph.py:1225-1230 | code_review_graph/graph.py:1915-1920 \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 \u0060code_review_graph/graph.py:1225\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":"code_review_graph/graph.py"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"7040a68df126eb54b02253d165f35b2fca6db22e3c64a283ce1e05ecc6a94e56"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 the node:test suite in code-review-graph-vscode/ ran and not one test passed (Error: Could not locate the bindings file. Tried:), so the coverage report describes the failed run, not the code. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: constructs a service: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/sample_mocha.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b419c5da11762dd010b5a940d6c6bbe9149a990223b76ff33c3b7dc19968919b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: returns undefined for unknown id: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/sample_mocha.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"02baeab544db5508f048151799051db71c695d7686173b617e5f79caf63b97d5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should create a user: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/sample_vitest.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fbf57b209a0484eb2dca248a0965bb89a92c9163e7888951e8863752952d34"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should find a user by id: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/sample_vitest.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db348d0546fcdd21da6e36e3caf5ed09f9447a800b92cc00f11e906fe7d2f8b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: alternative test syntax: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/fixtures/sample_vitest.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a0b1963d05195661403ec92393231504bba3b6b7d287141b093b6f05157ba9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/parser.py: code_review_graph/parser.py changed 135 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 139 in CodeParser._get_name at line 22976. 111 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/parser.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":"code_review_graph/parser.py"},"region":{"startLine":22976}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab093832a1736c010ed8dc8af269ec283eeedb6f61fb971001be295917c83b75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/cli.py: code_review_graph/cli.py changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 165 in cli._dispatch at line 2721. 44 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/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":"code_review_graph/cli.py"},"region":{"startLine":2721}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72f0acb68680498a083ab508ce7902ff2ab50fc9f9cc5682064fa4d11dab645"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/incremental.py: code_review_graph/incremental.py changed 95 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 105 in incremental.incremental_update at line 3173. 76 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/incremental.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":"code_review_graph/incremental.py"},"region":{"startLine":3173}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a6102ccac8470ca0ca961225f3b05cdcd02ec94cbac1c66a21c672ae1ff37d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/tools/query.py: code_review_graph/tools/query.py changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 196 in query.query_graph at line 1019. 27 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/tools/query.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":"code_review_graph/tools/query.py"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01b0fb48ad3c6b29357b8ac0041585daa0c17a49d69029ba9abdbef7e59ee5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/graph.py: code_review_graph/graph.py changed 79 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in GraphStore._resolve_bare_endpoints at line 3969. 63 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/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":"code_review_graph/graph.py"},"region":{"startLine":3969}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a830753f1ab30861dbc56229d71fccfddbce6d250822685e3c0ceb155fe72f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/skills.py: code_review_graph/skills.py changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in skills._install_platform_configs at line 1291. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/skills.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":"code_review_graph/skills.py"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f5cc8b77b487e2179afa11e066082659985b73bd072377d8aa6a2dd4b73b88"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/refactor.py: code_review_graph/refactor.py changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 98 in refactor.find_dead_code at line 1955. 13 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/refactor.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":"code_review_graph/refactor.py"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e39a1389c092d2d5f95fb3c1f4115ad0782107b90add03ef2549a91184a5d1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/tools/build.py: code_review_graph/tools/build.py changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in build.build_or_update_graph at line 486. 21 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/tools/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":"code_review_graph/tools/build.py"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62aaebaf88db286a8a70db37461742fad341f7c75434b3cc4a8bf73544afec9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/changes.py: code_review_graph/changes.py changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in changes.analyze_changes at line 1482. 13 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/changes.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":"code_review_graph/changes.py"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15c7155a3e2db35fc223d3fb8196c26081defa61d337f7d9783e19fe36271c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/main.py: code_review_graph/main.py changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in main.main at line 1624. 24 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/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":"code_review_graph/main.py"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4c78cb6212fa54ba9754800403aaf032e76231c45776dc4ae40b4d8211e87b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/tools/review.py: code_review_graph/tools/review.py changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in review.get_review_context at line 434. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/tools/review.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":"code_review_graph/tools/review.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad627c121db137ce231d8ee065524ab53f1d537df6fea2c4bdd67f17a3443752"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/search.py: code_review_graph/search.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in search.hybrid_search at line 995. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/search.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":"code_review_graph/search.py"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87dac6aaf43d976b786edf277388799bb95543065441618d6a1363ac435c765"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/uninstall.py: code_review_graph/uninstall.py changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in uninstall._clean_hook_data at line 579. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/uninstall.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":"code_review_graph/uninstall.py"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e273898bd54084f56c307ab7625bb7bc37c02d753c3ebe4b2a55e1b30b7fd80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/spring_resolver.py: code_review_graph/spring_resolver.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in spring_resolver.resolve_spring_di_calls at line 30. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/spring_resolver.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":"code_review_graph/spring_resolver.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6709728ab4c710c78c1bfc81e989e07620654638492a410e70b0675483dac25f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/flows.py: code_review_graph/flows.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in flows.incremental_trace_flows at line 808. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/flows.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":"code_review_graph/flows.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"32320402884b2fa2a3c93a319f9d09ddadae0f38b02c3758b02ac28c57cfaae2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/render_pr_comment.py: scripts/render_pr_comment.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in render_pr_comment.render_markdown at line 374. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- scripts/render_pr_comment.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":"scripts/render_pr_comment.py"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"96694de8c36c1f180be3d6ba6a0aa9f9de1bb18353e6eca74d289e6a3db644a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/communities.py: code_review_graph/communities.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in communities._split_oversized at line 604. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/communities.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":"code_review_graph/communities.py"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcf35173d874c0e4f478f926c6a1b4ba4f116bbe46b350d6b4fd0862d6a6203"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/csharp_resolver.py: code_review_graph/csharp_resolver.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in csharp_resolver.resolve_csharp_calls at line 121. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/csharp_resolver.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":"code_review_graph/csharp_resolver.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"8601940a2695da4c06763a409d22f20a8db85e5deef8c66ccc8f8a49539d63b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/aop_resolver.py: code_review_graph/aop_resolver.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in aop_resolver.resolve_aop_advice at line 316. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/aop_resolver.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":"code_review_graph/aop_resolver.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8976228ca86b8c5e8df58275815404ea76ffba4fd015655cb6068afecaa124"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/daemon_cli.py: code_review_graph/daemon_cli.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in daemon_cli._handle_status at line 219. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/daemon_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":"code_review_graph/daemon_cli.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c4095bd412fd3f45f7e604edd381d1e3170d1a2d5cccc46ede4b10922efeb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code-review-graph-vscode/src/extension.ts: code-review-graph-vscode/src/extension.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in extension.registerCommands 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code-review-graph-vscode/src/extension.ts\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":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6d90fabb242769346867a9b7a64e19e2ec40d87454429cf82e60558ba2a1c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/tools/context.py: code_review_graph/tools/context.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in context.get_minimal_context at line 33. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/tools/context.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":"code_review_graph/tools/context.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7edfc5736f821b1a47972ea1195fa7462d0a9725481e839ab09508c7d181cd65"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/temporal_resolver.py: code_review_graph/temporal_resolver.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in temporal_resolver.resolve_temporal_calls at line 31. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/temporal_resolver.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":"code_review_graph/temporal_resolver.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"226540077c263e11d725ee4a65af49e23568f6ad0ab1ffa17a96e46187c5db7b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/scoped_resolver.py: code_review_graph/scoped_resolver.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in scoped_resolver.resolve_scoped_calls at line 235. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/scoped_resolver.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":"code_review_graph/scoped_resolver.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cdd31e5816baef1810457a2af333401c862e3404499710fed476dd033c604d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/tsconfig_resolver.py: code_review_graph/tsconfig_resolver.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in TsconfigResolver._resolve_extends at line 140. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/tsconfig_resolver.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":"code_review_graph/tsconfig_resolver.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2474182930deb8d326e4836bbafffde6fe8cb64681e5c906ebf6923cb1a7b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/python_resolver.py: code_review_graph/python_resolver.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in python_resolver.resolve_python_imports at line 34. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/python_resolver.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":"code_review_graph/python_resolver.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a5e90aa2e05f7caf5acd68a3de9113b55d7abb57569bf005b5321c9cf4d624"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/exports.py: code_review_graph/exports.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in exports.export_obsidian_vault at line 266. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/exports.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":"code_review_graph/exports.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e873693cdf798f9f40c4a9b5707299ebc1788d0da13a7d42b13f0ccf65a872a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/audit_python_imports.py: scripts/audit_python_imports.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in audit_python_imports._file_facts at line 385. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- scripts/audit_python_imports.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":"scripts/audit_python_imports.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"917eaadfd992875552af963eff95e458326479b6a79f8c27ab9d79bb352541c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/tools/flows_tools.py: code_review_graph/tools/flows_tools.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in flows_tools.get_flow at line 111. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/tools/flows_tools.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":"code_review_graph/tools/flows_tools.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff25e3f61bee87210fdb4b5b684acc32c842013dc32090a9771636c26ff0d776"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/rescript_resolver.py: code_review_graph/rescript_resolver.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in rescript_resolver.resolve_rescript_cross_module at line 39. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/rescript_resolver.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":"code_review_graph/rescript_resolver.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da17f2117a987fa29b6f762ce21359a55c7ad8ef7f96ee56c372c453ee80380"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/doctor.py: code_review_graph/doctor.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in doctor.check_hooks at line 724. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/doctor.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":"code_review_graph/doctor.py"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ff577de561b41f50d7936ec85bf10380d11939afba9b17842f60b35dceb658"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/jedi_resolver.py: code_review_graph/jedi_resolver.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in jedi_resolver.enrich_jedi_calls at line 28. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/jedi_resolver.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":"code_review_graph/jedi_resolver.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd21ef71d3d136be3b9a11d7c680f63476aa3b82aede32cdb5b6b201b807afe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/codex_skill.py: code_review_graph/codex_skill.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in codex_skill.install_codex_skill at line 136. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/codex_skill.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":"code_review_graph/codex_skill.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9ecd9001b7fde60f1f957a8b9984f15c6b1031d5631fe41ed8e89ed14468f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/neighbourhood.py: code_review_graph/neighbourhood.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in neighbourhood.extract at line 535. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/neighbourhood.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":"code_review_graph/neighbourhood.py"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a478bd2a2d2fe3652291a886ac64edb890d8c9608c4e3cf00b5dcc73a36e58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/hcl_resolver.py: code_review_graph/hcl_resolver.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in hcl_resolver.resolve_hcl_module_references at line 18. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/hcl_resolver.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":"code_review_graph/hcl_resolver.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf2e4317235081271dc58769f989f893e5b73ece805749d99ea762833e394fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/install_gitignore.py: code_review_graph/install_gitignore.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in install_gitignore.repo_files at line 75. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/install_gitignore.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":"code_review_graph/install_gitignore.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9d319d7e4af87530cee276b151adcbd6050cd18543b2aa70ac61820022f013"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: code_review_graph/npm_alias_resolver.py: code_review_graph/npm_alias_resolver.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in NpmAliasResolver._aliases_for_file at line 128. 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/npm_alias_resolver.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":"code_review_graph/npm_alias_resolver.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc017b97895e1f56f93537aa1cf34a0b97ac67b896388c75d2c9508b6dc63ad3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: code_review_graph/daemon.py: code_review_graph/daemon.py changed 15 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 15 (its worst body is WatchDaemon._start_watcher at line 1668), AT OR 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(daemon): stop keeps the health file of a live replacement watcher\u201D; \u201Cfix(daemon): stop clears the health files of watchers killed outright\u201D; \u201Cadded up the tests in deamon_test and made the suggested fix\u201D; \u201CMerge origin/staging; fix the review findings on #262\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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/daemon.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":"code_review_graph/daemon.py"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6790b471ff54d07c2b0796b1e531876826731ec58a5e960b4184630a2f738f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: code_review_graph/uncertainty.py: code_review_graph/uncertainty.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 11 (its worst body is uncertainty._staleness at line 404), AT OR 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: an edge that names no node says so, and confidence means something\u201D; \u201Cfix: changelog entry and a true gap note for npm aliases (review of #880)\u201D; \u201Cfix: withdraw the claim on a failed scan and apply the graph\u0027s own file rules (review of #987)\u201D; \u201Cfix(uncertainty): count only untracked source under the graph root that the graph does not hold\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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/uncertainty.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":"code_review_graph/uncertainty.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"144c2d9bf2d6cc2994fc07618d60bebef957311b67ea9cd4a8468fe2cd744a4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: code_review_graph/tools/_common.py: code_review_graph/tools/_common.py changed 8 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 15 (its worst body is _common.graph_provenance at line 60), AT OR 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: leave source confinement to #269 and stop reconcile reading linked folders (review of #1101)\u201D; \u201Cfix: address writer lock review feedback\u201D; \u201Cfix: unknown-risk guidance, linear dedupe and clean paths for unmatched files (review of #1084)\u201D; \u201Cfix(review): report unknown risk when requested paths are not indexed\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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/tools/_common.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":"code_review_graph/tools/_common.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88f6113a521413bfbf24bbed6f7aebb697e6bfeb197c601907514643a33857d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: code_review_graph/hook_update.py: code_review_graph/hook_update.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 9 (its worst body is hook_update._payload_file at line 36), AT OR 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: Codex edit hook never builds a new graph\u201D; \u201Cfix: hooks read their JSON input as UTF-8 on Windows\u201D; \u201Cfix: edit hook trusts a shared graph only for its own repo and sees legacy graphs\u201D; \u201Cfix: edit hook updates the repo that holds the edited file (#311)\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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/hook_update.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":"code_review_graph/hook_update.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf2ed25dbd65d585da908f98cb09b14da3dbccbe1ac1c4ac03ff50fe4e0a8e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: code_review_graph/tools/docs.py: code_review_graph/tools/docs.py changed 6 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 12 (its worst body is docs.get_docs_section at line 144), AT OR 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: quote every pip extra hint so zsh can run it\u201D; \u201Cfix(lock): keep forget previews, legacy moves, embed paths and watch idle honest\u201D; \u201Cfix(lock): make forget, embed and watch obey the write lock\u201D; \u201CIntegrate PR #962: fix(embeddings): enumerate nodes independently of stored paths\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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/tools/docs.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":"code_review_graph/tools/docs.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc4f5c8f0f6bdb1fcb0fce0e3c2dbddce8defb8894868e223c8b76653a9deb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: code_review_graph/locking.py: code_review_graph/locking.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 7 (its worst body is WriteLock.acquire at line 148), AT OR 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(lock): make forget, embed and watch obey the write lock\u201D; \u201Cfix: no flock support runs unlocked, and update and postprocess keep accepting plain directories (review of #1126)\u201D; \u201Cfix: address writer lock review feedback\u201D; \u201Cfix: report only real contention and keep the lock out of forked workers (review of #1126)\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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code_review_graph/locking.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":"code_review_graph/locking.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"65788d16e32ac27a5d07114cdb8791877208c2ed7a8b5e002e6544a8b40eb9cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: code-review-graph-vscode/src/backend/cli.ts: code-review-graph-vscode/src/backend/cli.ts 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 4 (its worst body is CliWrapper.watchGraph at line 98), AT OR 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(vscode): computing embeddings has no time limit\u201D; \u201Cfix(vscode): watch mode keeps running until you stop it\u201D; \u201Cfix(vscode): walkthrough build reports failure, and builds have no time limit\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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 20:25:55 \u002B04:00\u0027 --until=\u00272026-11-12 20:25:55 \u002B04:00\u0027 --full-history --no-merges -- code-review-graph-vscode/src/backend/cli.ts\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":"code-review-graph-vscode/src/backend/cli.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2360d40cd5fac625f1eab55d51315eb96a817157f39ed9a7dfcd83dc45c347c1"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 23 significant file(s) lose their only recent owner: code_review_graph/visualization.py, scripts/audit_python_imports.py, scripts/render_pr_comment.py, code_review_graph/eval/benchmarks/incremental_fidelity.py, code-review-graph-vscode/src/extension.ts, code-review-graph-vscode/src/webview/graph.ts, scripts/promotion_gate.py, code_review_graph/_legacy_instructions.py (\u002B15 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2604a2dcfdf0a0263854a0ac4e2fd5d72a65f413b6b1a1494be7734e88ff6dc8"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060pyproject.toml\u0060 makes this repository a deployable product (line 59)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyproject.toml"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f93f7a2c78f190233679ac8202a9f8e691d2305d697b777ee579589e9c4bff1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Register walkthrough commands\u0022 repeats the code it sits on: 3 of its 3 words (register, walkthrough, commands) are already in \u0060registerWalkthroughCommands(context, cli, installer);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcdefcca02cb1b2ce4eb5adcb0a1f4181ffa2510aa70c2c3130a26a1278c647"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Schema compatibility check\u0022 repeats the code it sits on: 3 of its 3 words (schema, compatibility, check) are already in \u0060const schemaWarning = sqliteReader.checkSchemaCompatibility();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5487e028da952717f1475888546529ab977ed4dd3bd81e0561ca7a527aa451"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create status bar\u0022 repeats the code it sits on: 3 of its 3 words (create, status, bar) are already in \u0060const statusBar = new StatusBar();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba6187839b6c58985a547fbd3132a76d4b14195f11e7e9a3d43b668239906dc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Resolve node at cursor\u0022 repeats the code it sits on: 3 of its 3 words (resolve, node, cursor) are already in \u0060const node = resolveNodeAtCursor(reader);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/navigation.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"691606e1066cb22bd65975430b10b8bee428514ec563b67915c9fbe00be4e0f2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Resolve node at cursor\u0022 repeats the code it sits on: 3 of its 3 words (resolve, node, cursor) are already in \u0060const node = resolveNodeAtCursor(reader);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/navigation.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef386761994803191e38a1ba5a6913728fbc58e82ebd8ee618ce9e87f54a4c2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Filter edges by visible kinds\u0022 repeats the code it sits on: 4 of its 4 words (filter, edges, visible, kinds) are already in \u0060let links = allEdges.filter((e) =\u003E visibleEdgeKinds.has(e.kind));\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf65f53f3e0244238072b272abaa6e7379fcc53aa5f8087819aa0f89c4a9cd6"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (85110 LoC, 211 module-visible types across 7 directories) overshoots its size bounds. 1 of 2 build unit(s) (Python, npm) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyproject.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4842ad367a78941ccec73d857627e21e838b932492f4ae73cdd87ada79a9f00"}},{"ruleId":"D27","level":"note","message":{"text":"Scattered collaborators: 91 % of calls cross a namespace and only 17 % of collaborators are co-located \u2014 group each feature\u0027s code into a vertical slice so a call\u0027s collaborators sit together."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5aad4a4530bac3928d3a065a664be89d023ecfc865f9bf79ac05754b3bffe322"}},{"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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"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":"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":"9545660e6add0322e3f7b23092a9bdb2b9ecacff6395f93e694cf9dc97bdaaa2"},"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":"ee6da1b051ddff31eece62e737e90827fa671274985f5a26bd0f59d7c044006f"},"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":"9efc61085c90fbe1ede50aca3f9690f82fe1c1cc9bd1ace2abe757c1e913f452"},"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":"b1254883b141770938ccc8c6cf8602c21ae57203050fb75813fd9c0fd8911385"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"6b562a86ba4fad32d6ccdcd6ca2d4c34c2236a59e5d8276adbfb83a1790cdee0"},"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":"49423b6754fd89d4f177efe19a91488e8e6b0e174dc46f41bec86e14f72877cf"},"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":"ab979ab2dc46515c14a5a4f004fc991e04e40404eedb88f91aeaa5242f0df4a2"},"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":"c92107f92612c817c486377def33d41825f5a95565ee3c603aaac89e8b80cfba"},"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":"c4014e7719155abad9ee780737c6a29d8c31bcf1e70b94286734d74edc799576"},"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":"9607c41e2efdec713e91c6465be74f11d53838472a9a6b1b4b4662cc3f635cba"},"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":"2ba1bd8cd7cc00ffea37dae7b5e07643f624b23874e3cb0759fc3e4878f73406"},"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":"5f1ead87649e68a768bbd05ef03f42cc101bce3e91b8f784796fd9cc3b66f41d"},"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":"7d0e5edba45675d851778cd3af8aa96de3e6096e7e9ecce635c469fbb4835d26"},"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":"1fe915542e9ef9e0e2030d13e5e967c9edc93ad44e0043112709e63c307bce8b"},"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":"bcb2f91459dd94ec71a140068e51e379405996e9407c1778e509f36b109e4882"},"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":"a7f9dd3464daa5585850541b0e4e68e35d24908826c4f85420d7dbffdc708d62"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"7e9323362030c11a89ee75d7211b2720333c55d8869ae68ed4aebea060c08384"},"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":"9ff81f517691a4a7452e6db4a573c5c5cd2cefea76288d43cb1ef3f0aefd7be4"},"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":"fbb3016e08588da0295feed2d3c1aabf07e14aa98db895f7d8608ac6dac5e7fc"},"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":"bc55ea283c3c63c119e8ba81bb5b06f45a22f7d8498f8f9f365ba5d310c9144f"},"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":"7e42ff37fbe866dc85d7bcc0fc29b848d8a17a96e5826f7a7ea9722ba023fe1c"},"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":"3cfb739efb7ca2b377a62f611cd804c03fe4f58a5b0115bd0aa20c02c88013ff"},"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":"e699d87140837204f3b986f6aeb13bd12e3498cd720aaedc2df61d82699a23d3"},"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":"0161614137f26cdbdb1c7d32fc91f5cc182413c4382e2c6615a170aee70774fd"},"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":"178f9faf4152be3b7f8f53e3bffb89e699e858c7143561e01a5d5028867d1243"},"taxa":[{"id":"CWE-807","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"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":"fa0a82bbaf442e88b041eae9b85366bf368ccc849f8292ece01315751accbe36"},"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":"eb50587a88560d4eaddda70f28c9215936a6ec4db92457d05741cfaeb37d5f54"},"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":"16c2444cfb49b0afb0f62f7cffa9c49b7598941e78a9f85c9386937904469bdb"},"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":"110d248cffdb6834edb5107b50ac43c621d54b30f4607c8018acbe24b4daabf9"},"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":"3e8f5470614f3e3a43ca2c8709aae1a95977c37a01ca72e848c356e8fa6880d1"},"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":"6dfc09aaad89de472f27432c8d89d01eb30b4072ce6d21ab076fb7cd9df93668"},"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":"e0508b1451ee779bcd5c72efeffd30f5c385d9a0844a79340eb333c593d14744"},"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":"6b94d8e6ae721d6ee9aa783c1480fe0b4ffe12fdd0ef2d6eba8835c4f5fc7e64"},"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":"5f84722fe36e895558370557b91590a7407cc68a2a5de2742df9c0facaef7896"},"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":"c946ed3e153b3bdd2964712eb5c80f3d4a6147b0a9c9d6a1a51d1445773c6116"},"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":"d9bee4946343525f8b8971488c5efd9c2a55dd917fd88cf875a26a52b8b2a4d4"},"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":"147a268a7a974dc5758612581f5f6f7fcc58cb795a8fea363a1e22118ec08e13"},"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":"d3b15c0896dc96dfb5908a112d3f822cc48c1ac2ffc7b355287606ea41c2598a"},"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":"ee00693a2b45680f351835ed8f642354885395006c6c467ffd64bc9e4bb4d517"},"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":"6bc5aa4e1e71c12b9c87894550d87d26c7cb7cf365bdc6ef6e1c480fb1f774ff"},"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":"79a7f33cf88498f76257a6201fa6e564da2158887996126a12a2b26a50a8c0f7"},"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":"88957a4a2e274d1dc9b8c1854f109235708f3ff5bded43ae3d63095cd1eae693"},"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":"39006626860d7638d3b823949072aea1d65f608b801d13e6cc6e7607d3988df5"},"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":"45a07e092ed96cb62ba117b7e10831e8af084b25403e1ad2e91aee3d5838096a"},"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":"fde56b276473f3ef3e1b84fa6deb43256f78636dd84a213e2b7c9b6128700a75"},"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":"f5a042f9fa484d3543a2a8394e1e0389e69ca1eefa1f247210bf803a6d4e4232"},"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":"65a00fdb1f51a357d0902514e5712478a87333ed73bd7790af6024bf4f978135"},"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":"b474e255a606daec7eebb3dbfa320614b7ffd05657f078fad6e136b0ac8abdc0"},"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":"c3b9e375ee292b5f96250b93bc60192d645d9b60d21b70cce2bb6baa0d006ddb"},"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":"175c4f6645357547a4aa0e323d761a097e68ccfe63d84ba4446a37fd1631537b"},"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":"3b5a301171da26cd56ce44b336ba53ca6c9e469b8a51cd1c40ebf7dd75d0d8d2"},"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":"98d0ba0551d9738a1fa545279fab4df84b29cbdf6ac02e50eb2fadd23051e257"},"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":"acbc622807e4105e31702f03e6f8aef1fdbd2b9e8bc0e4f72cd76b6712cef335"},"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":"3bbdae3e1b543ba1bc2f33474e316d5d73947702746a829f29b0899fa1444f6b"},"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":"20fab25dd63d458d0eb8a06bc34a734943f5b1322648a11b11c0b2c60e1c0b23"},"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":"da437c77adf6e6da18ed294f45b71c3b1e1a4a214c7171345bf37016c0b450cd"},"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":"dc8a0b6a29052aa48bc18119bec50c3d6534e9f540be1132524d3deef2404b78"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"1643dd8ee65a3762c3f894148cd25e23f44b39c7b605a763944495f77e9d16a5"},"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":"5d2bf3d2d7b39c2a046189f80ddef234edbf81ff261cf0db3c2130fce66f569c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"7725ecc73f478d6d28a583ad8fe6fbc0046bd01d47dfba984ea27e9221e2b6bb"},"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":"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":"883dceec3f97a620be5900c7058da1f96a024bc0adc2a4aac905164427ed007f"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"04d14d64acbd1f5e9be44a8ef8ee330b09a6434334bd3407f871c8094245ead4"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"706882f3a7bff419f4c43f528f4a347ea774f3dceb2e9d33e1a0a8c0bde59331"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"b139440a21ceec3bccaf2be5ebd7dbdf573a33c12b3d41ffb8edb54353a8ac2c"},"properties":{"dependency":{"package":"anyio","version":"4.8.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-4024","PYSEC-2026-4025"],"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":"cd9c2514db22b580daf04aea8447f1a620c0b229b4bcabab7616b85d29dfbdca"},"properties":{"dependency":{"package":"authlib","version":"1.7.2","advisory":"[GHSA redacted]","aliases":["[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]","PYSEC-2026-4354","PYSEC-2026-4355","PYSEC-2026-4356","PYSEC-2026-4357","PYSEC-2026-4358","PYSEC-2026-4359","PYSEC-2026-4360"],"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":"09eef8b6625b25738f8700358b71be29a093fcfe59905926f2178ad3d178132f"},"properties":{"dependency":{"package":"pillow","version":"12.3.0","advisory":"[GHSA redacted]","aliases":["BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112396","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112400","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112405","BIT-pillow-2026-112406","BIT-pillow-2026-112891","BIT-pillow-2026-112892","BIT-pillow-2026-112893","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112898","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-114501","BIT-pillow-2026-96636","BIT-pillow-2026-96637","BIT-pillow-2026-96638","BIT-pillow-2026-96639","BIT-pillow-2026-96640","BIT-pillow-2026-96641","BIT-pillow-2026-96642","BIT-pillow-2026-96643","BIT-pillow-2026-96644","BIT-pillow-2026-96778","[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]","[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]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4328","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4333","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4336","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4339","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4342","PYSEC-2026-4343","PYSEC-2026-4363"],"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":"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":"4d55eb5e10fbe2eebac3cecc6f1c6c6c29fa6ca98a738924e23ab582305d2b6f"},"properties":{"dependency":{"package":"dnspython","version":"2.8.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"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.32.2","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]","[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":"aed0f6944c1dc195949f2b036dd27c2be50863ae8fe274ba3ea5b4781e348ef2"},"properties":{"dependency":{"package":"joserfc","version":"1.7.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE 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":"5102fe556f3399b622dcd81c118f7d1308c1374fbd00ede44c01babfc78c0a23"},"properties":{"dependency":{"package":"pyasn1","version":"0.6.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"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":"88d705514b02721bd2bfc48957e400394717b704dadbcd8e6ea6e3788c2e19b6"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.12","advisory":"[GHSA redacted]","aliases":["[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]"],"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":"774d4aa609e79d8804b30cce8c3366a0b7a48f72f4c27aeff2b25d0f60424401"},"properties":{"dependency":{"package":"form-data","version":"4.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"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":"c63d7ac12e533f319b8d4e948d7ae45a4df1b6de107a71c0f6457698c0f8d934"},"properties":{"dependency":{"package":"linkify-it","version":"3.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"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":"76a3325d125ec122d2ec65aa3ec04462cda6471b412df34901b83e0475af2c31"},"properties":{"dependency":{"package":"markdown-it","version":"12.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"29ef8a601b3e9ce41a2139fea56f8da03aaa50d3f1e8d6f3efac7acd4840410e"},"properties":{"dependency":{"package":"tmp","version":"0.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"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":"9d3c490fd3c1f997c11df9abece02a63e3f579d1afe9eb226245a036d43b958d"},"properties":{"dependency":{"package":"undici","version":"7.24.4","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]","[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":"not-imported"}}}},{"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":"97d9560bb8390b045efbcba85ab8f1a51f5e44d437cc35ac0bd1079d49f388c0"},"properties":{"dependency":{"package":"mcp","version":"1.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA 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":"c68710a9a3c2a83116b91ca1c07e92c31b88c6415b111f4c95fba9e6b2d24155"},"properties":{"dependency":{"package":"fastmcp","version":"3.2.4","advisory":"[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":"3b3561b3bde269e229d36f78bc14d6fa7c55db65722539ac2080da513f44a218"},"properties":{"dependency":{"package":"opentelemetry-api","version":"1.44.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE 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":"d0e6a57015dc23cfdd8374d0bc7df076eac4b337374fa23d10cb0ae918b0187d"},"properties":{"dependency":{"package":"pytest","version":"8.4.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-1845"],"reachability":{"kind":"test-or-tooling","file":"tests/conftest.py","line":15}}}},{"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":"d2080093d9cbdbd5c75da8758d5db19ca991a54c4fd5085d66b7f0e491731199"},"properties":{"dependency":{"package":"esbuild","version":"0.20.2","advisory":"[GHSA redacted]","reachability":{"kind":"production","file":"code-review-graph-vscode/esbuild.mjs","line":1}}}},{"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":"2545092f6f77d6fb092eda67c8aadf16e23b70964003bdb7864efe3dead9b79e"},"properties":{"dependency":{"package":"qs","version":"6.15.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"b80639e637a36319355cea3ecf850be7b328358d2abf61dca31b02802f4d6cf7"},"properties":{"dependency":{"package":"uuid","version":"8.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"83.0.0","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"ruleId":"D31","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":"a70fd225759adf29cb92a6b1017c0fe7ea9452e3ac8da20b91dc5ae32e351cfd"}},{"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":"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":"d15df5171d54d9a3cfe919193b940b95eb1db599610449c8b68164e072da6651"},"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":"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":"9b15183b821b0d8f2a8a9a4a501e7e6d43815f083fe597ec3f99fb39c4628148"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","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":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"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":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"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":"a1d38b94cdea2a659cc84875fae20a9a0455b40db70339ff2f132cf32d4a16d8"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"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 7 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":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch npm/uv: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060npm\u0060, \u0060uv\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9815db4f3f6c05533e8c3a5ad9a41500a5649db4c006fbc8834553bb4735b2c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): code-review-graph-vscode/src/features/navigation.ts:56 \u00B7 code-review-graph-vscode/src/features/navigation.ts:134 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/navigation.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"092fb09cfc25452aa5c52dec2ceb4c1eb0017efc3f7c4716ca2ffe6fc2d3eea3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): code-review-graph-vscode/src/extension.ts:185 \u00B7 code-review-graph-vscode/src/extension.ts:239 \u00B7 code-review-graph-vscode/src/extension.ts:417 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e52b4e3a4757f7b49a07878478aa9988093a7756e07fcd60466f2d293c6244c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): code-review-graph-vscode/src/extension.ts:221 \u00B7 code-review-graph-vscode/src/extension.ts:450 \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":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e2240bf1e0eb15908a04bf444bc5179149997d7f7560785d9cbc04fdc4a471"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): code-review-graph-vscode/src/extension.ts:282 \u00B7 code-review-graph-vscode/src/features/navigation.ts:118 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad81f959776f850ac25ca484881279d159d1d919331cbbc392a82917f29b3fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): code-review-graph-vscode/src/extension.ts:612 \u00B7 code-review-graph-vscode/src/features/navigation.ts:174 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc8ce9757f4c1dfe9fc7afcde71e294cf4464ba36a24cd6ff919e9b8ed95668"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): code-review-graph-vscode/src/views/treeView.ts:81 \u00B7 code-review-graph-vscode/src/views/treeView.ts:101 \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":"code-review-graph-vscode/src/views/treeView.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"300c0794890226b011efc9e81fb07dc23a71c0772e348c034efc998801ba550f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): code-review-graph-vscode/src/features/navigation.ts:15 \u00B7 code-review-graph-vscode/src/features/navigation.ts:74 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/navigation.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0597e5ff274ad6da7b43404ea254154c919177376a3c1fcd4d72b541924660"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): code-review-graph-vscode/src/views/treeItems.ts:83 \u00B7 code-review-graph-vscode/src/views/treeItems.ts:178 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/views/treeItems.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9724b7666df5a9bc5415b201cd250fb98951d639a314e517d3860d617fef7908"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): code-review-graph-vscode/src/features/navigation.ts:36 \u00B7 code-review-graph-vscode/src/features/navigation.ts:114 \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":"code-review-graph-vscode/src/features/navigation.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f65907e39a6b67343277b21c2c57699ddb314c1f32f3e38cfc62ef400ff69b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): code-review-graph-vscode/src/webview/graph.ts:716 \u00B7 code-review-graph-vscode/src/webview/graph.ts:739 \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":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"0484b323a414f727d372e2c98750a33d6bb928fc4d05487a3fc5d038d844df2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): code-review-graph-vscode/src/extension.ts:111 \u00B7 code-review-graph-vscode/src/extension.ts:646 \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":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3bb40844cf3fc742f566f41b887dae4330994a78adddcec8726ed451d0a1a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): code-review-graph-vscode/src/extension.ts:467 \u00B7 code-review-graph-vscode/src/extension.ts:586 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"54eb6c3c3b4cee74b65191649363cdb0ef9f2ee3b7b5331e1b823d7808f7cb99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): code-review-graph-vscode/src/webview/graph.ts:328 \u00B7 code-review-graph-vscode/src/webview/graph.ts:367 \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":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eda564fc7ca07b24b9288d610a4ceaecf432389e2914bd139fc6ae1867bbf23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): code-review-graph-vscode/src/views/treeView.ts:25 \u00B7 code-review-graph-vscode/src/views/treeView.ts:144 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/views/treeView.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6fc2701bb5bba75b21fe08894a89f0adfe35c95eca53e8363f2ba4ceafc9de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): code-review-graph-vscode/src/webview/graph.ts:303 \u00B7 code-review-graph-vscode/src/webview/graph.ts:355 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"1126c6257264bdb2fd0d727e6702a2abcf4d8bb6c46dd62391409142da6eb3fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): code-review-graph-vscode/src/extension.ts:83 \u00B7 code-review-graph-vscode/src/features/blastRadius.ts:22 \u00B7 code-review-graph-vscode/src/features/navigation.ts:11 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"afae660c5233e2fdbc3de011fda555c0a39345494cb61ba124ccab49e0e34c52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): code-review-graph-vscode/src/extension.ts:68 \u00B7 code-review-graph-vscode/src/features/cursorResolver.ts:31 \u00B7 code-review-graph-vscode/src/features/search.ts:56 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2f88dc80bd1752a3bf7605df4ad7a209d7cfd2de2c86d182089d685960ec2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): code-review-graph-vscode/src/views/treeView.ts:120 \u00B7 code-review-graph-vscode/src/views/treeView.ts:187 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/views/treeView.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea52b50dca7ec0009b05abe85faa384f4b63b06cb0ed1c258b652fa2e1e1150a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): code-review-graph-vscode/src/features/blastRadius.ts:48 \u00B7 code-review-graph-vscode/src/features/scmDecorations.ts:59 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/blastRadius.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1764465976b6d752c12347a4179e3736adeb346f30d7409ea7551fd6fada6bd4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 39): (anonymous) has cyclomatic complexity 28 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"2676a215e1ff92bfed797a880f267e34426821f6e759326884ec5404eca0112d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getVisibleData (cyclomatic 20, cognitive 53): getVisibleData has cyclomatic complexity 20 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f608f61dbe207d7eb9892e2d55ecc8e067738b4fe7fd747011c69051beb2c2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 23): (anonymous) has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae538fe544d4c8a55f83085ee2d73563a8665326eefdb3d2cdce4d822680f92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getImpactRadius (cyclomatic 16, cognitive 30): getImpactRadius has cyclomatic complexity 16 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/backend/sqlite.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c9f4ffe0874f98ee935615698c68f20acfa2dd36f8d3e8be46a2e81132d10a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"817aa3b44206da5f42e36c0c0ef471c9c44bc1309e67f8d6071368f999721c4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/navigation.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f610b9c515ded094f5a177a3b8ffab9f1a149c3e26ecdfb5f1a2697bb1f330ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setData (cyclomatic 12, cognitive 16): setData has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa5592e7aa5752d7ef0c1ce1cbb15eb5ecdafa82b79f2e4814bf9df943617f6"}},{"ruleId":"R3","level":"warning","message":{"text":"code-review-graph-vscode/src/webview/graph.ts: 872 lines of code: code-review-graph-vscode/src/webview/graph.ts has 872 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fe7bd7affcf36110f0184cc242fb120fcb9f1b12bac0aadb60c028cc6fe575"}},{"ruleId":"R3","level":"warning","message":{"text":"code-review-graph-vscode/src/extension.ts: 862 lines of code: code-review-graph-vscode/src/extension.ts has 862 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61702a3aa96077e81a188830e3570322e433a5a0970c12ab49c06c726181c032"}},{"ruleId":"R3","level":"warning","message":{"text":"code-review-graph-vscode/src/views/graphWebview.ts: 571 lines of code: code-review-graph-vscode/src/views/graphWebview.ts has 571 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/views/graphWebview.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d9f05d3181578a50b08bcaf7d3538fdb693d2803a245008908208ddc4361df"}},{"ruleId":"R3","level":"warning","message":{"text":"code-review-graph-vscode/src/backend/sqlite.ts: 525 lines of code: code-review-graph-vscode/src/backend/sqlite.ts has 525 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/backend/sqlite.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5db9c9201f9a893918e5a0f0cb7c4398202fdeabafc4ce7a470e7c2e1d8003"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/extension.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc8b5029dbb478156d6749862314cbabce3ce52d2988b136edabc17ff9f77e2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/webview/graph.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67267135bc3f755f6bb2816169c2feb7ca6d048b30ee448d107bfd30349bc076"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/views/graphWebview.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"779f10f16a865b993aa6636ec5269223b2bfbbba9b13719c6c288a352c0e5f24"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/views/treeView.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b25543a7f396c4dbcd963ced7e453e9a4411ae8feca85f9a569c720aaeed51"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/views/treeItems.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3c0b981f7a0102b367eed0e6b6a9295b3b8f13b4af5ea58e4324a41422623a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/navigation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1405c7216cd994588dc632ec4fe1cb8ee120579da59017ce199346eea2846e10"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/scmDecorations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a415ae36c7dafe8685458f0a0300c348e2662809215a4b669a0216d4d4bc8eb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/search.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cbae11e3e275fc4c5e76c667ad2f344a040f5b376fb0c42880e28849bae297"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/reviewAssistant.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff534996971b5ae832447bcef80e773c10d443e107ce9c9530add29c99ff593"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/onboarding/installer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73446b9ca9472aca7742d482b8f27ea4fba4eca3d3ea075ced897ad10a6029c8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/onboarding/welcome.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f9662af95442ff88716696f2056105d72f074bb8126c17f30c1ab14c87c932"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/views/statusBar.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae2dc73cd0df715c16bfcd0dbf6706ea8ead5a48d194f6c0ed4cdbf62875ef5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/blastRadius.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c7cd92670542653959bdf8e435d1516e9a5ed7042994b693fd6496d1e9b5bc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/esbuild.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b3b18a2f0fcfebe407730e3b4170f043423c0432427215d0a2fd6a07138301"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/cursorResolver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d337cc4d44a39c470832869b4439179fb4791956ab8a529c0982f0c4e0804d56"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~196 LoC): no import path from any entry point (4 application, 0 tooling, 12 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/navigation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"607d52711351181b017f2e499d99e22b4a2fcc8ea8fdaa17dc3a43df45770b4b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~131 LoC): no import path from any entry point (4 application, 0 tooling, 12 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/search.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"520d642539efe4be5e48becbd65586c125c2a3aa02c7c67e17ade4a203ac66d9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~117 LoC): no import path from any entry point (4 application, 0 tooling, 12 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/reviewAssistant.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"008484d6f966063c77584c82259776f0178db312b1c1ebf6aaf0dd04f518720a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~70 LoC): no import path from any entry point (4 application, 0 tooling, 12 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/blastRadius.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf99e44b01efe71a94ed1956a3195668b916e3c9975f22662d5e676ca8ff71a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~60 LoC): no import path from any entry point (4 application, 0 tooling, 12 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/backend/watcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa449eda978f23d60560a86181c4417683a282599d60d4f714347e99aff6e97c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~37 LoC): no import path from any entry point (4 application, 0 tooling, 12 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (code-review-graph-vscode/src/features/blastRadius.ts, code-review-graph-vscode/src/features/navigation.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"code-review-graph-vscode/src/features/cursorResolver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e335ea95f11ccbea5b6c62f1d7fb26982db2ac9e2dd8b5972326db8bac5abfaa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022ambiguous_targets\u0022 in extra or \u0022unresolved_targets\u0022 in extra\u0060 appears character-identically in 2 files \u2014 code_review_graph/changes.py, code_review_graph/graph.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":"code_review_graph/changes.py"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"7250dff75693985d84c4413b4af0629006361551943e4bc8fb584e8610ce4cdd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(resolved / \u0022.git\u0022).exists() or (resolved / \u0022.svn\u0022).exists() or (resolved / \u0022.code-review-graph\u0022).exists()\u0060 appears character-identically in 3 files \u2014 code_review_graph/daemon.py, code_review_graph/registry.py, code_review_graph/tools/_common.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":"code_review_graph/daemon.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf977928965c770a0ec597497a03f3a22d66536fcfcca630b014883a915fdd9e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060alias.asname or alias.name.split(\u0022.\u0022, 1)[0]\u0060 appears character-identically in 3 files \u2014 code_review_graph/parser.py, code_review_graph/refactor.py, scripts/audit_python_imports.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":"code_review_graph/parser.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ca52cf695764b2a0666216344187dad99031c3908f1d2b8e9dc206b4c8d209"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cur.rowcount is not None and cur.rowcount \u003E= 0\u0060 appears character-identically in 2 files \u2014 code_review_graph/communities.py, code_review_graph/flows.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":"code_review_graph/communities.py"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9756f95b725af224a28dfb72fbabe5bfc273f7f48754d3ff28b15a935dd9ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060existing and not existing.endswith(\u0022\\n\u0022)\u0060 appears character-identically in 2 files \u2014 code_review_graph/incremental.py, code_review_graph/skills.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":"code_review_graph/incremental.py"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c441c8711bf0dba7e5d7ed5df85f73dcf874cab2cc48ab89a8f459e96098f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, bool) or not isinstance(value, int)\u0060 appears character-identically in 2 files \u2014 code_review_graph/context_history.py, scripts/render_pr_comment.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":"code_review_graph/context_history.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6c3f2142eec4fc03096c25ef871c8972cce0934c541f1ad2ccad67bad3c196"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name != \u0022all\u0022 and name not in DETAIL_SECTIONS\u0060 appears character-identically in 2 files \u2014 code_review_graph/change_details.py, scripts/render_pr_comment.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":"code_review_graph/change_details.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aff67871b2368efdab8d45e6341c86b5b4d9a409ee1ab0b9e25947547f31208"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not stripped or stripped.startswith(\u0022#\u0022)\u0060 appears character-identically in 2 files \u2014 code_review_graph/parser.py, code_review_graph/skills.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":"code_review_graph/parser.py"},"region":{"startLine":6301}}}],"partialFingerprints":{"codehealthFindingId/v1":"be82fcee885fccf699ada3d36cd6a602aa4c92d045a5c9967f2cc449deafb16d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._repo_root is not None and current == self._repo_root\u0060 appears character-identically in 2 files \u2014 code_review_graph/npm_alias_resolver.py, code_review_graph/parser.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":"code_review_graph/npm_alias_resolver.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ebdb526add9fcc095a313b69c48f5ee3e8683816a73912fae6d65bb45a3393"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060src_cid is not None and tgt_cid is not None and src_cid != tgt_cid\u0060 appears character-identically in 3 files \u2014 code_review_graph/analysis.py, code_review_graph/change_details.py, code_review_graph/visualization.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":"code_review_graph/analysis.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a94303765ea02485d24de9476886ca643e0b0dc145f1ed8fae406a0689e8d6c"}},{"ruleId":"X5","level":"note","message":{"text":"Nullable reference types not enabled everywhere: 0/1 NRT-eligible project(s) enable \u003CNullable\u003Eenable\u003C/Nullable\u003E (projects targeting a pre-C#-8 framework are excluded \u2014 NRTs aren\u0027t available there). NRTs catch a whole class of null-deref bugs at compile time."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"80b24de9378624a0ce4846d60457395befcaec8e109ea81d289a370c9f7bfd5d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_load_extra\u0060 returns \u0060{}\u0060 when \u0060(json.JSONDecodeError, TypeError)\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":"code_review_graph/aop_resolver.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ea0ed4633f6ff926b79090c2c1adf1c01f3059f3dc36012c0bf3341914b7ba"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_extra\u0060 returns \u0060{}\u0060 when \u0060(ValueError, TypeError)\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":"code_review_graph/csharp_resolver.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"132fb938e76c5a7b28ad9ef2a8e75e12639c3860d394483ea47e6491766180d4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_load_collision_extra\u0060 returns \u0060{}\u0060 when \u0060(TypeError, 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":"code_review_graph/graph.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6739cf74131810c0335048930b8cf2683bbe12080a0f64cdaebfdfaf5989a56"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_load_edge_extra\u0060 returns \u0060{}\u0060 when \u0060(TypeError, 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":"code_review_graph/graph.py"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe500c8e632c4fcbee74ec393323fd36394cb40fc3bb39ec77d140120c22de66"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_load_pending_paths\u0060 returns \u0060set()\u0060 when \u0060(TypeError, 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":"code_review_graph/incremental.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f7de10ad7a1413f14c0e855d13d418a6541ada83733b7adbc1b6c29ff971f2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_load_dependents_pending\u0060 returns \u0060set()\u0060 when \u0060(TypeError, 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":"code_review_graph/incremental.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f9df9de75819d40e6453186074daa4eb8df6da043ae50388e5cd5d41e565c0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060get_all_tracked_files\u0060 returns \u0060[]\u0060 when \u0060(FileNotFoundError, subprocess.TimeoutExpired, UnicodeDecodeError)\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":"code_review_graph/incremental.py"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"2111be7b5744486888189a387e86a9aaabc1e2848bf8e3d29f62cabf360cd621"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_load_extra\u0060 returns \u0060{}\u0060 when \u0060(TypeError, 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":"code_review_graph/inheritance.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9c054db94e439005b4df0305807bf72578eb3f9402ba12910f39eb046d3099"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_edge_extra\u0060 returns \u0060{}\u0060 when \u0060(TypeError, 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":"code_review_graph/jedi_resolver.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cfad227756cbc4a1732ccb9d1a9f9962ee8be4f857246c9ee4abf7ee52abbe"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_aliases_for_file\u0060 returns \u0060{}\u0060 when \u0060(OSError, ValueError, 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":"code_review_graph/npm_alias_resolver.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b95ccb06ba0fa93f916c9f5537f9f67d7965627f3ff3d30b6cd43f3afd83e95"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_python_module_property_return_annotations\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":"code_review_graph/parser.py"},"region":{"startLine":9746}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f20b254abd8ddab178acfbf4ca24f4353080ca1f2a636518a84cb654e02661"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_python_module_class_identities\u0060 returns \u0060{}\u0060 when \u0060(OSError, RuntimeError, 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":"code_review_graph/parser.py"},"region":{"startLine":9778}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bd9a35407ff47e2d143843d8d2de53d99f17cf422254d41f8356146eff999a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_python_module_return_annotations\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":"code_review_graph/parser.py"},"region":{"startLine":10397}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d36e0c54fa86b67894b0b070d6112bf2df8c7e85939346419ff6544527c490"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_get_python_star_exports\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":"code_review_graph/parser.py"},"region":{"startLine":20173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef10515d9023f15b21938361ccf7261123c9aac507a1a477c1e766b1e6f2ee34"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_extract_python_dunder_all\u0060 returns \u0060set()\u0060 when \u0060(SyntaxError, 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":"code_review_graph/parser.py"},"region":{"startLine":20282}}}],"partialFingerprints":{"codehealthFindingId/v1":"159aeec1d310bc4402000e1535d1546d1a941c81787f06ae705269169ed02e62"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_rust_current_module_parts\u0060 returns \u0060[]\u0060 when \u0060(OSError, RuntimeError, 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":"code_review_graph/parser.py"},"region":{"startLine":22372}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf40d2a2ea60c1d468242331afc4def157fceb66ba50c0980c0c73d7a578acd1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_load_cargo_manifest\u0060 returns \u0060{}\u0060 when \u0060(OSError, RuntimeError, 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":"code_review_graph/parser.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da772f6d33ea22ce11298e8e538f2102bda1afebd3060888fb2309b003d1608"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_python_function_scope_bindings\u0060 returns \u0060{}\u0060 when \u0060(SyntaxError, UnicodeDecodeError, 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":"code_review_graph/parser.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda5ae03672c336bf483d1f95a91853b1dff03ae04a6f9fd7badf589ae2bfc85"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_python_unreachable_call_positions\u0060 returns \u0060frozenset()\u0060 when \u0060(SyntaxError, UnicodeDecodeError, 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":"code_review_graph/parser.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6f56c17d1e42a842425ddcfd02205ee16c1d9e863788cceb4a39540c405488"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_python_unreachable_import_positions\u0060 returns \u0060frozenset()\u0060 when \u0060(SyntaxError, UnicodeDecodeError, 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":"code_review_graph/parser.py"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"75384244c38d086b2d4b1aaa02f0c3e7752d60e283a19d6e57dcca45c27383a5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_read_php_composer_psr4\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":"code_review_graph/parser.py"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"459afa7287ee591c58a212a5b37e43484fb3428e9bb317d9445065196221541b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_resolved_dir\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(OSError, ValueError, 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":"code_review_graph/parser.py"},"region":{"startLine":2531}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffb7901bf5658b6baf0deac22a3e9bd23ad9b8f4a8b0e3bf34c5d58eb4c0b2f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060build_log_counters\u0060 returns \u0060{}\u0060 when \u0060(SyntaxError, 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":"scripts/audit_python_imports.py"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f067134ff3b0b3cec95e548d33079c27972ce9ef176cbdb8903e44598d929b3"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060n.name.startswith(\u0022describe:\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060n.name.startswith(\u0022describe:\u0022)\u0060 also satisfies \u0060n.name.startswith(\u0022describe\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_parser.py"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"73952c0bc4cfa273d84e445455313578f1cf6d967936451ebcea6acff2fd1b2b"}}],"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-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-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-807","guid":"7b9d7bab-2171-935b-9279-889089164770","name":"Reliance on Untrusted Inputs in a Security Decision","shortDescription":{"text":"Reliance on Untrusted Inputs in a Security Decision"},"helpUri":"https://cwe.mitre.org/data/definitions/807.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-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.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":"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-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"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":102,"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."]}]}